npm - @stacks/profile - Versions diffs - 7.1.2-pr.0 → 7.1.2-pr.2 - Mend

@stacks/profile 7.1.2-pr.0 → 7.1.2-pr.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 (2) hide show

package/dist/umd/index.js.map +1 -1
package/package.json +5 -5

package/dist/umd/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAuB,cAAID,IAE3BD,EAAoB,cAAIC,GACzB,CATD,CASGK,MAAM,cCRLC,EADAC,8BCGJ,SAASC,EAAOC,GACZ,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAM,IAAIG,MAAM,2BAA2BH,IACnD,CAEA,SAASI,EAAKC,GACV,GAAiB,kBAANA,EACP,MAAM,IAAIF,MAAM,yBAAyBE,IACjD,CAEA,SAASC,EAAMD,KAAME,GACjB,KAAMF,aAAaG,YACf,MAAM,IAAIC,UAAU,uBACxB,GAAIF,EAAQG,OAAS,IAAMH,EAAQI,SAASN,EAAEK,QAC1C,MAAM,IAAID,UAAU,iCAAiCF,oBAA0BF,EAAEK,SACzF,CAEA,SAASE,EAAKA,GACV,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAM,IAAIV,MAAM,mDACpBJ,EAAOa,EAAKE,WACZf,EAAOa,EAAKG,SAChB,CAEA,SAASC,EAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIhB,MAAM,oCACpB,GAAIe,GAAiBD,EAASG,SAC1B,MAAM,IAAIjB,MAAM,wCACxB,CAEA,SAASkB,EAAOC,EAAKL,GACjBX,EAAMgB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAM,IAAIpB,MAAM,yDAAyDoB,IAEjF,CAvCAC,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ6B,OAAS7B,EAAQwB,OAASxB,EAAQoB,KAAOpB,EAAQc,MAAQd,EAAQY,KAAOZ,EAAQO,YAAS,EAKjGP,EAAQO,OAASA,EAKjBP,EAAQY,KAAOA,EAOfZ,EAAQc,MAAQA,EAOhBd,EAAQoB,KAAOA,EAOfpB,EAAQwB,OAASA,EAQjBxB,EAAQ6B,OAASA,EACjB,MAAMM,EAAS,CACX5B,SACAK,OACAE,QACAM,OACAI,SACAK,UAEJ7B,EAAA,QAAkBmC,8BCjDlBH,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQoC,UAAO,EACf,MAAMC,EAAe,EAAQ,KACvBC,EAAa,EAAQ,IAe3B,MAAMF,UAAaE,EAAWC,KAC1B,WAAAC,CAAYjB,EAAUD,EAAWmB,EAAWC,GACxCC,QACAvC,KAAKmB,SAAWA,EAChBnB,KAAKkB,UAAYA,EACjBlB,KAAKqC,UAAYA,EACjBrC,KAAKsC,KAAOA,EACZtC,KAAKwB,UAAW,EAChBxB,KAAKc,OAAS,EACdd,KAAKwC,IAAM,EACXxC,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAS,IAAI7B,WAAWO,GAC7BnB,KAAK0C,MAAO,EAAIR,EAAWS,YAAY3C,KAAKyC,OAChD,CACA,MAAAG,CAAOC,GACHZ,EAAaa,QAAQ1B,OAAOpB,MAC5B,MAAM,KAAE0C,EAAI,OAAED,EAAM,SAAEtB,GAAanB,KAE7B+C,GADNF,GAAO,EAAIX,EAAWc,SAASH,IACd/B,OACjB,IAAK,IAAI0B,EAAM,EAAGA,EAAMO,GAAM,CAC1B,MAAME,EAAOC,KAAKvB,IAAIR,EAAWnB,KAAKwC,IAAKO,EAAMP,GAEjD,GAAIS,IAAS9B,EAMbsB,EAAOU,IAAIN,EAAKO,SAASZ,EAAKA,EAAMS,GAAOjD,KAAKwC,KAChDxC,KAAKwC,KAAOS,EACZT,GAAOS,EACHjD,KAAKwC,MAAQrB,IACbnB,KAAKqD,QAAQX,EAAM,GACnB1C,KAAKwC,IAAM,OAXf,CACI,MAAMc,GAAW,EAAIpB,EAAWS,YAAYE,GAC5C,KAAO1B,GAAY4B,EAAMP,EAAKA,GAAOrB,EACjCnB,KAAKqD,QAAQC,EAAUd,EAE/B,CAQJ,CAGA,OAFAxC,KAAKc,QAAU+B,EAAK/B,OACpBd,KAAKuD,aACEvD,IACX,CACA,UAAAwD,CAAW9B,GACPO,EAAaa,QAAQ1B,OAAOpB,MAC5BiC,EAAaa,QAAQrB,OAAOC,EAAK1B,MACjCA,KAAKwB,UAAW,EAIhB,MAAM,OAAEiB,EAAM,KAAEC,EAAI,SAAEvB,EAAQ,KAAEmB,GAAStC,KACzC,IAAI,IAAEwC,GAAQxC,KAEdyC,EAAOD,KAAS,IAChBxC,KAAKyC,OAAOW,SAASZ,GAAKiB,KAAK,GAE3BzD,KAAKqC,UAAYlB,EAAWqB,IAC5BxC,KAAKqD,QAAQX,EAAM,GACnBF,EAAM,GAGV,IAAK,IAAIkB,EAAIlB,EAAKkB,EAAIvC,EAAUuC,IAC5BjB,EAAOiB,GAAK,GAxExB,SAAsBhB,EAAMiB,EAAY7B,EAAOQ,GAC3C,GAAiC,mBAAtBI,EAAKkB,aACZ,OAAOlB,EAAKkB,aAAaD,EAAY7B,EAAOQ,GAChD,MAAMuB,EAAOC,OAAO,IACdC,EAAWD,OAAO,YAClBE,EAAK3D,OAAQyB,GAAS+B,EAAQE,GAC9BE,EAAK5D,OAAOyB,EAAQiC,GACpBG,EAAI5B,EAAO,EAAI,EACf6B,EAAI7B,EAAO,EAAI,EACrBI,EAAK0B,UAAUT,EAAaO,EAAGF,EAAI1B,GACnCI,EAAK0B,UAAUT,EAAaQ,EAAGF,EAAI3B,EACvC,CAiEQsB,CAAalB,EAAMvB,EAAW,EAAG2C,OAAqB,EAAd9D,KAAKc,QAAawB,GAC1DtC,KAAKqD,QAAQX,EAAM,GACnB,MAAM2B,GAAQ,EAAInC,EAAWS,YAAYjB,GACnCqB,EAAM/C,KAAKkB,UAEjB,GAAI6B,EAAM,EACN,MAAM,IAAIxC,MAAM,+CACpB,MAAM+D,EAASvB,EAAM,EACfwB,EAAQvE,KAAKwE,MACnB,GAAIF,EAASC,EAAMzD,OACf,MAAM,IAAIP,MAAM,sCACpB,IAAK,IAAImD,EAAI,EAAGA,EAAIY,EAAQZ,IACxBW,EAAMD,UAAU,EAAIV,EAAGa,EAAMb,GAAIpB,EACzC,CACA,MAAAmC,GACI,MAAM,OAAEhC,EAAM,UAAEvB,GAAclB,KAC9BA,KAAKwD,WAAWf,GAChB,MAAMiC,EAAMjC,EAAOkC,MAAM,EAAGzD,GAE5B,OADAlB,KAAK4E,UACEF,CACX,CACA,UAAAG,CAAWC,GACPA,IAAOA,EAAK,IAAI9E,KAAKoC,aACrB0C,EAAG3B,OAAOnD,KAAKwE,OACf,MAAM,SAAErD,EAAQ,OAAEsB,EAAM,OAAE3B,EAAM,SAAEU,EAAQ,UAAED,EAAS,IAAEiB,GAAQxC,KAO/D,OANA8E,EAAGhE,OAASA,EACZgE,EAAGtC,IAAMA,EACTsC,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACXT,EAASK,GACT2D,EAAGrC,OAAOU,IAAIV,GACXqC,CACX,EAEJlF,EAAQoC,KAAOA,4BCnHfJ,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQmF,YAAS,EACjBnF,EAAQmF,OAAS,CACbC,UAAMC,EACNC,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,+BCJtErD,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQwF,UAAO,EACf,MAAMnD,EAAe,EAAQ,KACvBC,EAAa,EAAQ,IAE3B,MAAMmD,UAAanD,EAAWC,KAC1B,WAAAC,CAAYpB,EAAMsE,GACd/C,QACAvC,KAAKwB,UAAW,EAChBxB,KAAKuB,WAAY,EACjBU,EAAaa,QAAQ9B,KAAKA,GAC1B,MAAMuE,GAAM,EAAIrD,EAAWc,SAASsC,GAEpC,GADAtF,KAAKwF,MAAQxE,EAAKC,SACe,mBAAtBjB,KAAKwF,MAAM5C,OAClB,MAAM,IAAI/B,UAAU,uDACxBb,KAAKmB,SAAWnB,KAAKwF,MAAMrE,SAC3BnB,KAAKkB,UAAYlB,KAAKwF,MAAMtE,UAC5B,MAAMC,EAAWnB,KAAKmB,SAChBsE,EAAM,IAAI7E,WAAWO,GAE3BsE,EAAItC,IAAIoC,EAAIzE,OAASK,EAAWH,EAAKC,SAAS2B,OAAO2C,GAAKd,SAAWc,GACrE,IAAK,IAAI7B,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,GACd1D,KAAKwF,MAAM5C,OAAO6C,GAElBzF,KAAK0F,MAAQ1E,EAAKC,SAElB,IAAK,IAAIyC,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,IACd1D,KAAK0F,MAAM9C,OAAO6C,GAClBA,EAAIhC,KAAK,EACb,CACA,MAAAb,CAAO+C,GAGH,OAFA1D,EAAaa,QAAQ1B,OAAOpB,MAC5BA,KAAKwF,MAAM5C,OAAO+C,GACX3F,IACX,CACA,UAAAwD,CAAW9B,GACPO,EAAaa,QAAQ1B,OAAOpB,MAC5BiC,EAAaa,QAAQpC,MAAMgB,EAAK1B,KAAKkB,WACrClB,KAAKwB,UAAW,EAChBxB,KAAKwF,MAAMhC,WAAW9B,GACtB1B,KAAK0F,MAAM9C,OAAOlB,GAClB1B,KAAK0F,MAAMlC,WAAW9B,GACtB1B,KAAK4E,SACT,CACA,MAAAH,GACI,MAAM/C,EAAM,IAAId,WAAWZ,KAAK0F,MAAMxE,WAEtC,OADAlB,KAAKwD,WAAW9B,GACTA,CACX,CACA,UAAAmD,CAAWC,GAEPA,IAAOA,EAAKlD,OAAOX,OAAOW,OAAOgE,eAAe5F,MAAO,CAAC,IACxD,MAAM,MAAE0F,EAAK,MAAEF,EAAK,SAAEhE,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAclB,KAQnE,OANA8E,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACfuD,EAAG3D,SAAWA,EACd2D,EAAG5D,UAAYA,EACf4D,EAAGY,MAAQA,EAAMb,WAAWC,EAAGY,OAC/BZ,EAAGU,MAAQA,EAAMX,WAAWC,EAAGU,OACxBV,CACX,CACA,OAAAF,GACI5E,KAAKuB,WAAY,EACjBvB,KAAK0F,MAAMd,UACX5E,KAAKwF,MAAMZ,SACf,EASJhF,EAAQwF,KADK,CAACpE,EAAMuE,EAAKM,IAAY,IAAIR,EAAKrE,EAAMuE,GAAK3C,OAAOiD,GAASpB,SAEzE7E,EAAQwF,KAAKnE,OAAS,CAACD,EAAMuE,IAAQ,IAAIF,EAAKrE,EAAMuE,8BC9EpD3D,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQkG,OAASlG,EAAQmG,YAAS,EAClC,MAAMC,EAAa,EAAQ,KACrB9D,EAAa,EAAQ,IAIrB+D,EAAM,CAACC,EAAGzF,EAAG0F,IAAOD,EAAIzF,EAAMyF,EAAIC,EAAM1F,EAAI0F,EAI5CC,EAAW,IAAIC,YAAY,CAC7B,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlFC,EAAK,IAAID,YAAY,CACvB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlFE,EAAW,IAAIF,YAAY,IACjC,MAAMG,UAAeR,EAAWhE,KAC5B,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GAGjBvC,KAAKyG,EAAY,EAARH,EAAG,GACZtG,KAAK0G,EAAY,EAARJ,EAAG,GACZtG,KAAK2G,EAAY,EAARL,EAAG,GACZtG,KAAK4G,EAAY,EAARN,EAAG,GACZtG,KAAK6G,EAAY,EAARP,EAAG,GACZtG,KAAK8G,EAAY,EAARR,EAAG,GACZtG,KAAK+G,EAAY,EAART,EAAG,GACZtG,KAAKgH,EAAY,EAARV,EAAG,EAChB,CACA,GAAA9B,GACI,MAAM,EAAEiC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACnC,MAAO,CAACyG,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAA7D,CAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBhH,KAAKyG,EAAQ,EAAJA,EACTzG,KAAK0G,EAAQ,EAAJA,EACT1G,KAAK2G,EAAQ,EAAJA,EACT3G,KAAK4G,EAAQ,EAAJA,EACT5G,KAAK6G,EAAQ,EAAJA,EACT7G,KAAK8G,EAAQ,EAAJA,EACT9G,KAAK+G,EAAQ,EAAJA,EACT/G,KAAKgH,EAAQ,EAAJA,CACb,CACA,OAAA3D,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCV,EAAS7C,GAAKhB,EAAKwE,UAAUD,GAAQ,GACzC,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyD,EAAMZ,EAAS7C,EAAI,IACnB0D,EAAKb,EAAS7C,EAAI,GAClB2D,GAAK,EAAInF,EAAWoF,MAAMH,EAAK,IAAK,EAAIjF,EAAWoF,MAAMH,EAAK,IAAOA,IAAQ,EAC7EI,GAAK,EAAIrF,EAAWoF,MAAMF,EAAI,KAAM,EAAIlF,EAAWoF,MAAMF,EAAI,IAAOA,IAAO,GACjFb,EAAS7C,GAAM6D,EAAKhB,EAAS7C,EAAI,GAAK2D,EAAKd,EAAS7C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE+C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACjC,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM8D,EAAMR,IADG,EAAI9E,EAAWoF,MAAMT,EAAG,IAAK,EAAI3E,EAAWoF,MAAMT,EAAG,KAAM,EAAI3E,EAAWoF,MAAMT,EAAG,OAnEjGX,EAoE4BW,GAAGC,GApEPZ,EAoEUa,GAAKX,EAAS1C,GAAK6C,EAAS7C,GAAM,EAE/D+D,IADS,EAAIvF,EAAWoF,MAAMb,EAAG,IAAK,EAAIvE,EAAWoF,MAAMb,EAAG,KAAM,EAAIvE,EAAWoF,MAAMb,EAAG,KAC7ER,EAAIQ,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIY,EAAM,EACfZ,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKe,EAAKC,EAAM,CACpB,CA/EI,IAACvB,EAiFLO,EAAKA,EAAIzG,KAAKyG,EAAK,EACnBC,EAAKA,EAAI1G,KAAK0G,EAAK,EACnBC,EAAKA,EAAI3G,KAAK2G,EAAK,EACnBC,EAAKA,EAAI5G,KAAK4G,EAAK,EACnBC,EAAKA,EAAI7G,KAAK6G,EAAK,EACnBC,EAAKA,EAAI9G,KAAK8G,EAAK,EACnBC,EAAKA,EAAI/G,KAAK+G,EAAK,EACnBC,EAAKA,EAAIhH,KAAKgH,EAAK,EACnBhH,KAAKmD,IAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzD,GACIgD,EAAS9C,KAAK,EAClB,CACA,OAAAmB,GACI5E,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BnD,KAAKyC,OAAOgB,KAAK,EACrB,EAGJ,MAAMiE,UAAelB,EACjB,WAAApE,GACIG,QACAvC,KAAKyG,GAAI,WACTzG,KAAK0G,EAAI,UACT1G,KAAK2G,EAAI,UACT3G,KAAK4G,GAAI,UACT5G,KAAK6G,GAAI,QACT7G,KAAK8G,EAAI,WACT9G,KAAK+G,EAAI,WACT/G,KAAKgH,GAAI,WACThH,KAAKkB,UAAY,EACrB,EAMJtB,EAAQmG,QAAS,EAAI7D,EAAWyF,kBAAiB,IAAM,IAAInB,IAC3D5G,EAAQkG,QAAS,EAAI5D,EAAWyF,kBAAiB,IAAM,IAAID,+BC3H3D9F,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgI,YAAchI,EAAQiI,wBAA0BjI,EAAQ+H,gBAAkB/H,EAAQkI,UAAYlI,EAAQuC,KAAOvC,EAAQmI,YAAcnI,EAAQoD,QAAUpD,EAAQoI,YAAcpI,EAAQqI,UAAYrI,EAAQsI,SAAWtI,EAAQuI,WAAavI,EAAQwI,WAAaxI,EAAQ0C,KAAO1C,EAAQ0H,KAAO1H,EAAQ+C,WAAa/C,EAAQyI,IAAMzI,EAAQ0I,QAAK,EAGlV,MAAMC,EAAW,EAAQ,KAezB,GAZA3I,EAAQ0I,GADIE,GAAQ,IAAI5H,WAAW4H,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,YAGnE7I,EAAQyI,IADKG,GAAQ,IAAInC,YAAYmC,EAAI/F,OAAQ+F,EAAI7E,WAAYT,KAAKwF,MAAMF,EAAIC,WAAa,IAI7F7I,EAAQ+C,WADY6F,GAAQ,IAAIG,SAASH,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,YAIzE7I,EAAQ0H,KADK,CAACsB,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAEjEjJ,EAAQ0C,KAAmE,KAA5D,IAAI1B,WAAW,IAAIyF,YAAY,CAAC,YAAa5D,QAAQ,IAG/D7C,EAAQ0C,KACT,MAAM,IAAI/B,MAAM,+CACpB,MAAMuI,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAsD/E,SAASnB,EAAYoB,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIvI,UAAU,2CAA2CuI,GAEnE,OAAO,IAAIC,aAAcC,OAAOF,EACpC,CAEA,SAASpG,EAAQH,GAGb,GAFoB,iBAATA,IACPA,EAAOmF,EAAYnF,MACjBA,aAAgBjC,YAClB,MAAM,IAAIC,UAAU,iDAAiDgC,MACzE,OAAOA,CACX,CArDAjD,EAAQwI,WAVR,SAAoBmB,GAEhB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAOV,EAAMS,EAAO7F,IAExB,OAAO8F,CACX,EAsBA5J,EAAQuI,WAjBR,SAAoBqB,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,6CACpB,MAAMkJ,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,EAKA7J,EAAQsI,SADS6B,YAejBnK,EAAQqI,UAZR8B,eAAyBC,EAAOC,EAAMC,GAClC,IAAIC,EAAKC,KAAKC,MACd,IAAK,IAAI3G,EAAI,EAAGA,EAAIsG,EAAOtG,IAAK,CAC5BwG,EAAGxG,GAEH,MAAM4G,EAAOF,KAAKC,MAAQF,EACtBG,GAAQ,GAAKA,EAAOL,UAElB,EAAIrK,EAAQsI,YAClBiC,GAAMG,EACV,CACJ,EAQA1K,EAAQoI,YAAcA,EAQtBpI,EAAQoD,QAAUA,EAmBlBpD,EAAQmI,YAdR,YAAwBwC,GACpB,IAAKA,EAAOC,OAAOtE,GAAMA,aAAatF,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,EASA9K,EAAQuC,KANR,MAEI,KAAAwI,GACI,OAAO3K,KAAK6E,YAChB,GAWJjF,EAAQkI,UANR,SAAmB8C,EAAUC,GACzB,QAAa5F,IAAT4F,IAAuC,iBAATA,IAFfC,EAEmDD,EAFH,oBAAxCjJ,OAAOmJ,UAAU7B,SAAS8B,KAAKF,IAA8BA,EAAI1I,cAAgBR,SAGxG,MAAM,IAAIf,UAAU,yCAHN,IAACiK,EAKnB,OADelJ,OAAOqJ,OAAOL,EAAUC,EAE3C,EAUAjL,EAAQ+H,gBARR,SAAyBuD,GACrB,MAAMC,EAAStF,GAAYqF,IAAkBtI,OAAOI,EAAQ6C,IAAUpB,SAChE2G,EAAMF,IAIZ,OAHAC,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAS,IAAMiK,IACdC,CACX,EAUAvL,EAAQiI,wBARR,SAAiCwD,GAC7B,MAAMF,EAAQ,CAACG,EAAKT,IAASQ,EAASR,GAAMjI,OAAOI,EAAQsI,IAAM7G,SAC3D2G,EAAMC,EAAS,CAAC,GAItB,OAHAF,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAU4J,GAASQ,EAASR,GAC3BM,CACX,EAgBAvL,EAAQgI,YAXR,SAAqB2D,EAAc,IAC/B,GAAIhD,EAASxD,OAAOG,IAChB,OAAOqD,EAASxD,OAAOG,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEzD,GAAIhD,EAASxD,OAAOC,KACrB,OAAO,IAAIpE,WAAW2H,EAASxD,OAAOC,KAAK4C,YAAY2D,GAAa9I,QAGpE,MAAM,IAAIlC,MAAM,oDAExB,8BC7JAqB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ6L,MAAQ7L,EAAQ8L,QAAU9L,EAAQ+L,OAAS/L,EAAQgM,SAAWhM,EAAQiM,KAAOjM,EAAQkM,gBAAkBlM,EAAQmM,iBAAmBnM,EAAQoM,aAAepM,EAAQqM,UAAYrM,EAAQsM,MAAQtM,EAAQuM,WAAQ,EACrN,MAAMC,EAAa,EAAQ,KACrBC,EAAMvI,OAAO,GACbwI,EAAMxI,OAAO,GACbyI,EAAMzI,OAAO,GACb0I,EAAM1I,OAAO,GACb2I,EAAM3I,OAAO,GACbqI,EAAQvK,OAAO8K,OAAO,CACxBxG,EAAGmG,EACH5L,EAAGqD,OAAO,GACV6I,EAAG7I,OAAO,sEACV1D,EAAG0D,OAAO,sEACVI,EAAGoI,EACHM,GAAI9I,OAAO,iFACX+I,GAAI/I,OAAO,iFACXgJ,KAAMhJ,OAAO,wEAEjBlE,EAAQuM,MAAQA,EAChB,MAAMY,EAAa,CAAC7G,EAAGzF,KAAOyF,EAAIzF,EAAI8L,GAAO9L,EACvCuM,EAAO,CACTF,KAAMhJ,OAAO,sEACb,WAAAmJ,CAAYC,GACR,MAAM,EAAE9M,GAAM+L,EACRgB,EAAKrJ,OAAO,sCACZsJ,GAAMd,EAAMxI,OAAO,sCACnBuJ,EAAKvJ,OAAO,uCACZwJ,EAAKH,EACLI,EAAYzJ,OAAO,uCACnB0J,EAAKT,EAAWO,EAAKJ,EAAG9M,GACxBqN,EAAKV,GAAYK,EAAKF,EAAG9M,GAC/B,IAAIsN,EAAKC,EAAIT,EAAIM,EAAKL,EAAKM,EAAKJ,EAAIjN,GAChCwN,EAAKD,GAAKH,EAAKJ,EAAKK,EAAKH,EAAIlN,GACjC,MAAMyN,EAAQH,EAAKH,EACbO,EAAQF,EAAKL,EAKnB,GAJIM,IACAH,EAAKtN,EAAIsN,GACTI,IACAF,EAAKxN,EAAIwN,GACTF,EAAKH,GAAaK,EAAKL,EACvB,MAAM,IAAIhN,MAAM,2CAA6C2M,GAEjE,MAAO,CAAEW,QAAOH,KAAII,QAAOF,KAC/B,GAEEG,EAAW,GACXC,EAAW,GAEXC,EAAgBF,EAAW,EAC3BG,EAAkB,EAAIH,EAAW,EACvC,SAASI,EAAYC,GACjB,MAAM,EAAElI,EAAC,EAAEzF,GAAM0L,EACXkC,EAAKV,EAAIS,EAAIA,GACbE,EAAKX,EAAIU,EAAKD,GACpB,OAAOT,EAAIW,EAAKpI,EAAIkI,EAAI3N,EAC5B,CACA,MAAM8N,EAAmBpC,EAAMjG,IAAMmG,EACrC,MAAMmC,UAAiBjO,MACnB,WAAA6B,CAAYyD,GACRtD,MAAMsD,EACV,EAEJ,SAAS4I,EAAeC,GACpB,KAAMA,aAAiBC,GACnB,MAAM,IAAI9N,UAAU,yBAC5B,CACA,MAAM8N,EACF,WAAAvM,CAAYgM,EAAGQ,EAAGC,GACd7O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,EACT5O,KAAK6O,EAAIA,CACb,CACA,iBAAOC,CAAWC,GACd,KAAMA,aAAa7C,GACf,MAAM,IAAIrL,UAAU,4CAExB,OAAIkO,EAAEC,OAAO9C,EAAM+C,MACRN,EAAcM,KAClB,IAAIN,EAAcI,EAAEX,EAAGW,EAAEH,EAAGtC,EACvC,CACA,oBAAO4C,CAAcC,GACjB,MAAMC,EAokBd,SAAqBC,EAAMN,EAAI5C,EAAMQ,GACjC,MAAM2C,EAAU,IAAIvG,MAAMsG,EAAKvO,QAOzByO,EAAWC,EANMH,EAAK5E,QAAO,CAACgF,EAAKC,EAAKhM,IACtCgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAK+L,EACN9B,EAAI8B,EAAMC,EAAKX,KACvBzC,GACqCyC,GAOxC,OANAM,EAAKM,aAAY,CAACF,EAAKC,EAAKhM,IACpBgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAKiK,EAAI8B,EAAMH,EAAQ5L,GAAIqL,GAC5BpB,EAAI8B,EAAMC,EAAKX,KACvBQ,GACID,CACX,CAplBsBM,CAAYT,EAAOU,KAAKd,GAAMA,EAAEF,KAC9C,OAAOM,EAAOU,KAAI,CAACd,EAAGrL,IAAMqL,EAAEe,SAASV,EAAM1L,KACjD,CACA,iBAAOqM,CAAWZ,GACd,OAAOR,EAAcO,cAAcC,GAAQU,IAAIlB,EAAcG,WACjE,CACA,MAAAE,CAAON,GACHD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAC1B4B,EAAO3C,EAAIuC,EAAKA,GAChBK,EAAO5C,EAAI0C,EAAKA,GAChBG,EAAK7C,EAAIqC,EAAKO,GACdE,EAAK9C,EAAIwC,EAAKG,GACdI,EAAK/C,EAAIA,EAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,EAAIA,EAAIyC,EAAKF,GAAMI,GAC9B,OAAOE,IAAOC,GAAMC,IAAOC,CAC/B,CACA,MAAAC,GACI,OAAO,IAAIjC,EAAc3O,KAAKoO,EAAGT,GAAK3N,KAAK4O,GAAI5O,KAAK6O,EACxD,CACA,MAAAgC,GACI,MAAQzC,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,KAC1ByG,EAAIkH,EAAIqC,EAAKA,GACbtJ,EAAIiH,EAAIsC,EAAKA,GACbtJ,EAAIgH,EAAIjH,EAAIA,GACZoK,EAAMd,EAAKtJ,EACXE,EAAI+G,EAAIpB,GAAOoB,EAAImD,EAAMA,GAAOrK,EAAIE,IACpCE,EAAI8G,EAAInB,EAAM/F,GACdK,EAAI6G,EAAI9G,EAAIA,GACZkK,EAAKpD,EAAI7G,EAAIyF,EAAM3F,GACnBoK,EAAKrD,EAAI9G,GAAKD,EAAImK,GAAMtE,EAAM9F,GAC9BsK,EAAKtD,EAAIpB,EAAM0D,EAAKC,GAC1B,OAAO,IAAIvB,EAAcoC,EAAIC,EAAIC,EACrC,CACA,GAAAC,CAAIxC,GACAD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAChC,GAAIyB,IAAO9D,GAAO+D,IAAO/D,EACrB,OAAOrM,KACX,GAAIgQ,IAAO3D,GAAO4D,IAAO5D,EACrB,OAAOqC,EACX,MAAM4B,EAAO3C,EAAIuC,EAAKA,GAChBK,EAAO5C,EAAI0C,EAAKA,GAChBG,EAAK7C,EAAIqC,EAAKO,GACdE,EAAK9C,EAAIwC,EAAKG,GACdI,EAAK/C,EAAIA,EAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,EAAIA,EAAIyC,EAAKF,GAAMI,GACxBtJ,EAAI2G,EAAI8C,EAAKD,GACbW,EAAIxD,EAAIgD,EAAKD,GACnB,GAAI1J,IAAMqF,EACN,OAAI8E,IAAM9E,EACCrM,KAAK6Q,SAGLlC,EAAcM,KAG7B,MAAMmC,EAAKzD,EAAI3G,EAAIA,GACbqK,EAAM1D,EAAI3G,EAAIoK,GACdE,EAAI3D,EAAI6C,EAAKY,GACbL,EAAKpD,EAAIwD,EAAIA,EAAIE,EAAM9E,EAAM+E,GAC7BN,EAAKrD,EAAIwD,GAAKG,EAAIP,GAAML,EAAKW,GAC7BJ,EAAKtD,EAAIuC,EAAKG,EAAKrJ,GACzB,OAAO,IAAI2H,EAAcoC,EAAIC,EAAIC,EACrC,CACA,QAAAM,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,cAAAY,CAAeC,GACX,MAAMC,EAAK/C,EAAcM,KACzB,GAAsB,iBAAXwC,GAAuBA,IAAWpF,EACzC,OAAOqF,EACX,IAAItR,EAAIuR,EAAgBF,GACxB,GAAIrR,IAAMkM,EACN,OAAOtM,KACX,IAAKuO,EAAkB,CACnB,IAAIQ,EAAI2C,EACJE,EAAI5R,KACR,KAAOI,EAAIiM,GACHjM,EAAIkM,IACJyC,EAAIA,EAAEmC,IAAIU,IACdA,EAAIA,EAAEf,SACNzQ,IAAMkM,EAEV,OAAOyC,CACX,CACA,IAAI,MAAElB,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAC5CyR,EAAMH,EACNI,EAAMJ,EACNE,EAAI5R,KACR,KAAO0N,EAAKrB,GAAOuB,EAAKvB,GAChBqB,EAAKpB,IACLuF,EAAMA,EAAIX,IAAIU,IACdhE,EAAKtB,IACLwF,EAAMA,EAAIZ,IAAIU,IAClBA,EAAIA,EAAEf,SACNnD,IAAOpB,EACPsB,IAAOtB,EAOX,OALIuB,IACAgE,EAAMA,EAAIjB,UACV9C,IACAgE,EAAMA,EAAIlB,UACdkB,EAAM,IAAInD,EAAchB,EAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GACpDgD,EAAIX,IAAIY,EACnB,CACA,gBAAAC,CAAiBC,GACb,MAAMC,EAAU1D,EAAmB,IAAMyD,EAAI,EAAI,IAAMA,EAAI,EACrD7C,EAAS,GACf,IAAIJ,EAAI/O,KACJkS,EAAOnD,EACX,IAAK,IAAIoD,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7CD,EAAOnD,EACPI,EAAOiD,KAAKF,GACZ,IAAK,IAAIxO,EAAI,EAAGA,EAAI,IAAMsO,EAAI,GAAItO,IAC9BwO,EAAOA,EAAKhB,IAAInC,GAChBI,EAAOiD,KAAKF,GAEhBnD,EAAImD,EAAKrB,QACb,CACA,OAAO1B,CACX,CACA,IAAAkD,CAAKjS,EAAGkS,IACCA,GAAetS,KAAKgP,OAAOL,EAAc4D,QAC1CD,EAAcpG,EAAMqG,MACxB,MAAMP,EAAKM,GAAeA,EAAYE,cAAiB,EACvD,GAAI,IAAMR,EACN,MAAM,IAAIzR,MAAM,iEAEpB,IAAIkS,EAAcH,GAAeI,EAAiBlO,IAAI8N,GACjDG,IACDA,EAAczS,KAAK+R,iBAAiBC,GAChCM,GAAqB,IAANN,IACfS,EAAc9D,EAAcoB,WAAW0C,GACvCC,EAAiBvP,IAAImP,EAAaG,KAG1C,IAAI1D,EAAIJ,EAAcM,KAClB0D,EAAIhE,EAAc4D,KACtB,MAAMN,EAAU,GAAK1D,EAAmB,IAAMyD,EAAI,IAAMA,GAClDY,EAAa,IAAMZ,EAAI,GACvBa,EAAO/O,OAAO,GAAKkO,EAAI,GACvBc,EAAY,GAAKd,EACjBe,EAAUjP,OAAOkO,GACvB,IAAK,IAAIG,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7C,MAAMlL,EAASkL,EAASS,EACxB,IAAII,EAAQ3S,OAAOD,EAAIyS,GACvBzS,IAAM2S,EACFC,EAAQJ,IACRI,GAASF,EACT1S,GAAKkM,GAET,MAAM2G,EAAUhM,EACViM,EAAUjM,EAAS/D,KAAKiQ,IAAIH,GAAS,EACrCI,EAAQjB,EAAS,GAAM,EACvBkB,EAAQL,EAAQ,EACR,IAAVA,EACAL,EAAIA,EAAEzB,IAAIoC,EAAgBF,EAAOX,EAAYQ,KAG7ClE,EAAIA,EAAEmC,IAAIoC,EAAgBD,EAAOZ,EAAYS,IAErD,CACA,MAAO,CAAEnE,IAAG4D,IAChB,CACA,QAAAY,CAAS9B,EAAQa,GACb,IACIkB,EACAC,EAFArT,EAAIuR,EAAgBF,GAGxB,GAAIlD,EAAkB,CAClB,MAAM,MAAEV,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAClD,IAAM2O,EAAG8C,EAAKc,EAAGe,GAAQ1T,KAAKqS,KAAK3E,EAAI4E,IACjCvD,EAAG+C,EAAKa,EAAGgB,GAAQ3T,KAAKqS,KAAKzE,EAAI0E,GACvCT,EAAMyB,EAAgBzF,EAAOgE,GAC7BC,EAAMwB,EAAgBxF,EAAOgE,GAC7BA,EAAM,IAAInD,EAAchB,EAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GAC3D2E,EAAQ3B,EAAIX,IAAIY,GAChB2B,EAAOC,EAAIxC,IAAIyC,EACnB,KACK,CACD,MAAM,EAAE5E,EAAC,EAAE4D,GAAM3S,KAAKqS,KAAKjS,EAAGkS,GAC9BkB,EAAQzE,EACR0E,EAAOd,CACX,CACA,OAAOhE,EAAcoB,WAAW,CAACyD,EAAOC,IAAO,EACnD,CACA,QAAA3D,CAAS8D,GACL,MAAM,EAAExF,EAAC,EAAEQ,EAAC,EAAEC,GAAM7O,KACd6T,EAAM7T,KAAKgP,OAAOL,EAAcM,MAC1B,MAAR2E,IACAA,EAAOC,EAAMpH,EAAM+C,EAAOX,IAC9B,MAAMiF,EAAMF,EACNG,EAAMpG,EAAImG,EAAMA,GAChBE,EAAMrG,EAAIoG,EAAMD,GAChBG,EAAKtG,EAAIS,EAAI2F,GACbG,EAAKvG,EAAIiB,EAAIoF,GACbG,EAAKxG,EAAIkB,EAAIiF,GACnB,GAAID,EACA,OAAO3H,EAAM+C,KACjB,GAAIkF,IAAO7H,EACP,MAAM,IAAI/L,MAAM,oBACpB,OAAO,IAAI2L,EAAM+H,EAAIC,EACzB,EAIJ,SAASZ,EAAgBc,EAAWC,GAChC,MAAMC,EAAMD,EAAKzD,SACjB,OAAOwD,EAAYE,EAAMD,CAC7B,CALA1F,EAAc4D,KAAO,IAAI5D,EAAcxC,EAAMS,GAAIT,EAAMU,GAAIP,GAC3DqC,EAAcM,KAAO,IAAIN,EAActC,EAAKC,EAAKD,GAKjD,MAAMqG,EAAmB,IAAI6B,QAC7B,MAAMrI,EACF,WAAA9J,CAAYgM,EAAGQ,GACX5O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,CACb,CACA,cAAA4F,CAAe5B,GACX5S,KAAKwS,aAAeI,EACpBF,EAAiB+B,OAAOzU,KAC5B,CACA,QAAA0U,GACI,OAAO1U,KAAK4O,EAAIrC,IAAQF,CAC5B,CACA,wBAAOsI,CAAkBjU,GACrB,MAAMkU,EAA2B,KAAjBlU,EAAMI,OAChBsN,EAAIyG,EAAcD,EAAUlU,EAAQA,EAAM0C,SAAS,IACzD,IAAK0R,EAAoB1G,GACrB,MAAM,IAAI7N,MAAM,yBAEpB,IAAIqO,EA+SZ,SAAiBR,GACb,MAAM,EAAEzB,GAAMR,EACR4I,EAAMjR,OAAO,GACbkR,EAAOlR,OAAO,IACdmR,EAAOnR,OAAO,IACdoR,EAAOpR,OAAO,IACdqR,EAAOrR,OAAO,IACdsR,EAAOtR,OAAO,IACdwJ,EAAMc,EAAIA,EAAIA,EAAKzB,EACnB0I,EAAM/H,EAAKA,EAAKc,EAAKzB,EACrB2I,EAAMC,EAAKF,EAAI7I,GAAO6I,EAAM1I,EAC5B6I,EAAMD,EAAKD,EAAI9I,GAAO6I,EAAM1I,EAC5B8I,EAAOF,EAAKC,EAAIjJ,GAAOe,EAAMX,EAC7B+I,EAAOH,EAAKE,EAAKT,GAAQS,EAAO9I,EAChCgJ,EAAOJ,EAAKG,EAAKT,GAAQS,EAAO/I,EAChCiJ,EAAOL,EAAKI,EAAKR,GAAQQ,EAAOhJ,EAChCkJ,EAAQN,EAAKK,EAAKR,GAAQQ,EAAOjJ,EACjCmJ,EAAQP,EAAKM,EAAMV,GAAQQ,EAAOhJ,EAClCoJ,EAAQR,EAAKO,EAAMtJ,GAAO6I,EAAM1I,EAChCqJ,EAAMT,EAAKQ,EAAMb,GAAQQ,EAAO/I,EAChCsJ,EAAMV,EAAKS,EAAIjB,GAAOzH,EAAMX,EAC5BuJ,EAAKX,EAAKU,EAAI1J,GAEpB,GADY2J,EAAKA,EAAMvJ,IACZyB,EACP,MAAM,IAAI7N,MAAM,2BACpB,OAAO2V,CACX,CAzUgBC,CADGhI,EAAYC,IAEvB,MAAMgI,GAAUxH,EAAItC,KAASA,EACzBsI,EACIwB,IACAxH,EAAIjB,GAAKiB,IAG6B,IAAP,EAAXlO,EAAM,MACP0V,IACnBxH,EAAIjB,GAAKiB,IAEjB,MAAM4E,EAAQ,IAAItH,EAAMkC,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,0BAAO8C,CAAoB5V,GACvB,MAAM0N,EAAIyG,EAAcnU,EAAM0C,SAAS,EAAG2K,EAAW,IAC/Ca,EAAIiG,EAAcnU,EAAM0C,SAAS2K,EAAW,EAAc,EAAXA,EAAe,IAC9DyF,EAAQ,IAAItH,EAAMkC,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,cAAO+C,CAAQ/M,GACX,MAAM9I,EAAQ8V,EAAYhN,GACpBzG,EAAMrC,EAAMI,OACZ2V,EAAS/V,EAAM,GACrB,GAAIqC,IAAQgL,EACR,OAAO/N,KAAK2U,kBAAkBjU,GAClC,GAAIqC,IAAQkL,IAA6B,IAAXwI,GAA8B,IAAXA,GAC7C,OAAOzW,KAAK2U,kBAAkBjU,GAElC,GAAIqC,IAAQmL,GAA8B,IAAXuI,EAC3B,OAAOzW,KAAKsW,oBAAoB5V,GACpC,MAAM,IAAIH,MAAM,sDAAsD0N,yBAAqCC,6BAA2CnL,IAC1J,CACA,qBAAO2T,CAAeC,GAClB,OAAOzK,EAAMqG,KAAKgB,SAASqD,EAAoBD,GACnD,CACA,oBAAOE,CAAcC,EAASC,EAAWC,GACrC,MAAM,EAAG,EAAEC,GAAMC,EAAmBH,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGhW,SAASiW,GACvB,MAAM,IAAIzW,MAAM,wCACpB,MAAM2D,EAAIiT,EAAaX,EAAYM,KAC7B,EAAE1W,GAAM+L,EACRiL,EAAoB,IAAbJ,GAA+B,IAAbA,EAAiB7F,EAAI/Q,EAAI+Q,EAClDkG,EAAO7H,EAAO4H,EAAMhX,GACpBkX,EAAK3J,GAAKzJ,EAAImT,EAAMjX,GACpBmX,EAAK5J,EAAIsJ,EAAII,EAAMjX,GACnBoX,EAAoB,EAAXR,EAAe,KAAO,KAC/BS,EAAIvL,EAAMqK,QAAQiB,EAASE,EAAYN,IACvCO,EAAIzL,EAAMqG,KAAKqF,qBAAqBH,EAAGH,EAAIC,GACjD,IAAKI,EACD,MAAM,IAAIpX,MAAM,+CAEpB,OADAoX,EAAEtB,iBACKsB,CACX,CACA,UAAAE,CAAWC,GAAe,GACtB,OAAO3P,EAAWnI,KAAK+X,MAAMD,GACjC,CACA,KAAAC,CAAMD,GAAe,GACjB,MAAM1J,EAAIsJ,EAAY1X,KAAKoO,GAC3B,OAAI0J,EAEO,GADQ9X,KAAK0U,WAAa,KAAO,OACrBtG,IAGZ,KAAKA,IAAIsJ,EAAY1X,KAAK4O,IAEzC,CACA,MAAAoJ,GACI,OAAOhY,KAAK+X,OAAM,GAAMpT,MAAM,EAClC,CACA,MAAAsT,GACI,OAAOjY,KAAK6X,YAAW,GAAMlT,MAAM,EACvC,CACA,cAAA0R,GACI,MAAM/K,EAAM,kCACN,EAAE8C,EAAC,EAAEQ,GAAM5O,KACjB,IAAK8U,EAAoB1G,KAAO0G,EAAoBlG,GAChD,MAAM,IAAIrO,MAAM+K,GACpB,MAAM4M,EAAOvK,EAAIiB,EAAIA,GAErB,GAAIjB,EAAIuK,EADM/J,EAAYC,MACA/B,EACtB,MAAM,IAAI9L,MAAM+K,EACxB,CACA,MAAA0D,CAAON,GACH,OAAO1O,KAAKoO,IAAMM,EAAMN,GAAKpO,KAAK4O,IAAMF,EAAME,CAClD,CACA,MAAAgC,GACI,OAAO,IAAI1E,EAAMlM,KAAKoO,EAAGT,GAAK3N,KAAK4O,GACvC,CACA,MAAAiC,GACI,OAAOlC,EAAcG,WAAW9O,MAAM6Q,SAASf,UACnD,CACA,GAAAoB,CAAIxC,GACA,OAAOC,EAAcG,WAAW9O,MAAMkR,IAAIvC,EAAcG,WAAWJ,IAAQoB,UAC/E,CACA,QAAAyB,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,QAAA2C,CAAS9B,GACL,OAAO9C,EAAcG,WAAW9O,MAAMuT,SAAS9B,EAAQzR,MAAM8P,UACjE,CACA,oBAAA8H,CAAqBD,EAAGzR,EAAGzF,GACvB,MAAMkM,EAAIgC,EAAcG,WAAW9O,MAC7BmY,EAAKjS,IAAMmG,GAAOnG,IAAMoG,GAAOtM,OAASkM,EAAMqG,KAAO5F,EAAE6E,eAAetL,GAAKyG,EAAE4G,SAASrN,GACtFkS,EAAKzJ,EAAcG,WAAW6I,GAAGnG,eAAe/Q,GAChD4X,EAAMF,EAAGjH,IAAIkH,GACnB,OAAOC,EAAIrJ,OAAOL,EAAcM,WAAQhK,EAAYoT,EAAIvI,UAC5D,EAKJ,SAASwI,EAASrB,GACd,OAAO5W,OAAOwJ,SAASoN,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASsB,EAAY1V,GACjB,GAAIA,EAAK/B,OAAS,GAAiB,IAAZ+B,EAAK,GACxB,MAAM,IAAItC,MAAM,kCAAkC6H,EAAWvF,MAEjE,MAAME,EAAMF,EAAK,GACX6B,EAAM7B,EAAKO,SAAS,EAAGL,EAAM,GACnC,IAAKA,GAAO2B,EAAI5D,SAAWiC,EACvB,MAAM,IAAIxC,MAAM,2CAEpB,GAAe,IAAXmE,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAInE,MAAM,8CAEpB,MAAO,CAAEsC,KAAMgS,EAAcnQ,GAAMwT,KAAMrV,EAAKO,SAASL,EAAM,GACjE,CAnBAnD,EAAQsM,MAAQA,EAChBA,EAAMqG,KAAO,IAAIrG,EAAMC,EAAMS,GAAIT,EAAMU,IACvCX,EAAM+C,KAAO,IAAI/C,EAAMG,EAAKA,GAgC5B,MAAMJ,EACF,WAAA7J,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,kBAAOmC,CAAYhP,GACf,MAAMhB,EAAMgB,aAAe5I,WACrB6X,EAAO,wBACb,GAAmB,iBAARjP,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,GAAG4X,oCAC3B,MAAMrP,EAAMZ,EAAMJ,EAAWoB,GAAOA,EACpC,GAAmB,MAAfJ,EAAItI,OACJ,MAAM,IAAIP,MAAM,GAAGkY,2BACvB,OAAO,IAAIxM,EAAUyM,EAAYtP,EAAIzE,MAAM,EAAG,KAAM+T,EAAYtP,EAAIzE,MAAM,GAAI,MAClF,CACA,cAAOgU,CAAQnP,GACX,MAAMhB,EAAMgB,aAAe5I,WAC3B,GAAmB,iBAAR4I,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,oDACxB,MAAM,EAAEsQ,EAAC,EAAE8F,GAlCnB,SAA2BpU,GACvB,GAAIA,EAAK/B,OAAS,GAAgB,IAAX+B,EAAK,GACxB,MAAM,IAAItC,MAAM,0BAA0B6H,EAAWvF,MAEzD,GAAIA,EAAK,KAAOA,EAAK/B,OAAS,EAC1B,MAAM,IAAIP,MAAM,uCAEpB,MAAQsC,KAAMsO,EAAG+G,KAAMU,GAAWL,EAAY1V,EAAKO,SAAS,KACpDP,KAAMoU,EAAGiB,KAAMW,GAAeN,EAAYK,GAClD,GAAIC,EAAW/X,OACX,MAAM,IAAIP,MAAM,gDAAgD6H,EAAWyQ,MAE/E,MAAO,CAAE1H,IAAG8F,IAChB,CAqByB6B,CAAkBtQ,EAAMgB,EAAMrB,EAAWqB,IAC1D,OAAO,IAAIyC,EAAUkF,EAAG8F,EAC5B,CACA,cAAOV,CAAQ/M,GACX,OAAOxJ,KAAK2Y,QAAQnP,EACxB,CACA,cAAA6M,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK+Y,EAAmB5H,GACpB,MAAM,IAAI5Q,MAAM,0CACpB,IAAKwY,EAAmB9B,GACpB,MAAM,IAAI1W,MAAM,yCACxB,CACA,QAAAyY,GACI,MAAMC,EAAO9M,EAAM/L,GAAKkM,EACxB,OAAOtM,KAAKiX,EAAIgC,CACpB,CACA,UAAAC,GACI,OAAOlZ,KAAKgZ,WAAa,IAAI/M,EAAUjM,KAAKmR,EAAGxD,GAAK3N,KAAKiX,EAAG9K,EAAM/L,IAAMJ,IAC5E,CACA,aAAAmZ,GACI,OAAOhR,EAAWnI,KAAKoZ,WAC3B,CACA,QAAAA,GACI,MAAMC,EAAOf,EAASgB,EAAoBtZ,KAAKiX,IACzCsC,EAAOjB,EAASgB,EAAoBtZ,KAAKmR,IACzCqI,EAAQH,EAAKvY,OAAS,EACtB2Y,EAAQF,EAAKzY,OAAS,EACtB4Y,EAAOJ,EAAoBE,GAC3BG,EAAOL,EAAoBG,GAEjC,MAAO,KADQH,EAAoBG,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOL,GAClD,CACA,UAAAxB,GACI,OAAO7X,KAAKmZ,eAChB,CACA,KAAApB,GACI,OAAO/X,KAAKoZ,UAChB,CACA,iBAAAQ,GACI,OAAOzR,EAAWnI,KAAK6Z,eAC3B,CACA,YAAAA,GACI,OAAOnC,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,EAGJ,SAASlP,KAAewC,GACpB,IAAKA,EAAOC,OAAO/J,GAAMA,aAAaG,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,CAdA9K,EAAQqM,UAAYA,EAepB,MAAMnD,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAC/E,SAASf,EAAWmB,GAChB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAOV,EAAMS,EAAO7F,IAExB,OAAO8F,CACX,CACA,MAAMsQ,EAAYhW,OAAO,uEACzB,SAAS4T,EAAYhI,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAInP,MAAM,mBACpB,KAAM8L,GAAOqD,GAAOA,EAAMoK,GACtB,MAAM,IAAIvZ,MAAM,kCACpB,OAAOmP,EAAIxG,SAAS,IAAIC,SAAS,GAAI,IACzC,CACA,SAAS4Q,EAASrK,GACd,MAAMjP,EAAI0H,EAAWuP,EAAYhI,IACjC,GAAiB,KAAbjP,EAAEK,OACF,MAAM,IAAIP,MAAM,4BACpB,OAAOE,CACX,CACA,SAAS6Y,EAAoB5J,GACzB,MAAMlG,EAAMkG,EAAIxG,SAAS,IACzB,OAAoB,EAAbM,EAAI1I,OAAa,IAAI0I,IAAQA,CACxC,CACA,SAASkP,EAAYlP,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,4CAA8C2I,GAEtE,OAAO1F,OAAO,KAAK0F,IACvB,CACA,SAASrB,EAAWqB,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,4CAA8CiJ,EAAI1I,QACtE,MAAM2I,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CACA,SAASoL,EAAcnU,GACnB,OAAOgY,EAAYtQ,EAAW1H,GAClC,CACA,SAAS8V,EAAYhN,GACjB,OAAOA,aAAe5I,WAAaA,WAAWoI,KAAKQ,GAAOrB,EAAWqB,EACzE,CACA,SAASmI,EAAgBjC,GACrB,GAAmB,iBAARA,GAAoBrP,OAAOC,cAAcoP,IAAQA,EAAM,EAC9D,OAAO5L,OAAO4L,GAClB,GAAmB,iBAARA,GAAoBqJ,EAAmBrJ,GAC9C,OAAOA,EACX,MAAM,IAAI7O,UAAU,sDACxB,CACA,SAAS8M,EAAIzH,EAAGzF,EAAI0L,EAAMQ,GACtB,MAAMjC,EAASxE,EAAIzF,EACnB,OAAOiK,GAAU2B,EAAM3B,EAASjK,EAAIiK,CACxC,CACA,SAAS6K,EAAKnH,EAAG4L,GACb,MAAM,EAAErN,GAAMR,EACd,IAAIzH,EAAM0J,EACV,KAAO4L,KAAU3N,GACb3H,GAAOA,EACPA,GAAOiI,EAEX,OAAOjI,CACX,CA4BA,SAAS8K,EAAOrP,EAAQ8Z,EAAS9N,EAAMQ,GACnC,GAAIxM,IAAWkM,GAAO4N,GAAU5N,EAC5B,MAAM,IAAI9L,MAAM,6CAA6CJ,SAAc8Z,KAE/E,IAAI/T,EAAIyH,EAAIxN,EAAQ8Z,GAChBxZ,EAAIwZ,EACJ7L,EAAI/B,EAAKuC,EAAItC,EAAK4N,EAAI5N,EAAKrD,EAAIoD,EACnC,KAAOnG,IAAMmG,GAAK,CACd,MAAM8N,EAAI1Z,EAAIyF,EACRiL,EAAI1Q,EAAIyF,EACRkU,EAAIhM,EAAI8L,EAAIC,EACZ/Z,EAAIwO,EAAI3F,EAAIkR,EAClB1Z,EAAIyF,EAAGA,EAAIiL,EAAG/C,EAAI8L,EAAGtL,EAAI3F,EAAGiR,EAAIE,EAAGnR,EAAI7I,CAC3C,CAEA,GADYK,IACA6L,EACR,MAAM,IAAI/L,MAAM,0BACpB,OAAOoN,EAAIS,EAAG6L,EAClB,CAuBA,SAAS9C,EAAanW,EAAMqZ,GAAe,GACvC,MAAMnW,EANV,SAAoBxD,GAChB,MAAM4Z,EAAuB,EAAf5Z,EAAMI,OAAwB,EAAXkN,EAC3B0B,EAAMmF,EAAcnU,GAC1B,OAAO4Z,EAAQ,EAAI5K,GAAO5L,OAAOwW,GAAS5K,CAC9C,CAEc6K,CAAWvZ,GACrB,GAAIqZ,EACA,OAAOnW,EACX,MAAM,EAAE9D,GAAM+L,EACd,OAAOjI,GAAK9D,EAAI8D,EAAI9D,EAAI8D,CAC5B,CACA,IAAIsW,EACAC,EACJ,MAAMC,EACF,WAAAtY,CAAYuY,EAASC,GAGjB,GAFA5a,KAAK2a,QAAUA,EACf3a,KAAK4a,SAAWA,EACO,iBAAZD,GAAwBA,EAAU,EACzC,MAAM,IAAIpa,MAAM,4BACpB,GAAwB,iBAAbqa,GAAyBA,EAAW,EAC3C,MAAM,IAAIra,MAAM,6BACpBP,KAAKiJ,EAAI,IAAIrI,WAAW+Z,GAASlX,KAAK,GACtCzD,KAAKkN,EAAI,IAAItM,WAAW+Z,GAASlX,KAAK,GACtCzD,KAAK6a,QAAU,CACnB,CACA,IAAAzV,IAAQ0V,GACJ,OAAOlb,EAAQ6L,MAAMsP,WAAW/a,KAAKkN,KAAM4N,EAC/C,CACA,QAAAE,IAAYF,GACR,OAAOL,EAAgBza,KAAKkN,KAAM4N,EACtC,CACA,SAAAG,GACI,GAA+B,mBAApBR,EACP,MAAM,IAAIjM,EAAS,iCAC3B,CACA,IAAA0M,GACI,GAAIlb,KAAK6a,SAAW,IAChB,MAAM,IAAIta,MAAM,qDACpBP,KAAK6a,SAAW,CACpB,CACA,YAAMM,CAAOC,EAAO,IAAIxa,YACpBZ,KAAKkN,QAAUlN,KAAKoF,KAAKpF,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GAC1Dpb,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GACV,IAAhBmS,EAAKta,SAETd,KAAKkN,QAAUlN,KAAKoF,KAAKpF,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GAC1Dpb,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GAClC,CACA,UAAAoS,CAAWD,EAAO,IAAIxa,YAClBZ,KAAKib,YACLjb,KAAKkN,EAAIlN,KAAKgb,SAAShb,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GACxDpb,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GACR,IAAhBmS,EAAKta,SAETd,KAAKkN,EAAIlN,KAAKgb,SAAShb,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GACxDpb,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GAChC,CACA,cAAMqS,GACFtb,KAAKkb,OACL,IAAInY,EAAM,EACV,MAAMrB,EAAM,GACZ,KAAOqB,EAAM/C,KAAK4a,UAAU,CACxB5a,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GAC9B,MAAMsS,EAAKvb,KAAKiJ,EAAEtE,QAClBjD,EAAI0Q,KAAKmJ,GACTxY,GAAO/C,KAAKiJ,EAAEnI,MAClB,CACA,OAAOiH,KAAerG,EAC1B,CACA,YAAA8Z,GACIxb,KAAKib,YACLjb,KAAKkb,OACL,IAAInY,EAAM,EACV,MAAMrB,EAAM,GACZ,KAAOqB,EAAM/C,KAAK4a,UAAU,CACxB5a,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GAC5B,MAAMsS,EAAKvb,KAAKiJ,EAAEtE,QAClBjD,EAAI0Q,KAAKmJ,GACTxY,GAAO/C,KAAKiJ,EAAEnI,MAClB,CACA,OAAOiH,KAAerG,EAC1B,EAEJ,SAASqX,EAAmBrJ,GACxB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAM/L,CACpC,CACA,SAAS0U,EAAoBpF,GACzB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAMQ,CACpC,CACA,SAAS8O,EAASC,EAAQtB,EAAGxI,EAAG+J,GAAO,GACnC,MAAM,EAAEvb,GAAM+L,EACRe,EAAIiK,EAAauE,GAAQ,GAC/B,IAAK3C,EAAmB7L,GACpB,OACJ,MAAM0O,EAAOpM,EAAOtC,EAAG9M,GACjB+Z,EAAIjO,EAAMqG,KAAKgB,SAASrG,GACxBiE,EAAIxD,EAAIwM,EAAE/L,EAAGhO,GACnB,GAAI+Q,IAAM9E,EACN,OACJ,MAAM4K,EAAItJ,EAAIiO,EAAOjO,EAAIyM,EAAIxI,EAAIT,EAAG/Q,GAAIA,GACxC,GAAI6W,IAAM5K,EACN,OACJ,IAAIwP,EAAM,IAAI5P,EAAUkF,EAAG8F,GACvBD,GAAYmD,EAAE/L,IAAMyN,EAAI1K,EAAI,EAAI,GAAK9Q,OAAO8Z,EAAEvL,EAAItC,GAKtD,OAJIqP,GAAQE,EAAI7C,aACZ6C,EAAMA,EAAI3C,aACVlC,GAAY,GAET,CAAE6E,MAAK7E,WAClB,CACA,SAASJ,EAAoBrR,GACzB,IAAImK,EACJ,GAAmB,iBAARnK,EACPmK,EAAMnK,OAEL,GAAmB,iBAARA,GAAoBlF,OAAOC,cAAciF,IAAQA,EAAM,EACnEmK,EAAM5L,OAAOyB,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAIA,EAAIzE,SAAW,EAAIkN,EACnB,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMgJ,EAAYnT,EACtB,KACK,MAAIA,aAAe3E,YAMpB,MAAM,IAAIC,UAAU,8BALpB,GAAI0E,EAAIzE,SAAWkN,EACf,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMmF,EAActP,EAIxB,CACA,IAAKwT,EAAmBrJ,GACpB,MAAM,IAAInP,MAAM,qCACpB,OAAOmP,CACX,CACA,SAASoM,EAAmBC,GACxB,OAAIA,aAAqB7P,GACrB6P,EAAU1F,iBACH0F,GAGA7P,EAAMqK,QAAQwF,EAE7B,CACA,SAAS7E,EAAmBH,GACxB,GAAIA,aAAqB9K,EAErB,OADA8K,EAAUV,iBACHU,EAEX,IACI,OAAO9K,EAAU0M,QAAQ5B,EAC7B,CACA,MAAOiF,GACH,OAAO/P,EAAUuM,YAAYzB,EACjC,CACJ,CASA,SAASkF,EAAU5H,GACf,MAAM7L,EAAM6L,aAAgBzT,WACtBwI,EAAsB,iBAATiL,EACbtR,GAAOyF,GAAOY,IAAQiL,EAAKvT,OACjC,OAAI0H,EACOzF,IAAQkL,GAAiBlL,IAAQmL,EACxC9E,EACOrG,IAAwB,EAAhBkL,GAAqBlL,IAA0B,EAAlBmL,EAC5CmG,aAAgBnI,CAGxB,CAWA,SAASgQ,EAASxb,GAEd,OAAOmU,EADOnU,EAAMI,OAASiN,EAAWrN,EAAMiE,MAAM,EAAGoJ,GAAYrN,EAEvE,CACA,SAASyb,GAAYzb,GACjB,MAAM0b,EAAKF,EAASxb,GACd2b,EAAK1O,EAAIyO,EAAIjQ,EAAM/L,GACzB,OAAOkc,GAAWD,EAAKhQ,EAAM+P,EAAKC,EACtC,CACA,SAASC,GAAW5M,GAChB,OAAOqK,EAASrK,EACpB,CACA,SAAS6M,GAAYzF,EAASH,EAAY6F,GACtC,GAAe,MAAX1F,EACA,MAAM,IAAIvW,MAAM,2CAA2CuW,MAC/D,MAAM2F,EAAKjG,EAAYM,GACjBlF,EAAIgF,EAAoBD,GACxB+F,EAAW,CAACJ,GAAW1K,GAAIuK,GAAYM,IAC7C,GAAoB,MAAhBD,EAAsB,EACD,IAAjBA,IACAA,EAAe5c,EAAQ6L,MAAM7D,YAAYmG,IAC7C,MAAM4O,EAAInG,EAAYgG,GACtB,GAAIG,EAAE7b,SAAWiN,EACb,MAAM,IAAIxN,MAAM,kBAAkBwN,yBACtC2O,EAAStK,KAAKuK,EAClB,CAGA,MAAO,CAAEvB,KAFIrT,KAAe2U,GAEbtC,EADL8B,EAASO,GACD7K,IACtB,CACA,SAASgL,GAAYC,EAAQhS,GACzB,MAAM,IAAEgR,EAAG,SAAE7E,GAAa6F,GACpB,IAAEC,EAAG,UAAEC,GAAcnb,OAAOqJ,OAAO,CAAE+R,WAAW,EAAMF,KAAK,GAAQjS,GACnEoS,EAASH,EAAMjB,EAAI1C,gBAAkB0C,EAAIjC,oBAC/C,OAAOmD,EAAY,CAACE,EAAQjG,GAAYiG,CAC5C,CA9DArd,EAAQoM,aAHR,SAAsB2K,EAAYmB,GAAe,GAC7C,OAAO5L,EAAMwK,eAAeC,GAAYkB,WAAWC,EACvD,EAKAlY,EAAQmM,iBAHR,SAA0B+K,EAASC,EAAWC,EAAUc,GAAe,GACnE,OAAO5L,EAAM2K,cAAcC,EAASC,EAAWC,GAAUa,WAAWC,EACxE,EAuBAlY,EAAQkM,gBATR,SAAyBoR,EAAUC,EAASrF,GAAe,GACvD,GAAImE,EAAUiB,GACV,MAAM,IAAIrc,UAAU,kDACxB,IAAKob,EAAUkB,GACX,MAAM,IAAItc,UAAU,kDACxB,MAAMJ,EAAIqb,EAAmBqB,GAE7B,OADA1c,EAAE4V,iBACK5V,EAAE8S,SAASqD,EAAoBsG,IAAWrF,WAAWC,EAChE,EA+CAlY,EAAQiM,KATR9B,eAAoB+M,EAASsG,EAASvS,EAAO,CAAC,GAC1C,MAAM,KAAEuQ,EAAI,EAAEhB,EAAC,EAAExI,GAAM2K,GAAYzF,EAASsG,EAASvS,EAAK2R,cACpDa,EAAO,IAAI3C,EAx1BL,GAw1BuB1M,GAEnC,IAAI6N,EACJ,UAFMwB,EAAKlC,OAAOC,KAETS,EAAMJ,QAAe4B,EAAK/B,WAAYlB,EAAGxI,EAAG/G,EAAKmS,mBAChDK,EAAKlC,SACf,OAAOyB,GAAYf,EAAKhR,EAC5B,EAWAjL,EAAQgM,SATR,SAAkBkL,EAASsG,EAASvS,EAAO,CAAC,GACxC,MAAM,KAAEuQ,EAAI,EAAEhB,EAAC,EAAExI,GAAM2K,GAAYzF,EAASsG,EAASvS,EAAK2R,cACpDa,EAAO,IAAI3C,EAl2BL,GAk2BuB1M,GAEnC,IAAI6N,EACJ,IAFAwB,EAAKhC,WAAWD,KAEPS,EAAMJ,EAAS4B,EAAK7B,eAAgBpB,EAAGxI,EAAG/G,EAAKmS,aACpDK,EAAKhC,aACT,OAAOuB,GAAYf,EAAKhR,EAC5B,EAEA,MAAMyS,GAAQ,CAAEC,QAAQ,GAgCxB,SAASC,GAAyBC,GAC9B,OAAO9P,EAAIkH,EAAc4I,GAAKtR,EAAM/L,EACxC,CAHAR,EAAQ+L,OA9BR,SAAgBoL,EAAWD,EAASiF,EAAWlR,EAAOyS,IAClD,IAAIzB,EACJ,IACIA,EAAM3E,EAAmBH,GACzBD,EAAUN,EAAYM,EAC1B,CACA,MAAOkF,GACH,OAAO,CACX,CACA,MAAM,EAAE7K,EAAC,GAAQ0K,EACjB,GAAIhR,EAAK0S,QAAU1B,EAAI7C,WACnB,OAAO,EACX,MAAM9U,EAAIiT,EAAaL,GACvB,IAAInK,EACJ,IACIA,EAAImP,EAAmBC,EAC3B,CACA,MAAOC,GACH,OAAO,CACX,CACA,MAAM,EAAE5b,GAAM+L,EACRuR,EAAOlO,EAAOyH,EAAG7W,GACjBkX,EAAK3J,EAAIzJ,EAAIwZ,EAAMtd,GACnBmX,EAAK5J,EAAIwD,EAAIuM,EAAMtd,GACnBqX,EAAIvL,EAAMqG,KAAKqF,qBAAqBjL,EAAG2K,EAAIC,GACjD,QAAKE,GAEK9J,EAAI8J,EAAErJ,EAAGhO,KACN+Q,CACjB,EAKA,MAAMwM,GACF,WAAAvb,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,cAAOE,CAAQ/M,GACX,MAAM9I,EAAQ8V,EAAYhN,GAC1B,GAAqB,KAAjB9I,EAAMI,OACN,MAAM,IAAID,UAAU,oDAAoDH,EAAMI,UAClF,MAAMqQ,EAAI0D,EAAcnU,EAAM0C,SAAS,EAAG,KACpC6T,EAAIpC,EAAcnU,EAAM0C,SAAS,GAAI,KAC3C,OAAO,IAAIua,GAAiBxM,EAAG8F,EACnC,CACA,cAAAZ,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK8U,EAAoB3D,KAAO4H,EAAmB9B,GAC/C,MAAM,IAAI1W,MAAM,oBACxB,CACA,KAAAwX,GACI,OAAOL,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,CACA,UAAAY,GACI,OAAO1P,EAAWnI,KAAK+X,QAC3B,EAKJ,MAAM6F,GACF,WAAAxb,CAAYyD,EAAS8Q,EAAYkH,EAAUje,EAAQ6L,MAAM7D,eACrD,GAAe,MAAX/B,EACA,MAAM,IAAIhF,UAAU,sCAAsCgF,MAC9D7F,KAAKoa,EAAI5D,EAAY3Q,GACrB,MAAM,EAAEuI,EAAC,OAAEqD,GAAWzR,KAAK8d,UAAUlH,EAAoBD,IAIzD,GAHA3W,KAAK+d,GAAK3P,EACVpO,KAAK4R,EAAIH,EACTzR,KAAKge,KAAOxH,EAAYqH,GACC,KAArB7d,KAAKge,KAAKld,OACV,MAAM,IAAID,UAAU,4CAC5B,CACA,SAAAid,CAAUG,GACN,MAAMzK,EAAQtH,EAAMwK,eAAeuH,GAC7BxM,EAAS+B,EAAMkB,WAAauJ,EAAO9R,EAAM/L,EAAI6d,EACnD,MAAO,CAAEzK,QAAO/B,SAAQrD,EAAGoF,EAAMyE,SACrC,CACA,SAAAiG,CAAUtM,EAAGuM,GACT,OAAOpE,EAASnI,EAAIiD,EAAcsJ,GACtC,CACA,aAAAC,CAAcC,GACV,MAAMC,EAAK3Q,EAAIkH,EAAcwJ,GAAMlS,EAAM/L,GACzC,GAAIke,IAAOjS,EACP,MAAM,IAAI9L,MAAM,iDACpB,MAAQiT,MAAOiE,EAAGrJ,EAAGmQ,EAAI9M,OAAQvE,GAAMlN,KAAK8d,UAAUQ,GACtD,MAAO,CAAE7G,IAAG8G,KAAIrR,IACpB,CACA,WAAA0P,CAAYnF,EAAGvK,EAAGyP,EAAG/K,GACjB,OAAO,IAAI+L,GAAiBlG,EAAErJ,EAAGT,EAAIT,EAAIyP,EAAI/K,EAAGzF,EAAM/L,IAAIyX,YAC9D,CACA,KAAAmE,GACI,MAAM,IAAIzb,MAAM,mCACpB,CACA,UAAMie,GACF,MAAM,EAAEpE,EAAC,EAAExI,EAAC,GAAEmM,EAAE,KAAEC,GAAShe,KACrBye,EAAM7e,EAAQ6L,MAAMiT,WACpBC,EAAI3e,KAAKke,UAAUtM,QAAS6M,EAAIG,GAAKC,IAAKb,KAC1C,EAAEvG,EAAC,GAAE8G,EAAE,EAAErR,GAAMlN,KAAKoe,oBAAoBK,EAAIG,GAAKE,MAAOH,EAAGZ,EAAI3D,IAC/DuC,EAAIa,SAA+BiB,EAAIG,GAAKG,UAAWR,EAAIR,EAAI3D,IAC/DyB,EAAM7b,KAAK4c,YAAYnF,EAAGvK,EAAGyP,EAAG/K,GAGtC,aAFYoN,GAAcnD,EAAKzB,EAAG2D,IAC9B/d,KAAKgc,QACFH,CACX,CACA,QAAAoD,GACI,MAAM,EAAE7E,EAAC,EAAExI,EAAC,GAAEmM,EAAE,KAAEC,GAAShe,KACrBye,EAAM7e,EAAQ6L,MAAMyT,eACpBP,EAAI3e,KAAKke,UAAUtM,EAAG6M,EAAIG,GAAKC,IAAKb,KACpC,EAAEvG,EAAC,GAAE8G,EAAE,EAAErR,GAAMlN,KAAKoe,cAAcK,EAAIG,GAAKE,MAAOH,EAAGZ,EAAI3D,IACzDuC,EAAIa,GAAyBiB,EAAIG,GAAKG,UAAWR,EAAIR,EAAI3D,IACzDyB,EAAM7b,KAAK4c,YAAYnF,EAAGvK,EAAGyP,EAAG/K,GAGtC,OAFKuN,GAAkBtD,EAAKzB,EAAG2D,IAC3B/d,KAAKgc,QACFH,CACX,EAQJ,SAASuD,GAAkBrI,EAAWlR,EAASkW,GAC3C,MAAMsD,EAAMtI,aAAqB4G,GAC3B9B,EAAMwD,EAAMtI,EAAY4G,GAAiBpH,QAAQQ,GAGvD,OAFIsI,GACAxD,EAAIxF,iBACD,IACAwF,EACHzB,EAAG5D,EAAY3Q,GACf8G,EAAGmP,EAAmBC,GAE9B,CACA,SAASuD,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,GACpC,MAAMlF,EAAIvL,EAAMqG,KAAKqF,qBAAqBjL,EAAGiK,EAAoBK,GAAItJ,GAAKgP,EAAGxQ,EAAM/L,IACnF,SAAKqX,IAAMA,EAAE/C,YAAc+C,EAAErJ,IAAM+C,EAGvC,CACApH,eAAeiV,GAAcjI,EAAWlR,EAASkW,GAC7C,IACI,MAAM,EAAE5K,EAAC,EAAE8F,EAAC,EAAEmD,EAAC,EAAEzN,GAAMyS,GAAkBrI,EAAWlR,EAASkW,GACvDY,EAAIa,SAA+B5d,EAAQ6L,MAAMiT,WAAWE,GAAKG,UAAWhF,EAAS5I,GAAIxE,EAAEsL,SAAUmC,IAC3G,OAAOkF,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,EAC1C,CACA,MAAOX,GACH,OAAO,CACX,CACJ,CACA,SAASmD,GAAkBpI,EAAWlR,EAASkW,GAC3C,IACI,MAAM,EAAE5K,EAAC,EAAE8F,EAAC,EAAEmD,EAAC,EAAEzN,GAAMyS,GAAkBrI,EAAWlR,EAASkW,GACvDY,EAAIa,GAAyB5d,EAAQ6L,MAAMyT,eAAeN,GAAKG,UAAWhF,EAAS5I,GAAIxE,EAAEsL,SAAUmC,IACzG,OAAOkF,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,EAC1C,CACA,MAAOX,GACH,GAAIA,aAAiBxN,EACjB,MAAMwN,EACV,OAAO,CACX,CACJ,CACApc,EAAQ8L,QAAU,CACdO,UAAW0R,GACX3R,aA1GJ,SAA6B2K,GACzB,OAAOzK,EAAMwK,eAAeC,GAAYsB,QAC5C,EAyGIpM,KAhDJ9B,eAA2BuB,EAAK8R,EAASS,GACrC,OAAO,IAAID,GAAyBtS,EAAK8R,EAASS,GAASW,MAC/D,EA+CI7S,OAAQqT,GACRpT,SA/CJ,SAAyBN,EAAK8R,EAASS,GACnC,OAAO,IAAID,GAAyBtS,EAAK8R,EAASS,GAASoB,UAC/D,EA8CIM,WAAYJ,IAEhBjT,EAAMqG,KAAKiC,eAAe,GAC1B,MAAMzP,GAAS,CACXC,KAAMoH,EACNlH,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,GAEhE2Z,GAAO,CACTG,UAAW,oBACXF,IAAK,cACLC,MAAO,iBAELU,GAAuB,CAAC,EAC9B5f,EAAQ6L,MAAQ,CACZrD,aACAD,aACAJ,cACA4F,MACA6B,SACA,iBAAAiQ,CAAkB9I,GACd,IAEI,OADAC,EAAoBD,IACb,CACX,CACA,MAAOqF,GACH,OAAO,CACX,CACJ,EACA0D,iBAAkB3F,EAClB4F,qBAAsB/I,EACtBgJ,iBAAmB5e,IACfA,EAAOwV,EAAYxV,GACnB,MAAM6e,EAAS7R,EAAW,EAC1B,GAAIhN,EAAKF,OAAS+e,GAAU7e,EAAKF,OAAS,KACtC,MAAM,IAAIP,MAAM,uDAGpB,OAAOwZ,EADKpM,EAAIkH,EAAc7T,GAAOmL,EAAM/L,EAAIkM,GAAOA,EAClC,EAExB1E,YAAa,CAAC2D,EAAc,MACxB,GAAIxG,GAAOG,IACP,OAAOH,GAAOG,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEhD,GAAIxG,GAAOC,KAAM,CAClB,MAAM,YAAE4C,GAAgB7C,GAAOC,KAC/B,OAAOpE,WAAWoI,KAAKpB,EAAY2D,GACvC,CAEI,MAAM,IAAIhL,MAAM,oDACpB,EAEJuf,iBAAkB,IAAMlgB,EAAQ6L,MAAMmU,iBAAiBhgB,EAAQ6L,MAAM7D,YAAYoG,EAAW,IAC5F,UAAA+R,CAAWnN,EAAa,EAAGY,EAAQtH,EAAMqG,MACrC,MAAMyN,EAASxM,IAAUtH,EAAMqG,KAAOiB,EAAQ,IAAItH,EAAMsH,EAAMpF,EAAGoF,EAAM5E,GAGvE,OAFAoR,EAAOxL,eAAe5B,GACtBoN,EAAOzM,SAAS/G,GACTwT,CACX,EACAja,OAAQgE,SAAUkW,KACd,GAAIlb,GAAOG,IAAK,CACZ,MAAMzC,QAAesC,GAAOG,IAAIgb,OAAOzb,OAAO,UAAWsD,KAAekY,IACxE,OAAO,IAAIrf,WAAW6B,EAC1B,CACK,GAAIsC,GAAOC,KAAM,CAClB,MAAM,WAAEmb,GAAepb,GAAOC,KACxBhE,EAAOmf,EAAW,UAExB,OADAF,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,+CACpB,EAEJwa,WAAYhR,MAAOxE,KAAQ0a,KACvB,GAAIlb,GAAOG,IAAK,CACZ,MAAMmb,QAAatb,GAAOG,IAAIgb,OAAOI,UAAU,MAAO/a,EAAK,CAAEkT,KAAM,OAAQzX,KAAM,CAAEyX,KAAM,aAAe,EAAO,CAAC,SAC1G5S,EAAUkC,KAAekY,GACzBxd,QAAesC,GAAOG,IAAIgb,OAAOrU,KAAK,OAAQwU,EAAMxa,GAC1D,OAAO,IAAIjF,WAAW6B,EAC1B,CACK,GAAIsC,GAAOC,KAAM,CAClB,MAAM,WAAEub,GAAexb,GAAOC,KACxBhE,EAAOuf,EAAW,SAAUhb,GAElC,OADA0a,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,oDACpB,EAEJigB,gBAAYvb,EACZwb,oBAAgBxb,EAChByZ,WAAY3U,MAAO0U,KAAQwB,KACvB,IAAIS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,QAAa/gB,EAAQ6L,MAAM1F,OAAOnF,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MACjFF,EAAO3Y,EAAY4Y,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAO9gB,EAAQ6L,MAAM1F,OAAO2a,KAAST,EAAS,EAElDf,eAAgB,CAACT,KAAQwB,KACrB,GAA2B,mBAAhBzF,EACP,MAAM,IAAIhM,EAAS,+CACvB,IAAIkS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,EAAOnG,EAAY5Z,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MAClEF,EAAO3Y,EAAY4Y,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAOlG,EAAYkG,KAAST,EAAS,EAEzCY,eAAgBlS,GAEpB/M,OAAOkf,iBAAiBlhB,EAAQ6L,MAAO,CACnC+U,WAAY,CACRO,cAAc,EACdvc,IAAG,IACQgW,EAEX,GAAArX,CAAI6d,GACKxG,IACDA,EAAcwG,EACtB,GAEJP,eAAgB,CACZM,cAAc,EACdvc,IAAG,IACQiW,EAEX,GAAAtX,CAAI6d,GACKvG,IACDA,EAAkBuG,EAC1B,2BCnlCRnhB,EAAOD,QAlHP,SAAeqhB,GACb,GAAIA,EAASngB,QAAU,IAAO,MAAM,IAAID,UAAU,qBAElD,IADA,IAAIqgB,EAAW,IAAItgB,WAAW,KACrB8I,EAAI,EAAGA,EAAIwX,EAASpgB,OAAQ4I,IACnCwX,EAASxX,GAAK,IAEhB,IAAK,IAAIhG,EAAI,EAAGA,EAAIud,EAASngB,OAAQ4C,IAAK,CACxC,IAAI0K,EAAI6S,EAASE,OAAOzd,GACpB0d,EAAKhT,EAAEwS,WAAW,GACtB,GAAqB,MAAjBM,EAASE,GAAe,MAAM,IAAIvgB,UAAUuN,EAAI,iBACpD8S,EAASE,GAAM1d,CACjB,CACA,IAAI6O,EAAO0O,EAASngB,OAChBugB,EAASJ,EAASE,OAAO,GACzBG,EAASpe,KAAKqe,IAAIhP,GAAQrP,KAAKqe,IAAI,KACnCC,EAAUte,KAAKqe,IAAI,KAAOre,KAAKqe,IAAIhP,GA8CvC,SAASkP,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAI7gB,UAAU,mBACtD,GAAsB,IAAlB6gB,EAAO5gB,OAAgB,OAAO,IAAIF,WAKtC,IAJA,IAAI+gB,EAAM,EAENC,EAAS,EACT9gB,EAAS,EACN4gB,EAAOC,KAASN,GACrBO,IACAD,IAMF,IAHA,IAAIE,GAAUH,EAAO5gB,OAAS6gB,GAAOL,EAAU,IAAO,EAClDQ,EAAO,IAAIlhB,WAAWihB,GAEnBH,EAAOC,IAAM,CAElB,IAAII,EAAQb,EAASQ,EAAOd,WAAWe,IAEvC,GAAc,MAAVI,EAAiB,OAErB,IADA,IAAIre,EAAI,EACCse,EAAMH,EAAO,GAAc,IAAVE,GAAere,EAAI5C,KAAqB,IAATkhB,EAAaA,IAAOte,IAC3Eqe,GAAUxP,EAAOuP,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAIxhB,MAAM,kBACnCO,EAAS4C,EACTie,GACF,CAGA,IADA,IAAIM,EAAMJ,EAAO/gB,EACVmhB,IAAQJ,GAAsB,IAAdC,EAAKG,IAC1BA,IAIF,IAFA,IAAIC,EAAM,IAAIthB,WAAWghB,GAAUC,EAAOI,IACtCvY,EAAIkY,EACDK,IAAQJ,GACbK,EAAIxY,KAAOoY,EAAKG,KAElB,OAAOC,CACT,CAMA,MAAO,CACL5Y,OA7FF,SAAiBoY,GAOf,GANIA,aAAkB9gB,aACXuhB,YAAYC,OAAOV,GAC5BA,EAAS,IAAI9gB,WAAW8gB,EAAOjf,OAAQif,EAAO/d,WAAY+d,EAAOjZ,YACxDM,MAAMsZ,QAAQX,KACvBA,EAAS9gB,WAAWoI,KAAK0Y,OAErBA,aAAkB9gB,YAAe,MAAM,IAAIC,UAAU,uBAC3D,GAAsB,IAAlB6gB,EAAO5gB,OAAgB,MAAO,GAMlC,IAJA,IAAI8gB,EAAS,EACT9gB,EAAS,EACTwhB,EAAS,EACTC,EAAOb,EAAO5gB,OACXwhB,IAAWC,GAA2B,IAAnBb,EAAOY,IAC/BA,IACAV,IAMF,IAHA,IAAIC,GAASU,EAAOD,GAAUd,EAAU,IAAO,EAC3CgB,EAAM,IAAI5hB,WAAWihB,GAElBS,IAAWC,GAAM,CAItB,IAHA,IAAIR,EAAQL,EAAOY,GAEf5e,EAAI,EACC+e,EAAMZ,EAAO,GAAc,IAAVE,GAAere,EAAI5C,KAAqB,IAAT2hB,EAAaA,IAAO/e,IAC3Eqe,GAAU,IAAMS,EAAIC,KAAU,EAC9BD,EAAIC,GAAQV,EAAQxP,IAAU,EAC9BwP,EAASA,EAAQxP,IAAU,EAE7B,GAAc,IAAVwP,EAAe,MAAM,IAAIxhB,MAAM,kBACnCO,EAAS4C,EACT4e,GACF,CAGA,IADA,IAAII,EAAMb,EAAO/gB,EACV4hB,IAAQb,GAAqB,IAAbW,EAAIE,IACzBA,IAIF,IADA,IAAItZ,EAAMiY,EAAOsB,OAAOf,GACjBc,EAAMb,IAAQa,EAAOtZ,GAAO6X,EAASE,OAAOqB,EAAIE,IACvD,OAAOtZ,CACT,EAkDEqY,aAAcA,EACdmB,OARF,SAAiBC,GACf,IAAIpgB,EAASgf,EAAaoB,GAC1B,GAAIpgB,EAAU,OAAOA,EACrB,MAAM,IAAIlC,MAAM,WAAagS,EAAO,aACtC,EAMF,4BCrHA3S,EAAQ6I,WAuCR,SAAqBqa,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,CAClD,EA3CAtjB,EAAQujB,YAiDR,SAAsBL,GACpB,IAAI1X,EAcA1H,EAbAqf,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBva,EAAM,IAAI4a,EAVhB,SAAsBN,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBG,CAAYP,EAAKG,EAAUC,IAEzCI,EAAU,EAGVvgB,EAAMmgB,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKvf,EAAI,EAAGA,EAAIX,EAAKW,GAAK,EACxB0H,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,GAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,GACpC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACrC6f,EAAUT,EAAIlC,WAAWld,EAAI,IAC/B8E,EAAI8a,KAAclY,GAAO,GAAM,IAC/B5C,EAAI8a,KAAclY,GAAO,EAAK,IAC9B5C,EAAI8a,KAAmB,IAANlY,EAmBnB,OAhBwB,IAApB8X,IACF9X,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,EAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACvC8E,EAAI8a,KAAmB,IAANlY,GAGK,IAApB8X,IACF9X,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,GAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACpC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACvC8E,EAAI8a,KAAclY,GAAO,EAAK,IAC9B5C,EAAI8a,KAAmB,IAANlY,GAGZ5C,CACT,EA5FA5I,EAAQ4jB,cAkHR,SAAwBC,GAQtB,IAPA,IAAIrY,EACArI,EAAM0gB,EAAM3iB,OACZ4iB,EAAa3gB,EAAM,EACnB4gB,EAAQ,GACRC,EAAiB,MAGZlgB,EAAI,EAAGmgB,EAAO9gB,EAAM2gB,EAAYhgB,EAAImgB,EAAMngB,GAAKkgB,EACtDD,EAAMvR,KAAK0R,EAAYL,EAAO/f,EAAIA,EAAIkgB,EAAkBC,EAAOA,EAAQngB,EAAIkgB,IAqB7E,OAjBmB,IAAfF,GACFtY,EAAMqY,EAAM1gB,EAAM,GAClB4gB,EAAMvR,KACJ2R,EAAO3Y,GAAO,GACd2Y,EAAQ3Y,GAAO,EAAK,IACpB,OAEsB,IAAfsY,IACTtY,GAAOqY,EAAM1gB,EAAM,IAAM,GAAK0gB,EAAM1gB,EAAM,GAC1C4gB,EAAMvR,KACJ2R,EAAO3Y,GAAO,IACd2Y,EAAQ3Y,GAAO,EAAK,IACpB2Y,EAAQ3Y,GAAO,EAAK,IACpB,MAIGuY,EAAMK,KAAK,GACpB,EA1IA,IALA,IAAID,EAAS,GACTR,EAAY,GACZH,EAA4B,oBAAfxiB,WAA6BA,WAAamI,MAEvDkb,EAAO,mEACFvgB,EAAI,EAAsBA,EAAbugB,KAAwBvgB,EAC5CqgB,EAAOrgB,GAAKugB,EAAKvgB,GACjB6f,EAAUU,EAAKrD,WAAWld,IAAMA,EAQlC,SAASsf,EAASF,GAChB,IAAI/f,EAAM+f,EAAIhiB,OAEd,GAAIiC,EAAM,EAAI,EACZ,MAAM,IAAIxC,MAAM,kDAKlB,IAAI0iB,EAAWH,EAAIoB,QAAQ,KAO3B,OANkB,IAAdjB,IAAiBA,EAAWlgB,GAMzB,CAACkgB,EAJcA,IAAalgB,EAC/B,EACA,EAAKkgB,EAAW,EAGtB,CAmEA,SAASa,EAAaL,EAAOU,EAAOC,GAGlC,IAFA,IAAIhZ,EARoBsE,EASpBjO,EAAS,GACJiC,EAAIygB,EAAOzgB,EAAI0gB,EAAK1gB,GAAK,EAChC0H,GACIqY,EAAM/f,IAAM,GAAM,WAClB+f,EAAM/f,EAAI,IAAM,EAAK,QACP,IAAf+f,EAAM/f,EAAI,IACbjC,EAAO2Q,KAdF2R,GADiBrU,EAeMtE,IAdT,GAAK,IACxB2Y,EAAOrU,GAAO,GAAK,IACnBqU,EAAOrU,GAAO,EAAI,IAClBqU,EAAa,GAANrU,IAaT,OAAOjO,EAAOuiB,KAAK,GACrB,CAlGAT,EAAU,IAAI3C,WAAW,IAAM,GAC/B2C,EAAU,IAAI3C,WAAW,IAAM,8BClB/Bhf,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQykB,SAAWzkB,EAAQ0kB,SAAW1kB,EAAQ2kB,iBAAmB3kB,EAAQ4kB,WAAa5kB,EAAQ6kB,cAAW,EACzG,MAAMC,EAAa,EAAQ,KACrBC,EAAc,EAAQ,KACtBC,EAAU,EAAQ,IACxBhlB,EAAQ6kB,SAAW,CACfI,QAAS,CACLC,MAAO,GACPC,KAAM,IAEVC,QAAS,CACLF,MAAO,GACPC,KAAM,KAId,MAAME,EAAyB,CAAC,EAChCA,EAAuB,GAAKrlB,EAAQ6kB,SAASI,QAAQC,MACrDG,EAAuB,GAAKrlB,EAAQ6kB,SAASI,QAAQE,KACrDE,EAAuB,KAAOrlB,EAAQ6kB,SAASO,QAAQF,MACvDG,EAAuB,KAAOrlB,EAAQ6kB,SAASO,QAAQD,KAEvD,MAAMG,EAAyB,CAAC,EAahC,SAASV,EAAWW,EAASC,GACzB,IAAKA,EAAWC,MAAM,qBAClB,MAAM,IAAI9kB,MAAM,8CAGpB,MAAO,KADW,EAAImkB,EAAWY,gBAAgBH,EAASC,IAE9D,CAOA,SAASb,EAAiBgB,GACtB,GAAIA,EAAQzkB,QAAU,EAClB,MAAM,IAAIP,MAAM,uCAEpB,GAAkB,KAAdglB,EAAQ,GACR,MAAM,IAAIhlB,MAAM,4CAEpB,OAAO,EAAImkB,EAAWc,gBAAgBD,EAAQ5gB,MAAM,GACxD,CAjCAugB,EAAuBtlB,EAAQ6kB,SAASI,QAAQC,OAAS,EACzDI,EAAuBtlB,EAAQ6kB,SAASI,QAAQE,MAAQ,EACxDG,EAAuBtlB,EAAQ6kB,SAASO,QAAQF,OAAS,IACzDI,EAAuBtlB,EAAQ6kB,SAASO,QAAQD,MAAQ,IAgBxDnlB,EAAQ4kB,WAAaA,EAerB5kB,EAAQ2kB,iBAAmBA,EAyB3B3kB,EAAQ0kB,SAhBR,SAAkBmB,EAAUN,GAAU,GAClC,MAAMO,EAAWf,EAAY/B,OAAO6C,GAC9BE,GAAgB,EAAIf,EAAQxc,YAAYsd,EAAS7iB,MACjD+iB,EAAc/b,UAAS,EAAI+a,EAAQxc,YAAYsd,EAASlO,QAAS,IACvE,IAAIqO,EAUJ,OATIV,EAAU,GACVU,EAAgBD,OAC4B3gB,IAAxCggB,EAAuBW,KACvBC,EAAgBZ,EAAuBW,KAI3CC,EAAgBV,EAEbX,EAAWqB,EAAeF,EACrC,EA6BA/lB,EAAQykB,SApBR,SAAkByB,EAAWX,GAAU,GACnC,MAAMO,EAAWnB,EAAiBuB,GAC5BD,EAAgBH,EAAS,GACzBC,EAAgBD,EAAS,GAC/B,IAAIK,EACAZ,EAAU,GACVY,EAAiBF,OAC6B5gB,IAA1CigB,EAAuBW,KACvBE,EAAiBb,EAAuBW,KAI5CE,EAAiBZ,EAErB,IAAI3N,EAASuO,EAAe7c,SAAS,IAIrC,OAHsB,IAAlBsO,EAAO1W,SACP0W,EAAS,IAAIA,KAEVmN,EAAYrb,OAAOqc,EAAenO,EAC7C,8BCxGA5V,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgjB,OAAShjB,EAAQ0J,YAAS,EAClC,MAAM0c,EAAW,EAAQ,IACnBpB,EAAU,EAAQ,IAClBqB,EAAQ,EAAQ,KAChBhF,EAAW,6DAUjBrhB,EAAQ0J,OATR,SAAgBzG,EAAM2U,EAAS,MAC3B,MAAM0O,EAA4B,iBAATrjB,GAAoB,EAAI+hB,EAAQzc,YAAYtF,GAAQA,EACvEsjB,EAAgC,iBAAX3O,GAAsB,EAAIoN,EAAQzc,YAAYqP,GAAU3U,EACnF,KAAMqjB,aAAqBtlB,YAAiBulB,aAAuBvlB,YAC/D,MAAM,IAAIC,UAAU,iDAExB,MAAMulB,GAAW,EAAIJ,EAASjgB,SAAQ,EAAIigB,EAASjgB,QAAQ,IAAInF,WAAW,IAAIulB,KAAgBD,MAC9F,OAAOD,EAAMhF,GAAU3X,OAAO,IAAI6c,KAAgBD,KAAcE,EAASzhB,MAAM,EAAG,IACtF,EAeA/E,EAAQgjB,OAbR,SAAgBC,GACZ,MAAMniB,EAAQulB,EAAMhF,GAAU2B,OAAOC,GAC/BsD,EAAczlB,EAAMiE,MAAM,EAAG,GAC7BuhB,EAAYxlB,EAAMiE,MAAM,GAAI,GAE5ByhB,GAAW,EAAIJ,EAASjgB,SAAQ,EAAIigB,EAASjgB,QAAQ,IAAInF,WAAW,IAAIulB,KAAgBD,MAM9F,OALAxlB,EAAMiE,OAAO,GAAGyb,SAAQ,CAACiG,EAAOC,KAC5B,GAAID,IAAUD,EAASE,GACnB,MAAM,IAAI/lB,MAAM,mBACpB,IAEG,CAAEiX,OAAQ2O,EAAatjB,KAAMqjB,EACxC,8BCjCAtkB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ4lB,eAAiB5lB,EAAQ0lB,oBAAiB,EAClD,MAAMU,EAAW,EAAQ,IACnBpB,EAAU,EAAQ,IAClB2B,EAAa,EAAQ,KAM3B,SAASC,EAAYC,GACjB,MAAMC,GAAW,EAAIV,EAASjgB,SAAQ,EAAIigB,EAASjgB,SAAQ,EAAI6e,EAAQzc,YAAYse,KAEnF,OADiB,EAAI7B,EAAQxc,YAAYse,EAAS/hB,MAAM,EAAG,GAE/D,CA+BA/E,EAAQ0lB,eAnBR,SAAwBH,EAAStiB,GAC7B,GAAIsiB,EAAU,GAAKA,GAAW,GAC1B,MAAM,IAAI5kB,MAAM,8CAEpB,IAAKsC,EAAKwiB,MAAM,kBACZ,MAAM,IAAI9kB,MAAM,oCAEpBsC,EAAOA,EAAK8jB,eACH7lB,OAAS,GAAM,IACpB+B,EAAO,IAAIA,KAEf,IAAI+jB,EAAazB,EAAQjc,SAAS,IACR,IAAtB0d,EAAW9lB,SACX8lB,EAAa,IAAIA,KAErB,MAAMC,EAAcL,EAAY,GAAGI,IAAa/jB,KAC1CikB,GAAS,EAAIP,EAAWQ,WAAW,GAAGlkB,IAAOgkB,KACnD,MAAO,GAAGN,EAAWS,IAAI7B,KAAW2B,GACxC,EA6BAlnB,EAAQ4lB,eAfR,SAAwByB,GACpBA,GAAU,EAAIV,EAAWW,cAAcD,GACvC,MAAMR,GAAU,EAAIF,EAAWY,WAAWF,EAAQtiB,MAAM,IAClDyiB,EAAcH,EAAQ,GACtB9B,EAAUoB,EAAWS,IAAI9C,QAAQkD,GACjChB,EAAWK,EAAQ9hB,OAAO,GAChC,IAAIiiB,EAAazB,EAAQjc,SAAS,IAIlC,GAH0B,IAAtB0d,EAAW9lB,SACX8lB,EAAa,IAAIA,KAEjBJ,EAAY,GAAGI,IAAaH,EAAQY,UAAU,EAAGZ,EAAQ3lB,OAAS,QAAUslB,EAC5E,MAAM,IAAI7lB,MAAM,8CAEpB,MAAO,CAAC4kB,EAASsB,EAAQY,UAAU,EAAGZ,EAAQ3lB,OAAS,GAC3D,8BCxEAc,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQunB,UAAYvnB,EAAQsnB,aAAetnB,EAAQmnB,UAAYnnB,EAAQonB,SAAM,EAC7E,MAAMpC,EAAU,EAAQ,IACxBhlB,EAAQonB,IAAM,mCACd,MAAMxd,EAAM,mBAkEZ,SAAS0d,EAAaI,GAIlB,OAAOA,EAASC,cAAcC,QAAQ,KAAM,KAAKA,QAAQ,OAAQ,IACrE,CAXA5nB,EAAQmnB,UApDR,SAAmBU,EAAUC,GAEzB,IAAKD,EAASpC,MAAM,kBAChB,MAAM,IAAI9kB,MAAM,4BAEhBknB,EAAS3mB,OAAS,GAAM,IACxB2mB,EAAW,IAAIA,KAGnB,IAAI/iB,EAAM,GACNqd,EAAQ,EACZ,IAAK,IAAIre,GAHT+jB,EAAWA,EAASd,eAGE7lB,OAAS,EAAG4C,GAAK,EAAGA,IACtC,GAAIqe,EAAQ,EAAG,CACX,MAAM4F,EAAcne,EAAI0a,QAAQuD,EAAS/jB,KAAOqe,EAChD,IAAI6F,EAAW,EACL,IAANlkB,IACAkkB,EAAWpe,EAAI0a,QAAQuD,EAAS/jB,EAAI,KAGxC,MAAMmkB,EAAW,EAAI9F,EACf+F,EAAcF,GAAY,GAAKC,IAAc,EAAIA,EACjDE,EAAcnoB,EAAQonB,IAAIW,EAAcG,GAC9C/F,EAAQ8F,EACRnjB,EAAIsjB,QAAQD,EAChB,MAEIhG,EAAQ,EAGhB,IAAIkG,EAAkB,EACtB,IAAK,IAAIvkB,EAAI,EAAGA,EAAIgB,EAAI5D,QACL,MAAX4D,EAAIhB,GADoBA,IAKxBukB,IAGRvjB,EAAMA,EAAIC,MAAMsjB,GAChB,MAAMC,GAAa,IAAIC,aAAcvF,QAAO,EAAIgC,EAAQzc,YAAYsf,IAAWpC,MAAM,YAC/E+C,EAA2BF,EAAaA,EAAW,GAAGpnB,OAAS,EACrE,IAAK,IAAI4C,EAAI,EAAGA,EAAI0kB,EAA0B1kB,IAC1CgB,EAAIsjB,QAAQpoB,EAAQonB,IAAI,IAE5B,GAAIU,EAAW,CACX,MAAMW,EAAQX,EAAYhjB,EAAI5D,OAC9B,IAAK,IAAI4C,EAAI,EAAGA,EAAI2kB,EAAO3kB,IACvBgB,EAAIsjB,QAAQpoB,EAAQonB,IAAI,GAEhC,CACA,OAAOtiB,EAAIsf,KAAK,GACpB,EAaApkB,EAAQsnB,aAAeA,EA+DvBtnB,EAAQunB,UAtDR,SAAmBG,EAAUI,GAGzB,KAFAJ,EAAWJ,EAAaI,IAEVjC,MAAM,KAAKzlB,EAAQonB,UAC7B,MAAM,IAAIzmB,MAAM,4BAEpB,MAAM2nB,EAAaZ,EAASjC,MAAM,IAAIzlB,EAAQonB,IAAI,OAC5CsB,EAAsBJ,EAAaA,EAAW,GAAGpnB,OAAS,EAChE,IAAI4D,EAAM,GACNqd,EAAQ,EACRwG,EAAY,EAChB,IAAK,IAAI7kB,EAAI4jB,EAASxmB,OAAS,EAAG4C,GAAK,EAAGA,IAAK,CACzB,IAAd6kB,IACA7jB,EAAIsjB,QAAQxe,EAAIuY,IAChBwG,EAAY,EACZxG,EAAQ,GAEZ,MACMyG,GADc5oB,EAAQonB,IAAI9C,QAAQoD,EAAS5jB,KAAO6kB,GACrBxG,EAC7B0G,EAAkBjf,EAAIgf,EAAe,IAG3C,GAFAD,GAAa,EACbxG,EAAQyG,GAAgB,EACpBzG,EAAQ,GAAKwG,EACb,MAAM,IAAIhoB,MAAM,4BAEpBmE,EAAIsjB,QAAQS,EAChB,CAEA/jB,EAAIsjB,QAAQxe,EAAIuY,IACZrd,EAAI5D,OAAS,GAAM,GACnB4D,EAAIsjB,QAAQ,KAEhB,IAAIU,EAAkB,EACtB,IAAK,IAAIhlB,EAAI,EAAGA,EAAIgB,EAAI5D,QACL,MAAX4D,EAAIhB,GADoBA,IAKxBglB,IAGRhkB,EAAMA,EAAIC,MAAM+jB,EAAmBA,EAAkB,GACrD,IAAIC,EAASjkB,EAAIsf,KAAK,IACtB,IAAK,IAAItgB,EAAI,EAAGA,EAAI4kB,EAAqB5kB,IACrCilB,EAAS,KAAKA,IAElB,GAAIjB,EAAW,CACX,MAAMW,EAAoB,EAAZX,EAAgBiB,EAAO7nB,OACrC,IAAK,IAAI4C,EAAI,EAAGA,EAAI2kB,EAAO3kB,GAAK,EAC5BilB,EAAS,KAAKA,GAEtB,CACA,OAAOA,CACX,8BCzI2G/oB,EAAQ,QAAuG,EACvM,EAAQ,KAIR,EAAQ,KAJ3B,MAOMgpB,EAAY,EAAQ,IAC1BhnB,OAAOC,eAAejC,EAAS,KAA/B,CAA+CipB,YAAY,EAAMrkB,IAAK,WAAc,OAAOokB,EAAUpE,UAAY,0CCVjH5iB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgjB,OAAShjB,EAAQ0J,OAAS1J,EAAQkpB,SAAWlpB,EAAQmpB,OAASnpB,EAAQ6F,SAAM,EACpF,MAAMujB,EAAc,EAAQ,KAC5B,SAASvjB,EAAIwjB,GACT,MAAO,GAAGA,IAAS,IAAItG,OAAO,GAAKsG,EAAOnoB,OAAS,GAAK,KAC5D,CAEA,SAASioB,EAAOE,GACZ,OAAOA,EAAOzB,QAAQ,KAAM,IAAIA,QAAQ,MAAO,KAAKA,QAAQ,MAAO,IACvE,CAEA,SAASsB,EAASI,GACd,OAAOzjB,EAAIyjB,GAAW1B,QAAQ,KAAM,KAAKA,QAAQ,KAAM,IAC3D,CAPA5nB,EAAQ6F,IAAMA,EAId7F,EAAQmpB,OAASA,EAIjBnpB,EAAQkpB,SAAWA,EAInBlpB,EAAQ0J,OAHR,SAAgB2f,GACZ,OAAOF,GAAO,EAAIC,EAAYxF,gBAAe,IAAIna,aAAcC,OAAO2f,IAC1E,EAKArpB,EAAQgjB,OAHR,SAAgBsG,GACZ,OAAO,IAAIf,aAAcvF,QAAO,EAAIoG,EAAY7F,aAAa1d,EAAIqjB,EAASI,KAC9E,8BCrBAtnB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQupB,cAAgBvpB,EAAQwpB,qBAAkB,EAClD,MAAMC,EAAc,EAAQ,KAC5BznB,OAAOC,eAAejC,EAAS,kBAAmB,CAAEipB,YAAY,EAAMrkB,IAAK,WAAc,OAAO6kB,EAAYD,eAAiB,IAC7H,MAAMD,EAAgB,CAClBG,OAAQD,EAAYD,iBAExBxpB,EAAQupB,cAAgBA,8BCPxBvnB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQwpB,qBAAkB,EAC1B,MAAMG,EAAS,EAAQ,KACjBvD,EAAW,EAAQ,IACnBwD,EAAO,EAAQ,KACfC,EAAsB,EAAQ,KAC9BC,EAAW,EAAQ,KACnB9E,EAAU,EAAQ,IAExB4E,EAAK/d,MAAMgV,eAAiB,CAAClb,KAAQokB,KACjC,MAAMzlB,EAAIqlB,EAAOnkB,KAAKnE,OAAO+kB,EAASjgB,OAAQR,GAE9C,OADAokB,EAAKvJ,SAAQ9U,GAAOpH,EAAEtB,OAAO0I,KACtBpH,EAAEO,QAAQ,EAErB,MAAM2kB,EACF,sBAAOQ,CAAgBjT,EAAYkT,GAAa,GAQ5C,OAP0B,KAAtBlT,EAAW7V,SACX6V,EAAaA,EAAWhS,MAAM,EAAG,KAEjCgS,EAAW7V,OAAS,KAEpB6V,EAAaA,EAAWxN,SAAS,GAAI,OAElC,EAAIyb,EAAQxc,YAAYohB,EAAKxd,aAAa2K,EAAYkT,GACjE,CACA,eAAOC,CAASC,EAAkBpT,EAAYqT,EAAS,QAEnD,IAAKD,IAAqBpT,EACtB,MAAM,IAAI+S,EAASO,uBAAuB,yDAE9C,MAAMC,EAAeV,EAAK5d,SAASme,EAAkBpT,EAAWhS,MAAM,EAAG,IAAK,CAC1EmY,KAAK,EACLE,WAAW,IAEf,GAAe,QAAXgN,EACA,OAAO,EAAIpF,EAAQxc,YAAY8hB,GACnC,GAAe,SAAXF,EACA,OAAO,EAAIP,EAAoBU,WAAWD,EAAc,SAC5D,MAAM3pB,MAAM,2BAChB,CACA,oBAAO6pB,CAAcC,GAEjB,OAAO,EAAIZ,EAAoBa,WAAWD,EAAe,QAC7D,CACA,iBAAOE,CAAWR,EAAkBS,EAAmBzO,GAEnD,IAAKgO,IAAqBS,IAAsBzO,EAC5C,MAAM,IAAI2N,EAASO,uBAAuB,wEAE9C,OAAOT,EAAK7d,OAAO6e,EAAmBT,EAAkBhO,EAAW,CAAEwB,QAAQ,GACjF,EAEJ3d,EAAQwpB,gBAAkBA,EAC1BA,EAAgBqB,cAAgB,2CCrDhC,IAAIC,EAAa1qB,MAAQA,KAAK0qB,WAAc,SAAUC,EAASC,EAAYje,EAAGke,GAE1E,OAAO,IAAKle,IAAMA,EAAIme,WAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUnpB,GAAS,IAAMopB,EAAKL,EAAUM,KAAKrpB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC1F,SAASyO,EAAStpB,GAAS,IAAMopB,EAAKL,EAAiB,MAAE/oB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC7F,SAASuO,EAAKxgB,GAJlB,IAAe5I,EAIa4I,EAAO2gB,KAAON,EAAQrgB,EAAO5I,QAJ1CA,EAIyD4I,EAAO5I,MAJhDA,aAAiB6K,EAAI7K,EAAQ,IAAI6K,GAAE,SAAUoe,GAAWA,EAAQjpB,EAAQ,KAIjBwpB,KAAKL,EAAWG,EAAW,CAC7GF,GAAML,EAAYA,EAAUU,MAAMZ,EAASC,GAAc,KAAKO,OAClE,GACJ,EACAvpB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ4rB,gBAAkB5rB,EAAQ6rB,gBAAa,EAC/C,MAAMzF,EAAW,EAAQ,IACzB,SAASyF,EAAWC,GAChB,OAAO,EAAI1F,EAASjgB,QAAQ2lB,EAChC,CACA9rB,EAAQ6rB,WAAaA,EA6BrB7rB,EAAQ4rB,gBA5BR,SAAyBE,GACrB,OAAOhB,EAAU1qB,UAAM,OAAQ,GAAQ,YACnC,IAEI,GADkD,oBAAX+E,aAAmD,IAAlBA,OAAOmb,OAClD,CAEzB,MAAMxf,EAAyB,iBAAVgrB,GAAqB,IAAIriB,aAAcC,OAAOoiB,GAASA,EACtE1qB,QAAa+D,OAAOmb,OAAOzb,OAAO,UAAW/D,GACnD,OAAO,IAAIE,WAAWI,EAC1B,CACK,CAED,MAAMoL,EAAa,EAAQ,KAC3B,IAAKA,EAAW+T,WACZ,MAAM,IAAI5f,MAAM,iDAEpB,OAAOuqB,QAAQC,QAAQ3e,EAAW+T,WAAW,UAAUvd,OAAO8oB,GAAOjnB,SACzE,CACJ,CACA,MAAOuX,GAKH,OAJA2P,QAAQpK,IAAIvF,GACZ2P,QAAQpK,IAAI,0LAGLuJ,QAAQC,QAAQU,EAAWC,GACtC,CACJ,GACJ,8BC3CA9pB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgsB,iBAAc,EACtB,MAAMC,EAAY,EAAQ,KAmC1BjsB,EAAQgsB,YAlCR,SAAqBE,GACjB,GAAqB,iBAAVA,EAAoB,CAE3B,MAAMC,EAAaD,EAAME,MAAM,KAK/B,MAAO,CACHvV,OALWwV,KAAKC,MAAML,EAAUjJ,OAAOmJ,EAAW,KAMlDI,QALYF,KAAKC,MAAML,EAAUjJ,OAAOmJ,EAAW,KAMnDhV,UALcgV,EAAW,GAOjC,CACK,GAAqB,iBAAVD,EAAoB,CAChC,GAA6B,iBAAlBA,EAAMK,QACb,MAAM,IAAI5rB,MAAM,wDAEpB,IAAI4rB,EAAUL,EAAMK,QACK,MAArBL,EAAMK,QAAQ,KACdA,EAAUN,EAAUjJ,OAAOuJ,IAE/B,MAAMC,EAAa,GAKnB,OAJAN,EAAMrV,OAAO5G,KAAKwc,IACd,MAAM5V,EAASwV,KAAKC,MAAML,EAAUjJ,OAAOyJ,IAC3CD,EAAWha,KAAKqE,EAAO,IAEpB,CACHA,OAAQ2V,EACRD,QAASF,KAAKC,MAAMC,GACpBpV,UAAW+U,EAAM/U,UAEzB,CACJ,8BCtBAnV,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ0qB,UAAY1qB,EAAQuqB,eAAY,EAExC,MAAMnB,EAAc,EAAQ,KACtBsD,EAAc,EAAQ,KAC5B,SAASC,EAAaC,GAClB,OAASA,EAAU,EAAK,IAAMA,EAAU,GAAM,EAAI,EAAI,EAC1D,CACA,MAAMC,EAAmB,CACrBC,MAAOH,EAAa,KACpBI,MAAOJ,EAAa,KACpBK,MAAOL,EAAa,MAExB,SAASM,EAAoBC,GACzB,MAAMC,EAAaN,EAAiBK,GACpC,GAAIC,EACA,OAAOA,EAEX,MAAM,IAAIxsB,MAAM,sBAAsBusB,KAC1C,CACA,MAAME,EAAY,IAOlB,SAASC,EAAiBlW,GACtB,GAAIA,aAAqBnW,WACrB,OAAOmW,EAEN,GAAI,iBAAoBA,EACzB,OAAO,EAAIiS,EAAY7F,cAAa,EAAImJ,EAAY7mB,KAAKsR,IAE7D,MAAM,IAAIlW,UAAU,0DACxB,CA6DA,SAASqsB,EAAavnB,EAAKwe,EAAOgJ,GAC9B,IAAIC,EAAU,EACd,KAAOjJ,EAAQiJ,EAAUD,GAAiC,IAAzBxnB,EAAIwe,EAAQiJ,MACvCA,EAMN,OAJkBznB,EAAIwe,EAAQiJ,IAAYJ,KAEpCI,EAECA,CACX,CAXAxtB,EAAQuqB,UA3DR,SAAmBpT,EAAW+V,GAC1B,MAAMO,EAAiBJ,EAAiBlW,GAClCgW,EAAaF,EAAoBC,GAGjCQ,EAAwBP,EAAa,EACrCQ,EAAcF,EAAevsB,OACnC,IAAImG,EAAS,EACb,GAnBoBumB,KAmBhBH,EAAepmB,KACf,MAAM,IAAI1G,MAAM,iCAEpB,IAAIktB,EAAYJ,EAAepmB,KAI/B,GAHkB,MAAdwmB,IACAA,EAAYJ,EAAepmB,MAE3BsmB,EAActmB,EAASwmB,EACvB,MAAM,IAAIltB,MAAM,8BAA8BktB,aAAqBF,EAActmB,gBAErF,GA5BoBymB,IA4BhBL,EAAepmB,KACf,MAAM,IAAI1G,MAAM,yCAEpB,MAAMotB,EAAUN,EAAepmB,KAC/B,GAAIsmB,EAActmB,EAAS,EAAI0mB,EAC3B,MAAM,IAAIptB,MAAM,4BAA4BotB,aAAmBJ,EAActmB,EAAS,gBAE1F,GAAIqmB,EAAwBK,EACxB,MAAM,IAAIptB,MAAM,4BAA4BotB,eAAqBL,oBAErE,MAAMM,EAAU3mB,EAEhB,GADAA,GAAU0mB,EAvCUD,IAwChBL,EAAepmB,KACf,MAAM,IAAI1G,MAAM,yCAEpB,MAAMstB,EAAUR,EAAepmB,KAC/B,GAAIsmB,EAActmB,IAAW4mB,EACzB,MAAM,IAAIttB,MAAM,4BAA4BstB,iBAAuBN,EAActmB,MAErF,GAAIqmB,EAAwBO,EACxB,MAAM,IAAIttB,MAAM,4BAA4BstB,eAAqBP,oBAErE,MAAMQ,EAAU7mB,EAEhB,GADAA,GAAU4mB,EACN5mB,IAAWsmB,EACX,MAAM,IAAIhtB,MAAM,0CAA0CgtB,EAActmB,mBAE5E,MAAM8mB,EAAWhB,EAAaY,EACxBK,EAAWjB,EAAac,EACxBI,EAAM,IAAIrtB,WAAWmtB,EAAWJ,EAAUK,EAAWH,GAC3D,IAAK5mB,EAAS,EAAGA,EAAS8mB,IAAY9mB,EAClCgnB,EAAIhnB,GAAU,EAElBgnB,EAAI9qB,IAAIkqB,EAAejqB,SAASwqB,EAAU1qB,KAAKgrB,KAAKH,EAAU,GAAIH,EAAUD,GAAU1mB,GACtFA,EAAS8lB,EACT,IAAK,MAAMoB,EAAIlnB,EAAQA,EAASknB,EAAIH,IAAY/mB,EAC5CgnB,EAAIhnB,GAAU,EAGlB,OADAgnB,EAAI9qB,IAAIkqB,EAAejqB,SAAS0qB,EAAU5qB,KAAKgrB,KAAKF,EAAU,GAAIF,EAAUD,GAAU5mB,IAC/E,EAAIqlB,EAAYvD,SAAQ,EAAIC,EAAYxF,eAAeyK,GAClE,EA+DAruB,EAAQ0qB,UAlDR,SAAmBvT,EAAW+V,GAC1B/V,EAAYkW,EAAiBlW,GAC7B,MAAMgW,EAAaF,EAAoBC,GACjCO,EAAiBtW,EAAUjW,OACjC,GAAIusB,IAAgC,EAAbN,EACnB,MAAM,IAAIlsB,UAAU,IAAIisB,0BAAyC,EAAbC,kBAA+BM,MAEvF,MAAMU,EAAWb,EAAanW,EAAW,EAAGgW,GACtCiB,EAAWd,EAAanW,EAAWgW,EAAYhW,EAAUjW,QACzD6sB,EAAUZ,EAAagB,EACvBF,EAAUd,EAAaiB,EACvBI,EAAU,EAAQT,EAAU,EAAI,EAAIE,EACpCQ,EAAcD,EAAUpB,EACxBiB,EAAM,IAAIrtB,YAAYytB,EAAc,EAAI,GAAKD,GACnD,IAAInnB,EAAS,EAkCb,OAjCAgnB,EAAIhnB,KAjGgBumB,GAkGhBa,EAGAJ,EAAIhnB,KAAYmnB,GAKhBH,EAAIhnB,KAAY+lB,IAEhBiB,EAAIhnB,KAAsB,IAAVmnB,GAEpBH,EAAIhnB,KA7GgBymB,EA8GpBO,EAAIhnB,KAAY0mB,EACZI,EAAW,GACXE,EAAIhnB,KAAY,EAChBgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS,EAAG2pB,GAAa9lB,GAC3CA,GAAU8lB,IAGVkB,EAAI9qB,IAAI4T,EAAU3T,SAAS2qB,EAAUhB,GAAa9lB,GAClDA,GAAU8lB,EAAagB,GAE3BE,EAAIhnB,KAxHgBymB,EAyHpBO,EAAIhnB,KAAY4mB,EACZG,EAAW,GACXC,EAAIhnB,KAAY,EAChBgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS2pB,GAAa9lB,IAGxCgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS2pB,EAAaiB,GAAW/mB,GAEhDgnB,CACX,4BC1KArsB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ0uB,kBAAoB1uB,EAAQqqB,4BAAyB,EAC7D,MAAMA,UAA+B1pB,MACjC,WAAA6B,CAAYyD,GACRtD,QACAvC,KAAKyY,KAAO,yBACZzY,KAAK6F,QAAUA,GAAW,EAC9B,EAEJjG,EAAQqqB,uBAAyBA,EACjC,MAAMqE,UAA0B/tB,MAC5B,WAAA6B,CAAYyD,GACRtD,QACAvC,KAAKyY,KAAO,oBACZzY,KAAK6F,QAAUA,GAAW,EAC9B,EAEJjG,EAAQ0uB,kBAAoBA,oCCjB5B,IAAIC,EAAmBvuB,MAAQA,KAAKuuB,kBAAqB3sB,OAAOX,OAAS,SAAUktB,EAAG/T,EAAGlN,EAAGU,QAC7E3I,IAAP2I,IAAkBA,EAAKV,GAC3B,IAAIshB,EAAO5sB,OAAO6sB,yBAAyBrU,EAAGlN,GACzCshB,KAAS,QAASA,GAAQpU,EAAEsU,WAAaF,EAAKG,UAAYH,EAAKzN,gBAClEyN,EAAO,CAAE3F,YAAY,EAAMrkB,IAAK,WAAa,OAAO4V,EAAElN,EAAI,IAE5DtL,OAAOC,eAAessB,EAAGvgB,EAAI4gB,EAChC,EAAI,SAAUL,EAAG/T,EAAGlN,EAAGU,QACT3I,IAAP2I,IAAkBA,EAAKV,GAC3BihB,EAAEvgB,GAAMwM,EAAElN,EACb,GACG0hB,EAAgB5uB,MAAQA,KAAK4uB,cAAiB,SAASxU,EAAGxa,GAC1D,IAAK,IAAImP,KAAKqL,EAAa,YAANrL,GAAoBnN,OAAOmJ,UAAU8jB,eAAe7jB,KAAKpL,EAASmP,IAAIwf,EAAgB3uB,EAASwa,EAAGrL,EAC3H,EACAnN,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtD8sB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAehvB,GACpCgvB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAoBhvB,qCCnBzC,IAAI8qB,EAAa1qB,MAAQA,KAAK0qB,WAAc,SAAUC,EAASC,EAAYje,EAAGke,GAE1E,OAAO,IAAKle,IAAMA,EAAIme,WAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUnpB,GAAS,IAAMopB,EAAKL,EAAUM,KAAKrpB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC1F,SAASyO,EAAStpB,GAAS,IAAMopB,EAAKL,EAAiB,MAAE/oB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC7F,SAASuO,EAAKxgB,GAJlB,IAAe5I,EAIa4I,EAAO2gB,KAAON,EAAQrgB,EAAO5I,QAJ1CA,EAIyD4I,EAAO5I,MAJhDA,aAAiB6K,EAAI7K,EAAQ,IAAI6K,GAAE,SAAUoe,GAAWA,EAAQjpB,EAAQ,KAIjBwpB,KAAKL,EAAWG,EAAW,CAC7GF,GAAML,EAAYA,EAAUU,MAAMZ,EAASC,GAAc,KAAKO,OAClE,GACJ,EACAvpB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQkvB,YAAclvB,EAAQmvB,0BAAuB,EACrD,MAAMlD,EAAY,EAAQ,KACpBmD,EAAkB,EAAQ,KAC1BtF,EAAW,EAAQ,KACnB1D,EAAW,EAAQ,KACzB,SAASiJ,EAAmB9C,EAAS1V,GACjC,MAAMsV,EAAa,GAEbmD,EAAgBrD,EAAUviB,OAAO2iB,KAAKkD,UAAU1Y,IACtDsV,EAAW3Z,KAAK8c,GAEhB,MAAME,EAAiBvD,EAAUviB,OAAO2iB,KAAKkD,UAAUhD,IAKvD,OAJAJ,EAAW3Z,KAAKgd,GAEKrD,EAAW/H,KAAK,IAGzC,CAKApkB,EAAQmvB,qBAJR,SAA8B5C,GAE1B,OAAO8C,EAAmB9C,EADX,CAAEkD,IAAK,MAAOvC,IAAK,SACW,GACjD,EAwDAltB,EAAQkvB,YAtDR,MACI,WAAA1sB,CAAYktB,EAAkBC,GAC1B,IAAMD,IAAoBC,EACtB,MAAM,IAAI7F,EAASO,uBAAuB,oDAE9C,GAAgC,iBAArBqF,EACP,MAAM,IAAI/uB,MAAM,gDAGpB,GADA+uB,EAAmBA,EAAiB/H,eAC/ByH,EAAgB7F,cAAc0F,eAAeS,GAC9C,MAAM,IAAI/uB,MAAM,6BAEpBP,KAAKwvB,UAAY,MACjBxvB,KAAKyvB,aAAeT,EAAgB7F,cAAcmG,GAClDtvB,KAAKuvB,cAAgBA,CACzB,CACA,MAAA9Y,CAAOA,EAAS,CAAC,GACb,MAAMiZ,EAAgB,CAAEL,IAAKrvB,KAAKwvB,UAAW1C,IAAK9sB,KAAKyvB,aAAahF,eACpE,OAAO7oB,OAAOqJ,OAAO,CAAC,EAAGykB,EAAejZ,EAC5C,CACA,IAAA5K,CAAKsgB,EAASwD,GAAW,EAAOC,EAAe,CAAC,GAE5C,MAAMnZ,EAASzW,KAAKyW,OAAOmZ,GAErBC,EAAeZ,EAAmB9C,EAAS1V,GAC3CsT,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAO7vB,KAAK8vB,qBAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,EAC9E,CACA,SAAAgG,CAAU5D,EAASwD,GAAW,EAAOC,EAAe,CAAC,GACjD,OAAOlF,EAAU1qB,UAAM,OAAQ,GAAQ,YAEnC,MAAMyW,EAASzW,KAAKyW,OAAOmZ,GAErBC,EAAeZ,EAAmB9C,EAAS1V,GAC3CsT,QAAyB,EAAI/D,EAASwF,iBAAiBqE,GAC7D,OAAO7vB,KAAK8vB,qBAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,EAC9E,GACJ,CACA,oBAAA+F,CAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,GAE1D,MAAMhT,EAAY/W,KAAKyvB,aAAa3F,SAASC,EAAkB/pB,KAAKuvB,eACpE,OAAII,EACoB,CAChBlZ,OAAQ,CAACoV,EAAUviB,OAAO2iB,KAAKkD,UAAU1Y,KACzC0V,QAASF,KAAKkD,UAAUhD,GACxBpV,UAAW,CAACA,IAKT,CAAC8Y,EAAc9Y,GAAWiN,KAAK,IAE9C,+BCrFJpiB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQowB,mBAAgB,EACxB,MAAMnE,EAAY,EAAQ,KACpBmD,EAAkB,EAAQ,KAC1BtF,EAAW,EAAQ,KACnB1D,EAAW,EAAQ,KAgFzBpmB,EAAQowB,cA/ER,MACI,WAAA5tB,CAAYktB,EAAkBW,GAC1B,IAAMX,IAAoBW,EACtB,MAAM,IAAIvG,EAASO,uBAAuB,mDAE9C,GAAgC,iBAArBqF,EACP,KAAM,+CAGV,GADAA,EAAmBA,EAAiB/H,eAC/ByH,EAAgB7F,cAAc0F,eAAeS,GAC9C,KAAM,4BAEVtvB,KAAKwvB,UAAY,MACjBxvB,KAAKyvB,aAAeT,EAAgB7F,cAAcmG,GAClDtvB,KAAKiwB,aAAeA,CACxB,CACA,MAAAtkB,CAAOmgB,GACH,MAAqB,iBAAVA,EACA9rB,KAAKkwB,cAAcpE,GAAO,GAEX,iBAAVA,GACL9rB,KAAKmwB,eAAerE,GAAO,EAK1C,CACA,WAAAsE,CAAYtE,GACR,MAAqB,iBAAVA,EACA9rB,KAAKkwB,cAAcpE,GAAO,GAEX,iBAAVA,EACL9rB,KAAKmwB,eAAerE,GAAO,GAG3BhB,QAAQC,SAAQ,EAE/B,CACA,aAAAmF,CAAcpE,EAAO/hB,GAEjB,MAAMgiB,EAAaD,EAAME,MAAM,KAEzB6D,EAAe9D,EAAW,GAAK,IAAMA,EAAW,GAChDsE,EAAiBtG,IAEnB,MAAMS,EAAoBxqB,KAAKyvB,aAAarF,cAAc2B,EAAW,IAErE,OAAO/rB,KAAKyvB,aAAalF,WAAWR,EAAkBS,EAAmBxqB,KAAKiwB,aAAa,EAE/F,GAAIlmB,EACA,OAAO,EAAIic,EAASwF,iBAAiBqE,GAAcvE,MAAKvB,GAAoBsG,EAActG,KAEzF,CACD,MAAMA,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAOQ,EAActG,EACzB,CACJ,CACA,cAAAoG,CAAerE,EAAO/hB,GAClB,MAAM8lB,EAAe,CAAC/D,EAAc,OAAE9H,KAAK,KAAM6H,EAAUviB,OAAOwiB,EAAe,UAAI9H,KAAK,KAC1F,IAAIsM,GAAW,EACf,MAAMD,EAAiBtG,IACnB+B,EAAiB,UAAEjc,KAAKkH,IACpB,MAAMyT,EAAoBxqB,KAAKyvB,aAAarF,cAAcrT,GAChC/W,KAAKyvB,aAAalF,WAAWR,EAAkBS,EAAmBxqB,KAAKiwB,gBAE7FK,GAAW,EACf,IAEGA,GAEX,GAAIvmB,EACA,OAAO,EAAIic,EAASwF,iBAAiBqE,GAAcvE,MAAKvB,GAAoBsG,EAActG,KAEzF,CACD,MAAMA,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAOQ,EAActG,EACzB,CACJ,6BC1EJ,IAGIwG,EAAiB,4BAGjBC,EAAmB,iBAGnBC,EAAU,qBAEVC,EAAU,mBACVC,EAAU,gBAEVC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBACbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBASZC,EAAU,OAGVC,EAAe,8BAGfC,EAAW,mBAGXC,EAAgB,CAAC,EACrBA,EAAc5B,GAAW4B,EA7CV,kBA8CfA,EAAcd,GAAkBc,EAAcb,GAC9Ca,EAAc3B,GAAW2B,EAAc1B,GACvC0B,EAAcZ,GAAcY,EAAcX,GAC1CW,EAAcV,GAAWU,EAAcT,GACvCS,EAAcR,GAAYQ,EAAcvB,GACxCuB,EAActB,GAAasB,EAAcrB,GACzCqB,EAAcnB,GAAamB,EAAclB,GACzCkB,EAAcjB,GAAaiB,EAAchB,GACzCgB,EAAcP,GAAYO,EAAcN,GACxCM,EAAcL,GAAaK,EAAcJ,IAAa,EACtDI,EArDe,kBAqDWA,EAAczB,GACxCyB,EAAcf,IAAc,EAG5B,IAAIgB,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAO3wB,SAAWA,QAAU,EAAA2wB,EAGhFC,EAA0B,iBAARrtB,MAAoBA,MAAQA,KAAKvD,SAAWA,QAAUuD,KAGxEzF,EAAO4yB,GAAcE,GAAYC,SAAS,cAATA,GAGjCC,EAA4C9yB,IAAYA,EAAQ+yB,UAAY/yB,EAG5EgzB,EAAaF,GAA4C7yB,IAAWA,EAAO8yB,UAAY9yB,EAGvFgzB,EAAgBD,GAAcA,EAAWhzB,UAAY8yB,EAUzD,SAASI,EAAYjjB,EAAKkjB,GAGxB,OADAljB,EAAI1M,IAAI4vB,EAAK,GAAIA,EAAK,IACfljB,CACT,CAUA,SAASmjB,EAAY7vB,EAAKrB,GAGxB,OADAqB,EAAI+N,IAAIpP,GACDqB,CACT,CAsDA,SAAS8vB,EAAYxpB,EAAOypB,EAAUC,EAAaC,GACjD,IAAI9M,GAAS,EACTxlB,EAAS2I,EAAQA,EAAM3I,OAAS,EAKpC,IAHIsyB,GAAatyB,IACfqyB,EAAc1pB,IAAQ6c,MAEfA,EAAQxlB,GACfqyB,EAAcD,EAASC,EAAa1pB,EAAM6c,GAAQA,EAAO7c,GAE3D,OAAO0pB,CACT,CAwCA,SAASE,EAAavxB,GAGpB,IAAI4I,GAAS,EACb,GAAa,MAAT5I,GAA0C,mBAAlBA,EAAMoH,SAChC,IACEwB,KAAY5I,EAAQ,GACtB,CAAE,MAAO6a,GAAI,CAEf,OAAOjS,CACT,CASA,SAAS4oB,EAAWzjB,GAClB,IAAIyW,GAAS,EACT5b,EAAS3B,MAAM8G,EAAIgS,MAKvB,OAHAhS,EAAIuQ,SAAQ,SAASte,EAAOyD,GAC1BmF,IAAS4b,GAAS,CAAC/gB,EAAKzD,EAC1B,IACO4I,CACT,CAUA,SAAS6oB,EAAQC,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,CASA,SAASC,EAAWxwB,GAClB,IAAImjB,GAAS,EACT5b,EAAS3B,MAAM5F,EAAI0e,MAKvB,OAHA1e,EAAIid,SAAQ,SAASte,GACnB4I,IAAS4b,GAASxkB,CACpB,IACO4I,CACT,CAGA,IASMkpB,EATFC,EAAa9qB,MAAMgC,UACnB+oB,EAAYrB,SAAS1nB,UACrBgpB,EAAcnyB,OAAOmJ,UAGrBipB,EAAat0B,EAAK,sBAGlBu0B,GACEL,EAAM,SAASM,KAAKF,GAAcA,EAAWG,MAAQH,EAAWG,KAAKC,UAAY,KACvE,iBAAmBR,EAAO,GAItCS,EAAeP,EAAU5qB,SAGzB2lB,GAAiBkF,EAAYlF,eAO7ByF,GAAiBP,EAAY7qB,SAG7BqrB,GAAaC,OAAO,IACtBH,EAAarpB,KAAK6jB,IAAgBrH,QAzQjB,sBAyQuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5EiN,GAAS5B,EAAgBnzB,EAAK+0B,YAASxvB,EACvCyvB,GAASh1B,EAAKg1B,OACd9zB,GAAalB,EAAKkB,WAClB+zB,GAAepB,EAAQ3xB,OAAOgE,eAAgBhE,QAC9CgzB,GAAehzB,OAAOX,OACtB4zB,GAAuBd,EAAYc,qBACnCC,GAASjB,EAAWiB,OAGpBC,GAAmBnzB,OAAOozB,sBAC1BC,GAAiBR,GAASA,GAAOS,cAAWjwB,EAC5CkwB,GAAa5B,EAAQ3xB,OAAOuyB,KAAMvyB,QAGlC+G,GAAWysB,GAAU11B,EAAM,YAC3B21B,GAAMD,GAAU11B,EAAM,OACtBorB,GAAUsK,GAAU11B,EAAM,WAC1B41B,GAAMF,GAAU11B,EAAM,OACtB6U,GAAU6gB,GAAU11B,EAAM,WAC1B61B,GAAeH,GAAUxzB,OAAQ,UAGjC4zB,GAAqBC,GAAS9sB,IAC9B+sB,GAAgBD,GAASJ,IACzBM,GAAoBF,GAAS3K,IAC7B8K,GAAgBH,GAASH,IACzBO,GAAoBJ,GAASlhB,IAG7BuhB,GAAcpB,GAASA,GAAO3pB,eAAY9F,EAC1C8wB,GAAgBD,GAAcA,GAAYE,aAAU/wB,EASxD,SAAS9C,GAAK8zB,GACZ,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAyFA,SAASC,GAAUH,GACjB,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAuGA,SAASE,GAASJ,GAChB,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAqFA,SAASG,GAAML,GACbj2B,KAAKu2B,SAAW,IAAIH,GAAUH,EAChC,CAwHA,SAASO,GAAYC,EAAQlxB,EAAKzD,GAChC,IAAI40B,EAAWD,EAAOlxB,GAChBspB,GAAe7jB,KAAKyrB,EAAQlxB,IAAQoxB,GAAGD,EAAU50B,UACxCmD,IAAVnD,GAAyByD,KAAOkxB,KACnCA,EAAOlxB,GAAOzD,EAElB,CAUA,SAAS80B,GAAantB,EAAOlE,GAE3B,IADA,IAAIzE,EAAS2I,EAAM3I,OACZA,KACL,GAAI61B,GAAGltB,EAAM3I,GAAQ,GAAIyE,GACvB,OAAOzE,EAGX,OAAQ,CACV,CA6BA,SAAS+1B,GAAU/0B,EAAOg1B,EAAQC,EAAQC,EAAYzxB,EAAKkxB,EAAQQ,GACjE,IAAIvsB,EAIJ,GAHIssB,IACFtsB,EAAS+rB,EAASO,EAAWl1B,EAAOyD,EAAKkxB,EAAQQ,GAASD,EAAWl1B,SAExDmD,IAAXyF,EACF,OAAOA,EAET,IAAKwsB,GAASp1B,GACZ,OAAOA,EAET,IAAIq1B,EAAQ9U,GAAQvgB,GACpB,GAAIq1B,GAEF,GADAzsB,EA2XJ,SAAwBjB,GACtB,IAAI3I,EAAS2I,EAAM3I,OACf4J,EAASjB,EAAMrH,YAAYtB,GAO/B,OAJIA,GAA6B,iBAAZ2I,EAAM,IAAkBolB,GAAe7jB,KAAKvB,EAAO,WACtEiB,EAAO4b,MAAQ7c,EAAM6c,MACrB5b,EAAOghB,MAAQjiB,EAAMiiB,OAEhBhhB,CACT,CArYa0sB,CAAet1B,IACnBg1B,EACH,OA6ON,SAAmBpV,EAAQjY,GACzB,IAAI6c,GAAS,EACTxlB,EAAS4gB,EAAO5gB,OAGpB,IADA2I,IAAUA,EAAQV,MAAMjI,MACfwlB,EAAQxlB,GACf2I,EAAM6c,GAAS5E,EAAO4E,GAExB,OAAO7c,CACT,CAtPa4tB,CAAUv1B,EAAO4I,OAErB,CACL,IAAI+T,EAAM6Y,GAAOx1B,GACby1B,EAAS9Y,GAAOmS,GAAWnS,GAAOoS,EAEtC,GAAIqE,GAASpzB,GACX,OA0HN,SAAqBW,EAAQq0B,GAC3B,GAAIA,EACF,OAAOr0B,EAAOkC,QAEhB,IAAI+F,EAAS,IAAIjI,EAAOL,YAAYK,EAAO3B,QAE3C,OADA2B,EAAO+0B,KAAK9sB,GACLA,CACT,CAjIa+sB,CAAY31B,EAAOg1B,GAE5B,GAAIrY,GAAOuS,GAAavS,GAAOgS,GAAY8G,IAAWd,EAAS,CAC7D,GAAIpD,EAAavxB,GACf,OAAO20B,EAAS30B,EAAQ,CAAC,EAG3B,GADA4I,EA+XN,SAAyB+rB,GACvB,MAAqC,mBAAtBA,EAAOr0B,aAA8Bs1B,GAAYjB,GAE5D,CAAC,EAxVES,GADWS,EAwVHhD,GAAa8B,IAvVH7B,GAAa+C,GAAS,CAAC,EADlD,IAAoBA,CA0VpB,CAnYeC,CAAgBL,EAAS,CAAC,EAAIz1B,IAClCg1B,EACH,OA6QR,SAAqBpV,EAAQ+U,GAC3B,OAAOoB,GAAWnW,EAAQoW,GAAWpW,GAAS+U,EAChD,CA/QesB,CAAYj2B,EAhD3B,SAAoB20B,EAAQ/U,GAC1B,OAAO+U,GAAUoB,GAAWnW,EAAQyS,GAAKzS,GAAS+U,EACpD,CA8CkCuB,CAAWttB,EAAQ5I,GAEjD,KAAO,CACL,IAAKuwB,EAAc5T,GACjB,OAAOgY,EAAS30B,EAAQ,CAAC,EAE3B4I,EA0YN,SAAwB+rB,EAAQhY,EAAKwZ,EAAWnB,GAC9C,IA5MmBoB,EA4MfC,EAAO1B,EAAOr0B,YAClB,OAAQqc,GACN,KAAK8S,EACH,OAAO6G,GAAiB3B,GAE1B,KAAK/F,EACL,KAAKC,EACH,OAAO,IAAIwH,GAAM1B,GAEnB,KAAKjF,EACH,OA3QN,SAAuBluB,EAAUwzB,GAC/B,IAAIr0B,EAASq0B,EAASsB,GAAiB90B,EAASb,QAAUa,EAASb,OACnE,OAAO,IAAIa,EAASlB,YAAYK,EAAQa,EAASK,WAAYL,EAASmF,WACxE,CAwQa4vB,CAAc5B,EAAQK,GAE/B,KAAKrF,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OA/MN,SAAyBqG,EAAYxB,GACnC,IAAIr0B,EAASq0B,EAASsB,GAAiBE,EAAW71B,QAAU61B,EAAW71B,OACvE,OAAO,IAAI61B,EAAWl2B,YAAYK,EAAQ61B,EAAW30B,WAAY20B,EAAWx3B,OAC9E,CA4May3B,CAAgB9B,EAAQK,GAEjC,KAAKhG,EACH,OArQN,SAAkBjhB,EAAKinB,EAAQmB,GAE7B,OAAOhF,EADK6D,EAASmB,EAAU3E,EAAWzjB,IAAM,GAAQyjB,EAAWzjB,GACzCijB,EAAa,IAAIjjB,EAAIzN,YACjD,CAkQao2B,CAAS/B,EAAQK,EAAQmB,GAElC,KAAKlH,EACL,KAAKK,EACH,OAAO,IAAI+G,EAAK1B,GAElB,KAAKvF,EACH,OAhQN,SAAqBuH,GACnB,IAAI/tB,EAAS,IAAI+tB,EAAOr2B,YAAYq2B,EAAO/W,OAAQwQ,EAAQgC,KAAKuE,IAEhE,OADA/tB,EAAOguB,UAAYD,EAAOC,UACnBhuB,CACT,CA4PaiuB,CAAYlC,GAErB,KAAKtF,EACH,OApPN,SAAkBhuB,EAAK2zB,EAAQmB,GAE7B,OAAOhF,EADK6D,EAASmB,EAAUtE,EAAWxwB,IAAM,GAAQwwB,EAAWxwB,GACzC6vB,EAAa,IAAI7vB,EAAIf,YACjD,CAiPaw2B,CAASnC,EAAQK,EAAQmB,GAElC,KAAK5G,EACH,OA3Oe6G,EA2OIzB,EA1OhBV,GAAgBn0B,OAAOm0B,GAAc/qB,KAAKktB,IAAW,CAAC,EA4O/D,CA5aeW,CAAe/2B,EAAO2c,EAAKoY,GAAWC,EACjD,CACF,CAEAG,IAAUA,EAAQ,IAAIX,IACtB,IAAIwC,EAAU7B,EAAMzyB,IAAI1C,GACxB,GAAIg3B,EACF,OAAOA,EAIT,GAFA7B,EAAM9zB,IAAIrB,EAAO4I,IAEZysB,EACH,IAAI4B,EAAQhC,EAsQhB,SAAoBN,GAClB,OAnOF,SAAwBA,EAAQuC,EAAUC,GACxC,IAAIvuB,EAASsuB,EAASvC,GACtB,OAAOpU,GAAQoU,GAAU/rB,EApwB3B,SAAmBjB,EAAOqR,GAKxB,IAJA,IAAIwL,GAAS,EACTxlB,EAASga,EAAOha,OAChBmG,EAASwC,EAAM3I,SAEVwlB,EAAQxlB,GACf2I,EAAMxC,EAASqf,GAASxL,EAAOwL,GAEjC,OAAO7c,CACT,CA2vBoCyvB,CAAUxuB,EAAQuuB,EAAYxC,GAClE,CAgOS0C,CAAe1C,EAAQtC,GAAM2D,GACtC,CAxQyBsB,CAAWt3B,GAASqyB,GAAKryB,GAUhD,OA5vBF,SAAmB2H,EAAOypB,GAIxB,IAHA,IAAI5M,GAAS,EACTxlB,EAAS2I,EAAQA,EAAM3I,OAAS,IAE3BwlB,EAAQxlB,IAC8B,IAAzCoyB,EAASzpB,EAAM6c,GAAQA,KAK/B,CA0uBE+S,CAAUN,GAASj3B,GAAO,SAASw3B,EAAU/zB,GACvCwzB,IAEFO,EAAWx3B,EADXyD,EAAM+zB,IAIR9C,GAAY9rB,EAAQnF,EAAKsxB,GAAUyC,EAAUxC,EAAQC,EAAQC,EAAYzxB,EAAKzD,EAAOm1B,GACvF,IACOvsB,CACT,CAqGA,SAAS0tB,GAAiBmB,GACxB,IAAI7uB,EAAS,IAAI6uB,EAAYn3B,YAAYm3B,EAAY9wB,YAErD,OADA,IAAI7H,GAAW8J,GAAQvH,IAAI,IAAIvC,GAAW24B,IACnC7uB,CACT,CA6GA,SAASmtB,GAAWnW,EAAQqX,EAAOtC,EAAQO,GACzCP,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAInQ,GAAS,EACTxlB,EAASi4B,EAAMj4B,SAEVwlB,EAAQxlB,GAAQ,CACvB,IAAIyE,EAAMwzB,EAAMzS,GAEZkT,EAAWxC,EACXA,EAAWP,EAAOlxB,GAAMmc,EAAOnc,GAAMA,EAAKkxB,EAAQ/U,QAClDzc,EAEJuxB,GAAYC,EAAQlxB,OAAkBN,IAAbu0B,EAAyB9X,EAAOnc,GAAOi0B,EAClE,CACA,OAAO/C,CACT,CAiCA,SAASgD,GAAW5pB,EAAKtK,GACvB,IAqKiBzD,EACb43B,EAtKA72B,EAAOgN,EAAI0mB,SACf,OAsKgB,WADZmD,SADa53B,EApKAyD,KAsKmB,UAARm0B,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV53B,EACU,OAAVA,GAvKDe,EAAmB,iBAAP0C,EAAkB,SAAW,QACzC1C,EAAKgN,GACX,CAUA,SAASulB,GAAUqB,EAAQlxB,GACzB,IAAIzD,EAj8BN,SAAkB20B,EAAQlxB,GACxB,OAAiB,MAAVkxB,OAAiBxxB,EAAYwxB,EAAOlxB,EAC7C,CA+7Bco0B,CAASlD,EAAQlxB,GAC7B,OAvOF,SAAsBzD,GACpB,SAAKo1B,GAASp1B,KAyYE0xB,EAzYiB1xB,EA0YxBmyB,GAAeA,KAAcT,MAvYvBoG,GAAW93B,IAAUuxB,EAAavxB,GAAUyyB,GAAapC,GACzD0H,KAAKpE,GAAS3zB,IAqY/B,IAAkB0xB,CApYlB,CAiOSsG,CAAah4B,GAASA,OAAQmD,CACvC,CA9tBA9C,GAAK4I,UAAUmrB,MAnEf,WACEl2B,KAAKu2B,SAAWhB,GAAeA,GAAa,MAAQ,CAAC,CACvD,EAkEApzB,GAAK4I,UAAkB,OAtDvB,SAAoBxF,GAClB,OAAOvF,KAAK+5B,IAAIx0B,WAAevF,KAAKu2B,SAAShxB,EAC/C,EAqDApD,GAAK4I,UAAUvG,IA1Cf,SAAiBe,GACf,IAAI1C,EAAO7C,KAAKu2B,SAChB,GAAIhB,GAAc,CAChB,IAAI7qB,EAAS7H,EAAK0C,GAClB,OAAOmF,IAAW6lB,OAAiBtrB,EAAYyF,CACjD,CACA,OAAOmkB,GAAe7jB,KAAKnI,EAAM0C,GAAO1C,EAAK0C,QAAON,CACtD,EAoCA9C,GAAK4I,UAAUgvB,IAzBf,SAAiBx0B,GACf,IAAI1C,EAAO7C,KAAKu2B,SAChB,OAAOhB,QAA6BtwB,IAAdpC,EAAK0C,GAAqBspB,GAAe7jB,KAAKnI,EAAM0C,EAC5E,EAuBApD,GAAK4I,UAAU5H,IAXf,SAAiBoC,EAAKzD,GAGpB,OAFW9B,KAAKu2B,SACXhxB,GAAQgwB,SAA0BtwB,IAAVnD,EAAuByuB,EAAiBzuB,EAC9D9B,IACT,EAmHAo2B,GAAUrrB,UAAUmrB,MAjFpB,WACEl2B,KAAKu2B,SAAW,EAClB,EAgFAH,GAAUrrB,UAAkB,OArE5B,SAAyBxF,GACvB,IAAI1C,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAE/B,QAAI+gB,EAAQ,IAIRA,GADYzjB,EAAK/B,OAAS,EAE5B+B,EAAKm3B,MAELlF,GAAO9pB,KAAKnI,EAAMyjB,EAAO,GAEpB,GACT,EAwDA8P,GAAUrrB,UAAUvG,IA7CpB,SAAsBe,GACpB,IAAI1C,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAE/B,OAAO+gB,EAAQ,OAAIrhB,EAAYpC,EAAKyjB,GAAO,EAC7C,EAyCA8P,GAAUrrB,UAAUgvB,IA9BpB,SAAsBx0B,GACpB,OAAOqxB,GAAa52B,KAAKu2B,SAAUhxB,IAAQ,CAC7C,EA6BA6wB,GAAUrrB,UAAU5H,IAjBpB,SAAsBoC,EAAKzD,GACzB,IAAIe,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAO/B,OALI+gB,EAAQ,EACVzjB,EAAKuP,KAAK,CAAC7M,EAAKzD,IAEhBe,EAAKyjB,GAAO,GAAKxkB,EAEZ9B,IACT,EAiGAq2B,GAAStrB,UAAUmrB,MA/DnB,WACEl2B,KAAKu2B,SAAW,CACd,KAAQ,IAAIp0B,GACZ,IAAO,IAAKkzB,IAAOe,IACnB,OAAU,IAAIj0B,GAElB,EA0DAk0B,GAAStrB,UAAkB,OA/C3B,SAAwBxF,GACtB,OAAOk0B,GAAWz5B,KAAMuF,GAAa,OAAEA,EACzC,EA8CA8wB,GAAStrB,UAAUvG,IAnCnB,SAAqBe,GACnB,OAAOk0B,GAAWz5B,KAAMuF,GAAKf,IAAIe,EACnC,EAkCA8wB,GAAStrB,UAAUgvB,IAvBnB,SAAqBx0B,GACnB,OAAOk0B,GAAWz5B,KAAMuF,GAAKw0B,IAAIx0B,EACnC,EAsBA8wB,GAAStrB,UAAU5H,IAVnB,SAAqBoC,EAAKzD,GAExB,OADA23B,GAAWz5B,KAAMuF,GAAKpC,IAAIoC,EAAKzD,GACxB9B,IACT,EA+FAs2B,GAAMvrB,UAAUmrB,MApEhB,WACEl2B,KAAKu2B,SAAW,IAAIH,EACtB,EAmEAE,GAAMvrB,UAAkB,OAxDxB,SAAqBxF,GACnB,OAAOvF,KAAKu2B,SAAiB,OAAEhxB,EACjC,EAuDA+wB,GAAMvrB,UAAUvG,IA5ChB,SAAkBe,GAChB,OAAOvF,KAAKu2B,SAAS/xB,IAAIe,EAC3B,EA2CA+wB,GAAMvrB,UAAUgvB,IAhChB,SAAkBx0B,GAChB,OAAOvF,KAAKu2B,SAASwD,IAAIx0B,EAC3B,EA+BA+wB,GAAMvrB,UAAU5H,IAnBhB,SAAkBoC,EAAKzD,GACrB,IAAIm4B,EAAQj6B,KAAKu2B,SACjB,GAAI0D,aAAiB7D,GAAW,CAC9B,IAAI8D,EAAQD,EAAM1D,SAClB,IAAKlB,IAAQ6E,EAAMp5B,OAASq5B,IAE1B,OADAD,EAAM9nB,KAAK,CAAC7M,EAAKzD,IACV9B,KAETi6B,EAAQj6B,KAAKu2B,SAAW,IAAIF,GAAS6D,EACvC,CAEA,OADAD,EAAM92B,IAAIoC,EAAKzD,GACR9B,IACT,EAgcA,IAAI83B,GAAa/C,GAAmBxB,EAAQwB,GAAkBnzB,QAyhB9D,WACE,MAAO,EACT,EAlhBI01B,GAtQJ,SAAoBx1B,GAClB,OAAOwyB,GAAetpB,KAAKlJ,EAC7B,EAwXA,SAASs4B,GAAQt4B,EAAOhB,GAEtB,SADAA,EAAmB,MAAVA,EAAiB0vB,EAAmB1vB,KAE1B,iBAATgB,GAAqBswB,EAASyH,KAAK/3B,KAC1CA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQhB,CAC7C,CAkCA,SAAS42B,GAAY51B,GACnB,IAAIq2B,EAAOr2B,GAASA,EAAMM,YAG1B,OAAON,KAFqB,mBAARq2B,GAAsBA,EAAKptB,WAAcgpB,EAG/D,CASA,SAAS0B,GAASjC,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOa,EAAarpB,KAAKwoB,EAC3B,CAAE,MAAO7W,GAAI,CACb,IACE,OAAQ6W,EAAO,EACjB,CAAE,MAAO7W,GAAI,CACf,CACA,MAAO,EACT,CAwDA,SAASga,GAAG70B,EAAO4M,GACjB,OAAO5M,IAAU4M,GAAU5M,GAAUA,GAAS4M,GAAUA,CAC1D,EAzOK/F,IAAY2uB,GAAO,IAAI3uB,GAAS,IAAIwZ,YAAY,MAAQqP,GACxD6D,IAAOiC,GAAO,IAAIjC,KAAQvE,GAC1BhG,IAAWwM,GAAOxM,GAAQC,YAAckG,GACxCqE,IAAOgC,GAAO,IAAIhC,KAAQnE,GAC1B5c,IAAW+iB,GAAO,IAAI/iB,KAAY+c,KACrCgG,GAAS,SAASx1B,GAChB,IAAI4I,EAAS4pB,GAAetpB,KAAKlJ,GAC7Bq2B,EAAOztB,GAAUsmB,EAAYlvB,EAAMM,iBAAc6C,EACjDo1B,EAAalC,EAAO1C,GAAS0C,QAAQlzB,EAEzC,GAAIo1B,EACF,OAAQA,GACN,KAAK7E,GAAoB,OAAOhE,EAChC,KAAKkE,GAAe,OAAO5E,EAC3B,KAAK6E,GAAmB,OAAO1E,EAC/B,KAAK2E,GAAe,OAAOzE,EAC3B,KAAK0E,GAAmB,OAAOvE,EAGnC,OAAO5mB,CACT,GAsQF,IAAI2X,GAAUtZ,MAAMsZ,QA2BpB,SAASiY,GAAYx4B,GACnB,OAAgB,MAATA,GAqGT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAAS0uB,CAC7C,CAxG0B+J,CAASz4B,EAAMhB,UAAY84B,GAAW93B,EAChE,CAgDA,IAAIozB,GAAWD,IAsLf,WACE,OAAO,CACT,EArKA,SAAS2E,GAAW93B,GAGlB,IAAI2c,EAAMyY,GAASp1B,GAASwyB,GAAetpB,KAAKlJ,GAAS,GACzD,OAAO2c,GAAOmS,GAAWnS,GAAOoS,CAClC,CA0DA,SAASqG,GAASp1B,GAChB,IAAI43B,SAAc53B,EAClB,QAASA,IAAkB,UAAR43B,GAA4B,YAARA,EACzC,CA0DA,SAASvF,GAAKsC,GACZ,OAAO6D,GAAY7D,GAn7BrB,SAAuB30B,EAAO04B,GAG5B,IAAI9vB,EAAU2X,GAAQvgB,IAsrBxB,SAAqBA,GAEnB,OAmFF,SAA2BA,GACzB,OAmIF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CArIS24B,CAAa34B,IAAUw4B,GAAYx4B,EAC5C,CArFS44B,CAAkB54B,IAAU+sB,GAAe7jB,KAAKlJ,EAAO,aAC1D+yB,GAAqB7pB,KAAKlJ,EAAO,WAAawyB,GAAetpB,KAAKlJ,IAAU2uB,EAClF,CA1rBkCkK,CAAY74B,GAljB9C,SAAmB1B,EAAG8yB,GAIpB,IAHA,IAAI5M,GAAS,EACT5b,EAAS3B,MAAM3I,KAEVkmB,EAAQlmB,GACfsK,EAAO4b,GAAS4M,EAAS5M,GAE3B,OAAO5b,CACT,CA2iBMkwB,CAAU94B,EAAMhB,OAAQ+5B,QACxB,GAEA/5B,EAAS4J,EAAO5J,OAChBg6B,IAAgBh6B,EAEpB,IAAK,IAAIyE,KAAOzD,GACT04B,IAAa3L,GAAe7jB,KAAKlJ,EAAOyD,IACvCu1B,IAAuB,UAAPv1B,GAAmB60B,GAAQ70B,EAAKzE,KACpD4J,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CAk6B+BqwB,CAActE,GAtuB7C,SAAkBA,GAChB,IAAKiB,GAAYjB,GACf,OAAOtB,GAAWsB,GAEpB,IAAI/rB,EAAS,GACb,IAAK,IAAInF,KAAO3D,OAAO60B,GACjB5H,GAAe7jB,KAAKyrB,EAAQlxB,IAAe,eAAPA,GACtCmF,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CA2tBuDswB,CAASvE,EAChE,CAyCA52B,EAAOD,QA9VP,SAAmBkC,GACjB,OAAO+0B,GAAU/0B,GAAO,GAAM,EAChC,WCt3CA,IAOIm5B,EACAC,EARA73B,EAAUxD,EAAOD,QAAU,CAAC,EAUhC,SAASu7B,IACL,MAAM,IAAI56B,MAAM,kCACpB,CACA,SAAS66B,IACL,MAAM,IAAI76B,MAAM,oCACpB,CAqBA,SAAS86B,EAAWC,GAChB,GAAIL,IAAqBM,WAErB,OAAOA,WAAWD,EAAK,GAG3B,IAAKL,IAAqBE,IAAqBF,IAAqBM,WAEhE,OADAN,EAAmBM,WACZA,WAAWD,EAAK,GAE3B,IAEI,OAAOL,EAAiBK,EAAK,EACjC,CAAE,MAAM3e,GACJ,IAEI,OAAOse,EAAiBjwB,KAAK,KAAMswB,EAAK,EAC5C,CAAE,MAAM3e,GAEJ,OAAOse,EAAiBjwB,KAAKhL,KAAMs7B,EAAK,EAC5C,CACJ,CAGJ,EA5CC,WACG,IAEQL,EADsB,mBAAfM,WACYA,WAEAJ,CAE3B,CAAE,MAAOxe,GACLse,EAAmBE,CACvB,CACA,IAEQD,EADwB,mBAAjBM,aACcA,aAEAJ,CAE7B,CAAE,MAAOze,GACLue,EAAqBE,CACzB,CACJ,CAnBA,GAwEA,IAEIK,EAFAC,EAAQ,GACRC,GAAW,EAEXC,GAAc,EAElB,SAASC,IACAF,GAAaF,IAGlBE,GAAW,EACPF,EAAa36B,OACb46B,EAAQD,EAAaK,OAAOJ,GAE5BE,GAAc,EAEdF,EAAM56B,QACNi7B,IAER,CAEA,SAASA,IACL,IAAIJ,EAAJ,CAGA,IAAIK,EAAUX,EAAWQ,GACzBF,GAAW,EAGX,IADA,IAAI54B,EAAM24B,EAAM56B,OACViC,GAAK,CAGP,IAFA04B,EAAeC,EACfA,EAAQ,KACCE,EAAa74B,GACd04B,GACAA,EAAaG,GAAYK,MAGjCL,GAAc,EACd74B,EAAM24B,EAAM56B,MAChB,CACA26B,EAAe,KACfE,GAAW,EAnEf,SAAyBO,GACrB,GAAIhB,IAAuBM,aAEvB,OAAOA,aAAaU,GAGxB,IAAKhB,IAAuBE,IAAwBF,IAAuBM,aAEvE,OADAN,EAAqBM,aACdA,aAAaU,GAExB,IAEI,OAAOhB,EAAmBgB,EAC9B,CAAE,MAAOvf,GACL,IAEI,OAAOue,EAAmBlwB,KAAK,KAAMkxB,EACzC,CAAE,MAAOvf,GAGL,OAAOue,EAAmBlwB,KAAKhL,KAAMk8B,EACzC,CACJ,CAIJ,CA0CIC,CAAgBH,EAlBhB,CAmBJ,CAgBA,SAASI,EAAKd,EAAK7xB,GACfzJ,KAAKs7B,IAAMA,EACXt7B,KAAKyJ,MAAQA,CACjB,CAWA,SAAS4yB,IAAQ,CA5BjBh5B,EAAQ6E,SAAW,SAAUozB,GACzB,IAAIgB,EAAO,IAAIvzB,MAAMwzB,UAAUz7B,OAAS,GACxC,GAAIy7B,UAAUz7B,OAAS,EACnB,IAAK,IAAI4C,EAAI,EAAGA,EAAI64B,UAAUz7B,OAAQ4C,IAClC44B,EAAK54B,EAAI,GAAK64B,UAAU74B,GAGhCg4B,EAAMtpB,KAAK,IAAIgqB,EAAKd,EAAKgB,IACJ,IAAjBZ,EAAM56B,QAAiB66B,GACvBN,EAAWU,EAEnB,EAOAK,EAAKrxB,UAAUkxB,IAAM,WACjBj8B,KAAKs7B,IAAI/P,MAAM,KAAMvrB,KAAKyJ,MAC9B,EACApG,EAAQm5B,MAAQ,UAChBn5B,EAAQo5B,SAAU,EAClBp5B,EAAQq5B,IAAM,CAAC,EACfr5B,EAAQs5B,KAAO,GACft5B,EAAQ8hB,QAAU,GAClB9hB,EAAQohB,SAAW,CAAC,EAIpBphB,EAAQu5B,GAAKP,EACbh5B,EAAQw5B,YAAcR,EACtBh5B,EAAQy5B,KAAOT,EACfh5B,EAAQ05B,IAAMV,EACdh5B,EAAQ25B,eAAiBX,EACzBh5B,EAAQ45B,mBAAqBZ,EAC7Bh5B,EAAQ65B,KAAOb,EACfh5B,EAAQ85B,gBAAkBd,EAC1Bh5B,EAAQ+5B,oBAAsBf,EAE9Bh5B,EAAQg6B,UAAY,SAAU5kB,GAAQ,MAAO,EAAG,EAEhDpV,EAAQi6B,QAAU,SAAU7kB,GACxB,MAAM,IAAIlY,MAAM,mCACpB,EAEA8C,EAAQk6B,IAAM,WAAc,MAAO,GAAI,EACvCl6B,EAAQm6B,MAAQ,SAAUC,GACtB,MAAM,IAAIl9B,MAAM,iCACpB,EACA8C,EAAQq6B,MAAQ,WAAa,OAAO,CAAG,iBCvLvC79B,EAAOD,QAAU,EAAjB,qBCUA,WACE,IAAIF,EAAO,CAAC,EAGZ,GADAA,EAAKqK,MAA0C,EAAQ,KAC7B,iBAAfrK,EAAKqK,MACd,MAAM,IAAIxJ,MAAM,8DAElB,IAAIwJ,EAAQrK,EAAKqK,MAEjB,SAAS4zB,EAAQC,EAAQ1sB,GACvB,IAAKA,GAAsB,iBAARA,EACjB,OAAO0sB,EAIT,IAFA,IAAIzJ,EAAOvyB,OAAOuyB,KAAKjjB,GACnBxN,EAAIywB,EAAKrzB,OACN4C,KACLk6B,EAAOzJ,EAAKzwB,IAAMwN,EAAIijB,EAAKzwB,IAE7B,OAAOk6B,CACT,CAEA,SAASC,IACP,IAAIC,EAAM,CAAC,EACPxB,EAAOvzB,MAAMgC,UAAUpG,MAAMqG,KAAKuxB,WAClCpI,EAAO,KACPzwB,EAAI,KAWR,OATA44B,EAAKlc,SAAQ,SAAUsT,GACrB,GAAIA,GAAOA,EAAItxB,cAAgBR,OAG7B,IAFAuyB,EAAOvyB,OAAOuyB,KAAKT,GACnBhwB,EAAIywB,EAAKrzB,OACF4C,KACLo6B,EAAI3J,EAAKzwB,IAAMgwB,EAAIS,EAAKzwB,GAG9B,IACOo6B,CACT,CAQA,SAASC,IACP/9B,KAAKg+B,OAAS,CAAC,EAEfh+B,KAAKi+B,OAAS,SAAUD,GACtB,OAAOL,EAAQ39B,KAAKg+B,OAAQA,EAC9B,EAEAh+B,KAAKk+B,MAAQ,WACXl+B,KAAKg+B,OAAS,CAAC,CACjB,EAEAh+B,KAAKm+B,OAAS,SAAUC,GACjBC,EAAQ50B,MAAM20B,KACjBA,EAAS,CAACA,IAEZA,EAAOhe,SAAQ,SAAUke,UAChBt+B,KAAKg+B,OAAOM,EACrB,GAAGt+B,KACL,CACF,CAMA,SAASu+B,EAAWC,EAAQR,GAC1B,IAAIS,EAAS,CAAC,KAId,GAFAz+B,KAAK0+B,QAAUF,EACfx+B,KAAK2+B,QAAU,CAAC,EACF,MAAVX,EACF,IAAK,IAAIz4B,KAAOy4B,EACVp8B,OAAOmJ,UAAU8jB,eAAe7jB,KAAKgzB,EAAQz4B,KAC/CvF,KAAK2+B,QAAQ,IAAMp5B,GAAOy4B,EAAOz4B,IAKvCvF,KAAK4+B,UAAY,WACf,OAAOH,EAAO39B,MAChB,EAEAd,KAAK6+B,WAAa,WAEhB,OAAOJ,EAAO5uB,KAAI,SAAUnM,GAAK,OAAOA,EAAE8jB,QAAQ,OAAQ,OAA6B,IACpFxD,KAAK,KAAKwD,QAAQ,8BAA+B,IAEtD,EAEAxnB,KAAK8+B,cAAgB,SAAUrmB,GAE7B,OADAgmB,EAAOrsB,KAAK,wBAA0BynB,KAAKphB,GAAQA,EAAO,KAAOA,EAAO,MACjEzY,IACT,EAEAA,KAAK++B,aAAe,SAAUr7B,GAE5B,OADA+6B,EAAOrsB,KAAK,IAAM1O,EAAI,KACf1D,IACT,EAEAA,KAAKg/B,MAAQ,WAEX,OADAP,EAAOzE,MACAh6B,IACT,CACF,CAGA,IAAIq+B,EAAU,CACZY,SAAU,SAAUC,GAClB,MAA0B,mBAAZA,CAChB,EACArc,OAAQ,SAAUqc,GAChB,MAA0B,iBAAZA,CAChB,EACA/+B,OAAQ,SAAU++B,GAChB,MAA0B,iBAAZA,IAAyBp1B,MAAMo1B,EAC/C,EACAC,QAAS,SAAUD,GACjB,MAA0B,iBAAZA,GAAwBA,EAAU,GAAM,CACxD,EACAE,IAAK,SAAUF,GACb,MAA0B,iBAAZA,GAAwBp1B,MAAMo1B,EAC9C,EACAG,QAAS,SAAUH,GACjB,MAA0B,kBAAZA,CAChB,EACAI,KAAM,SAAUJ,GACd,OAAmB,OAAZA,CACT,EACAK,KAAM,SAAUL,GACd,OAAkB,MAAXA,GAAmBA,aAAmB90B,IAC/C,EACAqsB,OAAQ,SAAUyI,GAChB,MAA0B,iBAAZA,GAAmC,MAAXA,GAAmBA,EAAQ98B,cAAgB2G,KACnF,EACAU,MAAO,SAAUy1B,GACf,OAAkB,MAAXA,GAAmBA,EAAQ98B,cAAgB2G,KACpD,EACAy2B,IAAK,WACH,OAAO,CACT,GAGF,SAASC,EAAY/F,EAAMgG,GACzB,MAAoB,mBAAThG,EACFgG,aAAqBhG,EAGvB2E,EADP3E,EAAOA,KAAQ2E,EAAU3E,EAAO,OACXgG,EACvB,CAWA,SAASC,EAAWz5B,EAAGpE,GAIrB,IAHA,IAAI89B,EAAU,GACVl8B,EAAIwC,EAAEge,QAAQpiB,IAEJ,IAAP4B,GACLk8B,EAAQxtB,KAAK1O,GACbA,EAAIwC,EAAEge,QAAQpiB,EAAO4B,EAAI,GAE3B,OAAOk8B,CACT,CAMA,IAAIC,EAAW,CACbC,KAAM,KACNC,IAAK,sqCACL,YAAa,wEACbR,KAAM,sBACNS,aAAc,kEACdC,KAAM,wBACNC,MAAO,kBAiBPC,MAAO,IAAI3L,OAAO,+1RAGlB4L,QAAS,WACTjB,QAAS,cACTkB,QAAS,uBACTC,MAAO,YACPC,aAAc,eACdC,UAAW,iBACXC,WAAY,0BACZC,YAAa,YACbC,YAAa,YACbC,OAAQ,wEAKNC,EAAsB,CACxBC,SAAU,SAAUtC,EAAQkB,IAGd,KAFyB,kBAApBlB,EAAOsC,SAAyBtC,EAAOsC,SAAgC,SAApBtC,EAAOsC,gBAKlD,IAAdpB,GACT1/B,KAAK+gC,OAAO,8BAA+B,KAAM,WAErD,EACArH,KAAM,SAAU8E,EAAQkB,GAEtB,QAAyB,IAAdA,IAAqD,iBAAhBlB,EAAO9E,MAAuB8E,EAAO9E,gBAAgB3wB,OAAiC,mBAAhBy1B,EAAO9E,MAA7H,CAGA,IAAIsH,EAAQ3C,EAAQ50B,MAAM+0B,EAAO9E,MAAQ8E,EAAO9E,KAAO,CAAC8E,EAAO9E,MAC7CsH,EAAMC,MAAK,SAAUvH,GACrC,OAAO+F,EAAY/F,EAAMgG,EAC3B,MAEEsB,EAAQA,EAAMnxB,KAAI,SAAU8O,GAAK,MAAoB,mBAANA,EAAmB,kBAAoBA,EAAElG,KAAOkG,CAAG,IAClG3e,KAAK+gC,OAAO,WAAaC,EAAMhd,KAAK,QAAU,YAvFpD,SAAmB0b,GACjB,IAAK,IAAIh8B,KAAK26B,EACZ,GAAIoB,EAAY/7B,EAAGg8B,GACjB,MAAU,QAANh8B,GAAsB,WAANA,GAAkBg8B,EAAUt9B,cAAgBR,OACzD,kBAAoB89B,EAAUt9B,YAAYqW,KADiC/U,CAIxF,CAgFkEw9B,CAAUxB,GAAY,KAAM,QAP1F,CASF,EACAyB,WAAY,SAAU3C,EAAQkB,GAE5B,GADiC,iBAAtBlB,EAAO2C,aAA2B3C,EAAO2C,WAAoC,SAAtB3C,EAAO2C,YACxC,kBAAtB3C,EAAO2C,aAAkD,IAAtB3C,EAAO2C,aAA0B9C,EAAQ50B,MAAMi2B,IAAmC,iBAAdA,GAIlH,IADA,IAAI0B,EAAW,GACN19B,EAAI,EAAGA,EAAIg8B,EAAU5+B,OAAQ4C,IACpC,KAAI09B,EAASld,QAAQwb,EAAUh8B,KAAO,GAAtC,CAGA,IAAIk8B,EAAUD,EAAWD,EAAWA,EAAUh8B,IAC1Ck8B,EAAQ9+B,OAAS,IACnBsgC,EAAShvB,KAAKstB,EAAUh8B,IACxB1D,KAAK+gC,OAAO,cAAgBrB,EAAUh8B,GAAK,gCAAkCk8B,EAAQ5b,KAAK,MAAQ,IAAK,KAAM,cAJ/G,CAOJ,EACAqd,QAAS,SAAU7C,EAAQkB,GACzB,IACI4B,EAAS9C,EAAO6C,QACpB,GAAyB,iBAAd3B,EAAX,CAGA,IAAI6B,GAAU,EACTlD,EAAQ50B,MAAM63B,KACjBA,EAAS,CAACA,IAEZA,EAAOlhB,SAAQ,SAAUohB,GACF,iBAAVA,GAAsBA,KAAS3B,IACxC2B,EAAQ3B,EAAS2B,IAEfA,aAAiBhN,QACfgN,EAAM3H,KAAK6F,KACb6B,GAAU,EAGhB,IACKA,GAnBMvhC,KAoBJ+gC,OAAO,eAAiBO,EAAOtd,KAAK,QAAU,uBAAyB0b,EAAY,IAAK,KAAM,UAhBrG,CAkBF,EACA+B,UAAW,SAAUjD,EAAQkB,GACM,SAA7B7E,OAAO2D,EAAOiD,YAAyB/B,aAAqBt1B,MAAQN,MAAM41B,EAAUgC,YACtF1hC,KAAK+gC,OAAO,uBAAwB,KAAM,YAE9C,EACArZ,UAAW,SAAU8W,EAAQkB,GAC3B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIhY,EAAYrnB,OAAOm+B,EAAO9W,WAC1B5d,MAAM4d,IAGNgY,EAAU5+B,OAAS4mB,GACrB1nB,KAAK+gC,OAAO,uBAAyBrZ,EAAY,yBAA2BgY,EAAU5+B,OAAQ,KAAM,YANtG,CAQF,EACA6gC,UAAW,SAAUnD,EAAQkB,GAC3B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIiC,EAAYthC,OAAOm+B,EAAOmD,WAC1B73B,MAAM63B,IAGNjC,EAAU5+B,OAAS6gC,GACrB3hC,KAAK+gC,OAAO,wBAA0BY,EAAY,yBAA2BjC,EAAU5+B,OAAQ,KAAM,YANvG,CAQF,EACA8gC,YAAa,SAAUpD,EAAQkB,GAC7B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIkC,EAAcvhC,OAAOm+B,EAAOoD,aAC5B93B,MAAM83B,IAGNlC,EAAU5+B,SAAW8gC,GACvB5hC,KAAK+gC,OAAO,qBAAuBa,EAAc,0BAA4BlC,EAAU5+B,OAAQ,KAAM,cANvG,CAQF,EACA+gC,GAAI,SAAUrD,EAAQkB,GACpB,IAAIoC,EAAQzhC,OAAOm+B,EAAOqD,IACD,iBAAdnC,GAA0B51B,MAAMg4B,IAGvCpC,GAAaoC,GACf9hC,KAAK+gC,OAAO,qBAAuBe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,KAE9F,EACAqC,IAAK,SAAUvD,EAAQkB,GACrB,IAAIoC,EAAQzhC,OAAOm+B,EAAOuD,KACD,iBAAdrC,GAA0B51B,MAAMg4B,IAGvCpC,EAAYoC,GACd9hC,KAAK+gC,OAAO,iCAAmCe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,MAE1G,EACAsC,GAAI,SAAUxD,EAAQkB,GACpB,IAAIoC,EAAQzhC,OAAOm+B,EAAOwD,IACD,iBAAdtC,GAA0B51B,MAAMg4B,IAGvCpC,GAAaoC,GACf9hC,KAAK+gC,OAAO,wBAA0Be,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,KAEjG,EACAuC,IAAK,SAAUzD,EAAQkB,GACrB,IAAIoC,EAAQzhC,OAAOm+B,EAAOyD,KACD,iBAAdvC,GAA0B51B,MAAMg4B,IAGvCpC,EAAYoC,GACd9hC,KAAK+gC,OAAO,oCAAsCe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,MAE7G,EACA/I,GAAI,SAAU6H,EAAQkB,GACpB,GAAyB,iBAAdA,GAA+C,iBAAdA,GAA+C,kBAAdA,EAA7E,CAGA,IAAIoC,EAAQtD,EAAO7H,GACnB,GAAqB,iBAAVmL,GAAuC,iBAAVA,GAAuC,kBAAVA,GAAwBzD,EAAQ50B,MAAMq4B,GAG3G,GAAIzD,EAAQ50B,MAAMq4B,GAAQ,CACxB,IAAK,IAAIp+B,EAAI,EAAGA,EAAIo+B,EAAMhhC,OAAQ4C,IAChC,GAAIg8B,IAAcoC,EAAMp+B,GACtB,OAGJ1D,KAAK+gC,OAAO,qBAAuBe,EAAMjyB,KAAI,SAAU1L,GACrD,MAAO,IAAMA,EAAI,GACnB,IAAG6f,KAAK,QAAU,uBAAyB0b,EAAY,IAAK,KAAM,KACpE,MACMA,IAAcoC,GAChB9hC,KAAK+gC,OAAO,qBAAuBe,EAAQ,uBAAyBpC,EAAY,IAAK,KAAM,KAhB/F,CAmBF,EACAwC,GAAI,SAAU1D,EAAQkB,GACpB,GAAyB,iBAAdA,GAA+C,iBAAdA,EAA5C,CAGA,IAAIoC,EAAQtD,EAAO0D,GACnB,GAAqB,iBAAVJ,GAAuC,iBAAVA,GAAuBzD,EAAQ50B,MAAMq4B,GAG7E,GAAIzD,EAAQ50B,MAAMq4B,IAChB,IAAK,IAAIp+B,EAAI,EAAGA,EAAIo+B,EAAMhhC,OAAQ4C,IAChC,GAAIg8B,IAAcoC,EAAMp+B,GAEtB,YADA1D,KAAK+gC,OAAO,yBAA2Be,EAAMp+B,GAAK,IAAK,KAAM,WAK7Dg8B,IAAcoC,GAChB9hC,KAAK+gC,OAAO,yBAA2Be,EAAQ,IAAK,KAAM,KAd9D,CAiBF,EACAK,SAAU,SAAU3D,EAAQ4D,GAC1B,IAAIC,EAAQ7D,EAAO2D,SACd9D,EAAQ5H,OAAO2L,KAGRC,EAAMpB,MAAK,SAAUqB,GAC/B,OAAQA,KAAUF,CACpB,KAEEpiC,KAAK+gC,OAAO,0BAA4BsB,EAAMxyB,KAAI,SAAUnM,GAC1D,MAAO,IAAMA,EAAI,GACnB,IAAGsgB,KAAK,QAAS,KAAM,YAE3B,EACAzG,OAAQ,SAAUihB,EAAQkB,GAExB,GAD6B,iBAAlBlB,EAAOjhB,SAAuBihB,EAAOjhB,OAA4B,SAAlBihB,EAAOjhB,SAC3C,IAAlBihB,EAAOjhB,QAAoB8gB,EAAQ5H,OAAOiJ,IAAerB,EAAQ5H,OAAO+H,EAAO+D,kBAI7C,IAA3B/D,EAAO+D,WAAW,KAAsB,CACjD,IAAIC,EAAW5gC,OAAOuyB,KAAKuL,GAAW+C,QAAO,SAAUl9B,GACrD,YAA0C,IAA3Bi5B,EAAO+D,WAAWh9B,EACnC,IACA,GAAIi9B,EAAS1hC,OAAS,EAAG,CACvB,IAAIwK,EAAM,wBAA0Bk3B,EAAS1hC,OAAS,EAAI,aAAe,YACvE,KAAO0hC,EAAS3yB,KAAI,SAAUnM,GAAK,MAAO,IAAMA,EAAI,GAAK,IAAGsgB,KAAK,MAAQ,IAPpEhkB,KAQF+gC,OAAOz1B,EAAK,KAAM,SACzB,CACF,CACF,EACA4oB,KAAM,SAAUsK,EAAQkB,EAAWgD,GACjC,IAAIv9B,EAAOnF,KAEX,GAAwB,mBAAb0iC,EACT,OAAO1iC,KAAK2iC,UAAUnE,EAAQkB,EAAWgD,IAE1CrE,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAAO9T,SAAQ,SAAU8T,GACvD,mBAATA,GACTA,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAE5B,GACF,EACA6C,WAAY,SAAU/D,EAAQkB,EAAWgD,GACvC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK4iC,gBAAgBpE,EAAQkB,EAAWgD,GAEjD,GAAMlE,EAAO+D,sBAAsB3gC,QAAa89B,aAAqB99B,OAArE,CAGA,IACI8B,EADA6+B,EAAa/D,EAAO+D,WAExB,GAAuB,MAAnBA,EAAW,KACb,IAAK7+B,KAAKg8B,EACJh8B,KAAK6+B,IAGTviC,KAAK8+B,cAAcp7B,GACnB1D,KAAK6iC,UAAUN,EAAW,KAAM7C,EAAUh8B,IAC1C1D,KAAKg/B,SAGT,IAAKt7B,KAAK6+B,EACE,MAAN7+B,IAGJ1D,KAAK8+B,cAAcp7B,GACnB1D,KAAK6iC,UAAUN,EAAW7+B,GAAIg8B,EAAUh8B,IACxC1D,KAAKg/B,QAnBP,CAqBF,EACA8D,MAAO,SAAUtE,EAAQkB,EAAWgD,GAClC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK+iC,WAAWvE,EAAQkB,EAAWgD,GAE5C,GAAMlE,EAAOsE,iBAAiBlhC,QAAa89B,aAAqB99B,OAAhE,CAGA,IACI8B,EAAGS,EADH2+B,EAAQtE,EAAOsE,MAMnB,GAAIzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAMi2B,GACxC,IAAKh8B,EAAI,EAAGS,EAAI2+B,EAAMhiC,OAAQ4C,EAAIS,EAAGT,IACnC1D,KAAK++B,aAAar7B,GAClB1D,KAAK6iC,UAAUC,EAAMp/B,GAAIg8B,EAAUh8B,IACnC1D,KAAKg/B,aAGP,IAAK,IAAIz5B,KAAOm6B,EACV99B,OAAOmJ,UAAU8jB,eAAe7jB,KAAK00B,EAAWn6B,KAClDvF,KAAK++B,aAAax5B,GAClBvF,KAAK6iC,UAAUC,EAAOpD,EAAUn6B,IAChCvF,KAAKg/B,QAlBX,CAsBF,GAGEgE,EAA2B,CAC7BL,UAAW,SAAUnE,EAAQkB,EAAWgD,GACtC,IAAIv9B,EAAOnF,KACX+J,EAAMk5B,WAAW5E,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAAO,SAAUA,EAAM7I,GACzF,GAAoB,mBAAT6I,EAAqB,CAC9B,GAAIA,EAAKpzB,OAAS,EAChB,OAAOozB,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAAWrU,GAE5C6I,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAC1B,CACA31B,EAAM7B,SAASmjB,EACjB,GAAGqX,EACL,EACAE,gBAAiB,SAAUpE,EAAQkB,EAAWgD,GAC5C,KAAMlE,EAAO+D,sBAAsB3gC,QAAYy8B,EAAQ5H,OAAOiJ,IAC5D,OAAOgD,IAET,IAAIv9B,EAAOnF,KACPuiC,EAAa/D,EAAO+D,WACxBx4B,EAAMm5B,OAAO,CACX,SAAU/X,GACR,GAAuB,MAAnBoX,EAAW,KACb,OAAOpX,IAETphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKuL,IAAY,SAAUh8B,EAAG2nB,GACpD,GAAI3nB,KAAK6+B,EACP,OAAOx4B,EAAM7B,SAASmjB,GAExBlmB,EAAK25B,cAAcp7B,GACnByB,EAAKg+B,eAAeZ,EAAW,KAAM7C,EAAUh8B,IAAI,SAAU0/B,GAC3Dj+B,EAAK65B,QACL3T,EAAK+X,EACP,GACF,GAAGjY,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKoO,IAAa,SAAU7+B,EAAG2nB,GACrD,GAAU,MAAN3nB,EACF,OAAOqG,EAAM7B,SAASmjB,GAExBlmB,EAAK25B,cAAcp7B,GACnByB,EAAKg+B,eAAeZ,EAAW7+B,GAAIg8B,EAAUh8B,IAAI,SAAU0/B,GACzDj+B,EAAK65B,QACL3T,EAAK+X,EACP,GACF,GAAGjY,EACL,GACCuX,EACL,EACAK,WAAY,SAAUvE,EAAQkB,EAAWgD,GACvC,KAAMlE,EAAOsE,iBAAiBlhC,QAAa89B,aAAqB99B,QAC9D,OAAO8gC,IAET,IAAIv9B,EAAOnF,KACP8iC,EAAQtE,EAAOsE,MAEfzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAMi2B,GACxC31B,EAAMs5B,YAAYP,EAAMhiC,QAAQ,SAAU4C,EAAG2nB,GAC3ClmB,EAAK45B,aAAar7B,GAClByB,EAAKg+B,eAAeL,EAAMp/B,GAAIg8B,EAAUh8B,IAAI,SAAU0/B,EAAK1+B,GACzDS,EAAK65B,QACL3T,EAAK+X,EAAK1+B,EACZ,IACAS,EAAK65B,OACP,GAAG0D,GAEH34B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKuL,IAAY,SAAUn6B,EAAK8lB,GACtDlmB,EAAK45B,aAAax5B,GAClBJ,EAAKg+B,eAAeL,EAAOpD,EAAUn6B,IAAM,SAAU69B,EAAK1+B,GACxDS,EAAK65B,QACL3T,EAAK+X,EAAK1+B,EACZ,GACF,GAAGg+B,EAEP,GAMF,SAASY,EAAW9E,EAAQR,GAC1BO,EAAWxzB,UAAU3I,YAAY4I,KAAKhL,KAAMw+B,EAAQX,EAAOyF,EAAWtF,OAAQA,IAC9E,IAAIuF,EAAS,GAEbvjC,KAAKwjC,aAAe5hC,OAAOuyB,KAAK0M,GAChC7gC,KAAKyjC,cAAgB7hC,OAAOuyB,KAAKn0B,KAAK2+B,SACtC3+B,KAAK49B,OAAS,KAEd59B,KAAK+gC,OAAS,SAAUl7B,EAASoe,EAAMyf,GACrC,IAAIC,EAAS,CACX1f,KAAMA,GAAQjkB,KAAK4jC,UAAY,KAC/BF,OAAQA,GAAU,UAClB79B,QAAS7F,KAAK6jC,WAAah+B,GAAW,aACtCi+B,SAAU9jC,KAAK+jC,UAAa/jC,KAAK+jC,UAAY,KAAO/jC,KAAK6+B,aAAe,IAAO7+B,KAAK6+B,cAGtF,OADA0E,EAAOnxB,KAAKuxB,GACL3jC,IACT,EAEAA,KAAK0K,OAAS,WACZ,MAAO,CACLsR,MAAOunB,EACPS,MAAyB,IAAlBT,EAAOziC,OACdkpB,OAAQ,WACN,OAAmB,IAAfhqB,KAAKgkC,MACA,qBAEFhkC,KAAKgc,MAAMnM,KAAI,SAAUnM,GAC9B,MAAO,YAAcA,EAAEogC,SAAW,KAAOpgC,EAAEmC,OAC7C,IAAGme,KAAK,KACV,EAEJ,CACF,CAEA2Z,EAAQ2F,EAAWv4B,UAAW81B,GAC9BlD,EAAQ2F,EAAWv4B,UAAWi4B,GAC9BrF,EAAQ2F,EAAY,IAAIvF,GAExBuF,EAAWv4B,UAAUk5B,SAAW,SAAUvE,EAAWgD,GAEnD,GADA1iC,KAAK49B,OAAS8B,EACU,mBAAbgD,EAAyB,CAClC,IAAIv9B,EAAOnF,KACX,OAAO+J,EAAM7B,UAAS,WACpB/C,EAAKg+B,eAAeh+B,EAAKu5B,QAASgB,GAAW,SAAU0D,GACrDj+B,EAAKy4B,OAAS,KACd8E,EAASU,EAAKj+B,EAAKuF,SACrB,GACF,GACF,CACA,OAAO1K,KAAK6iC,UAAU7iC,KAAK0+B,QAASgB,GAAWh1B,QACjD,EAEA44B,EAAWv4B,UAAU83B,UAAY,SAAUrE,EAAQkB,EAAWgD,GAc5D,OAbA1iC,KAAK4jC,SAAWpF,EAAOva,MAAQ,KAC/BjkB,KAAK6jC,UAAYrF,EAAOxiB,OAAS,KACjChc,KAAK+jC,UAAYvF,EAAO0F,OAAS,KACjClkC,KAAKwjC,aAAapjB,SAAQ,SAAU1c,KAC7BA,KAAK86B,IAAgB,aAAN96B,GAAwC,mBAAZ1D,KAAK0D,IACnD1D,KAAK0D,GAAG86B,EAAQkB,EAEpB,GAAG1/B,MACHA,KAAKyjC,cAAcrjB,SAAQ,SAAU1c,GAC/BA,KAAK86B,GAAqC,mBAApBx+B,KAAK2+B,QAAQj7B,IACrC1D,KAAK2+B,QAAQj7B,GAAGsH,KAAKhL,KAAMw+B,EAAQkB,EAEvC,GAAG1/B,MACIA,IACT,EAEAsjC,EAAWv4B,UAAUo4B,eAAiB,SAAU3E,EAAQkB,EAAWgD,GACjE,IAAIv9B,EAAOnF,KACXA,KAAK4jC,SAAWpF,EAAOva,MAAQ,KAC/BjkB,KAAK6jC,UAAYrF,EAAOxiB,OAAS,KACjChc,KAAK+jC,UAAYvF,EAAO0F,OAAS,KAEjCn6B,EAAMm5B,OAAO,CACX,SAAU/X,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAK0M,IAAsB,SAAUn9B,EAAG2nB,GAC9DthB,EAAM7B,UAAS,WACb,IAAKxE,KAAK86B,GAAgB,aAAN96B,IAAwC,mBAAZyB,EAAKzB,GAAmB,CACtE,GAAIyB,EAAKzB,GAAG5C,OAAS,EACnB,OAAOqE,EAAKzB,GAAG86B,EAAQkB,EAAWrU,GAEpClmB,EAAKzB,GAAG86B,EAAQkB,EAClB,CACArU,GACF,GACF,GAAGF,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKhvB,EAAKw5B,UAAU,SAAUj7B,EAAG2nB,GACvDthB,EAAM7B,UAAS,WACb,GAAIxE,KAAK86B,GAAqC,mBAApBr5B,EAAKw5B,QAAQj7B,GAAmB,CACxD,GAAIyB,EAAKw5B,QAAQj7B,GAAG5C,OAAS,EAC3B,OAAOqE,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQkB,EAAWrU,GAEvDlmB,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQkB,EACrC,CACArU,GACF,GACF,GAAGF,EACL,GACCuX,EACL,EAIA,IAAIyB,EAAa,CACfhkC,OAAQ,SAAUikC,EAAM5F,GACtB,IAAIp+B,EACJ,GAAoB,iBAATgkC,EACT,OAAOA,EACF,GAAa,KAATA,EACT,YAA0B,IAAf5F,EAAO6F,IACT7F,EAAO6F,IAET,KACF,GAAoB,iBAATD,GAEhB,GAAiB,iBADjBhkC,EAAIkkC,WAAWF,EAAK5c,QAAQ,KAAM,KAAKA,QAAQ,KAAM,MAEnD,OAAOpnB,OAEJ,GAAIgkC,aAAgBh6B,KACzB,OAAQg6B,EAEV,OAAO,IACT,EACAjF,QAAS,SAAUiF,EAAM5F,GACvB,IAAIp+B,EACJ,GAAoB,iBAATgkC,GAAqBA,EAAO,GAAM,EAC3C,OAAOA,EACF,GAAa,KAATA,EACT,YAA0B,IAAf5F,EAAO6F,IACT7F,EAAO6F,IAET,KACF,GAAoB,iBAATD,GAEhB,GAAiB,iBADjBhkC,EAAIyJ,SAASu6B,EAAK5c,QAAQ,KAAM,IAAK,KAEnC,OAAOpnB,MAEJ,IAAoB,iBAATgkC,EAChB,OAAOv6B,SAASu6B,EAAM,IACjB,GAAoB,kBAATA,EAChB,OAAIA,EAAe,EACZ,EACF,GAAIA,aAAgBh6B,KACzB,OAAQg6B,CACV,CACA,OAAO,IACT,EACAvhB,OAAQ,SAAUuhB,EAAM5F,GACtB,MAAoB,kBAAT4F,GAAsC,iBAATA,GAAqBA,aAAgBh6B,KACpEg6B,EAAKl7B,WACHm1B,EAAQ50B,MAAM26B,GAEnB5F,EAAOsE,OAAStE,EAAO+D,WAClB6B,EAEFA,EAAKpgB,KAAK6W,OAAO2D,EAAO+F,UAAY,MAClCH,aAAgBxiC,OAErB48B,EAAOsE,OAAStE,EAAO+D,WAClB6B,EAEFnY,KAAKkD,UAAUiV,GACG,iBAATA,GAAqBA,EAAKtjC,OACnCsjC,EAEF,IACT,EACA7E,KAAM,SAAU6E,EAAM5F,GACpB,GAAI4F,aAAgBh6B,KAClB,OAAOg6B,EAEP,IAAIxyB,EAAI,IAAIxH,KAAKg6B,GACjB,OAAKt6B,MAAM8H,EAAE8vB,WAIR,KAHI9vB,CAIb,EACAytB,QAAS,SAAU+E,EAAM5F,GACvB,YAAoB,IAAT4F,EAA6B,MACpB,iBAATA,GAA4C,UAAvBA,EAAKzd,kBAC5Byd,CACX,EACA3N,OAAQ,SAAU2N,EAAM5F,GACtB,GAAoB,iBAAT4F,GAAqB/F,EAAQ5H,OAAO2N,GAC7C,OAAOA,EAET,IACE,OAAOnY,KAAKC,MAAMkY,EACpB,CAAE,MAAOznB,GACP,OAAO,IACT,CACF,EACAlT,MAAO,SAAU26B,EAAM5F,GACrB,GAAIH,EAAQ50B,MAAM26B,GAChB,OAAOA,EAET,QAAoB,IAATA,EACT,OAAO,KAET,GAAoB,iBAATA,EAAmB,CAC5B,GAA6B,MAAzBA,EAAK/c,UAAU,EAAG,IAAiC,MAAnB+c,EAAKz/B,OAAO,GAC9C,IACE,OAAOsnB,KAAKC,MAAMkY,EACpB,CAAE,MAAOznB,GACP,OAAO,IACT,CAEF,OAAOynB,EAAKpY,MAAM6O,OAAO2D,EAAOgG,WAAa,KAC/C,CACA,OAAKnG,EAAQ50B,MAAM26B,GAGZ,KAFE,CAACA,EAGZ,GAGEK,EAAc,CAChBC,MAAO,SAAUN,GACf,OAAOA,EAAK7c,aACd,EACAod,MAAO,SAAUP,GACf,OAAOA,EAAKzd,aACd,EACA6V,MAAO,SAAU4H,GAEf,OAAOA,EAAK5c,QAAQ,QAAQ,SAAUod,GACpC,OAAOA,EAAIzjB,OAAO,GAAGoG,cAAgBqd,EAAIC,OAAO,GAAGle,aACrD,GACF,EACAme,WAAY,SAAUV,GACpB,OAAOA,EAAKjjB,OAAO,GAAGoG,cAAgB6c,EAAKS,OAAO,GAAGle,aACvD,EACAoe,QAAS,SAAUX,GACjB,OAAOA,EAAKjjB,OAAO,GAAGoG,cAAgB6c,EAAKS,OAAO,EACpD,EACAG,KAAM,SAAUZ,GACd,OAAOA,EAAKY,MACd,GAKEC,EAAwB,CAC1B1nB,OAAQ,SAAUihB,EAAQ4F,GAExB,MAD6B,iBAAlB5F,EAAOjhB,SAAuBihB,EAAOjhB,OAA4B,SAAlBihB,EAAOjhB,SAC3C,IAAlBihB,EAAOjhB,OACF6mB,EAEJ/F,EAAQ5H,OAAO+H,EAAO+D,aAGtBlE,EAAQ5H,OAAO2N,IAGpBxiC,OAAOuyB,KAAKiQ,GAAMhkB,SAAQ,SAAU7a,GAC5BA,KAAOi5B,EAAO+D,mBACX6B,EAAK7+B,EAEhB,IACO6+B,GAVEA,CAWX,EACAtD,SAAU,SAAUtC,EAAQ4F,GAE1B,OAAY,KADyB,kBAApB5F,EAAOsC,SAAyBtC,EAAOsC,SAAgC,UAApBtC,EAAOsC,gBAIvD,IAATsD,EAFFA,GAKTpkC,KAAK+gC,SACDvC,EAAO6F,MAAQj6B,KACV,IAAIA,KAENo0B,EAAO6F,IAChB,EACA3K,KAAM,SAAU8E,EAAQ4F,GAItB,GAA2B,iBAAhB5F,EAAO9E,MAAwD,mBAA5ByK,EAAW3F,EAAO9E,MAC9D,OAAO0K,EAET,IAAIhkC,EACA8kC,EAAiC,kBAApB1G,EAAOsC,UAAyBtC,EAAOsC,SASxD,MARuC,mBAA5BqD,EAAW3F,EAAO9E,OAEhB,QADXt5B,EAAI+jC,EAAW3F,EAAO9E,MAAM0K,EAAM5F,MACd0G,IAAU9kC,GAAK0J,MAAM1J,IAAc,OAANA,GAA8B,WAAhBo+B,EAAO9E,QACpEt5B,EAAIo+B,EAAO6F,KAEHa,IACV9kC,EAAIo+B,EAAO6F,MAEH,MAALjkC,QAAoC,IAAfo+B,EAAO6F,KAAuB7F,EAAO6F,MAAQjkC,IAAOA,IAAMgkC,GAClFpkC,KAAK+gC,SACE3gC,GAEFgkC,CACT,EACAe,MAAO,SAAU3G,EAAQ4F,GACvB,IAAIe,EAAQ3G,EAAO2G,MACnB,GAAoB,iBAATf,GAAuC,iBAAVe,IAAuB9G,EAAQ50B,MAAM07B,GAC3E,OAAOf,EAET,IAAIgB,GAAW,EAUf,OATC/G,EAAQ50B,MAAM07B,GAASA,EAAQ,CAACA,IAAQ/kB,SAAQ,SAAUilB,GACxB,mBAAtBZ,EAAYY,KACrBjB,EAAOK,EAAYY,GAAMjB,GACzBgB,GAAW,EAEf,IACIA,GACFplC,KAAK+gC,SAEAqD,CACT,EACAziC,IAAK,SAAU68B,EAAQ4F,GACrB,IAAIkB,EAAWjlC,OAAO+jC,GACtB,GAAIt6B,MAAMw7B,GACR,OAAOlB,EAET,IAAIziC,EAAMtB,OAAOm+B,EAAO78B,KACxB,OAAImI,MAAMnI,GACDyiC,EAELkB,EAAW3jC,GACb3B,KAAK+gC,SACEp/B,GAEFyiC,CACT,EACAlW,IAAK,SAAUsQ,EAAQ4F,GACrB,IAAIkB,EAAWjlC,OAAO+jC,GACtB,GAAIt6B,MAAMw7B,GACR,OAAOlB,EAET,IAAIlW,EAAM7tB,OAAOm+B,EAAOtQ,KACxB,OAAIpkB,MAAMokB,GACDkW,EAELkB,EAAWpX,GACbluB,KAAK+gC,SACE7S,GAEFkW,CACT,EACA1c,UAAW,SAAU8W,EAAQ4F,GAC3B,IAAItC,EAAQzhC,OAAOm+B,EAAO9W,WAC1B,GAAoB,iBAAT0c,GAAqBt6B,MAAMg4B,IAAUA,EAAQ,EACtD,OAAOsC,EAET,IAAIh7B,EAAM,GACNm8B,EAAMzD,EAAQsC,EAAKtjC,OACvB,GAAIykC,EAAM,EAAG,CACX,IAAK,IAAI7hC,EAAI,EAAGA,EAAI6hC,EAAK7hC,IACvB0F,GAAO,IAGT,OADApJ,KAAK+gC,SACEqD,EAAOh7B,CAChB,CACA,OAAOg7B,CACT,EACAzC,UAAW,SAAUnD,EAAQ4F,GAC3B,IAAItC,EAAQzhC,OAAOm+B,EAAOmD,WAC1B,MAAoB,iBAATyC,GAAqBt6B,MAAMg4B,IAAUA,EAAQ,EAC/CsC,EAELA,EAAKtjC,OAASghC,GAChB9hC,KAAK+gC,SACEqD,EAAKz/B,MAAM,EAAGm9B,IAEhBsC,CACT,EACA7B,WAAY,SAAU/D,EAAQ4F,EAAM1B,GAClC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK4iC,gBAAgBpE,EAAQ4F,EAAM1B,GAE5C,IAAK0B,GAAwB,iBAATA,EAClB,OAAOA,EAET,IACIh5B,EACA1H,EAFA6+B,EAAa/D,EAAO+D,WAGxB,QAA+B,IAApBA,EAAW,KACpB,IAAK7+B,KAAK0gC,EACJ1gC,KAAK6+B,IAGTviC,KAAK8+B,cAAcp7B,SAEA,KADnB0H,EAAMpL,KAAKwlC,UAAUjD,EAAW,KAAM6B,EAAK1gC,MACT,SAAU6+B,EAAW,QACrD6B,EAAK1gC,GAAK0H,GAEZpL,KAAKg/B,SAGT,IAAKt7B,KAAK6+B,EACE,MAAN7+B,IACF1D,KAAK8+B,cAAcp7B,SAEA,KADnB0H,EAAMpL,KAAKwlC,UAAUjD,EAAW7+B,GAAI0gC,EAAK1gC,MACP,SAAU6+B,EAAW7+B,MACrD0gC,EAAK1gC,GAAK0H,GAEZpL,KAAKg/B,SAGT,OAAOoF,CACT,EACAtB,MAAO,SAAUtE,EAAQ4F,EAAM1B,GAC7B,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK+iC,WAAWvE,EAAQ4F,EAAM1B,GAEvC,KAAMlE,EAAOsE,iBAAiBlhC,QAAawiC,aAAgBxiC,QACzD,OAAOwiC,EAET,IAAI1gC,EACJ,GAAI26B,EAAQ50B,MAAM+0B,EAAOsE,QAAUzE,EAAQ50B,MAAM26B,GAAO,CACtD,IAAI1c,EAAY8W,EAAOsE,MAAMhiC,OAASsjC,EAAKtjC,OAAS09B,EAAOsE,MAAMhiC,OAASsjC,EAAKtjC,OAC/E,IAAK4C,EAAI,EAAGA,EAAIgkB,EAAWhkB,IACzB1D,KAAK++B,aAAar7B,GAClB0gC,EAAK1gC,GAAK1D,KAAKwlC,UAAUhH,EAAOsE,MAAMp/B,GAAI0gC,EAAK1gC,IAC/C1D,KAAKg/B,OAET,MACE,IAAKt7B,KAAK0gC,EACJxiC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKo5B,EAAM1gC,KAC7C1D,KAAK++B,aAAar7B,GAClB0gC,EAAK1gC,GAAK1D,KAAKwlC,UAAUhH,EAAOsE,MAAOsB,EAAK1gC,IAC5C1D,KAAKg/B,SAIX,OAAOoF,CACT,EACAlQ,KAAM,SAAUsK,EAAQ4F,EAAM1B,GAC5B,MAAwB,mBAAbA,EACF1iC,KAAK2iC,UAAUnE,EAAQ4F,EAAM1B,KAE1BrE,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAEzD9T,SAAQ,SAAU8T,GACF,mBAATA,IACTkQ,EAAOlQ,EAAKlpB,KAAKhL,KAAMw+B,EAAQ4F,GAEnC,GAAGpkC,MACIokC,EACT,GAGEqB,EAA6B,CAC/B9C,UAAW,SAAUnE,EAAQ4F,EAAM1B,GACjC,IAAIv9B,EAAOnF,KACP0lC,EAAQrH,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,MAE/DnqB,EAAMk5B,WAAWyC,GAAO,SAAUxR,EAAM7I,GACtC,GAAoB,mBAAT6I,EAAqB,CAC9B,GAAIA,EAAKpzB,OAAS,EAChB,OAAOozB,EAAKlpB,KAAK7F,EAAMq5B,EAAQ4F,GAAM,SAAUhB,EAAK1+B,GAClD,GAAI0+B,EACF,OAAO/X,EAAK+X,GAEdgB,EAAO1/B,EACP2mB,GACF,IAEF+Y,EAAOlQ,EAAKlpB,KAAK7F,EAAMq5B,EAAQ4F,EACjC,CACA/Y,GACF,IAAG,SAAU+X,GACXV,EAASU,EAAKgB,EAChB,GACF,EACAxB,gBAAiB,SAAUpE,EAAQ4F,EAAM1B,GACvC,IAAK0B,GAAwB,iBAATA,EAClB,OAAO1B,EAAS,KAAM0B,GAExB,IAAIj/B,EAAOnF,KACPuiC,EAAa/D,EAAO+D,WAExBx4B,EAAMm5B,OAAO,CACX,SAAU/X,GACR,GAAuB,MAAnBoX,EAAW,KACb,OAAOpX,IAET,IAAIwa,EAAUpD,EAAW,KACzBx4B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKiQ,IAAO,SAAU1gC,EAAGynB,GAC/C,GAAIznB,KAAK6+B,EACP,OAAOpX,IAEThmB,EAAK25B,cAAcp7B,GACnByB,EAAKygC,eAAeD,EAASvB,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,QAEhC,IAARA,IACT0/B,EAAK1gC,GAAKgB,GAEZS,EAAK65B,QACL7T,GACF,GACF,GAAGA,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKoO,IAAa,SAAU7+B,EAAGynB,GACrD,GAAU,MAANznB,EACF,OAAOynB,IAEThmB,EAAK25B,cAAcp7B,GACnByB,EAAKygC,eAAerD,EAAW7+B,GAAI0gC,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,GACzD,GAAI0+B,EACF,OAAOjY,EAAKiY,QAEK,IAAR1+B,IACT0/B,EAAK1gC,GAAKgB,GAEZS,EAAK65B,QACL7T,GACF,GACF,GAAGA,EACL,IACC,SAAUiY,GACX,OAAOV,EAASU,EAAKgB,EACvB,GACF,EACArB,WAAY,SAAUvE,EAAQ4F,EAAM1B,GAClC,KAAMlE,EAAOsE,iBAAiBlhC,QAAawiC,aAAgBxiC,QACzD,OAAO8gC,EAAS,KAAM0B,GAExB,IAAIj/B,EAAOnF,KACP8iC,EAAQtE,EAAOsE,MACnB,GAAIzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAM26B,GAAO,CAC/C,IAAI1c,EAAYob,EAAMhiC,OAASsjC,EAAKtjC,OAASgiC,EAAMhiC,OAASsjC,EAAKtjC,OACjEiJ,EAAMs5B,YAAY3b,GAAW,SAAUhkB,EAAGynB,GACxChmB,EAAK45B,aAAar7B,GAClByB,EAAKygC,eAAe9C,EAAMp/B,GAAI0gC,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,GACpD,GAAI0+B,EACF,OAAOjY,EAAKiY,GAEdgB,EAAK1gC,GAAKgB,EACVS,EAAK65B,QACL7T,GACF,GACF,IAAG,SAAUiY,GACXV,EAASU,EAAKgB,EAChB,GACF,MACEr6B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKiQ,IAAO,SAAU7+B,EAAK4lB,GACjDhmB,EAAK45B,aAAax5B,GAClBJ,EAAKygC,eAAe9C,EAAOsB,EAAK7+B,IAAM,SAAU69B,EAAK1+B,GACnD,GAAI0+B,EACF,OAAOjY,IAETiZ,EAAK7+B,GAAOb,EACZS,EAAK65B,QACL7T,GACF,GACF,IAAG,SAAUiY,GACXV,EAASU,EAAKgB,EAChB,IAEF,OAAOA,CACT,GAMF,SAASyB,EAAarH,EAAQR,GAC5BO,EAAWxzB,UAAU3I,YAAY4I,KAAKhL,KAAMw+B,EAAQX,EAAOgI,EAAa7H,OAAQA,IAChF,IAAI8H,EAAa,GAEjB9lC,KAAKwjC,aAAe5hC,OAAOuyB,KAAK8Q,GAChCjlC,KAAKyjC,cAAgB7hC,OAAOuyB,KAAKn0B,KAAK2+B,SACtC3+B,KAAK49B,OAAS,KAEd59B,KAAK+gC,OAAS,SAAUl7B,GACtB,IAAIkgC,EAAS,CACXlgC,QAASA,GAAW,gBACpBi+B,SAAU9jC,KAAK+jC,UAAa/jC,KAAK+jC,UAAY,KAAO/jC,KAAK6+B,aAAe,IAAO7+B,KAAK6+B,cAEjFiH,EAAW7E,MAAK,SAAUtkB,GAAK,OAAOA,EAAEmnB,WAAaiC,EAAOjC,QAAU,KACzEgC,EAAW1zB,KAAK2zB,EAEpB,EAEA/lC,KAAK0K,OAAS,SAAU7H,GAGtB,MAAO,CACLA,KAAMA,EACNmjC,UAAWF,EACX9b,OAAQ,WACN,OAAOhqB,KAAKgmC,UAAUn2B,KAAI,SAAUnM,GAClC,MAAO,YAAcA,EAAEogC,SAAW,IAAMpgC,EAAEmC,OAC5C,IAAGme,KAAK,KACV,EAGJ,CACF,CAEA2Z,EAAQkI,EAAa96B,UAAWk6B,GAChCtH,EAAQkI,EAAa96B,UAAW06B,GAChC9H,EAAQkI,EAAc,IAAI9H,GAE1B8H,EAAa96B,UAAUk7B,SAAW,SAAU7B,EAAM1B,GAEhD,GADA1iC,KAAK49B,OAASwG,EACU,mBAAb1B,EAAyB,CAClC,IAAIv9B,EAAOnF,KACX,OAAOA,KAAK4lC,eAAe5lC,KAAK0+B,QAAS0F,GAAM,SAAUhB,EAAKvgC,GAC5DsC,EAAKy4B,OAAS,KACd8E,EAASU,EAAKj+B,EAAKuF,OAAO7H,GAC5B,GACF,CACA,IAAIA,EAAO7C,KAAKwlC,UAAUxlC,KAAK0+B,QAAS0F,GAExC,OADApkC,KAAK49B,OAAS,KACP59B,KAAK0K,OAAO7H,EACrB,EAEAgjC,EAAa96B,UAAUy6B,UAAY,SAAUhH,EAAQ4F,GAYnD,OAXApkC,KAAK+jC,UAAYvF,EAAO0F,OAAS,KACjClkC,KAAKwjC,aAAapjB,SAAQ,SAAU1c,KAC7BA,KAAK86B,IAAgB,aAAN96B,GAAwC,mBAAZ1D,KAAK0D,KACnD0gC,EAAOpkC,KAAK0D,GAAG86B,EAAQ4F,GAE3B,GAAGpkC,MACHA,KAAKyjC,cAAcrjB,SAAQ,SAAU1c,GAC/BA,KAAK86B,GAAqC,mBAApBx+B,KAAK2+B,QAAQj7B,KACrC0gC,EAAOpkC,KAAK2+B,QAAQj7B,GAAGsH,KAAKhL,KAAMw+B,EAAQ4F,GAE9C,GAAGpkC,MACIokC,CACT,EAEAyB,EAAa96B,UAAU66B,eAAiB,SAAUpH,EAAQ4F,EAAM1B,GAC9D,IAAIv9B,EAAOnF,KACXA,KAAK+jC,UAAYvF,EAAO0F,OAAS,KAEjCn6B,EAAMm8B,UAAU,CACd,SAAU/a,GACRphB,EAAMU,OAAOtF,EAAKq+B,aAAcY,GAAM,SAAUtiC,EAAO4B,EAAGynB,GACxDphB,EAAM7B,UAAS,WACb,IAAKxE,KAAK86B,GAAgB,aAAN96B,IAAwC,mBAAZyB,EAAKzB,GAAmB,CACtE,GAAIyB,EAAKzB,GAAG5C,OAAS,EACnB,OAAOqE,EAAKzB,GAAG86B,EAAQ18B,EAAOqpB,GAEhCrpB,EAAQqD,EAAKzB,GAAG86B,EAAQ18B,EAC1B,CACAqpB,EAAK,KAAMrpB,EACb,GACF,GAAGqpB,EACL,EACA,SAAUgb,EAAOhb,GACfphB,EAAMU,OAAOtF,EAAKs+B,cAAe0C,GAAO,SAAUrkC,EAAO4B,EAAGynB,GAC1DphB,EAAM7B,UAAS,WACb,GAAIxE,KAAK86B,GAAqC,mBAApBr5B,EAAKw5B,QAAQj7B,GAAmB,CACxD,GAAIyB,EAAKw5B,QAAQj7B,GAAG5C,OAAS,EAC3B,OAAOqE,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQ18B,EAAOqpB,GAEnDrpB,EAAQqD,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQ18B,EAC7C,CACAqpB,EAAK,KAAMrpB,EACb,GACF,GAAGqpB,EACL,GACCuX,EACL,EAIA,IACI0D,EAAU,WAEVC,EAAQ,CACVC,IAAK,SAAU3kC,EAAKusB,GAClB,OAAOvsB,GAAO,EAAIuB,KAAKqjC,UAAYrY,EAAMvsB,EAAM,GACjD,EACA6kC,MAAO,SAAU7kC,EAAKusB,GACpB,OAAQhrB,KAAKqjC,UAAYrY,EAAMvsB,GAAOA,CACxC,EACAnB,KAAM,WACJ,OAAQ0C,KAAKqjC,SAAW,EAC1B,EACAE,KAAM,SAAU9kC,EAAKusB,GACnB,OAAO2M,OAAO6L,aAAa1mC,KAAKsmC,IAAI3kC,EAAKusB,GAC3C,EACAyY,SAAU,SAAUC,GAClB,OAAOA,EAAK5mC,KAAKsmC,IAAI,EAAGM,EAAK9lC,OAAS,GACxC,GAGE+lC,EAAgB,CAClB,YAAa,WACX,OAAO,IAAIz8B,MAAO08B,aACpB,EACAvH,KAAM,WACJ,OAAO,IAAIn1B,MAAO08B,cAActf,QAAQ,OAAQ,GAClD,EACAyY,KAAM,WACJ,OAAO,IAAI71B,MAAO28B,mBAAmB,CAAC,EAAG,CAAEC,QAAQ,GACrD,EACA9G,MAAO,SAAUv+B,EAAKusB,GACpB,IAAIjX,EAAI,IACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,0BAEtB,OAAO1vB,CACT,EACAmpB,QAAS,WACP,MAAO,GAAKiG,EAAMC,IAAI,EAAGF,EAC3B,EACAjH,QAAS,WACP,OAAqB,IAAjBkH,EAAM7lC,OACD,IAAMR,KAAKogC,UAEbpgC,KAAKogC,SACd,EACAC,QAAS,WACP,OAAOrgC,KAAKm/B,UAAY,IAAMn/B,KAAKogC,SACrC,EACAE,MAAO,SAAU3+B,EAAKusB,GACpB,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,wDAEtB,OAAO1vB,CACT,EACAspB,aAAc,SAAU5+B,EAAKusB,GAC3B,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,kEAEtB,OAAO1vB,CACT,EACAupB,UAAW,SAAU7+B,EAAKusB,GACxB,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,0EAEtB,OAAO1vB,CACT,EACAwpB,WAAY,SAAU9+B,EAAKusB,GAEzB,IADA,IAAIjX,EAAIovB,EAAMM,SAAS,8DACdjjC,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,EAAM,GAAIxqB,EAAIS,EAAGT,IAClDuT,GAAKovB,EAAMM,SAAS,0EAEtB,OAAO1vB,CACT,GAGF,SAASgwB,EAAWzI,GAClB,IAAI78B,GA7FQ,WA8FRusB,EAAMkY,EAcV,OAZkB,MAAd5H,EAAOyD,IACTtgC,EAAM68B,EAAOyD,IACS,MAAbzD,EAAOwD,KAChBrgC,EAAM68B,EAAOwD,GAAK,GAEF,MAAdxD,EAAOuD,IACT7T,EAAMsQ,EAAOuD,IACS,MAAbvD,EAAOqD,KAChB3T,EAAMsQ,EAAOqD,GAAK,GAIb,CAAElgC,IAAKA,EAAKusB,IAAKA,EAE1B,CAEA,IAAIgZ,EAAiB,CACnBrkB,OAAQ,SAAU2b,GAChB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAI1f,EAAI,GACJyQ,EAAgC,MAApB8W,EAAO9W,UAAoB8W,EAAO9W,UAAY,EAC1Dia,EAAgC,MAApBnD,EAAOmD,UAAoBnD,EAAOmD,UAAY,GAC9D,GAA8B,iBAAnBnD,EAAO6C,SAAiE,mBAAlCwF,EAAcrI,EAAO6C,SACpE,OAAOwF,EAAcrI,EAAO6C,SAAS3Z,EAAWia,GAIlD,IADA,IAAIx9B,EAA0B,MAAtBq6B,EAAOoD,YAAsBpD,EAAOoD,YAAcyE,EAAMC,IAAI5e,EAAWia,GACtEj+B,EAAI,EAAGA,EAAIS,EAAGT,IACrBuT,GAAKovB,EAAMI,KAAK,GAAI,KAEtB,OAAOxvB,CACT,EACA9W,OAAQ,SAAUq+B,GAChB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAImL,EAAQmF,EAAWzI,GACnBp+B,EAAIimC,EAAMG,MAAM1E,EAAMngC,IAAKmgC,EAAM5T,KACrC,GAAiB,MAAbsQ,EAAO0D,GAET,IADA,IAAIA,EAAK7D,EAAQ50B,MAAM+0B,EAAO0D,IAAM1D,EAAO0D,GAAK,CAAC1D,EAAO0D,KAC9B,IAAnBA,EAAGhe,QAAQ9jB,IAChBA,EAAIimC,EAAMG,MAAM1E,EAAMngC,IAAKmgC,EAAM5T,KAGrC,OAAO9tB,CACT,EACA++B,QAAS,SAAUX,GACjB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAImL,EAAQmF,EAAWzI,GACnBp+B,EAAIimC,EAAMC,IAAIxE,EAAMngC,IAAKmgC,EAAM5T,KACnC,GAAiB,MAAbsQ,EAAO0D,GAET,IADA,IAAIA,EAAK7D,EAAQ50B,MAAM+0B,EAAO0D,IAAM1D,EAAO0D,GAAK,CAAC1D,EAAO0D,KAC9B,IAAnBA,EAAGhe,QAAQ9jB,IAChBA,EAAIimC,EAAMC,IAAIxE,EAAMngC,IAAKmgC,EAAM5T,KAGnC,OAAO9tB,CACT,EACAi/B,QAAS,SAAUb,GACjB,OAAiB,MAAbA,EAAO7H,GACF6H,EAAO7H,GAET0P,EAAM7lC,MACf,EACA8+B,KAAM,SAAUd,GACd,OAAO,IACT,EACAe,KAAM,SAAUf,GACd,OAAiB,MAAbA,EAAO7H,GACF6H,EAAO7H,GAET,IAAIvsB,IACb,EACAqsB,OAAQ,SAAU+H,GAChB,IAAIrQ,EAAI,CAAC,EACLgZ,EAAO3I,EAAO+D,YAAc,CAAC,EAEjC,IAAK,IAAIh9B,KAAO4hC,EACd,GAAIvlC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKm8B,EAAM5hC,GAAM,CACnD,IAA2B,IAAvB4hC,EAAK5hC,GAAKu7B,WAAsC,IAAjBuF,EAAM7lC,OACvC,SAEF,GAAY,MAAR+E,EACF4oB,EAAE5oB,GAAOvF,KAAKsb,SAAS6rB,EAAK5hC,SAK5B,IAHA,IAAI6hC,EAAK,gBACLC,EAAYD,EAAK,EACjBhnC,EAAIimC,EAAMC,IAAI,EAAG,GACZ5iC,EAAI,EAAGA,GAAKtD,EAAGsD,IAChB2jC,KAAaF,IACjBhZ,EAAEkZ,GAAarnC,KAAKsb,SAAS6rB,EAAK5hC,KAEpC8hC,EAAYD,EAAK1jC,CAGvB,CAEF,OAAOyqB,CACT,EACA1kB,MAAO,SAAU+0B,GACf,IAII9E,EACAgG,EACA7d,EACAne,EANAo/B,EAAQtE,EAAOsE,OAAS,CAAC,EACzBpb,EAAgC,MAApB8W,EAAO9W,UAAoB8W,EAAO9W,UAAY,EAC1Dia,EAAgC,MAApBnD,EAAOmD,UAAoBnD,EAAOmD,UAAY,GAM9D,GAAItD,EAAQ50B,MAAMq5B,GAWhB,IAVAjhB,EAAOihB,EAAMhiC,OACa,MAAtB09B,EAAOoD,YACT/f,EAAO2c,EAAOoD,YACL/f,EAAO6F,EAChB7F,EAAO6F,EACE7F,EAAO8f,IAChB9f,EAAO8f,GAETjC,EAAY,IAAI32B,MAAM8Y,GACtB6X,EAAO,KACFh2B,EAAI,EAAGA,EAAIme,EAAMne,IACpBg2B,EAAOoJ,EAAMp/B,GAAGg2B,MAAQ,MACpB2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAEzC4+B,EAAUh8B,GAzBH1D,KAyBa05B,GAAMoJ,EAAMp/B,SASlC,IANAme,EAA6B,MAAtB2c,EAAOoD,YAAsBpD,EAAOoD,YAAcyE,EAAMC,IAAI5e,EAAWia,GAC9EjC,EAAY,IAAI32B,MAAM8Y,GACtB6X,EAAOoJ,EAAMpJ,MAAQ,MACjB2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAEpC4C,EAAI,EAAGA,EAAIme,EAAMne,IACpBg8B,EAAUh8B,GAnCH1D,KAmCa05B,GAAMoJ,GAG9B,OAAOpD,CACT,EACAF,IAAK,SAAUhB,GACb,IAAIJ,EAASx8B,OAAOuyB,KAAK+S,GAEzB,OAAOlnC,KADCo+B,EAAOiI,EAAMC,IAAI,EAAGlI,EAAOt9B,OAAS,KAC7B09B,EACjB,GAIF,SAAS8I,IAET,CAEA3J,EAAQ2J,EAAmBv8B,UAAWm8B,GAEtC,IAAIK,EAAY,KAChBD,EAAmBjmC,SAAW,WAI5B,OAHMkmC,aAAqBD,IACzBC,EAAY,IAAID,GAEXC,CACT,EAEAD,EAAmBv8B,UAAUuQ,SAAW,SAAUkjB,GAChD,IAAI9E,EAAO8E,EAAO9E,MAAQ,MAI1B,OAHI2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAElCd,KAAK05B,GAAM8E,EACpB,EAGA,IAAIgJ,EAAkB,CAAC,EAGc3nC,EAAOD,QAC1CC,EAAOD,QAAU4nC,EAEjBr1B,OAAOq1B,gBAAkBA,EAG3BA,EAAgBC,gBAAkB,SAAUjJ,EAAQR,GAClD,OAAO,IAAI6H,EAAarH,EAAQR,EAClC,EAEAwJ,EAAgBE,cAAgB,SAAUlJ,EAAQR,GAChD,OAAO,IAAIsF,EAAW9E,EAAQR,EAChC,EAEAwJ,EAAgBlE,WAAaA,EAC7BkE,EAAgB3B,aAAeA,EAE/B2B,EAAgBvB,SAAW,SAAUzH,EAAQ4F,EAAMpG,EAAQ0E,GAKzD,OAJyB,IAArBnG,UAAUz7B,QAAkC,mBAAXk9B,IACnC0E,EAAW1E,EACXA,EAAS,MAEJ,IAAI6H,EAAarH,EAAQR,GAAQiI,SAAS7B,EAAM1B,EACzD,EAEA8E,EAAgBvD,SAAW,SAAUzF,EAAQkB,EAAW1B,EAAQ0E,GAK9D,OAJyB,IAArBnG,UAAUz7B,QAAkC,mBAAXk9B,IACnC0E,EAAW1E,EACXA,EAAS,MAEJ,IAAIsF,EAAW9E,EAAQR,GAAQiG,SAASvE,EAAWgD,EAC5D,EAEA8E,EAAgBlsB,SAAW,SAAUkjB,EAAQp+B,GAC3C,GAAiB,iBAANA,EAAgB,CAEzB,IADA,IAAI+Q,EAAI,IAAIpI,MAAM3I,GACTsD,EAAI,EAAGA,EAAItD,EAAGsD,IACrByN,EAAEzN,GAAK4jC,EAAmBjmC,WAAWia,SAASkjB,GAEhD,OAAOrtB,CACT,CACA,OAAOm2B,EAAmBjmC,WAAWia,SAASkjB,EAChD,CACD,CA3iDD,iDCNQ,SAAW5+B,GAAW,aAE9B,SAAS+E,EAAMgjC,EAAWxjB,GACtBA,GAAc,EAGd,IAFA,IAAIyjB,EAAS1kC,KAAKgrB,IAAIyZ,EAAU7mC,OAASqjB,EAAO,GAC5C0jB,EAAS9+B,MAAM6+B,GACXE,EAAM,EAAGA,EAAMF,EAAQE,IAC3BD,EAAOC,GAAOH,EAAUxjB,EAAQ2jB,GAEpC,OAAOD,CACX,CA+CA,IAAItc,EAAQ,SAASwc,GACjB,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5B,OAAO,WACH,IAAIyL,EAAWrjC,EAAM43B,WACrB,OAAOwL,EAAGxc,MAAM,KAAM+Q,EAAKR,OAAOkM,GACtC,CACJ,EAEIC,EAAgB,SAAUF,GAC1B,OAAO,WACH,IAAIzL,EAAO33B,EAAM43B,WACbmG,EAAWpG,EAAKtC,MACpB+N,EAAG/8B,KAAKhL,KAAMs8B,EAAMoG,EACxB,CACJ,EA2BA,SAASxL,EAASp1B,GAChB,IAAI43B,SAAc53B,EAClB,OAAgB,MAATA,IAA0B,UAAR43B,GAA4B,YAARA,EAC/C,CAEA,IAAIwO,EAA0C,mBAAjBC,cAA+BA,aACxDC,EAAiC,iBAAZ/kC,GAAoD,mBAArBA,EAAQ6E,SAEhE,SAASmgC,EAASN,GACdxM,WAAWwM,EAAI,EACnB,CAEA,SAASO,EAAKC,GACV,OAAO,SAAUR,GACb,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5BgM,GAAM,WACFR,EAAGxc,MAAM,KAAM+Q,EACnB,GACJ,CACJ,CAYA,IAAIkM,EAAiBF,EARjBJ,EACSC,aACFC,EACE/kC,EAAQ6E,SAERmgC,GA6Db,SAASI,EAASjV,GACd,OAAOyU,GAAc,SAAU3L,EAAMoG,GACjC,IAAIh4B,EACJ,IACIA,EAAS8oB,EAAKjI,MAAMvrB,KAAMs8B,EAC9B,CAAE,MAAO3f,GACL,OAAO+lB,EAAS/lB,EACpB,CAEIua,EAASxsB,IAAkC,mBAAhBA,EAAO4gB,KAClC5gB,EAAO4gB,MAAK,SAASxpB,GACjB4mC,EAAehG,EAAU,KAAM5gC,EACnC,IAAG,SAASshC,GACRsF,EAAehG,EAAUU,EAAIv9B,QAAUu9B,EAAM,IAAI7iC,MAAM6iC,GAC3D,IAEAV,EAAS,KAAMh4B,EAEvB,GACJ,CAEA,SAASg+B,EAAehG,EAAU1mB,EAAOla,GACrC,IACI4gC,EAAS1mB,EAAOla,EACpB,CAAE,MAAO6a,GACL6rB,EAAeG,EAAShsB,EAC5B,CACJ,CAEA,SAASgsB,EAAQ3sB,GACb,MAAMA,CACV,CAEA,IAAI4sB,EAAmC,mBAAXlU,OAE5B,SAASmU,EAAQd,GACb,OAAOa,GAA6C,kBAA3Bb,EAAGrT,OAAOoU,YACvC,CAEA,SAASC,EAAUC,GACf,OAAOH,EAAQG,GAAWP,EAASO,GAAWA,CAClD,CAEA,SAASC,EAAYC,GACjB,OAAO,SAASC,GACZ,IAAI7M,EAAO33B,EAAM43B,UAAW,GACxB6M,EAAKnB,GAAc,SAAS3L,EAAMoG,GAClC,IAAI2G,EAAOrpC,KACX,OAAOkpC,EAAOC,GAAK,SAAUpB,EAAI79B,GAC7B6+B,EAAUhB,GAAIxc,MAAM8d,EAAM/M,EAAKR,OAAO5xB,GAC1C,GAAGw4B,EACP,IACA,OAAIpG,EAAKx7B,OACEsoC,EAAG7d,MAAMvrB,KAAMs8B,GAGf8M,CAEf,CACJ,CAGA,IAAI9W,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAO3wB,SAAWA,QAAU,EAAA2wB,EAGhFC,EAA0B,iBAARrtB,MAAoBA,MAAQA,KAAKvD,SAAWA,QAAUuD,KAGxEzF,EAAO4yB,GAAcE,GAAYC,SAAS,cAATA,GAGjC6W,EAAW5pC,EAAKg1B,OAGhBX,EAAcnyB,OAAOmJ,UAGrB8jB,EAAiBkF,EAAYlF,eAO7B0a,EAAuBxV,EAAY7qB,SAGnCsgC,EAAmBF,EAAWA,EAASR,iBAAc7jC,EA8BzD,IAOIwkC,EAPgB7nC,OAAOmJ,UAOgB7B,SAc3C,IAAIwgC,EAAU,gBACVC,EAAe,qBAGfC,EAAiBN,EAAWA,EAASR,iBAAc7jC,EASvD,SAAS4kC,EAAW/nC,GAClB,OAAa,MAATA,OACemD,IAAVnD,EAAsB6nC,EAAeD,EAEtCE,GAAkBA,KAAkBhoC,OAAOE,GA3DrD,SAAmBA,GACjB,IAAIgoC,EAAQjb,EAAe7jB,KAAKlJ,EAAO0nC,GACnC/qB,EAAM3c,EAAM0nC,GAEhB,IACE1nC,EAAM0nC,QAAoBvkC,EAC1B,IAAI8kC,GAAW,CACjB,CAAE,MAAOptB,GAAI,CAEb,IAAIjS,EAAS6+B,EAAqBv+B,KAAKlJ,GAQvC,OAPIioC,IACED,EACFhoC,EAAM0nC,GAAoB/qB,SAEnB3c,EAAM0nC,IAGV9+B,CACT,CA0CMs/B,CAAUloC,GAvBhB,SAAwBA,GACtB,OAAO2nC,EAAuBz+B,KAAKlJ,EACrC,CAsBMwyB,CAAexyB,EACrB,CAGA,IAAImoC,EAAW,yBACXrZ,EAAU,oBACVC,EAAS,6BACTqZ,EAAW,iBA8Bf,IAAI1Z,EAAmB,iBA4BvB,SAAS+J,EAASz4B,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAAS0uB,CAC7C,CA2BA,SAAS8J,EAAYx4B,GACnB,OAAgB,MAATA,GAAiBy4B,EAASz4B,EAAMhB,UAtEzC,SAAoBgB,GAClB,IAAKo1B,EAASp1B,GACZ,OAAO,EAIT,IAAI2c,EAAMorB,EAAW/nC,GACrB,OAAO2c,GAAOmS,GAAWnS,GAAOoS,GAAUpS,GAAOwrB,GAAYxrB,GAAOyrB,CACtE,CA8DqDtQ,CAAW93B,EAChE,CAIA,IAAIqoC,EAAY,CAAC,EAcjB,SAAS9N,IAET,CAEA,SAASS,EAAKiL,GACV,OAAO,WACH,GAAW,OAAPA,EAAJ,CACA,IAAIqC,EAASrC,EACbA,EAAK,KACLqC,EAAO7e,MAAMvrB,KAAMu8B,UAHI,CAI3B,CACJ,CAEA,IAAI8N,EAAmC,mBAAX3V,QAAyBA,OAAO4V,SAExDC,EAAc,SAAUC,GACxB,OAAOH,GAAkBG,EAAKH,IAAmBG,EAAKH,IAC1D,EA6CA,SAAS5P,EAAa34B,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAYA,SAAS2oC,EAAgB3oC,GACvB,OAAO24B,EAAa34B,IAVR,sBAUkB+nC,EAAW/nC,EAC3C,CAGA,IAAI4oC,EAAgB9oC,OAAOmJ,UAGvB4/B,EAAmBD,EAAc7b,eAGjCgG,EAAuB6V,EAAc7V,qBAoBrC8F,EAAc8P,EAAgB,WAAa,OAAOlO,SAAW,CAA/B,IAAsCkO,EAAkB,SAAS3oC,GACjG,OAAO24B,EAAa34B,IAAU6oC,EAAiB3/B,KAAKlJ,EAAO,YACxD+yB,EAAqB7pB,KAAKlJ,EAAO,SACtC,EAyBIugB,EAAUtZ,MAAMsZ,QAoBpB,IAAIqQ,EAAgC,iBAAX9yB,GAAuBA,IAAYA,EAAQ+yB,UAAY/yB,EAG5EgzB,EAAaF,GAA4C7yB,IAAWA,EAAO8yB,UAAY9yB,EAMvF40B,GAHgB7B,GAAcA,EAAWhzB,UAAY8yB,EAG5BhzB,EAAK+0B,YAASxvB,EAsBvCiwB,IAnBiBT,GAASA,GAAOS,cAAWjwB,IAjBhD,WACE,OAAO,CACT,EAqCI2lC,GAAqB,iBAGrBxY,GAAW,mBAUf,SAASgI,GAAQt4B,EAAOhB,GACtB,IAAI44B,SAAc53B,EAGlB,SAFAhB,EAAmB,MAAVA,EAAiB8pC,GAAqB9pC,KAGpC,UAAR44B,GACU,UAARA,GAAoBtH,GAASyH,KAAK/3B,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQhB,CACjD,CAGA,IA2BI+pC,GAAiB,CAAC,EACtBA,GAZiB,yBAYYA,GAXZ,yBAYjBA,GAXc,sBAWYA,GAVX,uBAWfA,GAVe,uBAUYA,GATZ,uBAUfA,GATsB,8BASYA,GARlB,wBAShBA,GARgB,yBAQY,EAC5BA,GAjCgB,sBAiCYA,GAhCb,kBAiCfA,GApBqB,wBAoBYA,GAhCnB,oBAiCdA,GApBkB,qBAoBYA,GAhChB,iBAiCdA,GAhCe,kBAgCYA,GA/BX,qBAgChBA,GA/Ba,gBA+BYA,GA9BT,mBA+BhBA,GA9BgB,mBA8BYA,GA7BZ,mBA8BhBA,GA7Ba,gBA6BYA,GA5BT,mBA6BhBA,GA5BiB,qBA4BY,EA4B7B,IAPmBrX,GAOfsX,GAAkC,iBAAXlrC,GAAuBA,IAAYA,EAAQ+yB,UAAY/yB,EAG9EmrC,GAAeD,IAA8CjrC,IAAWA,EAAO8yB,UAAY9yB,EAM3FmrC,GAHkBD,IAAgBA,GAAanrC,UAAYkrC,IAG1BxY,EAAWjvB,QAG5C4nC,GAAY,WACd,IAIE,OAFYF,IAAgBA,GAAaG,SAAWH,GAAaG,QAAQ,QAAQlK,OAO1EgK,IAAeA,GAAY1N,SAAW0N,GAAY1N,QAAQ,OACnE,CAAE,MAAO3gB,GAAI,CACf,CAZe,GAeXwuB,GAAmBF,IAAYA,GAASG,aAmBxCA,GAAeD,IArDA3X,GAqD6B2X,GApDvC,SAASrpC,GACd,OAAO0xB,GAAK1xB,EACd,GAfF,SAA0BA,GACxB,OAAO24B,EAAa34B,IAClBy4B,EAASz4B,EAAMhB,WAAa+pC,GAAehB,EAAW/nC,GAC1D,EAoEIupC,GAHgBzpC,OAAOmJ,UAGU8jB,eAUrC,SAASkM,GAAcj5B,EAAO04B,GAC5B,IAAIrD,EAAQ9U,EAAQvgB,GAChBwpC,GAASnU,GAASwD,EAAY74B,GAC9BypC,GAAUpU,IAAUmU,GAASpW,GAASpzB,GACtC0pC,GAAUrU,IAAUmU,IAAUC,GAAUH,GAAatpC,GACrDg5B,EAAc3D,GAASmU,GAASC,GAAUC,EAC1C9gC,EAASowB,EAjUf,SAAmB16B,EAAG8yB,GAIpB,IAHA,IAAI5M,GAAS,EACT5b,EAAS3B,MAAM3I,KAEVkmB,EAAQlmB,GACfsK,EAAO4b,GAAS4M,EAAS5M,GAE3B,OAAO5b,CACT,CAyT6BkwB,CAAU94B,EAAMhB,OAAQ+5B,QAAU,GACzD/5B,EAAS4J,EAAO5J,OAEpB,IAAK,IAAIyE,KAAOzD,GACT04B,IAAa6Q,GAAiBrgC,KAAKlJ,EAAOyD,IACzCu1B,IAEQ,UAAPv1B,GAECgmC,IAAkB,UAAPhmC,GAA0B,UAAPA,IAE9BimC,IAAkB,UAAPjmC,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD60B,GAAQ70B,EAAKzE,KAElB4J,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CAGA,IAAI+gC,GAAgB7pC,OAAOmJ,UA+B3B,IAAIoqB,GAPJ,SAAiB3B,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,CAGiBH,CAAQ3xB,OAAOuyB,KAAMvyB,QAMlC8pC,GAHgB9pC,OAAOmJ,UAGU8jB,eASrC,SAASmM,GAASvE,GAChB,GArCI0B,GADer2B,EAsCF20B,IArCG30B,EAAMM,YAGnBN,KAFqB,mBAARq2B,GAAsBA,EAAKptB,WAAc0gC,IAqC3D,OAAOtW,GAAWsB,GAvCtB,IAAqB30B,EACfq2B,EAwCAztB,EAAS,GACb,IAAK,IAAInF,KAAO3D,OAAO60B,GACjBiV,GAAiB1gC,KAAKyrB,EAAQlxB,IAAe,eAAPA,GACxCmF,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CA8BA,SAASypB,GAAKsC,GACZ,OAAO6D,EAAY7D,GAAUsE,GAActE,GAAUuE,GAASvE,EAChE,CAkCA,SAAS6T,GAASE,GACd,GAAIlQ,EAAYkQ,GACZ,OAlCR,SAA6BA,GACzB,IAAI9mC,GAAK,EACLX,EAAMynC,EAAK1pC,OACf,OAAO,WACH,QAAS4C,EAAIX,EAAM,CAACjB,MAAO0oC,EAAK9mC,GAAI6B,IAAK7B,GAAK,IAClD,CACJ,CA4BeioC,CAAoBnB,GAG/B,IAlB0B1/B,EACtB8gC,EACAloC,EACAX,EAeAunC,EAAWC,EAAYC,GAC3B,OAAOF,EA9BX,SAA8BA,GAC1B,IAAI5mC,GAAK,EACT,OAAO,WACH,IAAI2Q,EAAOi2B,EAASnf,OACpB,OAAI9W,EAAKgX,KACE,MACX3nB,IACO,CAAC5B,MAAOuS,EAAKvS,MAAOyD,IAAK7B,GACpC,CACJ,CAqBsBmoC,CAAqBvB,IAlBnCsB,EAAQzX,GADcrpB,EAmB8C0/B,GAjBpE9mC,GAAK,EACLX,EAAM6oC,EAAM9qC,OACT,SAASqqB,IACZ,IAAI5lB,EAAMqmC,IAAQloC,GAClB,MAAY,cAAR6B,EACO4lB,IAEJznB,EAAIX,EAAM,CAACjB,MAAOgJ,EAAIvF,GAAMA,IAAKA,GAAO,IACnD,EAUJ,CAEA,SAASumC,GAAS/D,GACd,OAAO,WACH,GAAW,OAAPA,EAAa,MAAM,IAAIxnC,MAAM,gCACjC,IAAI6pC,EAASrC,EACbA,EAAK,KACLqC,EAAO7e,MAAMvrB,KAAMu8B,UACvB,CACJ,CAEA,SAASwP,GAAajK,GAClB,OAAO,SAAUh3B,EAAKooB,EAAUwP,GAE5B,GADAA,EAAW5F,EAAK4F,GAAYrG,GACxByF,GAAS,IAAMh3B,EACf,OAAO43B,EAAS,MAEpB,IAAIsJ,EAAW1B,GAASx/B,GACpBugB,GAAO,EACP4gB,EAAU,EACVC,GAAU,EAEd,SAASC,EAAiB/I,EAAKthC,GAE3B,GADAmqC,GAAW,EACP7I,EACA/X,GAAO,EACPqX,EAASU,OAER,IAAIthC,IAAUqoC,GAAc9e,GAAQ4gB,GAAW,EAEhD,OADA5gB,GAAO,EACAqX,EAAS,MAEVwJ,GACNE,GACJ,CACJ,CAEA,SAASA,IAEL,IADAF,GAAU,EACHD,EAAUnK,IAAUzW,GAAM,CAC7B,IAAIghB,EAAOL,IACX,GAAa,OAATK,EAKA,OAJAhhB,GAAO,OACH4gB,GAAW,GACXvJ,EAAS,OAIjBuJ,GAAW,EACX/Y,EAASmZ,EAAKvqC,MAAOuqC,EAAK9mC,IAAKumC,GAASK,GAC5C,CACAD,GAAU,CACd,CAEAE,GACJ,CACJ,CAsBA,SAASE,GAAY9B,EAAM1I,EAAO5O,EAAUwP,GACxCqJ,GAAajK,EAAbiK,CAAoBvB,EAAMzB,EAAU7V,GAAWwP,EACnD,CAEA,SAAS6J,GAAQxE,EAAIjG,GACjB,OAAO,SAAU0K,EAAUtZ,EAAUwP,GACjC,OAAOqF,EAAGyE,EAAU1K,EAAO5O,EAAUwP,EACzC,CACJ,CAGA,SAAS+J,GAAgBjC,EAAMtX,EAAUwP,GACrCA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI/V,EAAQ,EACRomB,EAAY,EACZ5rC,EAAS0pC,EAAK1pC,OAKlB,SAAS6rC,EAAiBvJ,EAAKthC,GACvBshC,EACAV,EAASU,KACCsJ,IAAc5rC,GAAWgB,IAAUqoC,GAC7CzH,EAAS,KAEjB,CAEA,IAZe,IAAX5hC,GACA4hC,EAAS,MAWNpc,EAAQxlB,EAAQwlB,IACnB4M,EAASsX,EAAKlkB,GAAQA,EAAOwlB,GAASa,GAE9C,CAGA,IAAIC,GAAgBL,GAAQD,GAAaO,KAyCrCC,GAAS,SAAStC,EAAMtX,EAAUwP,IACPpI,EAAYkQ,GAAQiC,GAAkBG,IAC5CpC,EAAMzB,EAAU7V,GAAWwP,EACpD,EAEA,SAASqK,GAAWhF,GAChB,OAAO,SAAUj9B,EAAKooB,EAAUwP,GAC5B,OAAOqF,EAAG+E,GAAQhiC,EAAKi+B,EAAU7V,GAAWwP,EAChD,CACJ,CAEA,SAASsK,GAAU9D,EAAQ1gC,EAAK0qB,EAAUwP,GACtCA,EAAWA,GAAYrG,EACvB7zB,EAAMA,GAAO,GACb,IAAIykC,EAAU,GACVpyB,EAAU,EACVqyB,EAAYnE,EAAU7V,GAE1BgW,EAAO1gC,GAAK,SAAU1G,EAAOqrC,EAAGzK,GAC5B,IAAIpc,EAAQzL,IACZqyB,EAAUprC,GAAO,SAAUshC,EAAKn6B,GAC5BgkC,EAAQ3mB,GAASrd,EACjBy5B,EAASU,EACb,GACJ,IAAG,SAAUA,GACTV,EAASU,EAAK6J,EAClB,GACJ,CAsCA,IAAIp9B,GAAMk9B,GAAWC,IAmCjBI,GAAYnE,EAAYp5B,IAE5B,SAASw9B,GAAgBtF,GACrB,OAAO,SAAUj9B,EAAKg3B,EAAO5O,EAAUwP,GACnC,OAAOqF,EAAGgE,GAAajK,GAAQh3B,EAAKi+B,EAAU7V,GAAWwP,EAC7D,CACJ,CAqBA,IAAI4K,GAAWD,GAAgBL,IAoB3BO,GAAYhB,GAAQe,GAAU,GAqB9BE,GAAkBvE,EAAYsE,IAWlC,SAASlU,GAAU5vB,EAAOypB,GAIxB,IAHA,IAAI5M,GAAS,EACTxlB,EAAkB,MAAT2I,EAAgB,EAAIA,EAAM3I,SAE9BwlB,EAAQxlB,IAC8B,IAAzCoyB,EAASzpB,EAAM6c,GAAQA,EAAO7c,KAIpC,OAAOA,CACT,CAqCA,IA5BuBgkC,GA4BnBC,GA3BK,SAASjX,EAAQvD,EAAU8F,GAMhC,IALA,IAAI1S,GAAS,EACTkmB,EAAW5qC,OAAO60B,GAClBsC,EAAQC,EAASvC,GACjB31B,EAASi4B,EAAMj4B,OAEZA,KAAU,CACf,IAAIyE,EAAMwzB,EAAM0U,GAAY3sC,IAAWwlB,GACvC,IAA+C,IAA3C4M,EAASsZ,EAASjnC,GAAMA,EAAKinC,GAC/B,KAEJ,CACA,OAAO/V,CACT,EAwBF,SAASkX,GAAWlX,EAAQvD,GAC1B,OAAOuD,GAAUiX,GAAQjX,EAAQvD,EAAUiB,GAC7C,CAgCA,SAASyZ,GAAU9rC,GACjB,OAAOA,GAAUA,CACnB,CAiCA,SAAS+rC,GAAYpkC,EAAO3H,EAAOgsC,GACjC,OAAOhsC,GAAUA,EAtBnB,SAAuB2H,EAAO3H,EAAOgsC,GAInC,IAHA,IAAIxnB,EAAQwnB,EAAY,EACpBhtC,EAAS2I,EAAM3I,SAEVwlB,EAAQxlB,GACf,GAAI2I,EAAM6c,KAAWxkB,EACnB,OAAOwkB,EAGX,OAAQ,CACV,CAaMynB,CAActkC,EAAO3H,EAAOgsC,GAxDlC,SAAuBrkC,EAAOukC,EAAWF,EAAWL,GAIlD,IAHA,IAAI3sC,EAAS2I,EAAM3I,OACfwlB,EAAQwnB,GAAaL,EAAY,GAAK,GAElCA,EAAYnnB,MAAYA,EAAQxlB,GACtC,GAAIktC,EAAUvkC,EAAM6c,GAAQA,EAAO7c,GACjC,OAAO6c,EAGX,OAAQ,CACV,CA+CM2nB,CAAcxkC,EAAOmkC,GAAWE,EACtC,CAiFA,IAAII,GAAO,SAAUC,EAAOC,EAAa1L,GACV,mBAAhB0L,IAEP1L,EAAW0L,EACXA,EAAc,MAElB1L,EAAW5F,EAAK4F,GAAYrG,GAC5B,IACIgS,EADUla,GAAKga,GACIrtC,OACvB,IAAKutC,EACD,OAAO3L,EAAS,MAEf0L,IACDA,EAAcC,GAGlB,IAAIpB,EAAU,CAAC,EACXqB,EAAe,EACfC,GAAW,EAEXlR,EAAYz7B,OAAOX,OAAO,MAE1ButC,EAAa,GAGbC,EAAe,GAEfC,EAAwB,CAAC,EAsC7B,SAASC,EAAYppC,EAAKqpC,GACtBJ,EAAWp8B,MAAK,YAkCpB,SAAiB7M,EAAKqpC,GAClB,IAAIL,EAAJ,CAEA,IAAIM,EAAe/C,IAAS,SAAS1I,EAAK14B,GAKtC,GAJA4jC,IACI/R,UAAUz7B,OAAS,IACnB4J,EAAS/F,EAAM43B,UAAW,IAE1B6G,EAAK,CACL,IAAI0L,EAAc,CAAC,EACnBnB,GAAWV,GAAS,SAASjsB,EAAK+tB,GAC9BD,EAAYC,GAAQ/tB,CACxB,IACA8tB,EAAYvpC,GAAOmF,EACnB6jC,GAAW,EACXlR,EAAYz7B,OAAOX,OAAO,MAE1ByhC,EAASU,EAAK0L,EAClB,MACI7B,EAAQ1nC,GAAOmF,EA1BvB2uB,GADoBgE,EA4BC93B,IA5BsB,IAClB,SAAUwiC,GAC/BA,GACJ,IACAiH,GA0BA,IAEAV,IACA,IAAIW,EAASlG,EAAU6F,EAAKA,EAAK9tC,OAAS,IACtC8tC,EAAK9tC,OAAS,EACdmuC,EAAOhC,EAAS4B,GAEhBI,EAAOJ,EA5BS,CA8BxB,CAhEQK,CAAQ3pC,EAAKqpC,EACjB,GACJ,CAEA,SAASI,IACL,GAA0B,IAAtBR,EAAW1tC,QAAiC,IAAjBwtC,EAC3B,OAAO5L,EAAS,KAAMuK,GAE1B,KAAMuB,EAAW1tC,QAAUwtC,EAAeF,GAC5BI,EAAW3lC,OACrBozB,EAGR,CA4EA,SAASkT,EAAcC,GACnB,IAAI1kC,EAAS,GAMb,OALAijC,GAAWQ,GAAO,SAAUS,EAAMrpC,GAC1B8c,EAAQusB,IAASf,GAAYe,EAAMQ,EAAU,IAAM,GACnD1kC,EAAO0H,KAAK7M,EAEpB,IACOmF,CACX,CAvIAijC,GAAWQ,GAAO,SAAUS,EAAMrpC,GAC9B,IAAK8c,EAAQusB,GAIT,OAFAD,EAAYppC,EAAK,CAACqpC,SAClBH,EAAar8B,KAAK7M,GAItB,IAAI8pC,EAAeT,EAAKjqC,MAAM,EAAGiqC,EAAK9tC,OAAS,GAC3CwuC,EAAwBD,EAAavuC,OACzC,GAA8B,IAA1BwuC,EAGA,OAFAX,EAAYppC,EAAKqpC,QACjBH,EAAar8B,KAAK7M,GAGtBmpC,EAAsBnpC,GAAO+pC,EAE7BjW,GAAUgW,GAAc,SAAUE,GAC9B,IAAKpB,EAAMoB,GACP,MAAM,IAAIhvC,MAAM,oBAAsBgF,EAClC,oCACAgqC,EAAiB,QACjBF,EAAarrB,KAAK,OA+BlC,IAAqBorB,EAAUrH,EACvByH,EADuBzH,EA7BK,WAEM,KAD9BuH,GAEIX,EAAYppC,EAAKqpC,EAEzB,GAyBAY,EAAgBnS,EADH+R,EA7BDG,MAgCZC,EAAgBnS,EAAU+R,GAAY,IAG1CI,EAAcp9B,KAAK21B,EA7BnB,GACJ,IAyEA,WAMI,IAFA,IACIltB,EAAU,EACP4zB,EAAa3tC,QAEhB+Z,IACAwe,GAAU8V,EAFIV,EAAazU,QAEW,SAAUyV,GACD,KAArCf,EAAsBe,IACxBhB,EAAar8B,KAAKq9B,EAE1B,IAGJ,GAAI50B,IAAYwzB,EACZ,MAAM,IAAI9tC,MACN,gEAGZ,CA5FAmvC,GACAV,GAsGJ,EAWA,SAASW,GAASlmC,EAAOypB,GAKvB,IAJA,IAAI5M,GAAS,EACTxlB,EAAkB,MAAT2I,EAAgB,EAAIA,EAAM3I,OACnC4J,EAAS3B,MAAMjI,KAEVwlB,EAAQxlB,GACf4J,EAAO4b,GAAS4M,EAASzpB,EAAM6c,GAAQA,EAAO7c,GAEhD,OAAOiB,CACT,CAGA,IAAI2mB,GAAY,kBAyBhB,IAAIue,GAAW,IAGX9Z,GAAcwT,EAAWA,EAASv+B,eAAY9F,EAC9C4qC,GAAiB/Z,GAAcA,GAAY5sB,cAAWjE,EAU1D,SAAS6qC,GAAahuC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIugB,EAAQvgB,GAEV,OAAO6tC,GAAS7tC,EAAOguC,IAAgB,GAEzC,GA7BF,SAAkBhuC,GAChB,MAAuB,iBAATA,GACX24B,EAAa34B,IAAU+nC,EAAW/nC,IAAUuvB,EACjD,CA0BM0e,CAASjuC,GACX,OAAO+tC,GAAiBA,GAAe7kC,KAAKlJ,GAAS,GAEvD,IAAI4I,EAAU5I,EAAQ,GACtB,MAAkB,KAAV4I,GAAkB,EAAI5I,IAAW8tC,GAAY,KAAOllC,CAC9D,CAyCA,SAASslC,GAAUvmC,EAAO0a,EAAOC,GAC/B,IAAItjB,EAAS2I,EAAM3I,OAEnB,OADAsjB,OAAcnf,IAARmf,EAAoBtjB,EAASsjB,GAC1BD,GAASC,GAAOtjB,EAAU2I,EAjCrC,SAAmBA,EAAO0a,EAAOC,GAC/B,IAAIkC,GAAS,EACTxlB,EAAS2I,EAAM3I,OAEfqjB,EAAQ,IACVA,GAASA,EAAQrjB,EAAS,EAAKA,EAASqjB,IAE1CC,EAAMA,EAAMtjB,EAASA,EAASsjB,GACpB,IACRA,GAAOtjB,GAETA,EAASqjB,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIzZ,EAAS3B,MAAMjI,KACVwlB,EAAQxlB,GACf4J,EAAO4b,GAAS7c,EAAM6c,EAAQnC,GAEhC,OAAOzZ,CACT,CAc6CulC,CAAUxmC,EAAO0a,EAAOC,EACrE,CA+CA,IAWI8rB,GAAe1b,OAAO,uFAc1B,IAAI2b,GAAkB,kBAQlBC,GAAW,IAAMD,GAAkB,IACnCE,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAOJ,GAAkB,IACvCK,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAO1BK,KACXC,GAAW,oBAEXC,GAAQD,GAAWF,IADP,gBAA0B,CAACH,GAAaC,GAAYC,IAAYzsB,KAAK,KAAO,IAAM4sB,GAAWF,GAAW,MAEpHI,GAAW,MAAQ,CAACP,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAUpsB,KAAK,KAAO,IAGxG+sB,GAAYvc,OAAO8b,GAAS,MAAQA,GAAS,KAAOQ,GAAWD,GAAO,KAoB1E,SAASG,GAAcnuB,GACrB,OAnDF,SAAoBA,GAClB,OAAOqtB,GAAarW,KAAKhX,EAC3B,CAiDSouB,CAAWpuB,GAZpB,SAAwBA,GACtB,OAAOA,EAAOwC,MAAM0rB,KAAc,EACpC,CAWMG,CAAeruB,GA7ErB,SAAsBA,GACpB,OAAOA,EAAOmJ,MAAM,GACtB,CA4EMmlB,CAAatuB,EACnB,CA4BA,IAAIuuB,GAAS,aAwBb,SAASpM,GAAKniB,EAAQwuB,EAAOC,GAE3B,IADAzuB,EA7BgB,OADA/gB,EA8BE+gB,GA7BK,GAAKitB,GAAahuC,MA8B1BwvC,QAAmBrsC,IAAVosC,GACtB,OAAOxuB,EAAO2E,QAAQ4pB,GAAQ,IAhClC,IAAkBtvC,EAkChB,IAAK+gB,KAAYwuB,EAAQvB,GAAauB,IACpC,OAAOxuB,EAET,IAAI0uB,EAAaP,GAAcnuB,GAC3B2uB,EAAaR,GAAcK,GAI/B,OAAOrB,GAAUuB,EA/JnB,SAAyBA,EAAYC,GAInC,IAHA,IAAIlrB,GAAS,EACTxlB,EAASywC,EAAWzwC,SAEfwlB,EAAQxlB,GAAU+sC,GAAY2D,EAAYD,EAAWjrB,GAAQ,IAAM,IAC5E,OAAOA,CACT,CAsJcmrB,CAAgBF,EAAYC,GA5K1C,SAAuBD,EAAYC,GAGjC,IAFA,IAAIlrB,EAAQirB,EAAWzwC,OAEhBwlB,KAAWunB,GAAY2D,EAAYD,EAAWjrB,GAAQ,IAAM,IACnE,OAAOA,CACT,CAwKYorB,CAAcH,EAAYC,GAAc,GAETxtB,KAAK,GAChD,CAEA,IAAI2tB,GAAU,qDACVC,GAAe,IACfC,GAAS,eACTC,GAAiB,mCA8FrB,SAASC,GAAW5D,EAAOzL,GACvB,IAAIsP,EAAW,CAAC,EAEhBrE,GAAWQ,GAAO,SAAUc,EAAQ1pC,GAChC,IAAI0sC,EACAC,EAAYrJ,EAAQoG,GACpBkD,GACED,GAA+B,IAAlBjD,EAAOnuC,QACrBoxC,GAA+B,IAAlBjD,EAAOnuC,OAEzB,GAAIuhB,EAAQ4sB,GACRgD,EAAShD,EAAOtqC,MAAM,GAAI,GAC1BsqC,EAASA,EAAOA,EAAOnuC,OAAS,GAEhCkxC,EAASzsC,GAAO0sC,EAAOnW,OAAOmW,EAAOnxC,OAAS,EAAIsxC,EAAUnD,QACzD,GAAIkD,EAEPH,EAASzsC,GAAO0pC,MACb,CAEH,GADAgD,EA/GZ,SAAqBze,GAOjB,OAJAA,GADAA,GADAA,EAAOA,EAAKtqB,WAAWse,QAAQsqB,GAAgB,KACnCzsB,MAAMssB,IAAS,GAAGnqB,QAAQ,IAAK,KAC7BgM,EAAKxH,MAAM4lB,IAAgB,IAC7B/hC,KAAI,SAAU6jB,GACtB,OAAOsR,GAAKtR,EAAIlM,QAAQqqB,GAAQ,IACpC,GAEJ,CAuGqBQ,CAAYpD,GACC,IAAlBA,EAAOnuC,SAAiBoxC,GAA+B,IAAlBD,EAAOnxC,OAC5C,MAAM,IAAIP,MAAM,0DAIf2xC,GAAWD,EAAOjY,MAEvBgY,EAASzsC,GAAO0sC,EAAOnW,OAAOsW,EAClC,CAEA,SAASA,EAAQnF,EAASqF,GACtB,IAAIC,EAAU5C,GAASsC,GAAQ,SAAUx5B,GACrC,OAAOw0B,EAAQx0B,EACnB,IACA85B,EAAQngC,KAAKkgC,GACbvJ,EAAUkG,GAAQ1jB,MAAM,KAAMgnB,EAClC,CACJ,IAEArE,GAAK8D,EAAUtP,EACnB,CAMA,SAAS8P,KACLxyC,KAAKyyC,KAAOzyC,KAAK0yC,KAAO,KACxB1yC,KAAKc,OAAS,CAClB,CAEA,SAAS6xC,GAAWC,EAAK5tC,GACrB4tC,EAAI9xC,OAAS,EACb8xC,EAAIH,KAAOG,EAAIF,KAAO1tC,CAC1B,CA4EA,SAAS02B,GAAMmX,EAAQzE,EAAajiB,GAChC,GAAmB,MAAfiiB,EACAA,EAAc,OAEb,GAAmB,IAAhBA,EACJ,MAAM,IAAI7tC,MAAM,gCAGpB,IAAIuyC,EAAU/J,EAAU8J,GACpBE,EAAa,EACbC,EAAc,GAEdC,GAAsB,EAC1B,SAASC,EAAQrwC,EAAMswC,EAAezQ,GAClC,GAAgB,MAAZA,GAAwC,mBAAbA,EAC3B,MAAM,IAAIniC,MAAM,oCAMpB,GAJA4Z,EAAEi5B,SAAU,EACP/wB,EAAQxf,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAK/B,QAAgBqZ,EAAEk5B,OAEvB,OAAO7K,GAAe,WAClBruB,EAAEm5B,OACN,IAGJ,IAAK,IAAI5vC,EAAI,EAAGS,EAAItB,EAAK/B,OAAQ4C,EAAIS,EAAGT,IAAK,CACzC,IAAI2Q,EAAO,CACPxR,KAAMA,EAAKa,GACXg/B,SAAUA,GAAYrG,GAGtB8W,EACAh5B,EAAEo5B,OAAOvrB,QAAQ3T,GAEjB8F,EAAEo5B,OAAOnhC,KAAKiC,EAEtB,CAEK4+B,IACDA,GAAsB,EACtBzK,GAAe,WACXyK,GAAsB,EACtB94B,EAAE9W,SACN,IAER,CAEA,SAASmwC,EAAMrF,GACX,OAAO,SAAS/K,GACZ2P,GAAc,EAEd,IAAK,IAAIrvC,EAAI,EAAGS,EAAIgqC,EAAMrtC,OAAQ4C,EAAIS,EAAGT,IAAK,CAC1C,IAAIkrC,EAAOT,EAAMzqC,GAEb4iB,EAAQunB,GAAYmF,EAAapE,EAAM,GAC7B,IAAVtoB,EACA0sB,EAAYnqC,QACLyd,EAAQ,GACf0sB,EAAYle,OAAOxO,EAAO,GAG9BsoB,EAAKlM,SAASnX,MAAMqjB,EAAMrS,WAEf,MAAP6G,GACAjpB,EAAE6B,MAAMonB,EAAKwL,EAAK/rC,KAE1B,CAEIkwC,GAAe54B,EAAEi0B,YAAcj0B,EAAE1X,QACjC0X,EAAEs5B,cAGFt5B,EAAEk5B,QACFl5B,EAAEm5B,QAENn5B,EAAE9W,SACN,CACJ,CAEA,IAAIqwC,GAAe,EACfv5B,EAAI,CACJo5B,OAAQ,IAAIf,GACZpE,YAAaA,EACbjiB,QAASA,EACTwnB,UAAWtX,EACXoX,YAAYpX,EACZ55B,OAAQ2rC,EAAc,EACtBwF,MAAOvX,EACPiX,MAAOjX,EACPrgB,MAAOqgB,EACP+W,SAAS,EACTS,QAAQ,EACRzhC,KAAM,SAAUvP,EAAM6/B,GAClBwQ,EAAQrwC,GAAM,EAAO6/B,EACzB,EACAoR,KAAM,WACF35B,EAAEm5B,MAAQjX,EACVliB,EAAEo5B,OAAOK,OACb,EACA5rB,QAAS,SAAUnlB,EAAM6/B,GACrBwQ,EAAQrwC,GAAM,EAAM6/B,EACxB,EACAvE,OAAQ,SAAU4V,GACd55B,EAAEo5B,OAAOpV,OAAO4V,EACpB,EACA1wC,QAAS,WAGL,IAAIqwC,EAAJ,CAIA,IADAA,GAAe,GACRv5B,EAAE05B,QAAUd,EAAa54B,EAAEi0B,aAAej0B,EAAEo5B,OAAOzyC,QAAO,CAC7D,IAAIqtC,EAAQ,GAAItrC,EAAO,GACnBsB,EAAIgW,EAAEo5B,OAAOzyC,OACbqZ,EAAEgS,UAAShoB,EAAIjB,KAAKvB,IAAIwC,EAAGgW,EAAEgS,UACjC,IAAK,IAAIzoB,EAAI,EAAGA,EAAIS,EAAGT,IAAK,CACxB,IAAIsB,EAAOmV,EAAEo5B,OAAO1qC,QACpBslC,EAAM/7B,KAAKpN,GACXguC,EAAY5gC,KAAKpN,GACjBnC,EAAKuP,KAAKpN,EAAKnC,KACnB,CAEAkwC,GAAc,EAEU,IAApB54B,EAAEo5B,OAAOzyC,QACTqZ,EAAEy5B,QAGFb,IAAe54B,EAAEi0B,aACjBj0B,EAAEw5B,YAGN,IAAIzpC,EAAK4hC,GAAS0H,EAAMrF,IACxB2E,EAAQjwC,EAAMqH,EAClB,CACAwpC,GAAe,CA1Bf,CA2BJ,EACA5yC,OAAQ,WACJ,OAAOqZ,EAAEo5B,OAAOzyC,MACpB,EACAmrC,QAAS,WACL,OAAO8G,CACX,EACAC,YAAa,WACT,OAAOA,CACX,EACAK,KAAM,WACF,OAAOl5B,EAAEo5B,OAAOzyC,OAASiyC,IAAe,CAC5C,EACAiB,MAAO,WACH75B,EAAE05B,QAAS,CACf,EACAI,OAAQ,YACa,IAAb95B,EAAE05B,SACN15B,EAAE05B,QAAS,EACXrL,EAAeruB,EAAE9W,SACrB,GAEJ,OAAO8W,CACX,CA+EA,SAAS+5B,GAAMrB,EAAQ1mB,GACnB,OAAOuP,GAAMmX,EAAQ,EAAG1mB,EAC5B,CA9TAqmB,GAAIznC,UAAUopC,WAAa,SAASnvC,GAQhC,OAPIA,EAAKovC,KAAMpvC,EAAKovC,KAAKjpB,KAAOnmB,EAAKmmB,KAChCnrB,KAAKyyC,KAAOztC,EAAKmmB,KAClBnmB,EAAKmmB,KAAMnmB,EAAKmmB,KAAKipB,KAAOpvC,EAAKovC,KAChCp0C,KAAK0yC,KAAO1tC,EAAKovC,KAEtBpvC,EAAKovC,KAAOpvC,EAAKmmB,KAAO,KACxBnrB,KAAKc,QAAU,EACRkE,CACX,EAEAwtC,GAAIznC,UAAU6oC,MAAQ,WAClB,KAAM5zC,KAAKyyC,MAAMzyC,KAAK6I,QACtB,OAAO7I,IACX,EAEAwyC,GAAIznC,UAAUspC,YAAc,SAASrvC,EAAMsvC,GACvCA,EAAQF,KAAOpvC,EACfsvC,EAAQnpB,KAAOnmB,EAAKmmB,KAChBnmB,EAAKmmB,KAAMnmB,EAAKmmB,KAAKipB,KAAOE,EAC3Bt0C,KAAK0yC,KAAO4B,EACjBtvC,EAAKmmB,KAAOmpB,EACZt0C,KAAKc,QAAU,CACnB,EAEA0xC,GAAIznC,UAAUwpC,aAAe,SAASvvC,EAAMsvC,GACxCA,EAAQF,KAAOpvC,EAAKovC,KACpBE,EAAQnpB,KAAOnmB,EACXA,EAAKovC,KAAMpvC,EAAKovC,KAAKjpB,KAAOmpB,EAC3Bt0C,KAAKyyC,KAAO6B,EACjBtvC,EAAKovC,KAAOE,EACZt0C,KAAKc,QAAU,CACnB,EAEA0xC,GAAIznC,UAAUid,QAAU,SAAShjB,GACzBhF,KAAKyyC,KAAMzyC,KAAKu0C,aAAav0C,KAAKyyC,KAAMztC,GACvC2tC,GAAW3yC,KAAMgF,EAC1B,EAEAwtC,GAAIznC,UAAUqH,KAAO,SAASpN,GACtBhF,KAAK0yC,KAAM1yC,KAAKq0C,YAAYr0C,KAAK0yC,KAAM1tC,GACtC2tC,GAAW3yC,KAAMgF,EAC1B,EAEAwtC,GAAIznC,UAAUlC,MAAQ,WAClB,OAAO7I,KAAKyyC,MAAQzyC,KAAKm0C,WAAWn0C,KAAKyyC,KAC7C,EAEAD,GAAIznC,UAAUivB,IAAM,WAChB,OAAOh6B,KAAK0yC,MAAQ1yC,KAAKm0C,WAAWn0C,KAAK0yC,KAC7C,EAEAF,GAAIznC,UAAUypC,QAAU,WAGpB,IAFA,IAAIhsC,EAAMO,MAAM/I,KAAKc,QACjB2zC,EAAOz0C,KAAKyyC,KACR3K,EAAM,EAAGA,EAAM9nC,KAAKc,OAAQgnC,IAChCt/B,EAAIs/B,GAAO2M,EAAK5xC,KAChB4xC,EAAOA,EAAKtpB,KAEhB,OAAO3iB,CACX,EAEAgqC,GAAIznC,UAAUozB,OAAS,SAAU4V,GAE7B,IADA,IAAIU,EAAOz0C,KAAKyyC,KACRgC,GAAM,CACV,IAAItpB,EAAOspB,EAAKtpB,KACZ4oB,EAAOU,IACPz0C,KAAKm0C,WAAWM,GAEpBA,EAAOtpB,CACX,CACA,OAAOnrB,IACX,EAyQA,IAAI00C,GAAenI,GAAQD,GAAa,GA0CxC,SAAS7hC,GAAO+/B,EAAMmK,EAAMzhB,EAAUwP,GAClCA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI6Q,EAAYnE,EAAU7V,GAC1BwhB,GAAalK,GAAM,SAASp8B,EAAG1K,EAAGg/B,GAC9BwK,EAAUyH,EAAMvmC,GAAG,SAASg1B,EAAKn6B,GAC7B0rC,EAAO1rC,EACPy5B,EAASU,EACb,GACJ,IAAG,SAASA,GACRV,EAASU,EAAKuR,EAClB,GACJ,CAwCA,SAASC,KACL,IAAIC,EAAalF,GAASpT,UAAWwM,GACrC,OAAO,WACH,IAAIzM,EAAO33B,EAAM43B,WACb8M,EAAOrpC,KAEPkK,EAAKoyB,EAAKA,EAAKx7B,OAAS,GACX,mBAANoJ,EACPoyB,EAAKtC,MAEL9vB,EAAKmyB,EAGT5xB,GAAOoqC,EAAYvY,GAAM,SAASwY,EAAS/M,EAAI79B,GAC3C69B,EAAGxc,MAAM8d,EAAMyL,EAAQhZ,QAAO,SAASsH,GACnC,IAAI2R,EAAWpwC,EAAM43B,UAAW,GAChCryB,EAAGk5B,EAAK2R,EACZ,IACJ,IACA,SAAS3R,EAAK6J,GACV/iC,EAAGqhB,MAAM8d,EAAM,CAACjG,GAAKtH,OAAOmR,GAChC,GACJ,CACJ,CAqCA,IAAI+H,GAAU,WACV,OAAOJ,GAAIrpB,MAAM,KAAM5mB,EAAM43B,WAAW0Y,UAC5C,EAEIC,GAAUnsC,MAAMgC,UAAU+wB,OAoB1BqZ,GAAc,SAAS3K,EAAM1I,EAAO5O,EAAUwP,GAC9CA,EAAWA,GAAYrG,EACvB,IAAI6Q,EAAYnE,EAAU7V,GAC1Boa,GAAS9C,EAAM1I,GAAO,SAAS9gB,EAAK0hB,GAChCwK,EAAUlsB,GAAK,SAASoiB,GACpB,OAAIA,EAAYV,EAASU,GAClBV,EAAS,KAAM/9B,EAAM43B,UAAW,GAC3C,GACJ,IAAG,SAAS6G,EAAKgS,GAEb,IADA,IAAI1qC,EAAS,GACJhH,EAAI,EAAGA,EAAI0xC,EAAWt0C,OAAQ4C,IAC/B0xC,EAAW1xC,KACXgH,EAASwqC,GAAQ3pB,MAAM7gB,EAAQ0qC,EAAW1xC,KAIlD,OAAOg/B,EAASU,EAAK14B,EACzB,GACJ,EA2BIoxB,GAASyQ,GAAQ4I,GAAatI,KAoB9BwI,GAAe9I,GAAQ4I,GAAa,GA4CpCG,GAAW,WACX,IAAIx6B,EAASnW,EAAM43B,WACfD,EAAO,CAAC,MAAMR,OAAOhhB,GACzB,OAAO,WAEH,OADeyhB,UAAUA,UAAUz7B,OAAS,GAC5ByqB,MAAMvrB,KAAMs8B,EAChC,CACJ,EAkBA,SAASiZ,GAASzzC,GAChB,OAAOA,CACT,CAEA,SAAS0zC,GAAcnvB,EAAOovB,GAC1B,OAAO,SAASvM,EAAQ1gC,EAAK0qB,EAAUhpB,GACnCA,EAAKA,GAAMmyB,EACX,IACIqZ,EADAC,GAAa,EAEjBzM,EAAO1gC,GAAK,SAAS1G,EAAOqrC,EAAGzK,GAC3BxP,EAASpxB,GAAO,SAASshC,EAAK14B,GACtB04B,EACAV,EAASU,GACF/c,EAAM3b,KAAYgrC,GACzBC,GAAa,EACbD,EAAaD,GAAU,EAAM3zC,GAC7B4gC,EAAS,KAAMyH,IAEfzH,GAER,GACJ,IAAG,SAASU,GACJA,EACAl5B,EAAGk5B,GAEHl5B,EAAG,KAAMyrC,EAAaD,EAAaD,GAAU,GAErD,GACJ,CACJ,CAEA,SAASG,GAAe3sC,EAAGmF,GACvB,OAAOA,CACX,CAqCA,IAAIynC,GAAS9I,GAAWyI,GAAcD,GAAUK,KAwB5CE,GAAczI,GAAgBmI,GAAcD,GAAUK,KAsBtDG,GAAexJ,GAAQuJ,GAAa,GAExC,SAASE,GAAYv9B,GACjB,OAAO,SAAUsvB,GACb,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5BD,EAAKlqB,MAAK,SAAUgxB,GAChB,IAAI9G,EAAO33B,EAAM43B,UAAW,GACL,iBAAZ5Q,UACHyX,EACIzX,QAAQ3P,OACR2P,QAAQ3P,MAAMonB,GAEXzX,QAAQlT,IACf4gB,GAAUiD,GAAM,SAAUluB,GACtBud,QAAQlT,GAAMrK,EAClB,IAGZ,IACA26B,EAAUhB,GAAIxc,MAAM,KAAM+Q,EAC9B,CACJ,CA+BA,IAAImB,GAAMuY,GAAY,OAsBtB,SAASC,GAASlO,EAAIlO,EAAM6I,GACxBA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Z,EAAMnN,EAAUhB,GAChBoO,EAAQpN,EAAUlP,GAEtB,SAAS1O,EAAKiY,GACV,GAAIA,EAAK,OAAOV,EAASU,GACzB,IAAI9G,EAAO33B,EAAM43B,UAAW,GAC5BD,EAAKlqB,KAAKiU,GACV8vB,EAAM5qB,MAAMvrB,KAAMs8B,EACtB,CAEA,SAASjW,EAAM+c,EAAKgT,GAChB,OAAIhT,EAAYV,EAASU,GACpBgT,OACLF,EAAI/qB,GADeuX,EAAS,KAEhC,CAEArc,EAAM,MAAM,EAEhB,CAwBA,SAASgwB,GAASnjB,EAAU2G,EAAM6I,GAC9BA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Q,EAAYnE,EAAU7V,GACtB/H,EAAO,SAASiY,GAChB,GAAIA,EAAK,OAAOV,EAASU,GACzB,IAAI9G,EAAO33B,EAAM43B,UAAW,GAC5B,GAAI1C,EAAKtO,MAAMvrB,KAAMs8B,GAAO,OAAO4Q,EAAU/hB,GAC7CuX,EAASnX,MAAM,KAAM,CAAC,MAAMuQ,OAAOQ,GACvC,EACA4Q,EAAU/hB,EACd,CAsBA,SAASmrB,GAAQpjB,EAAU2G,EAAM6I,GAC7B2T,GAASnjB,GAAU,WACf,OAAQ2G,EAAKtO,MAAMvrB,KAAMu8B,UAC7B,GAAGmG,EACP,CAsCA,SAAS6T,GAAO1c,EAAMkO,EAAIrF,GACtBA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Z,EAAMnN,EAAUhB,GAChBoO,EAAQpN,EAAUlP,GAEtB,SAAS1O,EAAKiY,GACV,GAAIA,EAAK,OAAOV,EAASU,GACzB+S,EAAM9vB,EACV,CAEA,SAASA,EAAM+c,EAAKgT,GAChB,OAAIhT,EAAYV,EAASU,GACpBgT,OACLF,EAAI/qB,GADeuX,EAAS,KAEhC,CAEAyT,EAAM9vB,EACV,CAEA,SAASmwB,GAActjB,GACnB,OAAO,SAAUpxB,EAAOwkB,EAAOoc,GAC3B,OAAOxP,EAASpxB,EAAO4gC,EAC3B,CACJ,CA2DA,SAAS+T,GAAUjM,EAAMtX,EAAUwP,GAC/BoK,GAAOtC,EAAMgM,GAAczN,EAAU7V,IAAYwP,EACrD,CAsBA,SAASgU,GAAYlM,EAAM1I,EAAO5O,EAAUwP,GACxCqJ,GAAajK,EAAbiK,CAAoBvB,EAAMgM,GAAczN,EAAU7V,IAAYwP,EAClE,CAqBA,IAAIO,GAAasJ,GAAQmK,GAAa,GAqCtC,SAASC,GAAY5O,GACjB,OAAIc,EAAQd,GAAYA,EACjBE,GAAc,SAAU3L,EAAMoG,GACjC,IAAIkU,GAAO,EACXta,EAAKlqB,MAAK,WACN,IAAIykC,EAAYta,UACZqa,EACApO,GAAe,WACX9F,EAASnX,MAAM,KAAMsrB,EACzB,IAEAnU,EAASnX,MAAM,KAAMsrB,EAE7B,IACA9O,EAAGxc,MAAMvrB,KAAMs8B,GACfsa,GAAO,CACX,GACJ,CAEA,SAASE,GAAM7tC,GACX,OAAQA,CACZ,CA8BA,IAAIuB,GAAQuiC,GAAWyI,GAAcsB,GAAOA,KAsBxCC,GAAa1J,GAAgBmI,GAAcsB,GAAOA,KAqBlDE,GAAczK,GAAQwK,GAAY,GAStC,SAASE,GAAa1xC,GACpB,OAAO,SAASkxB,GACd,OAAiB,MAAVA,OAAiBxxB,EAAYwxB,EAAOlxB,EAC7C,CACF,CAEA,SAAS2xC,GAAYhO,EAAQ1gC,EAAK0qB,EAAUwP,GACxC,IAAIyU,EAAc,IAAIpuC,MAAMP,EAAI1H,QAChCooC,EAAO1gC,GAAK,SAAU4F,EAAGkY,EAAOoc,GAC5BxP,EAAS9kB,GAAG,SAAUg1B,EAAKn6B,GACvBkuC,EAAY7wB,KAAWrd,EACvBy5B,EAASU,EACb,GACJ,IAAG,SAAUA,GACT,GAAIA,EAAK,OAAOV,EAASU,GAEzB,IADA,IAAI6J,EAAU,GACLvpC,EAAI,EAAGA,EAAI8E,EAAI1H,OAAQ4C,IACxByzC,EAAYzzC,IAAIupC,EAAQ76B,KAAK5J,EAAI9E,IAEzCg/B,EAAS,KAAMuK,EACnB,GACJ,CAEA,SAASmK,GAAclO,EAAQsB,EAAMtX,EAAUwP,GAC3C,IAAIuK,EAAU,GACd/D,EAAOsB,GAAM,SAAUp8B,EAAGkY,EAAOoc,GAC7BxP,EAAS9kB,GAAG,SAAUg1B,EAAKn6B,GACnBm6B,EACAV,EAASU,IAELn6B,GACAgkC,EAAQ76B,KAAK,CAACkU,MAAOA,EAAOxkB,MAAOsM,IAEvCs0B,IAER,GACJ,IAAG,SAAUU,GACLA,EACAV,EAASU,GAETV,EAAS,KAAMiN,GAAS1C,EAAQoK,MAAK,SAAUnxC,EAAGzF,GAC9C,OAAOyF,EAAEogB,MAAQ7lB,EAAE6lB,KACvB,IAAI2wB,GAAa,UAEzB,GACJ,CAEA,SAASK,GAAQpO,EAAQsB,EAAMtX,EAAUwP,IACxBpI,EAAYkQ,GAAQ0M,GAAcE,IACxClO,EAAQsB,EAAMzB,EAAU7V,GAAWwP,GAAYrG,EAC1D,CA6BA,IAAIoG,GAASsK,GAAWuK,IAqBpBC,GAAclK,GAAgBiK,IAmB9BE,GAAejL,GAAQgL,GAAa,GA+BxC,SAASE,GAAQ1P,EAAI2P,GACjB,IAAIrsB,EAAOygB,GAAS4L,GAAWrb,GAC3BuS,EAAO7F,EAAU4N,GAAY5O,KAEjC,SAAS5c,EAAKiY,GACV,GAAIA,EAAK,OAAO/X,EAAK+X,GACrBwL,EAAKzjB,EACT,CACAA,EACJ,CAqBA,IAAIwsB,GAAe,SAASnN,EAAM1I,EAAO5O,EAAUwP,GAC/CA,EAAWA,GAAYrG,EACvB,IAAI6Q,EAAYnE,EAAU7V,GAC1Boa,GAAS9C,EAAM1I,GAAO,SAAS9gB,EAAK0hB,GAChCwK,EAAUlsB,GAAK,SAASoiB,EAAK79B,GACzB,OAAI69B,EAAYV,EAASU,GAClBV,EAAS,KAAM,CAACn9B,IAAKA,EAAKyb,IAAKA,GAC1C,GACJ,IAAG,SAASoiB,EAAKgS,GAKb,IAJA,IAAI1qC,EAAS,CAAC,EAEVmkB,EAAiBjtB,OAAOmJ,UAAU8jB,eAE7BnrB,EAAI,EAAGA,EAAI0xC,EAAWt0C,OAAQ4C,IACnC,GAAI0xC,EAAW1xC,GAAI,CACf,IAAI6B,EAAM6vC,EAAW1xC,GAAG6B,IACpByb,EAAMo0B,EAAW1xC,GAAGsd,IAEpB6N,EAAe7jB,KAAKN,EAAQnF,GAC5BmF,EAAOnF,GAAK6M,KAAK4O,GAEjBtW,EAAOnF,GAAO,CAACyb,EAEvB,CAGJ,OAAO0hB,EAASU,EAAK14B,EACzB,GACJ,EAsCIktC,GAAUrL,GAAQoL,GAAc9K,KAqBhCgL,GAAgBtL,GAAQoL,GAAc,GA6BtCp2B,GAAMy0B,GAAY,OAuBtB,SAAS8B,GAAehtC,EAAKg3B,EAAO5O,EAAUwP,GAC1CA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI0b,EAAS,CAAC,EACV7K,EAAYnE,EAAU7V,GAC1BoZ,GAAYxhC,EAAKg3B,GAAO,SAAS9gB,EAAKzb,EAAK4lB,GACvC+hB,EAAUlsB,EAAKzb,GAAK,SAAU69B,EAAK14B,GAC/B,GAAI04B,EAAK,OAAOjY,EAAKiY,GACrB2U,EAAOxyC,GAAOmF,EACdygB,GACJ,GACJ,IAAG,SAAUiY,GACTV,EAASU,EAAK2U,EAClB,GACJ,CA+CA,IAAIC,GAAYzL,GAAQuL,GAAgBjL,KAqBpCoL,GAAkB1L,GAAQuL,GAAgB,GAE9C,SAAS/d,GAAIjvB,EAAKvF,GACd,OAAOA,KAAOuF,CAClB,CAuCA,SAASotC,GAAQnQ,EAAIoQ,GACjB,IAAIxD,EAAO/yC,OAAOX,OAAO,MACrBm3C,EAASx2C,OAAOX,OAAO,MAC3Bk3C,EAASA,GAAU5C,GACnB,IAAIW,EAAMnN,EAAUhB,GAChBsQ,EAAWpQ,GAAc,SAAkB3L,EAAMoG,GACjD,IAAIn9B,EAAM4yC,EAAO5sB,MAAM,KAAM+Q,GACzBvC,GAAI4a,EAAMpvC,GACVijC,GAAe,WACX9F,EAASnX,MAAM,KAAMopB,EAAKpvC,GAC9B,IACOw0B,GAAIqe,EAAQ7yC,GACnB6yC,EAAO7yC,GAAK6M,KAAKswB,IAEjB0V,EAAO7yC,GAAO,CAACm9B,GACfwT,EAAI3qB,MAAM,KAAM+Q,EAAKR,QAAO,WACxB,IAAIQ,EAAO33B,EAAM43B,WACjBoY,EAAKpvC,GAAO+2B,EACZ,IAAIniB,EAAIi+B,EAAO7yC,UACR6yC,EAAO7yC,GACd,IAAK,IAAI7B,EAAI,EAAGS,EAAIgW,EAAErZ,OAAQ4C,EAAIS,EAAGT,IACjCyW,EAAEzW,GAAG6nB,MAAM,KAAM+Q,EAEzB,KAER,IAGA,OAFA+b,EAAS1D,KAAOA,EAChB0D,EAASC,WAAavQ,EACfsQ,CACX,CA2CA,IAAInwC,GAAWogC,EARXF,EACW/kC,EAAQ6E,SACZggC,EACIC,aAEAE,GAKf,SAASkQ,GAAUrP,EAAQiF,EAAOzL,GAC9BA,EAAWA,GAAYrG,EACvB,IAAI4Q,EAAU3S,EAAY6T,GAAS,GAAK,CAAC,EAEzCjF,EAAOiF,GAAO,SAAUS,EAAMrpC,EAAKm9B,GAC/BqG,EAAU6F,EAAV7F,EAAgB,SAAU3F,EAAK14B,GACvB6xB,UAAUz7B,OAAS,IACnB4J,EAAS/F,EAAM43B,UAAW,IAE9B0Q,EAAQ1nC,GAAOmF,EACfg4B,EAASU,EACb,GACJ,IAAG,SAAUA,GACTV,EAASU,EAAK6J,EAClB,GACJ,CAuEA,SAASuL,GAAcrK,EAAOzL,GAC1B6V,GAAUzL,GAAQqB,EAAOzL,EAC7B,CAqBA,SAAS+V,GAAgBtK,EAAOrM,EAAOY,GACnC6V,GAAUxM,GAAajK,GAAQqM,EAAOzL,EAC1C,CA2GA,IAAIgW,GAAU,SAAU7F,EAAQzE,GAC5B,IAAI0E,EAAU/J,EAAU8J,GACxB,OAAOnX,IAAM,SAAUoH,EAAO54B,GAC1B4oC,EAAQhQ,EAAM,GAAI54B,EACtB,GAAGkkC,EAAa,EACpB,EAyBIuK,GAAgB,SAAS9F,EAAQzE,GAEjC,IAAIj0B,EAAIu+B,GAAQ7F,EAAQzE,GA4CxB,OAzCAj0B,EAAE/H,KAAO,SAASvP,EAAM+1C,EAAUlW,GAE9B,GADgB,MAAZA,IAAkBA,EAAWrG,GACT,mBAAbqG,EACP,MAAM,IAAIniC,MAAM,oCAMpB,GAJA4Z,EAAEi5B,SAAU,EACP/wB,EAAQxf,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAK/B,OAEL,OAAO0nC,GAAe,WAClBruB,EAAEm5B,OACN,IAGJsF,EAAWA,GAAY,EAEvB,IADA,IAAIC,EAAW1+B,EAAEo5B,OAAOd,KACjBoG,GAAYD,GAAYC,EAASD,UACpCC,EAAWA,EAAS1tB,KAGxB,IAAK,IAAIznB,EAAI,EAAGS,EAAItB,EAAK/B,OAAQ4C,EAAIS,EAAGT,IAAK,CACzC,IAAI2Q,EAAO,CACPxR,KAAMA,EAAKa,GACXk1C,SAAUA,EACVlW,SAAUA,GAGVmW,EACA1+B,EAAEo5B,OAAOgB,aAAasE,EAAUxkC,GAEhC8F,EAAEo5B,OAAOnhC,KAAKiC,EAEtB,CACAm0B,EAAeruB,EAAE9W,QACrB,SAGO8W,EAAE6N,QAEF7N,CACX,EAsCA,SAAS2+B,GAAK3K,EAAOzL,GAEjB,GADAA,EAAW5F,EAAK4F,GAAYrG,IACvBha,EAAQ8rB,GAAQ,OAAOzL,EAAS,IAAI7hC,UAAU,yDACnD,IAAKstC,EAAMrtC,OAAQ,OAAO4hC,IAC1B,IAAK,IAAIh/B,EAAI,EAAGS,EAAIgqC,EAAMrtC,OAAQ4C,EAAIS,EAAGT,IACrCqlC,EAAUoF,EAAMzqC,GAAhBqlC,CAAoBrG,EAE5B,CAwBA,SAAS/yB,GAAalG,EAAOkrC,EAAMzhB,EAAUwP,GAEzCj4B,GADe9F,EAAM8E,GAAOwrC,UACXN,EAAMzhB,EAAUwP,EACrC,CAyCA,SAASqW,GAAQhR,GACb,IAAImO,EAAMnN,EAAUhB,GACpB,OAAOE,GAAc,SAAmB3L,EAAM0c,GAe1C,OAdA1c,EAAKlqB,MAAK,SAAkB4J,EAAOi9B,GAI3B,IAAIn3C,EAHJka,EACAg9B,EAAgB,KAAM,CAAEh9B,MAAOA,KAI3Bla,EADAy6B,UAAUz7B,QAAU,EACZm4C,EAEAt0C,EAAM43B,UAAW,GAE7Byc,EAAgB,KAAM,CAAEl3C,MAAOA,IAEvC,IAEOo0C,EAAI3qB,MAAMvrB,KAAMs8B,EAC3B,GACJ,CAqEA,SAAS4c,GAAW/K,GAChB,IAAIlB,EASJ,OARI5qB,EAAQ8rB,GACRlB,EAAU0C,GAASxB,EAAO4K,KAE1B9L,EAAU,CAAC,EACXU,GAAWQ,GAAO,SAASS,EAAMrpC,GAC7B0nC,EAAQ1nC,GAAOwzC,GAAQ/tC,KAAKhL,KAAM4uC,EACtC,KAEG3B,CACX,CAEA,SAASkM,GAASjQ,EAAQ1gC,EAAK0qB,EAAUwP,GACrC4U,GAAQpO,EAAQ1gC,GAAK,SAAS1G,EAAOoI,GACjCgpB,EAASpxB,GAAO,SAASshC,EAAKn6B,GAC1BiB,EAAGk5B,GAAMn6B,EACb,GACJ,GAAGy5B,EACP,CA6BA,IAAI1X,GAAS+hB,GAAWoM,IAqBpBC,GAAc/L,GAAgB8L,IAmB9BE,GAAe9M,GAAQ6M,GAAa,GAqBxC,SAASE,GAAWx3C,GAClB,OAAO,WACL,OAAOA,CACT,CACF,CAsFA,SAASy3C,GAAM1uC,EAAM+jC,EAAMlM,GACvB,IAGI8W,EAAU,CACVC,MAJgB,EAKhBC,aAAcJ,GAJK,IA+BvB,GARI/c,UAAUz7B,OAAS,GAAqB,mBAAT+J,GAC/B63B,EAAWkM,GAAQvS,EACnBuS,EAAO/jC,IAlBX,SAAoB4E,EAAKkP,GACrB,GAAiB,iBAANA,EACPlP,EAAIgqC,OAAS96B,EAAE86B,OAVH,EAYZhqC,EAAIiqC,aAAqC,mBAAf/6B,EAAEg7B,SACxBh7B,EAAEg7B,SACFL,IAAY36B,EAAEg7B,UAbH,GAeflqC,EAAImqC,YAAcj7B,EAAEi7B,gBACjB,IAAiB,iBAANj7B,GAA+B,iBAANA,EAGvC,MAAM,IAAIpe,MAAM,qCAFhBkP,EAAIgqC,OAAS96B,GAlBD,CAqBhB,CACJ,CAMIk7B,CAAWL,EAAS3uC,GACpB63B,EAAWA,GAAYrG,GAGP,mBAATuS,EACP,MAAM,IAAIruC,MAAM,qCAGpB,IAAIu5C,EAAQ/Q,EAAU6F,GAElBmL,EAAU,GACd,SAASC,IACLF,GAAM,SAAS1W,GACPA,GAAO2W,IAAYP,EAAQC,QACI,mBAAvBD,EAAQI,aACZJ,EAAQI,YAAYxW,IACxB7H,WAAWye,EAAcR,EAAQE,aAAaK,IAE9CrX,EAASnX,MAAM,KAAMgR,UAE7B,GACJ,CAEAyd,EACJ,CA8BA,IAAIC,GAAY,SAAUpvC,EAAM+jC,GACvBA,IACDA,EAAO/jC,EACPA,EAAO,MAEX,IAAIivC,EAAQ/Q,EAAU6F,GACtB,OAAO3G,GAAc,SAAU3L,EAAMoG,GACjC,SAASuM,EAAO/kC,GACZ4vC,EAAMvuB,MAAM,KAAM+Q,EAAKR,OAAO5xB,GAClC,CAEIW,EAAM0uC,GAAM1uC,EAAMokC,EAAQvM,GACzB6W,GAAMtK,EAAQvM,EAEvB,GACJ,EAkEA,SAASQ,GAAOiL,EAAOzL,GACnB6V,GAAU7D,GAAcvG,EAAOzL,EACnC,CAgCA,IAAIzB,GAAO8L,GAAWyI,GAAc0E,QAAS3E,KAuBzC4E,GAAY9M,GAAgBmI,GAAc0E,QAAS3E,KAsBnD6E,GAAa7N,GAAQ4N,GAAW,GAiDpC,SAASE,GAAQ7P,EAAMtX,EAAUwP,GAC7B,IAAIwK,EAAYnE,EAAU7V,GAW1B,SAASonB,EAAWpiC,EAAMqiC,GACtB,IAAIr0C,EAAIgS,EAAKsiC,SAAU/5C,EAAI85C,EAAMC,SACjC,OAAOt0C,EAAIzF,GAAK,EAAIyF,EAAIzF,EAAI,EAAI,CACpC,CAbAoP,GAAI26B,GAAM,SAAUp8B,EAAGs0B,GACnBwK,EAAU9+B,GAAG,SAAUg1B,EAAKoX,GACxB,GAAIpX,EAAK,OAAOV,EAASU,GACzBV,EAAS,KAAM,CAAC5gC,MAAOsM,EAAGosC,SAAUA,GACxC,GACJ,IAAG,SAAUpX,EAAK6J,GACd,GAAI7J,EAAK,OAAOV,EAASU,GACzBV,EAAS,KAAMiN,GAAS1C,EAAQoK,KAAKiD,GAAarD,GAAa,UACnE,GAMJ,CA2CA,SAASjb,GAAQgN,EAASyR,EAAcC,GACpC,IAAI3S,EAAKgB,EAAUC,GAEnB,OAAOf,GAAc,SAAU3L,EAAMoG,GACjC,IACIiY,EADAC,GAAW,EAcfte,EAAKlqB,MAAK,WACDwoC,IACDlY,EAASnX,MAAM,KAAMgR,WACrBf,aAAamf,GAErB,IAGAA,EAAQpf,YAnBR,WACI,IAAI9iB,EAAOuwB,EAAQvwB,MAAQ,YACvBuD,EAAS,IAAIzb,MAAM,sBAAwBkY,EAAO,gBACtDuD,EAAMiI,KAAO,YACTy2B,IACA1+B,EAAM0+B,KAAOA,GAEjBE,GAAW,EACXlY,EAAS1mB,EACb,GAUoCy+B,GACpC1S,EAAGxc,MAAM,KAAM+Q,EACnB,GACJ,CAGA,IAAIue,GAAa33C,KAAK43C,KAClBC,GAAY73C,KAAKgrB,IAyCrB,SAAS8sB,GAAU3yB,EAAOyZ,EAAO5O,EAAUwP,GACvC,IAAIwK,EAAYnE,EAAU7V,GAC1Boa,GA9BJ,SAAmBnpB,EAAOC,EAAK8G,EAAMuiB,GAKnC,IAJA,IAAInnB,GAAS,EACTxlB,EAASi6C,GAAUF,IAAYz2B,EAAMD,IAAU+G,GAAQ,IAAK,GAC5DxgB,EAAS3B,MAAMjI,GAEZA,KACL4J,EAAO+iC,EAAY3sC,IAAWwlB,GAASnC,EACvCA,GAAS+G,EAEX,OAAOxgB,CACT,CAoBauwC,CAAU,EAAG5yB,EAAO,GAAIyZ,EAAOoL,EAAWxK,EACvD,CAkCA,IAAI+W,GAAQlN,GAAQyO,GAAWnO,KAgB3BxJ,GAAckJ,GAAQyO,GAAW,GA4CrC,SAASvnB,GAAW+W,EAAMrX,EAAaD,EAAUwP,GACzCnG,UAAUz7B,QAAU,IACpB4hC,EAAWxP,EACXA,EAAWC,EACXA,EAAc9Q,EAAQmoB,GAAQ,GAAK,CAAC,GAExC9H,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI6Q,EAAYnE,EAAU7V,GAE1B4Z,GAAOtC,GAAM,SAASvhC,EAAGiE,EAAGhD,GACxBgjC,EAAU/Z,EAAalqB,EAAGiE,EAAGhD,EACjC,IAAG,SAASk5B,GACRV,EAASU,EAAKjQ,EAClB,GACJ,CAuCA,SAAS+nB,GAAQ/M,EAAOzL,GACpB,IACIh4B,EADAsR,EAAQ,KAEZ0mB,EAAWA,GAAYrG,EACvB4G,GAAWkL,GAAO,SAASS,EAAMlM,GAC7BqG,EAAU6F,EAAV7F,EAAgB,SAAU3F,EAAK1+B,GAEvBgG,EADA6xB,UAAUz7B,OAAS,EACV6D,EAAM43B,UAAW,GAEjB73B,EAEbsX,EAAQonB,EACRV,GAAUU,EACd,GACJ,IAAG,WACCV,EAAS1mB,EAAOtR,EACpB,GACJ,CAeA,SAASywC,GAAUpT,GACf,OAAO,WACH,OAAQA,EAAGuQ,YAAcvQ,GAAIxc,MAAM,KAAMgR,UAC7C,CACJ,CAoCA,SAAS6e,GAAOvhB,EAAM3G,EAAUwP,GAC5BA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Q,EAAYnE,EAAU7V,GAC1B,IAAK2G,IAAQ,OAAO6I,EAAS,MAC7B,IAAIvX,EAAO,SAASiY,GAChB,GAAIA,EAAK,OAAOV,EAASU,GACzB,GAAIvJ,IAAQ,OAAOqT,EAAU/hB,GAC7B,IAAImR,EAAO33B,EAAM43B,UAAW,GAC5BmG,EAASnX,MAAM,KAAM,CAAC,MAAMuQ,OAAOQ,GACvC,EACA4Q,EAAU/hB,EACd,CAwBA,SAASkwB,GAAMxhB,EAAM3G,EAAUwP,GAC3B0Y,IAAO,WACH,OAAQvhB,EAAKtO,MAAMvrB,KAAMu8B,UAC7B,GAAGrJ,EAAUwP,EACjB,CA2DA,IAAIwD,GAAY,SAASiI,EAAOzL,GAE5B,GADAA,EAAW5F,EAAK4F,GAAYrG,IACvBha,EAAQ8rB,GAAQ,OAAOzL,EAAS,IAAIniC,MAAM,8DAC/C,IAAK4tC,EAAMrtC,OAAQ,OAAO4hC,IAC1B,IAAI4Y,EAAY,EAEhB,SAASC,EAASjf,GACd,IAAIsS,EAAO7F,EAAUoF,EAAMmN,MAC3Bhf,EAAKlqB,KAAK05B,GAAS3gB,IACnByjB,EAAKrjB,MAAM,KAAM+Q,EACrB,CAEA,SAASnR,EAAKiY,GACV,GAAIA,GAAOkY,IAAcnN,EAAMrtC,OAC3B,OAAO4hC,EAASnX,MAAM,KAAMgR,WAEhCgf,EAAS52C,EAAM43B,UAAW,GAC9B,CAEAgf,EAAS,GACb,EAmEIj1B,GAAQ,CACRiF,MAAOA,EACP6hB,UAAWA,GACXI,gBAAiBA,GACjB/E,SAAUA,EACVyF,KAAMA,GACN6D,WAAYA,GACZmC,MAAOA,GACPc,QAASA,GACTlZ,OAAQA,GACRqZ,YAAaA,GACbE,aAAcA,GACdC,SAAUA,GACVO,OAAQA,GACRC,YAAaA,GACbC,aAAcA,GACdtY,IAAKA,GACLwY,SAAUA,GACVK,QAASA,GACTD,SAAUA,GACVE,OAAQA,GACRiF,KAAM/E,GACNA,UAAWC,GACX5J,OAAQA,GACRR,YAAaA,GACboI,aAAcA,GACdzR,WAAYA,GACZ0T,YAAaA,GACbnsC,MAAOA,GACPusC,WAAYA,GACZC,YAAaA,GACbvU,OAAQA,GACR8U,YAAaA,GACbC,aAAcA,GACdC,QAASA,GACTG,QAASA,GACTD,aAAcA,GACdE,cAAeA,GACft2B,IAAKA,GACL1R,IAAKA,GACLy9B,SAAUA,GACVC,UAAWA,GACXyK,UAAWA,GACXF,eAAgBA,GAChBG,gBAAiBA,GACjBC,QAASA,GACThwC,SAAUA,GACVuzC,SAAUjD,GACVA,cAAeC,GACfE,cAAeA,GACfjd,MAAOgd,GACPI,KAAMA,GACNruC,OAAQA,GACRkF,YAAaA,GACbopC,QAASA,GACTG,WAAYA,GACZluB,OAAQA,GACRouB,YAAaA,GACbC,aAAcA,GACdE,MAAOA,GACPU,UAAWA,GACXrF,IAAKA,GACL1R,OAAQA,GACRiF,aAAcK,EACdvH,KAAMA,GACNkZ,UAAWA,GACXC,WAAYA,GACZC,OAAQA,GACRre,QAASA,GACTyd,MAAOA,GACPiC,WAAYV,GACZ3X,YAAaA,GACb5P,UAAWA,GACXynB,QAASA,GACTC,UAAWA,GACXE,MAAOA,GACPnV,UAAWA,GACXkV,OAAQA,GAGRO,IAAKnxC,GACLoxC,SAAU7E,GACV8E,UAAW7E,GACXxX,IAAKyB,GACL6a,SAAU3B,GACV4B,UAAW3B,GACX4B,KAAMnG,GACNoG,UAAWnG,GACXoG,WAAYnG,GACZ31B,QAASq2B,GACT0F,cAAelZ,GACfmZ,aAAc1F,GACd2F,UAAWvP,GACXwP,gBAAiB5H,GACjB6H,eAAgBjQ,GAChBkQ,OAAQ/xC,GACRgyC,MAAOhyC,GACPiyC,MAAO/sC,GACPgtC,OAAQla,GACRma,YAAarF,GACbsF,aAAcrF,GACdsF,SAAUrU,GAGd7oC,EAAiB,QAAI0mB,GACrB1mB,EAAQ2rB,MAAQA,EAChB3rB,EAAQwtC,UAAYA,GACpBxtC,EAAQ4tC,gBAAkBA,GAC1B5tC,EAAQ6oC,SAAWA,EACnB7oC,EAAQsuC,KAAOA,GACftuC,EAAQmyC,WAAaA,GACrBnyC,EAAQs0C,MAAQA,GAChBt0C,EAAQo1C,QAAUA,GAClBp1C,EAAQk8B,OAASA,GACjBl8B,EAAQu1C,YAAcA,GACtBv1C,EAAQy1C,aAAeA,GACvBz1C,EAAQ01C,SAAWA,GACnB11C,EAAQi2C,OAASA,GACjBj2C,EAAQk2C,YAAcA,GACtBl2C,EAAQm2C,aAAeA,GACvBn2C,EAAQ69B,IAAMA,GACd79B,EAAQq2C,SAAWA,GACnBr2C,EAAQ02C,QAAUA,GAClB12C,EAAQy2C,SAAWA,GACnBz2C,EAAQ22C,OAASA,GACjB32C,EAAQ47C,KAAO/E,GACf72C,EAAQ62C,UAAYC,GACpB92C,EAAQktC,OAASA,GACjBltC,EAAQ0sC,YAAcA,GACtB1sC,EAAQ80C,aAAeA,GACvB90C,EAAQqjC,WAAaA,GACrBrjC,EAAQ+2C,YAAcA,GACtB/2C,EAAQ4K,MAAQA,GAChB5K,EAAQm3C,WAAaA,GACrBn3C,EAAQo3C,YAAcA,GACtBp3C,EAAQ6iC,OAASA,GACjB7iC,EAAQ23C,YAAcA,GACtB33C,EAAQ43C,aAAeA,GACvB53C,EAAQ63C,QAAUA,GAClB73C,EAAQg4C,QAAUA,GAClBh4C,EAAQ+3C,aAAeA,GACvB/3C,EAAQi4C,cAAgBA,GACxBj4C,EAAQ2hB,IAAMA,GACd3hB,EAAQiQ,IAAMA,GACdjQ,EAAQ0tC,SAAWA,GACnB1tC,EAAQ2tC,UAAYA,GACpB3tC,EAAQo4C,UAAYA,GACpBp4C,EAAQk4C,eAAiBA,GACzBl4C,EAAQq4C,gBAAkBA,GAC1Br4C,EAAQs4C,QAAUA,GAClBt4C,EAAQsI,SAAWA,GACnBtI,EAAQ67C,SAAWjD,GACnB54C,EAAQ44C,cAAgBC,GACxB74C,EAAQ+4C,cAAgBA,GACxB/4C,EAAQ87B,MAAQgd,GAChB94C,EAAQk5C,KAAOA,GACfl5C,EAAQ6K,OAASA,GACjB7K,EAAQ+P,YAAcA,GACtB/P,EAAQm5C,QAAUA,GAClBn5C,EAAQs5C,WAAaA,GACrBt5C,EAAQorB,OAASA,GACjBprB,EAAQw5C,YAAcA,GACtBx5C,EAAQy5C,aAAeA,GACvBz5C,EAAQ25C,MAAQA,GAChB35C,EAAQq6C,UAAYA,GACpBr6C,EAAQg1C,IAAMA,GACdh1C,EAAQsjC,OAASA,GACjBtjC,EAAQuoC,aAAeK,EACvB5oC,EAAQqhC,KAAOA,GACfrhC,EAAQu6C,UAAYA,GACpBv6C,EAAQw6C,WAAaA,GACrBx6C,EAAQy6C,OAASA,GACjBz6C,EAAQo8B,QAAUA,GAClBp8B,EAAQ65C,MAAQA,GAChB75C,EAAQ87C,WAAaV,GACrBp7C,EAAQyjC,YAAcA,GACtBzjC,EAAQ6zB,UAAYA,GACpB7zB,EAAQs7C,QAAUA,GAClBt7C,EAAQu7C,UAAYA,GACpBv7C,EAAQy7C,MAAQA,GAChBz7C,EAAQsmC,UAAYA,GACpBtmC,EAAQw7C,OAASA,GACjBx7C,EAAQ+7C,IAAMnxC,GACd5K,EAAQg8C,SAAW7E,GACnBn3C,EAAQi8C,UAAY7E,GACpBp3C,EAAQ4/B,IAAMyB,GACdrhC,EAAQk8C,SAAW3B,GACnBv6C,EAAQm8C,UAAY3B,GACpBx6C,EAAQo8C,KAAOnG,GACfj2C,EAAQq8C,UAAYnG,GACpBl2C,EAAQs8C,WAAanG,GACrBn2C,EAAQwgB,QAAUq2B,GAClB72C,EAAQu8C,cAAgBlZ,GACxBrjC,EAAQw8C,aAAe1F,GACvB92C,EAAQy8C,UAAYvP,GACpBltC,EAAQ08C,gBAAkB5H,GAC1B90C,EAAQ28C,eAAiBjQ,GACzB1sC,EAAQ48C,OAAS/xC,GACjB7K,EAAQ68C,MAAQhyC,GAChB7K,EAAQ88C,MAAQ/sC,GAChB/P,EAAQ+8C,OAASla,GACjB7iC,EAAQg9C,YAAcrF,GACtB33C,EAAQi9C,aAAerF,GACvB53C,EAAQk9C,SAAWrU,EAEnB7mC,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,GAErD,CA1+KgEnC,CAAQC,+BCGvEC,EAAOD,QAAU,EAAjB,+BCJW,SAAS+e,EAAEA,EAAExN,IAAI,MAAMA,GAAGA,EAAEwN,EAAE7d,UAAUqQ,EAAEwN,EAAE7d,QAAQ,IAAI,IAAIV,EAAE,EAAEuc,EAAE,IAAI5T,MAAMoI,GAAG/Q,EAAE+Q,EAAE/Q,IAAIuc,EAAEvc,GAAGue,EAAEve,GAAG,OAAOuc,CAAC,CAAC,SAASxL,EAAEA,EAAE/Q,GAAG,IAAIuc,EAAE,GAAG,oBAAoB+X,QAAQ,MAAMvjB,EAAEujB,OAAO4V,UAAU,CAAC,GAAGvhC,MAAMsZ,QAAQlR,KAAKwL,EAAE,SAASxL,EAAE/Q,GAAG,GAAG+Q,EAAE,CAAC,GAAG,iBAAiBA,EAAE,OAAOwN,EAAExN,OAAE,GAAQ,IAAIwL,EAAE/a,OAAOmJ,UAAU7B,SAAS8B,KAAKmG,GAAGxM,MAAM,GAAG,GAAG,MAAM,WAAWgY,GAAGxL,EAAE/O,cAAcua,EAAExL,EAAE/O,YAAYqW,MAAM,QAAQkE,GAAG,QAAQA,EAAE5T,MAAMC,KAAKmI,GAAG,cAAcwL,GAAG,2CAA2Ckd,KAAKld,GAAGgC,EAAExN,OAAE,QAAQ,CAAM,CAAC,CAArS,CAAuSA,KAAK/Q,GAAG+Q,GAAG,iBAAiBA,EAAErQ,OAAO,CAAC6b,IAAIxL,EAAEwL,GAAG,IAAIzW,EAAE,EAAE,OAAO,WAAW,OAAOA,GAAGiL,EAAErQ,OAAO,CAACuqB,MAAK,GAAI,CAACA,MAAK,EAAGvpB,MAAMqP,EAAEjL,KAAK,CAAC,CAAC,MAAM,IAAIrF,UAAU,wIAAwI,CAAC,OAAO8b,EAAExL,EAAEujB,OAAO4V,aAAanf,KAAK4xB,KAAKpgC,EAAE,CAAC,SAASvc,EAAEue,EAAEve,GAAG,YAAO,IAASA,IAAIA,EAAE,iaAAiaA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE,GAAG,YAAO,IAASue,IAAIve,GAAG,WAAWue,GAAGxN,EAAEqW,QAAQ,YAAYpnB,EAAE,CAApF,CAAsFue,EAAEq+B,QAAQ58C,GAAGA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE,GAAG,YAAO,IAASue,IAAIve,GAAG,QAAQue,GAAGxN,EAAEqW,QAAQ,SAASpnB,EAAE,CAA9E,CAAgFue,EAAEs+B,KAAK78C,GAAGA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE+Q,EAAE,QAAG,IAASwN,EAAE,IAAI,IAAIhC,KAAKgC,EAAElG,KAAKkG,EAAElG,MAAM,IAAIkG,EAAEu+B,IAAIv+B,EAAEu+B,KAAK,GAAGv+B,EAAEve,EAAEA,EAAEonB,QAAQ,IAAI7K,EAAE,IAAIgC,EAAEhC,GAAG,MAAM,OAAOvc,CAAC,CAA/H,CAAiIue,EAAEw+B,IAAI/8C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,WAAW1F,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,OAAO7K,EAAE,CAA5K,CAA8KgC,EAAE0+B,GAAGj9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,UAAU1F,EAAEqmC,GAAG,IAAI,CAAC,OAAOl9C,EAAEonB,QAAQ,MAAM7K,EAAE,CAAxK,CAA0KgC,EAAEzY,EAAE9F,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,aAAa1F,EAAEqmC,GAAG,IAAI,CAAC,OAAOl9C,EAAEonB,QAAQ,SAAS7K,EAAE,CAA9K,CAAgLgC,EAAE4+B,KAAKn9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,cAAc1F,EAAEitB,MAAM,IAAI,CAAC,OAAO9jC,EAAEonB,QAAQ,UAAU7K,EAAE,CAAnL,CAAqLgC,EAAE6+B,MAAMp9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,WAAW1F,EAAEwmC,WAAW,KAAKxmC,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,OAAO7K,EAAE,CAA9L,CAAgMgC,EAAE++B,GAAGt9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA9K,CAAgLgC,EAAEg/B,IAAIv9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY,IAAIwR,EAAElX,EAAE2tB,IAAI,iBAAiBzW,EAAExR,GAAG,IAAIwR,EAAE,IAAIA,aAAaplB,QAAQ4T,GAAGwR,EAAEte,KAAI,SAAU8O,GAAG,MAAM,IAAIA,EAAE,GAAI,IAAGqF,KAAK,MAAMrH,GAAG,IAAI,CAAC,OAAOvc,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA/R,CAAiSgC,EAAEimB,IAAIxkC,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAE2hC,SAAS,KAAKj8B,GAAG1F,EAAE2mC,OAAO,KAAKjhC,GAAG1F,EAAE4mC,KAAK,KAAKlhC,GAAG1F,EAAE6mC,OAAO,IAAI,CAAC,OAAO19C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAAnO,CAAqOgC,EAAEo/B,IAAI39C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAEpU,KAAK,IAAI,CAAC,OAAOzC,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA9K,CAAgLgC,EAAEq/B,IAAI59C,IAAIA,EAAE,SAASue,EAAExN,GAAGA,GAAGA,EAAEA,EAAEqW,QAAQ,SAAS7I,EAAEq+B,WAAWr+B,EAAEw+B,KAAKx+B,EAAEw+B,IAAI1kC,MAAM,KAAK+O,QAAQ,cAAa,IAAKpd,MAAM08B,eAAe,IAAI1mC,EAAE8C,KAAK+6C,MAAM7zC,KAAKC,MAAM,KAAK,OAAO8G,EAAEqW,QAAQ,SAAS,GAAGpnB,EAAE,CAA1L,CAA4Lue,EAAEve,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAE2hC,SAAS,KAAKj8B,GAAG1F,EAAE2mC,OAAO,KAAKjhC,GAAG,IAAI1F,EAAE6mC,OAAO,KAAK,CAAC,OAAO19C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAAzN,CAA2NgC,EAAEu/B,IAAI99C,KAAKonB,QAAQ,YAAY,OAAO,CAAC,SAAS7K,EAAEgC,GAAG,OAAO,SAASA,GAAG,IAAI,IAAIve,EAAEuc,EAAE,CAAC,EAAE4V,EAAEphB,EAAEwN,EAAEqN,MAAM,SAAS5rB,EAAEmyB,KAAKlH,MAAM,CAAC,IAAInnB,EAAE9D,EAAE0B,MAAM,GAAGoC,GAAGA,EAAE8gC,OAAO,CAAC,IAAIpzB,EAAE1N,EAAEqjB,cAAc,YAAYsS,KAAKjoB,IAAI+K,EAAEioB,IAAIjoB,EAAEioB,KAAK,GAAGjoB,EAAEioB,IAAIxyB,KAAK8H,EAAEhW,KAAK,IAAI0N,EAAEsS,QAAQ,WAAWvH,EAAEqgC,QAAQ94C,EAAE8nB,MAAM,QAAQ,GAAG,IAAIpa,EAAEsS,QAAQ,QAAQvH,EAAEsgC,KAAKpzC,SAAS3F,EAAE8nB,MAAM,QAAQ,GAAG,IAAI,YAAY6N,KAAKjoB,GAAG+K,EAAEwgC,IAAIj3C,EAAEhC,GAAG,WAAW21B,KAAKjoB,IAAI+K,EAAE0gC,GAAG1gC,EAAE0gC,IAAI,GAAG1gC,EAAE0gC,GAAGjrC,KAAK1O,EAAEQ,KAAK,UAAU21B,KAAKjoB,IAAI+K,EAAEzW,EAAEyW,EAAEzW,GAAG,GAAGyW,EAAEzW,EAAEkM,KAAK6E,EAAE/S,EAAEyY,EAAEzW,KAAK,aAAa2zB,KAAKjoB,IAAI+K,EAAE4gC,KAAK5gC,EAAE4gC,MAAM,GAAG5gC,EAAE4gC,KAAKnrC,KAAK+b,EAAEjqB,KAAK,cAAc21B,KAAKjoB,IAAI+K,EAAE6gC,MAAM7gC,EAAE6gC,OAAO,GAAG7gC,EAAE6gC,MAAMprC,KAAKjO,EAAED,KAAK,WAAW21B,KAAKjoB,IAAI+K,EAAE+gC,GAAG/gC,EAAE+gC,IAAI,GAAG/gC,EAAE+gC,GAAGtrC,KAAKrD,EAAE7K,KAAK,YAAY21B,KAAKjoB,IAAI+K,EAAEghC,IAAIhhC,EAAEghC,KAAK,GAAGhhC,EAAEghC,IAAIvrC,KAAKjM,EAAEjC,EAAEyY,EAAEghC,IAAIhhC,EAAEqgC,WAAW,YAAYnjB,KAAKjoB,IAAI+K,EAAEohC,IAAIphC,EAAEohC,KAAK,GAAGphC,EAAEohC,IAAI3rC,KAAKO,EAAEzO,KAAK,YAAY21B,KAAKjoB,IAAI+K,EAAEqhC,IAAIrhC,EAAEqhC,KAAK,GAAGrhC,EAAEqhC,IAAI5rC,KAAKgI,EAAElW,KAAK,YAAY21B,KAAKjoB,KAAK+K,EAAEuhC,IAAIvhC,EAAEuhC,KAAK,GAAGvhC,EAAEuhC,IAAI9rC,KAAKnJ,EAAE/E,IAAI,CAAC,CAAC,OAAOyY,CAAC,CAAp0B,CAAs0BgC,EAAE,SAASA,GAAG,IAAI,IAAIxN,EAAE,GAAG/Q,EAAE,kBAAkBuc,EAAEvc,EAAE8zB,KAAKvV,GAAG,OAAOhC,GAAG,CAAC,IAAIzW,EAAEyW,EAAE,GAAG6K,QAAQ,QAAQ,KAAKrW,EAAEiB,KAAK,CAACiT,MAAM1I,EAAEwhC,YAAYj4C,IAAIyW,EAAEvc,EAAE8zB,KAAKvV,EAAE,CAAC,IAAI,IAAIjb,EAAEib,EAAEqN,MAAM,IAAI/U,EAAE,EAAEkX,EAAEhd,EAAE8F,EAAEkX,EAAErtB,OAAOmW,IAAI,CAAC,IAAI9S,EAAEgqB,EAAElX,GAAGlI,EAAE5K,EAAEkhB,MAAM3hB,EAAEoxB,OAAO/lB,EAAEuX,MAAMvX,EAAE,GAAGjO,OAAOqD,EAAEg6C,YAAY,CAAC,OAAOz6C,EAAEsgB,KAAK,IAAIwD,QAAQ,WAAW,IAAI,CAAxS,CAA0S7I,EAAE,SAASA,GAAG,OAAOA,EAAE6I,QAAQ,iBAAgB,SAAU7I,EAAExN,GAAG,OAAOA,GAAG,EAAG,GAAE,CAA3E,CAA6EwN,IAAI,CAAC,SAASzY,EAAEyY,GAAG,IAAIxN,EAAE,CAAC,EAAE/Q,EAAEue,EAAEqmB,OAAOhZ,MAAM,QAAQrP,EAAEvc,EAAEU,OAAO,OAAOqQ,EAAEsH,KAAKrY,EAAE,GAAG+Q,EAAEitC,QAAQv0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEktC,OAAOx0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEooC,MAAM1vC,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEmtC,QAAQz0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEotC,OAAO10C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEqtC,MAAMp+C,EAAEuc,EAAE,GAAGxL,EAAEstC,MAAMr+C,EAAEuc,EAAE,GAAG7S,MAAM1J,EAAE,MAAM+Q,EAAE+rC,IAAIrzC,SAASzJ,EAAE,GAAG,KAAK+Q,CAAC,CAAC,SAASzN,EAAEib,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGisC,KAAKjsC,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS6W,EAAE0H,EAAExN,GAAG,IAAI/Q,EAAEue,EAAEqmB,OAAOhZ,MAAM,QAAQrP,EAAEgC,EAAEqmB,OAAOzd,cAAcyE,MAAM,QAAQ9lB,EAAE,CAACuS,KAAKrY,EAAE,GAAGk9C,GAAGl9C,EAAEA,EAAEU,OAAO,IAAI,OAAO,IAAI6b,EAAE+hC,YAAY,OAAOx4C,EAAEuS,KAAKtH,EAAErQ,OAAOqQ,EAAEA,EAAErQ,OAAO,GAAG2X,KAAK,KAAK3O,MAAM1J,EAAE,MAAM8F,EAAEg3C,IAAIrzC,SAASzJ,EAAE,GAAG,KAAK8F,CAAC,CAAC,SAASioB,EAAExP,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGmsC,GAAGnsC,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS+D,EAAEwa,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAG+yB,MAAM/yB,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS2O,EAAE4P,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAGssC,WAAW5zC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIg9C,KAAKjsC,EAAE/Q,EAAE,IAAI,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,CAAC,SAASzC,EAAEyE,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAO3f,MAAM,6BAA6B,IAAIlU,EAAE,MAAM,IAAI5Q,MAAM,kCAAkC,IAAIH,EAAEuc,EAAExL,EAAErQ,OAAOoF,EAAEiL,EAAE+S,QAAQ,OAAO,SAASxgB,EAAEib,GAAG,OAAOA,EAAEuF,QAAQ,MAAM,IAAIvF,EAAEA,EAAEqN,MAAM,KAAK,IAAIrN,CAAC,CAACve,EAAEuc,EAAEzW,EAAE,EAAE,EAAE,GAAG41B,OAAO3qB,EAAExM,MAAMuB,EAAE,GAAG2J,IAAInM,IAAIA,EAAEyN,EAAEwL,EAAE,IAAI,IAAI1F,EAAE,CAACwB,KAAKtH,EAAE,GAAGyzB,IAAIxkC,GAAG,OAAO0J,MAAMqH,EAAE,MAAM8F,EAAEimC,IAAIrzC,SAASsH,EAAE,GAAG,KAAK8F,CAAC,CAAC,SAAS9Q,EAAEwY,EAAExN,EAAE/Q,GAAG,IAAIuc,EAAEgC,EAAEqmB,OAAOhZ,MAAM,QAAQ,IAAIrN,EAAEqmB,OAAOzd,cAAcyE,MAAM,QAAQ0yB,YAAY,QAAQvtC,EAAEA,EAAErQ,OAAO,IAAI6b,EAAEqL,QAAQ7W,EAAEA,EAAErQ,OAAO,GAAG2X,MAAM,IAAIvS,EAAE,CAACuS,KAAKkE,EAAE,GAAGgiC,SAAShiC,EAAE,GAAG,IAAIvc,EAAEg9C,KAAKzgC,EAAEA,EAAE7b,OAAO,IAAI,OAAOgJ,MAAM6S,EAAE,MAAMzW,EAAEg3C,IAAIrzC,SAAS8S,EAAE,GAAG,KAAKzW,CAAC,CAAC,SAASyM,EAAEgM,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAG2sC,OAAO3sC,EAAE/Q,EAAE,GAAGw4C,SAAS/uC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIw9C,OAAO/zC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIy9C,KAAKh0C,SAASsH,EAAE/Q,EAAE,GAAG,KAAK,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,CAAC,SAASvC,EAAEuE,GAAG,IAAI,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGtO,KAAK,IAAI8Z,EAAExL,EAAErQ,OAAO6b,KAAK,GAAGvc,EAAEyC,KAAKsO,EAAEwL,GAAG,IAAIvc,EAAEyC,KAAKmiC,OAAO,OAAOl7B,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS6I,EAAE0V,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAG2sC,OAAO3sC,EAAE/Q,EAAE,GAAGonB,QAAQ,KAAK,IAAIoxB,SAAS/uC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIw9C,OAAO/zC,SAASsH,EAAE/Q,EAAE,GAAG,KAAK,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,EAAkB,WAA2H,IAAIxL,EAApH,SAAWwN,GAAG3e,KAAK4+C,aAAa,iBAAiBjgC,EAAEsN,KAAKC,MAAMD,KAAKkD,UAAUxQ,IAAI,iBAAiBA,EAAEhC,EAAEgC,QAAG,CAAM,EAAS5T,UAAiBoG,EAAE0tC,OAAO,WAAW,OAAO7+C,KAAK4+C,YAAY,EAAEztC,EAAEjI,SAAS,WAAW,OAAO9I,EAAEJ,KAAK6+C,SAAS,CAAG,EAAlP,GAAsPj/C,EAAQk/C,aAAa1+C,EAAER,EAAQm/C,cAAcpiC,qCCC7iPqiC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBj6C,IAAjBk6C,EACH,OAAOA,EAAav/C,QAGrB,IAAIC,EAASm/C,EAAyBE,GAAY,CACjDE,GAAIF,EACJG,QAAQ,EACRz/C,QAAS,CAAC,GAUX,OANA0/C,EAAoBJ,GAAUl0C,KAAKnL,EAAOD,QAASC,EAAQA,EAAOD,QAASq/C,GAG3Ep/C,EAAOw/C,QAAS,EAGTx/C,EAAOD,OACf,ChCzBIM,EAAW0B,OAAOgE,eAAkBkF,GAASlJ,OAAOgE,eAAekF,GAASA,GAASA,EAAa,UAQtGm0C,EAAoBtgC,EAAI,SAAS7c,EAAOy9C,GAEvC,GADU,EAAPA,IAAUz9C,EAAQ9B,KAAK8B,IAChB,EAAPy9C,EAAU,OAAOz9C,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPy9C,GAAaz9C,EAAM4sB,WAAY,OAAO5sB,EAC1C,GAAW,GAAPy9C,GAAoC,mBAAfz9C,EAAMwpB,KAAqB,OAAOxpB,CAC5D,CACA,IAAIu7C,EAAKz7C,OAAOX,OAAO,MACvBg+C,EAAoB9tC,EAAEksC,GACtB,IAAIhZ,EAAM,CAAC,EACXpkC,EAAiBA,GAAkB,CAAC,KAAMC,EAAS,CAAC,GAAIA,EAAS,IAAKA,EAASA,IAC/E,IAAI,IAAIs/C,EAAiB,EAAPD,GAAYz9C,EAAyB,iBAAX09C,KAAyBv/C,EAAeikB,QAAQs7B,GAAUA,EAAUt/C,EAASs/C,GACxH59C,OAAO69C,oBAAoBD,GAASp/B,SAAS7a,GAAS8+B,EAAI9+B,GAAO,IAAOzD,EAAMyD,KAI/E,OAFA8+B,EAAa,QAAI,IAAM,EACvB4a,EAAoBrtC,EAAEyrC,EAAIhZ,GACnBgZ,CACR,EiCxBA4B,EAAoBrtC,EAAI,CAAChS,EAAS8/C,KACjC,IAAI,IAAIn6C,KAAOm6C,EACXT,EAAoB9wB,EAAEuxB,EAAYn6C,KAAS05C,EAAoB9wB,EAAEvuB,EAAS2F,IAC5E3D,OAAOC,eAAejC,EAAS2F,EAAK,CAAEsjB,YAAY,EAAMrkB,IAAKk7C,EAAWn6C,IAE1E,ECND05C,EAAoB1sB,EAAI,WACvB,GAA0B,iBAAfotB,WAAyB,OAAOA,WAC3C,IACC,OAAO3/C,MAAQ,IAAIyyB,SAAS,cAAb,EAChB,CAAE,MAAO9V,GACR,GAAsB,iBAAXxK,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxB8sC,EAAoB9wB,EAAI,CAACrjB,EAAKq8B,IAAUvlC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKF,EAAKq8B,GCClF8X,EAAoB9tC,EAAKvR,IACH,oBAAX80B,QAA0BA,OAAOoU,aAC1ClnC,OAAOC,eAAejC,EAAS80B,OAAOoU,YAAa,CAAEhnC,MAAO,WAE7DF,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,GAAO,ECL9Dm9C,EAAoBW,IAAO//C,IAC1BA,EAAOggD,MAAQ,GACVhgD,EAAOigD,WAAUjgD,EAAOigD,SAAW,IACjCjgD,6aCmDD,SAASkgD,IACZ,IAAInuC,GAAI,IAAIxH,MAAOs3B,UAInB,MAH2B,oBAAhBse,aAA0D,mBAApBA,YAAY31C,MACzDuH,GAAKouC,YAAY31C,OAEd,uCAAuCmd,QAAQ,SAASrhB,IAC3D,MAAMgL,GAAKS,EAAoB,GAAhB1O,KAAKqjC,UAAiB,GAAK,EAE1C,OADA30B,EAAI1O,KAAKwF,MAAMkJ,EAAI,KACL,MAANzL,EAAYgL,EAAS,EAAJA,EAAW,GAAKjI,SAAS,GAAG,GAE7D,CAoLA,MAAMJ,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACqsC,EAAGzpC,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OCpPxE,SAAShJ,EAAOC,GACnB,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAM,IAAIG,MAAM,2BAA2BH,IACnD,CAKO,SAASM,EAAMD,KAAME,GACxB,KAAMF,aAAaG,YACf,MAAM,IAAIC,UAAU,uBACxB,GAAIF,EAAQG,OAAS,IAAMH,EAAQI,SAASN,EAAEK,QAC1C,MAAM,IAAID,UAAU,iCAAiCF,oBAA0BF,EAAEK,SACzF,CAoBA,MAQA,EARe,CACXX,SACAK,KA/BG,SAAcC,GACjB,GAAiB,kBAANA,EACP,MAAM,IAAIF,MAAM,yBAAyBE,IACjD,EA6BIC,QACAM,KAvBG,SAAcA,GACjB,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAM,IAAIV,MAAM,mDACpBJ,EAAOa,EAAKE,WACZf,EAAOa,EAAKG,SAChB,EAmBIC,OAlBG,SAAgBC,EAAUC,GAAgB,GAC7C,GAAID,EAASE,UACT,MAAM,IAAIhB,MAAM,oCACpB,GAAIe,GAAiBD,EAASG,SAC1B,MAAM,IAAIjB,MAAM,wCACxB,EAcIkB,OAbG,SAAgBC,EAAKL,GACxBX,EAAMgB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAM,IAAIpB,MAAM,yDAAyDoB,IAEjF,GCxBagB,GCNY,iBAATwC,MAAqB,WAAYA,MAAOA,KAAKJ,ODMlCyD,GAAQ,IAAIG,SAASH,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,aAEnEnB,EAAO,CAACsB,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAIxE,GAHgF,KAA5D,IAAIjI,WAAW,IAAIyF,YAAY,CAAC,YAAa5D,QAAQ,GAIrE,MAAM,IAAIlC,MAAM,+CAyDb,SAASyC,EAAQH,GAGpB,GAFoB,iBAATA,IACPA,EARD,SAAqBuG,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvI,UAAU,2CAA2CuI,GAEnE,OAAO,IAAIC,aAAcC,OAAOF,EACpC,CAGe,CAAYvG,MACjBA,aAAgBjC,YAClB,MAAM,IAAIC,UAAU,iDAAiDgC,MACzE,OAAOA,CACX,CA9DckG,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAkFxE,MAAMhH,EAET,KAAAwI,GACI,OAAO3K,KAAK6E,YAChB,EAUG,SAAS8C,EAAgBuD,GAC5B,MAAMC,EAAStF,GAAYqF,IAAkBtI,OAAOI,EAAQ6C,IAAUpB,SAChE2G,EAAMF,IAIZ,OAHAC,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAS,IAAMiK,IACdC,CACX,CEpHA,MAAM9F,UAAalD,EACf,WAAAC,CAAYpB,EAAMsE,GACd/C,QACAvC,KAAKwB,UAAW,EAChBxB,KAAKuB,WAAY,EACjB,OAAYP,GACZ,MAAMuE,EAAMvC,EAAQsC,GAEpB,GADAtF,KAAKwF,MAAQxE,EAAKC,SACe,mBAAtBjB,KAAKwF,MAAM5C,OAClB,MAAM,IAAI/B,UAAU,uDACxBb,KAAKmB,SAAWnB,KAAKwF,MAAMrE,SAC3BnB,KAAKkB,UAAYlB,KAAKwF,MAAMtE,UAC5B,MAAMC,EAAWnB,KAAKmB,SAChBsE,EAAM,IAAI7E,WAAWO,GAE3BsE,EAAItC,IAAIoC,EAAIzE,OAASK,EAAWH,EAAKC,SAAS2B,OAAO2C,GAAKd,SAAWc,GACrE,IAAK,IAAI7B,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,GACd1D,KAAKwF,MAAM5C,OAAO6C,GAElBzF,KAAK0F,MAAQ1E,EAAKC,SAElB,IAAK,IAAIyC,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,IACd1D,KAAK0F,MAAM9C,OAAO6C,GAClBA,EAAIhC,KAAK,EACb,CACA,MAAAb,CAAO+C,GAGH,OAFA,SAAc3F,MACdA,KAAKwF,MAAM5C,OAAO+C,GACX3F,IACX,CACA,UAAAwD,CAAW9B,GACP,SAAc1B,MACd,QAAa0B,EAAK1B,KAAKkB,WACvBlB,KAAKwB,UAAW,EAChBxB,KAAKwF,MAAMhC,WAAW9B,GACtB1B,KAAK0F,MAAM9C,OAAOlB,GAClB1B,KAAK0F,MAAMlC,WAAW9B,GACtB1B,KAAK4E,SACT,CACA,MAAAH,GACI,MAAM/C,EAAM,IAAId,WAAWZ,KAAK0F,MAAMxE,WAEtC,OADAlB,KAAKwD,WAAW9B,GACTA,CACX,CACA,UAAAmD,CAAWC,GAEPA,IAAOA,EAAKlD,OAAOX,OAAOW,OAAOgE,eAAe5F,MAAO,CAAC,IACxD,MAAM,MAAE0F,EAAK,MAAEF,EAAK,SAAEhE,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAclB,KAQnE,OANA8E,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACfuD,EAAG3D,SAAWA,EACd2D,EAAG5D,UAAYA,EACf4D,EAAGY,MAAQA,EAAMb,WAAWC,EAAGY,OAC/BZ,EAAGU,MAAQA,EAAMX,WAAWC,EAAGU,OACxBV,CACX,CACA,OAAAF,GACI5E,KAAKuB,WAAY,EACjBvB,KAAK0F,MAAMd,UACX5E,KAAKwF,MAAMZ,SACf,EAQG,MAAMQ,EAAO,CAACpE,EAAMuE,EAAKM,IAAY,IAAIR,EAAKrE,EAAMuE,GAAK3C,OAAOiD,GAASpB,SAChFW,EAAKnE,OAAS,CAACD,EAAMuE,IAAQ,IAAIF,EAAKrE,EAAMuE,GC3DrC,MAAMvD,UAAaG,EACtB,WAAAC,CAAYjB,EAAUD,EAAWmB,EAAWC,GACxCC,QACAvC,KAAKmB,SAAWA,EAChBnB,KAAKkB,UAAYA,EACjBlB,KAAKqC,UAAYA,EACjBrC,KAAKsC,KAAOA,EACZtC,KAAKwB,UAAW,EAChBxB,KAAKc,OAAS,EACdd,KAAKwC,IAAM,EACXxC,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAS,IAAI7B,WAAWO,GAC7BnB,KAAK0C,KAAOC,EAAW3C,KAAKyC,OAChC,CACA,MAAAG,CAAOC,GACH,SAAc7C,MACd,MAAM,KAAE0C,EAAI,OAAED,EAAM,SAAEtB,GAAanB,KAE7B+C,GADNF,EAAOG,EAAQH,IACE/B,OACjB,IAAK,IAAI0B,EAAM,EAAGA,EAAMO,GAAM,CAC1B,MAAME,EAAOC,KAAKvB,IAAIR,EAAWnB,KAAKwC,IAAKO,EAAMP,GAEjD,GAAIS,IAAS9B,EAMbsB,EAAOU,IAAIN,EAAKO,SAASZ,EAAKA,EAAMS,GAAOjD,KAAKwC,KAChDxC,KAAKwC,KAAOS,EACZT,GAAOS,EACHjD,KAAKwC,MAAQrB,IACbnB,KAAKqD,QAAQX,EAAM,GACnB1C,KAAKwC,IAAM,OAXf,CACI,MAAMc,EAAWX,EAAWE,GAC5B,KAAO1B,GAAY4B,EAAMP,EAAKA,GAAOrB,EACjCnB,KAAKqD,QAAQC,EAAUd,EAE/B,CAQJ,CAGA,OAFAxC,KAAKc,QAAU+B,EAAK/B,OACpBd,KAAKuD,aACEvD,IACX,CACA,UAAAwD,CAAW9B,GACP,SAAc1B,MACd,SAAc0B,EAAK1B,MACnBA,KAAKwB,UAAW,EAIhB,MAAM,OAAEiB,EAAM,KAAEC,EAAI,SAAEvB,EAAQ,KAAEmB,GAAStC,KACzC,IAAI,IAAEwC,GAAQxC,KAEdyC,EAAOD,KAAS,IAChBxC,KAAKyC,OAAOW,SAASZ,GAAKiB,KAAK,GAE3BzD,KAAKqC,UAAYlB,EAAWqB,IAC5BxC,KAAKqD,QAAQX,EAAM,GACnBF,EAAM,GAGV,IAAK,IAAIkB,EAAIlB,EAAKkB,EAAIvC,EAAUuC,IAC5BjB,EAAOiB,GAAK,GAxExB,SAAsBhB,EAAMiB,EAAY7B,EAAOQ,GAC3C,GAAiC,mBAAtBI,EAAKkB,aACZ,OAAOlB,EAAKkB,aAAaD,EAAY7B,EAAOQ,GAChD,MAAMuB,EAAOC,OAAO,IACdC,EAAWD,OAAO,YAClBE,EAAK3D,OAAQyB,GAAS+B,EAAQE,GAC9BE,EAAK5D,OAAOyB,EAAQiC,GACpBG,EAAI5B,EAAO,EAAI,EACf6B,EAAI7B,EAAO,EAAI,EACrBI,EAAK0B,UAAUT,EAAaO,EAAGF,EAAI1B,GACnCI,EAAK0B,UAAUT,EAAaQ,EAAGF,EAAI3B,EACvC,CAiEQsB,CAAalB,EAAMvB,EAAW,EAAG2C,OAAqB,EAAd9D,KAAKc,QAAawB,GAC1DtC,KAAKqD,QAAQX,EAAM,GACnB,MAAM2B,EAAQ1B,EAAWjB,GACnBqB,EAAM/C,KAAKkB,UAEjB,GAAI6B,EAAM,EACN,MAAM,IAAIxC,MAAM,+CACpB,MAAM+D,EAASvB,EAAM,EACfwB,EAAQvE,KAAKwE,MACnB,GAAIF,EAASC,EAAMzD,OACf,MAAM,IAAIP,MAAM,sCACpB,IAAK,IAAImD,EAAI,EAAGA,EAAIY,EAAQZ,IACxBW,EAAMD,UAAU,EAAIV,EAAGa,EAAMb,GAAIpB,EACzC,CACA,MAAAmC,GACI,MAAM,OAAEhC,EAAM,UAAEvB,GAAclB,KAC9BA,KAAKwD,WAAWf,GAChB,MAAMiC,EAAMjC,EAAOkC,MAAM,EAAGzD,GAE5B,OADAlB,KAAK4E,UACEF,CACX,CACA,UAAAG,CAAWC,GACPA,IAAOA,EAAK,IAAI9E,KAAKoC,aACrB0C,EAAG3B,OAAOnD,KAAKwE,OACf,MAAM,SAAErD,EAAQ,OAAEsB,EAAM,OAAE3B,EAAM,SAAEU,EAAQ,UAAED,EAAS,IAAEiB,GAAQxC,KAO/D,OANA8E,EAAGhE,OAASA,EACZgE,EAAGtC,IAAMA,EACTsC,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACXT,EAASK,GACT2D,EAAGrC,OAAOU,IAAIV,GACXqC,CACX,EC5GJ,MAEMmB,EAAM,CAACC,EAAGzF,EAAG0F,IAAOD,EAAIzF,EAAMyF,EAAIC,EAAM1F,EAAI0F,EAI5CC,EAAW,IAAIC,YAAY,CAC7B,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlFC,EAAK,IAAID,YAAY,CACvB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlFE,EAAW,IAAIF,YAAY,IACjC,MAAMG,UAAexE,EACjB,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GAGjBvC,KAAKyG,EAAY,EAARH,EAAG,GACZtG,KAAK0G,EAAY,EAARJ,EAAG,GACZtG,KAAK2G,EAAY,EAARL,EAAG,GACZtG,KAAK4G,EAAY,EAARN,EAAG,GACZtG,KAAK6G,EAAY,EAARP,EAAG,GACZtG,KAAK8G,EAAY,EAARR,EAAG,GACZtG,KAAK+G,EAAY,EAART,EAAG,GACZtG,KAAKgH,EAAY,EAARV,EAAG,EAChB,CACA,GAAA9B,GACI,MAAM,EAAEiC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACnC,MAAO,CAACyG,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAA7D,CAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBhH,KAAKyG,EAAQ,EAAJA,EACTzG,KAAK0G,EAAQ,EAAJA,EACT1G,KAAK2G,EAAQ,EAAJA,EACT3G,KAAK4G,EAAQ,EAAJA,EACT5G,KAAK6G,EAAQ,EAAJA,EACT7G,KAAK8G,EAAQ,EAAJA,EACT9G,KAAK+G,EAAQ,EAAJA,EACT/G,KAAKgH,EAAQ,EAAJA,CACb,CACA,OAAA3D,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCV,EAAS7C,GAAKhB,EAAKwE,UAAUD,GAAQ,GACzC,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyD,EAAMZ,EAAS7C,EAAI,IACnB0D,EAAKb,EAAS7C,EAAI,GAClB2D,EAAKC,EAAKH,EAAK,GAAKG,EAAKH,EAAK,IAAOA,IAAQ,EAC7CI,EAAKD,EAAKF,EAAI,IAAME,EAAKF,EAAI,IAAOA,IAAO,GACjDb,EAAS7C,GAAM6D,EAAKhB,EAAS7C,EAAI,GAAK2D,EAAKd,EAAS7C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE+C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACjC,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM8D,EAAMR,GADGM,EAAKT,EAAG,GAAKS,EAAKT,EAAG,IAAMS,EAAKT,EAAG,OAnEjDX,EAoE4BW,GAAGC,GApEPZ,EAoEUa,GAAKX,EAAS1C,GAAK6C,EAAS7C,GAAM,EAE/D+D,GADSH,EAAKb,EAAG,GAAKa,EAAKb,EAAG,IAAMa,EAAKb,EAAG,KAC7BR,EAAIQ,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIY,EAAM,EACfZ,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKe,EAAKC,EAAM,CACpB,CA/EI,IAACvB,EAiFLO,EAAKA,EAAIzG,KAAKyG,EAAK,EACnBC,EAAKA,EAAI1G,KAAK0G,EAAK,EACnBC,EAAKA,EAAI3G,KAAK2G,EAAK,EACnBC,EAAKA,EAAI5G,KAAK4G,EAAK,EACnBC,EAAKA,EAAI7G,KAAK6G,EAAK,EACnBC,EAAKA,EAAI9G,KAAK8G,EAAK,EACnBC,EAAKA,EAAI/G,KAAK+G,EAAK,EACnBC,EAAKA,EAAIhH,KAAKgH,EAAK,EACnBhH,KAAKmD,IAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzD,GACIgD,EAAS9C,KAAK,EAClB,CACA,OAAAmB,GACI5E,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BnD,KAAKyC,OAAOgB,KAAK,EACrB,EAGJ,MAAMiE,UAAelB,EACjB,WAAApE,GACIG,QACAvC,KAAKyG,GAAI,WACTzG,KAAK0G,EAAI,UACT1G,KAAK2G,EAAI,UACT3G,KAAK4G,GAAI,UACT5G,KAAK6G,GAAI,QACT7G,KAAK8G,EAAI,WACT9G,KAAK+G,EAAI,WACT/G,KAAKgH,GAAI,WACThH,KAAKkB,UAAY,EACrB,EAMG,MAAM,EAASyG,GAAgB,IAAM,IAAInB,IAC1BmB,GAAgB,IAAM,IAAID,4BCxHhD,MAAM2E,EAAMvI,OAAO,GACbwI,EAAMxI,OAAO,GACbyI,EAAMzI,OAAO,GACb0I,EAAM1I,OAAO,GACb2I,EAAM3I,OAAO,GACbqI,EAAQvK,OAAO8K,OAAO,CACxBxG,EAAGmG,EACH5L,EAAGqD,OAAO,GACV6I,EAAG7I,OAAO,sEACV1D,EAAG0D,OAAO,sEACVI,EAAGoI,EACHM,GAAI9I,OAAO,iFACX+I,GAAI/I,OAAO,iFACXgJ,KAAMhJ,OAAO,wEAEXiJ,EAAa,CAAC7G,EAAGzF,KAAOyF,EAAIzF,EAAI8L,GAAO9L,EACvCuM,EAAO,CACTF,KAAMhJ,OAAO,sEACb,WAAAmJ,CAAYC,GACR,MAAM,EAAE9M,GAAM+L,EACRgB,EAAKrJ,OAAO,sCACZsJ,GAAMd,EAAMxI,OAAO,sCACnBuJ,EAAKvJ,OAAO,uCACZwJ,EAAKH,EACLI,EAAYzJ,OAAO,uCACnB0J,EAAKT,EAAWO,EAAKJ,EAAG9M,GACxBqN,EAAKV,GAAYK,EAAKF,EAAG9M,GAC/B,IAAIsN,EAAKC,GAAIT,EAAIM,EAAKL,EAAKM,EAAKJ,EAAIjN,GAChCwN,EAAKD,IAAKH,EAAKJ,EAAKK,EAAKH,EAAIlN,GACjC,MAAMyN,EAAQH,EAAKH,EACbO,EAAQF,EAAKL,EAKnB,GAJIM,IACAH,EAAKtN,EAAIsN,GACTI,IACAF,EAAKxN,EAAIwN,GACTF,EAAKH,GAAaK,EAAKL,EACvB,MAAM,IAAIhN,MAAM,2CAA6C2M,GAEjE,MAAO,CAAEW,QAAOH,KAAII,QAAOF,KAC/B,GAEEG,EAAW,GACXC,EAAW,GAKjB,SAASG,EAAYC,GACjB,MAAM,EAAElI,EAAC,EAAEzF,GAAM0L,EACXkC,EAAKV,GAAIS,EAAIA,GACbE,EAAKX,GAAIU,EAAKD,GACpB,OAAOT,GAAIW,EAAKpI,EAAIkI,EAAI3N,EAC5B,CACA,MAAM8N,EAAmBpC,EAAMjG,IAAMmG,EACrC,MAAMmC,UAAiBjO,MACnB,WAAA6B,CAAYyD,GACRtD,MAAMsD,EACV,EAEJ,SAAS4I,EAAeC,GACpB,KAAMA,aAAiBC,GACnB,MAAM,IAAI9N,UAAU,yBAC5B,CACA,MAAM8N,EACF,WAAAvM,CAAYgM,EAAGQ,EAAGC,GACd7O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,EACT5O,KAAK6O,EAAIA,CACb,CACA,iBAAOC,CAAWC,GACd,KAAMA,aAAa,GACf,MAAM,IAAIlO,UAAU,4CAExB,OAAIkO,EAAEC,OAAO,EAAMC,MACRN,EAAcM,KAClB,IAAIN,EAAcI,EAAEX,EAAGW,EAAEH,EAAGtC,EACvC,CACA,oBAAO4C,CAAcC,GACjB,MAAMC,EAkkBd,SAAqBC,EAAMN,EAAI5C,EAAMQ,GACjC,MAAM2C,EAAU,IAAIvG,MAAMsG,EAAKvO,QAOzByO,EAAWC,GANMH,EAAK5E,QAAO,CAACgF,EAAKC,EAAKhM,IACtCgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAK+L,EACN9B,GAAI8B,EAAMC,EAAKX,KACvBzC,GACqCyC,GAOxC,OANAM,EAAKM,aAAY,CAACF,EAAKC,EAAKhM,IACpBgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAKiK,GAAI8B,EAAMH,EAAQ5L,GAAIqL,GAC5BpB,GAAI8B,EAAMC,EAAKX,KACvBQ,GACID,CACX,CAllBsBM,CAAYT,EAAOU,KAAKd,GAAMA,EAAEF,KAC9C,OAAOM,EAAOU,KAAI,CAACd,EAAGrL,IAAMqL,EAAEe,SAASV,EAAM1L,KACjD,CACA,iBAAOqM,CAAWZ,GACd,OAAOR,EAAcO,cAAcC,GAAQU,IAAIlB,EAAcG,WACjE,CACA,MAAAE,CAAON,GACHD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAC1B4B,EAAO3C,GAAIuC,EAAKA,GAChBK,EAAO5C,GAAI0C,EAAKA,GAChBG,EAAK7C,GAAIqC,EAAKO,GACdE,EAAK9C,GAAIwC,EAAKG,GACdI,EAAK/C,GAAIA,GAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,GAAIA,GAAIyC,EAAKF,GAAMI,GAC9B,OAAOE,IAAOC,GAAMC,IAAOC,CAC/B,CACA,MAAAC,GACI,OAAO,IAAIjC,EAAc3O,KAAKoO,EAAGT,IAAK3N,KAAK4O,GAAI5O,KAAK6O,EACxD,CACA,MAAAgC,GACI,MAAQzC,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,KAC1ByG,EAAIkH,GAAIqC,EAAKA,GACbtJ,EAAIiH,GAAIsC,EAAKA,GACbtJ,EAAIgH,GAAIjH,EAAIA,GACZoK,EAAMd,EAAKtJ,EACXE,EAAI+G,GAAIpB,GAAOoB,GAAImD,EAAMA,GAAOrK,EAAIE,IACpCE,EAAI8G,GAAInB,EAAM/F,GACdK,EAAI6G,GAAI9G,EAAIA,GACZkK,EAAKpD,GAAI7G,EAAIyF,EAAM3F,GACnBoK,EAAKrD,GAAI9G,GAAKD,EAAImK,GAAMtE,EAAM9F,GAC9BsK,EAAKtD,GAAIpB,EAAM0D,EAAKC,GAC1B,OAAO,IAAIvB,EAAcoC,EAAIC,EAAIC,EACrC,CACA,GAAAC,CAAIxC,GACAD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAChC,GAAIyB,IAAO9D,GAAO+D,IAAO/D,EACrB,OAAOrM,KACX,GAAIgQ,IAAO3D,GAAO4D,IAAO5D,EACrB,OAAOqC,EACX,MAAM4B,EAAO3C,GAAIuC,EAAKA,GAChBK,EAAO5C,GAAI0C,EAAKA,GAChBG,EAAK7C,GAAIqC,EAAKO,GACdE,EAAK9C,GAAIwC,EAAKG,GACdI,EAAK/C,GAAIA,GAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,GAAIA,GAAIyC,EAAKF,GAAMI,GACxBtJ,EAAI2G,GAAI8C,EAAKD,GACbW,EAAIxD,GAAIgD,EAAKD,GACnB,GAAI1J,IAAMqF,EACN,OAAI8E,IAAM9E,EACCrM,KAAK6Q,SAGLlC,EAAcM,KAG7B,MAAMmC,EAAKzD,GAAI3G,EAAIA,GACbqK,EAAM1D,GAAI3G,EAAIoK,GACdE,EAAI3D,GAAI6C,EAAKY,GACbL,EAAKpD,GAAIwD,EAAIA,EAAIE,EAAM9E,EAAM+E,GAC7BN,EAAKrD,GAAIwD,GAAKG,EAAIP,GAAML,EAAKW,GAC7BJ,EAAKtD,GAAIuC,EAAKG,EAAKrJ,GACzB,OAAO,IAAI2H,EAAcoC,EAAIC,EAAIC,EACrC,CACA,QAAAM,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,cAAAY,CAAeC,GACX,MAAMC,EAAK/C,EAAcM,KACzB,GAAsB,iBAAXwC,GAAuBA,IAAWpF,EACzC,OAAOqF,EACX,IAAItR,EAAIuR,GAAgBF,GACxB,GAAIrR,IAAMkM,EACN,OAAOtM,KACX,IAAKuO,EAAkB,CACnB,IAAIQ,EAAI2C,EACJE,EAAI5R,KACR,KAAOI,EAAIiM,GACHjM,EAAIkM,IACJyC,EAAIA,EAAEmC,IAAIU,IACdA,EAAIA,EAAEf,SACNzQ,IAAMkM,EAEV,OAAOyC,CACX,CACA,IAAI,MAAElB,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAC5CyR,EAAMH,EACNI,EAAMJ,EACNE,EAAI5R,KACR,KAAO0N,EAAKrB,GAAOuB,EAAKvB,GAChBqB,EAAKpB,IACLuF,EAAMA,EAAIX,IAAIU,IACdhE,EAAKtB,IACLwF,EAAMA,EAAIZ,IAAIU,IAClBA,EAAIA,EAAEf,SACNnD,IAAOpB,EACPsB,IAAOtB,EAOX,OALIuB,IACAgE,EAAMA,EAAIjB,UACV9C,IACAgE,EAAMA,EAAIlB,UACdkB,EAAM,IAAInD,EAAchB,GAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GACpDgD,EAAIX,IAAIY,EACnB,CACA,gBAAAC,CAAiBC,GACb,MAAMC,EAAU1D,EAAmB,IAAMyD,EAAI,EAAI,IAAMA,EAAI,EACrD7C,EAAS,GACf,IAAIJ,EAAI/O,KACJkS,EAAOnD,EACX,IAAK,IAAIoD,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7CD,EAAOnD,EACPI,EAAOiD,KAAKF,GACZ,IAAK,IAAIxO,EAAI,EAAGA,EAAI,IAAMsO,EAAI,GAAItO,IAC9BwO,EAAOA,EAAKhB,IAAInC,GAChBI,EAAOiD,KAAKF,GAEhBnD,EAAImD,EAAKrB,QACb,CACA,OAAO1B,CACX,CACA,IAAAkD,CAAKjS,EAAGkS,IACCA,GAAetS,KAAKgP,OAAOL,EAAc4D,QAC1CD,EAAc,EAAMC,MACxB,MAAMP,EAAKM,GAAeA,EAAYE,cAAiB,EACvD,GAAI,IAAMR,EACN,MAAM,IAAIzR,MAAM,iEAEpB,IAAIkS,EAAcH,GAAeI,EAAiBlO,IAAI8N,GACjDG,IACDA,EAAczS,KAAK+R,iBAAiBC,GAChCM,GAAqB,IAANN,IACfS,EAAc9D,EAAcoB,WAAW0C,GACvCC,EAAiBvP,IAAImP,EAAaG,KAG1C,IAAI1D,EAAIJ,EAAcM,KAClB0D,EAAIhE,EAAc4D,KACtB,MAAMN,EAAU,GAAK1D,EAAmB,IAAMyD,EAAI,IAAMA,GAClDY,EAAa,IAAMZ,EAAI,GACvBa,EAAO/O,OAAO,GAAKkO,EAAI,GACvBc,EAAY,GAAKd,EACjBe,EAAUjP,OAAOkO,GACvB,IAAK,IAAIG,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7C,MAAMlL,EAASkL,EAASS,EACxB,IAAII,EAAQ3S,OAAOD,EAAIyS,GACvBzS,IAAM2S,EACFC,EAAQJ,IACRI,GAASF,EACT1S,GAAKkM,GAET,MAAM2G,EAAUhM,EACViM,EAAUjM,EAAS/D,KAAKiQ,IAAIH,GAAS,EACrCI,EAAQjB,EAAS,GAAM,EACvBkB,EAAQL,EAAQ,EACR,IAAVA,EACAL,EAAIA,EAAEzB,IAAIoC,EAAgBF,EAAOX,EAAYQ,KAG7ClE,EAAIA,EAAEmC,IAAIoC,EAAgBD,EAAOZ,EAAYS,IAErD,CACA,MAAO,CAAEnE,IAAG4D,IAChB,CACA,QAAAY,CAAS9B,EAAQa,GACb,IACIkB,EACAC,EAFArT,EAAIuR,GAAgBF,GAGxB,GAAIlD,EAAkB,CAClB,MAAM,MAAEV,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAClD,IAAM2O,EAAG8C,EAAKc,EAAGe,GAAQ1T,KAAKqS,KAAK3E,EAAI4E,IACjCvD,EAAG+C,EAAKa,EAAGgB,GAAQ3T,KAAKqS,KAAKzE,EAAI0E,GACvCT,EAAMyB,EAAgBzF,EAAOgE,GAC7BC,EAAMwB,EAAgBxF,EAAOgE,GAC7BA,EAAM,IAAInD,EAAchB,GAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GAC3D2E,EAAQ3B,EAAIX,IAAIY,GAChB2B,EAAOC,EAAIxC,IAAIyC,EACnB,KACK,CACD,MAAM,EAAE5E,EAAC,EAAE4D,GAAM3S,KAAKqS,KAAKjS,EAAGkS,GAC9BkB,EAAQzE,EACR0E,EAAOd,CACX,CACA,OAAOhE,EAAcoB,WAAW,CAACyD,EAAOC,IAAO,EACnD,CACA,QAAA3D,CAAS8D,GACL,MAAM,EAAExF,EAAC,EAAEQ,EAAC,EAAEC,GAAM7O,KACd6T,EAAM7T,KAAKgP,OAAOL,EAAcM,MAC1B,MAAR2E,IACAA,EAAOC,EAAMpH,EAAM+C,GAAOX,IAC9B,MAAMiF,EAAMF,EACNG,EAAMpG,GAAImG,EAAMA,GAChBE,EAAMrG,GAAIoG,EAAMD,GAChBG,EAAKtG,GAAIS,EAAI2F,GACbG,EAAKvG,GAAIiB,EAAIoF,GACbG,EAAKxG,GAAIkB,EAAIiF,GACnB,GAAID,EACA,OAAO,EAAM5E,KACjB,GAAIkF,IAAO7H,EACP,MAAM,IAAI/L,MAAM,oBACpB,OAAO,IAAI,EAAM0T,EAAIC,EACzB,EAIJ,SAASZ,EAAgBc,EAAWC,GAChC,MAAMC,EAAMD,EAAKzD,SACjB,OAAOwD,EAAYE,EAAMD,CAC7B,CALA1F,EAAc4D,KAAO,IAAI5D,EAAcxC,EAAMS,GAAIT,EAAMU,GAAIP,GAC3DqC,EAAcM,KAAO,IAAIN,EAActC,EAAKC,EAAKD,GAKjD,MAAMqG,EAAmB,IAAI6B,QACtB,MAAM,EACT,WAAAnS,CAAYgM,EAAGQ,GACX5O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,CACb,CACA,cAAA4F,CAAe5B,GACX5S,KAAKwS,aAAeI,EACpBF,EAAiB+B,OAAOzU,KAC5B,CACA,QAAA0U,GACI,OAAO1U,KAAK4O,EAAIrC,IAAQF,CAC5B,CACA,wBAAOsI,CAAkBjU,GACrB,MAAMkU,EAA2B,KAAjBlU,EAAMI,OAChBsN,EAAIyG,GAAcD,EAAUlU,EAAQA,EAAM0C,SAAS,IACzD,IAAK0R,GAAoB1G,GACrB,MAAM,IAAI7N,MAAM,yBAEpB,IAAIqO,EA6SZ,SAAiBR,GACb,MAAM,EAAEzB,GAAMR,EACR4I,EAAMjR,OAAO,GACbkR,EAAOlR,OAAO,IACdmR,EAAOnR,OAAO,IACdoR,EAAOpR,OAAO,IACdqR,EAAOrR,OAAO,IACdsR,EAAOtR,OAAO,IACdwJ,EAAMc,EAAIA,EAAIA,EAAKzB,EACnB0I,EAAM/H,EAAKA,EAAKc,EAAKzB,EACrB2I,EAAMC,GAAKF,EAAI7I,GAAO6I,EAAM1I,EAC5B6I,EAAMD,GAAKD,EAAI9I,GAAO6I,EAAM1I,EAC5B8I,EAAOF,GAAKC,EAAIjJ,GAAOe,EAAMX,EAC7B+I,EAAOH,GAAKE,EAAKT,GAAQS,EAAO9I,EAChCgJ,EAAOJ,GAAKG,EAAKT,GAAQS,EAAO/I,EAChCiJ,EAAOL,GAAKI,EAAKR,GAAQQ,EAAOhJ,EAChCkJ,EAAQN,GAAKK,EAAKR,GAAQQ,EAAOjJ,EACjCmJ,EAAQP,GAAKM,EAAMV,GAAQQ,EAAOhJ,EAClCoJ,EAAQR,GAAKO,EAAMtJ,GAAO6I,EAAM1I,EAChCqJ,EAAMT,GAAKQ,EAAMb,GAAQQ,EAAO/I,EAChCsJ,EAAMV,GAAKS,EAAIjB,GAAOzH,EAAMX,EAC5BuJ,EAAKX,GAAKU,EAAI1J,GAEpB,GADY2J,EAAKA,EAAMvJ,IACZyB,EACP,MAAM,IAAI7N,MAAM,2BACpB,OAAO2V,CACX,CAvUgBC,CADGhI,EAAYC,IAEvB,MAAMgI,GAAUxH,EAAItC,KAASA,EACzBsI,EACIwB,IACAxH,EAAIjB,IAAKiB,IAG6B,IAAP,EAAXlO,EAAM,MACP0V,IACnBxH,EAAIjB,IAAKiB,IAEjB,MAAM4E,EAAQ,IAAI,EAAMpF,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,0BAAO8C,CAAoB5V,GACvB,MAAM0N,EAAIyG,GAAcnU,EAAM0C,SAAS,EAAG2K,KACpCa,EAAIiG,GAAcnU,EAAM0C,SAAS2K,GAAcA,KAC/CyF,EAAQ,IAAI,EAAMpF,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,cAAO+C,CAAQ/M,GACX,MAAM9I,EAAQ8V,GAAYhN,GACpBzG,EAAMrC,EAAMI,OACZ2V,EAAS/V,EAAM,GACrB,GAAIqC,IAAQgL,EACR,OAAO/N,KAAK2U,kBAAkBjU,GAClC,GArScqN,KAqSVhL,IAAqC,IAAX0T,GAA8B,IAAXA,GAC7C,OAAOzW,KAAK2U,kBAAkBjU,GAElC,GAvSgB,KAuSZqC,GAAsC,IAAX0T,EAC3B,OAAOzW,KAAKsW,oBAAoB5V,GACpC,MAAM,IAAIH,MAAM,wGAAsIwC,IAC1J,CACA,qBAAO2T,CAAeC,GAClB,OAAO,EAAMpE,KAAKgB,SAASqD,GAAoBD,GACnD,CACA,oBAAOE,CAAcC,EAASC,EAAWC,GACrC,MAAM,EAAG,EAAEC,GAsdnB,SAA4BF,GACxB,GAAIA,aAAqB,EAErB,OADAA,EAAUV,iBACHU,EAEX,IACI,OAAO,EAAU4B,QAAQ5B,EAC7B,CACA,MAAOiF,GACH,OAAO,EAAUxD,YAAYzB,EACjC,CACJ,CAjeyBG,CAAmBH,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGhW,SAASiW,GACvB,MAAM,IAAIzW,MAAM,wCACpB,MAAM2D,EAuUd,SAAsBlD,EAAMqZ,GAAe,GACvC,MAAMnW,EANV,SAAoBxD,GAChB,MAAM4Z,EAAuB,EAAf5Z,EAAMI,OAAakN,IAC3B0B,EAAMmF,GAAcnU,GAC1B,OAAO4Z,EAAQ,EAAI5K,GAAO5L,OAAOwW,GAAS5K,CAC9C,CAEc6K,CAAWvZ,GACrB,GAAIqZ,EACA,OAAOnW,EACX,MAAM,EAAE9D,GAAM+L,EACd,OAAOjI,GAAK9D,EAAI8D,EAAI9D,EAAI8D,CAC5B,CA7UkBiT,CAAaX,GAAYM,KAC7B,EAAE1W,GAAM+L,EACRiL,EAAoB,IAAbJ,GAA+B,IAAbA,EAAiB7F,EAAI/Q,EAAI+Q,EAClDkG,EAAO7H,GAAO4H,EAAMhX,GACpBkX,EAAK3J,IAAKzJ,EAAImT,EAAMjX,GACpBmX,EAAK5J,GAAIsJ,EAAII,EAAMjX,GACnBoX,EAAoB,EAAXR,EAAe,KAAO,KAC/BS,EAAI,EAAMlB,QAAQiB,EAASE,EAAYN,IACvCO,EAAI,EAAMpF,KAAKqF,qBAAqBH,EAAGH,EAAIC,GACjD,IAAKI,EACD,MAAM,IAAIpX,MAAM,+CAEpB,OADAoX,EAAEtB,iBACKsB,CACX,CACA,UAAAE,CAAWC,GAAe,GACtB,OAAO,GAAW9X,KAAK+X,MAAMD,GACjC,CACA,KAAAC,CAAMD,GAAe,GACjB,MAAM1J,EAAIsJ,EAAY1X,KAAKoO,GAC3B,OAAI0J,EAEO,GADQ9X,KAAK0U,WAAa,KAAO,OACrBtG,IAGZ,KAAKA,IAAIsJ,EAAY1X,KAAK4O,IAEzC,CACA,MAAAoJ,GACI,OAAOhY,KAAK+X,OAAM,GAAMpT,MAAM,EAClC,CACA,MAAAsT,GACI,OAAOjY,KAAK6X,YAAW,GAAMlT,MAAM,EACvC,CACA,cAAA0R,GACI,MAAM/K,EAAM,kCACN,EAAE8C,EAAC,EAAEQ,GAAM5O,KACjB,IAAK8U,GAAoB1G,KAAO0G,GAAoBlG,GAChD,MAAM,IAAIrO,MAAM+K,GACpB,MAAM4M,EAAOvK,GAAIiB,EAAIA,GAErB,GAAIjB,GAAIuK,EADM/J,EAAYC,MACA/B,EACtB,MAAM,IAAI9L,MAAM+K,EACxB,CACA,MAAA0D,CAAON,GACH,OAAO1O,KAAKoO,IAAMM,EAAMN,GAAKpO,KAAK4O,IAAMF,EAAME,CAClD,CACA,MAAAgC,GACI,OAAO,IAAI,EAAM5Q,KAAKoO,EAAGT,IAAK3N,KAAK4O,GACvC,CACA,MAAAiC,GACI,OAAOlC,EAAcG,WAAW9O,MAAM6Q,SAASf,UACnD,CACA,GAAAoB,CAAIxC,GACA,OAAOC,EAAcG,WAAW9O,MAAMkR,IAAIvC,EAAcG,WAAWJ,IAAQoB,UAC/E,CACA,QAAAyB,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,QAAA2C,CAAS9B,GACL,OAAO9C,EAAcG,WAAW9O,MAAMuT,SAAS9B,EAAQzR,MAAM8P,UACjE,CACA,oBAAA8H,CAAqBD,EAAGzR,EAAGzF,GACvB,MAAMkM,EAAIgC,EAAcG,WAAW9O,MAC7BmY,EAAKjS,IAAMmG,GAAOnG,IAAMoG,GAAOtM,OAAS,EAAMuS,KAAO5F,EAAE6E,eAAetL,GAAKyG,EAAE4G,SAASrN,GACtFkS,EAAKzJ,EAAcG,WAAW6I,GAAGnG,eAAe/Q,GAChD4X,EAAMF,EAAGjH,IAAIkH,GACnB,OAAOC,EAAIrJ,OAAOL,EAAcM,WAAQhK,EAAYoT,EAAIvI,UAC5D,EAIJ,SAASwI,EAASrB,GACd,OAAO5W,OAAOwJ,SAASoN,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASsB,EAAY1V,GACjB,GAAIA,EAAK/B,OAAS,GAAiB,IAAZ+B,EAAK,GACxB,MAAM,IAAItC,MAAM,kCAAkC,EAAWsC,MAEjE,MAAME,EAAMF,EAAK,GACX6B,EAAM7B,EAAKO,SAAS,EAAGL,EAAM,GACnC,IAAKA,GAAO2B,EAAI5D,SAAWiC,EACvB,MAAM,IAAIxC,MAAM,2CAEpB,GAAe,IAAXmE,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAInE,MAAM,8CAEpB,MAAO,CAAEsC,KAAMgS,GAAcnQ,GAAMwT,KAAMrV,EAAKO,SAASL,EAAM,GACjE,CAlBA,EAAMwP,KAAO,IAAI,EAAMpG,EAAMS,GAAIT,EAAMU,IACvC,EAAMoC,KAAO,IAAI,EAAM5C,EAAKA,GAgCrB,MAAM,EACT,WAAAjK,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,kBAAOmC,CAAYhP,GACf,MAAMhB,EAAMgB,aAAe5I,WACrB6X,EAAO,wBACb,GAAmB,iBAARjP,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,GAAG4X,oCAC3B,MAAMrP,EAAMZ,EAAM,EAAWgB,GAAOA,EACpC,GAAmB,MAAfJ,EAAItI,OACJ,MAAM,IAAIP,MAAM,GAAGkY,2BACvB,OAAO,IAAI,EAAUC,EAAYtP,EAAIzE,MAAM,EAAG,KAAM+T,EAAYtP,EAAIzE,MAAM,GAAI,MAClF,CACA,cAAOgU,CAAQnP,GACX,MAAMhB,EAAMgB,aAAe5I,WAC3B,GAAmB,iBAAR4I,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,oDACxB,MAAM,EAAEsQ,EAAC,EAAE8F,GAlCnB,SAA2BpU,GACvB,GAAIA,EAAK/B,OAAS,GAAgB,IAAX+B,EAAK,GACxB,MAAM,IAAItC,MAAM,0BAA0B,EAAWsC,MAEzD,GAAIA,EAAK,KAAOA,EAAK/B,OAAS,EAC1B,MAAM,IAAIP,MAAM,uCAEpB,MAAQsC,KAAMsO,EAAG+G,KAAMU,GAAWL,EAAY1V,EAAKO,SAAS,KACpDP,KAAMoU,EAAGiB,KAAMW,GAAeN,EAAYK,GAClD,GAAIC,EAAW/X,OACX,MAAM,IAAIP,MAAM,gDAAgD,EAAWsY,MAE/E,MAAO,CAAE1H,IAAG8F,IAChB,CAqByB6B,CAAkBtQ,EAAMgB,EAAM,GAAWA,IAC1D,OAAO,IAAI,EAAU2H,EAAG8F,EAC5B,CACA,cAAOV,CAAQ/M,GACX,OAAOxJ,KAAK2Y,QAAQnP,EACxB,CACA,cAAA6M,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK+Y,GAAmB5H,GACpB,MAAM,IAAI5Q,MAAM,0CACpB,IAAKwY,GAAmB9B,GACpB,MAAM,IAAI1W,MAAM,yCACxB,CACA,QAAAyY,GACI,MAAMC,EAAO9M,EAAM/L,GAAKkM,EACxB,OAAOtM,KAAKiX,EAAIgC,CACpB,CACA,UAAAC,GACI,OAAOlZ,KAAKgZ,WAAa,IAAI,EAAUhZ,KAAKmR,EAAGxD,IAAK3N,KAAKiX,EAAG9K,EAAM/L,IAAMJ,IAC5E,CACA,aAAAmZ,GACI,OAAO,GAAWnZ,KAAKoZ,WAC3B,CACA,QAAAA,GACI,MAAMC,EAAOf,EAASgB,EAAoBtZ,KAAKiX,IACzCsC,EAAOjB,EAASgB,EAAoBtZ,KAAKmR,IACzCqI,EAAQH,EAAKvY,OAAS,EACtB2Y,EAAQF,EAAKzY,OAAS,EACtB4Y,EAAOJ,EAAoBE,GAC3BG,EAAOL,EAAoBG,GAEjC,MAAO,KADQH,EAAoBG,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOL,GAClD,CACA,UAAAxB,GACI,OAAO7X,KAAKmZ,eAChB,CACA,KAAApB,GACI,OAAO/X,KAAKoZ,UAChB,CACA,iBAAAQ,GACI,OAAO,GAAW5Z,KAAK6Z,eAC3B,CACA,YAAAA,GACI,OAAOnC,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,EAEJ,SAAS,KAAe1M,GACpB,IAAKA,EAAOC,OAAO/J,GAAMA,aAAaG,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,CACA,MAAM,EAAQ3B,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAC/E,SAAS,EAAWI,GAChB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAO,EAAMD,EAAO7F,IAExB,OAAO8F,CACX,CACA,MAAMsQ,EAAYhW,OAAO,uEACzB,SAAS4T,EAAYhI,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAInP,MAAM,mBACpB,KAAM8L,GAAOqD,GAAOA,EAAMoK,GACtB,MAAM,IAAIvZ,MAAM,kCACpB,OAAOmP,EAAIxG,SAAS,IAAIC,SAAS,GAAI,IACzC,CACA,SAAS4Q,EAASrK,GACd,MAAMjP,EAAI,GAAWiX,EAAYhI,IACjC,GAAiB,KAAbjP,EAAEK,OACF,MAAM,IAAIP,MAAM,4BACpB,OAAOE,CACX,CACA,SAAS6Y,EAAoB5J,GACzB,MAAMlG,EAAMkG,EAAIxG,SAAS,IACzB,OAAoB,EAAbM,EAAI1I,OAAa,IAAI0I,IAAQA,CACxC,CACA,SAASkP,EAAYlP,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,4CAA8C2I,GAEtE,OAAO1F,OAAO,KAAK0F,IACvB,CACA,SAAS,GAAWA,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,4CAA8CiJ,EAAI1I,QACtE,MAAM2I,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CACA,SAASoL,GAAcnU,GACnB,OAAOgY,EAAY,EAAWhY,GAClC,CACA,SAAS8V,GAAYhN,GACjB,OAAOA,aAAe5I,WAAaA,WAAWoI,KAAKQ,GAAO,GAAWA,EACzE,CACA,SAASmI,GAAgBjC,GACrB,GAAmB,iBAARA,GAAoBrP,OAAOC,cAAcoP,IAAQA,EAAM,EAC9D,OAAO5L,OAAO4L,GAClB,GAAmB,iBAARA,GAAoBqJ,GAAmBrJ,GAC9C,OAAOA,EACX,MAAM,IAAI7O,UAAU,sDACxB,CACA,SAAS8M,GAAIzH,EAAGzF,EAAI0L,EAAMQ,GACtB,MAAMjC,EAASxE,EAAIzF,EACnB,OAAOiK,GAAU2B,EAAM3B,EAASjK,EAAIiK,CACxC,CACA,SAAS6K,GAAKnH,EAAG4L,GACb,MAAM,EAAErN,GAAMR,EACd,IAAIzH,EAAM0J,EACV,KAAO4L,KAAU3N,GACb3H,GAAOA,EACPA,GAAOiI,EAEX,OAAOjI,CACX,CA4BA,SAAS8K,GAAOrP,EAAQ8Z,EAAS9N,EAAMQ,GACnC,GAAIxM,IAAWkM,GAAO4N,GAAU5N,EAC5B,MAAM,IAAI9L,MAAM,6CAA6CJ,SAAc8Z,KAE/E,IAAI/T,EAAIyH,GAAIxN,EAAQ8Z,GAChBxZ,EAAIwZ,EACJ7L,EAAI/B,EAAKuC,EAAItC,EAAK4N,EAAI5N,EAAKrD,EAAIoD,EACnC,KAAOnG,IAAMmG,GAAK,CACd,MAAM8N,EAAI1Z,EAAIyF,EACRiL,EAAI1Q,EAAIyF,EACRkU,EAAIhM,EAAI8L,EAAIC,EACZ/Z,EAAIwO,EAAI3F,EAAIkR,EAClB1Z,EAAIyF,EAAGA,EAAIiL,EAAG/C,EAAI8L,EAAGtL,EAAI3F,EAAGiR,EAAIE,EAAGnR,EAAI7I,CAC3C,CAEA,GADYK,IACA6L,EACR,MAAM,IAAI/L,MAAM,0BACpB,OAAOoN,GAAIS,EAAG6L,EAClB,CA8BA,IAAIO,GACAC,GAuEJ,SAAS1B,GAAmBrJ,GACxB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAM/L,CACpC,CACA,SAAS0U,GAAoBpF,GACzB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAMQ,CACpC,CAsBA,SAASiK,GAAoBrR,GACzB,IAAImK,EACJ,GAAmB,iBAARnK,EACPmK,EAAMnK,OAEL,GAAmB,iBAARA,GAAoBlF,OAAOC,cAAciF,IAAQA,EAAM,EACnEmK,EAAM5L,OAAOyB,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAmB,KAAfA,EAAIzE,OACJ,MAAM,IAAIP,MAAM,oCACpBmP,EAAMgJ,EAAYnT,EACtB,KACK,MAAIA,aAAe3E,YAMpB,MAAM,IAAIC,UAAU,8BALpB,GAAI0E,EAAIzE,SAAWkN,EACf,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMmF,GAActP,EAIxB,CACA,IAAKwT,GAAmBrJ,GACpB,MAAM,IAAInP,MAAM,qCACpB,OAAOmP,CACX,CAoRA,EAAM6C,KAAKiC,eAAe,GAC1B,MAAM,GAAS,CACXxP,KAAM,EACNE,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,GAOhEua,GAAuB,CAAC,EACjB,GAAQ,CACjBpX,WAAU,EACVD,WAAU,GACVJ,YAAW,EACX4F,OACA6B,UACA,iBAAAiQ,CAAkB9I,GACd,IAEI,OADAC,GAAoBD,IACb,CACX,CACA,MAAOqF,GACH,OAAO,CACX,CACJ,EACA0D,iBAAkB3F,EAClB4F,qBAAsB/I,GACtBgJ,iBAAmB5e,IAGf,IAFAA,EAAOwV,GAAYxV,IAEVF,OADMkN,IACahN,EAAKF,OAAS,KACtC,MAAM,IAAIP,MAAM,uDAGpB,OAAOwZ,EADKpM,GAAIkH,GAAc7T,GAAOmL,EAAM/L,EAAIkM,GAAOA,EAClC,EAExB1E,YAAa,CAAC2D,EAAc,MACxB,GAAI,GAAOrG,IACP,OAAO,GAAOA,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEhD,GAAI,GAAOvG,KAAM,CAClB,MAAM,YAAE4C,GAAgB,GAAO5C,KAC/B,OAAOpE,WAAWoI,KAAKpB,EAAY2D,GACvC,CAEI,MAAM,IAAIhL,MAAM,oDACpB,EAEJuf,iBAAkB,IAAM,GAAMF,iBAAiB,GAAMhY,YAAYoG,KACjE,UAAA+R,CAAWnN,EAAa,EAAGY,EAAQ,EAAMjB,MACrC,MAAMyN,EAASxM,IAAU,EAAMjB,KAAOiB,EAAQ,IAAI,EAAMA,EAAMpF,EAAGoF,EAAM5E,GAGvE,OAFAoR,EAAOxL,eAAe5B,GACtBoN,EAAOzM,SAAS/G,GACTwT,CACX,EACAja,OAAQgE,SAAUkW,KACd,GAAI,GAAO/a,IAAK,CACZ,MAAMzC,QAAe,GAAOyC,IAAIgb,OAAOzb,OAAO,UAAW,KAAewb,IACxE,OAAO,IAAIrf,WAAW6B,EAC1B,CACK,GAAI,GAAOuC,KAAM,CAClB,MAAM,WAAEmb,GAAe,GAAOnb,KACxBhE,EAAOmf,EAAW,UAExB,OADAF,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,+CACpB,EAEJwa,WAAYhR,MAAOxE,KAAQ0a,KACvB,GAAI,GAAO/a,IAAK,CACZ,MAAMmb,QAAa,GAAOnb,IAAIgb,OAAOI,UAAU,MAAO/a,EAAK,CAAEkT,KAAM,OAAQzX,KAAM,CAAEyX,KAAM,aAAe,EAAO,CAAC,SAC1G5S,EAAU,KAAeoa,GACzBxd,QAAe,GAAOyC,IAAIgb,OAAOrU,KAAK,OAAQwU,EAAMxa,GAC1D,OAAO,IAAIjF,WAAW6B,EAC1B,CACK,GAAI,GAAOuC,KAAM,CAClB,MAAM,WAAEub,GAAe,GAAOvb,KACxBhE,EAAOuf,EAAW,SAAUhb,GAElC,OADA0a,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,oDACpB,EAEJigB,gBAAYvb,EACZwb,oBAAgBxb,EAChByZ,WAAY3U,MAAO0U,KAAQwB,KACvB,IAAIS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,QAAa,GAAM5a,OAAOnF,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MACzEF,EAAO,EAAYC,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAO,GAAM3a,OAAO2a,KAAST,EAAS,EAE1Cf,eAAgB,CAACT,KAAQwB,KACrB,GAA2B,mBAAhBzF,GACP,MAAM,IAAIhM,EAAS,+CACvB,IAAIkS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,EAAOnG,GAAY5Z,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MAClEF,EAAO,EAAYC,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAOlG,GAAYkG,KAAST,EAAS,EAEzCY,eAAgBlS,GAEpB/M,OAAOkf,iBAAiB,GAAO,CAC3BN,WAAY,CACRO,cAAc,EACdvc,IAAG,IACQgW,GAEX,GAAArX,CAAI6d,GACKxG,KACDA,GAAcwG,EACtB,GAEJP,eAAgB,CACZM,cAAc,EACdvc,IAAG,IACQiW,GAEX,GAAAtX,CAAI6d,GACKvG,KACDA,GAAkBuG,EAC1B,KCjsCD,MCADi/B,GAAmB,CACrBC,eAAgB,SAChBC,QAAS,CACL,iBAAkB,aASnBp2C,eAAeq2C,GAAa10B,EAAO20B,GACtC,MAAMC,EAAY,CAAC,EAGnB,OAFA1+C,OAAOqJ,OAAOq1C,EAAWL,GAAkBI,SACjBE,MAAM70B,EAAO40B,EAE3C,CA8BO,SAAS,MAAiBhkB,GAC7B,MAAM,SAAEkkB,EAAQ,YAAEC,GAZtB,SAA8BnkB,GAC1B,IAAIkkB,EAAWJ,GACXK,EAAc,GAOlB,OANInkB,EAAKx7B,OAAS,GAAwB,mBAAZw7B,EAAK,KAC/BkkB,EAAWlkB,EAAKzzB,SAEhByzB,EAAKx7B,OAAS,IACd2/C,EAAcnkB,GAEX,CAAEkkB,WAAUC,cACvB,CAEsCC,CAAqBpkB,GA0BvD,OAzBgBvyB,MAAOg2B,EAAKsgB,KACxB,IAAIM,EAAc,CAAE5gB,MAAKsgB,KAAMA,GAAQ,CAAC,GACxC,IAAK,MAAMO,KAAcH,EACS,mBAAnBG,EAAWC,MAKlBF,QAJqB71B,QAAQC,QAAQ61B,EAAWC,IAAI,CAChDN,MAAOC,KACJG,MAEiBA,GAGhC,IAAIG,QAAiBN,EAASG,EAAY5gB,IAAK4gB,EAAYN,MAC3D,IAAK,MAAMO,KAAcH,EACrB,GAA+B,mBAApBG,EAAWxc,KAAqB,CACvC,MAAM15B,QAAeogB,QAAQC,QAAQ61B,EAAWxc,KAAK,CACjDmc,MAAOC,EACPzgB,IAAK4gB,EAAY5gB,IACjBsgB,KAAMM,EAAYN,KAClBS,SAAUA,GAAUn2C,SAAWm2C,KAEnCA,EAAWp2C,GAAUo2C,CACzB,CAEJ,OAAOA,CAAQ,CAGvB,CC3EO,IAAIC,GAKAC,GAMA,GAKAC,GAJAC,IAXX,SAAWH,GACPA,EAAQA,EAAiB,QAAI,GAAK,UAClCA,EAAQA,EAAiB,QAAI,YAAc,SAC9C,CAHD,CAGGA,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACPA,EAAcA,EAAuB,QAAI,WAAa,UACtDA,EAAcA,EAAuB,QAAI,YAAc,SAC1D,CAHD,CAGGA,KAAkBA,GAAgB,CAAC,IACND,GAAQI,SAE7BD,GAGR,KAAuB,GAAqB,CAAC,IAFzBA,GAA4B,QAAI,GAAK,UACxDA,GAAmBA,GAA4B,QAAI,KAAO,UAG9D,SAAWD,GACPA,EAAeA,EAAiC,iBAAI,IAAM,mBAC1DA,EAAeA,EAAgC,gBAAI,IAAM,kBACzDA,EAAeA,EAAiC,iBAAI,IAAM,mBAC1DA,EAAeA,EAAgC,gBAAI,IAAM,iBAC5D,CALD,CAKGA,KAAmBA,GAAiB,CAAC,IACG,GAAmBE,QCrBvD,MAAM,GAAiB,CAC1BC,QAASL,GAAQI,QACjBE,mBAAoB,GAAmBF,QACvCG,cAAeN,GAAcG,QAC7BI,WAAY,KACZC,YAAa,gCACbC,eAAgB,CACZC,UAAWT,GAAeU,iBAC1BC,SAAUX,GAAeY,iBAE7BC,OAAQ,CAAEC,QHZkB,gCGcnBC,GAAiB,CAC1BZ,QAASL,GAAQkB,QACjBZ,mBAAoB,GAAmBY,QACvCX,cAAeN,GAAciB,QAC7BV,WAAY,KACZC,YAAa,gCACbC,eAAgB,CACZC,UAAWT,GAAeiB,iBAC1BN,SAAUX,GAAekB,iBAE7BL,OAAQ,CAAEC,QHvBkB,gCGyBnBK,GAAgB,IACtBJ,GACHP,eAAgB,IAAKO,GAAeP,gBACpCF,WAAY,KACZO,OAAQ,CAAEC,QH5BY,0BG8BbM,GAAiB,IACvBD,GACHX,eAAgB,IAAKW,GAAcX,gBACnCK,OAAQ,IAAKM,GAAcN,SAiBxB,SAAS,GAAYQ,GACxB,MAAuB,iBAAZA,EAfR,SAAyB7pC,GAC5B,OAAQA,GACJ,IAAK,UACD,OAAO,GACX,IAAK,UACD,OAAOupC,GACX,IAAK,SACD,OAAOI,GACX,IAAK,UACD,OAAOC,GACX,QACI,MAAM,IAAI9hD,MAAM,yBAAyBkY,KAErD,CAGe8pC,CAAgBD,GACpBA,CACX,KCtCW,GAYAE,GAMAC,GAjBAC,cAAAA,GAUR,KAAgB,GAAc,CAAC,IATlBA,GAA2B,cAAI,GAAK,gBAChDA,GAAYA,GAA2B,cAAI,GAAK,gBAChDA,GAAYA,GAAoC,uBAAI,GAAK,yBACzDA,GAAYA,GAA0B,aAAI,GAAK,eAC/CA,GAAYA,GAA8B,iBAAI,GAAK,mBACnDA,GAAYA,GAAsB,SAAI,GAAK,WAC3CA,GAAYA,GAAoC,uBAAI,GAAK,yBACzDA,GAAYA,GAA0B,aAAI,GAAK,eAC/CA,GAAYA,GAA8B,iBAAI,GAAK,mBAGvD,SAAWF,GACPA,EAAeA,EAAyB,SAAI,GAAK,WACjDA,EAAeA,EAAyB,SAAI,GAAK,WACjDA,EAAeA,EAAyB,SAAI,GAAK,UACpD,CAJD,CAIGA,KAAmBA,GAAiB,CAAC,IAExC,SAAWC,GACPA,EAAWA,EAAwB,YAAI,GAAK,cAC5CA,EAAWA,EAAyB,aAAI,GAAK,eAC7CA,EAAWA,EAAgB,IAAI,GAAK,KACvC,CAJD,CAIGA,KAAeA,GAAa,CAAC,IAezB,IAAIE,GAKAC,GAMAC,GAKA,GAUA,GAKAC,GAQAC,GAKAC,GAMAC,GAMAC,GAKAC,GAOAC,GAzCAC,GAVAC,GA7Beb,GAAWc,YACXd,GAAWe,aACXf,GAAWgB,IAChChB,GAAWc,YAAcd,GAAWc,YACpCd,GAAWe,aAAef,GAAWe,aACrCf,GAAWgB,IAAMhB,GAAWgB,IAQjC,SAAWd,GACPA,EAAkBA,EAAyB,MAAI,GAAK,QACpDA,EAAkBA,EAAwB,KAAI,GAAK,MACtD,CAHD,CAGGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAAkBA,EAAuB,IAAI,GAAK,MAClDA,EAAkBA,EAA4B,SAAI,GAAK,WACvDA,EAAkBA,EAA+B,YAAI,GAAK,aAC7D,CAJD,CAIGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAASA,EAAmB,SAAI,GAAK,WACrCA,EAASA,EAAoB,UAAI,GAAK,WACzC,CAHD,CAGGA,KAAaA,GAAW,CAAC,KAEjBS,GAOR,KAAoB,GAAkB,CAAC,IANtBA,GAAuB,MAAI,GAAK,QAChDA,GAAgBA,GAAsB,KAAI,GAAK,OAC/CA,GAAgBA,GAAwB,OAAI,GAAK,SACjDA,GAAgBA,GAAuB,MAAI,GAAK,QAChDA,GAAgBA,GAAmC,kBAAI,GAAK,oBAC5DA,GAAgBA,GAAoC,mBAAI,GAAK,sBAItDD,GAGR,KAAmB,GAAiB,CAAC,IAFrBA,GAA2B,WAAI,GAAK,aACnDA,GAAeA,GAA6B,aAAI,GAAK,eAGzD,SAAWP,GACPA,EAAsBA,EAA6B,MAAI,GAAK,QAC5DA,EAAsBA,EAA+B,QAAI,GAAK,UAC9DA,EAAsBA,EAAoC,aAAI,GAAK,eACnEA,EAAsBA,EAA4B,KAAI,GAAK,OAC3DA,EAAsBA,EAAiC,UAAI,GAAK,WACnE,CAND,CAMGA,KAA0BA,GAAwB,CAAC,IAEtD,SAAWC,GACPA,EAAyBA,EAAgC,MAAI,IAAM,QACnEA,EAAyBA,EAAsC,YAAI,IAAM,aAC5E,CAHD,CAGGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAyBA,EAAiC,OAAI,GAAK,SACnEA,EAAyBA,EAAmC,SAAI,GAAK,WACrEA,EAAyBA,EAAmC,SAAI,GAAK,UACxE,CAJD,CAIGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAUA,EAAe,IAAI,GAAK,MAClCA,EAAUA,EAAoB,SAAI,GAAK,WACvCA,EAAUA,EAAuB,YAAI,GAAK,aAC7C,CAJD,CAIGA,KAAcA,GAAY,CAAC,IAE9B,SAAWC,GACPA,EAAkBA,EAA8B,WAAI,GAAK,aACzDA,EAAkBA,EAA4B,SAAI,GAAK,UAC1D,CAHD,CAGGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAAcA,EAAmC,oBAAI,GAAK,sBAC1DA,EAAcA,EAAqC,sBAAI,GAAK,wBAC5DA,EAAcA,EAAmC,oBAAI,GAAK,sBAC1DA,EAAcA,EAAqC,sBAAI,GAAK,uBAC/D,CALD,CAKGA,KAAkBA,GAAgB,CAAC,IAEtC,SAAWC,GACPA,EAAgC,cAAI,gBACpCA,EAAkC,gBAAI,kBACtCA,EAAsC,oBAAI,sBAC1CA,EAA4B,UAAI,YAChCA,EAA2B,SAAI,WAC/BA,EAAiC,eAAI,iBACrCA,EAAiC,eAAI,iBACrCA,EAAuC,qBAAI,uBAC3CA,EAAsC,oBAAI,sBAC1CA,EAAwC,sBAAI,wBAC5CA,EAAiD,+BAAI,iCACrDA,EAAuD,qCAAI,uCAC3DA,EAA4C,0BAAI,4BAChDA,EAAwC,sBAAI,wBAC5CA,EAAuC,qBAAI,uBAC3CA,EAA8C,4BAAI,8BAClDA,EAAwC,sBAAI,wBAC5CA,EAAqC,mBAAI,oBAC5C,CAnBD,CAmBGA,KAAqBA,GAAmB,CAAC,IC5I5C,MAAMM,GAAM,IAAI9iD,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzE+iD,GAAK/iD,WAAWoI,KAAK,CAAElI,OAAQ,KAAM,CAACqsC,EAAGzpC,IAAMA,IAC/CkgD,GAAKD,GAAG9zC,KAAKnM,IAAO,EAAIA,EAAI,GAAK,KACvC,IAAImgD,GAAO,CAACF,IACRG,GAAO,CAACF,IACZ,IAAK,IAAIlgD,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIgG,IAAK,CAACm6C,GAAMC,IACjBp6C,EAAE0I,KAAK1I,EAAEhG,GAAGmM,KAAK3C,GAAMw2C,GAAIx2C,MACnC,MAAM62C,GAAS,CACX,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDl0C,KAAKnM,GAAM,IAAI9C,WAAW8C,KACtBsgD,GAAUH,GAAKh0C,KAAI,CAACi4B,EAAKpkC,IAAMokC,EAAIj4B,KAAKnG,GAAMq6C,GAAOrgD,GAAGgG,OACxDu6C,GAAUH,GAAKj0C,KAAI,CAACi4B,EAAKpkC,IAAMokC,EAAIj4B,KAAKnG,GAAMq6C,GAAOrgD,GAAGgG,OACxDw6C,GAAK,IAAI79C,YAAY,CAAC,EAAY,WAAY,WAAY,WAAY,aACtE89C,GAAK,IAAI99C,YAAY,CAAC,WAAY,WAAY,WAAY,WAAY,IAEtE+9C,GAAO,CAACx7C,EAAMC,IAAWD,GAAQC,EAAUD,IAAU,GAAKC,EAEhE,SAAS8J,GAAE0xC,EAAOj2C,EAAGQ,EAAGC,GACpB,OAAc,IAAVw1C,EACOj2C,EAAIQ,EAAIC,EACA,IAAVw1C,EACGj2C,EAAIQ,GAAOR,EAAIS,EACR,IAAVw1C,GACGj2C,GAAKQ,GAAKC,EACH,IAAVw1C,EACGj2C,EAAIS,EAAMD,GAAKC,EAEhBT,GAAKQ,GAAKC,EACzB,CAEA,MAAMy1C,GAAM,IAAIj+C,YAAY,IACrB,MAAMk+C,WAAkBviD,EAC3B,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GACjBvC,KAAKwkD,GAAK,WACVxkD,KAAKyc,IAAK,UACVzc,KAAKykD,IAAK,WACVzkD,KAAK0kD,GAAK,UACV1kD,KAAK2kD,IAAK,UACd,CACA,GAAAngD,GACI,MAAM,GAAEggD,EAAE,GAAE/nC,EAAE,GAAEgoC,EAAE,GAAEC,EAAE,GAAEC,GAAO3kD,KAC/B,MAAO,CAACwkD,EAAI/nC,EAAIgoC,EAAIC,EAAIC,EAC5B,CACA,GAAAxhD,CAAIqhD,EAAI/nC,EAAIgoC,EAAIC,EAAIC,GAChB3kD,KAAKwkD,GAAU,EAALA,EACVxkD,KAAKyc,GAAU,EAALA,EACVzc,KAAKykD,GAAU,EAALA,EACVzkD,KAAK0kD,GAAU,EAALA,EACV1kD,KAAK2kD,GAAU,EAALA,CACd,CACA,OAAAthD,CAAQX,EAAMuE,GACV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCq9C,GAAI5gD,GAAKhB,EAAKwE,UAAUD,GAAQ,GAEpC,IAAI29C,EAAe,EAAV5kD,KAAKwkD,GAAQK,EAAKD,EAAIE,EAAe,EAAV9kD,KAAKyc,GAAQsoC,EAAKD,EAAIE,EAAe,EAAVhlD,KAAKykD,GAAQQ,EAAKD,EAAIE,EAAe,EAAVllD,KAAK0kD,GAAQS,EAAKD,EAAIE,EAAe,EAAVplD,KAAK2kD,GAAQU,EAAKD,EAGvI,IAAK,IAAIf,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMiB,EAAS,EAAIjB,EACbkB,EAAMrB,GAAGG,GAAQmB,EAAMrB,GAAGE,GAC1BoB,EAAK5B,GAAKQ,GAAQqB,EAAK5B,GAAKO,GAC5B9oC,EAAKyoC,GAAQK,GAAQsB,EAAK1B,GAAQI,GACxC,IAAK,IAAI3gD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMkiD,EAAMxB,GAAKQ,EAAKjyC,GAAE0xC,EAAOS,EAAIE,EAAIE,GAAMZ,GAAImB,EAAG/hD,IAAM6hD,EAAKhqC,EAAG7X,IAAM0hD,EAAM,EAC9ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfd,GAAKY,EAAI,IAASA,EAAKF,EAAIA,EAAKc,CAC3D,CAEA,IAAK,IAAIliD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMmiD,EAAMzB,GAAKS,EAAKlyC,GAAE2yC,EAAQP,EAAIE,EAAIE,GAAMb,GAAIoB,EAAGhiD,IAAM8hD,EAAKG,EAAGjiD,IAAM2hD,EAAM,EAC/ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAff,GAAKa,EAAI,IAASA,EAAKF,EAAIA,EAAKc,CAC3D,CACJ,CAEA7lD,KAAKmD,IAAKnD,KAAKyc,GAAKuoC,EAAKG,EAAM,EAAInlD,KAAKykD,GAAKS,EAAKG,EAAM,EAAIrlD,KAAK0kD,GAAKU,EAAKP,EAAM,EAAI7kD,KAAK2kD,GAAKC,EAAKG,EAAM,EAAI/kD,KAAKwkD,GAAKM,EAAKG,EAAM,EACvI,CACA,UAAA1hD,GACI+gD,GAAI7gD,KAAK,EACb,CACA,OAAAmB,GACI5E,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAOgB,KAAK,GACjBzD,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EACzB,EAMG,MAAM2iD,GAAYn+C,GAAgB,IAAM,IAAI48C,KClG7CwB,GAAajiD,OAAO,GAAK,GAAK,GAC9BD,GAAOC,OAAO,IAEb,SAASkiD,GAAQ5lD,EAAG6lD,GAAK,GAC5B,OAAIA,EACO,CAAE/hD,EAAG7D,OAAOD,EAAI2lD,IAAa5hD,EAAG9D,OAAQD,GAAKyD,GAAQkiD,KACzD,CAAE7hD,EAAsC,EAAnC7D,OAAQD,GAAKyD,GAAQkiD,IAAiB5hD,EAA4B,EAAzB9D,OAAOD,EAAI2lD,IACpE,CAqCA,MAeA,GAnDO,SAAeG,EAAKD,GAAK,GAC5B,IAAIE,EAAK,IAAI9/C,YAAY6/C,EAAIplD,QACzBslD,EAAK,IAAI//C,YAAY6/C,EAAIplD,QAC7B,IAAK,IAAI4C,EAAI,EAAGA,EAAIwiD,EAAIplD,OAAQ4C,IAAK,CACjC,MAAM,EAAEQ,EAAC,EAAEC,GAAM6hD,GAAQE,EAAIxiD,GAAIuiD,IAChCE,EAAGziD,GAAI0iD,EAAG1iD,IAAM,CAACQ,EAAGC,EACzB,CACA,MAAO,CAACgiD,EAAIC,EAChB,EA2CA,GAxCc,CAACliD,EAAGC,EAAG8S,IAAM/S,IAAM+S,EAwCjC,GAvCc,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAM8S,EAuCpD,GArCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,IAAM+S,EAAM9S,GAAM,GAAK8S,EAqCpD,GApCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAM8S,EAoCrD,GAlCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAO8S,EAAI,GAkC1D,GAjCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,IAAO+S,EAAI,GAAQ9S,GAAM,GAAK8S,EAiC3D,GApBO,SAAakvC,EAAIC,EAAIC,EAAIC,GAC5B,MAAMniD,GAAKiiD,IAAO,IAAME,IAAO,GAC/B,MAAO,CAAEpiD,EAAIiiD,EAAKE,GAAOliD,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBA,GAfc,CAACiiD,EAAIE,EAAIC,KAAQH,IAAO,IAAME,IAAO,IAAMC,IAAO,GAehE,GAdc,CAACC,EAAKL,EAAIE,EAAII,IAAQN,EAAKE,EAAKI,GAAOD,EAAM,GAAK,GAAM,GAAM,EAc5E,GAbc,CAACJ,EAAIE,EAAIC,EAAIG,KAAQN,IAAO,IAAME,IAAO,IAAMC,IAAO,IAAMG,IAAO,GAajF,GAZc,CAACF,EAAKL,EAAIE,EAAII,EAAIE,IAAQR,EAAKE,EAAKI,EAAKE,GAAOH,EAAM,GAAK,GAAM,GAAM,EAYrF,GAVc,CAACA,EAAKL,EAAIE,EAAII,EAAIE,EAAIC,IAAQT,EAAKE,EAAKI,EAAKE,EAAKC,GAAOJ,EAAM,GAAK,GAAM,GAAM,EAU9F,GAXc,CAACJ,EAAIE,EAAIC,EAAIG,EAAIG,KAAQT,IAAO,IAAME,IAAO,IAAMC,IAAO,IAAMG,IAAO,IAAMG,IAAO,IC3C3FC,GAAWC,IAAa,GAAU,CACrC,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpEl3C,KAAIzP,GAAK0D,OAAO1D,MAEZ4mD,GAAa,IAAI3gD,YAAY,IAC7B4gD,GAAa,IAAI5gD,YAAY,IAC5B,MAAM6gD,WAAellD,EACxB,WAAAI,GACIG,MAAM,IAAK,GAAI,IAAI,GAKnBvC,KAAKmmD,GAAK,WACVnmD,KAAKomD,IAAK,UACVpmD,KAAKqmD,IAAK,WACVrmD,KAAKsmD,IAAK,WACVtmD,KAAKymD,GAAK,WACVzmD,KAAKumD,IAAK,SACVvmD,KAAK2mD,IAAK,WACV3mD,KAAK0mD,GAAK,WACV1mD,KAAK4mD,GAAK,WACV5mD,KAAK6mD,IAAK,WACV7mD,KAAKmnD,IAAK,WACVnnD,KAAKonD,GAAK,UACVpnD,KAAKqnD,GAAK,UACVrnD,KAAKsnD,IAAK,SACVtnD,KAAKunD,GAAK,WACVvnD,KAAKwnD,GAAK,SACd,CAEA,GAAAhjD,GACI,MAAM,GAAE2hD,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEG,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAED,EAAE,GAAEE,EAAE,GAAEC,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOxnD,KAC3E,MAAO,CAACmmD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAArkD,CAAIgjD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DxnD,KAAKmmD,GAAU,EAALA,EACVnmD,KAAKomD,GAAU,EAALA,EACVpmD,KAAKqmD,GAAU,EAALA,EACVrmD,KAAKsmD,GAAU,EAALA,EACVtmD,KAAKymD,GAAU,EAALA,EACVzmD,KAAKumD,GAAU,EAALA,EACVvmD,KAAK2mD,GAAU,EAALA,EACV3mD,KAAK0mD,GAAU,EAALA,EACV1mD,KAAK4mD,GAAU,EAALA,EACV5mD,KAAK6mD,GAAU,EAALA,EACV7mD,KAAKmnD,GAAU,EAALA,EACVnnD,KAAKonD,GAAU,EAALA,EACVpnD,KAAKqnD,GAAU,EAALA,EACVrnD,KAAKsnD,GAAU,EAALA,EACVtnD,KAAKunD,GAAU,EAALA,EACVvnD,KAAKwnD,GAAU,EAALA,CACd,CACA,OAAAnkD,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnC+/C,GAAWtjD,GAAKhB,EAAKwE,UAAUD,GAC/BggD,GAAWvjD,GAAKhB,EAAKwE,UAAWD,GAAU,GAE9C,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAM+jD,EAA4B,EAArBT,GAAWtjD,EAAI,IACtBgkD,EAA4B,EAArBT,GAAWvjD,EAAI,IACtBikD,EAAM,GAAWF,EAAMC,EAAM,GAAK,GAAWD,EAAMC,EAAM,GAAK,GAAUD,EAAMC,EAAM,GACpFE,EAAM,GAAWH,EAAMC,EAAM,GAAK,GAAWD,EAAMC,EAAM,GAAK,GAAUD,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,GAAWtjD,EAAI,GACrBokD,EAA0B,EAApBb,GAAWvjD,EAAI,GACrBqkD,EAAM,GAAWF,EAAKC,EAAK,IAAM,GAAWD,EAAKC,EAAK,IAAM,GAAUD,EAAKC,EAAK,GAChFE,EAAM,GAAWH,EAAKC,EAAK,IAAM,GAAWD,EAAKC,EAAK,IAAM,GAAUD,EAAKC,EAAK,GAEhFG,EAAO,GAAUL,EAAKI,EAAKf,GAAWvjD,EAAI,GAAIujD,GAAWvjD,EAAI,KAC7DwkD,EAAO,GAAUD,EAAMN,EAAKI,EAAKf,GAAWtjD,EAAI,GAAIsjD,GAAWtjD,EAAI,KACzEsjD,GAAWtjD,GAAY,EAAPwkD,EAChBjB,GAAWvjD,GAAY,EAAPukD,CACpB,CACA,IAAI,GAAE9B,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEG,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAED,EAAE,GAAEE,EAAE,GAAEC,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOxnD,KAEzE,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMykD,EAAU,GAAWvB,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EuB,EAAU,GAAWxB,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAE/EwB,EAAQzB,EAAKO,GAAQP,EAAKS,EAI1BiB,EAAO,GAAUd,EAAIY,EAHbvB,EAAKO,GAAQP,EAAKS,EAGUP,GAAUrjD,GAAIujD,GAAWvjD,IAC7D6kD,EAAM,GAAUD,EAAMf,EAAIY,EAASE,EAAMvB,GAAUpjD,GAAIsjD,GAAWtjD,IAClE8kD,EAAa,EAAPF,EAENG,EAAU,GAAWtC,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EsC,EAAU,GAAWvC,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EuC,EAAQxC,EAAKE,EAAOF,EAAKM,EAAOJ,EAAKI,EACrCmC,EAAQxC,EAAKE,EAAOF,EAAKG,EAAOD,EAAKC,EAC3CgB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALP,EACLQ,EAAU,EAALP,IACF3iD,EAAG0iD,EAAIziD,GAAU,GAAa,EAALwiD,EAAa,EAALD,EAAc,EAAN6B,EAAe,EAANC,IACrD7B,EAAU,EAALF,EACLC,EAAU,EAALH,EACLE,EAAU,EAALJ,EACLE,EAAU,EAALD,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACL,MAAMyC,EAAM,GAAUL,EAAKE,EAASE,GACpCzC,EAAK,GAAU0C,EAAKN,EAAKE,EAASE,GAClCvC,EAAW,EAANyC,CACT,GAEG3kD,EAAGiiD,EAAIhiD,EAAGiiD,GAAO,GAAkB,EAAVpmD,KAAKmmD,GAAkB,EAAVnmD,KAAKomD,GAAa,EAALD,EAAa,EAALC,MAC3DliD,EAAGmiD,EAAIliD,EAAGmiD,GAAO,GAAkB,EAAVtmD,KAAKqmD,GAAkB,EAAVrmD,KAAKsmD,GAAa,EAALD,EAAa,EAALC,MAC3DpiD,EAAGuiD,EAAItiD,EAAGoiD,GAAO,GAAkB,EAAVvmD,KAAKymD,GAAkB,EAAVzmD,KAAKumD,GAAa,EAALE,EAAa,EAALF,MAC3DriD,EAAGyiD,EAAIxiD,EAAGuiD,GAAO,GAAkB,EAAV1mD,KAAK2mD,GAAkB,EAAV3mD,KAAK0mD,GAAa,EAALC,EAAa,EAALD,MAC3DxiD,EAAG0iD,EAAIziD,GAAU,GAAkB,EAAVnE,KAAK4mD,GAAkB,EAAV5mD,KAAK6mD,GAAa,EAALD,EAAa,EAALC,MAC3D3iD,EAAOC,EAAGijD,GAAO,GAAkB,EAAVpnD,KAAKmnD,GAAkB,EAAVnnD,KAAKonD,GAAa,EAALD,EAAa,EAALC,MAC3DljD,EAAGmjD,EAAIljD,EAAGmjD,GAAO,GAAkB,EAAVtnD,KAAKqnD,GAAkB,EAAVrnD,KAAKsnD,GAAa,EAALD,EAAa,EAALC,MAC3DpjD,EAAGqjD,EAAIpjD,EAAGqjD,GAAO,GAAkB,EAAVxnD,KAAKunD,GAAkB,EAAVvnD,KAAKwnD,GAAa,EAALD,EAAa,EAALC,IAC9DxnD,KAAKmD,IAAIgjD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAAjkD,GACIyjD,GAAWvjD,KAAK,GAChBwjD,GAAWxjD,KAAK,EACpB,CACA,OAAAmB,GACI5E,KAAKyC,OAAOgB,KAAK,GACjBzD,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAEJ,MAAM2lD,WAAmB5B,GACrB,WAAA9kD,GACIG,QAEAvC,KAAKmmD,IAAK,WACVnmD,KAAKomD,GAAK,UACVpmD,KAAKqmD,GAAK,WACVrmD,KAAKsmD,IAAK,WACVtmD,KAAKymD,GAAK,UACVzmD,KAAKumD,GAAK,UACVvmD,KAAK2mD,GAAK,WACV3mD,KAAK0mD,GAAK,WACV1mD,KAAK4mD,GAAK,UACV5mD,KAAK6mD,GAAK,WACV7mD,KAAKmnD,GAAK,WACVnnD,KAAKonD,GAAK,SACVpnD,KAAKqnD,GAAK,WACVrnD,KAAKsnD,GAAK,WACVtnD,KAAKunD,GAAK,UACVvnD,KAAKwnD,IAAK,WACVxnD,KAAKkB,UAAY,EACrB,EAEJ,MAAM6nD,WAAmB7B,GACrB,WAAA9kD,GACIG,QAEAvC,KAAKmmD,GAAK,UACVnmD,KAAKomD,IAAK,SACVpmD,KAAKqmD,IAAK,WACVrmD,KAAKsmD,IAAK,UACVtmD,KAAKymD,GAAK,UACVzmD,KAAKumD,GAAK,WACVvmD,KAAK2mD,IAAK,WACV3mD,KAAK0mD,GAAK,WACV1mD,KAAK4mD,IAAK,WACV5mD,KAAK6mD,IAAK,WACV7mD,KAAKmnD,IAAK,WACVnnD,KAAKonD,GAAK,WACVpnD,KAAKqnD,GAAK,UACVrnD,KAAKsnD,GAAK,UACVtnD,KAAKunD,GAAK,UACVvnD,KAAKwnD,IAAK,WACVxnD,KAAKkB,UAAY,EACrB,EAEJ,MAAM8nD,WAAe9B,GACjB,WAAA9kD,GACIG,QAEAvC,KAAKmmD,IAAK,UACVnmD,KAAKomD,IAAK,WACVpmD,KAAKqmD,GAAK,WACVrmD,KAAKsmD,GAAK,UACVtmD,KAAKymD,IAAK,WACVzmD,KAAKumD,GAAK,UACVvmD,KAAK2mD,GAAK,UACV3mD,KAAK0mD,IAAK,UACV1mD,KAAK4mD,GAAK,WACV5mD,KAAK6mD,IAAK,QACV7mD,KAAKmnD,IAAK,WACVnnD,KAAKonD,GAAK,WACVpnD,KAAKqnD,IAAK,UACVrnD,KAAKsnD,GAAK,WACVtnD,KAAKunD,GAAK,WACVvnD,KAAKwnD,IAAK,WACVxnD,KAAKkB,UAAY,EACrB,EAEkByG,GAAgB,IAAM,IAAIu/C,KACtBv/C,GAAgB,IAAM,IAAImhD,KAC1BnhD,GAAgB,IAAM,IAAIohD,KAC9BphD,GAAgB,IAAM,IAAIqhD,YC/MzC,MAOM,GAAat9B,GhBwNnB,SAAoBniB,GACvB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,MAAM0Q,KAAK3Q,EACZC,GAAOV,EAAMoR,GAEjB,OAAO1Q,CACX,CgB/NW,CARY,CAACkiB,GACbo6B,GAAU,EAAOp6B,IAON,CAAQA,IC9BvB,IAAI,GACAu9B,GCmBJ,SAASC,GAAwBntC,EAAWumC,EAAU,WACzDA,EAAU,GAAYA,GACtBvmC,EAAiC,iBAAdA,ElBwOhB,SAAoBvS,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA2C2I,GAvDhE,IAAmB1H,EA0DtB0H,GA1DsB1H,EAyDN0H,EAAhBA,EAxDO,OAAOqwB,KAAK/3B,GACbA,EAAM6C,MAAM,GACZ7C,GAuDIhB,OAAS,EAAI,IAAI0I,IAAQA,EACnC,MAAMC,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CkBxPgD,CAAWsS,GAAaA,EACpE,MAAMotC,ECrBH,SAAkCC,EAAU9G,GAE/C,OADAA,EAAU,GAAYA,GAAW,IACzB8G,GACJ,KAAK,GAAgBC,MACjB,OAAQ/G,EAAQjB,oBACZ,KAAK,GAAmBF,QACpB,OAAOF,GAAeU,iBAC1B,KAAK,GAAmBM,QACpB,OAAOhB,GAAeiB,iBAC1B,QACI,MAAM,IAAI3hD,MAAM,iCAAiC+hD,EAAQjB,mCAAmC+H,KAExG,KAAK,GAAgBE,KACrB,KAAK,GAAgBC,kBACrB,KAAK,GAAgBC,OACrB,KAAK,GAAgBC,MACrB,KAAK,GAAgBC,mBACjB,OAAQpH,EAAQjB,oBACZ,KAAK,GAAmBF,QACpB,OAAOF,GAAeY,gBAC1B,KAAK,GAAmBI,QACpB,OAAOhB,GAAekB,gBAC1B,QACI,MAAM,IAAI5hD,MAAM,iCAAiC+hD,EAAQjB,mCAAmC+H,KAExG,QACI,MAAM,IAAI7oD,MAAM,uBAAuB6oD,KAEnD,CDPoBO,CAAyB,GAAgBN,MAAO/G,GEa7D,IAAgCn9B,EAASnkB,EAGhB4oD,EFb5B,OEa4BA,GAHOzkC,EFZCgkC,EEYQnoD,EFZC,GAAU+a,GEahD,CAAE2d,KAAM,GAAemwB,QAAS1kC,UAAS2kC,QAAS9oD,KAGlD,SAAW4oD,EAAQzkC,QAASykC,EAAQE,QFb/C,CGVO,SAASC,GACdC,EACArzC,EACAszC,EACAC,EACA56B,EAAmB,SACnB66B,EAAW,IAAI//C,KACfggD,ErBtBK,WACH,OAAO,IAAIhgD,MAAK,IAAIA,MAAOigD,aAAY,IAAIjgD,MAAOkgD,cAAgB,GACtE,CqBoBcC,IAEZ,GAAyB,WAArBj7B,EACF,MAAM,IAAI/uB,MAAM,mCAGlB,MAAMwb,EAAY,EAAAqN,gBAAgBQ,gBAAgBjT,GAE7CszC,IACHA,EAAU,CAAEluC,cAGTmuC,IACHA,EAAS,CAAEnuC,cAGb,MAAMyuC,EAAc,IAAI,EAAA17B,YAAYQ,EAAkB3Y,GAEhDwV,EAAU,CACds+B,IAAK1K,IACL2K,IAAKP,EAASrjB,cACd6jB,IAAKP,EAAUtjB,cACfmjB,UACAC,SACAU,MAAOZ,GAGT,OAAOQ,EAAY3+C,KAAKsgB,EAC1B,CAOO,SAAS0+B,GAAiB/+B,GAC/B,MAAO,CACLA,QACAg/B,cAAc,IAAAl/B,aAAYE,GAE9B,CAUO,SAASi/B,GAAmBj/B,EAAek/B,GAChD,MAAMF,GAAe,IAAAl/B,aAAYE,GAC3BK,EAAU2+B,EAAa3+B,QAC7B,GAAuB,iBAAZA,EACT,MAAM,IAAI5rB,MAAM,2CAIlB,IAAI4rB,EAAQ0C,eAAe,aAAc1C,EAAQ89B,QAK/C,MAAM,IAAI1pD,MAAM,gCAJhB,IAAK4rB,EAAQ89B,QAAQp7B,eAAe,aAClC,MAAM,IAAItuB,MAAM,2CAOpB,IAAI4rB,EAAQ0C,eAAe,YAAa1C,EAAQ+9B,OAK9C,MAAM,IAAI3pD,MAAM,gCAJhB,IAAK4rB,EAAQ+9B,OAAOr7B,eAAe,aACjC,MAAM,IAAItuB,MAAM,2CAOpB,IAAK4rB,EAAQ0C,eAAe,SAC1B,MAAM,IAAItuB,MAAM,8BAGlB,MAAM0qD,EAAmB9+B,EAAQ+9B,OAAkCnuC,UAC7D6tC,EAAUV,GAAwB+B,GAExC,GAAID,IAAuBC,QAEpB,GAAID,IAAuBpB,EAGhC,MAAM,IAAIrpD,MAAM,8DAGlB,MAAM2qD,EAAgB,IAAI,EAAAl7B,cAAc86B,EAAar0C,OAAOqW,IAAem+B,GAC3E,IAAKC,EACH,MAAM,IAAI3qD,MAAM,0BAIlB,IADsB2qD,EAAcv/C,OAAOmgB,GAEzC,MAAM,IAAIvrB,MAAM,6BAGlB,OAAOuqD,CACT,CAWO,SAASK,GACdr/B,EACAk/B,EAAoC,MAEpC,IAAIF,EAEFA,EADEE,EACaD,GAAmBj/B,EAAOk/B,IAE1B,IAAAp/B,aAAYE,GAG7B,IAAIk+B,EAAU,CAAC,EACf,GAAIc,EAAaj8B,eAAe,WAAY,CAC1C,MAAM1C,EAAU2+B,EAAa3+B,QAC7B,GAAuB,iBAAZA,EACT,MAAM,IAAI5rB,MAAM,2CAEd4rB,EAAQ0C,eAAe,WACzBm7B,EAAU79B,EAAQy+B,MAEtB,CAEA,OAAOZ,CACT,CCvJA,SAASoB,GAAcC,EAAqBxoD,GAC1C,IAAIyoD,EAIJ,OAHIzoD,EAAK0oD,OAAS1oD,EAAK0oD,MAAMxrB,MAC3BurB,EAAWzoD,EAAK0oD,MAAMxrB,KAEjB,CACL,QAAS,UACTyrB,QAASH,EACTI,WAAY5oD,EAAK6oD,SACjBC,UAAW,OACXL,WAEJ,ELpBWrC,GAaR,KAAmB,GAAiB,CAAC,IAZrBA,GAAwB,QAAI,GAAK,UAChDA,GAAeA,GAA0B,UAAI,GAAK,YAClDA,GAAeA,GAAqC,qBAAI,GAAK,uBAC7DA,GAAeA,GAA2B,WAAI,GAAK,aACnDA,GAAeA,GAAsB,MAAI,GAAK,QAC9CA,GAAeA,GAA8B,cAAI,GAAK,gBACtDA,GAAeA,GAA0B,UAAI,GAAK,YAClDA,GAAeA,GAAmC,mBAAI,GAAK,qBAC3DA,GAAeA,GAAwB,QAAI,GAAK,UAChDA,GAAeA,GAAiC,iBAAI,GAAK,mBACzDA,GAAeA,GAAwC,wBAAI,IAAM,0BACjEA,GAAeA,GAAqC,qBAAI,IAAM,uBCHlE,GAAMxoC,eAAiB,CAAClb,KAAQokB,KAC5B,MAAMzlB,EAAIkB,EAAKnE,OAAO,EAAQsE,GAE9B,OADAokB,EAAKvJ,SAAQ9U,GAAOpH,EAAEtB,OAAO0I,KACtBpH,EAAEO,QAAQ,0BKbrB,MCCMmnD,GAAS,CAAC,QAAS,OAAQ,OAAQ,QAAS,QAC5CC,GAAa,CAAC,EACdC,GAAa,CAAC,EACpB,IAAK,IAAIxlC,EAAQ,EAAGA,EAAQslC,GAAO9qD,OAAQwlB,IAAS,CAChD,MAAMylC,EAAQH,GAAOtlC,GACrBulC,GAAWE,GAASzlC,EACpBwlC,GAAWxlC,GAASylC,CACxB,CACO,MAAM,GACT,YAAO/vC,CAAMnW,GACJ7F,KAAKgsD,UAAU,UAEpBrgC,QAAQ3P,MAAMhc,KAAKisD,WAAW,QAASpmD,GAC3C,CACA,WAAOqmD,CAAKrmD,GACH7F,KAAKgsD,UAAU,SAEpBrgC,QAAQugC,KAAKlsD,KAAKisD,WAAW,OAAQpmD,GACzC,CACA,WAAO60C,CAAK70C,GACH7F,KAAKgsD,UAAU,SAEpBrgC,QAAQpK,IAAIvhB,KAAKisD,WAAW,OAAQpmD,GACxC,CACA,YAAOsmD,CAAMtmD,GACJ7F,KAAKgsD,UAAU,UAEpBrgC,QAAQpK,IAAIvhB,KAAKisD,WAAW,QAASpmD,GACzC,CACA,iBAAOomD,CAAWF,EAAOlmD,GACrB,MAAO,IAAIkmD,EAAMxkC,kBAAkB1hB,GACvC,CACA,gBAAOmmD,CAAUD,GAEb,OADqBF,GAA0B,OACxBA,GAAWE,EACtC,ECRJ,MAAMK,GAA2C,CAC/C1yB,KAAM,SACN6I,WAAY,CACV,WAAY,CAAE7I,KAAM,SAAUoH,UAAU,GACxC,QAAS,CAAEpH,KAAM,YAOd,MAAM2yB,GAGX,WAAAjqD,CAAY4nD,EAAU,CAAC,GACrBhqD,KAAKssD,SAAW1qD,OAAOqJ,OACrB,CAAC,EACD,CACE,WAAY,sBAEd++C,EAEJ,CAEA,MAAAnL,GACE,OAAOj9C,OAAOqJ,OAAO,CAAC,EAAGjL,KAAKssD,SAChC,CAEA,OAAAC,CAAQ51C,GACN,OAAOozC,GAAiB/pD,KAAK6+C,SAAUloC,EACzC,CAEA,qBAAO61C,CAAexC,EAAczsC,GAAS,GAE3C,OADA6uC,GAAiB7uC,OAASA,EACnB,YAAmB6uC,GAAkBpC,EAC9C,CAEA,gBAAOyC,CAAU3gC,EAAek/B,EAAoC,MAClE,MAAMhB,EAAUmB,GAAer/B,EAAOk/B,GACtC,OAAO,IAAIqB,GAAQrC,EACrB,CAEA,mBAAOlL,CAAa4N,EAAoBC,GACtC,OAAOC,GAAoBF,EAAYC,EACzC,EAGF,MAAME,GAAyB,CAC7BnzB,KAAM,SACNnc,QAAQ,EACRglB,WAAY,CACV,WAAY,CAAE7I,KAAM,SAAUoH,UAAU,GACxC,QAAS,CAAEpH,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,GACnCroB,KAAM,CAAEihB,KAAM,SAAUoH,UAAU,GAClCgsB,UAAW,CAAEpzB,KAAM,SAAUoH,UAAU,GACvCisB,WAAY,CAAErzB,KAAM,SAAUoH,UAAU,GACxCksB,YAAa,CAAEtzB,KAAM,SAAUoH,UAAU,GACzCmsB,MAAO,CACLvzB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjBjhB,KAAM,CAAEihB,KAAM,SAAUoH,UAAU,GAClCosB,WAAY,CAAExzB,KAAM,SAAUoH,UAAU,MAI9CqsB,QAAS,CACPzzB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjBqG,IAAK,CAAErG,KAAM,SAAUoH,UAAU,MAIvCssB,QAAS,CACP1zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB8xB,QAAS,CAAE9xB,KAAM,SAAUoH,UAAU,GACrC2qB,WAAY,CAAE/xB,KAAM,SAAUoH,UAAU,GACxC6qB,UAAW,CAAEjyB,KAAM,SAAUoH,UAAU,GACvCwqB,SAAU,CAAE5xB,KAAM,SAAUoH,UAAU,GACtCusB,aAAc,CAAE3zB,KAAM,SAAUoH,UAAU,GAC1CwsB,eAAgB,CAAE5zB,KAAM,SAAUoH,UAAU,MAIlDysB,SAAU,CACR7zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,MAIzC0sB,MAAO,CACL9zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,MAIzC8oB,QAAS,CACPlwB,KAAM,SACNoH,UAAU,EACVyB,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB+zB,cAAe,CAAE/zB,KAAM,SAAUoH,UAAU,GAC3C4sB,gBAAiB,CAAEh0B,KAAM,SAAUoH,UAAU,GAC7C6sB,WAAY,CAAEj0B,KAAM,SAAUoH,UAAU,GACxC8sB,eAAgB,CAAEl0B,KAAM,SAAUoH,UAAU,KAGhD+sB,UAAW,CAAEn0B,KAAM,SAAUoH,UAAU,GACvCgtB,MAAO,CAAEp0B,KAAM,SAAUoH,UAAU,KAOhC,MAAMitB,WAAe1B,GAC1B,WAAAjqD,CAAY4nD,EAA+B,CAAE,QAAS,WACpDznD,MAAMynD,GACNhqD,KAAKssD,SAAW1qD,OAAOqJ,OACrB,CAAC,EACD,CACE,QAAS,UAEXjL,KAAKssD,SAET,CAEA,qBAAOE,CAAexC,EAAczsC,GAAS,GAE3C,OADAsvC,GAAuBtvC,OAASA,EACzB,YAAmB6uC,GAAkBpC,EAC9C,CAEA,gBAAOyC,CAAU3gC,EAAek/B,EAAoC,MAClE,MAAMhB,EAAUmB,GAAer/B,EAAOk/B,GACtC,OAAO,IAAI+C,GAAO/D,EACpB,CAEA,uBAAOgE,CAAiBC,GACtB,MAAMjE,EHhKH,SAAmCA,GACxC,MAAMkE,EAcF,CACF,QAAS,UAGX,GAAIlE,EAAS,CACPA,EAAQvxC,MAAQuxC,EAAQvxC,KAAK01C,YAC/BD,EAAYz1C,KAAOuxC,EAAQvxC,KAAK01C,WAG9BnE,EAAQoE,MACVF,EAAYlB,YAAchD,EAAQoE,KAGhCpE,EAAQqE,UAAYrE,EAAQqE,SAASF,YACvCD,EAAYtE,QAAU,CACpB,QAAS,gBACT8D,gBAAiB1D,EAAQqE,SAASF,YAItC,MAAMG,EAAS,GACXtE,EAAQuE,QAAUvE,EAAQuE,OAAOxuB,KACnCuuB,EAAOl8C,KAAK,CACV,QAAS,cACTqG,KAAM,SACNy0C,WAAYlD,EAAQuE,OAAOxuB,MAG3BiqB,EAAQwE,OAASxE,EAAQwE,MAAMzuB,KACjCuuB,EAAOl8C,KAAK,CACV,QAAS,cACTqG,KAAM,QACNy0C,WAAYlD,EAAQwE,MAAMzuB,MAG1BuuB,EAAOxtD,SACTotD,EAAYjB,MAAQqB,GAGlBtE,EAAQmD,UACVe,EAAYf,QAAU,CACpB,CACE,QAAS,UACTptB,IAAKiqB,EAAQmD,WAKnB,MAAMsB,EAAW,GACbzE,EAAQ0E,SAAW1E,EAAQ0E,QAAQ9E,SACrC6E,EAASr8C,KAAK,CACZ,QAAS,UACTu8C,KAAM,UACNnD,QAAS,UACTC,WAAYzB,EAAQ0E,QAAQ9E,UAG5BI,EAAQ4E,SAAW5E,EAAQ4E,QAAQlD,UACrC+C,EAASr8C,KAAKg5C,GAAc,UAAWpB,EAAQ4E,UAE7C5E,EAAQ6E,UAAY7E,EAAQ6E,SAASnD,UACvC+C,EAASr8C,KAAKg5C,GAAc,WAAYpB,EAAQ6E,WAE9C7E,EAAQ8E,QAAU9E,EAAQ8E,OAAOpD,UACnC+C,EAASr8C,KAAKg5C,GAAc,SAAUpB,EAAQ8E,SAG5C9E,EAAQ+E,MACN/E,EAAQ+E,KAAKjuD,OAAS,GACpBkpD,EAAQ+E,KAAK,IAAM/E,EAAQ+E,KAAK,GAAGC,gBACrCP,EAASr8C,KAAK,CACZ,QAAS,UACTu8C,KAAM,MACNnD,QAAS,QACTC,WAAYzB,EAAQ+E,KAAK,GAAGC,iBAKhChF,EAAQiF,KAAOjF,EAAQiF,IAAIlvB,KAC7B0uB,EAASr8C,KAAK,CACZ,QAAS,UACTu8C,KAAM,MACNnD,QAAS,MACTC,WAAYzB,EAAQiF,IAAIC,YACxBhC,WAAYlD,EAAQiF,IAAIlvB,MAI5BmuB,EAAYd,QAAUqB,CACxB,CAEA,OAAOP,CACT,CGoDoBiB,CAA0BlB,GAC1C,OAAO,IAAIF,GAAO/D,EACpB,CAEA,MAAAnL,GACE,MAAO,CACLmL,QAAShqD,KAAKgqD,UACdvxC,KAAMzY,KAAKyY,OACXq0C,UAAW9sD,KAAK8sD,YAChBC,WAAY/sD,KAAK+sD,aACjBC,YAAahtD,KAAKgtD,cAClBoC,UAAWpvD,KAAKovD,YAChBC,iBAAkBrvD,KAAKqvD,mBACvBzF,QAAS5pD,KAAK4pD,UACdiE,UAAW7tD,KAAK6tD,YAChByB,YAAatvD,KAAKsvD,cAClBC,cAAevvD,KAAKuvD,gBAExB,CAEA,OAAAvF,GACE,OAAOpoD,OAAOqJ,OAAO,CAAC,EAAGjL,KAAKssD,SAChC,CAEA,IAAA7zC,GACE,OCtNG,SAAiBuxC,GACtB,IAAKA,EACH,OAAO,KAGT,IAAIvxC,EAAO,KAYX,OAXIuxC,EAAQvxC,KACVA,EAAOuxC,EAAQvxC,MACNuxC,EAAQ8C,WAAa9C,EAAQ+C,cACtCt0C,EAAO,GACHuxC,EAAQ8C,YACVr0C,EAAOuxC,EAAQ8C,WAEb9C,EAAQ+C,aACVt0C,GAAQ,IAAIuxC,EAAQ+C,eAGjBt0C,CACT,CDoMW+2C,CAAQxvD,KAAKgqD,UACtB,CAEA,SAAA8C,GACE,OClMG,SAAsB9C,GAC3B,IAAKA,EACH,OAAO,KAGT,IAAI8C,EAAY,KAOhB,OANI9C,EAAQ8C,UACVA,EAAY9C,EAAQ8C,UACX9C,EAAQvxC,OAEjBq0C,EADkB9C,EAAQvxC,KAAKuT,MAAM,KACfrnB,MAAM,GAAI,GAAGqf,KAAK,MAEnC8oC,CACT,CDqLW2C,CAAazvD,KAAKgqD,UAC3B,CAEA,UAAA+C,GACE,OCnLG,SAAuB/C,GAC5B,IAAKA,EACH,OAAO,KAGT,IAAI+C,EAAa,KAOjB,OANI/C,EAAQ+C,WACVA,EAAa/C,EAAQ+C,WACZ/C,EAAQvxC,OAEjBs0C,EADkB/C,EAAQvxC,KAAKuT,MAAM,KACdgO,OAElB+yB,CACT,CDsKW2C,CAAc1vD,KAAKgqD,UAC5B,CAEA,WAAAgD,GACE,OCpKG,SAAwBhD,GAC7B,IAAKA,EACH,OAAO,KAGT,IAAIgD,EAAc,KAIlB,OAHIhD,EAAQgD,cACVA,EAAchD,EAAQgD,aAEjBA,CACT,CD0JW2C,CAAe3vD,KAAKgqD,UAC7B,CAEA,SAAAoF,GACE,OCxJG,SAAsBpF,GAC3B,IAAKA,EACH,OAAO,KAGT,IAAI4F,EAAkC,KAWtC,OAVI5F,EAAQiD,OACVjD,EAAQiD,MAAMp9C,KAAKo9C,GACE,WAAfA,EAAMx0C,MACRm3C,EAAmB3C,EAAMC,WAClB0C,GAEA,OAINA,CACT,CDuIWC,CAAa7vD,KAAKgqD,UAC3B,CAEA,gBAAAqF,CAAiBS,GACf,OCrIG,SAA6B9F,EAAc8F,GAChD,IAAK9F,EACH,OAAO,KAGT,MAAM+F,EAA0B,GAiChC,OAhCI/F,EAAQn7B,eAAe,YAAcihC,GACvC9F,EAAQoD,QAAQv9C,KAAKu9C,IACnB,IAAI4C,GAAiB,EACjB1E,EAAW,KAoBf,OAlBAwE,EAAcjgD,KAAIogD,IACZA,EAAaphC,eAAe,eAC9BohC,EAAa3E,SAAW2E,EAAaC,cAGrCD,EAAajsB,OACbisB,EAAazE,UAAY4B,EAAQ5B,SACjCyE,EAAaxE,aAAe2B,EAAQ3B,aACpCwE,EAAa3E,WAEb0E,GAAiB,EACjB1E,EAAW2E,EAAa3E,SACjB,OAMP0E,GACF5C,EAAQ9B,SAAWA,EACnByE,EAAiB39C,KAAKg7C,GACfA,GAEA,IACT,IAGG2C,CACT,CD8FWI,CAAoBnwD,KAAKgqD,UAAW8F,EAC7C,CAEA,OAAAlG,GACE,OCxDG,SAAoBI,GACzB,IAAKA,EACH,OAAO,KAGT,IAAIoG,EAAgB,KAEpB,GAAIpG,EAAQn7B,eAAe,WAAY,CACrC,MAAMwhC,EAAe,GAEjBrG,EAAQJ,QAAQ/6B,eAAe,kBACjCwhC,EAAaj+C,KAAK43C,EAAQJ,QAAQ6D,eAEhCzD,EAAQJ,QAAQ/6B,eAAe,oBACjCwhC,EAAaj+C,KAAK43C,EAAQJ,QAAQ8D,iBAEhC1D,EAAQJ,QAAQ/6B,eAAe,eACjCwhC,EAAaj+C,KAAK43C,EAAQJ,QAAQ+D,YAEhC3D,EAAQJ,QAAQ/6B,eAAe,mBACjCwhC,EAAaj+C,KAAK43C,EAAQJ,QAAQgE,gBAGhCyC,EAAavvD,SACfsvD,EAAgBC,EAAarsC,KAAK,MAEtC,CAEA,OAAOosC,CACT,CD2BWE,CAAWtwD,KAAKgqD,UACzB,CAEA,SAAA6D,GACE,OCzBG,SAAsB7D,GAC3B,IAAKA,EACH,OAAO,KAGT,MAAMuG,EAAa,CACjB,UACA,WACA,QACA,QACA,MACA,OACA,OACA,SACA,YACA,UACA,WACA,YAGF,IAAIC,EAAkB,KAEtB,GAAIxG,EAAQn7B,eAAe,aAAc,CACvC,MAAM0Q,EAAO,IAAIn1B,KAAK4/C,EAAQ6D,WAC9B2C,EAAkB,GAAGD,EAAWhxB,EAAKkxB,eAAelxB,EAAKmxB,cAAcnxB,EAAK+qB,eAC9E,CAEA,OAAOkG,CACT,CDHWG,CAAa3wD,KAAKgqD,UAC3B,CAEA,WAAAsF,GACE,OClFG,SAAwBtF,GAC7B,IAAKA,EACH,OAAO,KAGT,IAAIsF,EAAc,GAMlB,OAJItF,EAAQn7B,eAAe,WACzBygC,EAActF,EAAQwD,OAGjB8B,CACT,CDsEWsB,CAAe5wD,KAAKgqD,UAC7B,CAEA,aAAAuF,GACE,OCxG6BvF,EDwGLhqD,KAAKgqD,WCjG3BA,EAAQn7B,eAAe,YAClBm7B,EAAQuD,SAHY,GAHpB,KAFJ,IAA0BvD,CDyG/B,EAUK,SAAS4C,GAAoBhvB,EAAgBizB,GAClD,IAAKA,EAAa9vD,SAAS,OACzB,MAAM,IAAIR,MAAM,0BAGlB,MAAMuwD,EAAYD,EAAa7kC,MAAM,OAAO,GACtC+kC,EAAWF,EAAa7kC,MAAM,OAAO,GAAGA,MAAM,KAI9CglC,EAAW,CACfhU,QAASpf,EACTqf,KAAM,KACNiB,IAAK,CACH,CACEzlC,KAAM,aACNmgC,SAAU,GACVgF,OAAQ,EACRE,OAAQ,GAAGgT,OAXFC,EAAS,MACHA,EAASpsD,MAAM,GAAGqf,KAAK,UAiB5C,OAAO,KAAA86B,cAAakS,EAFK,6BAG3B,CAQO,SAASC,GAAgBC,GAC9B,IAAKA,EAAariC,eAAe,OAC/B,OAAO,KAET,IAAK9lB,MAAMsZ,QAAQ6uC,EAAahT,KAC9B,OAAO,KAET,GAAIgT,EAAahT,IAAIp9C,OAAS,EAC5B,OAAO,KAGT,MAAMqwD,EAAeD,EAAahT,IAAIzb,QACnC2uB,GAAgBA,EAAOviC,eAAe,WAA6B,eAAhBuiC,EAAO34C,OAG7D,GAAI04C,EAAarwD,OAAS,EACxB,OAAO,KAGT,MAAMuwD,EAAmBF,EAAa,GAEtC,IAAKE,EAAiBxiC,eAAe,UACnC,OAAO,KAET,IAAIgiC,EAAeQ,EAAiBvT,OAUpC,OARI+S,EAAaS,WAAW,UAEjBT,EAAaS,WAAW,UAGjCT,EAAe,WAAWA,KAGrBA,CACT,CASO,SAASU,GACd1mD,GApVF,MAyVE,MAAMy3C,EAAU,GAAY,SAAAz3C,EAAKy3C,SAAL,EAAgB,WACtCR,EAASlgD,OAAOqJ,OAAO,CAAC,EdvRzB,SAA2Bq3C,GAC9B,OAAIA,EAAQR,OAAOvB,MACR+B,EAAQR,OACZ,IACAQ,EAAQR,OACXvB,MAAO,KAEf,CcgRmCiR,CAAkBlP,GAAUz3C,EAAKi3C,QAElE,OAAO,IAAIh3B,SAAQ,CAACC,EAASC,KAC3B,IAAIkmC,EAAe,KACnB,IACEA,GAAe,KAAAnS,eAAcl0C,EAAKmmD,UAC7BE,EAAariC,eAAe,aAC/BqiC,EAAe,KAEnB,CAAE,MAAOv0C,GACPqO,EAAOrO,EACT,CAEA,IAAIk0C,EAA8B,KAClC,GAAIK,GAAgBtvD,OAAOuyB,KAAK+8B,GAAcpwD,OAAS,EACrD+vD,EAAeI,GAAgBC,QAE/B,IACE,OAAOnmC,EAAQgjC,GAAOC,iBAAiB/hC,KAAKC,MAAMrhB,EAAKmmD,WAAWhH,UACpE,CAAE,MAAOhuC,GACP,OAAOgP,EAAOhP,EAChB,CAGE60C,EACF/O,EACGvB,MAAMsQ,GACNvlC,MAAKw1B,GAAYA,EAAS2Q,SAC1BnmC,MAAKomC,GAAgBzlC,KAAKC,MAAMwlC,KAChCpmC,MAAKqmC,IACJ,MACM3H,EAAUmB,GADKwG,EACuB,GAAG7lC,MAAOjhB,EAAKmgD,oBAC3DjgC,EAAQi/B,EAAQ,IAEjB4H,OAAM51C,IACL,GAAOA,MACL,uDAAuD60C,MAAiB70C,KAE1EgP,EAAOhP,EAAM,KAGjB,GAAOmwC,MAAM,yDACbphC,EAAQ,CAAC,GACX,GAEJ,CEzXO,SAAS8mC,GACdb,EACAhG,EACAtoB,EACAovB,EAAmB,MAEnB,IAAIZ,EAAe,KACnB,IAEE,GADAA,GAAe,KAAAnS,eAAciS,IACxBE,EAAariC,eAAe,WAE/B,MADAqiC,EAAe,KACT,IAAI3wD,MAAM,iCAEpB,CAAE,MAAOoc,GACPgP,QAAQ3P,MAAMW,EAChB,CAEA,IAAIk0C,EAAe,KACnB,GAAIK,GAAgBtvD,OAAOuyB,KAAK+8B,GAAcpwD,OAAS,EACrD+vD,EAAeI,GAAgBC,GAc7BL,EACFiB,EAAQjB,GACLvlC,MAAMw1B,GAAkBA,EAAS2Q,SACjCnmC,MAAMomC,GAAsBzlC,KAAKC,MAAMwlC,KACvCpmC,MAAMqmC,IACL,MAEM3H,EAAUmB,GAFKwG,EACM,GAAG7lC,MACQk/B,GAEtCtoB,EAASsnB,EAAQ,IAElB4H,OAAO51C,IACN2P,QAAQugC,KAAKlwC,EAAM,KAGvB2P,QAAQugC,KAAK,4BACbxpB,EAAS,CAAC,QA/BZ,CAGE,IAAIsnB,EAAU,KACd,IACEA,EAAU/9B,KAAKC,MAAM8kC,GAErBhH,EADe+D,GAAOC,iBAAiBhE,GACtBA,SACnB,CAAE,MAAOhuC,GACP2P,QAAQugC,KAAKlwC,EACf,CACA0mB,EAASsnB,EAEX,CAoBF","sources":["webpack://StacksProfile/webpack/universalModuleDefinition","webpack://StacksProfile/webpack/runtime/create fake namespace object","webpack://StacksProfile/../../node_modules/@noble/hashes/_assert.js","webpack://StacksProfile/../../node_modules/@noble/hashes/_sha2.js","webpack://StacksProfile/../../node_modules/@noble/hashes/cryptoBrowser.js","webpack://StacksProfile/../../node_modules/@noble/hashes/hmac.js","webpack://StacksProfile/../../node_modules/@noble/hashes/sha256.js","webpack://StacksProfile/../../node_modules/@noble/hashes/utils.js","webpack://StacksProfile/../../node_modules/@noble/secp256k1/lib/index.js","webpack://StacksProfile/../../node_modules/base-x/src/index.js","webpack://StacksProfile/../../node_modules/base64-js/index.js","webpack://StacksProfile/../../node_modules/c32check/lib/address.js","webpack://StacksProfile/../../node_modules/c32check/lib/base58check.js","webpack://StacksProfile/../../node_modules/c32check/lib/checksum.js","webpack://StacksProfile/../../node_modules/c32check/lib/encoding.js","webpack://StacksProfile/../../node_modules/c32check/lib/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/base64Url.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/secp256k1.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/sha256.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/decode.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/ecdsaSigFormatter.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/errors.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/signer.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/verifier.js","webpack://StacksProfile/../../node_modules/lodash.clonedeep/index.js","webpack://StacksProfile/../../node_modules/process/browser.js","webpack://StacksProfile/../../node_modules/schema-inspector/index.js","webpack://StacksProfile/../../node_modules/schema-inspector/lib/schema-inspector.js","webpack://StacksProfile/../../node_modules/schema-inspector/node_modules/async/dist/async.js","webpack://StacksProfile/../../node_modules/zone-file/dist/index.js","webpack://StacksProfile/../../node_modules/zone-file/dist/zone-file.cjs.production.min.js","webpack://StacksProfile/webpack/bootstrap","webpack://StacksProfile/webpack/runtime/define property getters","webpack://StacksProfile/webpack/runtime/global","webpack://StacksProfile/webpack/runtime/hasOwnProperty shorthand","webpack://StacksProfile/webpack/runtime/make namespace object","webpack://StacksProfile/webpack/runtime/node module decorator","webpack://StacksProfile/../common/dist/esm/utils.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_assert.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/utils.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/cryptoBrowser.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/hmac.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_sha2.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/sha256.js","webpack://StacksProfile/../../node_modules/@noble/secp256k1/lib/esm/index.js","webpack://StacksProfile/../common/dist/esm/constants.js","webpack://StacksProfile/../common/dist/esm/fetch.js","webpack://StacksProfile/../network/dist/esm/constants.js","webpack://StacksProfile/../network/dist/esm/network.js","webpack://StacksProfile/../transactions/dist/esm/constants.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/ripemd160.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_u64.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/sha512.js","webpack://StacksProfile/../transactions/dist/esm/utils.js","webpack://StacksProfile/../transactions/dist/esm/wire/types.js","webpack://StacksProfile/../transactions/dist/esm/keys.js","webpack://StacksProfile/../transactions/dist/esm/address.js","webpack://StacksProfile/../transactions/dist/esm/wire/helpers.js","webpack://StacksProfile/./src/profileTokens.ts","webpack://StacksProfile/./src/profileSchemas/personLegacy.ts","webpack://StacksProfile/../common/dist/esm/config.js","webpack://StacksProfile/../common/dist/esm/logger.js","webpack://StacksProfile/./src/profile.ts","webpack://StacksProfile/./src/profileSchemas/personUtils.ts","webpack://StacksProfile/./src/profileSchemas/personZoneFiles.ts"],"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[\"StacksProfile\"] = factory();\n\telse\n\t\troot[\"StacksProfile\"] = factory();\n})(this, () => {\nreturn ","var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8\|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes \|\| [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.output = exports.exists = exports.hash = exports.bytes = exports.bool = exports.number = void 0;\nfunction number(n) {\n if (!Number.isSafeInteger(n) \|\| n < 0)\n throw new Error(`Wrong positive integer: ${n}`);\n}\nexports.number = number;\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`Expected boolean, not ${b}`);\n}\nexports.bool = bool;\nfunction bytes(b, ...lengths) {\n if (!(b instanceof Uint8Array))\n throw new TypeError('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new TypeError(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexports.bytes = bytes;\nfunction hash(hash) {\n if (typeof hash !== 'function' \|\| typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nexports.hash = hash;\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nexports.exists = exists;\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexports.output = output;\nconst assert = {\n number,\n bool,\n bytes,\n hash,\n exists,\n output,\n};\nexports.default = assert;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SHA2 = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nclass SHA2 extends utils_js_1.Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = (0, utils_js_1.createView)(this.buffer);\n }\n update(data) {\n _assert_js_1.default.exists(this);\n const { view, buffer, blockLen } = this;\n data = (0, utils_js_1.toBytes)(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = (0, utils_js_1.createView)(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n _assert_js_1.default.exists(this);\n _assert_js_1.default.output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024*6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = (0, utils_js_1.createView)(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\| (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\nexports.SHA2 = SHA2;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.crypto = void 0;\nexports.crypto = {\n node: undefined,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hmac = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// HMAC (RFC 2104)\nclass HMAC extends utils_js_1.Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n _assert_js_1.default.hash(hash);\n const key = (0, utils_js_1.toBytes)(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new TypeError('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n _assert_js_1.default.exists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n _assert_js_1.default.exists(this);\n _assert_js_1.default.bytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to \|\| (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/*\n HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n /\nconst hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nexports.hmac = hmac;\nexports.hmac.create = (hash, key) => new HMAC(hash, key);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha224 = exports.sha256 = void 0;\nconst _sha2_js_1 = require(\"./_sha2.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends _sha2_js_1.SHA2 {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = IV[0] \| 0;\n this.B = IV[1] \| 0;\n this.C = IV[2] \| 0;\n this.D = IV[3] \| 0;\n this.E = IV[4] \| 0;\n this.F = IV[5] \| 0;\n this.G = IV[6] \| 0;\n this.H = IV[7] \| 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = (0, utils_js_1.rotr)(W15, 7) ^ (0, utils_js_1.rotr)(W15, 18) ^ (W15 >>> 3);\n const s1 = (0, utils_js_1.rotr)(W2, 17) ^ (0, utils_js_1.rotr)(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = (0, utils_js_1.rotr)(E, 6) ^ (0, utils_js_1.rotr)(E, 11) ^ (0, utils_js_1.rotr)(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = (0, utils_js_1.rotr)(A, 2) ^ (0, utils_js_1.rotr)(A, 13) ^ (0, utils_js_1.rotr)(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 \| 0;\n this.B = 0x367cd507 \| 0;\n this.C = 0x3070dd17 \| 0;\n this.D = 0xf70e5939 \| 0;\n this.E = 0xffc00b31 \| 0;\n this.F = 0x68581511 \| 0;\n this.G = 0x64f98fa7 \| 0;\n this.H = 0xbefa4fa4 \| 0;\n this.outputLen = 28;\n }\n}\n/\n SHA2-256 hash function\n * @param message - data that would be hashed\n /\nexports.sha256 = (0, utils_js_1.wrapConstructor)(() => new SHA256());\nexports.sha224 = (0, utils_js_1.wrapConstructor)(() => new SHA224());\n","\"use strict\";\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = exports.wrapConstructorWithOpts = exports.wrapConstructor = exports.checkOpts = exports.Hash = exports.concatBytes = exports.toBytes = exports.utf8ToBytes = exports.asyncLoop = exports.nextTick = exports.hexToBytes = exports.bytesToHex = exports.isLE = exports.rotr = exports.createView = exports.u32 = exports.u8 = void 0;\n// The import here is via the package name. This is to ensure\n// that exports mapping/resolution does fall into place.\nconst crypto_1 = require(\"@noble/hashes/crypto\");\n// Cast array to different type\nconst u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.u8 = u8;\nconst u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\nexports.u32 = u32;\n// Cast array to view\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.createView = createView;\n// The rotate right (circular right shift) operation for uint32\nconst rotr = (word, shift) => (word << (32 - shift)) \| (word >>> shift);\nexports.rotr = rotr;\nexports.isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// There is almost no big endian hardware, but js typed arrays uses platform specific endianness.\n// So, just to be sure not to corrupt anything.\nif (!exports.isLE)\n throw new Error('Non little-endian hardware is not supported');\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/\n @example bytesToHex(Uint8Array.from([0xde, 0xad, 0xbe, 0xef]))\n /\nfunction bytesToHex(uint8a) {\n // pre-caching improves the speed 6x\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nexports.bytesToHex = bytesToHex;\n/\n @example hexToBytes('deadbeef')\n /\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex');\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nexports.hexToBytes = hexToBytes;\n// There is no setImmediate in browser and setTimeout is slow. However, call to async function will return Promise\n// which will be fullfiled only on next scheduler queue processing step and this is exactly what we need.\nconst nextTick = async () => { };\nexports.nextTick = nextTick;\n// Returns control to thread each 'tick' ms to avoid blocking\nasync function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await (0, exports.nextTick)();\n ts += diff;\n }\n}\nexports.asyncLoop = asyncLoop;\nfunction utf8ToBytes(str) {\n if (typeof str !== 'string') {\n throw new TypeError(`utf8ToBytes expected string, got ${typeof str}`);\n }\n return new TextEncoder().encode(str);\n}\nexports.utf8ToBytes = utf8ToBytes;\nfunction toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n if (!(data instanceof Uint8Array))\n throw new TypeError(`Expected input type is Uint8Array (got ${typeof data})`);\n return data;\n}\nexports.toBytes = toBytes;\n/*\n Concats Uint8Array-s into one; like `Buffer.concat([buf1, buf2])`\n * @example concatBytes(buf1, buf2)\n /\nfunction concatBytes(...arrays) {\n if (!arrays.every((a) => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nexports.concatBytes = concatBytes;\n// For runtime check if class implements interface\nclass Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\nexports.Hash = Hash;\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj) => Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\nfunction checkOpts(defaults, opts) {\n if (opts !== undefined && (typeof opts !== 'object' \|\| !isPlainObject(opts)))\n throw new TypeError('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexports.checkOpts = checkOpts;\nfunction wrapConstructor(hashConstructor) {\n const hashC = (message) => hashConstructor().update(toBytes(message)).digest();\n const tmp = hashConstructor();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashConstructor();\n return hashC;\n}\nexports.wrapConstructor = wrapConstructor;\nfunction wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexports.wrapConstructorWithOpts = wrapConstructorWithOpts;\n/\n Secure PRNG\n /\nfunction randomBytes(bytesLength = 32) {\n if (crypto_1.crypto.web) {\n return crypto_1.crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto_1.crypto.node) {\n return new Uint8Array(crypto_1.crypto.node.randomBytes(bytesLength).buffer);\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n}\nexports.randomBytes = randomBytes;\n","\"use strict\";\n/! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) /\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.utils = exports.schnorr = exports.verify = exports.signSync = exports.sign = exports.getSharedSecret = exports.recoverPublicKey = exports.getPublicKey = exports.Signature = exports.Point = exports.CURVE = void 0;\nconst nodeCrypto = require(\"crypto\");\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nexports.CURVE = CURVE;\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 \|\| k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n \|\| Y2 === _0n)\n return this;\n if (X1 === _0n \|\| Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n \|\| k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) \|\| 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 (W - 1);\n const mask = BigInt(2 W - 1);\n const maxNumber = 2 W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nclass Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 \|\| header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 \|\| recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) \|\| !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n \|\| a === _1n \|\| this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nexports.Point = Point;\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 \|\| data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len \|\| res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 \|\| data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nclass Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nexports.Signature = Signature;\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res = res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n \|\| modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' \|\| hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' \|\| qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return exports.utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) \| Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nfunction getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexports.getPublicKey = getPublicKey;\nfunction recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nexports.recoverPublicKey = recoverPublicKey;\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr \|\| str) && item.length;\n if (arr)\n return len === compressedLen \|\| len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 \|\| len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nfunction getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nexports.getSharedSecret = getSharedSecret;\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = exports.utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nexports.sign = sign;\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexports.signSync = signSync;\nconst vopts = { strict: true };\nfunction verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nexports.verify = verify;\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) \|\| !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = exports.utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = exports.utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = exports.utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R \|\| !R.hasEvenY() \|\| R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await exports.utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(exports.utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexports.schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexports.utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen \|\| hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => exports.utils.hashToPrivateKey(exports.utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await exports.utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return exports.utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(exports.utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 \|\| i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 \|\| i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) \|\n (revLookup[b64.charCodeAt(i + 1)] << 12) \|\n (revLookup[b64.charCodeAt(i + 2)] << 6) \|\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) \|\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) \|\n (revLookup[b64.charCodeAt(i + 1)] << 4) \|\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32ToB58 = exports.b58ToC32 = exports.c32addressDecode = exports.c32address = exports.versions = void 0;\nconst checksum_1 = require(\"./checksum\");\nconst base58check = require(\"./base58check\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nexports.versions = {\n mainnet: {\n p2pkh: 22,\n p2sh: 20, // 'M'\n },\n testnet: {\n p2pkh: 26,\n p2sh: 21, // 'N'\n },\n};\n// address conversion : bitcoin to stacks\nconst ADDR_BITCOIN_TO_STACKS = {};\nADDR_BITCOIN_TO_STACKS[0] = exports.versions.mainnet.p2pkh;\nADDR_BITCOIN_TO_STACKS[5] = exports.versions.mainnet.p2sh;\nADDR_BITCOIN_TO_STACKS[111] = exports.versions.testnet.p2pkh;\nADDR_BITCOIN_TO_STACKS[196] = exports.versions.testnet.p2sh;\n// address conversion : stacks to bitcoin\nconst ADDR_STACKS_TO_BITCOIN = {};\nADDR_STACKS_TO_BITCOIN[exports.versions.mainnet.p2pkh] = 0;\nADDR_STACKS_TO_BITCOIN[exports.versions.mainnet.p2sh] = 5;\nADDR_STACKS_TO_BITCOIN[exports.versions.testnet.p2pkh] = 111;\nADDR_STACKS_TO_BITCOIN[exports.versions.testnet.p2sh] = 196;\n/*\n Make a c32check address with the given version and hash160\n * The only difference between a c32check string and c32 address\n * is that the letter 'S' is pre-pended.\n * @param {number} version - the address version number\n * @param {string} hash160hex - the hash160 to encode (must be a hash160)\n * @returns {string} the address\n /\nfunction c32address(version, hash160hex) {\n if (!hash160hex.match(/^[0-9a-fA-F]{40}$/)) {\n throw new Error('Invalid argument: not a hash160 hex string');\n }\n const c32string = (0, checksum_1.c32checkEncode)(version, hash160hex);\n return `S${c32string}`;\n}\nexports.c32address = c32address;\n/\n Decode a c32 address into its version and hash160\n * @param {string} c32addr - the c32check-encoded address\n * @returns {[number, string]} a tuple with the version and hash160\n /\nfunction c32addressDecode(c32addr) {\n if (c32addr.length <= 5) {\n throw new Error('Invalid c32 address: invalid length');\n }\n if (c32addr[0] != 'S') {\n throw new Error('Invalid c32 address: must start with \"S\"');\n }\n return (0, checksum_1.c32checkDecode)(c32addr.slice(1));\n}\nexports.c32addressDecode = c32addressDecode;\n/\n * Convert a base58check address to a c32check address.\n * Try to convert the version number if one is not given.\n * @param {string} b58check - the base58check encoded address\n * @param {number} version - the version number, if not inferred from the address\n * @returns {string} the c32 address with the given version number (or the\n * semantically-equivalent c32 version number, if not given)\n /\nfunction b58ToC32(b58check, version = -1) {\n const addrInfo = base58check.decode(b58check);\n const hash160String = (0, utils_1.bytesToHex)(addrInfo.data);\n const addrVersion = parseInt((0, utils_1.bytesToHex)(addrInfo.prefix), 16);\n let stacksVersion;\n if (version < 0) {\n stacksVersion = addrVersion;\n if (ADDR_BITCOIN_TO_STACKS[addrVersion] !== undefined) {\n stacksVersion = ADDR_BITCOIN_TO_STACKS[addrVersion];\n }\n }\n else {\n stacksVersion = version;\n }\n return c32address(stacksVersion, hash160String);\n}\nexports.b58ToC32 = b58ToC32;\n/\n * Convert a c32check address to a base58check address.\n * @param {string} c32string - the c32check address\n * @param {number} version - the version number, if not inferred from the address\n * @returns {string} the base58 address with the given version number (or the\n * semantically-equivalent bitcoin version number, if not given)\n /\nfunction c32ToB58(c32string, version = -1) {\n const addrInfo = c32addressDecode(c32string);\n const stacksVersion = addrInfo[0];\n const hash160String = addrInfo[1];\n let bitcoinVersion;\n if (version < 0) {\n bitcoinVersion = stacksVersion;\n if (ADDR_STACKS_TO_BITCOIN[stacksVersion] !== undefined) {\n bitcoinVersion = ADDR_STACKS_TO_BITCOIN[stacksVersion];\n }\n }\n else {\n bitcoinVersion = version;\n }\n let prefix = bitcoinVersion.toString(16);\n if (prefix.length === 1) {\n prefix = `0${prefix}`;\n }\n return base58check.encode(hash160String, prefix);\n}\nexports.c32ToB58 = c32ToB58;\n","/\n * From https://github.com/wzbg/base58check\n * @Author: zyc\n * @Date: 2016-09-11 23:36:05\n /\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decode = exports.encode = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst basex = require(\"base-x\");\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\nfunction encode(data, prefix = '00') {\n const dataBytes = typeof data === 'string' ? (0, utils_1.hexToBytes)(data) : data;\n const prefixBytes = typeof prefix === 'string' ? (0, utils_1.hexToBytes)(prefix) : data;\n if (!(dataBytes instanceof Uint8Array) \|\| !(prefixBytes instanceof Uint8Array)) {\n throw new TypeError('Argument must be of type Uint8Array or string');\n }\n const checksum = (0, sha256_1.sha256)((0, sha256_1.sha256)(new Uint8Array([...prefixBytes, ...dataBytes])));\n return basex(ALPHABET).encode([...prefixBytes, ...dataBytes, ...checksum.slice(0, 4)]);\n}\nexports.encode = encode;\nfunction decode(string) {\n const bytes = basex(ALPHABET).decode(string);\n const prefixBytes = bytes.slice(0, 1);\n const dataBytes = bytes.slice(1, -4);\n // todo: for better performance replace spread with `concatBytes` method\n const checksum = (0, sha256_1.sha256)((0, sha256_1.sha256)(new Uint8Array([...prefixBytes, ...dataBytes])));\n bytes.slice(-4).forEach((check, index) => {\n if (check !== checksum[index]) {\n throw new Error('Invalid checksum');\n }\n });\n return { prefix: prefixBytes, data: dataBytes };\n}\nexports.decode = decode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32checkDecode = exports.c32checkEncode = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst encoding_1 = require(\"./encoding\");\n/\n Get the c32check checksum of a hex-encoded string\n * @param {string} dataHex - the hex string\n * @returns {string} the c32 checksum, as a bin-encoded string\n /\nfunction c32checksum(dataHex) {\n const dataHash = (0, sha256_1.sha256)((0, sha256_1.sha256)((0, utils_1.hexToBytes)(dataHex)));\n const checksum = (0, utils_1.bytesToHex)(dataHash.slice(0, 4));\n return checksum;\n}\n/\n Encode a hex string as a c32check string. This is a lot like how\n * base58check works in Bitcoin-land, but this algorithm uses the\n * z-base-32 alphabet instead of the base58 alphabet. The algorithm\n * is as follows:\n * * calculate the c32checksum of version + data\n * * c32encode version + data + c32checksum\n * @param {number} version - the version string (between 0 and 31)\n * @param {string} data - the data to encode\n * @returns {string} the c32check representation\n /\nfunction c32checkEncode(version, data) {\n if (version < 0 \|\| version >= 32) {\n throw new Error('Invalid version (must be between 0 and 31)');\n }\n if (!data.match(/^[0-9a-fA-F]$/)) {\n throw new Error('Invalid data (not a hex string)');\n }\n data = data.toLowerCase();\n if (data.length % 2 !== 0) {\n data = `0${data}`;\n }\n let versionHex = version.toString(16);\n if (versionHex.length === 1) {\n versionHex = `0${versionHex}`;\n }\n const checksumHex = c32checksum(`${versionHex}${data}`);\n const c32str = (0, encoding_1.c32encode)(`${data}${checksumHex}`);\n return `${encoding_1.c32[version]}${c32str}`;\n}\nexports.c32checkEncode = c32checkEncode;\n/\n Decode a c32check string back into its version and data payload. This is\n * a lot like how base58check works in Bitcoin-land, but this algorithm uses\n * the z-base-32 alphabet instead of the base58 alphabet. The algorithm\n * is as follows:\n * * extract the version, data, and checksum\n * * verify the checksum matches c32checksum(version + data)\n * * return data\n * @param {string} c32data - the c32check-encoded string\n * @returns {array} [version (number), data (string)]. The returned data\n * will be a hex string. Throws an exception if the checksum does not match.\n /\nfunction c32checkDecode(c32data) {\n c32data = (0, encoding_1.c32normalize)(c32data);\n const dataHex = (0, encoding_1.c32decode)(c32data.slice(1));\n const versionChar = c32data[0];\n const version = encoding_1.c32.indexOf(versionChar);\n const checksum = dataHex.slice(-8);\n let versionHex = version.toString(16);\n if (versionHex.length === 1) {\n versionHex = `0${versionHex}`;\n }\n if (c32checksum(`${versionHex}${dataHex.substring(0, dataHex.length - 8)}`) !== checksum) {\n throw new Error('Invalid c32check string: checksum mismatch');\n }\n return [version, dataHex.substring(0, dataHex.length - 8)];\n}\nexports.c32checkDecode = c32checkDecode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32decode = exports.c32normalize = exports.c32encode = exports.c32 = void 0;\nconst utils_1 = require(\"@noble/hashes/utils\");\nexports.c32 = '0123456789ABCDEFGHJKMNPQRSTVWXYZ';\nconst hex = '0123456789abcdef';\n/\n Encode a hex string as a c32 string. Note that the hex string is assumed\n * to be big-endian (and the resulting c32 string will be as well).\n * @param {string} inputHex - the input to encode\n * @param {number} minLength - the minimum length of the c32 string\n * @returns {string} the c32check-encoded representation of the data, as a string\n /\nfunction c32encode(inputHex, minLength) {\n // must be hex\n if (!inputHex.match(/^[0-9a-fA-F]$/)) {\n throw new Error('Not a hex-encoded string');\n }\n if (inputHex.length % 2 !== 0) {\n inputHex = `0${inputHex}`;\n }\n inputHex = inputHex.toLowerCase();\n let res = [];\n let carry = 0;\n for (let i = inputHex.length - 1; i >= 0; i--) {\n if (carry < 4) {\n const currentCode = hex.indexOf(inputHex[i]) >> carry;\n let nextCode = 0;\n if (i !== 0) {\n nextCode = hex.indexOf(inputHex[i - 1]);\n }\n // carry = 0, nextBits is 1, carry = 1, nextBits is 2\n const nextBits = 1 + carry;\n const nextLowBits = nextCode % (1 << nextBits) << (5 - nextBits);\n const curC32Digit = exports.c32[currentCode + nextLowBits];\n carry = nextBits;\n res.unshift(curC32Digit);\n }\n else {\n carry = 0;\n }\n }\n let C32leadingZeros = 0;\n for (let i = 0; i < res.length; i++) {\n if (res[i] !== '0') {\n break;\n }\n else {\n C32leadingZeros++;\n }\n }\n res = res.slice(C32leadingZeros);\n const zeroPrefix = new TextDecoder().decode((0, utils_1.hexToBytes)(inputHex)).match(/^\\u0000/);\n const numLeadingZeroBytesInHex = zeroPrefix ? zeroPrefix[0].length : 0;\n for (let i = 0; i < numLeadingZeroBytesInHex; i++) {\n res.unshift(exports.c32[0]);\n }\n if (minLength) {\n const count = minLength - res.length;\n for (let i = 0; i < count; i++) {\n res.unshift(exports.c32[0]);\n }\n }\n return res.join('');\n}\nexports.c32encode = c32encode;\n/\n * Normalize a c32 string\n * @param {string} c32input - the c32-encoded input string\n * @returns {string} the canonical representation of the c32 input string\n /\nfunction c32normalize(c32input) {\n // must be upper-case\n // replace all O's with 0's\n // replace all I's and L's with 1's\n return c32input.toUpperCase().replace(/O/g, '0').replace(/L\|I/g, '1');\n}\nexports.c32normalize = c32normalize;\n/\n * Decode a c32 string back into a hex string. Note that the c32 input\n * string is assumed to be big-endian (and the resulting hex string will\n * be as well).\n * @param {string} c32input - the c32-encoded input to decode\n * @param {number} minLength - the minimum length of the output hex string (in bytes)\n * @returns {string} the hex-encoded representation of the data, as a string\n /\nfunction c32decode(c32input, minLength) {\n c32input = c32normalize(c32input);\n // must result in a c32 string\n if (!c32input.match(`^[${exports.c32}]$`)) {\n throw new Error('Not a c32-encoded string');\n }\n const zeroPrefix = c32input.match(`^${exports.c32[0]}`);\n const numLeadingZeroBytes = zeroPrefix ? zeroPrefix[0].length : 0;\n let res = [];\n let carry = 0;\n let carryBits = 0;\n for (let i = c32input.length - 1; i >= 0; i--) {\n if (carryBits === 4) {\n res.unshift(hex[carry]);\n carryBits = 0;\n carry = 0;\n }\n const currentCode = exports.c32.indexOf(c32input[i]) << carryBits;\n const currentValue = currentCode + carry;\n const currentHexDigit = hex[currentValue % 16];\n carryBits += 1;\n carry = currentValue >> 4;\n if (carry > 1 << carryBits) {\n throw new Error('Panic error in decoding.');\n }\n res.unshift(currentHexDigit);\n }\n // one last carry\n res.unshift(hex[carry]);\n if (res.length % 2 === 1) {\n res.unshift('0');\n }\n let hexLeadingZeros = 0;\n for (let i = 0; i < res.length; i++) {\n if (res[i] !== '0') {\n break;\n }\n else {\n hexLeadingZeros++;\n }\n }\n res = res.slice(hexLeadingZeros - (hexLeadingZeros % 2));\n let hexStr = res.join('');\n for (let i = 0; i < numLeadingZeroBytes; i++) {\n hexStr = `00${hexStr}`;\n }\n if (minLength) {\n const count = minLength 2 - hexStr.length;\n for (let i = 0; i < count; i += 2) {\n hexStr = `00${hexStr}`;\n }\n }\n return hexStr;\n}\nexports.c32decode = c32decode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.b58ToC32 = exports.c32ToB58 = exports.versions = exports.c32normalize = exports.c32addressDecode = exports.c32address = exports.c32checkDecode = exports.c32checkEncode = exports.c32decode = exports.c32encode = void 0;\nconst encoding_1 = require(\"./encoding\");\nObject.defineProperty(exports, \"c32encode\", { enumerable: true, get: function () { return encoding_1.c32encode; } });\nObject.defineProperty(exports, \"c32decode\", { enumerable: true, get: function () { return encoding_1.c32decode; } });\nObject.defineProperty(exports, \"c32normalize\", { enumerable: true, get: function () { return encoding_1.c32normalize; } });\nconst checksum_1 = require(\"./checksum\");\nObject.defineProperty(exports, \"c32checkEncode\", { enumerable: true, get: function () { return checksum_1.c32checkEncode; } });\nObject.defineProperty(exports, \"c32checkDecode\", { enumerable: true, get: function () { return checksum_1.c32checkDecode; } });\nconst address_1 = require(\"./address\");\nObject.defineProperty(exports, \"c32address\", { enumerable: true, get: function () { return address_1.c32address; } });\nObject.defineProperty(exports, \"c32addressDecode\", { enumerable: true, get: function () { return address_1.c32addressDecode; } });\nObject.defineProperty(exports, \"c32ToB58\", { enumerable: true, get: function () { return address_1.c32ToB58; } });\nObject.defineProperty(exports, \"b58ToC32\", { enumerable: true, get: function () { return address_1.b58ToC32; } });\nObject.defineProperty(exports, \"versions\", { enumerable: true, get: function () { return address_1.versions; } });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decode = exports.encode = exports.unescape = exports.escape = exports.pad = void 0;\nconst base64_js_1 = require(\"base64-js\");\nfunction pad(base64) {\n return `${base64}${'='.repeat(4 - (base64.length % 4 \|\| 4))}`;\n}\nexports.pad = pad;\nfunction escape(base64) {\n return base64.replace(/=/g, '').replace(/\\+/g, '-').replace(/\\//g, '_');\n}\nexports.escape = escape;\nfunction unescape(base64Url) {\n return pad(base64Url).replace(/-/g, '+').replace(/_/g, '/');\n}\nexports.unescape = unescape;\nfunction encode(base64) {\n return escape((0, base64_js_1.fromByteArray)(new TextEncoder().encode(base64)));\n}\nexports.encode = encode;\nfunction decode(base64Url) {\n return new TextDecoder().decode((0, base64_js_1.toByteArray)(pad(unescape(base64Url))));\n}\nexports.decode = decode;\n//# sourceMappingURL=base64Url.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.cryptoClients = exports.SECP256K1Client = void 0;\nconst secp256k1_1 = require(\"./secp256k1\");\nObject.defineProperty(exports, \"SECP256K1Client\", { enumerable: true, get: function () { return secp256k1_1.SECP256K1Client; } });\nconst cryptoClients = {\n ES256K: secp256k1_1.SECP256K1Client,\n};\nexports.cryptoClients = cryptoClients;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SECP256K1Client = void 0;\nconst hmac_1 = require(\"@noble/hashes/hmac\");\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst secp = require(\"@noble/secp256k1\");\nconst ecdsaSigFormatter_1 = require(\"../ecdsaSigFormatter\");\nconst errors_1 = require(\"../errors\");\nconst utils_1 = require(\"@noble/hashes/utils\");\n// required to use noble secp https://github.com/paulmillr/noble-secp256k1\nsecp.utils.hmacSha256Sync = (key, ...msgs) => {\n const h = hmac_1.hmac.create(sha256_1.sha256, key);\n msgs.forEach(msg => h.update(msg));\n return h.digest();\n};\nclass SECP256K1Client {\n static derivePublicKey(privateKey, compressed = true) {\n if (privateKey.length === 66) {\n privateKey = privateKey.slice(0, 64);\n }\n if (privateKey.length < 64) {\n // backward compatibly accept too short private keys\n privateKey = privateKey.padStart(64, '0');\n }\n return (0, utils_1.bytesToHex)(secp.getPublicKey(privateKey, compressed));\n }\n static signHash(signingInputHash, privateKey, format = 'jose') {\n // make sure the required parameters are provided\n if (!signingInputHash \|\| !privateKey) {\n throw new errors_1.MissingParametersError('a signing input hash and private key are all required');\n }\n const derSignature = secp.signSync(signingInputHash, privateKey.slice(0, 64), {\n der: true,\n canonical: false,\n });\n if (format === 'der')\n return (0, utils_1.bytesToHex)(derSignature);\n if (format === 'jose')\n return (0, ecdsaSigFormatter_1.derToJose)(derSignature, 'ES256');\n throw Error('Invalid signature format');\n }\n static loadSignature(joseSignature) {\n // create and return the DER-formatted signature bytes\n return (0, ecdsaSigFormatter_1.joseToDer)(joseSignature, 'ES256');\n }\n static verifyHash(signingInputHash, derSignatureBytes, publicKey) {\n // make sure the required parameters are provided\n if (!signingInputHash \|\| !derSignatureBytes \|\| !publicKey) {\n throw new errors_1.MissingParametersError('a signing input hash, der signature, and public key are all required');\n }\n return secp.verify(derSignatureBytes, signingInputHash, publicKey, { strict: false });\n }\n}\nexports.SECP256K1Client = SECP256K1Client;\nSECP256K1Client.algorithmName = 'ES256K';\n//# sourceMappingURL=secp256k1.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) \|\| function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P \|\| (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments \|\| [])).next());\n });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hashSha256Async = exports.hashSha256 = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nfunction hashSha256(input) {\n return (0, sha256_1.sha256)(input);\n}\nexports.hashSha256 = hashSha256;\nfunction hashSha256Async(input) {\n return __awaiter(this, void 0, void 0, function* () {\n try {\n const isSubtleCryptoAvailable = typeof crypto !== 'undefined' && typeof crypto.subtle !== 'undefined';\n if (isSubtleCryptoAvailable) {\n // Use the W3C Web Crypto API if available (running in a web browser).\n const bytes = typeof input === 'string' ? new TextEncoder().encode(input) : input;\n const hash = yield crypto.subtle.digest('SHA-256', bytes);\n return new Uint8Array(hash);\n }\n else {\n // Otherwise try loading the Node.js `crypto` module (running in Node.js, or an older browser with a polyfill).\n const nodeCrypto = require('crypto');\n if (!nodeCrypto.createHash) {\n throw new Error('`crypto` module does not contain `createHash`');\n }\n return Promise.resolve(nodeCrypto.createHash('sha256').update(input).digest());\n }\n }\n catch (error) {\n console.log(error);\n console.log('Crypto lib not found. Neither the global `crypto.subtle` Web Crypto API, ' +\n 'nor the or the Node.js `require(\"crypto\").createHash` module is available. ' +\n 'Falling back to JS implementation.');\n return Promise.resolve(hashSha256(input));\n }\n });\n}\nexports.hashSha256Async = hashSha256Async;\n//# sourceMappingURL=sha256.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeToken = void 0;\nconst base64url = require(\"./base64Url\");\nfunction decodeToken(token) {\n if (typeof token === 'string') {\n // decompose the token into parts\n const tokenParts = token.split('.');\n const header = JSON.parse(base64url.decode(tokenParts[0]));\n const payload = JSON.parse(base64url.decode(tokenParts[1]));\n const signature = tokenParts[2];\n // return the token object\n return {\n header: header,\n payload: payload,\n signature: signature,\n };\n }\n else if (typeof token === 'object') {\n if (typeof token.payload !== 'string') {\n throw new Error('Expected token payload to be a base64 or json string');\n }\n let payload = token.payload;\n if (token.payload[0] !== '{') {\n payload = base64url.decode(payload);\n }\n const allHeaders = [];\n token.header.map((headerValue) => {\n const header = JSON.parse(base64url.decode(headerValue));\n allHeaders.push(header);\n });\n return {\n header: allHeaders,\n payload: JSON.parse(payload),\n signature: token.signature,\n };\n }\n}\nexports.decodeToken = decodeToken;\n//# sourceMappingURL=decode.js.map","\"use strict\";\n// NOTICE\n// Copyright 2015 D2L Corporation\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.joseToDer = exports.derToJose = void 0;\n// The following code is adapted from https://github.com/Brightspace/node-ecdsa-sig-formatter\nconst base64_js_1 = require(\"base64-js\");\nconst base64Url_1 = require(\"./base64Url\");\nfunction getParamSize(keySize) {\n return ((keySize / 8) \| 0) + (keySize % 8 === 0 ? 0 : 1);\n}\nconst paramBytesForAlg = {\n ES256: getParamSize(256),\n ES384: getParamSize(384),\n ES512: getParamSize(521),\n};\nfunction getParamBytesForAlg(alg) {\n const paramBytes = paramBytesForAlg[alg];\n if (paramBytes) {\n return paramBytes;\n }\n throw new Error(`Unknown algorithm \"${alg}\"`);\n}\nconst MAX_OCTET = 0x80;\nconst CLASS_UNIVERSAL = 0;\nconst PRIMITIVE_BIT = 0x20;\nconst TAG_SEQ = 0x10;\nconst TAG_INT = 0x02;\nconst ENCODED_TAG_SEQ = TAG_SEQ \| PRIMITIVE_BIT \| (CLASS_UNIVERSAL << 6);\nconst ENCODED_TAG_INT = TAG_INT \| (CLASS_UNIVERSAL << 6);\nfunction signatureAsBytes(signature) {\n if (signature instanceof Uint8Array) {\n return signature;\n }\n else if ('string' === typeof signature) {\n return (0, base64_js_1.toByteArray)((0, base64Url_1.pad)(signature));\n }\n throw new TypeError('ECDSA signature must be a Base64 string or a Uint8Array');\n}\nfunction derToJose(signature, alg) {\n const signatureBytes = signatureAsBytes(signature);\n const paramBytes = getParamBytesForAlg(alg);\n // the DER encoded param should at most be the param size, plus a padding\n // zero, since due to being a signed integer\n const maxEncodedParamLength = paramBytes + 1;\n const inputLength = signatureBytes.length;\n let offset = 0;\n if (signatureBytes[offset++] !== ENCODED_TAG_SEQ) {\n throw new Error('Could not find expected \"seq\"');\n }\n let seqLength = signatureBytes[offset++];\n if (seqLength === (MAX_OCTET \| 1)) {\n seqLength = signatureBytes[offset++];\n }\n if (inputLength - offset < seqLength) {\n throw new Error(`\"seq\" specified length of \"${seqLength}\", only \"${inputLength - offset}\" remaining`);\n }\n if (signatureBytes[offset++] !== ENCODED_TAG_INT) {\n throw new Error('Could not find expected \"int\" for \"r\"');\n }\n const rLength = signatureBytes[offset++];\n if (inputLength - offset - 2 < rLength) {\n throw new Error(`\"r\" specified length of \"${rLength}\", only \"${inputLength - offset - 2}\" available`);\n }\n if (maxEncodedParamLength < rLength) {\n throw new Error(`\"r\" specified length of \"${rLength}\", max of \"${maxEncodedParamLength}\" is acceptable`);\n }\n const rOffset = offset;\n offset += rLength;\n if (signatureBytes[offset++] !== ENCODED_TAG_INT) {\n throw new Error('Could not find expected \"int\" for \"s\"');\n }\n const sLength = signatureBytes[offset++];\n if (inputLength - offset !== sLength) {\n throw new Error(`\"s\" specified length of \"${sLength}\", expected \"${inputLength - offset}\"`);\n }\n if (maxEncodedParamLength < sLength) {\n throw new Error(`\"s\" specified length of \"${sLength}\", max of \"${maxEncodedParamLength}\" is acceptable`);\n }\n const sOffset = offset;\n offset += sLength;\n if (offset !== inputLength) {\n throw new Error(`Expected to consume entire array, but \"${inputLength - offset}\" bytes remain`);\n }\n const rPadding = paramBytes - rLength;\n const sPadding = paramBytes - sLength;\n const dst = new Uint8Array(rPadding + rLength + sPadding + sLength);\n for (offset = 0; offset < rPadding; ++offset) {\n dst[offset] = 0;\n }\n dst.set(signatureBytes.subarray(rOffset + Math.max(-rPadding, 0), rOffset + rLength), offset);\n offset = paramBytes;\n for (const o = offset; offset < o + sPadding; ++offset) {\n dst[offset] = 0;\n }\n dst.set(signatureBytes.subarray(sOffset + Math.max(-sPadding, 0), sOffset + sLength), offset);\n return (0, base64Url_1.escape)((0, base64_js_1.fromByteArray)(dst));\n}\nexports.derToJose = derToJose;\nfunction countPadding(buf, start, stop) {\n let padding = 0;\n while (start + padding < stop && buf[start + padding] === 0) {\n ++padding;\n }\n const needsSign = buf[start + padding] >= MAX_OCTET;\n if (needsSign) {\n --padding;\n }\n return padding;\n}\nfunction joseToDer(signature, alg) {\n signature = signatureAsBytes(signature);\n const paramBytes = getParamBytesForAlg(alg);\n const signatureBytes = signature.length;\n if (signatureBytes !== paramBytes * 2) {\n throw new TypeError(`\"${alg}\" signatures must be \"${paramBytes * 2}\" bytes, saw \"${signatureBytes}\"`);\n }\n const rPadding = countPadding(signature, 0, paramBytes);\n const sPadding = countPadding(signature, paramBytes, signature.length);\n const rLength = paramBytes - rPadding;\n const sLength = paramBytes - sPadding;\n const rsBytes = 1 + 1 + rLength + 1 + 1 + sLength;\n const shortLength = rsBytes < MAX_OCTET;\n const dst = new Uint8Array((shortLength ? 2 : 3) + rsBytes);\n let offset = 0;\n dst[offset++] = ENCODED_TAG_SEQ;\n if (shortLength) {\n // Bit 8 has value \"0\"\n // bits 7-1 give the length.\n dst[offset++] = rsBytes;\n }\n else {\n // Bit 8 of first octet has value \"1\"\n // bits 7-1 give the number of additional length octets.\n dst[offset++] = MAX_OCTET \| 1;\n // length, base 256\n dst[offset++] = rsBytes & 0xff;\n }\n dst[offset++] = ENCODED_TAG_INT;\n dst[offset++] = rLength;\n if (rPadding < 0) {\n dst[offset++] = 0;\n dst.set(signature.subarray(0, paramBytes), offset);\n offset += paramBytes;\n }\n else {\n dst.set(signature.subarray(rPadding, paramBytes), offset);\n offset += paramBytes - rPadding;\n }\n dst[offset++] = ENCODED_TAG_INT;\n dst[offset++] = sLength;\n if (sPadding < 0) {\n dst[offset++] = 0;\n dst.set(signature.subarray(paramBytes), offset);\n }\n else {\n dst.set(signature.subarray(paramBytes + sPadding), offset);\n }\n return dst;\n}\nexports.joseToDer = joseToDer;\n//# sourceMappingURL=ecdsaSigFormatter.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InvalidTokenError = exports.MissingParametersError = void 0;\nclass MissingParametersError extends Error {\n constructor(message) {\n super();\n this.name = 'MissingParametersError';\n this.message = message \|\| '';\n }\n}\nexports.MissingParametersError = MissingParametersError;\nclass InvalidTokenError extends Error {\n constructor(message) {\n super();\n this.name = 'InvalidTokenError';\n this.message = message \|\| '';\n }\n}\nexports.InvalidTokenError = InvalidTokenError;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) \|\| (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc \|\| (\"get\" in desc ? !m.__esModule : desc.writable \|\| desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) \|\| function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./signer\"), exports);\n__exportStar(require(\"./verifier\"), exports);\n__exportStar(require(\"./decode\"), exports);\n__exportStar(require(\"./errors\"), exports);\n__exportStar(require(\"./cryptoClients\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) \|\| function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P \|\| (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments \|\| [])).next());\n });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenSigner = exports.createUnsecuredToken = void 0;\nconst base64url = require(\"./base64Url\");\nconst cryptoClients_1 = require(\"./cryptoClients\");\nconst errors_1 = require(\"./errors\");\nconst sha256_1 = require(\"./cryptoClients/sha256\");\nfunction createSigningInput(payload, header) {\n const tokenParts = [];\n // add in the header\n const encodedHeader = base64url.encode(JSON.stringify(header));\n tokenParts.push(encodedHeader);\n // add in the payload\n const encodedPayload = base64url.encode(JSON.stringify(payload));\n tokenParts.push(encodedPayload);\n // prepare the message\n const signingInput = tokenParts.join('.');\n // return the signing input\n return signingInput;\n}\nfunction createUnsecuredToken(payload) {\n const header = { typ: 'JWT', alg: 'none' };\n return createSigningInput(payload, header) + '.';\n}\nexports.createUnsecuredToken = createUnsecuredToken;\nclass TokenSigner {\n constructor(signingAlgorithm, rawPrivateKey) {\n if (!(signingAlgorithm && rawPrivateKey)) {\n throw new errors_1.MissingParametersError('a signing algorithm and private key are required');\n }\n if (typeof signingAlgorithm !== 'string') {\n throw new Error('signing algorithm parameter must be a string');\n }\n signingAlgorithm = signingAlgorithm.toUpperCase();\n if (!cryptoClients_1.cryptoClients.hasOwnProperty(signingAlgorithm)) {\n throw new Error('invalid signing algorithm');\n }\n this.tokenType = 'JWT';\n this.cryptoClient = cryptoClients_1.cryptoClients[signingAlgorithm];\n this.rawPrivateKey = rawPrivateKey;\n }\n header(header = {}) {\n const defaultHeader = { typ: this.tokenType, alg: this.cryptoClient.algorithmName };\n return Object.assign({}, defaultHeader, header);\n }\n sign(payload, expanded = false, customHeader = {}) {\n // generate the token header\n const header = this.header(customHeader);\n // prepare the message to be signed\n const signingInput = createSigningInput(payload, header);\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return this.createWithSignedHash(payload, expanded, header, signingInput, signingInputHash);\n }\n signAsync(payload, expanded = false, customHeader = {}) {\n return __awaiter(this, void 0, void 0, function* () {\n // generate the token header\n const header = this.header(customHeader);\n // prepare the message to be signed\n const signingInput = createSigningInput(payload, header);\n const signingInputHash = yield (0, sha256_1.hashSha256Async)(signingInput);\n return this.createWithSignedHash(payload, expanded, header, signingInput, signingInputHash);\n });\n }\n createWithSignedHash(payload, expanded, header, signingInput, signingInputHash) {\n // sign the message and add in the signature\n const signature = this.cryptoClient.signHash(signingInputHash, this.rawPrivateKey);\n if (expanded) {\n const signedToken = {\n header: [base64url.encode(JSON.stringify(header))],\n payload: JSON.stringify(payload),\n signature: [signature],\n };\n return signedToken;\n }\n else {\n return [signingInput, signature].join('.');\n }\n }\n}\nexports.TokenSigner = TokenSigner;\n//# sourceMappingURL=signer.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenVerifier = void 0;\nconst base64url = require(\"./base64Url\");\nconst cryptoClients_1 = require(\"./cryptoClients\");\nconst errors_1 = require(\"./errors\");\nconst sha256_1 = require(\"./cryptoClients/sha256\");\nclass TokenVerifier {\n constructor(signingAlgorithm, rawPublicKey) {\n if (!(signingAlgorithm && rawPublicKey)) {\n throw new errors_1.MissingParametersError('a signing algorithm and public key are required');\n }\n if (typeof signingAlgorithm !== 'string') {\n throw 'signing algorithm parameter must be a string';\n }\n signingAlgorithm = signingAlgorithm.toUpperCase();\n if (!cryptoClients_1.cryptoClients.hasOwnProperty(signingAlgorithm)) {\n throw 'invalid signing algorithm';\n }\n this.tokenType = 'JWT';\n this.cryptoClient = cryptoClients_1.cryptoClients[signingAlgorithm];\n this.rawPublicKey = rawPublicKey;\n }\n verify(token) {\n if (typeof token === 'string') {\n return this.verifyCompact(token, false);\n }\n else if (typeof token === 'object') {\n return this.verifyExpanded(token, false);\n }\n else {\n return false;\n }\n }\n verifyAsync(token) {\n if (typeof token === 'string') {\n return this.verifyCompact(token, true);\n }\n else if (typeof token === 'object') {\n return this.verifyExpanded(token, true);\n }\n else {\n return Promise.resolve(false);\n }\n }\n verifyCompact(token, async) {\n // decompose the token into parts\n const tokenParts = token.split('.');\n // calculate the signing input hash\n const signingInput = tokenParts[0] + '.' + tokenParts[1];\n const performVerify = (signingInputHash) => {\n // extract the signature as a DER array\n const derSignatureBytes = this.cryptoClient.loadSignature(tokenParts[2]);\n // verify the signed hash\n return this.cryptoClient.verifyHash(signingInputHash, derSignatureBytes, this.rawPublicKey);\n };\n if (async) {\n return (0, sha256_1.hashSha256Async)(signingInput).then(signingInputHash => performVerify(signingInputHash));\n }\n else {\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return performVerify(signingInputHash);\n }\n }\n verifyExpanded(token, async) {\n const signingInput = [token['header'].join('.'), base64url.encode(token['payload'])].join('.');\n let verified = true;\n const performVerify = (signingInputHash) => {\n token['signature'].map((signature) => {\n const derSignatureBytes = this.cryptoClient.loadSignature(signature);\n const signatureVerified = this.cryptoClient.verifyHash(signingInputHash, derSignatureBytes, this.rawPublicKey);\n if (!signatureVerified) {\n verified = false;\n }\n });\n return verified;\n };\n if (async) {\n return (0, sha256_1.hashSha256Async)(signingInput).then(signingInputHash => performVerify(signingInputHash));\n }\n else {\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return performVerify(signingInputHash);\n }\n }\n}\nexports.TokenVerifier = TokenVerifier;\n//# sourceMappingURL=verifier.js.map","/*\n lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n /\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/\n Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n /\nvar reRegExpChar = /[\\\\^$.+?()[\\]{}\|]/g;\n\n/** Used to match `RegExp` flags from their coerced string values. /\nvar reFlags = /\\w$/;\n\n/** Used to detect host constructors (Safari). /\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/** Used to identify `toStringTag` values supported by `_.clone`. /\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/\n Adds the key-value `pair` to `map`.\n \n @private\n * @param {Object} map The map to modify.\n * @param {Array} pair The key-value pair to add.\n * @returns {Object} Returns `map`.\n /\nfunction addMapEntry(map, pair) {\n // Don't return `map.set` because it's not chainable in IE 11.\n map.set(pair[0], pair[1]);\n return map;\n}\n\n/\n Adds `value` to `set`.\n \n @private\n * @param {Object} set The set to modify.\n * @param {} value The value to add.\n @returns {Object} Returns `set`.\n /\nfunction addSetEntry(set, value) {\n // Don't return `set.add` because it's not chainable in IE 11.\n set.add(value);\n return set;\n}\n\n/\n A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array ? array.length : 0;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\n/\n Appends the elements of `values` to `array`.\n \n @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n /\nfunction arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n}\n\n/\n A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {} Returns the accumulated value.\n /\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array ? array.length : 0;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n}\n\n/*\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/\n Gets the value at `key` of `object`.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {} Returns the property value.\n /\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\n/*\n Checks if `value` is a host object in IE < 9.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n /\nfunction isHostObject(value) {\n // Many host objects are `Object` objects that can coerce to strings\n // despite having improperly defined `toString` methods.\n var result = false;\n if (value != null && typeof value.toString != 'function') {\n try {\n result = !!(value + '');\n } catch (e) {}\n }\n return result;\n}\n\n/\n Converts `map` to its key-value pairs.\n \n @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n /\nfunction mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n}\n\n/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/\n Converts `set` to an array of its values.\n \n @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n /\nfunction setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n}\n\n/* Used for built-in method references. /\nvar arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/* Used to detect overreaching core-js shims. /\nvar coreJsData = root['__core-js_shared__'];\n\n/* Used to detect methods masquerading as native. /\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO \|\| '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar objectToString = objectProto.toString;\n\n/* Used to detect if a method is native. /\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty\|(function).?(?=\\\\\\()\| for .+?(?=\\\\\\])/g, '$1.?') + '$'\n);\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined,\n Symbol = root.Symbol,\n Uint8Array = root.Uint8Array,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeKeys = overArg(Object.keys, Object);\n\n/ Built-in method references that are verified to be native. /\nvar DataView = getNative(root, 'DataView'),\n Map = getNative(root, 'Map'),\n Promise = getNative(root, 'Promise'),\n Set = getNative(root, 'Set'),\n WeakMap = getNative(root, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n/* Used to detect maps, sets, and weakmaps. /\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/\n Creates a hash object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Hash(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the hash.\n \n @private\n * @name clear\n * @memberOf Hash\n /\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/\n Removes `key` and its value from the hash.\n \n @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction hashDelete(key) {\n return this.has(key) && delete this.__data__[key];\n}\n\n/\n Gets the hash value for `key`.\n \n @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/*\n Checks if a hash value for `key` exists.\n \n @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/\n Sets the hash `key` to `value`.\n \n @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the hash instance.\n /\nfunction hashSet(key, value) {\n var data = this.__data__;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/\n Creates an list cache object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction ListCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the list cache.\n \n @private\n * @name clear\n * @memberOf ListCache\n /\nfunction listCacheClear() {\n this.__data__ = [];\n}\n\n/\n Removes `key` and its value from the list cache.\n \n @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n return true;\n}\n\n/\n Gets the list cache value for `key`.\n \n @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\n/*\n Checks if a list cache value for `key` exists.\n \n @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\n/\n Sets the list cache `key` to `value`.\n \n @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the list cache instance.\n /\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/\n Creates a map cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction MapCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the map.\n \n @private\n * @name clear\n * @memberOf MapCache\n /\nfunction mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map \|\| ListCache),\n 'string': new Hash\n };\n}\n\n/\n Removes `key` and its value from the map.\n \n @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction mapCacheDelete(key) {\n return getMapData(this, key)['delete'](key);\n}\n\n/\n Gets the map value for `key`.\n \n @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\n/*\n Checks if a map value for `key` exists.\n \n @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\n/\n Sets the map `key` to `value`.\n \n @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the map cache instance.\n /\nfunction mapCacheSet(key, value) {\n getMapData(this, key).set(key, value);\n return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/\n Creates a stack cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Stack(entries) {\n this.__data__ = new ListCache(entries);\n}\n\n/\n Removes all key-value entries from the stack.\n \n @private\n * @name clear\n * @memberOf Stack\n /\nfunction stackClear() {\n this.__data__ = new ListCache;\n}\n\n/\n Removes `key` and its value from the stack.\n \n @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction stackDelete(key) {\n return this.__data__['delete'](key);\n}\n\n/\n Gets the stack value for `key`.\n \n @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\n/*\n Checks if a stack value for `key` exists.\n \n @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction stackHas(key) {\n return this.__data__.has(key);\n}\n\n/\n Sets the stack `key` to `value`.\n \n @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the stack cache instance.\n /\nfunction stackSet(key, value) {\n var cache = this.__data__;\n if (cache instanceof ListCache) {\n var pairs = cache.__data__;\n if (!Map \|\| (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n return this;\n }\n cache = this.__data__ = new MapCache(pairs);\n }\n cache.set(key, value);\n return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/\n Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n // Safari 9 makes `arguments.length` enumerable in strict mode.\n var result = (isArray(value) \|\| isArguments(value))\n ? baseTimes(value.length, String)\n : [];\n\n var length = result.length,\n skipIndexes = !!length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (key == 'length' \|\| isIndex(key, length)))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n \n @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {} value The value to assign.\n /\nfunction assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) \|\|\n (value === undefined && !(key in object))) {\n object[key] = value;\n }\n}\n\n/*\n Gets the index at which the `key` is found in `array` of key-value pairs.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} key The key to search for.\n @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n}\n\n/\n The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n \n @private\n * @param {} value The value to clone.\n @param {boolean} [isDeep] Specify a deep clone.\n * @param {boolean} [isFull] Specify a clone including symbols.\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {} Returns the cloned value.\n /\nfunction baseClone(value, isDeep, isFull, customizer, key, object, stack) {\n var result;\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag \|\| tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag \|\| tag == argsTag \|\| (isFunc && !object)) {\n if (isHostObject(value)) {\n return object ? value : {};\n }\n result = initCloneObject(isFunc ? {} : value);\n if (!isDeep) {\n return copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, baseClone, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack \|\| (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (!isArr) {\n var props = isFull ? getAllKeys(value) : keys(value);\n }\n arrayEach(props \|\| value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));\n });\n return result;\n}\n\n/*\n The base implementation of `_.create` without support for assigning\n * properties to the created object.\n \n @private\n * @param {Object} prototype The object to inherit from.\n * @returns {Object} Returns the new object.\n /\nfunction baseCreate(proto) {\n return isObject(proto) ? objectCreate(proto) : {};\n}\n\n/\n The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\n/\n The base implementation of `getTag`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n return objectToString.call(value);\n}\n\n/\n The base implementation of `_.isNative` without bad shim checks.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n /\nfunction baseIsNative(value) {\n if (!isObject(value) \|\| isMasked(value)) {\n return false;\n }\n var pattern = (isFunction(value) \|\| isHostObject(value)) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\n/\n The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Creates a clone of `buffer`.\n \n @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n /\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var result = new buffer.constructor(buffer.length);\n buffer.copy(result);\n return result;\n}\n\n/\n Creates a clone of `arrayBuffer`.\n \n @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n /\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\n/\n Creates a clone of `dataView`.\n \n @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n /\nfunction cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\n/\n Creates a clone of `map`.\n \n @private\n * @param {Object} map The map to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned map.\n /\nfunction cloneMap(map, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);\n return arrayReduce(array, addMapEntry, new map.constructor);\n}\n\n/\n Creates a clone of `regexp`.\n \n @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n /\nfunction cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n}\n\n/\n Creates a clone of `set`.\n \n @private\n * @param {Object} set The set to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned set.\n /\nfunction cloneSet(set, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);\n return arrayReduce(array, addSetEntry, new set.constructor);\n}\n\n/\n Creates a clone of the `symbol` object.\n \n @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n /\nfunction cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\n/\n Creates a clone of `typedArray`.\n \n @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n /\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/\n Copies the values of `source` to `array`.\n \n @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n /\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array \|\| (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\n/\n Copies properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n /\nfunction copyObject(source, props, object, customizer) {\n object \|\| (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n assignValue(object, key, newValue === undefined ? source[key] : newValue);\n }\n return object;\n}\n\n/\n Copies own symbol properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n}\n\n/\n Creates an array of own enumerable property names and symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\n/\n Gets the data for `map`.\n \n @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {} Returns the map data.\n /\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\n/*\n Gets the native function at `key` of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {} Returns the function if it's native, else `undefined`.\n /\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\n/*\n Creates an array of the own enumerable symbol properties of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray;\n\n/\n Gets the `toStringTag` of `value`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11,\n// for data views in Edge < 14, and promises in Node.js.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) \|\|\n (Map && getTag(new Map) != mapTag) \|\|\n (Promise && getTag(Promise.resolve()) != promiseTag) \|\|\n (Set && getTag(new Set) != setTag) \|\|\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = objectToString.call(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : undefined;\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n}\n\n/\n Initializes an array clone.\n \n @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n /\nfunction initCloneArray(array) {\n var length = array.length,\n result = array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n}\n\n/\n Initializes an object clone.\n \n @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\n/\n Initializes an object clone based on its `toStringTag`.\n \n Note: This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n \n @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneByTag(object, tag, cloneFunc, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return cloneMap(object, isDeep, cloneFunc);\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return cloneSet(object, isDeep, cloneFunc);\n\n case symbolTag:\n return cloneSymbol(object);\n }\n}\n\n/\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n length = length == null ? MAX_SAFE_INTEGER : length;\n return !!length &&\n (typeof value == 'number' \|\| reIsUint.test(value)) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/\n Checks if `value` is suitable for use as unique object key.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n /\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' \|\| type == 'number' \|\| type == 'symbol' \|\| type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\n/\n Checks if `func` has its source masked.\n \n @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n /\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto;\n\n return value === proto;\n}\n\n/\n Converts `func` to its source code.\n \n @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n /\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\n/\n This method is like `_.clone` except that it recursively clones `value`.\n \n @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {} value The value to recursively clone.\n @returns {} Returns the deep cloned value.\n @see _.clone\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n /\nfunction cloneDeep(value) {\n return baseClone(value, true, true);\n}\n\n/\n Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n \n var object = { 'a': 1 };\n * var other = { 'a': 1 };\n \n _.eq(object, object);\n * // => true\n \n _.eq(object, other);\n * // => false\n \n _.eq('a', 'a');\n * // => true\n \n _.eq('a', Object('a'));\n * // => false\n \n _.eq(NaN, NaN);\n * // => true\n /\nfunction eq(value, other) {\n return value === other \|\| (value !== value && other !== other);\n}\n\n/\n Checks if `value` is likely an `arguments` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nfunction isArguments(value) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n (!propertyIsEnumerable.call(value, 'callee') \|\| objectToString.call(value) == argsTag);\n}\n\n/\n Checks if `value` is classified as an `Array` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/\n This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n \n _.isArrayLikeObject([1, 2, 3]);\n * // => true\n \n _.isArrayLikeObject(document.body.children);\n * // => true\n \n _.isArrayLikeObject('abc');\n * // => false\n \n _.isArrayLikeObject(_.noop);\n * // => false\n /\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\n/\n Checks if `value` is classified as a `Function` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 8-9 which returns 'object' for typed array and other constructors.\n var tag = isObject(value) ? objectToString.call(value) : '';\n return tag == funcTag \|\| tag == genTag;\n}\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return !!value && (type == 'object' \|\| type == 'function');\n}\n\n/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/\n This method returns a new empty array.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n \n var arrays = _.times(2, _.stubArray);\n \n console.log(arrays);\n * // => [[], []]\n \n console.log(arrays[0] === arrays[1]);\n * // => false\n /\nfunction stubArray() {\n return [];\n}\n\n/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = cloneDeep;\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout \|\| !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout \|\| !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining \|\| !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","module.exports = require('./lib/schema-inspector');\n","// Disable no-var because we need to support old IE for now.\n/ eslint-disable no-var /\n// Disable space-before-function-paren for compatibility with VS Code default JS formatter.\n/ eslint-disable space-before-function-paren /\n\n/\n * This module is intended to be executed both on client side and server side.\n * No error should be thrown. (soft error handling)\n /\n\n(function () {\n var root = {};\n // Dependencies --------------------------------------------------------------\n root.async = (typeof require === 'function') ? require('async') : window.async;\n if (typeof root.async !== 'object') {\n throw new Error('Module async is required (https://github.com/caolan/async)');\n }\n var async = root.async;\n\n function _extend(origin, add) {\n if (!add \|\| typeof add !== 'object') {\n return origin;\n }\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n }\n\n function _merge() {\n var ret = {};\n var args = Array.prototype.slice.call(arguments);\n var keys = null;\n var i = null;\n\n args.forEach(function (arg) {\n if (arg && arg.constructor === Object) {\n keys = Object.keys(arg);\n i = keys.length;\n while (i--) {\n ret[keys[i]] = arg[keys[i]];\n }\n }\n });\n return ret;\n }\n\n // Customisable class (Base class) -------------------------------------------\n // Use with operation \"new\" to extend Validation and Sanitization themselves,\n // not their prototype. In other words, constructor shall be call to extend\n // those functions, instead of being in their constructor, like this:\n // _extend(Validation, new Customisable);\n\n function Customisable() {\n this.custom = {};\n\n this.extend = function (custom) {\n return _extend(this.custom, custom);\n };\n\n this.reset = function () {\n this.custom = {};\n };\n\n this.remove = function (fields) {\n if (!_typeIs.array(fields)) {\n fields = [fields];\n }\n fields.forEach(function (field) {\n delete this.custom[field];\n }, this);\n };\n }\n\n // Inspection class (Base class) ---------------------------------------------\n // Use to extend Validation and Sanitization prototypes. Inspection\n // constructor shall be called in derived class constructor.\n\n function Inspection(schema, custom) {\n var _stack = ['@'];\n\n this._schema = schema;\n this._custom = {};\n if (custom != null) {\n for (var key in custom) {\n if (Object.prototype.hasOwnProperty.call(custom, key)) {\n this._custom['$' + key] = custom[key];\n }\n }\n }\n\n this._getDepth = function () {\n return _stack.length;\n };\n\n this._dumpStack = function () {\n / eslint-disable no-control-regex /\n return _stack.map(function (i) { return i.replace(/^\\[/g, '\\u001b\\u001c\\u001d\\u001e'); })\n .join('.').replace(/\\.\\u001b\\u001c\\u001d\\u001e/g, '[');\n / eslint-enable no-control-regex /\n };\n\n this._deeperObject = function (name) {\n _stack.push((/^[a-z$_][a-z0-9$_]$/i).test(name) ? name : '[\"' + name + '\"]');\n return this;\n };\n\n this._deeperArray = function (i) {\n _stack.push('[' + i + ']');\n return this;\n };\n\n this._back = function () {\n _stack.pop();\n return this;\n };\n }\n // Simple types --------------------------------------------------------------\n // If the property is not defined or is not in this list:\n var _typeIs = {\n function: function (element) {\n return typeof element === 'function';\n },\n string: function (element) {\n return typeof element === 'string';\n },\n number: function (element) {\n return typeof element === 'number' && !isNaN(element);\n },\n integer: function (element) {\n return typeof element === 'number' && element % 1 === 0;\n },\n NaN: function (element) {\n return typeof element === 'number' && isNaN(element);\n },\n boolean: function (element) {\n return typeof element === 'boolean';\n },\n null: function (element) {\n return element === null;\n },\n date: function (element) {\n return element != null && element instanceof Date;\n },\n object: function (element) {\n return typeof element === 'object' && element != null && element.constructor !== Array;\n },\n array: function (element) {\n return element != null && element.constructor === Array;\n },\n any: function () {\n return true;\n }\n };\n\n function _simpleType(type, candidate) {\n if (typeof type === 'function') {\n return candidate instanceof type;\n }\n type = type in _typeIs ? type : 'any';\n return _typeIs[type](candidate);\n }\n\n function _realType(candidate) {\n for (var i in _typeIs) {\n if (_simpleType(i, candidate)) {\n if (i !== 'any' && (i !== 'object' \|\| candidate.constructor === Object)) { return i; }\n return 'an instance of ' + candidate.constructor.name;\n }\n }\n }\n\n function getIndexes(a, value) {\n var indexes = [];\n var i = a.indexOf(value);\n\n while (i !== -1) {\n indexes.push(i);\n i = a.indexOf(value, i + 1);\n }\n return indexes;\n }\n\n // Available formats ---------------------------------------------------------\n /* eslint-disable no-useless-escape /\n // TODO: Study these regex expressions and add more tests so we can consider removing\n // rule no-useless-escape.\n var _formats = {\n void: /^$/,\n url: /^(https?\|ftp):\\/\\/(((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:)@)?(((\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5]))\|((([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.)?(([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.?)(:\\d)?)(\\/((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)+(\\/(([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)))?)?(\\?((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)\|[\\uE000-\\uF8FF]\|\\/\|\\?))?(\\#((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)\|\\/\|\\?))?$/i,\n 'date-time': /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d{3})?(Z?\|(-\|\\+)\\d{2}:\\d{2})$/,\n date: /^\\d{4}-\\d{2}-\\d{2}$/,\n coolDateTime: /^\\d{4}(-\|\\/)\\d{2}(-\|\\/)\\d{2}(T\| )\\d{2}:\\d{2}:\\d{2}(\\.\\d{3})?Z?$/,\n time: /^\\d{2}\\:\\d{2}\\:\\d{2}$/,\n color: /^#([0-9a-f])+$/i,\n // 2021-03-13 - Email regex was replaced with result of running email-safe-regex\n // latest version as of that day in order so fix GHSL-2020-35.\n // const emailRegexSafe = require('email-regex-safe');\n // const regexString = emailRegexSafe({\n // exact: true,\n // returnString: true,\n // });\n // <using debugger to inspect state of regexString after previous statement>\n //\n // Note that this regex is pretty flexible, but it's a bit stricter than\n // what we had before. It requires the local part of the email address to\n // be at least two characters. Was able to find some justification for\n // this at https://stackoverflow.com/a/15783334/5051165. Test suite\n // was corrected accordingly.\n /* eslint-disable prefer-regex-literals /\n / eslint-disable quotes /\n email: new RegExp(`(?:[^\\\\W_](?:[\\\\w\\\\.\\\\+]+)@(?:localhost\|(?:25[0-5]\|2[0-4]\\\\d\|1\\\\d\\\\d\|[1-9]\\\\d\|\\\\d)(?:\\\\.(?:25[0-5]\|2[0-4]\\\\d\|1\\\\d\\\\d\|[1-9]\\\\d\|\\\\d)){3}\|(?:(?:[a-z\\\\u00a1-\\\\uffff0-9][-_])[a-z\\\\u00a1-\\\\uffff0-9]+)(?:\\\\.(?:[a-z\\\\u00a1-\\\\uffff0-9]-)[a-z\\\\u00a1-\\\\uffff0-9]+)(?:\\\\.(?:northwesternmutual\|travelersinsurance\|vermögensberatung\|vermögensberater\|americanexpress\|kerryproperties\|sandvikcoromant\|afamilycompany\|americanfamily\|bananarepublic\|cancerresearch\|cookingchannel\|kerrylogistics\|weatherchannel\|international\|lifeinsurance\|spreadbetting\|travelchannel\|wolterskluwer\|construction\|lplfinancial\|scholarships\|versicherung\|accountants\|barclaycard\|blackfriday\|blockbuster\|bridgestone\|calvinklein\|contractors\|creditunion\|engineering\|enterprises\|foodnetwork\|investments\|kerryhotels\|lamborghini\|motorcycles\|olayangroup\|photography\|playstation\|productions\|progressive\|redumbrella\|williamhill\|சிங்கப்பூர்\|accountant\|apartments\|associates\|basketball\|bnpparibas\|boehringer\|capitalone\|consulting\|creditcard\|cuisinella\|eurovision\|extraspace\|foundation\|healthcare\|immobilien\|industries\|management\|mitsubishi\|nationwide\|nextdirect\|onyourside\|properties\|protection\|prudential\|realestate\|republican\|restaurant\|schaeffler\|swiftcover\|tatamotors\|technology\|university\|vlaanderen\|volkswagen\|accenture\|alfaromeo\|allfinanz\|amsterdam\|analytics\|aquarelle\|barcelona\|bloomberg\|christmas\|community\|directory\|education\|equipment\|fairwinds\|financial\|firestone\|fresenius\|frontdoor\|fujixerox\|furniture\|goldpoint\|hisamitsu\|homedepot\|homegoods\|homesense\|institute\|insurance\|kuokgroup\|lancaster\|landrover\|lifestyle\|marketing\|marshalls\|melbourne\|microsoft\|panasonic\|passagens\|pramerica\|richardli\|scjohnson\|shangrila\|solutions\|statebank\|statefarm\|stockholm\|travelers\|vacations\|موريتانيا\|yodobashi\|abudhabi\|airforce\|allstate\|attorney\|barclays\|barefoot\|bargains\|baseball\|boutique\|bradesco\|broadway\|brussels\|budapest\|builders\|business\|capetown\|catering\|catholic\|cipriani\|cityeats\|cleaning\|clinique\|clothing\|commbank\|computer\|delivery\|deloitte\|democrat\|diamonds\|discount\|discover\|download\|engineer\|ericsson\|etisalat\|exchange\|feedback\|fidelity\|firmdale\|football\|frontier\|goodyear\|grainger\|graphics\|guardian\|hdfcbank\|helsinki\|holdings\|hospital\|infiniti\|ipiranga\|istanbul\|jpmorgan\|lighting\|lundbeck\|marriott\|maserati\|mckinsey\|memorial\|merckmsd\|mortgage\|observer\|partners\|pharmacy\|pictures\|plumbing\|property\|redstone\|reliance\|saarland\|samsclub\|security\|services\|shopping\|showtime\|softbank\|software\|stcgroup\|supplies\|training\|vanguard\|ventures\|verisign\|woodside\|السعودية\|yokohama\|abogado\|academy\|agakhan\|alibaba\|android\|athleta\|auction\|audible\|auspost\|avianca\|banamex\|bauhaus\|bentley\|bestbuy\|booking\|brother\|bugatti\|capital\|caravan\|careers\|channel\|charity\|chintai\|citadel\|clubmed\|college\|cologne\|comcast\|company\|compare\|contact\|cooking\|corsica\|country\|coupons\|courses\|cricket\|cruises\|dentist\|digital\|domains\|exposed\|express\|farmers\|fashion\|ferrari\|ferrero\|finance\|fishing\|fitness\|flights\|florist\|flowers\|forsale\|frogans\|fujitsu\|gallery\|genting\|godaddy\|grocery\|guitars\|hamburg\|hangout\|hitachi\|holiday\|hosting\|hoteles\|hotmail\|hyundai\|ismaili\|jewelry\|juniper\|kitchen\|komatsu\|lacaixa\|lanxess\|lasalle\|latrobe\|leclerc\|limited\|lincoln\|markets\|monster\|netbank\|netflix\|network\|neustar\|okinawa\|oldnavy\|organic\|origins\|philips\|pioneer\|politie\|realtor\|recipes\|rentals\|reviews\|rexroth\|samsung\|sandvik\|schmidt\|schwarz\|science\|shiksha\|singles\|staples\|storage\|support\|surgery\|systems\|temasek\|theater\|theatre\|tickets\|tiffany\|toshiba\|trading\|walmart\|wanggou\|watches\|weather\|website\|wedding\|whoswho\|windows\|winners\|xfinity\|католик\|الجزائر\|العليان\|اتصالات\|پاکستان\|البحرين\|كاثوليك\|இந்தியா\|yamaxun\|youtube\|zuerich\|abarth\|abbott\|abbvie\|africa\|agency\|airbus\|airtel\|alipay\|alsace\|alstom\|amazon\|anquan\|aramco\|author\|bayern\|beauty\|berlin\|bharti\|bostik\|boston\|broker\|camera\|career\|casino\|center\|chanel\|chrome\|church\|circle\|claims\|clinic\|coffee\|comsec\|condos\|coupon\|credit\|cruise\|dating\|datsun\|dealer\|degree\|dental\|design\|direct\|doctor\|dunlop\|dupont\|durban\|emerck\|energy\|estate\|events\|expert\|family\|flickr\|futbol\|gallup\|garden\|george\|giving\|global\|google\|gratis\|health\|hermes\|hiphop\|hockey\|hotels\|hughes\|imamat\|insure\|intuit\|jaguar\|joburg\|juegos\|kaufen\|kinder\|kindle\|kosher\|lancia\|latino\|lawyer\|lefrak\|living\|locker\|london\|luxury\|madrid\|maison\|makeup\|market\|mattel\|mobile\|monash\|mormon\|moscow\|museum\|mutual\|nagoya\|natura\|nissan\|nissay\|norton\|nowruz\|office\|olayan\|online\|oracle\|orange\|otsuka\|pfizer\|photos\|physio\|pictet\|quebec\|racing\|realty\|reisen\|repair\|report\|review\|rocher\|rogers\|ryukyu\|safety\|sakura\|sanofi\|school\|schule\|search\|secure\|select\|shouji\|soccer\|social\|stream\|studio\|supply\|suzuki\|swatch\|sydney\|taipei\|taobao\|target\|tattoo\|tennis\|tienda\|tjmaxx\|tkmaxx\|toyota\|travel\|unicom\|viajes\|viking\|villas\|virgin\|vision\|voting\|voyage\|vuelos\|walter\|webcam\|xihuan\|москва\|онлайн\|ファッション\|भारतम्\|ارامكو\|امارات\|الاردن\|المغرب\|ابوظبي\|مليسيا\|இலங்கை\|فلسطين\|yachts\|yandex\|zappos\|actor\|adult\|aetna\|amfam\|amica\|apple\|archi\|audio\|autos\|azure\|baidu\|beats\|bible\|bingo\|black\|boats\|bosch\|build\|canon\|cards\|chase\|cheap\|cisco\|citic\|click\|cloud\|coach\|codes\|crown\|cymru\|dabur\|dance\|deals\|delta\|drive\|dubai\|earth\|edeka\|email\|epson\|faith\|fedex\|final\|forex\|forum\|gallo\|games\|gifts\|gives\|glade\|glass\|globo\|gmail\|green\|gripe\|group\|gucci\|guide\|homes\|honda\|horse\|house\|hyatt\|ikano\|irish\|iveco\|jetzt\|koeln\|kyoto\|lamer\|lease\|legal\|lexus\|lilly\|linde\|lipsy\|lixil\|loans\|locus\|lotte\|lotto\|macys\|mango\|media\|miami\|money\|movie\|nexus\|nikon\|ninja\|nokia\|nowtv\|omega\|osaka\|paris\|parts\|party\|phone\|photo\|pizza\|place\|poker\|praxi\|press\|prime\|promo\|quest\|radio\|rehab\|reise\|ricoh\|rocks\|rodeo\|rugby\|salon\|sener\|seven\|sharp\|shell\|shoes\|skype\|sling\|smart\|smile\|solar\|space\|sport\|stada\|store\|study\|style\|sucks\|swiss\|tatar\|tires\|tirol\|tmall\|today\|tokyo\|tools\|toray\|total\|tours\|trade\|trust\|tunes\|tushu\|ubank\|vegas\|video\|vodka\|volvo\|wales\|watch\|weber\|weibo\|works\|world\|xerox\|ישראל\|বাংলা\|భారత్\|भारोत\|संगठन\|ایران\|بازار\|بھارت\|سودان\|همراه\|سورية\|ഭാരതം\|嘉里大酒店\|yahoo\|aarp\|able\|adac\|aero\|akdn\|ally\|amex\|arab\|army\|arpa\|arte\|asda\|asia\|audi\|auto\|baby\|band\|bank\|bbva\|beer\|best\|bike\|bing\|blog\|blue\|bofa\|bond\|book\|buzz\|cafe\|call\|camp\|care\|cars\|casa\|case\|cash\|cbre\|cern\|chat\|citi\|city\|club\|cool\|coop\|cyou\|data\|date\|dclk\|deal\|dell\|desi\|diet\|dish\|docs\|duck\|dvag\|erni\|fage\|fail\|fans\|farm\|fast\|fiat\|fido\|film\|fire\|fish\|flir\|food\|ford\|free\|fund\|game\|gbiz\|gent\|ggee\|gift\|gmbh\|gold\|golf\|goog\|guge\|guru\|hair\|haus\|hdfc\|help\|here\|hgtv\|host\|hsbc\|icbc\|ieee\|imdb\|immo\|info\|itau\|java\|jeep\|jobs\|jprs\|kddi\|kiwi\|kpmg\|kred\|land\|lego\|lgbt\|lidl\|life\|like\|limo\|link\|live\|loan\|loft\|love\|ltda\|luxe\|maif\|meet\|meme\|menu\|mini\|mint\|mobi\|moda\|moto\|name\|navy\|news\|next\|nico\|nike\|ollo\|open\|page\|pars\|pccw\|pics\|ping\|pink\|play\|plus\|pohl\|porn\|post\|prod\|prof\|qpon\|raid\|read\|reit\|rent\|rest\|rich\|rmit\|room\|rsvp\|ruhr\|safe\|sale\|sarl\|save\|saxo\|scot\|seat\|seek\|sexy\|shaw\|shia\|shop\|show\|silk\|sina\|site\|skin\|sncf\|sohu\|song\|sony\|spot\|star\|surf\|talk\|taxi\|team\|tech\|teva\|tiaa\|tips\|town\|toys\|tube\|vana\|visa\|viva\|vivo\|vote\|voto\|wang\|weir\|wien\|wiki\|wine\|work\|xbox\|ಭಾರತ\|ଭାରତ\|大众汽车\|ভাৰত\|ভারত\|موقع\|香格里拉\|сайт\|アマゾン\|дети\|ポイント\|ලංකා\|電訊盈科\|クラウド\|ભારત\|भारत\|عمان\|بارت\|ڀارت\|عراق\|شبكة\|بيتك\|组织机构\|تونس\|グーグル\|ਭਾਰਤ\|yoga\|zara\|zero\|zone\|aaa\|abb\|abc\|aco\|ads\|aeg\|afl\|aig\|anz\|aol\|app\|art\|aws\|axa\|bar\|bbc\|bbt\|bcg\|bcn\|bet\|bid\|bio\|biz\|bms\|bmw\|bom\|boo\|bot\|box\|buy\|bzh\|cab\|cal\|cam\|car\|cat\|cba\|cbn\|cbs\|ceo\|cfa\|cfd\|com\|cpa\|crs\|csc\|dad\|day\|dds\|dev\|dhl\|diy\|dnp\|dog\|dot\|dtv\|dvr\|eat\|eco\|edu\|esq\|eus\|fan\|fit\|fly\|foo\|fox\|frl\|ftr\|fun\|fyi\|gal\|gap\|gay\|gdn\|gea\|gle\|gmo\|gmx\|goo\|gop\|got\|gov\|hbo\|hiv\|hkt\|hot\|how\|ibm\|ice\|icu\|ifm\|inc\|ing\|ink\|int\|ist\|itv\|jcb\|jio\|jll\|jmp\|jnj\|jot\|joy\|kfh\|kia\|kim\|kpn\|krd\|lat\|law\|lds\|llc\|llp\|lol\|lpl\|ltd\|man\|map\|mba\|med\|men\|mil\|mit\|mlb\|mls\|mma\|moe\|moi\|mom\|mov\|msd\|mtn\|mtr\|nab\|nba\|nec\|net\|new\|nfl\|ngo\|nhk\|now\|nra\|nrw\|ntt\|nyc\|obi\|off\|one\|ong\|onl\|ooo\|org\|ott\|ovh\|pay\|pet\|phd\|pid\|pin\|pnc\|pro\|pru\|pub\|pwc\|qvc\|red\|ren\|ril\|rio\|rip\|run\|rwe\|sap\|sas\|sbi\|sbs\|sca\|scb\|ses\|sew\|sex\|sfr\|ski\|sky\|soy\|spa\|srl\|stc\|tab\|tax\|tci\|tdk\|tel\|thd\|tjx\|top\|trv\|tui\|tvs\|ubs\|uno\|uol\|ups\|vet\|vig\|vin\|vip\|wed\|win\|wme\|wow\|wtc\|wtf\|xin\|कॉम\|セール\|คอม\|我爱你\|қаз\|срб\|бел\|קום\|淡马锡\|орг\|नेट\|ストア\|мкд\|كوم\|中文网\|ком\|укр\|亚马逊\|诺基亚\|飞利浦\|мон\|عرب\|ไทย\|рус\|ລາວ\|みんな\|天主教\|مصر\|قطر\|հայ\|新加坡\|xxx\|xyz\|you\|yun\|zip\|ac\|ad\|ae\|af\|ag\|ai\|al\|am\|ao\|aq\|ar\|as\|at\|au\|aw\|ax\|az\|ba\|bb\|bd\|be\|bf\|bg\|bh\|bi\|bj\|bm\|bn\|bo\|br\|bs\|bt\|bv\|bw\|by\|bz\|ca\|cc\|cd\|cf\|cg\|ch\|ci\|ck\|cl\|cm\|cn\|co\|cr\|cu\|cv\|cw\|cx\|cy\|cz\|de\|dj\|dk\|dm\|do\|dz\|ec\|ee\|eg\|er\|es\|et\|eu\|fi\|fj\|fk\|fm\|fo\|fr\|ga\|gb\|gd\|ge\|gf\|gg\|gh\|gi\|gl\|gm\|gn\|gp\|gq\|gr\|gs\|gt\|gu\|gw\|gy\|hk\|hm\|hn\|hr\|ht\|hu\|id\|ie\|il\|im\|in\|io\|iq\|ir\|is\|it\|je\|jm\|jo\|jp\|ke\|kg\|kh\|ki\|km\|kn\|kp\|kr\|kw\|ky\|kz\|la\|lb\|lc\|li\|lk\|lr\|ls\|lt\|lu\|lv\|ly\|ma\|mc\|md\|me\|mg\|mh\|mk\|ml\|mm\|mn\|mo\|mp\|mq\|mr\|ms\|mt\|mu\|mv\|mw\|mx\|my\|mz\|na\|nc\|ne\|nf\|ng\|ni\|nl\|no\|np\|nr\|nu\|nz\|om\|pa\|pe\|pf\|pg\|ph\|pk\|pl\|pm\|pn\|pr\|ps\|pt\|pw\|py\|qa\|re\|ro\|rs\|ru\|rw\|sa\|sb\|sc\|sd\|se\|sg\|sh\|si\|sj\|sk\|sl\|sm\|sn\|so\|sr\|ss\|st\|su\|sv\|sx\|sy\|sz\|tc\|td\|tf\|tg\|th\|tj\|tk\|tl\|tm\|tn\|to\|tr\|tt\|tv\|tw\|tz\|ua\|ug\|uk\|us\|uy\|uz\|va\|vc\|ve\|vg\|vi\|vn\|vu\|wf\|ws\|佛山\|慈善\|集团\|在线\|한국\|点看\|八卦\|公益\|公司\|网站\|移动\|联通\|бг\|时尚\|微博\|삼성\|商标\|商店\|商城\|ею\|新闻\|家電\|中信\|中国\|中國\|娱乐\|谷歌\|购物\|通販\|网店\|餐厅\|网络\|香港\|食品\|台湾\|台灣\|手机\|澳門\|닷컴\|政府\|გე\|机构\|健康\|招聘\|рф\|大拿\|ευ\|ελ\|世界\|書籍\|网址\|닷넷\|コム\|游戏\|企业\|信息\|嘉里\|广东\|政务\|ye\|yt\|za\|zm\|zw))))`),\n /* eslint-enable prefer-regex-literals /\n / eslint-enable quotes /\n numeric: /^[0-9]+$/,\n integer: /^\\-?[0-9]+$/,\n decimal: /^\\-?[0-9]\\.?[0-9]+$/,\n alpha: /^[a-z]+$/i,\n alphaNumeric: /^[a-z0-9]+$/i,\n alphaDash: /^[a-z0-9_-]+$/i,\n javascript: /^[a-z_\\$][a-z0-9_\\$]$/i,\n upperString: /^[A-Z ]$/,\n lowerString: /^[a-z ]$/,\n v4uuid: /^[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[0-9a-f]{4}-[0-9a-f]{12}$/i\n };\n / eslint-enable no-useless-escape /\n\n // Validation ------------------------------------------------------------------\n var _validationAttribut = {\n optional: function (schema, candidate) {\n var opt = typeof schema.optional === 'boolean' ? schema.optional : (schema.optional === 'true'); // Default is false\n\n if (opt === true) {\n return;\n }\n if (typeof candidate === 'undefined') {\n this.report('is missing and not optional', null, 'optional');\n }\n },\n type: function (schema, candidate) {\n // return because optional function already handle this case\n if (typeof candidate === 'undefined' \|\| (typeof schema.type !== 'string' && !(schema.type instanceof Array) && typeof schema.type !== 'function')) {\n return;\n }\n var types = _typeIs.array(schema.type) ? schema.type : [schema.type];\n var typeIsValid = types.some(function (type) {\n return _simpleType(type, candidate);\n });\n if (!typeIsValid) {\n types = types.map(function (t) { return typeof t === 'function' ? 'an instance of ' + t.name : t; });\n this.report('must be ' + types.join(' or ') + ', but is ' + _realType(candidate), null, 'type');\n }\n },\n uniqueness: function (schema, candidate) {\n if (typeof schema.uniqueness === 'string') { schema.uniqueness = (schema.uniqueness === 'true'); }\n if (typeof schema.uniqueness !== 'boolean' \|\| schema.uniqueness === false \|\| (!_typeIs.array(candidate) && typeof candidate !== 'string')) {\n return;\n }\n var reported = [];\n for (var i = 0; i < candidate.length; i++) {\n if (reported.indexOf(candidate[i]) >= 0) {\n continue;\n }\n var indexes = getIndexes(candidate, candidate[i]);\n if (indexes.length > 1) {\n reported.push(candidate[i]);\n this.report('has value [' + candidate[i] + '] more than once at indexes [' + indexes.join(', ') + ']', null, 'uniqueness');\n }\n }\n },\n pattern: function (schema, candidate) {\n var self = this;\n var regexs = schema.pattern;\n if (typeof candidate !== 'string') {\n return;\n }\n var matches = false;\n if (!_typeIs.array(regexs)) {\n regexs = [regexs];\n }\n regexs.forEach(function (regex) {\n if (typeof regex === 'string' && regex in _formats) {\n regex = _formats[regex];\n }\n if (regex instanceof RegExp) {\n if (regex.test(candidate)) {\n matches = true;\n }\n }\n });\n if (!matches) {\n self.report('must match [' + regexs.join(' or ') + '], but is equal to \"' + candidate + '\"', null, 'pattern');\n }\n },\n validDate: function (schema, candidate) {\n if (String(schema.validDate) === 'true' && candidate instanceof Date && isNaN(candidate.getTime())) {\n this.report('must be a valid date', null, 'validDate');\n }\n },\n minLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var minLength = Number(schema.minLength);\n if (isNaN(minLength)) {\n return;\n }\n if (candidate.length < minLength) {\n this.report('must be longer than ' + minLength + ' elements, but it has ' + candidate.length, null, 'minLength');\n }\n },\n maxLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var maxLength = Number(schema.maxLength);\n if (isNaN(maxLength)) {\n return;\n }\n if (candidate.length > maxLength) {\n this.report('must be shorter than ' + maxLength + ' elements, but it has ' + candidate.length, null, 'maxLength');\n }\n },\n exactLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var exactLength = Number(schema.exactLength);\n if (isNaN(exactLength)) {\n return;\n }\n if (candidate.length !== exactLength) {\n this.report('must have exactly ' + exactLength + ' elements, but it have ' + candidate.length, null, 'exactLength');\n }\n },\n lt: function (schema, candidate) {\n var limit = Number(schema.lt);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate >= limit) {\n this.report('must be less than ' + limit + ', but is equal to \"' + candidate + '\"', null, 'lt');\n }\n },\n lte: function (schema, candidate) {\n var limit = Number(schema.lte);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate > limit) {\n this.report('must be less than or equal to ' + limit + ', but is equal to \"' + candidate + '\"', null, 'lte');\n }\n },\n gt: function (schema, candidate) {\n var limit = Number(schema.gt);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate <= limit) {\n this.report('must be greater than ' + limit + ', but is equal to \"' + candidate + '\"', null, 'gt');\n }\n },\n gte: function (schema, candidate) {\n var limit = Number(schema.gte);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate < limit) {\n this.report('must be greater than or equal to ' + limit + ', but is equal to \"' + candidate + '\"', null, 'gte');\n }\n },\n eq: function (schema, candidate) {\n if (typeof candidate !== 'number' && typeof candidate !== 'string' && typeof candidate !== 'boolean') {\n return;\n }\n var limit = schema.eq;\n if (typeof limit !== 'number' && typeof limit !== 'string' && typeof limit !== 'boolean' && !_typeIs.array(limit)) {\n return;\n }\n if (_typeIs.array(limit)) {\n for (var i = 0; i < limit.length; i++) {\n if (candidate === limit[i]) {\n return;\n }\n }\n this.report('must be equal to [' + limit.map(function (l) {\n return '\"' + l + '\"';\n }).join(' or ') + '], but is equal to \"' + candidate + '\"', null, 'eq');\n } else {\n if (candidate !== limit) {\n this.report('must be equal to \"' + limit + '\", but is equal to \"' + candidate + '\"', null, 'eq');\n }\n }\n },\n ne: function (schema, candidate) {\n if (typeof candidate !== 'number' && typeof candidate !== 'string') {\n return;\n }\n var limit = schema.ne;\n if (typeof limit !== 'number' && typeof limit !== 'string' && !_typeIs.array(limit)) {\n return;\n }\n if (_typeIs.array(limit)) {\n for (var i = 0; i < limit.length; i++) {\n if (candidate === limit[i]) {\n this.report('must not be equal to \"' + limit[i] + '\"', null, 'ne');\n return;\n }\n }\n } else {\n if (candidate === limit) {\n this.report('must not be equal to \"' + limit + '\"', null, 'ne');\n }\n }\n },\n someKeys: function (schema, candidat) {\n var _keys = schema.someKeys;\n if (!_typeIs.object(candidat)) {\n return;\n }\n var valid = _keys.some(function (action) {\n return (action in candidat);\n });\n if (!valid) {\n this.report('must have at least key ' + _keys.map(function (i) {\n return '\"' + i + '\"';\n }).join(' or '), null, 'someKeys');\n }\n },\n strict: function (schema, candidate) {\n if (typeof schema.strict === 'string') { schema.strict = (schema.strict === 'true'); }\n if (schema.strict !== true \|\| !_typeIs.object(candidate) \|\| !_typeIs.object(schema.properties)) {\n return;\n }\n var self = this;\n if (typeof schema.properties[''] === 'undefined') {\n var intruder = Object.keys(candidate).filter(function (key) {\n return (typeof schema.properties[key] === 'undefined');\n });\n if (intruder.length > 0) {\n var msg = 'should not contains ' + (intruder.length > 1 ? 'properties' : 'property') +\n ' [' + intruder.map(function (i) { return '\"' + i + '\"'; }).join(', ') + ']';\n self.report(msg, null, 'strict');\n }\n }\n },\n exec: function (schema, candidate, callback) {\n var self = this;\n\n if (typeof callback === 'function') {\n return this.asyncExec(schema, candidate, callback);\n }\n (_typeIs.array(schema.exec) ? schema.exec : [schema.exec]).forEach(function (exec) {\n if (typeof exec === 'function') {\n exec.call(self, schema, candidate);\n }\n });\n },\n properties: function (schema, candidate, callback) {\n if (typeof callback === 'function') {\n return this.asyncProperties(schema, candidate, callback);\n }\n if (!(schema.properties instanceof Object) \|\| !(candidate instanceof Object)) {\n return;\n }\n var properties = schema.properties;\n var i;\n if (properties[''] != null) {\n for (i in candidate) {\n if (i in properties) {\n continue;\n }\n this._deeperObject(i);\n this._validate(properties[''], candidate[i]);\n this._back();\n }\n }\n for (i in properties) {\n if (i === '') {\n continue;\n }\n this._deeperObject(i);\n this._validate(properties[i], candidate[i]);\n this._back();\n }\n },\n items: function (schema, candidate, callback) {\n if (typeof callback === 'function') {\n return this.asyncItems(schema, candidate, callback);\n }\n if (!(schema.items instanceof Object) \|\| !(candidate instanceof Object)) {\n return;\n }\n var items = schema.items;\n var i, l;\n // If provided schema is an array\n // then call validate for each case\n // else it is an Object\n // then call validate for each key\n if (_typeIs.array(items) && _typeIs.array(candidate)) {\n for (i = 0, l = items.length; i < l; i++) {\n this._deeperArray(i);\n this._validate(items[i], candidate[i]);\n this._back();\n }\n } else {\n for (var key in candidate) {\n if (Object.prototype.hasOwnProperty.call(candidate, key)) {\n this._deeperArray(key);\n this._validate(items, candidate[key]);\n this._back();\n }\n }\n }\n }\n };\n\n var _asyncValidationAttribut = {\n asyncExec: function (schema, candidate, callback) {\n var self = this;\n async.eachSeries(_typeIs.array(schema.exec) ? schema.exec : [schema.exec], function (exec, done) {\n if (typeof exec === 'function') {\n if (exec.length > 2) {\n return exec.call(self, schema, candidate, done);\n }\n exec.call(self, schema, candidate);\n }\n async.nextTick(done);\n }, callback);\n },\n asyncProperties: function (schema, candidate, callback) {\n if (!(schema.properties instanceof Object) \|\| !_typeIs.object(candidate)) {\n return callback();\n }\n var self = this;\n var properties = schema.properties;\n async.series([\n function (next) {\n if (properties[''] == null) {\n return next();\n }\n async.eachSeries(Object.keys(candidate), function (i, done) {\n if (i in properties) {\n return async.nextTick(done);\n }\n self._deeperObject(i);\n self._asyncValidate(properties[''], candidate[i], function (err) {\n self._back();\n done(err);\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(properties), function (i, done) {\n if (i === '') {\n return async.nextTick(done);\n }\n self._deeperObject(i);\n self._asyncValidate(properties[i], candidate[i], function (err) {\n self._back();\n done(err);\n });\n }, next);\n }\n ], callback);\n },\n asyncItems: function (schema, candidate, callback) {\n if (!(schema.items instanceof Object) \|\| !(candidate instanceof Object)) {\n return callback();\n }\n var self = this;\n var items = schema.items;\n\n if (_typeIs.array(items) && _typeIs.array(candidate)) {\n async.timesSeries(items.length, function (i, done) {\n self._deeperArray(i);\n self._asyncValidate(items[i], candidate[i], function (err, res) {\n self._back();\n done(err, res);\n });\n self._back();\n }, callback);\n } else {\n async.eachSeries(Object.keys(candidate), function (key, done) {\n self._deeperArray(key);\n self._asyncValidate(items, candidate[key], function (err, res) {\n self._back();\n done(err, res);\n });\n }, callback);\n }\n }\n };\n\n // Validation Class ----------------------------------------------------------\n // inherits from Inspection class (actually we just call Inspection\n // constructor with the new context, because its prototype is empty\n function Validation(schema, custom) {\n Inspection.prototype.constructor.call(this, schema, _merge(Validation.custom, custom));\n var _error = [];\n\n this._basicFields = Object.keys(_validationAttribut);\n this._customFields = Object.keys(this._custom);\n this.origin = null;\n\n this.report = function (message, code, reason) {\n var newErr = {\n code: code \|\| this.userCode \|\| null,\n reason: reason \|\| 'unknown',\n message: this.userError \|\| message \|\| 'is invalid',\n property: this.userAlias ? (this.userAlias + ' (' + this._dumpStack() + ')') : this._dumpStack()\n };\n _error.push(newErr);\n return this;\n };\n\n this.result = function () {\n return {\n error: _error,\n valid: _error.length === 0,\n format: function () {\n if (this.valid === true) {\n return 'Candidate is valid';\n }\n return this.error.map(function (i) {\n return 'Property ' + i.property + ': ' + i.message;\n }).join('\\n');\n }\n };\n };\n }\n\n _extend(Validation.prototype, _validationAttribut);\n _extend(Validation.prototype, _asyncValidationAttribut);\n _extend(Validation, new Customisable());\n\n Validation.prototype.validate = function (candidate, callback) {\n this.origin = candidate;\n if (typeof callback === 'function') {\n var self = this;\n return async.nextTick(function () {\n self._asyncValidate(self._schema, candidate, function (err) {\n self.origin = null;\n callback(err, self.result());\n });\n });\n }\n return this._validate(this._schema, candidate).result();\n };\n\n Validation.prototype._validate = function (schema, candidate, callback) {\n this.userCode = schema.code \|\| null;\n this.userError = schema.error \|\| null;\n this.userAlias = schema.alias \|\| null;\n this._basicFields.forEach(function (i) {\n if ((i in schema \|\| i === 'optional') && typeof this[i] === 'function') {\n this[i](schema, candidate);\n }\n }, this);\n this._customFields.forEach(function (i) {\n if (i in schema && typeof this._custom[i] === 'function') {\n this._custom[i].call(this, schema, candidate);\n }\n }, this);\n return this;\n };\n\n Validation.prototype._asyncValidate = function (schema, candidate, callback) {\n var self = this;\n this.userCode = schema.code \|\| null;\n this.userError = schema.error \|\| null;\n this.userAlias = schema.alias \|\| null;\n\n async.series([\n function (next) {\n async.eachSeries(Object.keys(_validationAttribut), function (i, done) {\n async.nextTick(function () {\n if ((i in schema \|\| i === 'optional') && typeof self[i] === 'function') {\n if (self[i].length > 2) {\n return self[i](schema, candidate, done);\n }\n self[i](schema, candidate);\n }\n done();\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(self._custom), function (i, done) {\n async.nextTick(function () {\n if (i in schema && typeof self._custom[i] === 'function') {\n if (self._custom[i].length > 2) {\n return self._custom[i].call(self, schema, candidate, done);\n }\n self._custom[i].call(self, schema, candidate);\n }\n done();\n });\n }, next);\n }\n ], callback);\n };\n\n // Sanitization ----------------------------------------------------------------\n // functions called by _sanitization.type method.\n var _forceType = {\n number: function (post, schema) {\n var n;\n if (typeof post === 'number') {\n return post;\n } else if (post === '') {\n if (typeof schema.def !== 'undefined') {\n return schema.def;\n }\n return null;\n } else if (typeof post === 'string') {\n n = parseFloat(post.replace(/,/g, '.').replace(/ /g, ''));\n if (typeof n === 'number') {\n return n;\n }\n } else if (post instanceof Date) {\n return +post;\n }\n return null;\n },\n integer: function (post, schema) {\n var n;\n if (typeof post === 'number' && post % 1 === 0) {\n return post;\n } else if (post === '') {\n if (typeof schema.def !== 'undefined') {\n return schema.def;\n }\n return null;\n } else if (typeof post === 'string') {\n n = parseInt(post.replace(/ /g, ''), 10);\n if (typeof n === 'number') {\n return n;\n }\n } else if (typeof post === 'number') {\n return parseInt(post, 10);\n } else if (typeof post === 'boolean') {\n if (post) { return 1; }\n return 0;\n } else if (post instanceof Date) {\n return +post;\n }\n return null;\n },\n string: function (post, schema) {\n if (typeof post === 'boolean' \|\| typeof post === 'number' \|\| post instanceof Date) {\n return post.toString();\n } else if (_typeIs.array(post)) {\n // If user authorize array and strings...\n if (schema.items \|\| schema.properties) {\n return post;\n }\n return post.join(String(schema.joinWith \|\| ','));\n } else if (post instanceof Object) {\n // If user authorize objects ans strings...\n if (schema.items \|\| schema.properties) {\n return post;\n }\n return JSON.stringify(post);\n } else if (typeof post === 'string' && post.length) {\n return post;\n }\n return null;\n },\n date: function (post, schema) {\n if (post instanceof Date) {\n return post;\n } else {\n var d = new Date(post);\n if (!isNaN(d.getTime())) { // if valid date\n return d;\n }\n }\n return null;\n },\n boolean: function (post, schema) {\n if (typeof post === 'undefined') return null;\n if (typeof post === 'string' && post.toLowerCase() === 'false') return false;\n return !!post;\n },\n object: function (post, schema) {\n if (typeof post !== 'string' \|\| _typeIs.object(post)) {\n return post;\n }\n try {\n return JSON.parse(post);\n } catch (e) {\n return null;\n }\n },\n array: function (post, schema) {\n if (_typeIs.array(post)) {\n return post;\n }\n if (typeof post === 'undefined') {\n return null;\n }\n if (typeof post === 'string') {\n if (post.substring(0, 1) === '[' && post.slice(-1) === ']') {\n try {\n return JSON.parse(post);\n } catch (e) {\n return null;\n }\n }\n return post.split(String(schema.splitWith \|\| ','));\n }\n if (!_typeIs.array(post)) {\n return [post];\n }\n return null;\n }\n };\n\n var _applyRules = {\n upper: function (post) {\n return post.toUpperCase();\n },\n lower: function (post) {\n return post.toLowerCase();\n },\n title: function (post) {\n // Fix by seb (replace \\w\\S* by \\S* => exemple : coucou ça va)\n return post.replace(/\\S/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase();\n });\n },\n capitalize: function (post) {\n return post.charAt(0).toUpperCase() + post.substr(1).toLowerCase();\n },\n ucfirst: function (post) {\n return post.charAt(0).toUpperCase() + post.substr(1);\n },\n trim: function (post) {\n return post.trim();\n }\n };\n\n // Every function return the future value of each property. Therefore you\n // have to return post even if you do not change its value\n var _sanitizationAttribut = {\n strict: function (schema, post) {\n if (typeof schema.strict === 'string') { schema.strict = (schema.strict === 'true'); }\n if (schema.strict !== true) {\n return post;\n }\n if (!_typeIs.object(schema.properties)) {\n return post;\n }\n if (!_typeIs.object(post)) {\n return post;\n }\n Object.keys(post).forEach(function (key) {\n if (!(key in schema.properties)) {\n delete post[key];\n }\n });\n return post;\n },\n optional: function (schema, post) {\n var opt = typeof schema.optional === 'boolean' ? schema.optional : (schema.optional !== 'false'); // Default: true\n if (opt === true) {\n return post;\n }\n if (typeof post !== 'undefined') {\n return post;\n }\n this.report();\n if (schema.def === Date) {\n return new Date();\n }\n return schema.def;\n },\n type: function (schema, post) {\n // if (_typeIs['object'](post) \|\| _typeIs.array(post)) {\n // return post;\n // }\n if (typeof schema.type !== 'string' \|\| typeof _forceType[schema.type] !== 'function') {\n return post;\n }\n var n;\n var opt = typeof schema.optional === 'boolean' ? schema.optional : true;\n if (typeof _forceType[schema.type] === 'function') {\n n = _forceType[schema.type](post, schema);\n if ((n === null && !opt) \|\| (!n && isNaN(n)) \|\| (n === null && schema.type === 'string')) {\n n = schema.def;\n }\n } else if (!opt) {\n n = schema.def;\n }\n if ((n != null \|\| (typeof schema.def !== 'undefined' && schema.def === n)) && n !== post) {\n this.report();\n return n;\n }\n return post;\n },\n rules: function (schema, post) {\n var rules = schema.rules;\n if (typeof post !== 'string' \|\| (typeof rules !== 'string' && !_typeIs.array(rules))) {\n return post;\n }\n var modified = false;\n (_typeIs.array(rules) ? rules : [rules]).forEach(function (rule) {\n if (typeof _applyRules[rule] === 'function') {\n post = _applyRules[rule](post);\n modified = true;\n }\n });\n if (modified) {\n this.report();\n }\n return post;\n },\n min: function (schema, post) {\n var postTest = Number(post);\n if (isNaN(postTest)) {\n return post;\n }\n var min = Number(schema.min);\n if (isNaN(min)) {\n return post;\n }\n if (postTest < min) {\n this.report();\n return min;\n }\n return post;\n },\n max: function (schema, post) {\n var postTest = Number(post);\n if (isNaN(postTest)) {\n return post;\n }\n var max = Number(schema.max);\n if (isNaN(max)) {\n return post;\n }\n if (postTest > max) {\n this.report();\n return max;\n }\n return post;\n },\n minLength: function (schema, post) {\n var limit = Number(schema.minLength);\n if (typeof post !== 'string' \|\| isNaN(limit) \|\| limit < 0) {\n return post;\n }\n var str = '';\n var gap = limit - post.length;\n if (gap > 0) {\n for (var i = 0; i < gap; i++) {\n str += '-';\n }\n this.report();\n return post + str;\n }\n return post;\n },\n maxLength: function (schema, post) {\n var limit = Number(schema.maxLength);\n if (typeof post !== 'string' \|\| isNaN(limit) \|\| limit < 0) {\n return post;\n }\n if (post.length > limit) {\n this.report();\n return post.slice(0, limit);\n }\n return post;\n },\n properties: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncProperties(schema, post, callback);\n }\n if (!post \|\| typeof post !== 'object') {\n return post;\n }\n var properties = schema.properties;\n var tmp;\n var i;\n if (typeof properties[''] !== 'undefined') {\n for (i in post) {\n if (i in properties) {\n continue;\n }\n this._deeperObject(i);\n tmp = this._sanitize(properties[''], post[i]);\n if (typeof tmp !== 'undefined' \|\| 'exec' in properties['']) {\n post[i] = tmp;\n }\n this._back();\n }\n }\n for (i in properties) {\n if (i !== '') {\n this._deeperObject(i);\n tmp = this._sanitize(properties[i], post[i]);\n if (typeof tmp !== 'undefined' \|\| 'exec' in properties[i]) {\n post[i] = tmp;\n }\n this._back();\n }\n }\n return post;\n },\n items: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncItems(schema, post, callback);\n }\n if (!(schema.items instanceof Object) \|\| !(post instanceof Object)) {\n return post;\n }\n var i;\n if (_typeIs.array(schema.items) && _typeIs.array(post)) {\n var minLength = schema.items.length < post.length ? schema.items.length : post.length;\n for (i = 0; i < minLength; i++) {\n this._deeperArray(i);\n post[i] = this._sanitize(schema.items[i], post[i]);\n this._back();\n }\n } else {\n for (i in post) {\n if (Object.prototype.hasOwnProperty.call(post, i)) {\n this._deeperArray(i);\n post[i] = this._sanitize(schema.items, post[i]);\n this._back();\n }\n }\n }\n return post;\n },\n exec: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncExec(schema, post, callback);\n }\n var execs = _typeIs.array(schema.exec) ? schema.exec : [schema.exec];\n\n execs.forEach(function (exec) {\n if (typeof exec === 'function') {\n post = exec.call(this, schema, post);\n }\n }, this);\n return post;\n }\n };\n\n var _asyncSanitizationAttribut = {\n asyncExec: function (schema, post, callback) {\n var self = this;\n var execs = _typeIs.array(schema.exec) ? schema.exec : [schema.exec];\n\n async.eachSeries(execs, function (exec, done) {\n if (typeof exec === 'function') {\n if (exec.length > 2) {\n return exec.call(self, schema, post, function (err, res) {\n if (err) {\n return done(err);\n }\n post = res;\n done();\n });\n }\n post = exec.call(self, schema, post);\n }\n done();\n }, function (err) {\n callback(err, post);\n });\n },\n asyncProperties: function (schema, post, callback) {\n if (!post \|\| typeof post !== 'object') {\n return callback(null, post);\n }\n var self = this;\n var properties = schema.properties;\n\n async.series([\n function (next) {\n if (properties[''] == null) {\n return next();\n }\n var globing = properties[''];\n async.eachSeries(Object.keys(post), function (i, next) {\n if (i in properties) {\n return next();\n }\n self._deeperObject(i);\n self._asyncSanitize(globing, post[i], function (err, res) {\n if (err) { / Error can safely be ignored here / }\n if (typeof res !== 'undefined') {\n post[i] = res;\n }\n self._back();\n next();\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(properties), function (i, next) {\n if (i === '') {\n return next();\n }\n self._deeperObject(i);\n self._asyncSanitize(properties[i], post[i], function (err, res) {\n if (err) {\n return next(err);\n }\n if (typeof res !== 'undefined') {\n post[i] = res;\n }\n self._back();\n next();\n });\n }, next);\n }\n ], function (err) {\n return callback(err, post);\n });\n },\n asyncItems: function (schema, post, callback) {\n if (!(schema.items instanceof Object) \|\| !(post instanceof Object)) {\n return callback(null, post);\n }\n var self = this;\n var items = schema.items;\n if (_typeIs.array(items) && _typeIs.array(post)) {\n var minLength = items.length < post.length ? items.length : post.length;\n async.timesSeries(minLength, function (i, next) {\n self._deeperArray(i);\n self._asyncSanitize(items[i], post[i], function (err, res) {\n if (err) {\n return next(err);\n }\n post[i] = res;\n self._back();\n next();\n });\n }, function (err) {\n callback(err, post);\n });\n } else {\n async.eachSeries(Object.keys(post), function (key, next) {\n self._deeperArray(key);\n self._asyncSanitize(items, post[key], function (err, res) {\n if (err) {\n return next();\n }\n post[key] = res;\n self._back();\n next();\n });\n }, function (err) {\n callback(err, post);\n });\n }\n return post;\n }\n };\n\n // Sanitization Class --------------------------------------------------------\n // inherits from Inspection class (actually we just call Inspection\n // constructor with the new context, because its prototype is empty\n function Sanitization(schema, custom) {\n Inspection.prototype.constructor.call(this, schema, _merge(Sanitization.custom, custom));\n var _reporting = [];\n\n this._basicFields = Object.keys(_sanitizationAttribut);\n this._customFields = Object.keys(this._custom);\n this.origin = null;\n\n this.report = function (message) {\n var newNot = {\n message: message \|\| 'was sanitized',\n property: this.userAlias ? (this.userAlias + ' (' + this._dumpStack() + ')') : this._dumpStack()\n };\n if (!_reporting.some(function (e) { return e.property === newNot.property; })) {\n _reporting.push(newNot);\n }\n };\n\n this.result = function (data) {\n // For old IE.\n /* eslint-disable object-shorthand /\n return {\n data: data,\n reporting: _reporting,\n format: function () {\n return this.reporting.map(function (i) {\n return 'Property ' + i.property + ' ' + i.message;\n }).join('\\n');\n }\n };\n / eslint-enable object-shorthand /\n };\n }\n\n _extend(Sanitization.prototype, _sanitizationAttribut);\n _extend(Sanitization.prototype, _asyncSanitizationAttribut);\n _extend(Sanitization, new Customisable());\n\n Sanitization.prototype.sanitize = function (post, callback) {\n this.origin = post;\n if (typeof callback === 'function') {\n var self = this;\n return this._asyncSanitize(this._schema, post, function (err, data) {\n self.origin = null;\n callback(err, self.result(data));\n });\n }\n var data = this._sanitize(this._schema, post);\n this.origin = null;\n return this.result(data);\n };\n\n Sanitization.prototype._sanitize = function (schema, post) {\n this.userAlias = schema.alias \|\| null;\n this._basicFields.forEach(function (i) {\n if ((i in schema \|\| i === 'optional') && typeof this[i] === 'function') {\n post = this[i](schema, post);\n }\n }, this);\n this._customFields.forEach(function (i) {\n if (i in schema && typeof this._custom[i] === 'function') {\n post = this._custom[i].call(this, schema, post);\n }\n }, this);\n return post;\n };\n\n Sanitization.prototype._asyncSanitize = function (schema, post, callback) {\n var self = this;\n this.userAlias = schema.alias \|\| null;\n\n async.waterfall([\n function (next) {\n async.reduce(self._basicFields, post, function (value, i, next) {\n async.nextTick(function () {\n if ((i in schema \|\| i === 'optional') && typeof self[i] === 'function') {\n if (self[i].length > 2) {\n return self[i](schema, value, next);\n }\n value = self[i](schema, value);\n }\n next(null, value);\n });\n }, next);\n },\n function (inter, next) {\n async.reduce(self._customFields, inter, function (value, i, next) {\n async.nextTick(function () {\n if (i in schema && typeof self._custom[i] === 'function') {\n if (self._custom[i].length > 2) {\n return self._custom[i].call(self, schema, value, next);\n }\n value = self._custom[i].call(self, schema, value);\n }\n next(null, value);\n });\n }, next);\n }\n ], callback);\n };\n\n // ---------------------------------------------------------------------------\n\n var INT_MIN = -2147483648;\n var INT_MAX = 2147483647;\n\n var _rand = {\n int: function (min, max) {\n return min + (0 \| Math.random() (max - min + 1));\n },\n float: function (min, max) {\n return (Math.random() * (max - min) + min);\n },\n bool: function () {\n return (Math.random() > 0.5);\n },\n char: function (min, max) {\n return String.fromCharCode(this.int(min, max));\n },\n fromList: function (list) {\n return list[this.int(0, list.length - 1)];\n }\n };\n\n var _formatSample = {\n 'date-time': function () {\n return new Date().toISOString();\n },\n date: function () {\n return new Date().toISOString().replace(/T.$/, '');\n },\n time: function () {\n return new Date().toLocaleTimeString({}, { hour12: false });\n },\n color: function (min, max) {\n var s = '#';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('0123456789abcdefABCDEF');\n }\n return s;\n },\n numeric: function () {\n return '' + _rand.int(0, INT_MAX);\n },\n integer: function () {\n if (_rand.bool() === true) {\n return '-' + this.numeric();\n }\n return this.numeric();\n },\n decimal: function () {\n return this.integer() + '.' + this.numeric();\n },\n alpha: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ');\n }\n return s;\n },\n alphaNumeric: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789');\n }\n return s;\n },\n alphaDash: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('_-abcdefghijklmnopqrstuvwxyz_-ABCDEFGHIJKLMNOPQRSTUVWXYZ_-0123456789_-');\n }\n return s;\n },\n javascript: function (min, max) {\n var s = _rand.fromList('_$abcdefghijklmnopqrstuvwxyz_$ABCDEFGHIJKLMNOPQRSTUVWXYZ_$');\n for (var i = 0, l = _rand.int(min, max - 1); i < l; i++) {\n s += _rand.fromList('_$abcdefghijklmnopqrstuvwxyz_$ABCDEFGHIJKLMNOPQRSTUVWXYZ_$0123456789_$');\n }\n return s;\n }\n };\n\n function _getLimits(schema) {\n var min = INT_MIN;\n var max = INT_MAX;\n\n if (schema.gte != null) {\n min = schema.gte;\n } else if (schema.gt != null) {\n min = schema.gt + 1;\n }\n if (schema.lte != null) {\n max = schema.lte;\n } else if (schema.lt != null) {\n max = schema.lt - 1;\n }\n // For old IE.\n / eslint-disable object-shorthand /\n return { min: min, max: max };\n / eslint-enable object-shorthand /\n }\n\n var _typeGenerator = {\n string: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var s = '';\n var minLength = schema.minLength != null ? schema.minLength : 0;\n var maxLength = schema.maxLength != null ? schema.maxLength : 32;\n if (typeof schema.pattern === 'string' && typeof _formatSample[schema.pattern] === 'function') {\n return _formatSample[schema.pattern](minLength, maxLength);\n }\n\n var l = schema.exactLength != null ? schema.exactLength : _rand.int(minLength, maxLength);\n for (var i = 0; i < l; i++) {\n s += _rand.char(32, 126);\n }\n return s;\n },\n number: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var limit = _getLimits(schema);\n var n = _rand.float(limit.min, limit.max);\n if (schema.ne != null) {\n var ne = _typeIs.array(schema.ne) ? schema.ne : [schema.ne];\n while (ne.indexOf(n) !== -1) {\n n = _rand.float(limit.min, limit.max);\n }\n }\n return n;\n },\n integer: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var limit = _getLimits(schema);\n var n = _rand.int(limit.min, limit.max);\n if (schema.ne != null) {\n var ne = _typeIs.array(schema.ne) ? schema.ne : [schema.ne];\n while (ne.indexOf(n) !== -1) {\n n = _rand.int(limit.min, limit.max);\n }\n }\n return n;\n },\n boolean: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n return _rand.bool();\n },\n null: function (schema) {\n return null;\n },\n date: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n return new Date();\n },\n object: function (schema) {\n var o = {};\n var prop = schema.properties \|\| {};\n\n for (var key in prop) {\n if (Object.prototype.hasOwnProperty.call(prop, key)) {\n if (prop[key].optional === true && _rand.bool() === true) {\n continue;\n }\n if (key !== '') {\n o[key] = this.generate(prop[key]);\n } else {\n var rk = '__random_key_';\n var randomKey = rk + 0;\n var n = _rand.int(1, 9);\n for (var i = 1; i <= n; i++) {\n if (!(randomKey in prop)) {\n o[randomKey] = this.generate(prop[key]);\n }\n randomKey = rk + i;\n }\n }\n }\n }\n return o;\n },\n array: function (schema) {\n var self = this;\n var items = schema.items \|\| {};\n var minLength = schema.minLength != null ? schema.minLength : 0;\n var maxLength = schema.maxLength != null ? schema.maxLength : 16;\n var type;\n var candidate;\n var size;\n var i;\n\n if (_typeIs.array(items)) {\n size = items.length;\n if (schema.exactLength != null) {\n size = schema.exactLength;\n } else if (size < minLength) {\n size = minLength;\n } else if (size > maxLength) {\n size = maxLength;\n }\n candidate = new Array(size);\n type = null;\n for (i = 0; i < size; i++) {\n type = items[i].type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n candidate[i] = self[type](items[i]);\n }\n } else {\n size = schema.exactLength != null ? schema.exactLength : _rand.int(minLength, maxLength);\n candidate = new Array(size);\n type = items.type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n for (i = 0; i < size; i++) {\n candidate[i] = self[type](items);\n }\n }\n return candidate;\n },\n any: function (schema) {\n var fields = Object.keys(_typeGenerator);\n var i = fields[_rand.int(0, fields.length - 2)];\n return this[i](schema);\n }\n };\n\n // CandidateGenerator Class (Singleton) --------------------------------------\n function CandidateGenerator() {\n // Maybe extends Inspection class too ?\n }\n\n _extend(CandidateGenerator.prototype, _typeGenerator);\n\n var _instance = null;\n CandidateGenerator.instance = function () {\n if (!(_instance instanceof CandidateGenerator)) {\n _instance = new CandidateGenerator();\n }\n return _instance;\n };\n\n CandidateGenerator.prototype.generate = function (schema) {\n var type = schema.type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n return this[type](schema);\n };\n\n // Exports ---------------------------------------------------------------------\n var SchemaInspector = {};\n\n // if server-side (node.js) else client-side\n if (typeof module !== 'undefined' && module.exports) {\n module.exports = SchemaInspector;\n } else {\n window.SchemaInspector = SchemaInspector;\n }\n\n SchemaInspector.newSanitization = function (schema, custom) {\n return new Sanitization(schema, custom);\n };\n\n SchemaInspector.newValidation = function (schema, custom) {\n return new Validation(schema, custom);\n };\n\n SchemaInspector.Validation = Validation;\n SchemaInspector.Sanitization = Sanitization;\n\n SchemaInspector.sanitize = function (schema, post, custom, callback) {\n if (arguments.length === 3 && typeof custom === 'function') {\n callback = custom;\n custom = null;\n }\n return new Sanitization(schema, custom).sanitize(post, callback);\n };\n\n SchemaInspector.validate = function (schema, candidate, custom, callback) {\n if (arguments.length === 3 && typeof custom === 'function') {\n callback = custom;\n custom = null;\n }\n return new Validation(schema, custom).validate(candidate, callback);\n };\n\n SchemaInspector.generate = function (schema, n) {\n if (typeof n === 'number') {\n var r = new Array(n);\n for (var i = 0; i < n; i++) {\n r[i] = CandidateGenerator.instance().generate(schema);\n }\n return r;\n }\n return CandidateGenerator.instance().generate(schema);\n };\n})();\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n typeof define === 'function' && define.amd ? define(['exports'], factory) :\n (factory((global.async = global.async \|\| {})));\n}(this, (function (exports) { 'use strict';\n\nfunction slice(arrayLike, start) {\n start = start\|0;\n var newLen = Math.max(arrayLike.length - start, 0);\n var newArr = Array(newLen);\n for(var idx = 0; idx < newLen; idx++) {\n newArr[idx] = arrayLike[start + idx];\n }\n return newArr;\n}\n\n/*\n Creates a continuation function with some arguments already applied.\n \n Useful as a shorthand when combined with other control flow functions. Any\n * arguments passed to the returned function are added to the arguments\n * originally passed to apply.\n \n @name apply\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {Function} fn - The function you want to eventually apply all\n * arguments to. Invokes with (arguments...).\n * @param {...} arguments... - Any number of arguments to automatically apply\n when the continuation is called.\n * @returns {Function} the partially-applied function\n * @example\n \n // using apply\n * async.parallel([\n * async.apply(fs.writeFile, 'testfile1', 'test1'),\n * async.apply(fs.writeFile, 'testfile2', 'test2')\n * ]);\n \n \n * // the same process without using apply\n * async.parallel([\n * function(callback) {\n * fs.writeFile('testfile1', 'test1', callback);\n * },\n * function(callback) {\n * fs.writeFile('testfile2', 'test2', callback);\n * }\n * ]);\n \n // It's possible to pass any number of additional arguments when calling the\n * // continuation:\n \n node> var fn = async.apply(sys.puts, 'one');\n * node> fn('two', 'three');\n * one\n * two\n * three\n /\nvar apply = function(fn/, ...args/) {\n var args = slice(arguments, 1);\n return function(/callArgs/) {\n var callArgs = slice(arguments);\n return fn.apply(null, args.concat(callArgs));\n };\n};\n\nvar initialParams = function (fn) {\n return function (/...args, callback/) {\n var args = slice(arguments);\n var callback = args.pop();\n fn.call(this, args, callback);\n };\n};\n\n/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' \|\| type == 'function');\n}\n\nvar hasSetImmediate = typeof setImmediate === 'function' && setImmediate;\nvar hasNextTick = typeof process === 'object' && typeof process.nextTick === 'function';\n\nfunction fallback(fn) {\n setTimeout(fn, 0);\n}\n\nfunction wrap(defer) {\n return function (fn/, ...args/) {\n var args = slice(arguments, 1);\n defer(function () {\n fn.apply(null, args);\n });\n };\n}\n\nvar _defer;\n\nif (hasSetImmediate) {\n _defer = setImmediate;\n} else if (hasNextTick) {\n _defer = process.nextTick;\n} else {\n _defer = fallback;\n}\n\nvar setImmediate$1 = wrap(_defer);\n\n/\n Take a sync function and make it async, passing its return value to a\n * callback. This is useful for plugging sync functions into a waterfall,\n * series, or other async functions. Any arguments passed to the generated\n * function will be passed to the wrapped function (except for the final\n * callback argument). Errors thrown will be passed to the callback.\n \n If the function passed to `asyncify` returns a Promise, that promises's\n * resolved/rejected state will be used to call the callback, rather than simply\n * the synchronous return value.\n \n This also means you can asyncify ES2017 `async` functions.\n \n @name asyncify\n * @static\n * @memberOf module:Utils\n * @method\n * @alias wrapSync\n * @category Util\n * @param {Function} func - The synchronous function, or Promise-returning\n * function to convert to an {@link AsyncFunction}.\n * @returns {AsyncFunction} An asynchronous wrapper of the `func`. To be\n * invoked with `(args..., callback)`.\n * @example\n \n // passing a regular synchronous function\n * async.waterfall([\n * async.apply(fs.readFile, filename, \"utf8\"),\n * async.asyncify(JSON.parse),\n * function (data, next) {\n * // data is the result of parsing the text.\n * // If there was a parsing error, it would have been caught.\n * }\n * ], callback);\n \n // passing a function returning a promise\n * async.waterfall([\n * async.apply(fs.readFile, filename, \"utf8\"),\n * async.asyncify(function (contents) {\n * return db.model.create(contents);\n * }),\n * function (model, next) {\n * // `model` is the instantiated model object.\n * // If there was an error, this function would be skipped.\n * }\n * ], callback);\n \n // es2017 example, though `asyncify` is not needed if your JS environment\n * // supports async functions out of the box\n * var q = async.queue(async.asyncify(async function(file) {\n * var intermediateStep = await processFile(file);\n * return await somePromise(intermediateStep)\n * }));\n \n q.push(files);\n /\nfunction asyncify(func) {\n return initialParams(function (args, callback) {\n var result;\n try {\n result = func.apply(this, args);\n } catch (e) {\n return callback(e);\n }\n // if result is Promise object\n if (isObject(result) && typeof result.then === 'function') {\n result.then(function(value) {\n invokeCallback(callback, null, value);\n }, function(err) {\n invokeCallback(callback, err.message ? err : new Error(err));\n });\n } else {\n callback(null, result);\n }\n });\n}\n\nfunction invokeCallback(callback, error, value) {\n try {\n callback(error, value);\n } catch (e) {\n setImmediate$1(rethrow, e);\n }\n}\n\nfunction rethrow(error) {\n throw error;\n}\n\nvar supportsSymbol = typeof Symbol === 'function';\n\nfunction isAsync(fn) {\n return supportsSymbol && fn[Symbol.toStringTag] === 'AsyncFunction';\n}\n\nfunction wrapAsync(asyncFn) {\n return isAsync(asyncFn) ? asyncify(asyncFn) : asyncFn;\n}\n\nfunction applyEach$1(eachfn) {\n return function(fns/, ...args/) {\n var args = slice(arguments, 1);\n var go = initialParams(function(args, callback) {\n var that = this;\n return eachfn(fns, function (fn, cb) {\n wrapAsync(fn).apply(that, args.concat(cb));\n }, callback);\n });\n if (args.length) {\n return go.apply(this, args);\n }\n else {\n return go;\n }\n };\n}\n\n/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\n/* Built-in value references. /\nvar Symbol$1 = root.Symbol;\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/* Built-in value references. /\nvar symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/\n A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the raw `toStringTag`.\n /\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag$1),\n tag = value[symToStringTag$1];\n\n try {\n value[symToStringTag$1] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag$1] = tag;\n } else {\n delete value[symToStringTag$1];\n }\n }\n return result;\n}\n\n/* Used for built-in method references. /\nvar objectProto$1 = Object.prototype;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString$1 = objectProto$1.toString;\n\n/\n Converts `value` to a string using `Object.prototype.toString`.\n \n @private\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n /\nfunction objectToString(value) {\n return nativeObjectToString$1.call(value);\n}\n\n/* `Object#toString` result references. /\nvar nullTag = '[object Null]';\nvar undefinedTag = '[object Undefined]';\n\n/* Built-in value references. /\nvar symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/\n The base implementation of `getTag` without fallbacks for buggy environments.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\n/* `Object#toString` result references. /\nvar asyncTag = '[object AsyncFunction]';\nvar funcTag = '[object Function]';\nvar genTag = '[object GeneratorFunction]';\nvar proxyTag = '[object Proxy]';\n\n/\n Checks if `value` is classified as a `Function` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag \|\| tag == genTag \|\| tag == asyncTag \|\| tag == proxyTag;\n}\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n// A temporary value used to identify if the loop should be broken.\n// See #1064, #1293\nvar breakLoop = {};\n\n/\n This method returns `undefined`.\n \n @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n \n _.times(2, _.noop);\n * // => [undefined, undefined]\n /\nfunction noop() {\n // No operation performed.\n}\n\nfunction once(fn) {\n return function () {\n if (fn === null) return;\n var callFn = fn;\n fn = null;\n callFn.apply(this, arguments);\n };\n}\n\nvar iteratorSymbol = typeof Symbol === 'function' && Symbol.iterator;\n\nvar getIterator = function (coll) {\n return iteratorSymbol && coll[iteratorSymbol] && coll[iteratorSymbol]();\n};\n\n/\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]';\n\n/\n The base implementation of `_.isArguments`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n /\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/* Used for built-in method references. /\nvar objectProto$3 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$2 = objectProto$3.hasOwnProperty;\n\n/* Built-in value references. /\nvar propertyIsEnumerable = objectProto$3.propertyIsEnumerable;\n\n/\n Checks if `value` is likely an `arguments` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty$2.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\n/\n Checks if `value` is classified as an `Array` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\n/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER$1 = 9007199254740991;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/*\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER$1 : length;\n\n return !!length &&\n (type == 'number' \|\|\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/* `Object#toString` result references. /\nvar argsTag$1 = '[object Arguments]';\nvar arrayTag = '[object Array]';\nvar boolTag = '[object Boolean]';\nvar dateTag = '[object Date]';\nvar errorTag = '[object Error]';\nvar funcTag$1 = '[object Function]';\nvar mapTag = '[object Map]';\nvar numberTag = '[object Number]';\nvar objectTag = '[object Object]';\nvar regexpTag = '[object RegExp]';\nvar setTag = '[object Set]';\nvar stringTag = '[object String]';\nvar weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]';\nvar dataViewTag = '[object DataView]';\nvar float32Tag = '[object Float32Array]';\nvar float64Tag = '[object Float64Array]';\nvar int8Tag = '[object Int8Array]';\nvar int16Tag = '[object Int16Array]';\nvar int32Tag = '[object Int32Array]';\nvar uint8Tag = '[object Uint8Array]';\nvar uint8ClampedTag = '[object Uint8ClampedArray]';\nvar uint16Tag = '[object Uint16Array]';\nvar uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values of typed arrays. /\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag$1] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag$1] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/\n The base implementation of `_.isTypedArray` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n /\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/\n The base implementation of `_.unary` without support for storing metadata.\n \n @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n /\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\n/* Detect free variable `exports`. /\nvar freeExports$1 = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule$1 = freeExports$1 && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports$1 = freeModule$1 && freeModule$1.exports === freeExports$1;\n\n/* Detect free variable `process` from Node.js. /\nvar freeProcess = moduleExports$1 && freeGlobal.process;\n\n/* Used to access faster Node.js helpers. /\nvar nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule$1 && freeModule$1.require && freeModule$1.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n}());\n\n/ Node.js helper references. /\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/\n Checks if `value` is classified as a typed array.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n \n _.isTypedArray(new Uint8Array);\n * // => true\n \n _.isTypedArray([]);\n * // => false\n /\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/* Used for built-in method references. /\nvar objectProto$2 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$1 = objectProto$2.hasOwnProperty;\n\n/\n Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr \|\| isArg \|\| isBuff \|\| isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty$1.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' \|\|\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' \|\| key == 'parent')) \|\|\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' \|\| key == 'byteLength' \|\| key == 'byteOffset')) \|\|\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/* Used for built-in method references. /\nvar objectProto$5 = Object.prototype;\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto$5;\n\n return value === proto;\n}\n\n/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeKeys = overArg(Object.keys, Object);\n\n/* Used for built-in method references. /\nvar objectProto$4 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$3 = objectProto$4.hasOwnProperty;\n\n/\n The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty$3.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nfunction createArrayIterator(coll) {\n var i = -1;\n var len = coll.length;\n return function next() {\n return ++i < len ? {value: coll[i], key: i} : null;\n }\n}\n\nfunction createES2015Iterator(iterator) {\n var i = -1;\n return function next() {\n var item = iterator.next();\n if (item.done)\n return null;\n i++;\n return {value: item.value, key: i};\n }\n}\n\nfunction createObjectIterator(obj) {\n var okeys = keys(obj);\n var i = -1;\n var len = okeys.length;\n return function next() {\n var key = okeys[++i];\n if (key === '__proto__') {\n return next();\n }\n return i < len ? {value: obj[key], key: key} : null;\n };\n}\n\nfunction iterator(coll) {\n if (isArrayLike(coll)) {\n return createArrayIterator(coll);\n }\n\n var iterator = getIterator(coll);\n return iterator ? createES2015Iterator(iterator) : createObjectIterator(coll);\n}\n\nfunction onlyOnce(fn) {\n return function() {\n if (fn === null) throw new Error(\"Callback was already called.\");\n var callFn = fn;\n fn = null;\n callFn.apply(this, arguments);\n };\n}\n\nfunction _eachOfLimit(limit) {\n return function (obj, iteratee, callback) {\n callback = once(callback \|\| noop);\n if (limit <= 0 \|\| !obj) {\n return callback(null);\n }\n var nextElem = iterator(obj);\n var done = false;\n var running = 0;\n var looping = false;\n\n function iterateeCallback(err, value) {\n running -= 1;\n if (err) {\n done = true;\n callback(err);\n }\n else if (value === breakLoop \|\| (done && running <= 0)) {\n done = true;\n return callback(null);\n }\n else if (!looping) {\n replenish();\n }\n }\n\n function replenish () {\n looping = true;\n while (running < limit && !done) {\n var elem = nextElem();\n if (elem === null) {\n done = true;\n if (running <= 0) {\n callback(null);\n }\n return;\n }\n running += 1;\n iteratee(elem.value, elem.key, onlyOnce(iterateeCallback));\n }\n looping = false;\n }\n\n replenish();\n };\n}\n\n/\n The same as [`eachOf`]{@link module:Collections.eachOf} but runs a maximum of `limit` async operations at a\n * time.\n \n @name eachOfLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`. The `key` is the item's key, or index in the case of an\n * array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nfunction eachOfLimit(coll, limit, iteratee, callback) {\n _eachOfLimit(limit)(coll, wrapAsync(iteratee), callback);\n}\n\nfunction doLimit(fn, limit) {\n return function (iterable, iteratee, callback) {\n return fn(iterable, limit, iteratee, callback);\n };\n}\n\n// eachOf implementation optimized for array-likes\nfunction eachOfArrayLike(coll, iteratee, callback) {\n callback = once(callback \|\| noop);\n var index = 0,\n completed = 0,\n length = coll.length;\n if (length === 0) {\n callback(null);\n }\n\n function iteratorCallback(err, value) {\n if (err) {\n callback(err);\n } else if ((++completed === length) \|\| value === breakLoop) {\n callback(null);\n }\n }\n\n for (; index < length; index++) {\n iteratee(coll[index], index, onlyOnce(iteratorCallback));\n }\n}\n\n// a generic version of eachOf which can handle array, object, and iterator cases.\nvar eachOfGeneric = doLimit(eachOfLimit, Infinity);\n\n/\n Like [`each`]{@link module:Collections.each}, except that it passes the key (or index) as the second argument\n * to the iteratee.\n \n @name eachOf\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEachOf\n * @category Collection\n * @see [async.each]{@link module:Collections.each}\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each\n * item in `coll`.\n * The `key` is the item's key, or index in the case of an array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n \n var obj = {dev: \"/dev.json\", test: \"/test.json\", prod: \"/prod.json\"};\n * var configs = {};\n \n async.forEachOf(obj, function (value, key, callback) {\n * fs.readFile(__dirname + value, \"utf8\", function (err, data) {\n * if (err) return callback(err);\n * try {\n * configs[key] = JSON.parse(data);\n * } catch (e) {\n * return callback(e);\n * }\n * callback();\n * });\n * }, function (err) {\n * if (err) console.error(err.message);\n * // configs is now a map of JSON data\n * doSomethingWith(configs);\n * });\n /\nvar eachOf = function(coll, iteratee, callback) {\n var eachOfImplementation = isArrayLike(coll) ? eachOfArrayLike : eachOfGeneric;\n eachOfImplementation(coll, wrapAsync(iteratee), callback);\n};\n\nfunction doParallel(fn) {\n return function (obj, iteratee, callback) {\n return fn(eachOf, obj, wrapAsync(iteratee), callback);\n };\n}\n\nfunction _asyncMap(eachfn, arr, iteratee, callback) {\n callback = callback \|\| noop;\n arr = arr \|\| [];\n var results = [];\n var counter = 0;\n var _iteratee = wrapAsync(iteratee);\n\n eachfn(arr, function (value, _, callback) {\n var index = counter++;\n _iteratee(value, function (err, v) {\n results[index] = v;\n callback(err);\n });\n }, function (err) {\n callback(err, results);\n });\n}\n\n/\n Produces a new collection of values by mapping each value in `coll` through\n * the `iteratee` function. The `iteratee` is called with an item from `coll`\n * and a callback for when it has finished processing. Each of these callback\n * takes 2 arguments: an `error`, and the transformed item from `coll`. If\n * `iteratee` passes an error to its callback, the main `callback` (for the\n * `map` function) is immediately called with the error.\n \n Note, that since this function applies the `iteratee` to each item in\n * parallel, there is no guarantee that the `iteratee` functions will complete\n * in order. However, the results array will be in the same order as the\n * original `coll`.\n \n If `map` is passed an Object, the results will be an Array. The results\n * will roughly be in the order of the original Objects' keys (but this can\n * vary across JavaScript engines).\n \n @name map\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an Array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @example\n \n async.map(['file1','file2','file3'], fs.stat, function(err, results) {\n * // results is now an array of stats for each file\n * });\n /\nvar map = doParallel(_asyncMap);\n\n/\n Applies the provided arguments to each function in the array, calling\n * `callback` after all functions have completed. If you only provide the first\n * argument, `fns`, then it will return a function which lets you pass in the\n * arguments as if it were a single function call. If more arguments are\n * provided, `callback` is required while `args` is still optional.\n \n @name applyEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} fns - A collection of {@link AsyncFunction}s\n * to all call with the same arguments\n * @param {...} [args] - any number of separate arguments to pass to the\n function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument, `fns`, is provided, it will\n * return a function which lets you pass in the arguments as if it were a single\n * function call. The signature is `(..args, callback)`. If invoked with any\n * arguments, `callback` is required.\n * @example\n \n async.applyEach([enableSearch, updateSchema], 'bucket', callback);\n \n // partial application example:\n * async.each(\n * buckets,\n * async.applyEach([enableSearch, updateSchema]),\n * callback\n * );\n /\nvar applyEach = applyEach$1(map);\n\nfunction doParallelLimit(fn) {\n return function (obj, limit, iteratee, callback) {\n return fn(_eachOfLimit(limit), obj, wrapAsync(iteratee), callback);\n };\n}\n\n/\n The same as [`map`]{@link module:Collections.map} but runs a maximum of `limit` async operations at a time.\n \n @name mapLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n /\nvar mapLimit = doParallelLimit(_asyncMap);\n\n/\n The same as [`map`]{@link module:Collections.map} but runs only a single async operation at a time.\n \n @name mapSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n /\nvar mapSeries = doLimit(mapLimit, 1);\n\n/\n The same as [`applyEach`]{@link module:ControlFlow.applyEach} but runs only a single async operation at a time.\n \n @name applyEachSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.applyEach]{@link module:ControlFlow.applyEach}\n * @category Control Flow\n * @param {Array\|Iterable\|Object} fns - A collection of {@link AsyncFunction}s to all\n * call with the same arguments\n * @param {...} [args] - any number of separate arguments to pass to the\n function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument is provided, it will return\n * a function which lets you pass in the arguments as if it were a single\n * function call.\n /\nvar applyEachSeries = applyEach$1(mapSeries);\n\n/\n A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\n/\n Creates a base function for methods like `_.forIn` and `_.forOwn`.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n}\n\n/\n The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n /\nvar baseFor = createBaseFor();\n\n/\n The base implementation of `_.forOwn` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n /\nfunction baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n}\n\n/\n The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.isNaN` without support for number objects.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n /\nfunction baseIsNaN(value) {\n return value !== value;\n}\n\n/\n A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\n/\n Determines the best order for running the {@link AsyncFunction}s in `tasks`, based on\n * their requirements. Each function can optionally depend on other functions\n * being completed first, and each function is run as soon as its requirements\n * are satisfied.\n \n If any of the {@link AsyncFunction}s pass an error to their callback, the `auto` sequence\n * will stop. Further tasks will not execute (so any other functions depending\n * on it will not run), and the main `callback` is immediately called with the\n * error.\n \n {@link AsyncFunction}s also receive an object containing the results of functions which\n * have completed so far as the first argument, if they have dependencies. If a\n * task function has no dependencies, it will only be passed a callback.\n \n @name auto\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Object} tasks - An object. Each of its properties is either a\n * function or an array of requirements, with the {@link AsyncFunction} itself the last item\n * in the array. The object's key of a property serves as the name of the task\n * defined by that property, i.e. can be used when specifying requirements for\n * other tasks. The function receives one or two arguments:\n * * a `results` object, containing the results of the previously executed\n * functions, only passed if the task has any dependencies,\n * * a `callback(err, result)` function, which must be called when finished,\n * passing an `error` (which can be `null`) and the result of the function's\n * execution.\n * @param {number} [concurrency=Infinity] - An optional `integer` for\n * determining the maximum number of tasks that can be run in parallel. By\n * default, as many as possible.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback. Results are always returned; however, if an\n * error occurs, no further `tasks` will be performed, and the results object\n * will only contain partial results. Invoked with (err, results).\n * @returns undefined\n * @example\n \n async.auto({\n * // this function will just be passed a callback\n * readData: async.apply(fs.readFile, 'data.txt', 'utf-8'),\n * showData: ['readData', function(results, cb) {\n * // results.readData is the file's contents\n * // ...\n * }]\n * }, callback);\n \n async.auto({\n * get_data: function(callback) {\n * console.log('in get_data');\n * // async code to get some data\n * callback(null, 'data', 'converted to array');\n * },\n * make_folder: function(callback) {\n * console.log('in make_folder');\n * // async code to create a directory to store a file in\n * // this is run at the same time as getting the data\n * callback(null, 'folder');\n * },\n * write_file: ['get_data', 'make_folder', function(results, callback) {\n * console.log('in write_file', JSON.stringify(results));\n * // once there is some data and the directory exists,\n * // write the data to a file in the directory\n * callback(null, 'filename');\n * }],\n * email_link: ['write_file', function(results, callback) {\n * console.log('in email_link', JSON.stringify(results));\n * // once the file is written let's email a link to it...\n * // results.write_file contains the filename returned by write_file.\n * callback(null, {'file':results.write_file, 'email':'user@example.com'});\n * }]\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('results = ', results);\n * });\n /\nvar auto = function (tasks, concurrency, callback) {\n if (typeof concurrency === 'function') {\n // concurrency is optional, shift the args.\n callback = concurrency;\n concurrency = null;\n }\n callback = once(callback \|\| noop);\n var keys$$1 = keys(tasks);\n var numTasks = keys$$1.length;\n if (!numTasks) {\n return callback(null);\n }\n if (!concurrency) {\n concurrency = numTasks;\n }\n\n var results = {};\n var runningTasks = 0;\n var hasError = false;\n\n var listeners = Object.create(null);\n\n var readyTasks = [];\n\n // for cycle detection:\n var readyToCheck = []; // tasks that have been identified as reachable\n // without the possibility of returning to an ancestor task\n var uncheckedDependencies = {};\n\n baseForOwn(tasks, function (task, key) {\n if (!isArray(task)) {\n // no dependencies\n enqueueTask(key, [task]);\n readyToCheck.push(key);\n return;\n }\n\n var dependencies = task.slice(0, task.length - 1);\n var remainingDependencies = dependencies.length;\n if (remainingDependencies === 0) {\n enqueueTask(key, task);\n readyToCheck.push(key);\n return;\n }\n uncheckedDependencies[key] = remainingDependencies;\n\n arrayEach(dependencies, function (dependencyName) {\n if (!tasks[dependencyName]) {\n throw new Error('async.auto task `' + key +\n '` has a non-existent dependency `' +\n dependencyName + '` in ' +\n dependencies.join(', '));\n }\n addListener(dependencyName, function () {\n remainingDependencies--;\n if (remainingDependencies === 0) {\n enqueueTask(key, task);\n }\n });\n });\n });\n\n checkForDeadlocks();\n processQueue();\n\n function enqueueTask(key, task) {\n readyTasks.push(function () {\n runTask(key, task);\n });\n }\n\n function processQueue() {\n if (readyTasks.length === 0 && runningTasks === 0) {\n return callback(null, results);\n }\n while(readyTasks.length && runningTasks < concurrency) {\n var run = readyTasks.shift();\n run();\n }\n\n }\n\n function addListener(taskName, fn) {\n var taskListeners = listeners[taskName];\n if (!taskListeners) {\n taskListeners = listeners[taskName] = [];\n }\n\n taskListeners.push(fn);\n }\n\n function taskComplete(taskName) {\n var taskListeners = listeners[taskName] \|\| [];\n arrayEach(taskListeners, function (fn) {\n fn();\n });\n processQueue();\n }\n\n\n function runTask(key, task) {\n if (hasError) return;\n\n var taskCallback = onlyOnce(function(err, result) {\n runningTasks--;\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n }\n if (err) {\n var safeResults = {};\n baseForOwn(results, function(val, rkey) {\n safeResults[rkey] = val;\n });\n safeResults[key] = result;\n hasError = true;\n listeners = Object.create(null);\n\n callback(err, safeResults);\n } else {\n results[key] = result;\n taskComplete(key);\n }\n });\n\n runningTasks++;\n var taskFn = wrapAsync(task[task.length - 1]);\n if (task.length > 1) {\n taskFn(results, taskCallback);\n } else {\n taskFn(taskCallback);\n }\n }\n\n function checkForDeadlocks() {\n // Kahn's algorithm\n // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm\n // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html\n var currentTask;\n var counter = 0;\n while (readyToCheck.length) {\n currentTask = readyToCheck.pop();\n counter++;\n arrayEach(getDependents(currentTask), function (dependent) {\n if (--uncheckedDependencies[dependent] === 0) {\n readyToCheck.push(dependent);\n }\n });\n }\n\n if (counter !== numTasks) {\n throw new Error(\n 'async.auto cannot execute tasks due to a recursive dependency'\n );\n }\n }\n\n function getDependents(taskName) {\n var result = [];\n baseForOwn(tasks, function (task, key) {\n if (isArray(task) && baseIndexOf(task, taskName, 0) >= 0) {\n result.push(key);\n }\n });\n return result;\n }\n};\n\n/\n A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\n/* `Object#toString` result references. /\nvar symbolTag = '[object Symbol]';\n\n/\n Checks if `value` is classified as a `Symbol` primitive or object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n \n _.isSymbol(Symbol.iterator);\n * // => true\n \n _.isSymbol('abc');\n * // => false\n /\nfunction isSymbol(value) {\n return typeof value == 'symbol' \|\|\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol$1 ? Symbol$1.prototype : undefined;\nvar symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/\n The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n \n @private\n * @param {} value The value to process.\n @returns {string} Returns the string.\n /\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\n/\n The base implementation of `_.slice` without an iteratee call guard.\n \n @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n /\nfunction baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n}\n\n/\n Casts `array` to a slice if it's needed.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n /\nfunction castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n \n @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n /\nfunction charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n}\n\n/\n Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n \n @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n /\nfunction charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n}\n\n/\n Converts an ASCII `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction asciiToArray(string) {\n return string.split('');\n}\n\n/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange;\nvar rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsZWJ = '\\\\u200d';\n\n/* Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). /\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n/\n Checks if `string` contains Unicode symbols.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n /\nfunction hasUnicode(string) {\n return reHasUnicode.test(string);\n}\n\n/* Used to compose unicode character classes. /\nvar rsAstralRange$1 = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange$1 = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange$1 = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange$1 = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange$1 = rsComboMarksRange$1 + reComboHalfMarksRange$1 + rsComboSymbolsRange$1;\nvar rsVarRange$1 = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsAstral = '[' + rsAstralRange$1 + ']';\nvar rsCombo = '[' + rsComboRange$1 + ']';\nvar rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]';\nvar rsModifier = '(?:' + rsCombo + '\|' + rsFitz + ')';\nvar rsNonAstral = '[^' + rsAstralRange$1 + ']';\nvar rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}';\nvar rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]';\nvar rsZWJ$1 = '\\\\u200d';\n\n/* Used to compose unicode regexes. /\nvar reOptMod = rsModifier + '?';\nvar rsOptVar = '[' + rsVarRange$1 + ']?';\nvar rsOptJoin = '(?:' + rsZWJ$1 + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('\|') + ')' + rsOptVar + reOptMod + ')';\nvar rsSeq = rsOptVar + reOptMod + rsOptJoin;\nvar rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('\|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). /\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')\|' + rsSymbol + rsSeq, 'g');\n\n/\n Converts a Unicode `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction unicodeToArray(string) {\n return string.match(reUnicode) \|\| [];\n}\n\n/\n Converts `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n}\n\n/\n Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n * @example\n \n _.toString(null);\n * // => ''\n \n _.toString(-0);\n * // => '-0'\n \n _.toString([1, 2, 3]);\n * // => '1,2,3'\n /\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\n/* Used to match leading and trailing whitespace. /\nvar reTrim = /^\\s+\|\\s+$/g;\n\n/\n Removes leading and trailing whitespace or specified characters from `string`.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n \n _.trim(' abc ');\n * // => 'abc'\n \n _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n \n _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n /\nfunction trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard \|\| chars === undefined)) {\n return string.replace(reTrim, '');\n }\n if (!string \|\| !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n}\n\nvar FN_ARGS = /^(?:async\\s+)?(function)?\\s[^\$]\\(\\s([^\$])\\)/m;\nvar FN_ARG_SPLIT = /,/;\nvar FN_ARG = /(=.+)?(\\s)$/;\nvar STRIP_COMMENTS = /((\\/\\/.$)\|(\\/\\[\\s\\S]?\\\\/))/mg;\n\nfunction parseParams(func) {\n func = func.toString().replace(STRIP_COMMENTS, '');\n func = func.match(FN_ARGS)[2].replace(' ', '');\n func = func ? func.split(FN_ARG_SPLIT) : [];\n func = func.map(function (arg){\n return trim(arg.replace(FN_ARG, ''));\n });\n return func;\n}\n\n/*\n A dependency-injected version of the [async.auto]{@link module:ControlFlow.auto} function. Dependent\n * tasks are specified as parameters to the function, after the usual callback\n * parameter, with the parameter names matching the names of the tasks it\n * depends on. This can provide even more readable task graphs which can be\n * easier to maintain.\n \n If a final callback is specified, the task results are similarly injected,\n * specified as named parameters after the initial error parameter.\n \n The autoInject function is purely syntactic sugar and its semantics are\n * otherwise equivalent to [async.auto]{@link module:ControlFlow.auto}.\n \n @name autoInject\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.auto]{@link module:ControlFlow.auto}\n * @category Control Flow\n * @param {Object} tasks - An object, each of whose properties is an {@link AsyncFunction} of\n * the form 'func([dependencies...], callback). The object's key of a property\n * serves as the name of the task defined by that property, i.e. can be used\n * when specifying requirements for other tasks.\n * * The `callback` parameter is a `callback(err, result)` which must be called\n * when finished, passing an `error` (which can be `null`) and the result of\n * the function's execution. The remaining parameters name other tasks on\n * which the task is dependent, and the results from those tasks are the\n * arguments of those parameters.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback, and a `results` object with any completed\n * task results, similar to `auto`.\n * @example\n \n // The example from `auto` can be rewritten as follows:\n * async.autoInject({\n * get_data: function(callback) {\n * // async code to get some data\n * callback(null, 'data', 'converted to array');\n * },\n * make_folder: function(callback) {\n * // async code to create a directory to store a file in\n * // this is run at the same time as getting the data\n * callback(null, 'folder');\n * },\n * write_file: function(get_data, make_folder, callback) {\n * // once there is some data and the directory exists,\n * // write the data to a file in the directory\n * callback(null, 'filename');\n * },\n * email_link: function(write_file, callback) {\n * // once the file is written let's email a link to it...\n * // write_file contains the filename returned by write_file.\n * callback(null, {'file':write_file, 'email':'user@example.com'});\n * }\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('email_link = ', results.email_link);\n * });\n \n // If you are using a JS minifier that mangles parameter names, `autoInject`\n * // will not work with plain functions, since the parameter names will be\n * // collapsed to a single letter identifier. To work around this, you can\n * // explicitly specify the names of the parameters your task function needs\n * // in an array, similar to Angular.js dependency injection.\n \n // This still has an advantage over plain `auto`, since the results a task\n * // depends on are still spread into arguments.\n * async.autoInject({\n * //...\n * write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {\n * callback(null, 'filename');\n * }],\n * email_link: ['write_file', function(write_file, callback) {\n * callback(null, {'file':write_file, 'email':'user@example.com'});\n * }]\n * //...\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('email_link = ', results.email_link);\n * });\n /\nfunction autoInject(tasks, callback) {\n var newTasks = {};\n\n baseForOwn(tasks, function (taskFn, key) {\n var params;\n var fnIsAsync = isAsync(taskFn);\n var hasNoDeps =\n (!fnIsAsync && taskFn.length === 1) \|\|\n (fnIsAsync && taskFn.length === 0);\n\n if (isArray(taskFn)) {\n params = taskFn.slice(0, -1);\n taskFn = taskFn[taskFn.length - 1];\n\n newTasks[key] = params.concat(params.length > 0 ? newTask : taskFn);\n } else if (hasNoDeps) {\n // no dependencies, use the function as-is\n newTasks[key] = taskFn;\n } else {\n params = parseParams(taskFn);\n if (taskFn.length === 0 && !fnIsAsync && params.length === 0) {\n throw new Error(\"autoInject task functions require explicit parameters.\");\n }\n\n // remove callback param\n if (!fnIsAsync) params.pop();\n\n newTasks[key] = params.concat(newTask);\n }\n\n function newTask(results, taskCb) {\n var newArgs = arrayMap(params, function (name) {\n return results[name];\n });\n newArgs.push(taskCb);\n wrapAsync(taskFn).apply(null, newArgs);\n }\n });\n\n auto(newTasks, callback);\n}\n\n// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation\n// used for queues. This implementation assumes that the node provided by the user can be modified\n// to adjust the next and last properties. We implement only the minimal functionality\n// for queue support.\nfunction DLL() {\n this.head = this.tail = null;\n this.length = 0;\n}\n\nfunction setInitial(dll, node) {\n dll.length = 1;\n dll.head = dll.tail = node;\n}\n\nDLL.prototype.removeLink = function(node) {\n if (node.prev) node.prev.next = node.next;\n else this.head = node.next;\n if (node.next) node.next.prev = node.prev;\n else this.tail = node.prev;\n\n node.prev = node.next = null;\n this.length -= 1;\n return node;\n};\n\nDLL.prototype.empty = function () {\n while(this.head) this.shift();\n return this;\n};\n\nDLL.prototype.insertAfter = function(node, newNode) {\n newNode.prev = node;\n newNode.next = node.next;\n if (node.next) node.next.prev = newNode;\n else this.tail = newNode;\n node.next = newNode;\n this.length += 1;\n};\n\nDLL.prototype.insertBefore = function(node, newNode) {\n newNode.prev = node.prev;\n newNode.next = node;\n if (node.prev) node.prev.next = newNode;\n else this.head = newNode;\n node.prev = newNode;\n this.length += 1;\n};\n\nDLL.prototype.unshift = function(node) {\n if (this.head) this.insertBefore(this.head, node);\n else setInitial(this, node);\n};\n\nDLL.prototype.push = function(node) {\n if (this.tail) this.insertAfter(this.tail, node);\n else setInitial(this, node);\n};\n\nDLL.prototype.shift = function() {\n return this.head && this.removeLink(this.head);\n};\n\nDLL.prototype.pop = function() {\n return this.tail && this.removeLink(this.tail);\n};\n\nDLL.prototype.toArray = function () {\n var arr = Array(this.length);\n var curr = this.head;\n for(var idx = 0; idx < this.length; idx++) {\n arr[idx] = curr.data;\n curr = curr.next;\n }\n return arr;\n};\n\nDLL.prototype.remove = function (testFn) {\n var curr = this.head;\n while(!!curr) {\n var next = curr.next;\n if (testFn(curr)) {\n this.removeLink(curr);\n }\n curr = next;\n }\n return this;\n};\n\nfunction queue(worker, concurrency, payload) {\n if (concurrency == null) {\n concurrency = 1;\n }\n else if(concurrency === 0) {\n throw new Error('Concurrency must not be zero');\n }\n\n var _worker = wrapAsync(worker);\n var numRunning = 0;\n var workersList = [];\n\n var processingScheduled = false;\n function _insert(data, insertAtFront, callback) {\n if (callback != null && typeof callback !== 'function') {\n throw new Error('task callback must be a function');\n }\n q.started = true;\n if (!isArray(data)) {\n data = [data];\n }\n if (data.length === 0 && q.idle()) {\n // call drain immediately if there are no tasks\n return setImmediate$1(function() {\n q.drain();\n });\n }\n\n for (var i = 0, l = data.length; i < l; i++) {\n var item = {\n data: data[i],\n callback: callback \|\| noop\n };\n\n if (insertAtFront) {\n q._tasks.unshift(item);\n } else {\n q._tasks.push(item);\n }\n }\n\n if (!processingScheduled) {\n processingScheduled = true;\n setImmediate$1(function() {\n processingScheduled = false;\n q.process();\n });\n }\n }\n\n function _next(tasks) {\n return function(err){\n numRunning -= 1;\n\n for (var i = 0, l = tasks.length; i < l; i++) {\n var task = tasks[i];\n\n var index = baseIndexOf(workersList, task, 0);\n if (index === 0) {\n workersList.shift();\n } else if (index > 0) {\n workersList.splice(index, 1);\n }\n\n task.callback.apply(task, arguments);\n\n if (err != null) {\n q.error(err, task.data);\n }\n }\n\n if (numRunning <= (q.concurrency - q.buffer) ) {\n q.unsaturated();\n }\n\n if (q.idle()) {\n q.drain();\n }\n q.process();\n };\n }\n\n var isProcessing = false;\n var q = {\n _tasks: new DLL(),\n concurrency: concurrency,\n payload: payload,\n saturated: noop,\n unsaturated:noop,\n buffer: concurrency / 4,\n empty: noop,\n drain: noop,\n error: noop,\n started: false,\n paused: false,\n push: function (data, callback) {\n _insert(data, false, callback);\n },\n kill: function () {\n q.drain = noop;\n q._tasks.empty();\n },\n unshift: function (data, callback) {\n _insert(data, true, callback);\n },\n remove: function (testFn) {\n q._tasks.remove(testFn);\n },\n process: function () {\n // Avoid trying to start too many processing operations. This can occur\n // when callbacks resolve synchronously (#1267).\n if (isProcessing) {\n return;\n }\n isProcessing = true;\n while(!q.paused && numRunning < q.concurrency && q._tasks.length){\n var tasks = [], data = [];\n var l = q._tasks.length;\n if (q.payload) l = Math.min(l, q.payload);\n for (var i = 0; i < l; i++) {\n var node = q._tasks.shift();\n tasks.push(node);\n workersList.push(node);\n data.push(node.data);\n }\n\n numRunning += 1;\n\n if (q._tasks.length === 0) {\n q.empty();\n }\n\n if (numRunning === q.concurrency) {\n q.saturated();\n }\n\n var cb = onlyOnce(_next(tasks));\n _worker(data, cb);\n }\n isProcessing = false;\n },\n length: function () {\n return q._tasks.length;\n },\n running: function () {\n return numRunning;\n },\n workersList: function () {\n return workersList;\n },\n idle: function() {\n return q._tasks.length + numRunning === 0;\n },\n pause: function () {\n q.paused = true;\n },\n resume: function () {\n if (q.paused === false) { return; }\n q.paused = false;\n setImmediate$1(q.process);\n }\n };\n return q;\n}\n\n/\n A cargo of tasks for the worker function to complete. Cargo inherits all of\n * the same methods and event callbacks as [`queue`]{@link module:ControlFlow.queue}.\n * @typedef {Object} CargoObject\n * @memberOf module:ControlFlow\n * @property {Function} length - A function returning the number of items\n * waiting to be processed. Invoke like `cargo.length()`.\n * @property {number} payload - An `integer` for determining how many tasks\n * should be process per round. This property can be changed after a `cargo` is\n * created to alter the payload on-the-fly.\n * @property {Function} push - Adds `task` to the `queue`. The callback is\n * called once the `worker` has finished processing the task. Instead of a\n * single task, an array of `tasks` can be submitted. The respective callback is\n * used for every task in the list. Invoke like `cargo.push(task, [callback])`.\n * @property {Function} saturated - A callback that is called when the\n * `queue.length()` hits the concurrency and further tasks will be queued.\n * @property {Function} empty - A callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - A callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke like `cargo.idle()`.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke like `cargo.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke like `cargo.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. Invoke like `cargo.kill()`.\n /\n\n/\n Creates a `cargo` object with the specified payload. Tasks added to the\n * cargo will be processed altogether (up to the `payload` limit). If the\n * `worker` is in progress, the task is queued until it becomes available. Once\n * the `worker` has completed some tasks, each callback of those tasks is\n * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)\n * for how `cargo` and `queue` work.\n \n While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers\n * at a time, cargo passes an array of tasks to a single worker, repeating\n * when the worker is finished.\n \n @name cargo\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An asynchronous function for processing an array\n * of queued tasks. Invoked with `(tasks, callback)`.\n * @param {number} [payload=Infinity] - An optional `integer` for determining\n * how many tasks should be processed per round; if omitted, the default is\n * unlimited.\n * @returns {module:ControlFlow.CargoObject} A cargo object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the cargo and inner queue.\n * @example\n \n // create a cargo object with payload 2\n * var cargo = async.cargo(function(tasks, callback) {\n * for (var i=0; i<tasks.length; i++) {\n * console.log('hello ' + tasks[i].name);\n * }\n * callback();\n * }, 2);\n \n // add some items\n * cargo.push({name: 'foo'}, function(err) {\n * console.log('finished processing foo');\n * });\n * cargo.push({name: 'bar'}, function(err) {\n * console.log('finished processing bar');\n * });\n * cargo.push({name: 'baz'}, function(err) {\n * console.log('finished processing baz');\n * });\n /\nfunction cargo(worker, payload) {\n return queue(worker, 1, payload);\n}\n\n/\n The same as [`eachOf`]{@link module:Collections.eachOf} but runs only a single async operation at a time.\n \n @name eachOfSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Invoked with (err).\n /\nvar eachOfSeries = doLimit(eachOfLimit, 1);\n\n/\n Reduces `coll` into a single value using an async `iteratee` to return each\n * successive step. `memo` is the initial state of the reduction. This function\n * only operates in series.\n \n For performance reasons, it may make sense to split a call to this function\n * into a parallel map, and then use the normal `Array.prototype.reduce` on the\n * results. This function is for situations where each step in the reduction\n * needs to be async; if you can get the data before reducing it, then it's\n * probably a good idea to do so.\n \n @name reduce\n * @static\n * @memberOf module:Collections\n * @method\n * @alias inject\n * @alias foldl\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {} memo - The initial state of the reduction.\n @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n * @example\n \n async.reduce([1,2,3], 0, function(memo, item, callback) {\n * // pointless async:\n * process.nextTick(function() {\n * callback(null, memo + item)\n * });\n * }, function(err, result) {\n * // result is now equal to the last value of memo, which is 6\n * });\n /\nfunction reduce(coll, memo, iteratee, callback) {\n callback = once(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n eachOfSeries(coll, function(x, i, callback) {\n _iteratee(memo, x, function(err, v) {\n memo = v;\n callback(err);\n });\n }, function(err) {\n callback(err, memo);\n });\n}\n\n/\n Version of the compose function that is more natural to read. Each function\n * consumes the return value of the previous function. It is the equivalent of\n * [compose]{@link module:ControlFlow.compose} with the arguments reversed.\n \n Each function is executed with the `this` binding of the composed function.\n \n @name seq\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.compose]{@link module:ControlFlow.compose}\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} a function that composes the `functions` in order\n * @example\n \n // Requires lodash (or underscore), express3 and dresende's orm2.\n * // Part of an app, that fetches cats of the logged user.\n * // This example uses `seq` function to avoid overnesting and error\n * // handling clutter.\n * app.get('/cats', function(request, response) {\n * var User = request.models.User;\n * async.seq(\n * _.bind(User.get, User), // 'User.get' has signature (id, callback(err, data))\n * function(user, fn) {\n * user.getCats(fn); // 'getCats' has signature (callback(err, data))\n * }\n * )(req.session.user_id, function (err, cats) {\n * if (err) {\n * console.error(err);\n * response.json({ status: 'error', message: err.message });\n * } else {\n * response.json({ status: 'ok', message: 'Cats found', data: cats });\n * }\n * });\n * });\n /\nfunction seq(/...functions/) {\n var _functions = arrayMap(arguments, wrapAsync);\n return function(/...args/) {\n var args = slice(arguments);\n var that = this;\n\n var cb = args[args.length - 1];\n if (typeof cb == 'function') {\n args.pop();\n } else {\n cb = noop;\n }\n\n reduce(_functions, args, function(newargs, fn, cb) {\n fn.apply(that, newargs.concat(function(err/, ...nextargs/) {\n var nextargs = slice(arguments, 1);\n cb(err, nextargs);\n }));\n },\n function(err, results) {\n cb.apply(that, [err].concat(results));\n });\n };\n}\n\n/\n Creates a function which is a composition of the passed asynchronous\n * functions. Each function consumes the return value of the function that\n * follows. Composing functions `f()`, `g()`, and `h()` would produce the result\n * of `f(g(h()))`, only this version uses callbacks to obtain the return values.\n \n Each function is executed with the `this` binding of the composed function.\n \n @name compose\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} an asynchronous function that is the composed\n * asynchronous `functions`\n * @example\n \n function add1(n, callback) {\n * setTimeout(function () {\n * callback(null, n + 1);\n * }, 10);\n * }\n \n function mul3(n, callback) {\n * setTimeout(function () {\n * callback(null, n * 3);\n * }, 10);\n * }\n \n var add1mul3 = async.compose(mul3, add1);\n * add1mul3(4, function (err, result) {\n * // result now equals 15\n * });\n /\nvar compose = function(/...args/) {\n return seq.apply(null, slice(arguments).reverse());\n};\n\nvar _concat = Array.prototype.concat;\n\n/\n The same as [`concat`]{@link module:Collections.concat} but runs a maximum of `limit` async operations at a time.\n \n @name concatLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n /\nvar concatLimit = function(coll, limit, iteratee, callback) {\n callback = callback \|\| noop;\n var _iteratee = wrapAsync(iteratee);\n mapLimit(coll, limit, function(val, callback) {\n _iteratee(val, function(err /, ...args/) {\n if (err) return callback(err);\n return callback(null, slice(arguments, 1));\n });\n }, function(err, mapResults) {\n var result = [];\n for (var i = 0; i < mapResults.length; i++) {\n if (mapResults[i]) {\n result = _concat.apply(result, mapResults[i]);\n }\n }\n\n return callback(err, result);\n });\n};\n\n/\n Applies `iteratee` to each item in `coll`, concatenating the results. Returns\n * the concatenated list. The `iteratee`s are called in parallel, and the\n * results are concatenated as they return. There is no guarantee that the\n * results array will be returned in the original order of `coll` passed to the\n * `iteratee` function.\n \n @name concat\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @example\n \n async.concat(['dir1','dir2','dir3'], fs.readdir, function(err, files) {\n * // files is now a list of filenames that exist in the 3 directories\n * });\n /\nvar concat = doLimit(concatLimit, Infinity);\n\n/\n The same as [`concat`]{@link module:Collections.concat} but runs only a single async operation at a time.\n \n @name concatSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`.\n * The iteratee should complete with an array an array of results.\n * Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n /\nvar concatSeries = doLimit(concatLimit, 1);\n\n/\n Returns a function that when called, calls-back with the values provided.\n * Useful as the first function in a [`waterfall`]{@link module:ControlFlow.waterfall}, or for plugging values in to\n * [`auto`]{@link module:ControlFlow.auto}.\n \n @name constant\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {...} arguments... - Any number of arguments to automatically invoke\n callback with.\n * @returns {AsyncFunction} Returns a function that when invoked, automatically\n * invokes the callback with the previous given arguments.\n * @example\n \n async.waterfall([\n * async.constant(42),\n * function (value, next) {\n * // value === 42\n * },\n * //...\n * ], callback);\n \n async.waterfall([\n * async.constant(filename, \"utf8\"),\n * fs.readFile,\n * function (fileData, next) {\n * //...\n * }\n * //...\n * ], callback);\n \n async.auto({\n * hostname: async.constant(\"https://server.net/\"),\n * port: findFreePort,\n * launchServer: [\"hostname\", \"port\", function (options, cb) {\n * startServer(options, cb);\n * }],\n * //...\n * }, callback);\n /\nvar constant = function(/...values/) {\n var values = slice(arguments);\n var args = [null].concat(values);\n return function (/...ignoredArgs, callback/) {\n var callback = arguments[arguments.length - 1];\n return callback.apply(this, args);\n };\n};\n\n/\n This method returns the first argument it receives.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {} value Any value.\n @returns {} Returns `value`.\n @example\n \n var object = { 'a': 1 };\n \n console.log(_.identity(object) === object);\n * // => true\n /\nfunction identity(value) {\n return value;\n}\n\nfunction _createTester(check, getResult) {\n return function(eachfn, arr, iteratee, cb) {\n cb = cb \|\| noop;\n var testPassed = false;\n var testResult;\n eachfn(arr, function(value, _, callback) {\n iteratee(value, function(err, result) {\n if (err) {\n callback(err);\n } else if (check(result) && !testResult) {\n testPassed = true;\n testResult = getResult(true, value);\n callback(null, breakLoop);\n } else {\n callback();\n }\n });\n }, function(err) {\n if (err) {\n cb(err);\n } else {\n cb(null, testPassed ? testResult : getResult(false));\n }\n });\n };\n}\n\nfunction _findGetResult(v, x) {\n return x;\n}\n\n/\n Returns the first value in `coll` that passes an async truth test. The\n * `iteratee` is applied in parallel, meaning the first iteratee to return\n * `true` will fire the detect `callback` with that result. That means the\n * result might not be the first item in the original `coll` (in terms of order)\n * that passes the test.\n\n * If order within the original `coll` is important, then look at\n * [`detectSeries`]{@link module:Collections.detectSeries}.\n \n @name detect\n * @static\n * @memberOf module:Collections\n * @method\n * @alias find\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @example\n \n async.detect(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // result now equals the first file in the list that exists\n * });\n /\nvar detect = doParallel(_createTester(identity, _findGetResult));\n\n/\n The same as [`detect`]{@link module:Collections.detect} but runs a maximum of `limit` async operations at a\n * time.\n \n @name detectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findLimit\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n /\nvar detectLimit = doParallelLimit(_createTester(identity, _findGetResult));\n\n/\n The same as [`detect`]{@link module:Collections.detect} but runs only a single async operation at a time.\n \n @name detectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findSeries\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n /\nvar detectSeries = doLimit(detectLimit, 1);\n\nfunction consoleFunc(name) {\n return function (fn/, ...args/) {\n var args = slice(arguments, 1);\n args.push(function (err/, ...args/) {\n var args = slice(arguments, 1);\n if (typeof console === 'object') {\n if (err) {\n if (console.error) {\n console.error(err);\n }\n } else if (console[name]) {\n arrayEach(args, function (x) {\n console[name](x);\n });\n }\n }\n });\n wrapAsync(fn).apply(null, args);\n };\n}\n\n/\n Logs the result of an [`async` function]{@link AsyncFunction} to the\n * `console` using `console.dir` to display the properties of the resulting object.\n * Only works in Node.js or in browsers that support `console.dir` and\n * `console.error` (such as FF and Chrome).\n * If multiple arguments are returned from the async function,\n * `console.dir` is called on each argument in order.\n \n @name dir\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...} arguments... - Any number of arguments to apply to the function.\n @example\n \n // in a module\n * var hello = function(name, callback) {\n * setTimeout(function() {\n * callback(null, {hello: name});\n * }, 1000);\n * };\n \n // in the node repl\n * node> async.dir(hello, 'world');\n * {hello: 'world'}\n /\nvar dir = consoleFunc('dir');\n\n/\n The post-check version of [`during`]{@link module:ControlFlow.during}. To reflect the difference in\n * the order of operations, the arguments `test` and `fn` are switched.\n \n Also a version of [`doWhilst`]{@link module:ControlFlow.doWhilst} with asynchronous `test` function.\n * @name doDuring\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.during]{@link module:ControlFlow.during}\n * @category Control Flow\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (...args, callback), where `...args` are the\n * non-error args from the previous callback of `fn`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error if one occurred, otherwise `null`.\n /\nfunction doDuring(fn, test, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _fn = wrapAsync(fn);\n var _test = wrapAsync(test);\n\n function next(err/, ...args/) {\n if (err) return callback(err);\n var args = slice(arguments, 1);\n args.push(check);\n _test.apply(this, args);\n }\n\n function check(err, truth) {\n if (err) return callback(err);\n if (!truth) return callback(null);\n _fn(next);\n }\n\n check(null, true);\n\n}\n\n/\n The post-check version of [`whilst`]{@link module:ControlFlow.whilst}. To reflect the difference in\n * the order of operations, the arguments `test` and `iteratee` are switched.\n \n `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.\n \n @name doWhilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - A function which is called each time `test`\n * passes. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped.\n * `callback` will be passed an error and any arguments passed to the final\n * `iteratee`'s callback. Invoked with (err, [results]);\n /\nfunction doWhilst(iteratee, test, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n var next = function(err/, ...args/) {\n if (err) return callback(err);\n var args = slice(arguments, 1);\n if (test.apply(this, args)) return _iteratee(next);\n callback.apply(null, [null].concat(args));\n };\n _iteratee(next);\n}\n\n/\n Like ['doWhilst']{@link module:ControlFlow.doWhilst}, except the `test` is inverted. Note the\n * argument ordering differs from `until`.\n \n @name doUntil\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.doWhilst]{@link module:ControlFlow.doWhilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n /\nfunction doUntil(iteratee, test, callback) {\n doWhilst(iteratee, function() {\n return !test.apply(this, arguments);\n }, callback);\n}\n\n/\n Like [`whilst`]{@link module:ControlFlow.whilst}, except the `test` is an asynchronous function that\n * is passed a callback in the form of `function (err, truth)`. If error is\n * passed to `test` or `fn`, the main callback is immediately called with the\n * value of the error.\n \n @name during\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (callback).\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error, if one occurred, otherwise `null`.\n * @example\n \n var count = 0;\n \n async.during(\n * function (callback) {\n * return callback(null, count < 5);\n * },\n * function (callback) {\n * count++;\n * setTimeout(callback, 1000);\n * },\n * function (err) {\n * // 5 seconds have passed\n * }\n * );\n /\nfunction during(test, fn, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _fn = wrapAsync(fn);\n var _test = wrapAsync(test);\n\n function next(err) {\n if (err) return callback(err);\n _test(check);\n }\n\n function check(err, truth) {\n if (err) return callback(err);\n if (!truth) return callback(null);\n _fn(next);\n }\n\n _test(check);\n}\n\nfunction _withoutIndex(iteratee) {\n return function (value, index, callback) {\n return iteratee(value, callback);\n };\n}\n\n/\n Applies the function `iteratee` to each item in `coll`, in parallel.\n * The `iteratee` is called with an item from the list, and a callback for when\n * it has finished. If the `iteratee` passes an error to its `callback`, the\n * main `callback` (for the `each` function) is immediately called with the\n * error.\n \n Note, that since this function applies `iteratee` to each item in parallel,\n * there is no guarantee that the iteratee functions will complete in order.\n \n @name each\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEach\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to\n * each item in `coll`. Invoked with (item, callback).\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOf`.\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n \n // assuming openFiles is an array of file names and saveFile is a function\n * // to save the modified contents of that file:\n \n async.each(openFiles, saveFile, function(err){\n * // if any of the saves produced an error, err would equal that error\n * });\n \n // assuming openFiles is an array of file names\n * async.each(openFiles, function(file, callback) {\n \n // Perform operation on file here.\n * console.log('Processing file ' + file);\n \n if( file.length > 32 ) {\n * console.log('This file name is too long');\n * callback('File name too long');\n * } else {\n * // Do work to process file here\n * console.log('File processed');\n * callback();\n * }\n * }, function(err) {\n * // if any of the file processing produced an error, err would equal that error\n * if( err ) {\n * // One of the iterations produced an error.\n * // All processing will now stop.\n * console.log('A file failed to process');\n * } else {\n * console.log('All files have been processed successfully');\n * }\n * });\n /\nfunction eachLimit(coll, iteratee, callback) {\n eachOf(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/\n The same as [`each`]{@link module:Collections.each} but runs a maximum of `limit` async operations at a time.\n \n @name eachLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfLimit`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nfunction eachLimit$1(coll, limit, iteratee, callback) {\n _eachOfLimit(limit)(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/\n The same as [`each`]{@link module:Collections.each} but runs only a single async operation at a time.\n \n @name eachSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfSeries`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nvar eachSeries = doLimit(eachLimit$1, 1);\n\n/\n Wrap an async function and ensure it calls its callback on a later tick of\n * the event loop. If the function already calls its callback on a next tick,\n * no extra deferral is added. This is useful for preventing stack overflows\n * (`RangeError: Maximum call stack size exceeded`) and generally keeping\n * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)\n * contained. ES2017 `async` functions are returned as-is -- they are immune\n * to Zalgo's corrupting influences, as they always resolve on a later tick.\n \n @name ensureAsync\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - an async function, one that expects a node-style\n * callback as its last argument.\n * @returns {AsyncFunction} Returns a wrapped function with the exact same call\n * signature as the function passed in.\n * @example\n \n function sometimesAsync(arg, callback) {\n * if (cache[arg]) {\n * return callback(null, cache[arg]); // this would be synchronous!!\n * } else {\n * doSomeIO(arg, callback); // this IO would be asynchronous\n * }\n * }\n \n // this has a risk of stack overflows if many results are cached in a row\n * async.mapSeries(args, sometimesAsync, done);\n \n // this will defer sometimesAsync's callback if necessary,\n * // preventing stack overflows\n * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);\n /\nfunction ensureAsync(fn) {\n if (isAsync(fn)) return fn;\n return initialParams(function (args, callback) {\n var sync = true;\n args.push(function () {\n var innerArgs = arguments;\n if (sync) {\n setImmediate$1(function () {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n fn.apply(this, args);\n sync = false;\n });\n}\n\nfunction notId(v) {\n return !v;\n}\n\n/\n Returns `true` if every element in `coll` satisfies an async test. If any\n * iteratee call returns `false`, the main `callback` is immediately called.\n \n @name every\n * @static\n * @memberOf module:Collections\n * @method\n * @alias all\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @example\n \n async.every(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // if result is true then every file exists\n * });\n /\nvar every = doParallel(_createTester(notId, notId));\n\n/\n The same as [`every`]{@link module:Collections.every} but runs a maximum of `limit` async operations at a time.\n \n @name everyLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n /\nvar everyLimit = doParallelLimit(_createTester(notId, notId));\n\n/\n The same as [`every`]{@link module:Collections.every} but runs only a single async operation at a time.\n \n @name everySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in series.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n /\nvar everySeries = doLimit(everyLimit, 1);\n\n/\n The base implementation of `_.property` without support for deep paths.\n \n @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n}\n\nfunction filterArray(eachfn, arr, iteratee, callback) {\n var truthValues = new Array(arr.length);\n eachfn(arr, function (x, index, callback) {\n iteratee(x, function (err, v) {\n truthValues[index] = !!v;\n callback(err);\n });\n }, function (err) {\n if (err) return callback(err);\n var results = [];\n for (var i = 0; i < arr.length; i++) {\n if (truthValues[i]) results.push(arr[i]);\n }\n callback(null, results);\n });\n}\n\nfunction filterGeneric(eachfn, coll, iteratee, callback) {\n var results = [];\n eachfn(coll, function (x, index, callback) {\n iteratee(x, function (err, v) {\n if (err) {\n callback(err);\n } else {\n if (v) {\n results.push({index: index, value: x});\n }\n callback();\n }\n });\n }, function (err) {\n if (err) {\n callback(err);\n } else {\n callback(null, arrayMap(results.sort(function (a, b) {\n return a.index - b.index;\n }), baseProperty('value')));\n }\n });\n}\n\nfunction _filter(eachfn, coll, iteratee, callback) {\n var filter = isArrayLike(coll) ? filterArray : filterGeneric;\n filter(eachfn, coll, wrapAsync(iteratee), callback \|\| noop);\n}\n\n/\n Returns a new array of all the values in `coll` which pass an async truth\n * test. This operation is performed in parallel, but the results array will be\n * in the same order as the original.\n \n @name filter\n * @static\n * @memberOf module:Collections\n * @method\n * @alias select\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n \n async.filter(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, results) {\n * // results now equals an array of the existing files\n * });\n /\nvar filter = doParallel(_filter);\n\n/\n The same as [`filter`]{@link module:Collections.filter} but runs a maximum of `limit` async operations at a\n * time.\n \n @name filterLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar filterLimit = doParallelLimit(_filter);\n\n/\n The same as [`filter`]{@link module:Collections.filter} but runs only a single async operation at a time.\n \n @name filterSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results)\n /\nvar filterSeries = doLimit(filterLimit, 1);\n\n/\n Calls the asynchronous function `fn` with a callback parameter that allows it\n * to call itself again, in series, indefinitely.\n\n * If an error is passed to the callback then `errback` is called with the\n * error, and execution stops, otherwise it will never be called.\n \n @name forever\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} fn - an async function to call repeatedly.\n * Invoked with (next).\n * @param {Function} [errback] - when `fn` passes an error to it's callback,\n * this function will be called, and execution stops. Invoked with (err).\n * @example\n \n async.forever(\n * function(next) {\n * // next is suitable for passing to things that need a callback(err [, whatever]);\n * // it will result in this function being called again.\n * },\n * function(err) {\n * // if next is called with a value in its first parameter, it will appear\n * // in here as 'err', and execution will stop.\n * }\n * );\n /\nfunction forever(fn, errback) {\n var done = onlyOnce(errback \|\| noop);\n var task = wrapAsync(ensureAsync(fn));\n\n function next(err) {\n if (err) return done(err);\n task(next);\n }\n next();\n}\n\n/\n The same as [`groupBy`]{@link module:Collections.groupBy} but runs a maximum of `limit` async operations at a time.\n \n @name groupByLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n /\nvar groupByLimit = function(coll, limit, iteratee, callback) {\n callback = callback \|\| noop;\n var _iteratee = wrapAsync(iteratee);\n mapLimit(coll, limit, function(val, callback) {\n _iteratee(val, function(err, key) {\n if (err) return callback(err);\n return callback(null, {key: key, val: val});\n });\n }, function(err, mapResults) {\n var result = {};\n // from MDN, handle object having an `hasOwnProperty` prop\n var hasOwnProperty = Object.prototype.hasOwnProperty;\n\n for (var i = 0; i < mapResults.length; i++) {\n if (mapResults[i]) {\n var key = mapResults[i].key;\n var val = mapResults[i].val;\n\n if (hasOwnProperty.call(result, key)) {\n result[key].push(val);\n } else {\n result[key] = [val];\n }\n }\n }\n\n return callback(err, result);\n });\n};\n\n/\n Returns a new object, where each value corresponds to an array of items, from\n * `coll`, that returned the corresponding key. That is, the keys of the object\n * correspond to the values passed to the `iteratee` callback.\n \n Note: Since this function applies the `iteratee` to each item in parallel,\n * there is no guarantee that the `iteratee` functions will complete in order.\n * However, the values for each key in the `result` will be in the same order as\n * the original `coll`. For Objects, the values will roughly be in the order of\n * the original Objects' keys (but this can vary across JavaScript engines).\n \n @name groupBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n * @example\n \n async.groupBy(['userId1', 'userId2', 'userId3'], function(userId, callback) {\n * db.findById(userId, function(err, user) {\n * if (err) return callback(err);\n * return callback(null, user.age);\n * });\n * }, function(err, result) {\n * // result is object containing the userIds grouped by age\n * // e.g. { 30: ['userId1', 'userId3'], 42: ['userId2']};\n * });\n /\nvar groupBy = doLimit(groupByLimit, Infinity);\n\n/\n The same as [`groupBy`]{@link module:Collections.groupBy} but runs only a single async operation at a time.\n \n @name groupBySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n /\nvar groupBySeries = doLimit(groupByLimit, 1);\n\n/\n Logs the result of an `async` function to the `console`. Only works in\n * Node.js or in browsers that support `console.log` and `console.error` (such\n * as FF and Chrome). If multiple arguments are returned from the async\n * function, `console.log` is called on each argument in order.\n \n @name log\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...} arguments... - Any number of arguments to apply to the function.\n @example\n \n // in a module\n * var hello = function(name, callback) {\n * setTimeout(function() {\n * callback(null, 'hello ' + name);\n * }, 1000);\n * };\n \n // in the node repl\n * node> async.log(hello, 'world');\n * 'hello world'\n /\nvar log = consoleFunc('log');\n\n/\n The same as [`mapValues`]{@link module:Collections.mapValues} but runs a maximum of `limit` async operations at a\n * time.\n \n @name mapValuesLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n /\nfunction mapValuesLimit(obj, limit, iteratee, callback) {\n callback = once(callback \|\| noop);\n var newObj = {};\n var _iteratee = wrapAsync(iteratee);\n eachOfLimit(obj, limit, function(val, key, next) {\n _iteratee(val, key, function (err, result) {\n if (err) return next(err);\n newObj[key] = result;\n next();\n });\n }, function (err) {\n callback(err, newObj);\n });\n}\n\n/\n A relative of [`map`]{@link module:Collections.map}, designed for use with objects.\n \n Produces a new Object by mapping each value of `obj` through the `iteratee`\n * function. The `iteratee` is called each `value` and `key` from `obj` and a\n * callback for when it has finished processing. Each of these callbacks takes\n * two arguments: an `error`, and the transformed item from `obj`. If `iteratee`\n * passes an error to its callback, the main `callback` (for the `mapValues`\n * function) is immediately called with the error.\n \n Note, the order of the keys in the result is not guaranteed. The keys will\n * be roughly in the order they complete, (but this is very engine-specific)\n \n @name mapValues\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @example\n \n async.mapValues({\n * f1: 'file1',\n * f2: 'file2',\n * f3: 'file3'\n * }, function (file, key, callback) {\n * fs.stat(file, callback);\n * }, function(err, result) {\n * // result is now a map of stats for each file, e.g.\n * // {\n * // f1: [stats for file1],\n * // f2: [stats for file2],\n * // f3: [stats for file3]\n * // }\n * });\n /\n\nvar mapValues = doLimit(mapValuesLimit, Infinity);\n\n/\n The same as [`mapValues`]{@link module:Collections.mapValues} but runs only a single async operation at a time.\n \n @name mapValuesSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n /\nvar mapValuesSeries = doLimit(mapValuesLimit, 1);\n\nfunction has(obj, key) {\n return key in obj;\n}\n\n/\n Caches the results of an async function. When creating a hash to store\n * function results against, the callback is omitted from the hash and an\n * optional hash function can be used.\n \n If no hash function is specified, the first argument is used as a hash key,\n * which may work reasonably if it is a string or a data type that converts to a\n * distinct string. Note that objects and arrays will not behave reasonably.\n * Neither will cases where the other arguments are significant. In such cases,\n * specify your own hash function.\n \n The cache of results is exposed as the `memo` property of the function\n * returned by `memoize`.\n \n @name memoize\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function to proxy and cache results from.\n * @param {Function} hasher - An optional function for generating a custom hash\n * for storing results. It has all the arguments applied to it apart from the\n * callback, and must be synchronous.\n * @returns {AsyncFunction} a memoized version of `fn`\n * @example\n \n var slow_fn = function(name, callback) {\n * // do something\n * callback(null, result);\n * };\n * var fn = async.memoize(slow_fn);\n \n // fn can now be used as if it were slow_fn\n * fn('some name', function() {\n * // callback\n * });\n /\nfunction memoize(fn, hasher) {\n var memo = Object.create(null);\n var queues = Object.create(null);\n hasher = hasher \|\| identity;\n var _fn = wrapAsync(fn);\n var memoized = initialParams(function memoized(args, callback) {\n var key = hasher.apply(null, args);\n if (has(memo, key)) {\n setImmediate$1(function() {\n callback.apply(null, memo[key]);\n });\n } else if (has(queues, key)) {\n queues[key].push(callback);\n } else {\n queues[key] = [callback];\n _fn.apply(null, args.concat(function(/args/) {\n var args = slice(arguments);\n memo[key] = args;\n var q = queues[key];\n delete queues[key];\n for (var i = 0, l = q.length; i < l; i++) {\n q[i].apply(null, args);\n }\n }));\n }\n });\n memoized.memo = memo;\n memoized.unmemoized = fn;\n return memoized;\n}\n\n/\n Calls `callback` on a later loop around the event loop. In Node.js this just\n * calls `process.nextTick`. In the browser it will use `setImmediate` if\n * available, otherwise `setTimeout(callback, 0)`, which means other higher\n * priority events may precede the execution of `callback`.\n \n This is used internally for browser-compatibility purposes.\n \n @name nextTick\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.setImmediate]{@link module:Utils.setImmediate}\n * @category Util\n * @param {Function} callback - The function to call on a later loop around\n * the event loop. Invoked with (args...).\n * @param {...} args... - any number of additional arguments to pass to the\n callback on the next tick.\n * @example\n \n var call_order = [];\n * async.nextTick(function() {\n * call_order.push('two');\n * // call_order now equals ['one','two']\n * });\n * call_order.push('one');\n \n async.setImmediate(function (a, b, c) {\n * // a, b, and c equal 1, 2, and 3\n * }, 1, 2, 3);\n /\nvar _defer$1;\n\nif (hasNextTick) {\n _defer$1 = process.nextTick;\n} else if (hasSetImmediate) {\n _defer$1 = setImmediate;\n} else {\n _defer$1 = fallback;\n}\n\nvar nextTick = wrap(_defer$1);\n\nfunction _parallel(eachfn, tasks, callback) {\n callback = callback \|\| noop;\n var results = isArrayLike(tasks) ? [] : {};\n\n eachfn(tasks, function (task, key, callback) {\n wrapAsync(task)(function (err, result) {\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n }\n results[key] = result;\n callback(err);\n });\n }, function (err) {\n callback(err, results);\n });\n}\n\n/\n Run the `tasks` collection of functions in parallel, without waiting until\n * the previous function has completed. If any of the functions pass an error to\n * its callback, the main `callback` is immediately called with the value of the\n * error. Once the `tasks` have completed, the results are passed to the final\n * `callback` as an array.\n \n Note: `parallel` is about kicking-off I/O tasks in parallel, not about\n * parallel execution of code. If your tasks do not use any timers or perform\n * any I/O, they will actually be executed in series. Any synchronous setup\n * sections for each task will happen one after the other. JavaScript remains\n * single-threaded.\n \n Hint: Use [`reflect`]{@link module:Utils.reflect} to continue the\n * execution of other tasks when a task fails.\n \n It is also possible to use an object instead of an array. Each property will\n * be run as a function and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.parallel}.\n \n @name parallel\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n \n @example\n * async.parallel([\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * // the results array will equal ['one','two'] even though\n * // the second function had a shorter timeout.\n * });\n \n // an example using an object instead of an array\n * async.parallel({\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 1);\n * }, 200);\n * },\n * two: function(callback) {\n * setTimeout(function() {\n * callback(null, 2);\n * }, 100);\n * }\n * }, function(err, results) {\n * // results is now equals to: {one: 1, two: 2}\n * });\n /\nfunction parallelLimit(tasks, callback) {\n _parallel(eachOf, tasks, callback);\n}\n\n/\n The same as [`parallel`]{@link module:ControlFlow.parallel} but runs a maximum of `limit` async operations at a\n * time.\n \n @name parallelLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.parallel]{@link module:ControlFlow.parallel}\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n /\nfunction parallelLimit$1(tasks, limit, callback) {\n _parallel(_eachOfLimit(limit), tasks, callback);\n}\n\n/\n A queue of tasks for the worker function to complete.\n * @typedef {Object} QueueObject\n * @memberOf module:ControlFlow\n * @property {Function} length - a function returning the number of items\n * waiting to be processed. Invoke with `queue.length()`.\n * @property {boolean} started - a boolean indicating whether or not any\n * items have been pushed and processed by the queue.\n * @property {Function} running - a function returning the number of items\n * currently being processed. Invoke with `queue.running()`.\n * @property {Function} workersList - a function returning the array of items\n * currently being processed. Invoke with `queue.workersList()`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke with `queue.idle()`.\n * @property {number} concurrency - an integer for determining how many `worker`\n * functions should be run in parallel. This property can be changed after a\n * `queue` is created to alter the concurrency on-the-fly.\n * @property {Function} push - add a new task to the `queue`. Calls `callback`\n * once the `worker` has finished processing the task. Instead of a single task,\n * a `tasks` array can be submitted. The respective callback is used for every\n * task in the list. Invoke with `queue.push(task, [callback])`,\n * @property {Function} unshift - add a new task to the front of the `queue`.\n * Invoke with `queue.unshift(task, [callback])`.\n * @property {Function} remove - remove items from the queue that match a test\n * function. The test function will be passed an object with a `data` property,\n * and a `priority` property, if this is a\n * [priorityQueue]{@link module:ControlFlow.priorityQueue} object.\n * Invoked with `queue.remove(testFn)`, where `testFn` is of the form\n * `function ({data, priority}) {}` and returns a Boolean.\n * @property {Function} saturated - a callback that is called when the number of\n * running workers hits the `concurrency` limit, and further tasks will be\n * queued.\n * @property {Function} unsaturated - a callback that is called when the number\n * of running workers is less than the `concurrency` & `buffer` limits, and\n * further tasks will not be queued.\n * @property {number} buffer - A minimum threshold buffer in order to say that\n * the `queue` is `unsaturated`.\n * @property {Function} empty - a callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - a callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} error - a callback that is called when a task errors.\n * Has the signature `function(error, task)`.\n * @property {boolean} paused - a boolean for determining whether the queue is\n * in a paused state.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke with `queue.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke with `queue.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. No more tasks\n * should be pushed to the queue after calling this function. Invoke with `queue.kill()`.\n /\n\n/\n Creates a `queue` object with the specified `concurrency`. Tasks added to the\n * `queue` are processed in parallel (up to the `concurrency` limit). If all\n * `worker`s are in progress, the task is queued until one becomes available.\n * Once a `worker` completes a `task`, that `task`'s callback is called.\n \n @name queue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`. Invoked with (task, callback).\n * @param {number} [concurrency=1] - An `integer` for determining how many\n * `worker` functions should be run in parallel. If omitted, the concurrency\n * defaults to `1`. If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A queue object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the queue.\n * @example\n \n // create a queue object with concurrency 2\n * var q = async.queue(function(task, callback) {\n * console.log('hello ' + task.name);\n * callback();\n * }, 2);\n \n // assign a callback\n * q.drain = function() {\n * console.log('all items have been processed');\n * };\n \n // add some items to the queue\n * q.push({name: 'foo'}, function(err) {\n * console.log('finished processing foo');\n * });\n * q.push({name: 'bar'}, function (err) {\n * console.log('finished processing bar');\n * });\n \n // add some items to the queue (batch-wise)\n * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {\n * console.log('finished processing item');\n * });\n \n // add some items to the front of the queue\n * q.unshift({name: 'bar'}, function (err) {\n * console.log('finished processing bar');\n * });\n /\nvar queue$1 = function (worker, concurrency) {\n var _worker = wrapAsync(worker);\n return queue(function (items, cb) {\n _worker(items[0], cb);\n }, concurrency, 1);\n};\n\n/\n The same as [async.queue]{@link module:ControlFlow.queue} only tasks are assigned a priority and\n * completed in ascending priority order.\n \n @name priorityQueue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`.\n * Invoked with (task, callback).\n * @param {number} concurrency - An `integer` for determining how many `worker`\n * functions should be run in parallel. If omitted, the concurrency defaults to\n * `1`. If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A priorityQueue object to manage the tasks. There are two\n * differences between `queue` and `priorityQueue` objects:\n * * `push(task, priority, [callback])` - `priority` should be a number. If an\n * array of `tasks` is given, all tasks will be assigned the same priority.\n * * The `unshift` method was removed.\n /\nvar priorityQueue = function(worker, concurrency) {\n // Start with a normal queue\n var q = queue$1(worker, concurrency);\n\n // Override push to accept second parameter representing priority\n q.push = function(data, priority, callback) {\n if (callback == null) callback = noop;\n if (typeof callback !== 'function') {\n throw new Error('task callback must be a function');\n }\n q.started = true;\n if (!isArray(data)) {\n data = [data];\n }\n if (data.length === 0) {\n // call drain immediately if there are no tasks\n return setImmediate$1(function() {\n q.drain();\n });\n }\n\n priority = priority \|\| 0;\n var nextNode = q._tasks.head;\n while (nextNode && priority >= nextNode.priority) {\n nextNode = nextNode.next;\n }\n\n for (var i = 0, l = data.length; i < l; i++) {\n var item = {\n data: data[i],\n priority: priority,\n callback: callback\n };\n\n if (nextNode) {\n q._tasks.insertBefore(nextNode, item);\n } else {\n q._tasks.push(item);\n }\n }\n setImmediate$1(q.process);\n };\n\n // Remove unshift function\n delete q.unshift;\n\n return q;\n};\n\n/\n Runs the `tasks` array of functions in parallel, without waiting until the\n * previous function has completed. Once any of the `tasks` complete or pass an\n * error to its callback, the main `callback` is immediately called. It's\n * equivalent to `Promise.race()`.\n \n @name race\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array containing [async functions]{@link AsyncFunction}\n * to run. Each function can complete with an optional `result` value.\n * @param {Function} callback - A callback to run once any of the functions have\n * completed. This function gets an error or result from the first function that\n * completed. Invoked with (err, result).\n * @returns undefined\n * @example\n \n async.race([\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ],\n * // main callback\n * function(err, result) {\n * // the result will be equal to 'two' as it finishes earlier\n * });\n /\nfunction race(tasks, callback) {\n callback = once(callback \|\| noop);\n if (!isArray(tasks)) return callback(new TypeError('First argument to race must be an array of functions'));\n if (!tasks.length) return callback();\n for (var i = 0, l = tasks.length; i < l; i++) {\n wrapAsync(tasks[i])(callback);\n }\n}\n\n/\n Same as [`reduce`]{@link module:Collections.reduce}, only operates on `array` in reverse order.\n \n @name reduceRight\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reduce]{@link module:Collections.reduce}\n * @alias foldr\n * @category Collection\n * @param {Array} array - A collection to iterate over.\n * @param {} memo - The initial state of the reduction.\n @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n /\nfunction reduceRight (array, memo, iteratee, callback) {\n var reversed = slice(array).reverse();\n reduce(reversed, memo, iteratee, callback);\n}\n\n/\n Wraps the async function in another function that always completes with a\n * result object, even when it errors.\n \n The result object has either the property `error` or `value`.\n \n @name reflect\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function you want to wrap\n * @returns {Function} - A function that always passes null to it's callback as\n * the error. The second argument to the callback will be an `object` with\n * either an `error` or a `value` property.\n * @example\n \n async.parallel([\n * async.reflect(function(callback) {\n * // do some stuff ...\n * callback(null, 'one');\n * }),\n * async.reflect(function(callback) {\n * // do some more stuff but error ...\n * callback('bad stuff happened');\n * }),\n * async.reflect(function(callback) {\n * // do some more stuff ...\n * callback(null, 'two');\n * })\n * ],\n * // optional callback\n * function(err, results) {\n * // values\n * // results[0].value = 'one'\n * // results[1].error = 'bad stuff happened'\n * // results[2].value = 'two'\n * });\n /\nfunction reflect(fn) {\n var _fn = wrapAsync(fn);\n return initialParams(function reflectOn(args, reflectCallback) {\n args.push(function callback(error, cbArg) {\n if (error) {\n reflectCallback(null, { error: error });\n } else {\n var value;\n if (arguments.length <= 2) {\n value = cbArg;\n } else {\n value = slice(arguments, 1);\n }\n reflectCallback(null, { value: value });\n }\n });\n\n return _fn.apply(this, args);\n });\n}\n\n/\n A helper function that wraps an array or an object of functions with `reflect`.\n \n @name reflectAll\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.reflect]{@link module:Utils.reflect}\n * @category Util\n * @param {Array\|Object\|Iterable} tasks - The collection of\n * [async functions]{@link AsyncFunction} to wrap in `async.reflect`.\n * @returns {Array} Returns an array of async functions, each wrapped in\n * `async.reflect`\n * @example\n \n let tasks = [\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * // do some more stuff but error ...\n * callback(new Error('bad stuff happened'));\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ];\n \n async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n * // values\n * // results[0].value = 'one'\n * // results[1].error = Error('bad stuff happened')\n * // results[2].value = 'two'\n * });\n \n // an example using an object instead of an array\n * let tasks = {\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * two: function(callback) {\n * callback('two');\n * },\n * three: function(callback) {\n * setTimeout(function() {\n * callback(null, 'three');\n * }, 100);\n * }\n * };\n \n async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n * // values\n * // results.one.value = 'one'\n * // results.two.error = 'two'\n * // results.three.value = 'three'\n * });\n /\nfunction reflectAll(tasks) {\n var results;\n if (isArray(tasks)) {\n results = arrayMap(tasks, reflect);\n } else {\n results = {};\n baseForOwn(tasks, function(task, key) {\n results[key] = reflect.call(this, task);\n });\n }\n return results;\n}\n\nfunction reject$1(eachfn, arr, iteratee, callback) {\n _filter(eachfn, arr, function(value, cb) {\n iteratee(value, function(err, v) {\n cb(err, !v);\n });\n }, callback);\n}\n\n/\n The opposite of [`filter`]{@link module:Collections.filter}. Removes values that pass an `async` truth test.\n \n @name reject\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n \n async.reject(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, results) {\n * // results now equals an array of missing files\n * createFiles(results);\n * });\n /\nvar reject = doParallel(reject$1);\n\n/\n The same as [`reject`]{@link module:Collections.reject} but runs a maximum of `limit` async operations at a\n * time.\n \n @name rejectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar rejectLimit = doParallelLimit(reject$1);\n\n/\n The same as [`reject`]{@link module:Collections.reject} but runs only a single async operation at a time.\n \n @name rejectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar rejectSeries = doLimit(rejectLimit, 1);\n\n/\n Creates a function that returns `value`.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {} value The value to return from the new function.\n @returns {Function} Returns the new constant function.\n * @example\n \n var objects = _.times(2, _.constant({ 'a': 1 }));\n \n console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n \n console.log(objects[0] === objects[1]);\n * // => true\n /\nfunction constant$1(value) {\n return function() {\n return value;\n };\n}\n\n/\n Attempts to get a successful response from `task` no more than `times` times\n * before returning an error. If the task is successful, the `callback` will be\n * passed the result of the successful task. If all attempts fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n \n @name retry\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @see [async.retryable]{@link module:ControlFlow.retryable}\n * @param {Object\|number} [opts = {times: 5, interval: 0}\| 5] - Can be either an\n * object with `times` and `interval` or a number.\n * * `times` - The number of attempts to make before giving up. The default\n * is `5`.\n * * `interval` - The time to wait between retries, in milliseconds. The\n * default is `0`. The interval may also be specified as a function of the\n * retry count (see example).\n * * `errorFilter` - An optional synchronous function that is invoked on\n * erroneous result. If it returns `true` the retry attempts will continue;\n * if the function returns `false` the retry flow is aborted with the current\n * attempt's error and result being returned to the final callback.\n * Invoked with (err).\n * * If `opts` is a number, the number specifies the number of times to retry,\n * with the default interval of `0`.\n * @param {AsyncFunction} task - An async function to retry.\n * Invoked with (callback).\n * @param {Function} [callback] - An optional callback which is called when the\n * task has succeeded, or after the final failed attempt. It receives the `err`\n * and `result` arguments of the last attempt at completing the `task`. Invoked\n * with (err, results).\n \n @example\n \n // The `retry` function can be used as a stand-alone control flow by passing\n * // a callback, as shown below:\n \n // try calling apiMethod 3 times\n * async.retry(3, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod 3 times, waiting 200 ms between each retry\n * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod 10 times with exponential backoff\n * // (i.e. intervals of 100, 200, 400, 800, 1600, ... milliseconds)\n * async.retry({\n * times: 10,\n * interval: function(retryCount) {\n * return 50 * Math.pow(2, retryCount);\n * }\n * }, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod the default 5 times no delay between each retry\n * async.retry(apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod only when error condition satisfies, all other\n * // errors will abort the retry control flow and return to final callback\n * async.retry({\n * errorFilter: function(err) {\n * return err.message === 'Temporary error'; // only retry on a specific error\n * }\n * }, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // to retry individual methods that are not as reliable within other\n * // control flow functions, use the `retryable` wrapper:\n * async.auto({\n * users: api.getUsers.bind(api),\n * payments: async.retryable(3, api.getPayments.bind(api))\n * }, function(err, results) {\n * // do something with the results\n * });\n \n /\nfunction retry(opts, task, callback) {\n var DEFAULT_TIMES = 5;\n var DEFAULT_INTERVAL = 0;\n\n var options = {\n times: DEFAULT_TIMES,\n intervalFunc: constant$1(DEFAULT_INTERVAL)\n };\n\n function parseTimes(acc, t) {\n if (typeof t === 'object') {\n acc.times = +t.times \|\| DEFAULT_TIMES;\n\n acc.intervalFunc = typeof t.interval === 'function' ?\n t.interval :\n constant$1(+t.interval \|\| DEFAULT_INTERVAL);\n\n acc.errorFilter = t.errorFilter;\n } else if (typeof t === 'number' \|\| typeof t === 'string') {\n acc.times = +t \|\| DEFAULT_TIMES;\n } else {\n throw new Error(\"Invalid arguments for async.retry\");\n }\n }\n\n if (arguments.length < 3 && typeof opts === 'function') {\n callback = task \|\| noop;\n task = opts;\n } else {\n parseTimes(options, opts);\n callback = callback \|\| noop;\n }\n\n if (typeof task !== 'function') {\n throw new Error(\"Invalid arguments for async.retry\");\n }\n\n var _task = wrapAsync(task);\n\n var attempt = 1;\n function retryAttempt() {\n _task(function(err) {\n if (err && attempt++ < options.times &&\n (typeof options.errorFilter != 'function' \|\|\n options.errorFilter(err))) {\n setTimeout(retryAttempt, options.intervalFunc(attempt));\n } else {\n callback.apply(null, arguments);\n }\n });\n }\n\n retryAttempt();\n}\n\n/*\n A close relative of [`retry`]{@link module:ControlFlow.retry}. This method\n * wraps a task and makes it retryable, rather than immediately calling it\n * with retries.\n \n @name retryable\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.retry]{@link module:ControlFlow.retry}\n * @category Control Flow\n * @param {Object\|number} [opts = {times: 5, interval: 0}\| 5] - optional\n * options, exactly the same as from `retry`\n * @param {AsyncFunction} task - the asynchronous function to wrap.\n * This function will be passed any arguments passed to the returned wrapper.\n * Invoked with (...args, callback).\n * @returns {AsyncFunction} The wrapped function, which when invoked, will\n * retry on an error, based on the parameters specified in `opts`.\n * This function will accept the same parameters as `task`.\n * @example\n \n async.auto({\n * dep1: async.retryable(3, getFromFlakyService),\n * process: [\"dep1\", async.retryable(3, function (results, cb) {\n * maybeProcessData(results.dep1, cb);\n * })]\n * }, callback);\n /\nvar retryable = function (opts, task) {\n if (!task) {\n task = opts;\n opts = null;\n }\n var _task = wrapAsync(task);\n return initialParams(function (args, callback) {\n function taskFn(cb) {\n _task.apply(null, args.concat(cb));\n }\n\n if (opts) retry(opts, taskFn, callback);\n else retry(taskFn, callback);\n\n });\n};\n\n/\n Run the functions in the `tasks` collection in series, each one running once\n * the previous function has completed. If any functions in the series pass an\n * error to its callback, no more functions are run, and `callback` is\n * immediately called with the value of the error. Otherwise, `callback`\n * receives an array of results when `tasks` have completed.\n \n It is also possible to use an object instead of an array. Each property will\n * be run as a function, and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.series}.\n \n Note that while many implementations preserve the order of object\n * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)\n * explicitly states that\n \n > The mechanics and order of enumerating the properties is not specified.\n \n So if you rely on the order in which your series of functions are executed,\n * and want this to work on all platforms, consider using an array.\n \n @name series\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection containing\n * [async functions]{@link AsyncFunction} to run in series.\n * Each function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This function gets a results array (or object)\n * containing all the result arguments passed to the `task` callbacks. Invoked\n * with (err, result).\n * @example\n * async.series([\n * function(callback) {\n * // do some stuff ...\n * callback(null, 'one');\n * },\n * function(callback) {\n * // do some more stuff ...\n * callback(null, 'two');\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * // results is now equal to ['one', 'two']\n * });\n \n async.series({\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 1);\n * }, 200);\n * },\n * two: function(callback){\n * setTimeout(function() {\n * callback(null, 2);\n * }, 100);\n * }\n * }, function(err, results) {\n * // results is now equal to: {one: 1, two: 2}\n * });\n /\nfunction series(tasks, callback) {\n _parallel(eachOfSeries, tasks, callback);\n}\n\n/\n Returns `true` if at least one element in the `coll` satisfies an async test.\n * If any iteratee call returns `true`, the main `callback` is immediately\n * called.\n \n @name some\n * @static\n * @memberOf module:Collections\n * @method\n * @alias any\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @example\n \n async.some(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // if result is true then at least one of the files exists\n * });\n /\nvar some = doParallel(_createTester(Boolean, identity));\n\n/\n The same as [`some`]{@link module:Collections.some} but runs a maximum of `limit` async operations at a time.\n \n @name someLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anyLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n /\nvar someLimit = doParallelLimit(_createTester(Boolean, identity));\n\n/\n The same as [`some`]{@link module:Collections.some} but runs only a single async operation at a time.\n \n @name someSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anySeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in series.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n /\nvar someSeries = doLimit(someLimit, 1);\n\n/\n Sorts a list by the results of running each `coll` value through an async\n * `iteratee`.\n \n @name sortBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a value to use as the sort criteria as\n * its `result`.\n * Invoked with (item, callback).\n * @param {Function} callback - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is the items\n * from the original `coll` sorted by the values returned by the `iteratee`\n * calls. Invoked with (err, results).\n * @example\n \n async.sortBy(['file1','file2','file3'], function(file, callback) {\n * fs.stat(file, function(err, stats) {\n * callback(err, stats.mtime);\n * });\n * }, function(err, results) {\n * // results is now the original array of files sorted by\n * // modified date\n * });\n \n // By modifying the callback parameter the\n * // sorting order can be influenced:\n \n // ascending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n * callback(null, x);\n * }, function(err,result) {\n * // result callback\n * });\n \n // descending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n * callback(null, x-1); //<- x-1 instead of x, turns the order around\n * }, function(err,result) {\n * // result callback\n * });\n /\nfunction sortBy (coll, iteratee, callback) {\n var _iteratee = wrapAsync(iteratee);\n map(coll, function (x, callback) {\n _iteratee(x, function (err, criteria) {\n if (err) return callback(err);\n callback(null, {value: x, criteria: criteria});\n });\n }, function (err, results) {\n if (err) return callback(err);\n callback(null, arrayMap(results.sort(comparator), baseProperty('value')));\n });\n\n function comparator(left, right) {\n var a = left.criteria, b = right.criteria;\n return a < b ? -1 : a > b ? 1 : 0;\n }\n}\n\n/\n Sets a time limit on an asynchronous function. If the function does not call\n * its callback within the specified milliseconds, it will be called with a\n * timeout error. The code property for the error object will be `'ETIMEDOUT'`.\n \n @name timeout\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} asyncFn - The async function to limit in time.\n * @param {number} milliseconds - The specified time limit.\n * @param {} [info] - Any variable you want attached (`string`, `object`, etc)\n to timeout Error for more information..\n * @returns {AsyncFunction} Returns a wrapped function that can be used with any\n * of the control flow functions.\n * Invoke this function with the same parameters as you would `asyncFunc`.\n * @example\n \n function myFunction(foo, callback) {\n * doAsyncTask(foo, function(err, data) {\n * // handle errors\n * if (err) return callback(err);\n \n // do some stuff ...\n \n // return processed data\n * return callback(null, data);\n * });\n * }\n \n var wrapped = async.timeout(myFunction, 1000);\n \n // call `wrapped` as you would `myFunction`\n * wrapped({ bar: 'bar' }, function(err, data) {\n * // if `myFunction` takes < 1000 ms to execute, `err`\n * // and `data` will have their expected values\n \n // else `err` will be an Error with the code 'ETIMEDOUT'\n * });\n /\nfunction timeout(asyncFn, milliseconds, info) {\n var fn = wrapAsync(asyncFn);\n\n return initialParams(function (args, callback) {\n var timedOut = false;\n var timer;\n\n function timeoutCallback() {\n var name = asyncFn.name \|\| 'anonymous';\n var error = new Error('Callback function \"' + name + '\" timed out.');\n error.code = 'ETIMEDOUT';\n if (info) {\n error.info = info;\n }\n timedOut = true;\n callback(error);\n }\n\n args.push(function () {\n if (!timedOut) {\n callback.apply(null, arguments);\n clearTimeout(timer);\n }\n });\n\n // setup timer and call original function\n timer = setTimeout(timeoutCallback, milliseconds);\n fn.apply(null, args);\n });\n}\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeCeil = Math.ceil;\nvar nativeMax = Math.max;\n\n/\n The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n \n @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n /\nfunction baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step \|\| 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n}\n\n/\n The same as [times]{@link module:ControlFlow.times} but runs a maximum of `limit` async operations at a\n * time.\n \n @name timesLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} count - The number of times to run the function.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see [async.map]{@link module:Collections.map}.\n /\nfunction timeLimit(count, limit, iteratee, callback) {\n var _iteratee = wrapAsync(iteratee);\n mapLimit(baseRange(0, count, 1), limit, _iteratee, callback);\n}\n\n/\n Calls the `iteratee` function `n` times, and accumulates results in the same\n * manner you would use with [map]{@link module:Collections.map}.\n \n @name times\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n * @example\n \n // Pretend this is some complicated async factory\n * var createUser = function(id, callback) {\n * callback(null, {\n * id: 'user' + id\n * });\n * };\n \n // generate 5 users\n * async.times(5, function(n, next) {\n * createUser(n, function(err, user) {\n * next(err, user);\n * });\n * }, function(err, users) {\n * // we should now have 5 users\n * });\n /\nvar times = doLimit(timeLimit, Infinity);\n\n/\n The same as [times]{@link module:ControlFlow.times} but runs only a single async operation at a time.\n \n @name timesSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n /\nvar timesSeries = doLimit(timeLimit, 1);\n\n/\n A relative of `reduce`. Takes an Object or Array, and iterates over each\n * element in series, each step potentially mutating an `accumulator` value.\n * The type of the accumulator defaults to the type of collection passed in.\n \n @name transform\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {} [accumulator] - The initial state of the transform. If omitted,\n it will default to an empty Object or Array, depending on the type of `coll`\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * collection that potentially modifies the accumulator.\n * Invoked with (accumulator, item, key, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the transformed accumulator.\n * Invoked with (err, result).\n * @example\n \n async.transform([1,2,3], function(acc, item, index, callback) {\n * // pointless async:\n * process.nextTick(function() {\n * acc.push(item * 2)\n * callback(null)\n * });\n * }, function(err, result) {\n * // result is now equal to [2, 4, 6]\n * });\n \n @example\n \n async.transform({a: 1, b: 2, c: 3}, function (obj, val, key, callback) {\n * setImmediate(function () {\n * obj[key] = val * 2;\n * callback();\n * })\n * }, function (err, result) {\n * // result is equal to {a: 2, b: 4, c: 6}\n * })\n /\nfunction transform (coll, accumulator, iteratee, callback) {\n if (arguments.length <= 3) {\n callback = iteratee;\n iteratee = accumulator;\n accumulator = isArray(coll) ? [] : {};\n }\n callback = once(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n\n eachOf(coll, function(v, k, cb) {\n _iteratee(accumulator, v, k, cb);\n }, function(err) {\n callback(err, accumulator);\n });\n}\n\n/\n It runs each task in series but stops whenever any of the functions were\n * successful. If one of the tasks were successful, the `callback` will be\n * passed the result of the successful task. If all tasks fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n \n @name tryEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection containing functions to\n * run, each function is passed a `callback(err, result)` it must call on\n * completion with an error `err` (which can be `null`) and an optional `result`\n * value.\n * @param {Function} [callback] - An optional callback which is called when one\n * of the tasks has succeeded, or all have failed. It receives the `err` and\n * `result` arguments of the last attempt at completing the `task`. Invoked with\n * (err, results).\n * @example\n * async.tryEach([\n * function getDataFromFirstWebsite(callback) {\n * // Try getting the data from the first website\n * callback(err, data);\n * },\n * function getDataFromSecondWebsite(callback) {\n * // First website failed,\n * // Try getting the data from the backup website\n * callback(err, data);\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * Now do something with the data.\n * });\n \n /\nfunction tryEach(tasks, callback) {\n var error = null;\n var result;\n callback = callback \|\| noop;\n eachSeries(tasks, function(task, callback) {\n wrapAsync(task)(function (err, res/, ...args/) {\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n } else {\n result = res;\n }\n error = err;\n callback(!err);\n });\n }, function () {\n callback(error, result);\n });\n}\n\n/*\n Undoes a [memoize]{@link module:Utils.memoize}d function, reverting it to the original,\n * unmemoized form. Handy for testing.\n \n @name unmemoize\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.memoize]{@link module:Utils.memoize}\n * @category Util\n * @param {AsyncFunction} fn - the memoized function\n * @returns {AsyncFunction} a function that calls the original unmemoized function\n /\nfunction unmemoize(fn) {\n return function () {\n return (fn.unmemoized \|\| fn).apply(null, arguments);\n };\n}\n\n/\n Repeatedly call `iteratee`, while `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs.\n \n @name whilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns undefined\n * @example\n \n var count = 0;\n * async.whilst(\n * function() { return count < 5; },\n * function(callback) {\n * count++;\n * setTimeout(function() {\n * callback(null, count);\n * }, 1000);\n * },\n * function (err, n) {\n * // 5 seconds have passed, n = 5\n * }\n * );\n /\nfunction whilst(test, iteratee, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n if (!test()) return callback(null);\n var next = function(err/, ...args/) {\n if (err) return callback(err);\n if (test()) return _iteratee(next);\n var args = slice(arguments, 1);\n callback.apply(null, [null].concat(args));\n };\n _iteratee(next);\n}\n\n/\n Repeatedly call `iteratee` until `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs. `callback` will be passed an error and any\n * arguments passed to the final `iteratee`'s callback.\n \n The inverse of [whilst]{@link module:ControlFlow.whilst}.\n \n @name until\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n /\nfunction until(test, iteratee, callback) {\n whilst(function() {\n return !test.apply(this, arguments);\n }, iteratee, callback);\n}\n\n/\n Runs the `tasks` array of functions in series, each passing their results to\n * the next in the array. However, if any of the `tasks` pass an error to their\n * own callback, the next function is not executed, and the main `callback` is\n * immediately called with the error.\n \n @name waterfall\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array of [async functions]{@link AsyncFunction}\n * to run.\n * Each function should complete with any number of `result` values.\n * The `result` values will be passed as arguments, in order, to the next task.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This will be passed the results of the last task's\n * callback. Invoked with (err, [results]).\n * @returns undefined\n * @example\n \n async.waterfall([\n * function(callback) {\n * callback(null, 'one', 'two');\n * },\n * function(arg1, arg2, callback) {\n * // arg1 now equals 'one' and arg2 now equals 'two'\n * callback(null, 'three');\n * },\n * function(arg1, callback) {\n * // arg1 now equals 'three'\n * callback(null, 'done');\n * }\n * ], function (err, result) {\n * // result now equals 'done'\n * });\n \n // Or, with named functions:\n * async.waterfall([\n * myFirstFunction,\n * mySecondFunction,\n * myLastFunction,\n * ], function (err, result) {\n * // result now equals 'done'\n * });\n * function myFirstFunction(callback) {\n * callback(null, 'one', 'two');\n * }\n * function mySecondFunction(arg1, arg2, callback) {\n * // arg1 now equals 'one' and arg2 now equals 'two'\n * callback(null, 'three');\n * }\n * function myLastFunction(arg1, callback) {\n * // arg1 now equals 'three'\n * callback(null, 'done');\n * }\n /\nvar waterfall = function(tasks, callback) {\n callback = once(callback \|\| noop);\n if (!isArray(tasks)) return callback(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return callback();\n var taskIndex = 0;\n\n function nextTask(args) {\n var task = wrapAsync(tasks[taskIndex++]);\n args.push(onlyOnce(next));\n task.apply(null, args);\n }\n\n function next(err/, ...args/) {\n if (err \|\| taskIndex === tasks.length) {\n return callback.apply(null, arguments);\n }\n nextTask(slice(arguments, 1));\n }\n\n nextTask([]);\n};\n\n/\n An \"async function\" in the context of Async is an asynchronous function with\n * a variable number of parameters, with the final parameter being a callback.\n * (`function (arg1, arg2, ..., callback) {}`)\n * The final callback is of the form `callback(err, results...)`, which must be\n * called once the function is completed. The callback should be called with a\n * Error as its first argument to signal that an error occurred.\n * Otherwise, if no error occurred, it should be called with `null` as the first\n * argument, and any additional `result` arguments that may apply, to signal\n * successful completion.\n * The callback must be called exactly once, ideally on a later tick of the\n * JavaScript event loop.\n \n This type of function is also referred to as a \"Node-style async function\",\n * or a \"continuation passing-style function\" (CPS). Most of the methods of this\n * library are themselves CPS/Node-style async functions, or functions that\n * return CPS/Node-style async functions.\n \n Wherever we accept a Node-style async function, we also directly accept an\n * [ES2017 `async` function]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function}.\n * In this case, the `async` function will not be passed a final callback\n * argument, and any thrown error will be used as the `err` argument of the\n * implicit callback, and the return value will be used as the `result` value.\n * (i.e. a `rejected` of the returned Promise becomes the `err` callback\n * argument, and a `resolved` value becomes the `result`.)\n \n Note, due to JavaScript limitations, we can only detect native `async`\n * functions and not transpilied implementations.\n * Your environment must have `async`/`await` support for this to work.\n * (e.g. Node > v7.6, or a recent version of a modern browser).\n * If you are using `async` functions through a transpiler (e.g. Babel), you\n * must still wrap the function with [asyncify]{@link module:Utils.asyncify},\n * because the `async function` will be compiled to an ordinary function that\n * returns a promise.\n \n @typedef {Function} AsyncFunction\n * @static\n /\n\n/\n Async is a utility module which provides straight-forward, powerful functions\n * for working with asynchronous JavaScript. Although originally designed for\n * use with [Node.js](http://nodejs.org) and installable via\n * `npm install --save async`, it can also be used directly in the browser.\n * @module async\n * @see AsyncFunction\n /\n\n\n/\n A collection of `async` functions for manipulating collections, such as\n * arrays and objects.\n * @module Collections\n /\n\n/\n A collection of `async` functions for controlling the flow through a script.\n * @module ControlFlow\n /\n\n/\n A collection of `async` utility functions.\n * @module Utils\n /\n\nvar index = {\n apply: apply,\n applyEach: applyEach,\n applyEachSeries: applyEachSeries,\n asyncify: asyncify,\n auto: auto,\n autoInject: autoInject,\n cargo: cargo,\n compose: compose,\n concat: concat,\n concatLimit: concatLimit,\n concatSeries: concatSeries,\n constant: constant,\n detect: detect,\n detectLimit: detectLimit,\n detectSeries: detectSeries,\n dir: dir,\n doDuring: doDuring,\n doUntil: doUntil,\n doWhilst: doWhilst,\n during: during,\n each: eachLimit,\n eachLimit: eachLimit$1,\n eachOf: eachOf,\n eachOfLimit: eachOfLimit,\n eachOfSeries: eachOfSeries,\n eachSeries: eachSeries,\n ensureAsync: ensureAsync,\n every: every,\n everyLimit: everyLimit,\n everySeries: everySeries,\n filter: filter,\n filterLimit: filterLimit,\n filterSeries: filterSeries,\n forever: forever,\n groupBy: groupBy,\n groupByLimit: groupByLimit,\n groupBySeries: groupBySeries,\n log: log,\n map: map,\n mapLimit: mapLimit,\n mapSeries: mapSeries,\n mapValues: mapValues,\n mapValuesLimit: mapValuesLimit,\n mapValuesSeries: mapValuesSeries,\n memoize: memoize,\n nextTick: nextTick,\n parallel: parallelLimit,\n parallelLimit: parallelLimit$1,\n priorityQueue: priorityQueue,\n queue: queue$1,\n race: race,\n reduce: reduce,\n reduceRight: reduceRight,\n reflect: reflect,\n reflectAll: reflectAll,\n reject: reject,\n rejectLimit: rejectLimit,\n rejectSeries: rejectSeries,\n retry: retry,\n retryable: retryable,\n seq: seq,\n series: series,\n setImmediate: setImmediate$1,\n some: some,\n someLimit: someLimit,\n someSeries: someSeries,\n sortBy: sortBy,\n timeout: timeout,\n times: times,\n timesLimit: timeLimit,\n timesSeries: timesSeries,\n transform: transform,\n tryEach: tryEach,\n unmemoize: unmemoize,\n until: until,\n waterfall: waterfall,\n whilst: whilst,\n\n // aliases\n all: every,\n allLimit: everyLimit,\n allSeries: everySeries,\n any: some,\n anyLimit: someLimit,\n anySeries: someSeries,\n find: detect,\n findLimit: detectLimit,\n findSeries: detectSeries,\n forEach: eachLimit,\n forEachSeries: eachSeries,\n forEachLimit: eachLimit$1,\n forEachOf: eachOf,\n forEachOfSeries: eachOfSeries,\n forEachOfLimit: eachOfLimit,\n inject: reduce,\n foldl: reduce,\n foldr: reduceRight,\n select: filter,\n selectLimit: filterLimit,\n selectSeries: filterSeries,\n wrapSync: asyncify\n};\n\nexports['default'] = index;\nexports.apply = apply;\nexports.applyEach = applyEach;\nexports.applyEachSeries = applyEachSeries;\nexports.asyncify = asyncify;\nexports.auto = auto;\nexports.autoInject = autoInject;\nexports.cargo = cargo;\nexports.compose = compose;\nexports.concat = concat;\nexports.concatLimit = concatLimit;\nexports.concatSeries = concatSeries;\nexports.constant = constant;\nexports.detect = detect;\nexports.detectLimit = detectLimit;\nexports.detectSeries = detectSeries;\nexports.dir = dir;\nexports.doDuring = doDuring;\nexports.doUntil = doUntil;\nexports.doWhilst = doWhilst;\nexports.during = during;\nexports.each = eachLimit;\nexports.eachLimit = eachLimit$1;\nexports.eachOf = eachOf;\nexports.eachOfLimit = eachOfLimit;\nexports.eachOfSeries = eachOfSeries;\nexports.eachSeries = eachSeries;\nexports.ensureAsync = ensureAsync;\nexports.every = every;\nexports.everyLimit = everyLimit;\nexports.everySeries = everySeries;\nexports.filter = filter;\nexports.filterLimit = filterLimit;\nexports.filterSeries = filterSeries;\nexports.forever = forever;\nexports.groupBy = groupBy;\nexports.groupByLimit = groupByLimit;\nexports.groupBySeries = groupBySeries;\nexports.log = log;\nexports.map = map;\nexports.mapLimit = mapLimit;\nexports.mapSeries = mapSeries;\nexports.mapValues = mapValues;\nexports.mapValuesLimit = mapValuesLimit;\nexports.mapValuesSeries = mapValuesSeries;\nexports.memoize = memoize;\nexports.nextTick = nextTick;\nexports.parallel = parallelLimit;\nexports.parallelLimit = parallelLimit$1;\nexports.priorityQueue = priorityQueue;\nexports.queue = queue$1;\nexports.race = race;\nexports.reduce = reduce;\nexports.reduceRight = reduceRight;\nexports.reflect = reflect;\nexports.reflectAll = reflectAll;\nexports.reject = reject;\nexports.rejectLimit = rejectLimit;\nexports.rejectSeries = rejectSeries;\nexports.retry = retry;\nexports.retryable = retryable;\nexports.seq = seq;\nexports.series = series;\nexports.setImmediate = setImmediate$1;\nexports.some = some;\nexports.someLimit = someLimit;\nexports.someSeries = someSeries;\nexports.sortBy = sortBy;\nexports.timeout = timeout;\nexports.times = times;\nexports.timesLimit = timeLimit;\nexports.timesSeries = timesSeries;\nexports.transform = transform;\nexports.tryEach = tryEach;\nexports.unmemoize = unmemoize;\nexports.until = until;\nexports.waterfall = waterfall;\nexports.whilst = whilst;\nexports.all = every;\nexports.allLimit = everyLimit;\nexports.allSeries = everySeries;\nexports.any = some;\nexports.anyLimit = someLimit;\nexports.anySeries = someSeries;\nexports.find = detect;\nexports.findLimit = detectLimit;\nexports.findSeries = detectSeries;\nexports.forEach = eachLimit;\nexports.forEachSeries = eachSeries;\nexports.forEachLimit = eachLimit$1;\nexports.forEachOf = eachOf;\nexports.forEachOfSeries = eachOfSeries;\nexports.forEachOfLimit = eachOfLimit;\nexports.inject = reduce;\nexports.foldl = reduce;\nexports.foldr = reduceRight;\nexports.select = filter;\nexports.selectLimit = filterLimit;\nexports.selectSeries = filterSeries;\nexports.wrapSync = asyncify;\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","\n'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./zone-file.cjs.production.min.js')\n} else {\n module.exports = require('./zone-file.cjs.development.js')\n}\n","\"use strict\";function t(t,r){(null==r\|\|r>t.length)&&(r=t.length);for(var n=0,e=new Array(r);n<r;n++)e[n]=t[n];return e}function r(r,n){var e;if(\"undefined\"==typeof Symbol\|\|null==r[Symbol.iterator]){if(Array.isArray(r)\|\|(e=function(r,n){if(r){if(\"string\"==typeof r)return t(r,void 0);var e=Object.prototype.toString.call(r).slice(8,-1);return\"Object\"===e&&r.constructor&&(e=r.constructor.name),\"Map\"===e\|\|\"Set\"===e?Array.from(r):\"Arguments\"===e\|\|/^(?:Ui\|I)nt(?:8\|16\|32)(?:Clamped)?Array$/.test(e)?t(r,void 0):void 0}}(r))\|\|n&&r&&\"number\"==typeof r.length){e&&(r=e);var a=0;return function(){return a>=r.length?{done:!0}:{done:!1,value:r[a++]}}}throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\")}return(e=r[Symbol.iterator]()).next.bind(e)}function n(t,n){return void 0===n&&(n=\"{$origin}\\n{$ttl}\\n\\n; SOA Record\\n{name} {ttl} IN SOA {mname}{rname}(\\n{serial} ;serial\\n{refresh} ;refresh\\n{retry} ;retry\\n{expire} ;expire\\n{minimum} ;minimum ttl\\n)\\n\\n; NS Records\\n{ns}\\n\\n; MX Records\\n{mx}\\n\\n; A Records\\n{a}\\n\\n; AAAA Records\\n{aaaa}\\n\\n; CNAME Records\\n{cname}\\n\\n; PTR Records\\n{ptr}\\n\\n; TXT Records\\n{txt}\\n\\n; SRV Records\\n{srv}\\n\\n; SPF Records\\n{spf}\\n\\n; URI Records\\n{uri}\\n\"),n=function(t,r){var n=\"\";return void 0!==t&&(n+=\"$ORIGIN \"+t),r.replace(\"{$origin}\",n)}(t.$origin,n),n=function(t,r){var n=\"\";return void 0!==t&&(n+=\"$TTL \"+t),r.replace(\"{$ttl}\",n)}(t.$ttl,n),n=function(t,r){var n=r;if(void 0!==t)for(var e in t.name=t.name\|\|\"@\",t.ttl=t.ttl\|\|\"\",t)n=n.replace(\"{\"+e+\"}\",t[e]+\"\\t\");return n}(t.soa,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tNS\\t\"+s.host+\"\\n\"}return n.replace(\"{ns}\",e)}(t.ns,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tA\\t\"+s.ip+\"\\n\"}return n.replace(\"{a}\",e)}(t.a,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tAAAA\\t\"+s.ip+\"\\n\"}return n.replace(\"{aaaa}\",e)}(t.aaaa,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tCNAME\\t\"+s.alias+\"\\n\"}return n.replace(\"{cname}\",e)}(t.cname,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tMX\\t\"+s.preference+\"\\t\"+s.host+\"\\n\"}return n.replace(\"{mx}\",e)}(t.mx,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tPTR\\t\"+s.host+\"\\n\"}return n.replace(\"{ptr}\",e)}(t.ptr,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tTXT\\t\";var o=s.txt;\"string\"==typeof o?e+='\"'+o+'\"':o instanceof Array&&(e+=o.map((function(t){return'\"'+t+'\"'})).join(\" \")),e+=\"\\n\"}return n.replace(\"{txt}\",e)}(t.txt,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tSRV\\t\"+s.priority+\"\\t\",e+=s.weight+\"\\t\",e+=s.port+\"\\t\",e+=s.target+\"\\n\"}return n.replace(\"{srv}\",e)}(t.srv,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tSPF\\t\"+s.data+\"\\n\"}return n.replace(\"{spf}\",e)}(t.spf,n),(n=function(t,r){r=(r=r.replace(\"{zone}\",t.$origin\|\|!!t.soa&&t.soa.name\|\|\"\")).replace(\"{datetime}\",(new Date).toISOString());var n=Math.round(Date.now()/1e3);return r.replace(\"{time}\",\"\"+n)}(t,n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tURI\\t\"+s.priority+\"\\t\",e+=s.weight+\"\\t\",e+='\"'+s.target+'\"\\n'}return n.replace(\"{uri}\",e)}(t.uri,n))).replace(/\\n{2,}/gim,\"\\n\\n\")}function e(t){return function(t){for(var n,e={},g=r(t.split(\"\\n\"));!(n=g()).done;){var h=n.value;if(h&&h.trim()){var d=h.toUpperCase();/\\s+TXT\\s+/.test(d)?(e.txt=e.txt\|\|[],e.txt.push(u(h))):0===d.indexOf(\"$ORIGIN\")?e.$origin=h.split(/\\s+/g)[1]:0===d.indexOf(\"$TTL\")?e.$ttl=parseInt(h.split(/\\s+/g)[1],10):/\\s+SOA\\s+/.test(d)?e.soa=a(h):/\\s+NS\\s+/.test(d)?(e.ns=e.ns\|\|[],e.ns.push(i(h))):/\\s+A\\s+/.test(d)?(e.a=e.a\|\|[],e.a.push(s(h,e.a))):/\\s+AAAA\\s+/.test(d)?(e.aaaa=e.aaaa\|\|[],e.aaaa.push(o(h))):/\\s+CNAME\\s+/.test(d)?(e.cname=e.cname\|\|[],e.cname.push(l(h))):/\\s+MX\\s+/.test(d)?(e.mx=e.mx\|\|[],e.mx.push(p(h))):/\\s+PTR\\s+/.test(d)?(e.ptr=e.ptr\|\|[],e.ptr.push(c(h,e.ptr,e.$origin))):/\\s+SRV\\s+/.test(d)?(e.srv=e.srv\|\|[],e.srv.push(f(h))):/\\s+SPF\\s+/.test(d)?(e.spf=e.spf\|\|[],e.spf.push(m(h))):/\\s+URI\\s+/.test(d)&&(e.uri=e.uri\|\|[],e.uri.push(v(h)))}}return e}(t=function(t){for(var r=[],n=/\$[\\s\\S]?\$/gim,e=n.exec(t);null!==e;){var a=e[0].replace(/\\s+/gm,\" \");r.push({match:e,replacement:a}),e=n.exec(t)}for(var i=t.split(\"\"),s=0,o=r;s<o.length;s++){var l=o[s],p=l.match;i.splice(p.index,p[0].length,l.replacement)}return i.join(\"\").replace(/\$\|\$/gim,\" \")}(t=function(t){return t.replace(/(^\|[^\\\\]);./g,(function(t,r){return r\|\|\"\"}))}(t)))}function a(t){var r={},n=t.trim().split(/\\s+/g),e=n.length;return r.name=n[0],r.minimum=parseInt(n[e-1],10),r.expire=parseInt(n[e-2],10),r.retry=parseInt(n[e-3],10),r.refresh=parseInt(n[e-4],10),r.serial=parseInt(n[e-5],10),r.rname=n[e-6],r.mname=n[e-7],isNaN(n[1])\|\|(r.ttl=parseInt(n[1],10)),r}function i(t){var r=t.trim().split(/\\s+/g),n={name:r[0],host:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function s(t,r){var n=t.trim().split(/\\s+/g),e=t.trim().toUpperCase().split(/\\s+/g),a={name:n[0],ip:n[n.length-1]};return 0===e.lastIndexOf(\"A\")&&(a.name=r.length?r[r.length-1].name:\"@\"),isNaN(n[1])\|\|(a.ttl=parseInt(n[1],10)),a}function o(t){var r=t.trim().split(/\\s+/g),n={name:r[0],ip:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function l(t){var r=t.trim().split(/\\s+/g),n={name:r[0],alias:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function p(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],preference:parseInt(r[n-2],10),host:r[n-1]};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}function u(t){var r=t.trim().match(/[^\\s\"']+\|\"[^\"]\"\|'[^']'/g);if(!r)throw new Error(\"Failure to tokenize TXT record\");var n,e=r.length,a=r.indexOf(\"TXT\");function i(t){return t.indexOf('\"')>-1&&(t=t.split('\"')[1]),t}n=e-a-1>1?[].concat(r.slice(a+1).map(i)):i(r[e-1]);var s={name:r[0],txt:n};return isNaN(r[1])\|\|(s.ttl=parseInt(r[1],10)),s}function c(t,r,n){var e=t.trim().split(/\\s+/g);0===t.trim().toUpperCase().split(/\\s+/g).lastIndexOf(\"PTR\")&&r[r.length-1]&&e.unshift(r[r.length-1].name);var a={name:e[0],fullname:e[0]+\".\"+n,host:e[e.length-1]};return isNaN(e[1])\|\|(a.ttl=parseInt(e[1],10)),a}function f(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],target:r[n-1],priority:parseInt(r[n-4],10),weight:parseInt(r[n-3],10),port:parseInt(r[n-2],10)};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}function m(t){for(var r=t.trim().split(/\\s+/g),n={name:r[0],data:\"\"},e=r.length;e-- >4;)n.data=r[e]+\" \"+n.data.trim();return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function v(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],target:r[n-1].replace(/\"/g,\"\"),priority:parseInt(r[n-3],10),weight:parseInt(r[n-2],10)};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}exports.ZoneFile=function(){function t(t){this.jsonZoneFile=\"object\"==typeof t?JSON.parse(JSON.stringify(t)):\"string\"==typeof t?e(t):void 0}var r=t.prototype;return r.toJSON=function(){return this.jsonZoneFile},r.toString=function(){return n(this.toJSON())},t}(),exports.makeZoneFile=n,exports.parseZoneFile=e;\n//# sourceMappingURL=zone-file.cjs.production.min.js.map\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\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__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this \|\| new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\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};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","import { Logger } from './logger';\nexport const BLOCKSTACK_HANDLER = 'blockstack';\nexport function nextYear() {\n return new Date(new Date().setFullYear(new Date().getFullYear() + 1));\n}\nexport function nextMonth() {\n return new Date(new Date().setMonth(new Date().getMonth() + 1));\n}\nexport function nextHour() {\n return new Date(new Date().setHours(new Date().getHours() + 1));\n}\nexport function megabytesToBytes(megabytes) {\n if (!Number.isFinite(megabytes)) {\n return 0;\n }\n return Math.floor(megabytes 1024 * 1024);\n}\nexport function getAesCbcOutputLength(inputByteLength) {\n const cipherTextLength = (Math.floor(inputByteLength / 16) + 1) * 16;\n return cipherTextLength;\n}\nexport function getBase64OutputLength(inputByteLength) {\n const encodedLength = Math.ceil(inputByteLength / 3) * 4;\n return encodedLength;\n}\nexport function updateQueryStringParameter(uri, key, value) {\n const re = new RegExp(`([?&])${key}=.?(&\|$)`, 'i');\n const separator = uri.indexOf('?') !== -1 ? '&' : '?';\n if (uri.match(re)) {\n return uri.replace(re, `$1${key}=${value}$2`);\n }\n else {\n return `${uri}${separator}${key}=${value}`;\n }\n}\nexport function isLaterVersion(v1, v2) {\n if (v1 === undefined \|\| v1 === '') {\n v1 = '0.0.0';\n }\n if (v2 === undefined \|\| v1 === '') {\n v2 = '0.0.0';\n }\n const v1tuple = v1.split('.').map(x => parseInt(x, 10));\n const v2tuple = v2.split('.').map(x => parseInt(x, 10));\n for (let index = 0; index < v2.length; index++) {\n if (index >= v1.length) {\n v2tuple.push(0);\n }\n if (v1tuple[index] < v2tuple[index]) {\n return false;\n }\n }\n return true;\n}\nexport function makeUUID4() {\n let d = new Date().getTime();\n if (typeof performance !== 'undefined' && typeof performance.now === 'function') {\n d += performance.now();\n }\n return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, c => {\n const r = (d + Math.random() 16) % 16 \| 0;\n d = Math.floor(d / 16);\n return (c === 'x' ? r : (r & 0x3) \| 0x8).toString(16);\n });\n}\nexport function isSameOriginAbsoluteUrl(uri1, uri2) {\n try {\n const parsedUri1 = new URL(uri1);\n const parsedUri2 = new URL(uri2);\n const port1 = parseInt(parsedUri1.port \|\| '0', 10) \| 0 \|\| (parsedUri1.protocol === 'https:' ? 443 : 80);\n const port2 = parseInt(parsedUri2.port \|\| '0', 10) \| 0 \|\| (parsedUri2.protocol === 'https:' ? 443 : 80);\n const match = {\n scheme: parsedUri1.protocol === parsedUri2.protocol,\n hostname: parsedUri1.hostname === parsedUri2.hostname,\n port: port1 === port2,\n absolute: (uri1.includes('http://') \|\| uri1.includes('https://')) &&\n (uri2.includes('http://') \|\| uri2.includes('https://')),\n };\n return match.scheme && match.hostname && match.port && match.absolute;\n }\n catch (error) {\n console.log(error);\n console.log('Parsing error in same URL origin check');\n return false;\n }\n}\nexport function getGlobalScope() {\n if (typeof self !== 'undefined') {\n return self;\n }\n if (typeof window !== 'undefined') {\n return window;\n }\n if (typeof global !== 'undefined') {\n return global;\n }\n throw new Error('Unexpected runtime environment - no supported global scope (`window`, `self`, `global`) available');\n}\nfunction getAPIUsageErrorMessage(scopeObject, apiName, usageDesc) {\n if (usageDesc) {\n return `Use of '${usageDesc}' requires \\`${apiName}\\` which is unavailable on the '${scopeObject}' object within the currently executing environment.`;\n }\n else {\n return `\\`${apiName}\\` is unavailable on the '${scopeObject}' object within the currently executing environment.`;\n }\n}\nexport function getGlobalObject(name, { throwIfUnavailable, usageDesc, returnEmptyObject } = {}) {\n let globalScope = undefined;\n try {\n globalScope = getGlobalScope();\n if (globalScope) {\n const obj = globalScope[name];\n if (obj) {\n return obj;\n }\n }\n }\n catch (error) {\n Logger.error(`Error getting object '${name}' from global scope '${globalScope}': ${error}`);\n }\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n if (returnEmptyObject) {\n return {};\n }\n return undefined;\n}\nexport function getGlobalObjects(names, { throwIfUnavailable, usageDesc, returnEmptyObject } = {}) {\n let globalScope;\n try {\n globalScope = getGlobalScope();\n }\n catch (error) {\n Logger.error(`Error getting global scope: ${error}`);\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, names[0].toString(), usageDesc);\n Logger.error(errMsg);\n throw errMsg;\n }\n else if (returnEmptyObject) {\n globalScope = {};\n }\n }\n const result = {};\n for (let i = 0; i < names.length; i++) {\n const name = names[i];\n try {\n if (globalScope) {\n const obj = globalScope[name];\n if (obj) {\n result[name] = obj;\n }\n else if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n else if (returnEmptyObject) {\n result[name] = {};\n }\n }\n }\n catch (error) {\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n }\n }\n return result;\n}\nexport function intToBytes(value, byteLength) {\n return bigIntToBytes(intToBigInt(value), byteLength);\n}\nexport function intToBigInt(value) {\n if (typeof value === 'bigint')\n return value;\n if (typeof value === 'string')\n return BigInt(value);\n if (typeof value === 'number') {\n if (!Number.isInteger(value)) {\n throw new RangeError(`Invalid value. Values of type 'number' must be an integer.`);\n }\n if (value > Number.MAX_SAFE_INTEGER) {\n throw new RangeError(`Invalid value. Values of type 'number' must be less than or equal to ${Number.MAX_SAFE_INTEGER}. For larger values, try using a BigInt instead.`);\n }\n return BigInt(value);\n }\n if (isInstance(value, Uint8Array))\n return BigInt(`0x${bytesToHex(value)}`);\n throw new TypeError(`intToBigInt: Invalid value type. Must be a number, bigint, BigInt-compatible string, or Uint8Array.`);\n}\nexport function with0x(value) {\n return /^0x/i.test(value)\n ? value\n : `0x${value}`;\n}\nexport function without0x(value) {\n return /^0x/i.test(value)\n ? value.slice(2)\n : value;\n}\nexport function hexToBigInt(hex) {\n if (typeof hex !== 'string')\n throw new TypeError(`hexToBigInt: expected string, got ${typeof hex}`);\n return BigInt(`0x${hex}`);\n}\nexport function intToHex(integer, byteLength = 8) {\n const value = typeof integer === 'bigint' ? integer : intToBigInt(integer);\n return value.toString(16).padStart(byteLength * 2, '0');\n}\nexport function hexToInt(hex) {\n return parseInt(hex, 16);\n}\nexport function bigIntToBytes(value, length = 16) {\n const hex = intToHex(value, length);\n return hexToBytes(hex);\n}\nexport function toTwos(value, width) {\n if (value < -(BigInt(1) << (width - BigInt(1))) \|\|\n (BigInt(1) << (width - BigInt(1))) - BigInt(1) < value) {\n throw `Unable to represent integer in width: ${width}`;\n }\n if (value >= BigInt(0)) {\n return BigInt(value);\n }\n return value + (BigInt(1) << width);\n}\nfunction nthBit(value, n) {\n return value & (BigInt(1) << n);\n}\nexport function bytesToTwosBigInt(bytes) {\n return fromTwos(BigInt(`0x${bytesToHex(bytes)}`), BigInt(bytes.byteLength * 8));\n}\nexport function fromTwos(value, width) {\n if (nthBit(value, width - BigInt(1))) {\n return value - (BigInt(1) << width);\n }\n return value;\n}\nconst hexes = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\nexport function bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (const u of uint8a) {\n hex += hexes[u];\n }\n return hex;\n}\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError(`hexToBytes: expected string, got ${typeof hex}`);\n }\n hex = without0x(hex);\n hex = hex.length % 2 ? `0${hex}` : hex;\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nexport function utf8ToBytes(str) {\n return new TextEncoder().encode(str);\n}\nexport function bytesToUtf8(arr) {\n return new TextDecoder().decode(arr);\n}\nexport function asciiToBytes(str) {\n const byteArray = [];\n for (let i = 0; i < str.length; i++) {\n byteArray.push(str.charCodeAt(i) & 0xff);\n }\n return new Uint8Array(byteArray);\n}\nexport function bytesToAscii(arr) {\n return String.fromCharCode.apply(null, arr);\n}\nfunction isNotOctet(octet) {\n return !Number.isInteger(octet) \|\| octet < 0 \|\| octet > 255;\n}\nexport function octetsToBytes(numbers) {\n if (numbers.some(isNotOctet))\n throw new Error('Some values are invalid bytes.');\n return new Uint8Array(numbers);\n}\nexport function concatBytes(...arrays) {\n if (!arrays.every(a => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nexport function concatArray(elements) {\n return concatBytes(...elements.map(e => {\n if (typeof e === 'number')\n return octetsToBytes([e]);\n if (e instanceof Array)\n return octetsToBytes(e);\n return e;\n }));\n}\nexport function isInstance(object, clazz) {\n return object instanceof clazz \|\| object?.constructor?.name?.toLowerCase() === clazz.name;\n}\nexport function validateHash256(hex) {\n hex = without0x(hex);\n if (hex.length !== 64)\n return false;\n return /^[0-9a-fA-F]+$/.test(hex);\n}\n//# sourceMappingURL=utils.js.map","export function number(n) {\n if (!Number.isSafeInteger(n) \|\| n < 0)\n throw new Error(`Wrong positive integer: ${n}`);\n}\nexport function bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`Expected boolean, not ${b}`);\n}\nexport function bytes(b, ...lengths) {\n if (!(b instanceof Uint8Array))\n throw new TypeError('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new TypeError(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexport function hash(hash) {\n if (typeof hash !== 'function' \|\| typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nexport function exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nexport function output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nconst assert = {\n number,\n bool,\n bytes,\n hash,\n exists,\n output,\n};\nexport default assert;\n","/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n// The import here is via the package name. This is to ensure\n// that exports mapping/resolution does fall into place.\nimport { crypto } from '@noble/hashes/crypto';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) \| (word >>> shift);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// There is almost no big endian hardware, but js typed arrays uses platform specific endianness.\n// So, just to be sure not to corrupt anything.\nif (!isLE)\n throw new Error('Non little-endian hardware is not supported');\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/*\n @example bytesToHex(Uint8Array.from([0xde, 0xad, 0xbe, 0xef]))\n /\nexport function bytesToHex(uint8a) {\n // pre-caching improves the speed 6x\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\n/\n @example hexToBytes('deadbeef')\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex');\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\n// There is no setImmediate in browser and setTimeout is slow. However, call to async function will return Promise\n// which will be fullfiled only on next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string') {\n throw new TypeError(`utf8ToBytes expected string, got ${typeof str}`);\n }\n return new TextEncoder().encode(str);\n}\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n if (!(data instanceof Uint8Array))\n throw new TypeError(`Expected input type is Uint8Array (got ${typeof data})`);\n return data;\n}\n/*\n Concats Uint8Array-s into one; like `Buffer.concat([buf1, buf2])`\n * @example concatBytes(buf1, buf2)\n /\nexport function concatBytes(...arrays) {\n if (!arrays.every((a) => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\n// For runtime check if class implements interface\nexport class Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj) => Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && (typeof opts !== 'object' \|\| !isPlainObject(opts)))\n throw new TypeError('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexport function wrapConstructor(hashConstructor) {\n const hashC = (message) => hashConstructor().update(toBytes(message)).digest();\n const tmp = hashConstructor();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashConstructor();\n return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\n/\n Secure PRNG\n /\nexport function randomBytes(bytesLength = 32) {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n return new Uint8Array(crypto.node.randomBytes(bytesLength).buffer);\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n}\n","export const crypto = {\n node: undefined,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\n","import assert from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nclass HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n assert.hash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new TypeError('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n assert.exists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n assert.exists(this);\n assert.bytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to \|\| (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/\n HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n /\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n","import assert from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n assert.exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n assert.exists(this);\n assert.output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\| (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\n","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends SHA2 {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = IV[0] \| 0;\n this.B = IV[1] \| 0;\n this.C = IV[2] \| 0;\n this.D = IV[3] \| 0;\n this.E = IV[4] \| 0;\n this.F = IV[5] \| 0;\n this.G = IV[6] \| 0;\n this.H = IV[7] \| 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 \| 0;\n this.B = 0x367cd507 \| 0;\n this.C = 0x3070dd17 \| 0;\n this.D = 0xf70e5939 \| 0;\n this.E = 0xffc00b31 \| 0;\n this.F = 0x68581511 \| 0;\n this.G = 0x64f98fa7 \| 0;\n this.H = 0xbefa4fa4 \| 0;\n this.outputLen = 28;\n }\n}\n/*\n SHA2-256 hash function\n * @param message - data that would be hashed\n /\nexport const sha256 = wrapConstructor(() => new SHA256());\nexport const sha224 = wrapConstructor(() => new SHA224());\n","/! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) /\nimport as nodeCrypto from 'crypto';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 \|\| k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nexport { CURVE };\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n \|\| Y2 === _0n)\n return this;\n if (X1 === _0n \|\| Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n \|\| k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) \|\| 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 (W - 1);\n const mask = BigInt(2 W - 1);\n const maxNumber = 2 W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nexport class Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 \|\| header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 \|\| recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) \|\| !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n \|\| a === _1n \|\| this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 \|\| data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len \|\| res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 \|\| data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nexport class Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res = res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n \|\| modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' \|\| hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' \|\| qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) \| Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nexport function getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexport function recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr \|\| str) && item.length;\n if (arr)\n return len === compressedLen \|\| len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 \|\| len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nexport function getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexport { sign, signSync };\nconst vopts = { strict: true };\nexport function verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) \|\| !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R \|\| !R.hasEvenY() \|\| R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexport const schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexport const utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen \|\| hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => utils.hashToPrivateKey(utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","export const HIRO_MAINNET_URL = 'https://api.mainnet.hiro.so';\nexport const HIRO_TESTNET_URL = 'https://api.testnet.hiro.so';\nexport const DEVNET_URL = 'http://localhost:3999';\nexport const GAIA_URL = 'https://hub.blockstack.org';\nexport const PRIVATE_KEY_BYTES_COMPRESSED = 33;\nexport const PRIVATE_KEY_BYTES_UNCOMPRESSED = 32;\n//# sourceMappingURL=constants.js.map","const defaultFetchOpts = {\n referrerPolicy: 'origin',\n headers: {\n 'x-hiro-product': 'stacksjs',\n },\n};\nexport const getFetchOptions = () => {\n return defaultFetchOpts;\n};\nexport const setFetchOptions = (ops) => {\n return Object.assign(defaultFetchOpts, ops);\n};\nexport async function fetchWrapper(input, init) {\n const fetchOpts = {};\n Object.assign(fetchOpts, defaultFetchOpts, init);\n const fetchResult = await fetch(input, fetchOpts);\n return fetchResult;\n}\nexport function hostMatches(host, pattern) {\n if (typeof pattern === 'string')\n return pattern === host;\n return pattern.exec(host);\n}\nexport function createApiKeyMiddleware({ apiKey, host = /(.)api(.)(\\.stacks\\.co\|\\.hiro\\.so)$/i, httpHeader = 'x-api-key', }) {\n return {\n pre: context => {\n const reqUrl = new URL(context.url);\n if (!hostMatches(reqUrl.host, host))\n return;\n const headers = context.init.headers instanceof Headers\n ? context.init.headers\n : (context.init.headers = new Headers(context.init.headers));\n headers.set(httpHeader, apiKey);\n },\n };\n}\nfunction argsForCreateFetchFn(args) {\n let fetchLib = fetchWrapper;\n let middlewares = [];\n if (args.length > 0 && typeof args[0] === 'function') {\n fetchLib = args.shift();\n }\n if (args.length > 0) {\n middlewares = args;\n }\n return { fetchLib, middlewares };\n}\nexport function createFetchFn(...args) {\n const { fetchLib, middlewares } = argsForCreateFetchFn(args);\n const fetchFn = async (url, init) => {\n let fetchParams = { url, init: init ?? {} };\n for (const middleware of middlewares) {\n if (typeof middleware.pre === 'function') {\n const result = await Promise.resolve(middleware.pre({\n fetch: fetchLib,\n ...fetchParams,\n }));\n fetchParams = result ?? fetchParams;\n }\n }\n let response = await fetchLib(fetchParams.url, fetchParams.init);\n for (const middleware of middlewares) {\n if (typeof middleware.post === 'function') {\n const result = await Promise.resolve(middleware.post({\n fetch: fetchLib,\n url: fetchParams.url,\n init: fetchParams.init,\n response: response?.clone() ?? response,\n }));\n response = result ?? response;\n }\n }\n return response;\n };\n return fetchFn;\n}\n//# sourceMappingURL=fetch.js.map","export var ChainId;\n(function (ChainId) {\n ChainId[ChainId[\"Mainnet\"] = 1] = \"Mainnet\";\n ChainId[ChainId[\"Testnet\"] = 2147483648] = \"Testnet\";\n})(ChainId \|\| (ChainId = {}));\nexport var PeerNetworkId;\n(function (PeerNetworkId) {\n PeerNetworkId[PeerNetworkId[\"Mainnet\"] = 385875968] = \"Mainnet\";\n PeerNetworkId[PeerNetworkId[\"Testnet\"] = 4278190080] = \"Testnet\";\n})(PeerNetworkId \|\| (PeerNetworkId = {}));\nexport const DEFAULT_CHAIN_ID = ChainId.Mainnet;\nexport var TransactionVersion;\n(function (TransactionVersion) {\n TransactionVersion[TransactionVersion[\"Mainnet\"] = 0] = \"Mainnet\";\n TransactionVersion[TransactionVersion[\"Testnet\"] = 128] = \"Testnet\";\n})(TransactionVersion \|\| (TransactionVersion = {}));\nexport var AddressVersion;\n(function (AddressVersion) {\n AddressVersion[AddressVersion[\"MainnetSingleSig\"] = 22] = \"MainnetSingleSig\";\n AddressVersion[AddressVersion[\"MainnetMultiSig\"] = 20] = \"MainnetMultiSig\";\n AddressVersion[AddressVersion[\"TestnetSingleSig\"] = 26] = \"TestnetSingleSig\";\n AddressVersion[AddressVersion[\"TestnetMultiSig\"] = 21] = \"TestnetMultiSig\";\n})(AddressVersion \|\| (AddressVersion = {}));\nexport const DEFAULT_TRANSACTION_VERSION = TransactionVersion.Mainnet;\nexport function whenTransactionVersion(transactionVersion) {\n return (map) => map[transactionVersion];\n}\n//# sourceMappingURL=constants.js.map","import { DEVNET_URL, HIRO_MAINNET_URL, HIRO_TESTNET_URL, createFetchFn, createApiKeyMiddleware, } from '@stacks/common';\nimport { AddressVersion, ChainId, PeerNetworkId, TransactionVersion } from './constants';\nexport const STACKS_MAINNET = {\n chainId: ChainId.Mainnet,\n transactionVersion: TransactionVersion.Mainnet,\n peerNetworkId: PeerNetworkId.Mainnet,\n magicBytes: 'X2',\n bootAddress: 'SP000000000000000000002Q6VF78',\n addressVersion: {\n singleSig: AddressVersion.MainnetSingleSig,\n multiSig: AddressVersion.MainnetMultiSig,\n },\n client: { baseUrl: HIRO_MAINNET_URL },\n};\nexport const STACKS_TESTNET = {\n chainId: ChainId.Testnet,\n transactionVersion: TransactionVersion.Testnet,\n peerNetworkId: PeerNetworkId.Testnet,\n magicBytes: 'T2',\n bootAddress: 'ST000000000000000000002AMW42H',\n addressVersion: {\n singleSig: AddressVersion.TestnetSingleSig,\n multiSig: AddressVersion.TestnetMultiSig,\n },\n client: { baseUrl: HIRO_TESTNET_URL },\n};\nexport const STACKS_DEVNET = {\n ...STACKS_TESTNET,\n addressVersion: { ...STACKS_TESTNET.addressVersion },\n magicBytes: 'id',\n client: { baseUrl: DEVNET_URL },\n};\nexport const STACKS_MOCKNET = {\n ...STACKS_DEVNET,\n addressVersion: { ...STACKS_DEVNET.addressVersion },\n client: { ...STACKS_DEVNET.client },\n};\nexport const StacksNetworks = ['mainnet', 'testnet', 'devnet', 'mocknet'];\nexport function networkFromName(name) {\n switch (name) {\n case 'mainnet':\n return STACKS_MAINNET;\n case 'testnet':\n return STACKS_TESTNET;\n case 'devnet':\n return STACKS_DEVNET;\n case 'mocknet':\n return STACKS_MOCKNET;\n default:\n throw new Error(`Unknown network name: ${name}`);\n }\n}\nexport function networkFrom(network) {\n if (typeof network === 'string')\n return networkFromName(network);\n return network;\n}\nexport function defaultUrlFromNetwork(network) {\n if (!network)\n return HIRO_MAINNET_URL;\n network = networkFrom(network);\n return !network \|\| network.transactionVersion === TransactionVersion.Mainnet\n ? HIRO_MAINNET_URL\n : network.magicBytes === 'id'\n ? DEVNET_URL\n : HIRO_TESTNET_URL;\n}\nexport function clientFromNetwork(network) {\n if (network.client.fetch)\n return network.client;\n return {\n ...network.client,\n fetch: createFetchFn(),\n };\n}\nexport function createNetwork(arg1, arg2) {\n const baseNetwork = networkFrom(typeof arg1 === 'object' && 'network' in arg1 ? arg1.network : arg1);\n const newNetwork = {\n ...baseNetwork,\n addressVersion: { ...baseNetwork.addressVersion },\n client: { ...baseNetwork.client },\n };\n if (typeof arg1 === 'object' && 'network' in arg1) {\n if (arg1.client) {\n newNetwork.client.baseUrl = arg1.client.baseUrl ?? newNetwork.client.baseUrl;\n newNetwork.client.fetch = arg1.client.fetch ?? newNetwork.client.fetch;\n }\n if (typeof arg1.apiKey === 'string') {\n const middleware = createApiKeyMiddleware(arg1);\n newNetwork.client.fetch = newNetwork.client.fetch\n ? createFetchFn(newNetwork.client.fetch, middleware)\n : createFetchFn(middleware);\n }\n return newNetwork;\n }\n if (typeof arg2 === 'string') {\n const middleware = createApiKeyMiddleware({ apiKey: arg2 });\n newNetwork.client.fetch = newNetwork.client.fetch\n ? createFetchFn(newNetwork.client.fetch, middleware)\n : createFetchFn(middleware);\n return newNetwork;\n }\n return newNetwork;\n}\n//# sourceMappingURL=network.js.map","export const BLOCKSTACK_DEFAULT_GAIA_HUB_URL = 'https://hub.blockstack.org';\nexport const MAX_STRING_LENGTH_BYTES = 128;\nexport const CLARITY_INT_SIZE = 128;\nexport const CLARITY_INT_BYTE_SIZE = 16;\nexport const COINBASE_BYTES_LENGTH = 32;\nexport const VRF_PROOF_BYTES_LENGTH = 80;\nexport const RECOVERABLE_ECDSA_SIG_LENGTH_BYTES = 65;\nexport const COMPRESSED_PUBKEY_LENGTH_BYTES = 32;\nexport const UNCOMPRESSED_PUBKEY_LENGTH_BYTES = 64;\nexport const MEMO_MAX_LENGTH_BYTES = 34;\nconst MAX_PAYLOAD_LEN = 1 + 16 * 1024 * 1024;\nconst PREAMBLE_ENCODED_SIZE = 165;\nconst MAX_RELAYERS_LEN = 16;\nconst PEER_ADDRESS_ENCODED_SIZE = 16;\nconst HASH160_ENCODED_SIZE = 20;\nconst NEIGHBOR_ADDRESS_ENCODED_SIZE = PEER_ADDRESS_ENCODED_SIZE + 2 + HASH160_ENCODED_SIZE;\nconst RELAY_DATA_ENCODED_SIZE = NEIGHBOR_ADDRESS_ENCODED_SIZE + 4;\nexport const STRING_MAX_LENGTH = MAX_PAYLOAD_LEN + (PREAMBLE_ENCODED_SIZE + MAX_RELAYERS_LEN * RELAY_DATA_ENCODED_SIZE);\nexport var PayloadType;\n(function (PayloadType) {\n PayloadType[PayloadType[\"TokenTransfer\"] = 0] = \"TokenTransfer\";\n PayloadType[PayloadType[\"SmartContract\"] = 1] = \"SmartContract\";\n PayloadType[PayloadType[\"VersionedSmartContract\"] = 6] = \"VersionedSmartContract\";\n PayloadType[PayloadType[\"ContractCall\"] = 2] = \"ContractCall\";\n PayloadType[PayloadType[\"PoisonMicroblock\"] = 3] = \"PoisonMicroblock\";\n PayloadType[PayloadType[\"Coinbase\"] = 4] = \"Coinbase\";\n PayloadType[PayloadType[\"CoinbaseToAltRecipient\"] = 5] = \"CoinbaseToAltRecipient\";\n PayloadType[PayloadType[\"TenureChange\"] = 7] = \"TenureChange\";\n PayloadType[PayloadType[\"NakamotoCoinbase\"] = 8] = \"NakamotoCoinbase\";\n})(PayloadType \|\| (PayloadType = {}));\nexport var ClarityVersion;\n(function (ClarityVersion) {\n ClarityVersion[ClarityVersion[\"Clarity1\"] = 1] = \"Clarity1\";\n ClarityVersion[ClarityVersion[\"Clarity2\"] = 2] = \"Clarity2\";\n ClarityVersion[ClarityVersion[\"Clarity3\"] = 3] = \"Clarity3\";\n})(ClarityVersion \|\| (ClarityVersion = {}));\nexport var AnchorMode;\n(function (AnchorMode) {\n AnchorMode[AnchorMode[\"OnChainOnly\"] = 1] = \"OnChainOnly\";\n AnchorMode[AnchorMode[\"OffChainOnly\"] = 2] = \"OffChainOnly\";\n AnchorMode[AnchorMode[\"Any\"] = 3] = \"Any\";\n})(AnchorMode \|\| (AnchorMode = {}));\nexport const AnchorModeNames = ['onChainOnly', 'offChainOnly', 'any'];\nconst AnchorModeMap = {\n [AnchorModeNames[0]]: AnchorMode.OnChainOnly,\n [AnchorModeNames[1]]: AnchorMode.OffChainOnly,\n [AnchorModeNames[2]]: AnchorMode.Any,\n [AnchorMode.OnChainOnly]: AnchorMode.OnChainOnly,\n [AnchorMode.OffChainOnly]: AnchorMode.OffChainOnly,\n [AnchorMode.Any]: AnchorMode.Any,\n};\nexport function anchorModeFrom(mode) {\n if (mode in AnchorModeMap)\n return AnchorModeMap[mode];\n throw new Error(`Invalid anchor mode \"${mode}\", must be one of: ${AnchorModeNames.join(', ')}`);\n}\nexport var PostConditionMode;\n(function (PostConditionMode) {\n PostConditionMode[PostConditionMode[\"Allow\"] = 1] = \"Allow\";\n PostConditionMode[PostConditionMode[\"Deny\"] = 2] = \"Deny\";\n})(PostConditionMode \|\| (PostConditionMode = {}));\nexport var PostConditionType;\n(function (PostConditionType) {\n PostConditionType[PostConditionType[\"STX\"] = 0] = \"STX\";\n PostConditionType[PostConditionType[\"Fungible\"] = 1] = \"Fungible\";\n PostConditionType[PostConditionType[\"NonFungible\"] = 2] = \"NonFungible\";\n})(PostConditionType \|\| (PostConditionType = {}));\nexport var AuthType;\n(function (AuthType) {\n AuthType[AuthType[\"Standard\"] = 4] = \"Standard\";\n AuthType[AuthType[\"Sponsored\"] = 5] = \"Sponsored\";\n})(AuthType \|\| (AuthType = {}));\nexport var AddressHashMode;\n(function (AddressHashMode) {\n AddressHashMode[AddressHashMode[\"P2PKH\"] = 0] = \"P2PKH\";\n AddressHashMode[AddressHashMode[\"P2SH\"] = 1] = \"P2SH\";\n AddressHashMode[AddressHashMode[\"P2WPKH\"] = 2] = \"P2WPKH\";\n AddressHashMode[AddressHashMode[\"P2WSH\"] = 3] = \"P2WSH\";\n AddressHashMode[AddressHashMode[\"P2SHNonSequential\"] = 5] = \"P2SHNonSequential\";\n AddressHashMode[AddressHashMode[\"P2WSHNonSequential\"] = 7] = \"P2WSHNonSequential\";\n})(AddressHashMode \|\| (AddressHashMode = {}));\nexport { AddressVersion } from '@stacks/network';\nexport var PubKeyEncoding;\n(function (PubKeyEncoding) {\n PubKeyEncoding[PubKeyEncoding[\"Compressed\"] = 0] = \"Compressed\";\n PubKeyEncoding[PubKeyEncoding[\"Uncompressed\"] = 1] = \"Uncompressed\";\n})(PubKeyEncoding \|\| (PubKeyEncoding = {}));\nexport var FungibleConditionCode;\n(function (FungibleConditionCode) {\n FungibleConditionCode[FungibleConditionCode[\"Equal\"] = 1] = \"Equal\";\n FungibleConditionCode[FungibleConditionCode[\"Greater\"] = 2] = \"Greater\";\n FungibleConditionCode[FungibleConditionCode[\"GreaterEqual\"] = 3] = \"GreaterEqual\";\n FungibleConditionCode[FungibleConditionCode[\"Less\"] = 4] = \"Less\";\n FungibleConditionCode[FungibleConditionCode[\"LessEqual\"] = 5] = \"LessEqual\";\n})(FungibleConditionCode \|\| (FungibleConditionCode = {}));\nexport var NonFungibleConditionCode;\n(function (NonFungibleConditionCode) {\n NonFungibleConditionCode[NonFungibleConditionCode[\"Sends\"] = 16] = \"Sends\";\n NonFungibleConditionCode[NonFungibleConditionCode[\"DoesNotSend\"] = 17] = \"DoesNotSend\";\n})(NonFungibleConditionCode \|\| (NonFungibleConditionCode = {}));\nexport var PostConditionPrincipalId;\n(function (PostConditionPrincipalId) {\n PostConditionPrincipalId[PostConditionPrincipalId[\"Origin\"] = 1] = \"Origin\";\n PostConditionPrincipalId[PostConditionPrincipalId[\"Standard\"] = 2] = \"Standard\";\n PostConditionPrincipalId[PostConditionPrincipalId[\"Contract\"] = 3] = \"Contract\";\n})(PostConditionPrincipalId \|\| (PostConditionPrincipalId = {}));\nexport var AssetType;\n(function (AssetType) {\n AssetType[AssetType[\"STX\"] = 0] = \"STX\";\n AssetType[AssetType[\"Fungible\"] = 1] = \"Fungible\";\n AssetType[AssetType[\"NonFungible\"] = 2] = \"NonFungible\";\n})(AssetType \|\| (AssetType = {}));\nexport var TenureChangeCause;\n(function (TenureChangeCause) {\n TenureChangeCause[TenureChangeCause[\"BlockFound\"] = 0] = \"BlockFound\";\n TenureChangeCause[TenureChangeCause[\"Extended\"] = 1] = \"Extended\";\n})(TenureChangeCause \|\| (TenureChangeCause = {}));\nexport var AuthFieldType;\n(function (AuthFieldType) {\n AuthFieldType[AuthFieldType[\"PublicKeyCompressed\"] = 0] = \"PublicKeyCompressed\";\n AuthFieldType[AuthFieldType[\"PublicKeyUncompressed\"] = 1] = \"PublicKeyUncompressed\";\n AuthFieldType[AuthFieldType[\"SignatureCompressed\"] = 2] = \"SignatureCompressed\";\n AuthFieldType[AuthFieldType[\"SignatureUncompressed\"] = 3] = \"SignatureUncompressed\";\n})(AuthFieldType \|\| (AuthFieldType = {}));\nexport var TxRejectedReason;\n(function (TxRejectedReason) {\n TxRejectedReason[\"Serialization\"] = \"Serialization\";\n TxRejectedReason[\"Deserialization\"] = \"Deserialization\";\n TxRejectedReason[\"SignatureValidation\"] = \"SignatureValidation\";\n TxRejectedReason[\"FeeTooLow\"] = \"FeeTooLow\";\n TxRejectedReason[\"BadNonce\"] = \"BadNonce\";\n TxRejectedReason[\"NotEnoughFunds\"] = \"NotEnoughFunds\";\n TxRejectedReason[\"NoSuchContract\"] = \"NoSuchContract\";\n TxRejectedReason[\"NoSuchPublicFunction\"] = \"NoSuchPublicFunction\";\n TxRejectedReason[\"BadFunctionArgument\"] = \"BadFunctionArgument\";\n TxRejectedReason[\"ContractAlreadyExists\"] = \"ContractAlreadyExists\";\n TxRejectedReason[\"PoisonMicroblocksDoNotConflict\"] = \"PoisonMicroblocksDoNotConflict\";\n TxRejectedReason[\"PoisonMicroblockHasUnknownPubKeyHash\"] = \"PoisonMicroblockHasUnknownPubKeyHash\";\n TxRejectedReason[\"PoisonMicroblockIsInvalid\"] = \"PoisonMicroblockIsInvalid\";\n TxRejectedReason[\"BadAddressVersionByte\"] = \"BadAddressVersionByte\";\n TxRejectedReason[\"NoCoinbaseViaMempool\"] = \"NoCoinbaseViaMempool\";\n TxRejectedReason[\"ServerFailureNoSuchChainTip\"] = \"ServerFailureNoSuchChainTip\";\n TxRejectedReason[\"ServerFailureDatabase\"] = \"ServerFailureDatabase\";\n TxRejectedReason[\"ServerFailureOther\"] = \"ServerFailureOther\";\n})(TxRejectedReason \|\| (TxRejectedReason = {}));\n//# sourceMappingURL=constants.js.map","import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = Uint8Array.from({ length: 16 }, (_, i) => i);\nconst Pi = Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n for (let j of [idxL, idxR])\n j.push(j[i].map((k) => Rho[k]));\nconst shifts = [\n [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = new Uint32Array([0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]);\nconst Kr = new Uint32Array([0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) \| (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n if (group === 0)\n return x ^ y ^ z;\n else if (group === 1)\n return (x & y) \| (~x & z);\n else if (group === 2)\n return (x \| ~y) ^ z;\n else if (group === 3)\n return (x & z) \| (y & ~z);\n else\n return x ^ (y \| ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = new Uint32Array(16);\nexport class RIPEMD160 extends SHA2 {\n constructor() {\n super(64, 20, 8, true);\n this.h0 = 0x67452301 \| 0;\n this.h1 = 0xefcdab89 \| 0;\n this.h2 = 0x98badcfe \| 0;\n this.h3 = 0x10325476 \| 0;\n this.h4 = 0xc3d2e1f0 \| 0;\n }\n get() {\n const { h0, h1, h2, h3, h4 } = this;\n return [h0, h1, h2, h3, h4];\n }\n set(h0, h1, h2, h3, h4) {\n this.h0 = h0 \| 0;\n this.h1 = h1 \| 0;\n this.h2 = h2 \| 0;\n this.h3 = h3 \| 0;\n this.h4 = h4 \| 0;\n }\n process(view, offset) {\n for (let i = 0; i < 16; i++, offset += 4)\n BUF[i] = view.getUint32(offset, true);\n // prettier-ignore\n let al = this.h0 \| 0, ar = al, bl = this.h1 \| 0, br = bl, cl = this.h2 \| 0, cr = cl, dl = this.h3 \| 0, dr = dl, el = this.h4 \| 0, er = el;\n // Instead of iterating 0 to 80, we split it into 5 groups\n // And use the groups in constants, functions, etc. Much simpler\n for (let group = 0; group < 5; group++) {\n const rGroup = 4 - group;\n const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n for (let i = 0; i < 16; i++) {\n const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) \| 0;\n al = el, el = dl, dl = rotl(cl, 10) \| 0, cl = bl, bl = tl; // prettier-ignore\n }\n // 2 loops are 10% faster\n for (let i = 0; i < 16; i++) {\n const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) \| 0;\n ar = er, er = dr, dr = rotl(cr, 10) \| 0, cr = br, br = tr; // prettier-ignore\n }\n }\n // Add the compressed chunk to the current hash value\n this.set((this.h1 + cl + dr) \| 0, (this.h2 + dl + er) \| 0, (this.h3 + el + ar) \| 0, (this.h4 + al + br) \| 0, (this.h0 + bl + cr) \| 0);\n }\n roundClean() {\n BUF.fill(0);\n }\n destroy() {\n this.destroyed = true;\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0);\n }\n}\n/*\n RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n /\nexport const ripemd160 = wrapConstructor(() => new RIPEMD160());\n","const U32_MASK64 = BigInt(2 * 32 - 1);\nconst _32n = BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nexport function fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) \| 0, l: Number(n & U32_MASK64) \| 0 };\n}\nexport function split(lst, le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nexport const toBig = (h, l) => (BigInt(h >>> 0) << _32n) \| BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) \| (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) \| (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) \| (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (h, l) => l;\nconst rotr32L = (h, l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) \| (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) \| (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) \| (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) \| (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\n// Removing \"export\" has 5% perf penalty -_-\nexport function add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 32) \| 0)) \| 0, l: l \| 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 32) \| 0)) \| 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 32) \| 0)) \| 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 32) \| 0)) \| 0;\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","import { SHA2 } from './_sha2.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n)));\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = new Uint32Array(80);\nconst SHA512_W_L = new Uint32Array(80);\nexport class SHA512 extends SHA2 {\n constructor() {\n super(128, 64, 16, false);\n // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n // Also looks cleaner and easier to verify with spec.\n // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x6a09e667 \| 0;\n this.Al = 0xf3bcc908 \| 0;\n this.Bh = 0xbb67ae85 \| 0;\n this.Bl = 0x84caa73b \| 0;\n this.Ch = 0x3c6ef372 \| 0;\n this.Cl = 0xfe94f82b \| 0;\n this.Dh = 0xa54ff53a \| 0;\n this.Dl = 0x5f1d36f1 \| 0;\n this.Eh = 0x510e527f \| 0;\n this.El = 0xade682d1 \| 0;\n this.Fh = 0x9b05688c \| 0;\n this.Fl = 0x2b3e6c1f \| 0;\n this.Gh = 0x1f83d9ab \| 0;\n this.Gl = 0xfb41bd6b \| 0;\n this.Hh = 0x5be0cd19 \| 0;\n this.Hl = 0x137e2179 \| 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n SHA512_W_H.fill(0);\n SHA512_W_L.fill(0);\n }\n destroy() {\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nclass SHA512_224 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x8c3d37c8 \| 0;\n this.Al = 0x19544da2 \| 0;\n this.Bh = 0x73e19966 \| 0;\n this.Bl = 0x89dcd4d6 \| 0;\n this.Ch = 0x1dfab7ae \| 0;\n this.Cl = 0x32ff9c82 \| 0;\n this.Dh = 0x679dd514 \| 0;\n this.Dl = 0x582f9fcf \| 0;\n this.Eh = 0x0f6d2b69 \| 0;\n this.El = 0x7bd44da8 \| 0;\n this.Fh = 0x77e36f73 \| 0;\n this.Fl = 0x04c48942 \| 0;\n this.Gh = 0x3f9d85a8 \| 0;\n this.Gl = 0x6a1d36c8 \| 0;\n this.Hh = 0x1112e6ad \| 0;\n this.Hl = 0x91d692a1 \| 0;\n this.outputLen = 28;\n }\n}\nclass SHA512_256 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x22312194 \| 0;\n this.Al = 0xfc2bf72c \| 0;\n this.Bh = 0x9f555fa3 \| 0;\n this.Bl = 0xc84c64c2 \| 0;\n this.Ch = 0x2393b86b \| 0;\n this.Cl = 0x6f53b151 \| 0;\n this.Dh = 0x96387719 \| 0;\n this.Dl = 0x5940eabd \| 0;\n this.Eh = 0x96283ee2 \| 0;\n this.El = 0xa88effe3 \| 0;\n this.Fh = 0xbe5e1e25 \| 0;\n this.Fl = 0x53863992 \| 0;\n this.Gh = 0x2b0199fc \| 0;\n this.Gl = 0x2c85b8aa \| 0;\n this.Hh = 0x0eb72ddc \| 0;\n this.Hl = 0x81c52ca2 \| 0;\n this.outputLen = 32;\n }\n}\nclass SHA384 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0xcbbb9d5d \| 0;\n this.Al = 0xc1059ed8 \| 0;\n this.Bh = 0x629a292a \| 0;\n this.Bl = 0x367cd507 \| 0;\n this.Ch = 0x9159015a \| 0;\n this.Cl = 0x3070dd17 \| 0;\n this.Dh = 0x152fecd8 \| 0;\n this.Dl = 0xf70e5939 \| 0;\n this.Eh = 0x67332667 \| 0;\n this.El = 0xffc00b31 \| 0;\n this.Fh = 0x8eb44a87 \| 0;\n this.Fl = 0x68581511 \| 0;\n this.Gh = 0xdb0c2e0d \| 0;\n this.Gl = 0x64f98fa7 \| 0;\n this.Hh = 0x47b5481d \| 0;\n this.Hl = 0xbefa4fa4 \| 0;\n this.outputLen = 48;\n }\n}\nexport const sha512 = wrapConstructor(() => new SHA512());\nexport const sha512_224 = wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = wrapConstructor(() => new SHA512_256());\nexport const sha384 = wrapConstructor(() => new SHA384());\n","import { ripemd160 } from '@noble/hashes/ripemd160';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { sha512_256 } from '@noble/hashes/sha512';\nimport { utils } from '@noble/secp256k1';\nimport { bytesToHex, concatArray, concatBytes, utf8ToBytes } from '@stacks/common';\nimport { c32addressDecode } from 'c32check';\nimport lodashCloneDeep from 'lodash.clonedeep';\nimport { deserializeCV, serializeCV } from './clarity';\nexport { verify as verifySignature } from '@noble/secp256k1';\nexport const randomBytes = (bytesLength) => utils.randomBytes(bytesLength);\nexport const leftPadHex = (hexString) => hexString.length % 2 ? `0${hexString}` : hexString;\nexport const leftPadHexToLength = (hexString, length) => hexString.padStart(length, '0');\nexport const rightPadHexToLength = (hexString, length) => hexString.padEnd(length, '0');\nexport const exceedsMaxLengthBytes = (string, maxLengthBytes) => string ? utf8ToBytes(string).length > maxLengthBytes : false;\nexport function cloneDeep(obj) {\n return lodashCloneDeep(obj);\n}\nexport function omit(obj, prop) {\n const clone = cloneDeep(obj);\n delete clone[prop];\n return clone;\n}\nexport const hash160 = (input) => {\n return ripemd160(sha256(input));\n};\nexport const txidFromData = (data) => {\n return bytesToHex(sha512_256(data));\n};\nexport const txidFromBytes = txidFromData;\nexport const hashP2PKH = (input) => {\n return bytesToHex(hash160(input));\n};\nexport const hashP2WPKH = (input) => {\n const keyHash = hash160(input);\n const redeemScript = concatBytes(new Uint8Array([0]), new Uint8Array([keyHash.length]), keyHash);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport const hashP2SH = (numSigs, pubKeys) => {\n if (numSigs > 15 \|\| pubKeys.length > 15) {\n throw Error('P2SH multisig address can only contain up to 15 public keys');\n }\n const bytesArray = [];\n bytesArray.push(80 + numSigs);\n pubKeys.forEach(pubKey => {\n bytesArray.push(pubKey.length);\n bytesArray.push(pubKey);\n });\n bytesArray.push(80 + pubKeys.length);\n bytesArray.push(174);\n const redeemScript = concatArray(bytesArray);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport const hashP2WSH = (numSigs, pubKeys) => {\n if (numSigs > 15 \|\| pubKeys.length > 15) {\n throw Error('P2WSH multisig address can only contain up to 15 public keys');\n }\n const scriptArray = [];\n scriptArray.push(80 + numSigs);\n pubKeys.forEach(pubKey => {\n scriptArray.push(pubKey.length);\n scriptArray.push(pubKey);\n });\n scriptArray.push(80 + pubKeys.length);\n scriptArray.push(174);\n const script = concatArray(scriptArray);\n const digest = sha256(script);\n const bytesArray = [];\n bytesArray.push(0);\n bytesArray.push(digest.length);\n bytesArray.push(digest);\n const redeemScript = concatArray(bytesArray);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport function isClarityName(name) {\n const regex = /^[a-zA-Z]([a-zA-Z0-9]\|[-_!?+<>=/])$\|^[-+=/]$\|^[<>]=?$/;\n return regex.test(name) && name.length < 128;\n}\nexport function cvToHex(cv) {\n const serialized = serializeCV(cv);\n return `0x${serialized}`;\n}\nexport function hexToCV(hex) {\n return deserializeCV(hex);\n}\nexport const parseReadOnlyResponse = (response) => {\n if (response.okay)\n return hexToCV(response.result);\n throw new Error(response.cause);\n};\nexport const validateStacksAddress = (address) => {\n try {\n c32addressDecode(address);\n return true;\n }\n catch (e) {\n return false;\n }\n};\nexport function parseContractId(contractId) {\n const [address, name] = contractId.split('.');\n if (!address \|\| !name)\n throw new Error(`Invalid contract identifier: ${contractId}`);\n return [address, name];\n}\n//# sourceMappingURL=utils.js.map","export var StacksWireType;\n(function (StacksWireType) {\n StacksWireType[StacksWireType[\"Address\"] = 0] = \"Address\";\n StacksWireType[StacksWireType[\"Principal\"] = 1] = \"Principal\";\n StacksWireType[StacksWireType[\"LengthPrefixedString\"] = 2] = \"LengthPrefixedString\";\n StacksWireType[StacksWireType[\"MemoString\"] = 3] = \"MemoString\";\n StacksWireType[StacksWireType[\"Asset\"] = 4] = \"Asset\";\n StacksWireType[StacksWireType[\"PostCondition\"] = 5] = \"PostCondition\";\n StacksWireType[StacksWireType[\"PublicKey\"] = 6] = \"PublicKey\";\n StacksWireType[StacksWireType[\"LengthPrefixedList\"] = 7] = \"LengthPrefixedList\";\n StacksWireType[StacksWireType[\"Payload\"] = 8] = \"Payload\";\n StacksWireType[StacksWireType[\"MessageSignature\"] = 9] = \"MessageSignature\";\n StacksWireType[StacksWireType[\"StructuredDataSignature\"] = 10] = \"StructuredDataSignature\";\n StacksWireType[StacksWireType[\"TransactionAuthField\"] = 11] = \"TransactionAuthField\";\n})(StacksWireType \|\| (StacksWireType = {}));\nexport function whenWireType(wireType) {\n return (wireTypeMap) => wireTypeMap[wireType];\n}\n//# sourceMappingURL=types.js.map","import { hmac } from '@noble/hashes/hmac';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { getPublicKey as nobleGetPublicKey, Point, Signature, signSync, utils, } from '@noble/secp256k1';\nimport { bytesToHex, hexToBigInt, hexToBytes, intToHex, parseRecoverableSignatureVrs, PRIVATE_KEY_BYTES_COMPRESSED, privateKeyToBytes, signatureRsvToVrs, signatureVrsToRsv, } from '@stacks/common';\nimport { networkFrom, STACKS_MAINNET } from '@stacks/network';\nimport { c32address } from 'c32check';\nimport { addressHashModeToVersion } from './address';\nimport { AddressHashMode, PubKeyEncoding } from './constants';\nimport { hash160, hashP2PKH } from './utils';\nimport { addressFromVersionHash, addressToString, StacksWireType } from './wire';\nutils.hmacSha256Sync = (key, ...msgs) => {\n const h = hmac.create(sha256, key);\n msgs.forEach(msg => h.update(msg));\n return h.digest();\n};\nexport function getAddressFromPrivateKey(privateKey, network = 'mainnet') {\n network = networkFrom(network);\n const publicKey = privateKeyToPublic(privateKey);\n return getAddressFromPublicKey(publicKey, network);\n}\nexport function getAddressFromPublicKey(publicKey, network = 'mainnet') {\n network = networkFrom(network);\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n const addrVer = addressHashModeToVersion(AddressHashMode.P2PKH, network);\n const addr = addressFromVersionHash(addrVer, hashP2PKH(publicKey));\n const addrString = addressToString(addr);\n return addrString;\n}\nexport function createStacksPublicKey(publicKey) {\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return {\n type: StacksWireType.PublicKey,\n data: publicKey,\n };\n}\nexport function publicKeyFromSignatureVrs(messageHash, messageSignature, pubKeyEncoding = PubKeyEncoding.Compressed) {\n const parsedSignature = parseRecoverableSignatureVrs(messageSignature);\n const signature = new Signature(hexToBigInt(parsedSignature.r), hexToBigInt(parsedSignature.s));\n const point = Point.fromSignature(messageHash, signature, parsedSignature.recoveryId);\n const compressed = pubKeyEncoding === PubKeyEncoding.Compressed;\n return point.toHex(compressed);\n}\nexport function publicKeyFromSignatureRsv(messageHash, messageSignature, pubKeyEncoding = PubKeyEncoding.Compressed) {\n return publicKeyFromSignatureVrs(messageHash, signatureRsvToVrs(messageSignature), pubKeyEncoding);\n}\nexport function privateKeyToHex(publicKey) {\n return typeof publicKey === 'string' ? publicKey : bytesToHex(publicKey);\n}\nexport const publicKeyToHex = privateKeyToHex;\nexport const isPrivateKeyCompressed = privateKeyIsCompressed;\nexport function privateKeyIsCompressed(privateKey) {\n const length = typeof privateKey === 'string' ? privateKey.length / 2 : privateKey.byteLength;\n return length === PRIVATE_KEY_BYTES_COMPRESSED;\n}\nexport const isPublicKeyCompressed = publicKeyIsCompressed;\nexport function publicKeyIsCompressed(publicKey) {\n return !publicKeyToHex(publicKey).startsWith('04');\n}\nexport function privateKeyToPublic(privateKey) {\n privateKey = privateKeyToBytes(privateKey);\n const isCompressed = privateKeyIsCompressed(privateKey);\n return bytesToHex(nobleGetPublicKey(privateKey.slice(0, 32), isCompressed));\n}\nexport function compressPublicKey(publicKey) {\n return Point.fromHex(publicKeyToHex(publicKey)).toHex(true);\n}\nexport function uncompressPublicKey(publicKey) {\n return Point.fromHex(publicKeyToHex(publicKey)).toHex(false);\n}\nexport const makeRandomPrivKey = randomPrivateKey;\nexport function randomPrivateKey() {\n return compressPrivateKey(utils.randomPrivateKey());\n}\nexport function signWithKey(privateKey, messageHash) {\n privateKey = privateKeyToBytes(privateKey);\n const [rawSignature, recoveryId] = signSync(messageHash, privateKey.slice(0, 32), {\n canonical: true,\n recovered: true,\n });\n if (recoveryId == null) {\n throw new Error('No signature recoveryId received');\n }\n const recoveryIdHex = intToHex(recoveryId, 1);\n return recoveryIdHex + Signature.fromHex(rawSignature).toCompactHex();\n}\nexport function signMessageHashRsv({ messageHash, privateKey, }) {\n return signatureVrsToRsv(signWithKey(privateKey, messageHash));\n}\nexport function compressPrivateKey(privateKey) {\n privateKey = privateKeyToHex(privateKey);\n return privateKey.length == PRIVATE_KEY_BYTES_COMPRESSED 2\n ? privateKey\n : `${privateKey}01`;\n}\nexport function privateKeyToAddress(privateKey, network) {\n const publicKey = privateKeyToPublic(privateKey);\n return publicKeyToAddressSingleSig(publicKey, network);\n}\nexport function publicKeyToAddress(...args) {\n if (typeof args[0] === 'number')\n return _publicKeyToAddress(...args);\n return publicKeyToAddressSingleSig(...args);\n}\nfunction _publicKeyToAddress(version, publicKey) {\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return c32address(version, bytesToHex(hash160(publicKey)));\n}\nexport function publicKeyToAddressSingleSig(publicKey, network) {\n network = network ? networkFrom(network) : STACKS_MAINNET;\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return c32address(network.addressVersion.singleSig, bytesToHex(hash160(publicKey)));\n}\n//# sourceMappingURL=keys.js.map","import { STACKS_MAINNET, TransactionVersion, networkFrom, } from '@stacks/network';\nimport { AddressHashMode, AddressVersion } from './constants';\nexport function addressHashModeToVersion(hashMode, network) {\n network = networkFrom(network ?? STACKS_MAINNET);\n switch (hashMode) {\n case AddressHashMode.P2PKH:\n switch (network.transactionVersion) {\n case TransactionVersion.Mainnet:\n return AddressVersion.MainnetSingleSig;\n case TransactionVersion.Testnet:\n return AddressVersion.TestnetSingleSig;\n default:\n throw new Error(`Unexpected transactionVersion ${network.transactionVersion} for hashMode ${hashMode}`);\n }\n case AddressHashMode.P2SH:\n case AddressHashMode.P2SHNonSequential:\n case AddressHashMode.P2WPKH:\n case AddressHashMode.P2WSH:\n case AddressHashMode.P2WSHNonSequential:\n switch (network.transactionVersion) {\n case TransactionVersion.Mainnet:\n return AddressVersion.MainnetMultiSig;\n case TransactionVersion.Testnet:\n return AddressVersion.TestnetMultiSig;\n default:\n throw new Error(`Unexpected transactionVersion ${network.transactionVersion} for hashMode ${hashMode}`);\n }\n default:\n throw new Error(`Unexpected hashMode ${hashMode}`);\n }\n}\n//# sourceMappingURL=address.js.map","import { c32address } from 'c32check';\nimport { AddressHashMode, PayloadType } from '../constants';\nimport { publicKeyIsCompressed } from '../keys';\nimport { hashP2PKH, hashP2SH, hashP2WPKH, hashP2WSH } from '../utils';\nimport { createAsset, createContractPrincipal, createStandardPrincipal } from './create';\nimport { serializePublicKeyBytes } from './serialization';\nimport { StacksWireType, } from './types';\nexport function addressFromPublicKeys(version, hashMode, numSigs, publicKeys) {\n if (publicKeys.length === 0) {\n throw Error('Invalid number of public keys');\n }\n if (hashMode === AddressHashMode.P2PKH \|\| hashMode === AddressHashMode.P2WPKH) {\n if (publicKeys.length !== 1 \|\| numSigs !== 1) {\n throw Error('Invalid number of public keys or signatures');\n }\n }\n if (hashMode === AddressHashMode.P2WPKH \|\|\n hashMode === AddressHashMode.P2WSH \|\|\n hashMode === AddressHashMode.P2WSHNonSequential) {\n if (!publicKeys.map(p => p.data).every(publicKeyIsCompressed)) {\n throw Error('Public keys must be compressed for segwit');\n }\n }\n switch (hashMode) {\n case AddressHashMode.P2PKH:\n return addressFromVersionHash(version, hashP2PKH(publicKeys[0].data));\n case AddressHashMode.P2WPKH:\n return addressFromVersionHash(version, hashP2WPKH(publicKeys[0].data));\n case AddressHashMode.P2SH:\n case AddressHashMode.P2SHNonSequential:\n return addressFromVersionHash(version, hashP2SH(numSigs, publicKeys.map(serializePublicKeyBytes)));\n case AddressHashMode.P2WSH:\n case AddressHashMode.P2WSHNonSequential:\n return addressFromVersionHash(version, hashP2WSH(numSigs, publicKeys.map(serializePublicKeyBytes)));\n }\n}\nexport function addressFromVersionHash(version, hash) {\n return { type: StacksWireType.Address, version, hash160: hash };\n}\nexport function addressToString(address) {\n return c32address(address.version, address.hash160);\n}\nexport function isTokenTransferPayload(p) {\n return p.payloadType === PayloadType.TokenTransfer;\n}\nexport function isContractCallPayload(p) {\n return p.payloadType === PayloadType.ContractCall;\n}\nexport function isSmartContractPayload(p) {\n return p.payloadType === PayloadType.SmartContract;\n}\nexport function isPoisonPayload(p) {\n return p.payloadType === PayloadType.PoisonMicroblock;\n}\nexport function isCoinbasePayload(p) {\n return p.payloadType === PayloadType.Coinbase;\n}\nexport function parseAssetString(id) {\n const [assetAddress, assetContractName, assetTokenName] = id.split(/\\.\|::/);\n const asset = createAsset(assetAddress, assetContractName, assetTokenName);\n return asset;\n}\nexport function parsePrincipalString(principalString) {\n if (principalString.includes('.')) {\n const [address, contractName] = principalString.split('.');\n return createContractPrincipal(address, contractName);\n }\n else {\n return createStandardPrincipal(principalString);\n }\n}\n//# sourceMappingURL=helpers.js.map","import { decodeToken, SECP256K1Client, TokenSigner, TokenVerifier } from 'jsontokens';\nimport { TokenInterface } from 'jsontokens/lib/decode';\nimport { nextYear, makeUUID4 } from '@stacks/common';\nimport { getAddressFromPublicKey } from '@stacks/transactions';\n\n/*\n Signs a profile token\n * @param {Object} profile - the JSON of the profile to be signed\n * @param {String} privateKey - the signing private key\n * @param {Object} subject - the entity that the information is about\n * @param {Object} issuer - the entity that is issuing the token\n * @param {String} signingAlgorithm - the signing algorithm to use\n * @param {Date} issuedAt - the time of issuance of the token\n * @param {Date} expiresAt - the time of expiration of the token\n * @returns {Object} - the signed profile token\n \n /\nexport function signProfileToken(\n profile: any,\n privateKey: string,\n subject?: any,\n issuer?: any,\n signingAlgorithm = 'ES256K',\n issuedAt = new Date(),\n expiresAt = nextYear()\n): string {\n if (signingAlgorithm !== 'ES256K') {\n throw new Error('Signing algorithm not supported');\n }\n\n const publicKey = SECP256K1Client.derivePublicKey(privateKey);\n\n if (!subject) {\n subject = { publicKey };\n }\n\n if (!issuer) {\n issuer = { publicKey };\n }\n\n const tokenSigner = new TokenSigner(signingAlgorithm, privateKey);\n\n const payload = {\n jti: makeUUID4(),\n iat: issuedAt.toISOString(),\n exp: expiresAt.toISOString(),\n subject,\n issuer,\n claim: profile,\n };\n\n return tokenSigner.sign(payload);\n}\n\n/*\n Wraps a token for a profile token file\n * @param {String} token - the token to be wrapped\n * @returns {Object} - including `token` and `decodedToken`\n /\nexport function wrapProfileToken(token: string) {\n return {\n token,\n decodedToken: decodeToken(token),\n };\n}\n\n/\n Verifies a profile token\n * @param {String} token - the token to be verified\n * @param {String} publicKeyOrAddress - the public key or address of the\n * keypair that is thought to have signed the token\n * @returns {Object} - the verified, decoded profile token\n * @throws {Error} - throws an error if token verification fails\n /\nexport function verifyProfileToken(token: string, publicKeyOrAddress: string): TokenInterface {\n const decodedToken = decodeToken(token);\n const payload = decodedToken.payload;\n if (typeof payload === 'string') {\n throw new Error('Unexpected token payload type of string');\n }\n\n // Inspect and verify the subject\n if (payload.hasOwnProperty('subject') && payload.subject) {\n if (!payload.subject.hasOwnProperty('publicKey')) {\n throw new Error(\"Token doesn't have a subject public key\");\n }\n } else {\n throw new Error(\"Token doesn't have a subject\");\n }\n\n // Inspect and verify the issuer\n if (payload.hasOwnProperty('issuer') && payload.issuer) {\n if (!payload.issuer.hasOwnProperty('publicKey')) {\n throw new Error(\"Token doesn't have an issuer public key\");\n }\n } else {\n throw new Error(\"Token doesn't have an issuer\");\n }\n\n // Inspect and verify the claim\n if (!payload.hasOwnProperty('claim')) {\n throw new Error(\"Token doesn't have a claim\");\n }\n\n const issuerPublicKey = (payload.issuer as Record<string, string>).publicKey;\n const address = getAddressFromPublicKey(issuerPublicKey);\n\n if (publicKeyOrAddress === issuerPublicKey) {\n // pass\n } else if (publicKeyOrAddress === address) {\n // pass\n } else {\n throw new Error('Token issuer public key does not match the verifying value');\n }\n\n const tokenVerifier = new TokenVerifier(decodedToken.header.alg as string, issuerPublicKey);\n if (!tokenVerifier) {\n throw new Error('Invalid token verifier');\n }\n\n const tokenVerified = tokenVerifier.verify(token);\n if (!tokenVerified) {\n throw new Error('Token verification failed');\n }\n\n return decodedToken;\n}\n\n/\n Extracts a profile from an encoded token and optionally verifies it,\n * if `publicKeyOrAddress` is provided.\n * @param {String} token - the token to be extracted\n * @param {String} publicKeyOrAddress - the public key or address of the\n * keypair that is thought to have signed the token\n * @returns {Object} - the profile extracted from the encoded token\n * @throws {Error} - if the token isn't signed by the provided `publicKeyOrAddress`\n /\nexport function extractProfile(\n token: string,\n publicKeyOrAddress: string \| null = null\n): Record<string, any> {\n let decodedToken;\n if (publicKeyOrAddress) {\n decodedToken = verifyProfileToken(token, publicKeyOrAddress);\n } else {\n decodedToken = decodeToken(token);\n }\n\n let profile = {};\n if (decodedToken.hasOwnProperty('payload')) {\n const payload = decodedToken.payload;\n if (typeof payload === 'string') {\n throw new Error('Unexpected token payload type of string');\n }\n if (payload.hasOwnProperty('claim')) {\n profile = payload.claim as Record<string, any>;\n }\n }\n\n return profile;\n}\n","import { ProfileType } from '../types';\n\n/\n \n * @param serviceName\n * @param data\n \n @ignore\n /\nfunction formatAccount(serviceName: string, data: any) {\n let proofUrl;\n if (data.proof && data.proof.url) {\n proofUrl = data.proof.url;\n }\n return {\n '@type': 'Account',\n service: serviceName,\n identifier: data.username,\n proofType: 'http',\n proofUrl,\n };\n}\n\n/\n \n * @param profile\n \n @ignore\n /\nexport function getPersonFromLegacyFormat(profile: any) {\n const profileData: {\n ['@type']: ProfileType;\n account?: any[];\n name?: string;\n description?: string;\n address?: {\n ['@type']: string;\n addressLocality: string;\n };\n image?: any[];\n website?: {\n ['@type']: string;\n url: string;\n }[];\n } = {\n '@type': 'Person',\n };\n\n if (profile) {\n if (profile.name && profile.name.formatted) {\n profileData.name = profile.name.formatted;\n }\n\n if (profile.bio) {\n profileData.description = profile.bio;\n }\n\n if (profile.location && profile.location.formatted) {\n profileData.address = {\n '@type': 'PostalAddress',\n addressLocality: profile.location.formatted,\n };\n }\n\n const images = [];\n if (profile.avatar && profile.avatar.url) {\n images.push({\n '@type': 'ImageObject',\n name: 'avatar',\n contentUrl: profile.avatar.url,\n });\n }\n if (profile.cover && profile.cover.url) {\n images.push({\n '@type': 'ImageObject',\n name: 'cover',\n contentUrl: profile.cover.url,\n });\n }\n if (images.length) {\n profileData.image = images;\n }\n\n if (profile.website) {\n profileData.website = [\n {\n '@type': 'WebSite',\n url: profile.website,\n },\n ];\n }\n\n const accounts = [];\n if (profile.bitcoin && profile.bitcoin.address) {\n accounts.push({\n '@type': 'Account',\n role: 'payment',\n service: 'bitcoin',\n identifier: profile.bitcoin.address,\n });\n }\n if (profile.twitter && profile.twitter.username) {\n accounts.push(formatAccount('twitter', profile.twitter));\n }\n if (profile.facebook && profile.facebook.username) {\n accounts.push(formatAccount('facebook', profile.facebook));\n }\n if (profile.github && profile.github.username) {\n accounts.push(formatAccount('github', profile.github));\n }\n\n if (profile.auth) {\n if (profile.auth.length > 0) {\n if (profile.auth[0] && profile.auth[0].publicKeychain) {\n accounts.push({\n '@type': 'Account',\n role: 'key',\n service: 'bip32',\n identifier: profile.auth[0].publicKeychain,\n });\n }\n }\n }\n if (profile.pgp && profile.pgp.url) {\n accounts.push({\n '@type': 'Account',\n role: 'key',\n service: 'pgp',\n identifier: profile.pgp.fingerprint,\n contentUrl: profile.pgp.url,\n });\n }\n\n profileData.account = accounts;\n }\n\n return profileData;\n}\n","const config = {\n network: {\n layer1: 'placeholder',\n },\n logLevel: 'debug',\n};\nexport { config };\n//# sourceMappingURL=config.js.map","import { config } from './config';\nconst levels = ['debug', 'info', 'warn', 'error', 'none'];\nconst levelToInt = {};\nconst intToLevel = {};\nfor (let index = 0; index < levels.length; index++) {\n const level = levels[index];\n levelToInt[level] = index;\n intToLevel[index] = level;\n}\nexport class Logger {\n static error(message) {\n if (!this.shouldLog('error'))\n return;\n console.error(this.logMessage('error', message));\n }\n static warn(message) {\n if (!this.shouldLog('warn'))\n return;\n console.warn(this.logMessage('warn', message));\n }\n static info(message) {\n if (!this.shouldLog('info'))\n return;\n console.log(this.logMessage('info', message));\n }\n static debug(message) {\n if (!this.shouldLog('debug'))\n return;\n console.log(this.logMessage('debug', message));\n }\n static logMessage(level, message) {\n return `[${level.toUpperCase()}] ${message}`;\n }\n static shouldLog(level) {\n const currentLevel = levelToInt[config.logLevel];\n return currentLevel <= levelToInt[level];\n }\n}\n//# sourceMappingURL=logger.js.map","import { extractProfile, signProfileToken } from './profileTokens';\n\nimport { getPersonFromLegacyFormat } from './profileSchemas';\nimport {\n getAddress,\n getAvatarUrl,\n getBirthDate,\n getConnections,\n getDescription,\n getFamilyName,\n getGivenName,\n getName,\n getOrganizations,\n getVerifiedAccounts,\n} from './profileSchemas/personUtils';\n\n// TODO: bring into this monorepo/convert to ts\n// @ts-ignore\nimport { makeZoneFile, parseZoneFile } from 'zone-file';\n\n// Could not find a declaration file for module\n// @ts-ignore\nimport as inspector from 'schema-inspector';\n\nimport { Logger } from '@stacks/common';\nimport { NetworkClientParam, clientFromNetwork, networkFrom } from '@stacks/network';\nimport { PublicPersonProfile } from './types';\n\nconst schemaDefinition: { [key: string]: any } = {\n type: 'object',\n properties: {\n '@context': { type: 'string', optional: true },\n '@type': { type: 'string' },\n },\n};\n\n/*\n Represents a user profile\n /\nexport class Profile {\n _profile: { [key: string]: any };\n\n constructor(profile = {}) {\n this._profile = Object.assign(\n {},\n {\n '@context': 'http://schema.org/',\n },\n profile\n );\n }\n\n toJSON() {\n return Object.assign({}, this._profile);\n }\n\n toToken(privateKey: string): string {\n return signProfileToken(this.toJSON(), privateKey);\n }\n\n static validateSchema(profile: any, strict = false): any {\n schemaDefinition.strict = strict;\n return inspector.validate(schemaDefinition, profile);\n }\n\n static fromToken(token: string, publicKeyOrAddress: string \| null = null): Profile {\n const profile = extractProfile(token, publicKeyOrAddress);\n return new Profile(profile);\n }\n\n static makeZoneFile(domainName: string, tokenFileURL: string): string {\n return makeProfileZoneFile(domainName, tokenFileURL);\n }\n}\n\nconst personSchemaDefinition = {\n type: 'object',\n strict: false,\n properties: {\n '@context': { type: 'string', optional: true },\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n name: { type: 'string', optional: true },\n givenName: { type: 'string', optional: true },\n familyName: { type: 'string', optional: true },\n description: { type: 'string', optional: true },\n image: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n name: { type: 'string', optional: true },\n contentUrl: { type: 'string', optional: true },\n },\n },\n },\n website: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n url: { type: 'string', optional: true },\n },\n },\n },\n account: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n service: { type: 'string', optional: true },\n identifier: { type: 'string', optional: true },\n proofType: { type: 'string', optional: true },\n proofUrl: { type: 'string', optional: true },\n proofMessage: { type: 'string', optional: true },\n proofSignature: { type: 'string', optional: true },\n },\n },\n },\n worksFor: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n },\n },\n },\n knows: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n },\n },\n },\n address: {\n type: 'object',\n optional: true,\n properties: {\n '@type': { type: 'string' },\n streetAddress: { type: 'string', optional: true },\n addressLocality: { type: 'string', optional: true },\n postalCode: { type: 'string', optional: true },\n addressCountry: { type: 'string', optional: true },\n },\n },\n birthDate: { type: 'string', optional: true },\n taxID: { type: 'string', optional: true },\n },\n};\n\n/\n @ignore\n /\nexport class Person extends Profile {\n constructor(profile: PublicPersonProfile = { '@type': 'Person' }) {\n super(profile);\n this._profile = Object.assign(\n {},\n {\n '@type': 'Person',\n },\n this._profile\n );\n }\n\n static validateSchema(profile: any, strict = false) {\n personSchemaDefinition.strict = strict;\n return inspector.validate(schemaDefinition, profile);\n }\n\n static fromToken(token: string, publicKeyOrAddress: string \| null = null): Person {\n const profile = extractProfile(token, publicKeyOrAddress) as PublicPersonProfile;\n return new Person(profile);\n }\n\n static fromLegacyFormat(legacyProfile: any) {\n const profile = getPersonFromLegacyFormat(legacyProfile);\n return new Person(profile);\n }\n\n toJSON() {\n return {\n profile: this.profile(),\n name: this.name(),\n givenName: this.givenName(),\n familyName: this.familyName(),\n description: this.description(),\n avatarUrl: this.avatarUrl(),\n verifiedAccounts: this.verifiedAccounts(),\n address: this.address(),\n birthDate: this.birthDate(),\n connections: this.connections(),\n organizations: this.organizations(),\n };\n }\n\n profile() {\n return Object.assign({}, this._profile);\n }\n\n name() {\n return getName(this.profile());\n }\n\n givenName() {\n return getGivenName(this.profile());\n }\n\n familyName() {\n return getFamilyName(this.profile());\n }\n\n description() {\n return getDescription(this.profile());\n }\n\n avatarUrl() {\n return getAvatarUrl(this.profile());\n }\n\n verifiedAccounts(verifications?: any[]) {\n return getVerifiedAccounts(this.profile(), verifications);\n }\n\n address() {\n return getAddress(this.profile());\n }\n\n birthDate() {\n return getBirthDate(this.profile());\n }\n\n connections() {\n return getConnections(this.profile());\n }\n\n organizations() {\n return getOrganizations(this.profile());\n }\n}\n\n/\n \n * @param origin\n * @param tokenFileUrl\n \n @ignore\n /\nexport function makeProfileZoneFile(origin: string, tokenFileUrl: string): string {\n if (!tokenFileUrl.includes('://')) {\n throw new Error('Invalid token file url');\n }\n\n const urlScheme = tokenFileUrl.split('://')[0];\n const urlParts = tokenFileUrl.split('://')[1].split('/');\n const domain = urlParts[0];\n const pathname = `/${urlParts.slice(1).join('/')}`;\n\n const zoneFile = {\n $origin: origin,\n $ttl: 3600,\n uri: [\n {\n name: '_http._tcp',\n priority: 10,\n weight: 1,\n target: `${urlScheme}://${domain}${pathname}`,\n },\n ],\n };\n\n const zoneFileTemplate = '{$origin}\\n{$ttl}\\n{uri}\\n';\n\n return makeZoneFile(zoneFile, zoneFileTemplate);\n}\n\n/\n \n * @param zoneFileJson\n \n @ignore\n /\nexport function getTokenFileUrl(zoneFileJson: any): string \| null {\n if (!zoneFileJson.hasOwnProperty('uri')) {\n return null;\n }\n if (!Array.isArray(zoneFileJson.uri)) {\n return null;\n }\n if (zoneFileJson.uri.length < 1) {\n return null;\n }\n\n const validRecords = zoneFileJson.uri.filter(\n (record: any) => record.hasOwnProperty('target') && record.name === '_http._tcp'\n );\n\n if (validRecords.length < 1) {\n return null;\n }\n\n const firstValidRecord = validRecords[0];\n\n if (!firstValidRecord.hasOwnProperty('target')) {\n return null;\n }\n let tokenFileUrl = firstValidRecord.target;\n\n if (tokenFileUrl.startsWith('https')) {\n // pass\n } else if (tokenFileUrl.startsWith('http')) {\n // pass\n } else {\n tokenFileUrl = `https://${tokenFileUrl}`;\n }\n\n return tokenFileUrl;\n}\n\n/\n \n * @param zoneFile\n * @param publicKeyOrAddress\n \n @ignore\n /\nexport function resolveZoneFileToProfile(\n opts: {\n zoneFile: any;\n publicKeyOrAddress: string;\n } & NetworkClientParam\n): Promise<Record<string, any>> {\n const network = networkFrom(opts.network ?? 'mainnet');\n const client = Object.assign({}, clientFromNetwork(network), opts.client);\n\n return new Promise((resolve, reject) => {\n let zoneFileJson = null;\n try {\n zoneFileJson = parseZoneFile(opts.zoneFile);\n if (!zoneFileJson.hasOwnProperty('$origin')) {\n zoneFileJson = null;\n }\n } catch (e) {\n reject(e);\n }\n\n let tokenFileUrl: string \| null = null;\n if (zoneFileJson && Object.keys(zoneFileJson).length > 0) {\n tokenFileUrl = getTokenFileUrl(zoneFileJson);\n } else {\n try {\n return resolve(Person.fromLegacyFormat(JSON.parse(opts.zoneFile)).profile());\n } catch (error) {\n return reject(error);\n }\n }\n\n if (tokenFileUrl) {\n client\n .fetch(tokenFileUrl)\n .then(response => response.text())\n .then(responseText => JSON.parse(responseText))\n .then(responseJson => {\n const tokenRecords = responseJson;\n const profile = extractProfile(tokenRecords[0].token, opts.publicKeyOrAddress);\n resolve(profile);\n })\n .catch(error => {\n Logger.error(\n `resolveZoneFileToProfile: error fetching token file ${tokenFileUrl}: ${error}`\n );\n reject(error);\n });\n } else {\n Logger.debug('Token file url not found. Resolving to blank profile.');\n resolve({});\n }\n });\n}\n","export function getName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let name = null;\n if (profile.name) {\n name = profile.name;\n } else if (profile.givenName \|\| profile.familyName) {\n name = '';\n if (profile.givenName) {\n name = profile.givenName;\n }\n if (profile.familyName) {\n name += ` ${profile.familyName}`;\n }\n }\n return name;\n}\n\n/\n \n * @ignore\n /\nexport function getGivenName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let givenName = null;\n if (profile.givenName) {\n givenName = profile.givenName;\n } else if (profile.name) {\n const nameParts = profile.name.split(' ');\n givenName = nameParts.slice(0, -1).join(' ');\n }\n return givenName;\n}\n\n/\n \n * @ignore\n /\nexport function getFamilyName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let familyName = null;\n if (profile.familyName) {\n familyName = profile.familyName;\n } else if (profile.name) {\n const nameParts = profile.name.split(' ');\n familyName = nameParts.pop();\n }\n return familyName;\n}\n\n/\n \n * @ignore\n /\nexport function getDescription(profile: any) {\n if (!profile) {\n return null;\n }\n\n let description = null;\n if (profile.description) {\n description = profile.description;\n }\n return description;\n}\n\n/\n \n * @ignore\n /\nexport function getAvatarUrl(profile: any) {\n if (!profile) {\n return null;\n }\n\n let avatarContentUrl: string \| null = null;\n if (profile.image) {\n profile.image.map((image: any) => {\n if (image.name === 'avatar') {\n avatarContentUrl = image.contentUrl;\n return avatarContentUrl;\n } else {\n return null;\n }\n });\n }\n return avatarContentUrl;\n}\n\n/\n \n * @ignore\n /\nexport function getVerifiedAccounts(profile: any, verifications?: any[]) {\n if (!profile) {\n return null;\n }\n\n const filteredAccounts: any[] = [];\n if (profile.hasOwnProperty('account') && verifications) {\n profile.account.map((account: any) => {\n let accountIsValid = false;\n let proofUrl = null;\n\n verifications.map(verification => {\n if (verification.hasOwnProperty('proof_url')) {\n verification.proofUrl = verification.proof_url;\n }\n if (\n verification.valid &&\n verification.service === account.service &&\n verification.identifier === account.identifier &&\n verification.proofUrl\n ) {\n accountIsValid = true;\n proofUrl = verification.proofUrl;\n return true;\n } else {\n return false;\n }\n });\n\n if (accountIsValid) {\n account.proofUrl = proofUrl;\n filteredAccounts.push(account);\n return account;\n } else {\n return null;\n }\n });\n }\n return filteredAccounts;\n}\n\n/\n \n * @ignore\n /\nexport function getOrganizations(profile: any) {\n if (!profile) {\n return null;\n }\n\n const organizations: any[] = [];\n\n if (profile.hasOwnProperty('worksFor')) {\n return profile.worksFor;\n }\n\n return organizations;\n}\n\n/\n \n * @ignore\n /\nexport function getConnections(profile: any) {\n if (!profile) {\n return null;\n }\n\n let connections = [];\n\n if (profile.hasOwnProperty('knows')) {\n connections = profile.knows;\n }\n\n return connections;\n}\n\n/\n \n * @ignore\n /\nexport function getAddress(profile: any) {\n if (!profile) {\n return null;\n }\n\n let addressString = null;\n\n if (profile.hasOwnProperty('address')) {\n const addressParts = [];\n\n if (profile.address.hasOwnProperty('streetAddress')) {\n addressParts.push(profile.address.streetAddress);\n }\n if (profile.address.hasOwnProperty('addressLocality')) {\n addressParts.push(profile.address.addressLocality);\n }\n if (profile.address.hasOwnProperty('postalCode')) {\n addressParts.push(profile.address.postalCode);\n }\n if (profile.address.hasOwnProperty('addressCountry')) {\n addressParts.push(profile.address.addressCountry);\n }\n\n if (addressParts.length) {\n addressString = addressParts.join(', ');\n }\n }\n\n return addressString;\n}\n\n/\n \n * @ignore\n /\nexport function getBirthDate(profile: any) {\n if (!profile) {\n return null;\n }\n\n const monthNames = [\n 'January',\n 'February',\n 'March',\n 'April',\n 'May',\n 'June',\n 'July',\n 'August',\n 'September',\n 'October',\n 'November',\n 'December',\n ];\n\n let birthDateString = null;\n\n if (profile.hasOwnProperty('birthDate')) {\n const date = new Date(profile.birthDate);\n birthDateString = `${monthNames[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;\n }\n\n return birthDateString;\n}\n","import { createFetchFn, FetchFn } from '@stacks/common';\nimport { parseZoneFile } from 'zone-file';\n\nimport { getTokenFileUrl, Person } from '../profile';\nimport { extractProfile } from '../profileTokens';\n\n/\n \n * @param zoneFile\n * @param publicKeyOrAddress\n * @param callback\n \n @ignore\n */\nexport function resolveZoneFileToPerson(\n zoneFile: any,\n publicKeyOrAddress: string,\n callback: (profile: any) => void,\n fetchFn: FetchFn = createFetchFn()\n) {\n let zoneFileJson = null;\n try {\n zoneFileJson = parseZoneFile(zoneFile);\n if (!zoneFileJson.hasOwnProperty('$origin')) {\n zoneFileJson = null;\n throw new Error('zone file is missing an origin');\n }\n } catch (e) {\n console.error(e);\n }\n\n let tokenFileUrl = null;\n if (zoneFileJson && Object.keys(zoneFileJson).length > 0) {\n tokenFileUrl = getTokenFileUrl(zoneFileJson);\n } else {\n let profile = null;\n try {\n profile = JSON.parse(zoneFile);\n const person = Person.fromLegacyFormat(profile);\n profile = person.profile();\n } catch (error) {\n console.warn(error);\n }\n callback(profile);\n return;\n }\n\n if (tokenFileUrl) {\n fetchFn(tokenFileUrl)\n .then((response: any) => response.text())\n .then((responseText: any) => JSON.parse(responseText))\n .then((responseJson: any) => {\n const tokenRecords = responseJson;\n const token = tokenRecords[0].token;\n const profile = extractProfile(token, publicKeyOrAddress);\n\n callback(profile);\n })\n .catch((error: any) => {\n console.warn(error);\n });\n } else {\n console.warn('Token file url not found');\n callback({});\n }\n}\n"],"names":["root","factory","exports","module","define","amd","this","leafPrototypes","getProto","number","n","Number","isSafeInteger","Error","bool","b","bytes","lengths","Uint8Array","TypeError","length","includes","hash","create","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","output","out","min","Object","defineProperty","value","assert","SHA2","_assert_js_1","utils_js_1","Hash","constructor","padOffset","isLE","super","pos","buffer","view","createView","update","data","default","len","toBytes","take","Math","set","subarray","process","dataView","roundClean","digestInto","fill","i","byteOffset","setBigUint64","_32n","BigInt","_u32_max","wh","wl","h","l","setUint32","oview","outLen","state","get","digest","res","slice","destroy","_cloneInto","to","crypto","node","undefined","web","self","hmac","HMAC","_key","key","iHash","pad","oHash","buf","getPrototypeOf","message","sha224","sha256","_sha2_js_1","Maj","a","c","SHA256_K","Uint32Array","IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","offset","getUint32","W15","W2","s0","rotr","s1","T1","T2","SHA224","wrapConstructor","randomBytes","wrapConstructorWithOpts","checkOpts","concatBytes","utf8ToBytes","asyncLoop","nextTick","hexToBytes","bytesToHex","u32","u8","crypto_1","arr","byteLength","floor","DataView","word","shift","hexes","Array","from","v","toString","padStart","str","TextEncoder","encode","uint8a","hex","array","j","hexByte","byte","parseInt","isNaN","async","iters","tick","cb","ts","Date","now","diff","arrays","every","reduce","result","clone","defaults","opts","obj","prototype","call","assign","hashConstructor","hashC","tmp","hashCons","msg","bytesLength","getRandomValues","utils","schnorr","verify","signSync","sign","getSharedSecret","recoverPublicKey","getPublicKey","Signature","Point","CURVE","nodeCrypto","_0n","_1n","_2n","_3n","_8n","freeze","P","Gx","Gy","beta","divNearest","endo","splitScalar","k","a1","b1","a2","b2","POW_2_128","c1","c2","k1","mod","k2","k1neg","k2neg","fieldLen","groupLen","compressedLen","uncompressedLen","weierstrass","x","x2","x3","USE_ENDOMORPHISM","ShaError","assertJacPoint","other","JacobianPoint","y","z","fromAffine","p","equals","ZERO","toAffineBatch","points","toInv","nums","scratch","inverted","invert","acc","num","reduceRight","invertBatch","map","toAffine","normalizeZ","X1","Y1","Z1","X2","Y2","Z2","Z1Z1","Z2Z2","U1","U2","S1","S2","negate","double","x1b","X3","Y3","Z3","add","r","HH","HHH","V","subtract","multiplyUnsafe","scalar","P0","normalizeScalar","d","k1p","k2p","precomputeWindow","W","windows","base","window","push","wNAF","affinePoint","BASE","_WINDOW_SIZE","precomputes","pointPrecomputes","f","windowSize","mask","maxNumber","shiftBy","wbits","offset1","offset2","abs","cond1","cond2","constTimeNegate","multiply","point","fake","f1p","f2p","invZ","is0","iz1","iz2","iz3","ax","ay","zz","condition","item","neg","WeakMap","_setWindowSize","delete","hasEvenY","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","_6n","_11n","_22n","_23n","_44n","_88n","b3","b6","pow2","b9","b11","b22","b44","b88","b176","b220","b223","t1","t2","rt","sqrtMod","isYOdd","assertValidity","fromUncompressedHex","fromHex","ensureBytes","header","fromPrivateKey","privateKey","normalizePrivateKey","fromSignature","msgHash","signature","recovery","s","normalizeSignature","truncateHash","radj","rinv","u1","u2","prefix","R","numTo32bStr","Q","multiplyAndAddUnsafe","toRawBytes","isCompressed","toHex","toHexX","toRawX","left","aP","bQ","sum","sliceDER","parseDERInt","fromCompact","name","hexToNumber","fromDER","sBytes","rBytesLeft","parseDERSignature","isWithinCurveOrder","hasHighS","HALF","normalizeS","toDERRawBytes","toDERHex","sHex","numberToHexUnpadded","rHex","sHexL","rHexL","sLen","rLen","toCompactRawBytes","toCompactHex","POW_2_256","numTo32b","power","modulo","u","q","m","truncateOnly","delta","bits2int_2","_sha256Sync","_hmacSha256Sync","HmacDrbg","hashLen","qByteLen","counter","values","hmacSha256","hmacSync","checkSync","incr","reseed","seed","reseedSync","generate","sl","generateSync","kmdToSig","kBytes","lowS","kinv","sig","normalizePublicKey","publicKey","error","isProbPub","bits2int","bits2octets","z1","z2","int2octets","initSigArgs","extraEntropy","h1","seedArgs","e","finalizeSig","recSig","der","recovered","canonical","hashed","privateA","publicB","privKey","drbg","vopts","strict","schnorrChallengeFinalize","ch","sinv","SchnorrSignature","InternalSchnorrSignature","auxRand","getScalar","px","rand","priv","initNonce","t0h","finalizeNonce","k0h","k0","rx","calc","tag","taggedHash","t","TAGS","aux","nonce","challenge","schnorrVerify","calcSync","taggedHashSync","schnorrVerifySync","initSchnorrVerify","raw","finalizeSchnorrVerify","verifySync","TAGGED_HASH_PREFIXES","isValidPrivateKey","_bigintTo32Bytes","_normalizePrivateKey","hashToPrivateKey","minLen","randomPrivateKey","precompute","cached","messages","subtle","createHash","forEach","ckey","importKey","createHmac","sha256Sync","hmacSha256Sync","tagP","tagH","charCodeAt","_JacobianPoint","defineProperties","configurable","val","ALPHABET","BASE_MAP","charAt","xc","LEADER","FACTOR","log","iFACTOR","decodeUnsafe","source","psz","zeroes","size","b256","carry","it3","it4","vch","ArrayBuffer","isView","isArray","pbegin","pend","b58","it1","it2","repeat","decode","string","b64","lens","getLens","validLen","placeHoldersLen","toByteArray","Arr","_byteLength","curByte","revLookup","fromByteArray","uint8","extraBytes","parts","maxChunkLength","len2","encodeChunk","lookup","join","code","indexOf","start","end","c32ToB58","b58ToC32","c32addressDecode","c32address","versions","checksum_1","base58check","utils_1","mainnet","p2pkh","p2sh","testnet","ADDR_BITCOIN_TO_STACKS","ADDR_STACKS_TO_BITCOIN","version","hash160hex","match","c32checkEncode","c32addr","c32checkDecode","b58check","addrInfo","hash160String","addrVersion","stacksVersion","c32string","bitcoinVersion","sha256_1","basex","dataBytes","prefixBytes","checksum","check","index","encoding_1","c32checksum","dataHex","dataHash","toLowerCase","versionHex","checksumHex","c32str","c32encode","c32","c32data","c32normalize","c32decode","versionChar","substring","c32input","toUpperCase","replace","inputHex","minLength","currentCode","nextCode","nextBits","nextLowBits","curC32Digit","unshift","C32leadingZeros","zeroPrefix","TextDecoder","numLeadingZeroBytesInHex","count","numLeadingZeroBytes","carryBits","currentValue","currentHexDigit","hexLeadingZeros","hexStr","address_1","enumerable","unescape","escape","base64_js_1","base64","base64Url","cryptoClients","SECP256K1Client","secp256k1_1","ES256K","hmac_1","secp","ecdsaSigFormatter_1","errors_1","msgs","derivePublicKey","compressed","signHash","signingInputHash","format","MissingParametersError","derSignature","derToJose","loadSignature","joseSignature","joseToDer","verifyHash","derSignatureBytes","algorithmName","__awaiter","thisArg","_arguments","generator","Promise","resolve","reject","fulfilled","step","next","rejected","done","then","apply","hashSha256Async","hashSha256","input","console","decodeToken","base64url","token","tokenParts","split","JSON","parse","payload","allHeaders","headerValue","base64Url_1","getParamSize","keySize","paramBytesForAlg","ES256","ES384","ES512","getParamBytesForAlg","alg","paramBytes","MAX_OCTET","signatureAsBytes","countPadding","stop","padding","signatureBytes","maxEncodedParamLength","inputLength","TAG_SEQ","seqLength","TAG_INT","rLength","rOffset","sLength","sOffset","rPadding","sPadding","dst","max","o","rsBytes","shortLength","InvalidTokenError","__createBinding","desc","getOwnPropertyDescriptor","__esModule","writable","__exportStar","hasOwnProperty","TokenSigner","createUnsecuredToken","cryptoClients_1","createSigningInput","encodedHeader","stringify","encodedPayload","typ","signingAlgorithm","rawPrivateKey","tokenType","cryptoClient","defaultHeader","expanded","customHeader","signingInput","createWithSignedHash","signAsync","TokenVerifier","rawPublicKey","verifyCompact","verifyExpanded","verifyAsync","performVerify","verified","HASH_UNDEFINED","MAX_SAFE_INTEGER","argsTag","boolTag","dateTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reFlags","reIsHostCtor","reIsUint","cloneableTags","freeGlobal","g","freeSelf","Function","freeExports","nodeType","freeModule","moduleExports","addMapEntry","pair","addSetEntry","arrayReduce","iteratee","accumulator","initAccum","isHostObject","mapToArray","overArg","func","transform","arg","setToArray","uid","arrayProto","funcProto","objectProto","coreJsData","maskSrcKey","exec","keys","IE_PROTO","funcToString","objectToString","reIsNative","RegExp","Buffer","Symbol","getPrototype","objectCreate","propertyIsEnumerable","splice","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeKeys","getNative","Map","Set","nativeCreate","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","entries","clear","entry","ListCache","MapCache","Stack","__data__","assignValue","object","objValue","eq","assocIndexOf","baseClone","isDeep","isFull","customizer","stack","isObject","isArr","initCloneArray","copyArray","getTag","isFunc","copy","cloneBuffer","isPrototype","proto","initCloneObject","copyObject","getSymbols","copySymbols","baseAssign","cloneFunc","symbol","Ctor","cloneArrayBuffer","cloneDataView","typedArray","cloneTypedArray","cloneMap","regexp","lastIndex","cloneRegExp","cloneSet","initCloneByTag","stacked","props","keysFunc","symbolsFunc","arrayPush","baseGetAllKeys","getAllKeys","arrayEach","subValue","arrayBuffer","newValue","getMapData","type","getValue","isFunction","test","baseIsNative","has","pop","cache","pairs","LARGE_ARRAY_SIZE","isIndex","ctorString","isArrayLike","isLength","inherited","isObjectLike","isArrayLikeObject","isArguments","baseTimes","String","skipIndexes","arrayLikeKeys","baseKeys","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","concat","drainQueue","timeout","run","marker","runClearTimeout","Item","noop","args","arguments","title","browser","env","argv","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","_extend","origin","_merge","ret","Customisable","custom","extend","reset","remove","fields","_typeIs","field","Inspection","schema","_stack","_schema","_custom","_getDepth","_dumpStack","_deeperObject","_deeperArray","_back","function","element","integer","NaN","boolean","null","date","any","_simpleType","candidate","getIndexes","indexes","_formats","void","url","coolDateTime","time","color","email","numeric","decimal","alpha","alphaNumeric","alphaDash","javascript","upperString","lowerString","v4uuid","_validationAttribut","optional","report","types","some","_realType","uniqueness","reported","pattern","regexs","matches","regex","validDate","getTime","maxLength","exactLength","lt","limit","lte","gt","gte","ne","someKeys","candidat","_keys","action","properties","intruder","filter","callback","asyncExec","asyncProperties","_validate","items","asyncItems","_asyncValidationAttribut","eachSeries","series","_asyncValidate","err","timesSeries","Validation","_error","_basicFields","_customFields","reason","newErr","userCode","userError","property","userAlias","valid","validate","alias","_forceType","post","def","parseFloat","joinWith","splitWith","_applyRules","upper","lower","txt","substr","capitalize","ucfirst","trim","_sanitizationAttribut","opt","rules","modified","rule","postTest","gap","_sanitize","_asyncSanitizationAttribut","execs","globing","_asyncSanitize","Sanitization","_reporting","newNot","reporting","sanitize","waterfall","inter","INT_MAX","_rand","int","random","float","char","fromCharCode","fromList","list","_formatSample","toISOString","toLocaleTimeString","hour12","_getLimits","_typeGenerator","prop","rk","randomKey","CandidateGenerator","_instance","SchemaInspector","newSanitization","newValidation","arrayLike","newLen","newArr","idx","fn","callArgs","initialParams","hasSetImmediate","setImmediate","hasNextTick","fallback","wrap","defer","setImmediate$1","asyncify","invokeCallback","rethrow","supportsSymbol","isAsync","toStringTag","wrapAsync","asyncFn","applyEach$1","eachfn","fns","go","that","Symbol$1","nativeObjectToString","symToStringTag$1","nativeObjectToString$1","nullTag","undefinedTag","symToStringTag","baseGetTag","isOwn","unmasked","getRawTag","asyncTag","proxyTag","breakLoop","callFn","iteratorSymbol","iterator","getIterator","coll","baseIsArguments","objectProto$3","hasOwnProperty$2","MAX_SAFE_INTEGER$1","typedArrayTags","freeExports$1","freeModule$1","freeProcess","nodeUtil","require","nodeIsTypedArray","isTypedArray","hasOwnProperty$1","isArg","isBuff","isType","objectProto$5","hasOwnProperty$3","createArrayIterator","okeys","createES2015Iterator","onlyOnce","_eachOfLimit","nextElem","running","looping","iterateeCallback","replenish","elem","eachOfLimit","doLimit","iterable","eachOfArrayLike","completed","iteratorCallback","eachOfGeneric","Infinity","eachOf","doParallel","_asyncMap","results","_iteratee","_","applyEach","doParallelLimit","mapLimit","mapSeries","applyEachSeries","fromRight","baseFor","baseForOwn","baseIsNaN","baseIndexOf","fromIndex","strictIndexOf","predicate","baseFindIndex","auto","tasks","concurrency","numTasks","runningTasks","hasError","readyTasks","readyToCheck","uncheckedDependencies","enqueueTask","task","taskCallback","safeResults","rkey","processQueue","taskFn","runTask","getDependents","taskName","dependencies","remainingDependencies","dependencyName","taskListeners","dependent","checkForDeadlocks","arrayMap","INFINITY","symbolToString","baseToString","isSymbol","castSlice","baseSlice","reHasUnicode","rsAstralRange$1","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","reUnicode","stringToArray","hasUnicode","unicodeToArray","asciiToArray","reTrim","chars","guard","strSymbols","chrSymbols","charsStartIndex","charsEndIndex","FN_ARGS","FN_ARG_SPLIT","FN_ARG","STRIP_COMMENTS","autoInject","newTasks","params","fnIsAsync","hasNoDeps","newTask","parseParams","taskCb","newArgs","DLL","head","tail","setInitial","dll","worker","_worker","numRunning","workersList","processingScheduled","_insert","insertAtFront","started","idle","drain","_tasks","_next","unsaturated","isProcessing","saturated","empty","paused","kill","testFn","pause","resume","cargo","removeLink","prev","insertAfter","newNode","insertBefore","toArray","curr","eachOfSeries","memo","seq","_functions","newargs","nextargs","compose","reverse","_concat","concatLimit","mapResults","concatSeries","constant","identity","_createTester","getResult","testResult","testPassed","_findGetResult","detect","detectLimit","detectSeries","consoleFunc","doDuring","_fn","_test","truth","doWhilst","doUntil","during","_withoutIndex","eachLimit","eachLimit$1","ensureAsync","sync","innerArgs","notId","everyLimit","everySeries","baseProperty","filterArray","truthValues","filterGeneric","sort","_filter","filterLimit","filterSeries","forever","errback","groupByLimit","groupBy","groupBySeries","mapValuesLimit","newObj","mapValues","mapValuesSeries","memoize","hasher","queues","memoized","unmemoized","_parallel","parallelLimit","parallelLimit$1","queue$1","priorityQueue","priority","nextNode","race","reflect","reflectCallback","cbArg","reflectAll","reject$1","rejectLimit","rejectSeries","constant$1","retry","options","times","intervalFunc","interval","errorFilter","parseTimes","_task","attempt","retryAttempt","retryable","Boolean","someLimit","someSeries","sortBy","comparator","right","criteria","milliseconds","info","timer","timedOut","nativeCeil","ceil","nativeMax","timeLimit","baseRange","tryEach","unmemoize","whilst","until","taskIndex","nextTask","each","parallel","timesLimit","all","allLimit","allSeries","anyLimit","anySeries","find","findLimit","findSeries","forEachSeries","forEachLimit","forEachOf","forEachOfSeries","forEachOfLimit","inject","foldl","foldr","select","selectLimit","selectSeries","wrapSync","bind","$origin","$ttl","ttl","soa","host","ns","ip","aaaa","cname","preference","mx","ptr","weight","port","target","srv","spf","round","uri","replacement","minimum","expire","refresh","serial","rname","mname","lastIndexOf","fullname","jsonZoneFile","toJSON","makeZoneFile","parseZoneFile","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","id","loaded","__webpack_modules__","mode","current","getOwnPropertyNames","definition","globalThis","nmd","paths","children","makeUUID4","performance","defaultFetchOpts","referrerPolicy","headers","fetchWrapper","init","fetchOpts","fetch","fetchLib","middlewares","argsForCreateFetchFn","fetchParams","middleware","pre","response","ChainId","PeerNetworkId","AddressVersion","TransactionVersion","Mainnet","chainId","transactionVersion","peerNetworkId","magicBytes","bootAddress","addressVersion","singleSig","MainnetSingleSig","multiSig","MainnetMultiSig","client","baseUrl","STACKS_TESTNET","Testnet","TestnetSingleSig","TestnetMultiSig","STACKS_DEVNET","STACKS_MOCKNET","network","networkFromName","ClarityVersion","AnchorMode","PayloadType","PostConditionMode","PostConditionType","AuthType","FungibleConditionCode","NonFungibleConditionCode","PostConditionPrincipalId","AssetType","TenureChangeCause","AuthFieldType","TxRejectedReason","PubKeyEncoding","AddressHashMode","OnChainOnly","OffChainOnly","Any","Rho","Id","Pi","idxL","idxR","shifts","shiftsL","shiftsR","Kl","Kr","rotl","group","BUF","RIPEMD160","h0","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sr","tl","tr","ripemd160","U32_MASK64","fromBig","le","lst","Ah","Al","Bh","Bl","Cl","low","Ch","Dl","Dh","Eh","El","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","SHA512_224","SHA512_256","SHA384","StacksWireType","getAddressFromPublicKey","addrVer","hashMode","P2PKH","P2SH","P2SHNonSequential","P2WPKH","P2WSH","P2WSHNonSequential","addressHashModeToVersion","address","Address","hash160","signProfileToken","profile","subject","issuer","issuedAt","expiresAt","setFullYear","getFullYear","nextYear","tokenSigner","jti","iat","exp","claim","wrapProfileToken","decodedToken","verifyProfileToken","publicKeyOrAddress","issuerPublicKey","tokenVerifier","extractProfile","formatAccount","serviceName","proofUrl","proof","service","identifier","username","proofType","levels","levelToInt","intToLevel","level","shouldLog","logMessage","warn","debug","schemaDefinition","Profile","_profile","toToken","validateSchema","fromToken","domainName","tokenFileURL","makeProfileZoneFile","personSchemaDefinition","givenName","familyName","description","image","contentUrl","website","account","proofMessage","proofSignature","worksFor","knows","streetAddress","addressLocality","postalCode","addressCountry","birthDate","taxID","Person","fromLegacyFormat","legacyProfile","profileData","formatted","bio","location","images","avatar","cover","accounts","bitcoin","role","twitter","facebook","github","auth","publicKeychain","pgp","fingerprint","getPersonFromLegacyFormat","avatarUrl","verifiedAccounts","connections","organizations","getName","getGivenName","getFamilyName","getDescription","avatarContentUrl","getAvatarUrl","verifications","filteredAccounts","accountIsValid","verification","proof_url","getVerifiedAccounts","addressString","addressParts","getAddress","monthNames","birthDateString","getMonth","getDate","getBirthDate","getConnections","tokenFileUrl","urlScheme","urlParts","zoneFile","getTokenFileUrl","zoneFileJson","validRecords","record","firstValidRecord","startsWith","resolveZoneFileToProfile","clientFromNetwork","text","responseText","responseJson","catch","resolveZoneFileToPerson","fetchFn"],"sourceRoot":""}
1	+ {"version":3,"file":"index.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAuB,cAAID,IAE3BD,EAAoB,cAAIC,GACzB,CATD,CASGK,MAAM,cCRLC,EADAC,8BCGJ,SAASC,EAAOC,GACZ,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAM,IAAIG,MAAM,2BAA2BH,IACnD,CAEA,SAASI,EAAKC,GACV,GAAiB,kBAANA,EACP,MAAM,IAAIF,MAAM,yBAAyBE,IACjD,CAEA,SAASC,EAAMD,KAAME,GACjB,KAAMF,aAAaG,YACf,MAAM,IAAIC,UAAU,uBACxB,GAAIF,EAAQG,OAAS,IAAMH,EAAQI,SAASN,EAAEK,QAC1C,MAAM,IAAID,UAAU,iCAAiCF,oBAA0BF,EAAEK,SACzF,CAEA,SAASE,EAAKA,GACV,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAM,IAAIV,MAAM,mDACpBJ,EAAOa,EAAKE,WACZf,EAAOa,EAAKG,SAChB,CAEA,SAASC,EAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIhB,MAAM,oCACpB,GAAIe,GAAiBD,EAASG,SAC1B,MAAM,IAAIjB,MAAM,wCACxB,CAEA,SAASkB,EAAOC,EAAKL,GACjBX,EAAMgB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAM,IAAIpB,MAAM,yDAAyDoB,IAEjF,CAvCAC,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ6B,OAAS7B,EAAQwB,OAASxB,EAAQoB,KAAOpB,EAAQc,MAAQd,EAAQY,KAAOZ,EAAQO,YAAS,EAKjGP,EAAQO,OAASA,EAKjBP,EAAQY,KAAOA,EAOfZ,EAAQc,MAAQA,EAOhBd,EAAQoB,KAAOA,EAOfpB,EAAQwB,OAASA,EAQjBxB,EAAQ6B,OAASA,EACjB,MAAMM,EAAS,CACX5B,SACAK,OACAE,QACAM,OACAI,SACAK,UAEJ7B,EAAA,QAAkBmC,8BCjDlBH,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQoC,UAAO,EACf,MAAMC,EAAe,EAAQ,KACvBC,EAAa,EAAQ,IAe3B,MAAMF,UAAaE,EAAWC,KAC1B,WAAAC,CAAYjB,EAAUD,EAAWmB,EAAWC,GACxCC,QACAvC,KAAKmB,SAAWA,EAChBnB,KAAKkB,UAAYA,EACjBlB,KAAKqC,UAAYA,EACjBrC,KAAKsC,KAAOA,EACZtC,KAAKwB,UAAW,EAChBxB,KAAKc,OAAS,EACdd,KAAKwC,IAAM,EACXxC,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAS,IAAI7B,WAAWO,GAC7BnB,KAAK0C,MAAO,EAAIR,EAAWS,YAAY3C,KAAKyC,OAChD,CACA,MAAAG,CAAOC,GACHZ,EAAaa,QAAQ1B,OAAOpB,MAC5B,MAAM,KAAE0C,EAAI,OAAED,EAAM,SAAEtB,GAAanB,KAE7B+C,GADNF,GAAO,EAAIX,EAAWc,SAASH,IACd/B,OACjB,IAAK,IAAI0B,EAAM,EAAGA,EAAMO,GAAM,CAC1B,MAAME,EAAOC,KAAKvB,IAAIR,EAAWnB,KAAKwC,IAAKO,EAAMP,GAEjD,GAAIS,IAAS9B,EAMbsB,EAAOU,IAAIN,EAAKO,SAASZ,EAAKA,EAAMS,GAAOjD,KAAKwC,KAChDxC,KAAKwC,KAAOS,EACZT,GAAOS,EACHjD,KAAKwC,MAAQrB,IACbnB,KAAKqD,QAAQX,EAAM,GACnB1C,KAAKwC,IAAM,OAXf,CACI,MAAMc,GAAW,EAAIpB,EAAWS,YAAYE,GAC5C,KAAO1B,GAAY4B,EAAMP,EAAKA,GAAOrB,EACjCnB,KAAKqD,QAAQC,EAAUd,EAE/B,CAQJ,CAGA,OAFAxC,KAAKc,QAAU+B,EAAK/B,OACpBd,KAAKuD,aACEvD,IACX,CACA,UAAAwD,CAAW9B,GACPO,EAAaa,QAAQ1B,OAAOpB,MAC5BiC,EAAaa,QAAQrB,OAAOC,EAAK1B,MACjCA,KAAKwB,UAAW,EAIhB,MAAM,OAAEiB,EAAM,KAAEC,EAAI,SAAEvB,EAAQ,KAAEmB,GAAStC,KACzC,IAAI,IAAEwC,GAAQxC,KAEdyC,EAAOD,KAAS,IAChBxC,KAAKyC,OAAOW,SAASZ,GAAKiB,KAAK,GAE3BzD,KAAKqC,UAAYlB,EAAWqB,IAC5BxC,KAAKqD,QAAQX,EAAM,GACnBF,EAAM,GAGV,IAAK,IAAIkB,EAAIlB,EAAKkB,EAAIvC,EAAUuC,IAC5BjB,EAAOiB,GAAK,GAxExB,SAAsBhB,EAAMiB,EAAY7B,EAAOQ,GAC3C,GAAiC,mBAAtBI,EAAKkB,aACZ,OAAOlB,EAAKkB,aAAaD,EAAY7B,EAAOQ,GAChD,MAAMuB,EAAOC,OAAO,IACdC,EAAWD,OAAO,YAClBE,EAAK3D,OAAQyB,GAAS+B,EAAQE,GAC9BE,EAAK5D,OAAOyB,EAAQiC,GACpBG,EAAI5B,EAAO,EAAI,EACf6B,EAAI7B,EAAO,EAAI,EACrBI,EAAK0B,UAAUT,EAAaO,EAAGF,EAAI1B,GACnCI,EAAK0B,UAAUT,EAAaQ,EAAGF,EAAI3B,EACvC,CAiEQsB,CAAalB,EAAMvB,EAAW,EAAG2C,OAAqB,EAAd9D,KAAKc,QAAawB,GAC1DtC,KAAKqD,QAAQX,EAAM,GACnB,MAAM2B,GAAQ,EAAInC,EAAWS,YAAYjB,GACnCqB,EAAM/C,KAAKkB,UAEjB,GAAI6B,EAAM,EACN,MAAM,IAAIxC,MAAM,+CACpB,MAAM+D,EAASvB,EAAM,EACfwB,EAAQvE,KAAKwE,MACnB,GAAIF,EAASC,EAAMzD,OACf,MAAM,IAAIP,MAAM,sCACpB,IAAK,IAAImD,EAAI,EAAGA,EAAIY,EAAQZ,IACxBW,EAAMD,UAAU,EAAIV,EAAGa,EAAMb,GAAIpB,EACzC,CACA,MAAAmC,GACI,MAAM,OAAEhC,EAAM,UAAEvB,GAAclB,KAC9BA,KAAKwD,WAAWf,GAChB,MAAMiC,EAAMjC,EAAOkC,MAAM,EAAGzD,GAE5B,OADAlB,KAAK4E,UACEF,CACX,CACA,UAAAG,CAAWC,GACPA,IAAOA,EAAK,IAAI9E,KAAKoC,aACrB0C,EAAG3B,OAAOnD,KAAKwE,OACf,MAAM,SAAErD,EAAQ,OAAEsB,EAAM,OAAE3B,EAAM,SAAEU,EAAQ,UAAED,EAAS,IAAEiB,GAAQxC,KAO/D,OANA8E,EAAGhE,OAASA,EACZgE,EAAGtC,IAAMA,EACTsC,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACXT,EAASK,GACT2D,EAAGrC,OAAOU,IAAIV,GACXqC,CACX,EAEJlF,EAAQoC,KAAOA,4BCnHfJ,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQmF,YAAS,EACjBnF,EAAQmF,OAAS,CACbC,UAAMC,EACNC,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,+BCJtErD,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQwF,UAAO,EACf,MAAMnD,EAAe,EAAQ,KACvBC,EAAa,EAAQ,IAE3B,MAAMmD,UAAanD,EAAWC,KAC1B,WAAAC,CAAYpB,EAAMsE,GACd/C,QACAvC,KAAKwB,UAAW,EAChBxB,KAAKuB,WAAY,EACjBU,EAAaa,QAAQ9B,KAAKA,GAC1B,MAAMuE,GAAM,EAAIrD,EAAWc,SAASsC,GAEpC,GADAtF,KAAKwF,MAAQxE,EAAKC,SACe,mBAAtBjB,KAAKwF,MAAM5C,OAClB,MAAM,IAAI/B,UAAU,uDACxBb,KAAKmB,SAAWnB,KAAKwF,MAAMrE,SAC3BnB,KAAKkB,UAAYlB,KAAKwF,MAAMtE,UAC5B,MAAMC,EAAWnB,KAAKmB,SAChBsE,EAAM,IAAI7E,WAAWO,GAE3BsE,EAAItC,IAAIoC,EAAIzE,OAASK,EAAWH,EAAKC,SAAS2B,OAAO2C,GAAKd,SAAWc,GACrE,IAAK,IAAI7B,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,GACd1D,KAAKwF,MAAM5C,OAAO6C,GAElBzF,KAAK0F,MAAQ1E,EAAKC,SAElB,IAAK,IAAIyC,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,IACd1D,KAAK0F,MAAM9C,OAAO6C,GAClBA,EAAIhC,KAAK,EACb,CACA,MAAAb,CAAO+C,GAGH,OAFA1D,EAAaa,QAAQ1B,OAAOpB,MAC5BA,KAAKwF,MAAM5C,OAAO+C,GACX3F,IACX,CACA,UAAAwD,CAAW9B,GACPO,EAAaa,QAAQ1B,OAAOpB,MAC5BiC,EAAaa,QAAQpC,MAAMgB,EAAK1B,KAAKkB,WACrClB,KAAKwB,UAAW,EAChBxB,KAAKwF,MAAMhC,WAAW9B,GACtB1B,KAAK0F,MAAM9C,OAAOlB,GAClB1B,KAAK0F,MAAMlC,WAAW9B,GACtB1B,KAAK4E,SACT,CACA,MAAAH,GACI,MAAM/C,EAAM,IAAId,WAAWZ,KAAK0F,MAAMxE,WAEtC,OADAlB,KAAKwD,WAAW9B,GACTA,CACX,CACA,UAAAmD,CAAWC,GAEPA,IAAOA,EAAKlD,OAAOX,OAAOW,OAAOgE,eAAe5F,MAAO,CAAC,IACxD,MAAM,MAAE0F,EAAK,MAAEF,EAAK,SAAEhE,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAclB,KAQnE,OANA8E,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACfuD,EAAG3D,SAAWA,EACd2D,EAAG5D,UAAYA,EACf4D,EAAGY,MAAQA,EAAMb,WAAWC,EAAGY,OAC/BZ,EAAGU,MAAQA,EAAMX,WAAWC,EAAGU,OACxBV,CACX,CACA,OAAAF,GACI5E,KAAKuB,WAAY,EACjBvB,KAAK0F,MAAMd,UACX5E,KAAKwF,MAAMZ,SACf,EASJhF,EAAQwF,KADK,CAACpE,EAAMuE,EAAKM,IAAY,IAAIR,EAAKrE,EAAMuE,GAAK3C,OAAOiD,GAASpB,SAEzE7E,EAAQwF,KAAKnE,OAAS,CAACD,EAAMuE,IAAQ,IAAIF,EAAKrE,EAAMuE,8BC9EpD3D,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQkG,OAASlG,EAAQmG,YAAS,EAClC,MAAMC,EAAa,EAAQ,KACrB9D,EAAa,EAAQ,IAIrB+D,EAAM,CAACC,EAAGzF,EAAG0F,IAAOD,EAAIzF,EAAMyF,EAAIC,EAAM1F,EAAI0F,EAI5CC,EAAW,IAAIC,YAAY,CAC7B,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlFC,EAAK,IAAID,YAAY,CACvB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlFE,EAAW,IAAIF,YAAY,IACjC,MAAMG,UAAeR,EAAWhE,KAC5B,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GAGjBvC,KAAKyG,EAAY,EAARH,EAAG,GACZtG,KAAK0G,EAAY,EAARJ,EAAG,GACZtG,KAAK2G,EAAY,EAARL,EAAG,GACZtG,KAAK4G,EAAY,EAARN,EAAG,GACZtG,KAAK6G,EAAY,EAARP,EAAG,GACZtG,KAAK8G,EAAY,EAARR,EAAG,GACZtG,KAAK+G,EAAY,EAART,EAAG,GACZtG,KAAKgH,EAAY,EAARV,EAAG,EAChB,CACA,GAAA9B,GACI,MAAM,EAAEiC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACnC,MAAO,CAACyG,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAA7D,CAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBhH,KAAKyG,EAAQ,EAAJA,EACTzG,KAAK0G,EAAQ,EAAJA,EACT1G,KAAK2G,EAAQ,EAAJA,EACT3G,KAAK4G,EAAQ,EAAJA,EACT5G,KAAK6G,EAAQ,EAAJA,EACT7G,KAAK8G,EAAQ,EAAJA,EACT9G,KAAK+G,EAAQ,EAAJA,EACT/G,KAAKgH,EAAQ,EAAJA,CACb,CACA,OAAA3D,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCV,EAAS7C,GAAKhB,EAAKwE,UAAUD,GAAQ,GACzC,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyD,EAAMZ,EAAS7C,EAAI,IACnB0D,EAAKb,EAAS7C,EAAI,GAClB2D,GAAK,EAAInF,EAAWoF,MAAMH,EAAK,IAAK,EAAIjF,EAAWoF,MAAMH,EAAK,IAAOA,IAAQ,EAC7EI,GAAK,EAAIrF,EAAWoF,MAAMF,EAAI,KAAM,EAAIlF,EAAWoF,MAAMF,EAAI,IAAOA,IAAO,GACjFb,EAAS7C,GAAM6D,EAAKhB,EAAS7C,EAAI,GAAK2D,EAAKd,EAAS7C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE+C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACjC,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM8D,EAAMR,IADG,EAAI9E,EAAWoF,MAAMT,EAAG,IAAK,EAAI3E,EAAWoF,MAAMT,EAAG,KAAM,EAAI3E,EAAWoF,MAAMT,EAAG,OAnEjGX,EAoE4BW,GAAGC,GApEPZ,EAoEUa,GAAKX,EAAS1C,GAAK6C,EAAS7C,GAAM,EAE/D+D,IADS,EAAIvF,EAAWoF,MAAMb,EAAG,IAAK,EAAIvE,EAAWoF,MAAMb,EAAG,KAAM,EAAIvE,EAAWoF,MAAMb,EAAG,KAC7ER,EAAIQ,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIY,EAAM,EACfZ,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKe,EAAKC,EAAM,CACpB,CA/EI,IAACvB,EAiFLO,EAAKA,EAAIzG,KAAKyG,EAAK,EACnBC,EAAKA,EAAI1G,KAAK0G,EAAK,EACnBC,EAAKA,EAAI3G,KAAK2G,EAAK,EACnBC,EAAKA,EAAI5G,KAAK4G,EAAK,EACnBC,EAAKA,EAAI7G,KAAK6G,EAAK,EACnBC,EAAKA,EAAI9G,KAAK8G,EAAK,EACnBC,EAAKA,EAAI/G,KAAK+G,EAAK,EACnBC,EAAKA,EAAIhH,KAAKgH,EAAK,EACnBhH,KAAKmD,IAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzD,GACIgD,EAAS9C,KAAK,EAClB,CACA,OAAAmB,GACI5E,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BnD,KAAKyC,OAAOgB,KAAK,EACrB,EAGJ,MAAMiE,UAAelB,EACjB,WAAApE,GACIG,QACAvC,KAAKyG,GAAI,WACTzG,KAAK0G,EAAI,UACT1G,KAAK2G,EAAI,UACT3G,KAAK4G,GAAI,UACT5G,KAAK6G,GAAI,QACT7G,KAAK8G,EAAI,WACT9G,KAAK+G,EAAI,WACT/G,KAAKgH,GAAI,WACThH,KAAKkB,UAAY,EACrB,EAMJtB,EAAQmG,QAAS,EAAI7D,EAAWyF,kBAAiB,IAAM,IAAInB,IAC3D5G,EAAQkG,QAAS,EAAI5D,EAAWyF,kBAAiB,IAAM,IAAID,+BC3H3D9F,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgI,YAAchI,EAAQiI,wBAA0BjI,EAAQ+H,gBAAkB/H,EAAQkI,UAAYlI,EAAQuC,KAAOvC,EAAQmI,YAAcnI,EAAQoD,QAAUpD,EAAQoI,YAAcpI,EAAQqI,UAAYrI,EAAQsI,SAAWtI,EAAQuI,WAAavI,EAAQwI,WAAaxI,EAAQ0C,KAAO1C,EAAQ0H,KAAO1H,EAAQ+C,WAAa/C,EAAQyI,IAAMzI,EAAQ0I,QAAK,EAGlV,MAAMC,EAAW,EAAQ,KAezB,GAZA3I,EAAQ0I,GADIE,GAAQ,IAAI5H,WAAW4H,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,YAGnE7I,EAAQyI,IADKG,GAAQ,IAAInC,YAAYmC,EAAI/F,OAAQ+F,EAAI7E,WAAYT,KAAKwF,MAAMF,EAAIC,WAAa,IAI7F7I,EAAQ+C,WADY6F,GAAQ,IAAIG,SAASH,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,YAIzE7I,EAAQ0H,KADK,CAACsB,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAEjEjJ,EAAQ0C,KAAmE,KAA5D,IAAI1B,WAAW,IAAIyF,YAAY,CAAC,YAAa5D,QAAQ,IAG/D7C,EAAQ0C,KACT,MAAM,IAAI/B,MAAM,+CACpB,MAAMuI,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAsD/E,SAASnB,EAAYoB,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIvI,UAAU,2CAA2CuI,GAEnE,OAAO,IAAIC,aAAcC,OAAOF,EACpC,CAEA,SAASpG,EAAQH,GAGb,GAFoB,iBAATA,IACPA,EAAOmF,EAAYnF,MACjBA,aAAgBjC,YAClB,MAAM,IAAIC,UAAU,iDAAiDgC,MACzE,OAAOA,CACX,CArDAjD,EAAQwI,WAVR,SAAoBmB,GAEhB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAOV,EAAMS,EAAO7F,IAExB,OAAO8F,CACX,EAsBA5J,EAAQuI,WAjBR,SAAoBqB,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,6CACpB,MAAMkJ,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,EAKA7J,EAAQsI,SADS6B,YAejBnK,EAAQqI,UAZR8B,eAAyBC,EAAOC,EAAMC,GAClC,IAAIC,EAAKC,KAAKC,MACd,IAAK,IAAI3G,EAAI,EAAGA,EAAIsG,EAAOtG,IAAK,CAC5BwG,EAAGxG,GAEH,MAAM4G,EAAOF,KAAKC,MAAQF,EACtBG,GAAQ,GAAKA,EAAOL,UAElB,EAAIrK,EAAQsI,YAClBiC,GAAMG,EACV,CACJ,EAQA1K,EAAQoI,YAAcA,EAQtBpI,EAAQoD,QAAUA,EAmBlBpD,EAAQmI,YAdR,YAAwBwC,GACpB,IAAKA,EAAOC,OAAOtE,GAAMA,aAAatF,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,EASA9K,EAAQuC,KANR,MAEI,KAAAwI,GACI,OAAO3K,KAAK6E,YAChB,GAWJjF,EAAQkI,UANR,SAAmB8C,EAAUC,GACzB,QAAa5F,IAAT4F,IAAuC,iBAATA,IAFfC,EAEmDD,EAFH,oBAAxCjJ,OAAOmJ,UAAU7B,SAAS8B,KAAKF,IAA8BA,EAAI1I,cAAgBR,SAGxG,MAAM,IAAIf,UAAU,yCAHN,IAACiK,EAKnB,OADelJ,OAAOqJ,OAAOL,EAAUC,EAE3C,EAUAjL,EAAQ+H,gBARR,SAAyBuD,GACrB,MAAMC,EAAStF,GAAYqF,IAAkBtI,OAAOI,EAAQ6C,IAAUpB,SAChE2G,EAAMF,IAIZ,OAHAC,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAS,IAAMiK,IACdC,CACX,EAUAvL,EAAQiI,wBARR,SAAiCwD,GAC7B,MAAMF,EAAQ,CAACG,EAAKT,IAASQ,EAASR,GAAMjI,OAAOI,EAAQsI,IAAM7G,SAC3D2G,EAAMC,EAAS,CAAC,GAItB,OAHAF,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAU4J,GAASQ,EAASR,GAC3BM,CACX,EAgBAvL,EAAQgI,YAXR,SAAqB2D,EAAc,IAC/B,GAAIhD,EAASxD,OAAOG,IAChB,OAAOqD,EAASxD,OAAOG,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEzD,GAAIhD,EAASxD,OAAOC,KACrB,OAAO,IAAIpE,WAAW2H,EAASxD,OAAOC,KAAK4C,YAAY2D,GAAa9I,QAGpE,MAAM,IAAIlC,MAAM,oDAExB,8BC7JAqB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ6L,MAAQ7L,EAAQ8L,QAAU9L,EAAQ+L,OAAS/L,EAAQgM,SAAWhM,EAAQiM,KAAOjM,EAAQkM,gBAAkBlM,EAAQmM,iBAAmBnM,EAAQoM,aAAepM,EAAQqM,UAAYrM,EAAQsM,MAAQtM,EAAQuM,WAAQ,EACrN,MAAMC,EAAa,EAAQ,KACrBC,EAAMvI,OAAO,GACbwI,EAAMxI,OAAO,GACbyI,EAAMzI,OAAO,GACb0I,EAAM1I,OAAO,GACb2I,EAAM3I,OAAO,GACbqI,EAAQvK,OAAO8K,OAAO,CACxBxG,EAAGmG,EACH5L,EAAGqD,OAAO,GACV6I,EAAG7I,OAAO,sEACV1D,EAAG0D,OAAO,sEACVI,EAAGoI,EACHM,GAAI9I,OAAO,iFACX+I,GAAI/I,OAAO,iFACXgJ,KAAMhJ,OAAO,wEAEjBlE,EAAQuM,MAAQA,EAChB,MAAMY,EAAa,CAAC7G,EAAGzF,KAAOyF,EAAIzF,EAAI8L,GAAO9L,EACvCuM,EAAO,CACTF,KAAMhJ,OAAO,sEACb,WAAAmJ,CAAYC,GACR,MAAM,EAAE9M,GAAM+L,EACRgB,EAAKrJ,OAAO,sCACZsJ,GAAMd,EAAMxI,OAAO,sCACnBuJ,EAAKvJ,OAAO,uCACZwJ,EAAKH,EACLI,EAAYzJ,OAAO,uCACnB0J,EAAKT,EAAWO,EAAKJ,EAAG9M,GACxBqN,EAAKV,GAAYK,EAAKF,EAAG9M,GAC/B,IAAIsN,EAAKC,EAAIT,EAAIM,EAAKL,EAAKM,EAAKJ,EAAIjN,GAChCwN,EAAKD,GAAKH,EAAKJ,EAAKK,EAAKH,EAAIlN,GACjC,MAAMyN,EAAQH,EAAKH,EACbO,EAAQF,EAAKL,EAKnB,GAJIM,IACAH,EAAKtN,EAAIsN,GACTI,IACAF,EAAKxN,EAAIwN,GACTF,EAAKH,GAAaK,EAAKL,EACvB,MAAM,IAAIhN,MAAM,2CAA6C2M,GAEjE,MAAO,CAAEW,QAAOH,KAAII,QAAOF,KAC/B,GAEEG,EAAW,GACXC,EAAW,GAEXC,EAAgBF,EAAW,EAC3BG,EAAkB,EAAIH,EAAW,EACvC,SAASI,EAAYC,GACjB,MAAM,EAAElI,EAAC,EAAEzF,GAAM0L,EACXkC,EAAKV,EAAIS,EAAIA,GACbE,EAAKX,EAAIU,EAAKD,GACpB,OAAOT,EAAIW,EAAKpI,EAAIkI,EAAI3N,EAC5B,CACA,MAAM8N,EAAmBpC,EAAMjG,IAAMmG,EACrC,MAAMmC,UAAiBjO,MACnB,WAAA6B,CAAYyD,GACRtD,MAAMsD,EACV,EAEJ,SAAS4I,EAAeC,GACpB,KAAMA,aAAiBC,GACnB,MAAM,IAAI9N,UAAU,yBAC5B,CACA,MAAM8N,EACF,WAAAvM,CAAYgM,EAAGQ,EAAGC,GACd7O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,EACT5O,KAAK6O,EAAIA,CACb,CACA,iBAAOC,CAAWC,GACd,KAAMA,aAAa7C,GACf,MAAM,IAAIrL,UAAU,4CAExB,OAAIkO,EAAEC,OAAO9C,EAAM+C,MACRN,EAAcM,KAClB,IAAIN,EAAcI,EAAEX,EAAGW,EAAEH,EAAGtC,EACvC,CACA,oBAAO4C,CAAcC,GACjB,MAAMC,EAokBd,SAAqBC,EAAMN,EAAI5C,EAAMQ,GACjC,MAAM2C,EAAU,IAAIvG,MAAMsG,EAAKvO,QAOzByO,EAAWC,EANMH,EAAK5E,QAAO,CAACgF,EAAKC,EAAKhM,IACtCgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAK+L,EACN9B,EAAI8B,EAAMC,EAAKX,KACvBzC,GACqCyC,GAOxC,OANAM,EAAKM,aAAY,CAACF,EAAKC,EAAKhM,IACpBgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAKiK,EAAI8B,EAAMH,EAAQ5L,GAAIqL,GAC5BpB,EAAI8B,EAAMC,EAAKX,KACvBQ,GACID,CACX,CAplBsBM,CAAYT,EAAOU,KAAKd,GAAMA,EAAEF,KAC9C,OAAOM,EAAOU,KAAI,CAACd,EAAGrL,IAAMqL,EAAEe,SAASV,EAAM1L,KACjD,CACA,iBAAOqM,CAAWZ,GACd,OAAOR,EAAcO,cAAcC,GAAQU,IAAIlB,EAAcG,WACjE,CACA,MAAAE,CAAON,GACHD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAC1B4B,EAAO3C,EAAIuC,EAAKA,GAChBK,EAAO5C,EAAI0C,EAAKA,GAChBG,EAAK7C,EAAIqC,EAAKO,GACdE,EAAK9C,EAAIwC,EAAKG,GACdI,EAAK/C,EAAIA,EAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,EAAIA,EAAIyC,EAAKF,GAAMI,GAC9B,OAAOE,IAAOC,GAAMC,IAAOC,CAC/B,CACA,MAAAC,GACI,OAAO,IAAIjC,EAAc3O,KAAKoO,EAAGT,GAAK3N,KAAK4O,GAAI5O,KAAK6O,EACxD,CACA,MAAAgC,GACI,MAAQzC,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,KAC1ByG,EAAIkH,EAAIqC,EAAKA,GACbtJ,EAAIiH,EAAIsC,EAAKA,GACbtJ,EAAIgH,EAAIjH,EAAIA,GACZoK,EAAMd,EAAKtJ,EACXE,EAAI+G,EAAIpB,GAAOoB,EAAImD,EAAMA,GAAOrK,EAAIE,IACpCE,EAAI8G,EAAInB,EAAM/F,GACdK,EAAI6G,EAAI9G,EAAIA,GACZkK,EAAKpD,EAAI7G,EAAIyF,EAAM3F,GACnBoK,EAAKrD,EAAI9G,GAAKD,EAAImK,GAAMtE,EAAM9F,GAC9BsK,EAAKtD,EAAIpB,EAAM0D,EAAKC,GAC1B,OAAO,IAAIvB,EAAcoC,EAAIC,EAAIC,EACrC,CACA,GAAAC,CAAIxC,GACAD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAChC,GAAIyB,IAAO9D,GAAO+D,IAAO/D,EACrB,OAAOrM,KACX,GAAIgQ,IAAO3D,GAAO4D,IAAO5D,EACrB,OAAOqC,EACX,MAAM4B,EAAO3C,EAAIuC,EAAKA,GAChBK,EAAO5C,EAAI0C,EAAKA,GAChBG,EAAK7C,EAAIqC,EAAKO,GACdE,EAAK9C,EAAIwC,EAAKG,GACdI,EAAK/C,EAAIA,EAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,EAAIA,EAAIyC,EAAKF,GAAMI,GACxBtJ,EAAI2G,EAAI8C,EAAKD,GACbW,EAAIxD,EAAIgD,EAAKD,GACnB,GAAI1J,IAAMqF,EACN,OAAI8E,IAAM9E,EACCrM,KAAK6Q,SAGLlC,EAAcM,KAG7B,MAAMmC,EAAKzD,EAAI3G,EAAIA,GACbqK,EAAM1D,EAAI3G,EAAIoK,GACdE,EAAI3D,EAAI6C,EAAKY,GACbL,EAAKpD,EAAIwD,EAAIA,EAAIE,EAAM9E,EAAM+E,GAC7BN,EAAKrD,EAAIwD,GAAKG,EAAIP,GAAML,EAAKW,GAC7BJ,EAAKtD,EAAIuC,EAAKG,EAAKrJ,GACzB,OAAO,IAAI2H,EAAcoC,EAAIC,EAAIC,EACrC,CACA,QAAAM,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,cAAAY,CAAeC,GACX,MAAMC,EAAK/C,EAAcM,KACzB,GAAsB,iBAAXwC,GAAuBA,IAAWpF,EACzC,OAAOqF,EACX,IAAItR,EAAIuR,EAAgBF,GACxB,GAAIrR,IAAMkM,EACN,OAAOtM,KACX,IAAKuO,EAAkB,CACnB,IAAIQ,EAAI2C,EACJE,EAAI5R,KACR,KAAOI,EAAIiM,GACHjM,EAAIkM,IACJyC,EAAIA,EAAEmC,IAAIU,IACdA,EAAIA,EAAEf,SACNzQ,IAAMkM,EAEV,OAAOyC,CACX,CACA,IAAI,MAAElB,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAC5CyR,EAAMH,EACNI,EAAMJ,EACNE,EAAI5R,KACR,KAAO0N,EAAKrB,GAAOuB,EAAKvB,GAChBqB,EAAKpB,IACLuF,EAAMA,EAAIX,IAAIU,IACdhE,EAAKtB,IACLwF,EAAMA,EAAIZ,IAAIU,IAClBA,EAAIA,EAAEf,SACNnD,IAAOpB,EACPsB,IAAOtB,EAOX,OALIuB,IACAgE,EAAMA,EAAIjB,UACV9C,IACAgE,EAAMA,EAAIlB,UACdkB,EAAM,IAAInD,EAAchB,EAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GACpDgD,EAAIX,IAAIY,EACnB,CACA,gBAAAC,CAAiBC,GACb,MAAMC,EAAU1D,EAAmB,IAAMyD,EAAI,EAAI,IAAMA,EAAI,EACrD7C,EAAS,GACf,IAAIJ,EAAI/O,KACJkS,EAAOnD,EACX,IAAK,IAAIoD,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7CD,EAAOnD,EACPI,EAAOiD,KAAKF,GACZ,IAAK,IAAIxO,EAAI,EAAGA,EAAI,IAAMsO,EAAI,GAAItO,IAC9BwO,EAAOA,EAAKhB,IAAInC,GAChBI,EAAOiD,KAAKF,GAEhBnD,EAAImD,EAAKrB,QACb,CACA,OAAO1B,CACX,CACA,IAAAkD,CAAKjS,EAAGkS,IACCA,GAAetS,KAAKgP,OAAOL,EAAc4D,QAC1CD,EAAcpG,EAAMqG,MACxB,MAAMP,EAAKM,GAAeA,EAAYE,cAAiB,EACvD,GAAI,IAAMR,EACN,MAAM,IAAIzR,MAAM,iEAEpB,IAAIkS,EAAcH,GAAeI,EAAiBlO,IAAI8N,GACjDG,IACDA,EAAczS,KAAK+R,iBAAiBC,GAChCM,GAAqB,IAANN,IACfS,EAAc9D,EAAcoB,WAAW0C,GACvCC,EAAiBvP,IAAImP,EAAaG,KAG1C,IAAI1D,EAAIJ,EAAcM,KAClB0D,EAAIhE,EAAc4D,KACtB,MAAMN,EAAU,GAAK1D,EAAmB,IAAMyD,EAAI,IAAMA,GAClDY,EAAa,IAAMZ,EAAI,GACvBa,EAAO/O,OAAO,GAAKkO,EAAI,GACvBc,EAAY,GAAKd,EACjBe,EAAUjP,OAAOkO,GACvB,IAAK,IAAIG,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7C,MAAMlL,EAASkL,EAASS,EACxB,IAAII,EAAQ3S,OAAOD,EAAIyS,GACvBzS,IAAM2S,EACFC,EAAQJ,IACRI,GAASF,EACT1S,GAAKkM,GAET,MAAM2G,EAAUhM,EACViM,EAAUjM,EAAS/D,KAAKiQ,IAAIH,GAAS,EACrCI,EAAQjB,EAAS,GAAM,EACvBkB,EAAQL,EAAQ,EACR,IAAVA,EACAL,EAAIA,EAAEzB,IAAIoC,EAAgBF,EAAOX,EAAYQ,KAG7ClE,EAAIA,EAAEmC,IAAIoC,EAAgBD,EAAOZ,EAAYS,IAErD,CACA,MAAO,CAAEnE,IAAG4D,IAChB,CACA,QAAAY,CAAS9B,EAAQa,GACb,IACIkB,EACAC,EAFArT,EAAIuR,EAAgBF,GAGxB,GAAIlD,EAAkB,CAClB,MAAM,MAAEV,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAClD,IAAM2O,EAAG8C,EAAKc,EAAGe,GAAQ1T,KAAKqS,KAAK3E,EAAI4E,IACjCvD,EAAG+C,EAAKa,EAAGgB,GAAQ3T,KAAKqS,KAAKzE,EAAI0E,GACvCT,EAAMyB,EAAgBzF,EAAOgE,GAC7BC,EAAMwB,EAAgBxF,EAAOgE,GAC7BA,EAAM,IAAInD,EAAchB,EAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GAC3D2E,EAAQ3B,EAAIX,IAAIY,GAChB2B,EAAOC,EAAIxC,IAAIyC,EACnB,KACK,CACD,MAAM,EAAE5E,EAAC,EAAE4D,GAAM3S,KAAKqS,KAAKjS,EAAGkS,GAC9BkB,EAAQzE,EACR0E,EAAOd,CACX,CACA,OAAOhE,EAAcoB,WAAW,CAACyD,EAAOC,IAAO,EACnD,CACA,QAAA3D,CAAS8D,GACL,MAAM,EAAExF,EAAC,EAAEQ,EAAC,EAAEC,GAAM7O,KACd6T,EAAM7T,KAAKgP,OAAOL,EAAcM,MAC1B,MAAR2E,IACAA,EAAOC,EAAMpH,EAAM+C,EAAOX,IAC9B,MAAMiF,EAAMF,EACNG,EAAMpG,EAAImG,EAAMA,GAChBE,EAAMrG,EAAIoG,EAAMD,GAChBG,EAAKtG,EAAIS,EAAI2F,GACbG,EAAKvG,EAAIiB,EAAIoF,GACbG,EAAKxG,EAAIkB,EAAIiF,GACnB,GAAID,EACA,OAAO3H,EAAM+C,KACjB,GAAIkF,IAAO7H,EACP,MAAM,IAAI/L,MAAM,oBACpB,OAAO,IAAI2L,EAAM+H,EAAIC,EACzB,EAIJ,SAASZ,EAAgBc,EAAWC,GAChC,MAAMC,EAAMD,EAAKzD,SACjB,OAAOwD,EAAYE,EAAMD,CAC7B,CALA1F,EAAc4D,KAAO,IAAI5D,EAAcxC,EAAMS,GAAIT,EAAMU,GAAIP,GAC3DqC,EAAcM,KAAO,IAAIN,EAActC,EAAKC,EAAKD,GAKjD,MAAMqG,EAAmB,IAAI6B,QAC7B,MAAMrI,EACF,WAAA9J,CAAYgM,EAAGQ,GACX5O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,CACb,CACA,cAAA4F,CAAe5B,GACX5S,KAAKwS,aAAeI,EACpBF,EAAiB+B,OAAOzU,KAC5B,CACA,QAAA0U,GACI,OAAO1U,KAAK4O,EAAIrC,IAAQF,CAC5B,CACA,wBAAOsI,CAAkBjU,GACrB,MAAMkU,EAA2B,KAAjBlU,EAAMI,OAChBsN,EAAIyG,EAAcD,EAAUlU,EAAQA,EAAM0C,SAAS,IACzD,IAAK0R,EAAoB1G,GACrB,MAAM,IAAI7N,MAAM,yBAEpB,IAAIqO,EA+SZ,SAAiBR,GACb,MAAM,EAAEzB,GAAMR,EACR4I,EAAMjR,OAAO,GACbkR,EAAOlR,OAAO,IACdmR,EAAOnR,OAAO,IACdoR,EAAOpR,OAAO,IACdqR,EAAOrR,OAAO,IACdsR,EAAOtR,OAAO,IACdwJ,EAAMc,EAAIA,EAAIA,EAAKzB,EACnB0I,EAAM/H,EAAKA,EAAKc,EAAKzB,EACrB2I,EAAMC,EAAKF,EAAI7I,GAAO6I,EAAM1I,EAC5B6I,EAAMD,EAAKD,EAAI9I,GAAO6I,EAAM1I,EAC5B8I,EAAOF,EAAKC,EAAIjJ,GAAOe,EAAMX,EAC7B+I,EAAOH,EAAKE,EAAKT,GAAQS,EAAO9I,EAChCgJ,EAAOJ,EAAKG,EAAKT,GAAQS,EAAO/I,EAChCiJ,EAAOL,EAAKI,EAAKR,GAAQQ,EAAOhJ,EAChCkJ,EAAQN,EAAKK,EAAKR,GAAQQ,EAAOjJ,EACjCmJ,EAAQP,EAAKM,EAAMV,GAAQQ,EAAOhJ,EAClCoJ,EAAQR,EAAKO,EAAMtJ,GAAO6I,EAAM1I,EAChCqJ,EAAMT,EAAKQ,EAAMb,GAAQQ,EAAO/I,EAChCsJ,EAAMV,EAAKS,EAAIjB,GAAOzH,EAAMX,EAC5BuJ,EAAKX,EAAKU,EAAI1J,GAEpB,GADY2J,EAAKA,EAAMvJ,IACZyB,EACP,MAAM,IAAI7N,MAAM,2BACpB,OAAO2V,CACX,CAzUgBC,CADGhI,EAAYC,IAEvB,MAAMgI,GAAUxH,EAAItC,KAASA,EACzBsI,EACIwB,IACAxH,EAAIjB,GAAKiB,IAG6B,IAAP,EAAXlO,EAAM,MACP0V,IACnBxH,EAAIjB,GAAKiB,IAEjB,MAAM4E,EAAQ,IAAItH,EAAMkC,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,0BAAO8C,CAAoB5V,GACvB,MAAM0N,EAAIyG,EAAcnU,EAAM0C,SAAS,EAAG2K,EAAW,IAC/Ca,EAAIiG,EAAcnU,EAAM0C,SAAS2K,EAAW,EAAc,EAAXA,EAAe,IAC9DyF,EAAQ,IAAItH,EAAMkC,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,cAAO+C,CAAQ/M,GACX,MAAM9I,EAAQ8V,EAAYhN,GACpBzG,EAAMrC,EAAMI,OACZ2V,EAAS/V,EAAM,GACrB,GAAIqC,IAAQgL,EACR,OAAO/N,KAAK2U,kBAAkBjU,GAClC,GAAIqC,IAAQkL,IAA6B,IAAXwI,GAA8B,IAAXA,GAC7C,OAAOzW,KAAK2U,kBAAkBjU,GAElC,GAAIqC,IAAQmL,GAA8B,IAAXuI,EAC3B,OAAOzW,KAAKsW,oBAAoB5V,GACpC,MAAM,IAAIH,MAAM,sDAAsD0N,yBAAqCC,6BAA2CnL,IAC1J,CACA,qBAAO2T,CAAeC,GAClB,OAAOzK,EAAMqG,KAAKgB,SAASqD,EAAoBD,GACnD,CACA,oBAAOE,CAAcC,EAASC,EAAWC,GACrC,MAAM,EAAG,EAAEC,GAAMC,EAAmBH,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGhW,SAASiW,GACvB,MAAM,IAAIzW,MAAM,wCACpB,MAAM2D,EAAIiT,EAAaX,EAAYM,KAC7B,EAAE1W,GAAM+L,EACRiL,EAAoB,IAAbJ,GAA+B,IAAbA,EAAiB7F,EAAI/Q,EAAI+Q,EAClDkG,EAAO7H,EAAO4H,EAAMhX,GACpBkX,EAAK3J,GAAKzJ,EAAImT,EAAMjX,GACpBmX,EAAK5J,EAAIsJ,EAAII,EAAMjX,GACnBoX,EAAoB,EAAXR,EAAe,KAAO,KAC/BS,EAAIvL,EAAMqK,QAAQiB,EAASE,EAAYN,IACvCO,EAAIzL,EAAMqG,KAAKqF,qBAAqBH,EAAGH,EAAIC,GACjD,IAAKI,EACD,MAAM,IAAIpX,MAAM,+CAEpB,OADAoX,EAAEtB,iBACKsB,CACX,CACA,UAAAE,CAAWC,GAAe,GACtB,OAAO3P,EAAWnI,KAAK+X,MAAMD,GACjC,CACA,KAAAC,CAAMD,GAAe,GACjB,MAAM1J,EAAIsJ,EAAY1X,KAAKoO,GAC3B,OAAI0J,EAEO,GADQ9X,KAAK0U,WAAa,KAAO,OACrBtG,IAGZ,KAAKA,IAAIsJ,EAAY1X,KAAK4O,IAEzC,CACA,MAAAoJ,GACI,OAAOhY,KAAK+X,OAAM,GAAMpT,MAAM,EAClC,CACA,MAAAsT,GACI,OAAOjY,KAAK6X,YAAW,GAAMlT,MAAM,EACvC,CACA,cAAA0R,GACI,MAAM/K,EAAM,kCACN,EAAE8C,EAAC,EAAEQ,GAAM5O,KACjB,IAAK8U,EAAoB1G,KAAO0G,EAAoBlG,GAChD,MAAM,IAAIrO,MAAM+K,GACpB,MAAM4M,EAAOvK,EAAIiB,EAAIA,GAErB,GAAIjB,EAAIuK,EADM/J,EAAYC,MACA/B,EACtB,MAAM,IAAI9L,MAAM+K,EACxB,CACA,MAAA0D,CAAON,GACH,OAAO1O,KAAKoO,IAAMM,EAAMN,GAAKpO,KAAK4O,IAAMF,EAAME,CAClD,CACA,MAAAgC,GACI,OAAO,IAAI1E,EAAMlM,KAAKoO,EAAGT,GAAK3N,KAAK4O,GACvC,CACA,MAAAiC,GACI,OAAOlC,EAAcG,WAAW9O,MAAM6Q,SAASf,UACnD,CACA,GAAAoB,CAAIxC,GACA,OAAOC,EAAcG,WAAW9O,MAAMkR,IAAIvC,EAAcG,WAAWJ,IAAQoB,UAC/E,CACA,QAAAyB,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,QAAA2C,CAAS9B,GACL,OAAO9C,EAAcG,WAAW9O,MAAMuT,SAAS9B,EAAQzR,MAAM8P,UACjE,CACA,oBAAA8H,CAAqBD,EAAGzR,EAAGzF,GACvB,MAAMkM,EAAIgC,EAAcG,WAAW9O,MAC7BmY,EAAKjS,IAAMmG,GAAOnG,IAAMoG,GAAOtM,OAASkM,EAAMqG,KAAO5F,EAAE6E,eAAetL,GAAKyG,EAAE4G,SAASrN,GACtFkS,EAAKzJ,EAAcG,WAAW6I,GAAGnG,eAAe/Q,GAChD4X,EAAMF,EAAGjH,IAAIkH,GACnB,OAAOC,EAAIrJ,OAAOL,EAAcM,WAAQhK,EAAYoT,EAAIvI,UAC5D,EAKJ,SAASwI,EAASrB,GACd,OAAO5W,OAAOwJ,SAASoN,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASsB,EAAY1V,GACjB,GAAIA,EAAK/B,OAAS,GAAiB,IAAZ+B,EAAK,GACxB,MAAM,IAAItC,MAAM,kCAAkC6H,EAAWvF,MAEjE,MAAME,EAAMF,EAAK,GACX6B,EAAM7B,EAAKO,SAAS,EAAGL,EAAM,GACnC,IAAKA,GAAO2B,EAAI5D,SAAWiC,EACvB,MAAM,IAAIxC,MAAM,2CAEpB,GAAe,IAAXmE,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAInE,MAAM,8CAEpB,MAAO,CAAEsC,KAAMgS,EAAcnQ,GAAMwT,KAAMrV,EAAKO,SAASL,EAAM,GACjE,CAnBAnD,EAAQsM,MAAQA,EAChBA,EAAMqG,KAAO,IAAIrG,EAAMC,EAAMS,GAAIT,EAAMU,IACvCX,EAAM+C,KAAO,IAAI/C,EAAMG,EAAKA,GAgC5B,MAAMJ,EACF,WAAA7J,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,kBAAOmC,CAAYhP,GACf,MAAMhB,EAAMgB,aAAe5I,WACrB6X,EAAO,wBACb,GAAmB,iBAARjP,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,GAAG4X,oCAC3B,MAAMrP,EAAMZ,EAAMJ,EAAWoB,GAAOA,EACpC,GAAmB,MAAfJ,EAAItI,OACJ,MAAM,IAAIP,MAAM,GAAGkY,2BACvB,OAAO,IAAIxM,EAAUyM,EAAYtP,EAAIzE,MAAM,EAAG,KAAM+T,EAAYtP,EAAIzE,MAAM,GAAI,MAClF,CACA,cAAOgU,CAAQnP,GACX,MAAMhB,EAAMgB,aAAe5I,WAC3B,GAAmB,iBAAR4I,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,oDACxB,MAAM,EAAEsQ,EAAC,EAAE8F,GAlCnB,SAA2BpU,GACvB,GAAIA,EAAK/B,OAAS,GAAgB,IAAX+B,EAAK,GACxB,MAAM,IAAItC,MAAM,0BAA0B6H,EAAWvF,MAEzD,GAAIA,EAAK,KAAOA,EAAK/B,OAAS,EAC1B,MAAM,IAAIP,MAAM,uCAEpB,MAAQsC,KAAMsO,EAAG+G,KAAMU,GAAWL,EAAY1V,EAAKO,SAAS,KACpDP,KAAMoU,EAAGiB,KAAMW,GAAeN,EAAYK,GAClD,GAAIC,EAAW/X,OACX,MAAM,IAAIP,MAAM,gDAAgD6H,EAAWyQ,MAE/E,MAAO,CAAE1H,IAAG8F,IAChB,CAqByB6B,CAAkBtQ,EAAMgB,EAAMrB,EAAWqB,IAC1D,OAAO,IAAIyC,EAAUkF,EAAG8F,EAC5B,CACA,cAAOV,CAAQ/M,GACX,OAAOxJ,KAAK2Y,QAAQnP,EACxB,CACA,cAAA6M,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK+Y,EAAmB5H,GACpB,MAAM,IAAI5Q,MAAM,0CACpB,IAAKwY,EAAmB9B,GACpB,MAAM,IAAI1W,MAAM,yCACxB,CACA,QAAAyY,GACI,MAAMC,EAAO9M,EAAM/L,GAAKkM,EACxB,OAAOtM,KAAKiX,EAAIgC,CACpB,CACA,UAAAC,GACI,OAAOlZ,KAAKgZ,WAAa,IAAI/M,EAAUjM,KAAKmR,EAAGxD,GAAK3N,KAAKiX,EAAG9K,EAAM/L,IAAMJ,IAC5E,CACA,aAAAmZ,GACI,OAAOhR,EAAWnI,KAAKoZ,WAC3B,CACA,QAAAA,GACI,MAAMC,EAAOf,EAASgB,EAAoBtZ,KAAKiX,IACzCsC,EAAOjB,EAASgB,EAAoBtZ,KAAKmR,IACzCqI,EAAQH,EAAKvY,OAAS,EACtB2Y,EAAQF,EAAKzY,OAAS,EACtB4Y,EAAOJ,EAAoBE,GAC3BG,EAAOL,EAAoBG,GAEjC,MAAO,KADQH,EAAoBG,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOL,GAClD,CACA,UAAAxB,GACI,OAAO7X,KAAKmZ,eAChB,CACA,KAAApB,GACI,OAAO/X,KAAKoZ,UAChB,CACA,iBAAAQ,GACI,OAAOzR,EAAWnI,KAAK6Z,eAC3B,CACA,YAAAA,GACI,OAAOnC,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,EAGJ,SAASlP,KAAewC,GACpB,IAAKA,EAAOC,OAAO/J,GAAMA,aAAaG,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,CAdA9K,EAAQqM,UAAYA,EAepB,MAAMnD,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAC/E,SAASf,EAAWmB,GAChB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAOV,EAAMS,EAAO7F,IAExB,OAAO8F,CACX,CACA,MAAMsQ,EAAYhW,OAAO,uEACzB,SAAS4T,EAAYhI,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAInP,MAAM,mBACpB,KAAM8L,GAAOqD,GAAOA,EAAMoK,GACtB,MAAM,IAAIvZ,MAAM,kCACpB,OAAOmP,EAAIxG,SAAS,IAAIC,SAAS,GAAI,IACzC,CACA,SAAS4Q,EAASrK,GACd,MAAMjP,EAAI0H,EAAWuP,EAAYhI,IACjC,GAAiB,KAAbjP,EAAEK,OACF,MAAM,IAAIP,MAAM,4BACpB,OAAOE,CACX,CACA,SAAS6Y,EAAoB5J,GACzB,MAAMlG,EAAMkG,EAAIxG,SAAS,IACzB,OAAoB,EAAbM,EAAI1I,OAAa,IAAI0I,IAAQA,CACxC,CACA,SAASkP,EAAYlP,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,4CAA8C2I,GAEtE,OAAO1F,OAAO,KAAK0F,IACvB,CACA,SAASrB,EAAWqB,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,4CAA8CiJ,EAAI1I,QACtE,MAAM2I,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CACA,SAASoL,EAAcnU,GACnB,OAAOgY,EAAYtQ,EAAW1H,GAClC,CACA,SAAS8V,EAAYhN,GACjB,OAAOA,aAAe5I,WAAaA,WAAWoI,KAAKQ,GAAOrB,EAAWqB,EACzE,CACA,SAASmI,EAAgBjC,GACrB,GAAmB,iBAARA,GAAoBrP,OAAOC,cAAcoP,IAAQA,EAAM,EAC9D,OAAO5L,OAAO4L,GAClB,GAAmB,iBAARA,GAAoBqJ,EAAmBrJ,GAC9C,OAAOA,EACX,MAAM,IAAI7O,UAAU,sDACxB,CACA,SAAS8M,EAAIzH,EAAGzF,EAAI0L,EAAMQ,GACtB,MAAMjC,EAASxE,EAAIzF,EACnB,OAAOiK,GAAU2B,EAAM3B,EAASjK,EAAIiK,CACxC,CACA,SAAS6K,EAAKnH,EAAG4L,GACb,MAAM,EAAErN,GAAMR,EACd,IAAIzH,EAAM0J,EACV,KAAO4L,KAAU3N,GACb3H,GAAOA,EACPA,GAAOiI,EAEX,OAAOjI,CACX,CA4BA,SAAS8K,EAAOrP,EAAQ8Z,EAAS9N,EAAMQ,GACnC,GAAIxM,IAAWkM,GAAO4N,GAAU5N,EAC5B,MAAM,IAAI9L,MAAM,6CAA6CJ,SAAc8Z,KAE/E,IAAI/T,EAAIyH,EAAIxN,EAAQ8Z,GAChBxZ,EAAIwZ,EACJ7L,EAAI/B,EAAKuC,EAAItC,EAAK4N,EAAI5N,EAAKrD,EAAIoD,EACnC,KAAOnG,IAAMmG,GAAK,CACd,MAAM8N,EAAI1Z,EAAIyF,EACRiL,EAAI1Q,EAAIyF,EACRkU,EAAIhM,EAAI8L,EAAIC,EACZ/Z,EAAIwO,EAAI3F,EAAIkR,EAClB1Z,EAAIyF,EAAGA,EAAIiL,EAAG/C,EAAI8L,EAAGtL,EAAI3F,EAAGiR,EAAIE,EAAGnR,EAAI7I,CAC3C,CAEA,GADYK,IACA6L,EACR,MAAM,IAAI/L,MAAM,0BACpB,OAAOoN,EAAIS,EAAG6L,EAClB,CAuBA,SAAS9C,EAAanW,EAAMqZ,GAAe,GACvC,MAAMnW,EANV,SAAoBxD,GAChB,MAAM4Z,EAAuB,EAAf5Z,EAAMI,OAAwB,EAAXkN,EAC3B0B,EAAMmF,EAAcnU,GAC1B,OAAO4Z,EAAQ,EAAI5K,GAAO5L,OAAOwW,GAAS5K,CAC9C,CAEc6K,CAAWvZ,GACrB,GAAIqZ,EACA,OAAOnW,EACX,MAAM,EAAE9D,GAAM+L,EACd,OAAOjI,GAAK9D,EAAI8D,EAAI9D,EAAI8D,CAC5B,CACA,IAAIsW,EACAC,EACJ,MAAMC,EACF,WAAAtY,CAAYuY,EAASC,GAGjB,GAFA5a,KAAK2a,QAAUA,EACf3a,KAAK4a,SAAWA,EACO,iBAAZD,GAAwBA,EAAU,EACzC,MAAM,IAAIpa,MAAM,4BACpB,GAAwB,iBAAbqa,GAAyBA,EAAW,EAC3C,MAAM,IAAIra,MAAM,6BACpBP,KAAKiJ,EAAI,IAAIrI,WAAW+Z,GAASlX,KAAK,GACtCzD,KAAKkN,EAAI,IAAItM,WAAW+Z,GAASlX,KAAK,GACtCzD,KAAK6a,QAAU,CACnB,CACA,IAAAzV,IAAQ0V,GACJ,OAAOlb,EAAQ6L,MAAMsP,WAAW/a,KAAKkN,KAAM4N,EAC/C,CACA,QAAAE,IAAYF,GACR,OAAOL,EAAgBza,KAAKkN,KAAM4N,EACtC,CACA,SAAAG,GACI,GAA+B,mBAApBR,EACP,MAAM,IAAIjM,EAAS,iCAC3B,CACA,IAAA0M,GACI,GAAIlb,KAAK6a,SAAW,IAChB,MAAM,IAAIta,MAAM,qDACpBP,KAAK6a,SAAW,CACpB,CACA,YAAMM,CAAOC,EAAO,IAAIxa,YACpBZ,KAAKkN,QAAUlN,KAAKoF,KAAKpF,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GAC1Dpb,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GACV,IAAhBmS,EAAKta,SAETd,KAAKkN,QAAUlN,KAAKoF,KAAKpF,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GAC1Dpb,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GAClC,CACA,UAAAoS,CAAWD,EAAO,IAAIxa,YAClBZ,KAAKib,YACLjb,KAAKkN,EAAIlN,KAAKgb,SAAShb,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GACxDpb,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GACR,IAAhBmS,EAAKta,SAETd,KAAKkN,EAAIlN,KAAKgb,SAAShb,KAAKiJ,EAAGrI,WAAWoI,KAAK,CAAC,IAAQoS,GACxDpb,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GAChC,CACA,cAAMqS,GACFtb,KAAKkb,OACL,IAAInY,EAAM,EACV,MAAMrB,EAAM,GACZ,KAAOqB,EAAM/C,KAAK4a,UAAU,CACxB5a,KAAKiJ,QAAUjJ,KAAKoF,KAAKpF,KAAKiJ,GAC9B,MAAMsS,EAAKvb,KAAKiJ,EAAEtE,QAClBjD,EAAI0Q,KAAKmJ,GACTxY,GAAO/C,KAAKiJ,EAAEnI,MAClB,CACA,OAAOiH,KAAerG,EAC1B,CACA,YAAA8Z,GACIxb,KAAKib,YACLjb,KAAKkb,OACL,IAAInY,EAAM,EACV,MAAMrB,EAAM,GACZ,KAAOqB,EAAM/C,KAAK4a,UAAU,CACxB5a,KAAKiJ,EAAIjJ,KAAKgb,SAAShb,KAAKiJ,GAC5B,MAAMsS,EAAKvb,KAAKiJ,EAAEtE,QAClBjD,EAAI0Q,KAAKmJ,GACTxY,GAAO/C,KAAKiJ,EAAEnI,MAClB,CACA,OAAOiH,KAAerG,EAC1B,EAEJ,SAASqX,EAAmBrJ,GACxB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAM/L,CACpC,CACA,SAAS0U,EAAoBpF,GACzB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAMQ,CACpC,CACA,SAAS8O,EAASC,EAAQtB,EAAGxI,EAAG+J,GAAO,GACnC,MAAM,EAAEvb,GAAM+L,EACRe,EAAIiK,EAAauE,GAAQ,GAC/B,IAAK3C,EAAmB7L,GACpB,OACJ,MAAM0O,EAAOpM,EAAOtC,EAAG9M,GACjB+Z,EAAIjO,EAAMqG,KAAKgB,SAASrG,GACxBiE,EAAIxD,EAAIwM,EAAE/L,EAAGhO,GACnB,GAAI+Q,IAAM9E,EACN,OACJ,MAAM4K,EAAItJ,EAAIiO,EAAOjO,EAAIyM,EAAIxI,EAAIT,EAAG/Q,GAAIA,GACxC,GAAI6W,IAAM5K,EACN,OACJ,IAAIwP,EAAM,IAAI5P,EAAUkF,EAAG8F,GACvBD,GAAYmD,EAAE/L,IAAMyN,EAAI1K,EAAI,EAAI,GAAK9Q,OAAO8Z,EAAEvL,EAAItC,GAKtD,OAJIqP,GAAQE,EAAI7C,aACZ6C,EAAMA,EAAI3C,aACVlC,GAAY,GAET,CAAE6E,MAAK7E,WAClB,CACA,SAASJ,EAAoBrR,GACzB,IAAImK,EACJ,GAAmB,iBAARnK,EACPmK,EAAMnK,OAEL,GAAmB,iBAARA,GAAoBlF,OAAOC,cAAciF,IAAQA,EAAM,EACnEmK,EAAM5L,OAAOyB,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAIA,EAAIzE,SAAW,EAAIkN,EACnB,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMgJ,EAAYnT,EACtB,KACK,MAAIA,aAAe3E,YAMpB,MAAM,IAAIC,UAAU,8BALpB,GAAI0E,EAAIzE,SAAWkN,EACf,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMmF,EAActP,EAIxB,CACA,IAAKwT,EAAmBrJ,GACpB,MAAM,IAAInP,MAAM,qCACpB,OAAOmP,CACX,CACA,SAASoM,EAAmBC,GACxB,OAAIA,aAAqB7P,GACrB6P,EAAU1F,iBACH0F,GAGA7P,EAAMqK,QAAQwF,EAE7B,CACA,SAAS7E,EAAmBH,GACxB,GAAIA,aAAqB9K,EAErB,OADA8K,EAAUV,iBACHU,EAEX,IACI,OAAO9K,EAAU0M,QAAQ5B,EAC7B,CACA,MAAOiF,GACH,OAAO/P,EAAUuM,YAAYzB,EACjC,CACJ,CASA,SAASkF,EAAU5H,GACf,MAAM7L,EAAM6L,aAAgBzT,WACtBwI,EAAsB,iBAATiL,EACbtR,GAAOyF,GAAOY,IAAQiL,EAAKvT,OACjC,OAAI0H,EACOzF,IAAQkL,GAAiBlL,IAAQmL,EACxC9E,EACOrG,IAAwB,EAAhBkL,GAAqBlL,IAA0B,EAAlBmL,EAC5CmG,aAAgBnI,CAGxB,CAWA,SAASgQ,EAASxb,GAEd,OAAOmU,EADOnU,EAAMI,OAASiN,EAAWrN,EAAMiE,MAAM,EAAGoJ,GAAYrN,EAEvE,CACA,SAASyb,GAAYzb,GACjB,MAAM0b,EAAKF,EAASxb,GACd2b,EAAK1O,EAAIyO,EAAIjQ,EAAM/L,GACzB,OAAOkc,GAAWD,EAAKhQ,EAAM+P,EAAKC,EACtC,CACA,SAASC,GAAW5M,GAChB,OAAOqK,EAASrK,EACpB,CACA,SAAS6M,GAAYzF,EAASH,EAAY6F,GACtC,GAAe,MAAX1F,EACA,MAAM,IAAIvW,MAAM,2CAA2CuW,MAC/D,MAAM2F,EAAKjG,EAAYM,GACjBlF,EAAIgF,EAAoBD,GACxB+F,EAAW,CAACJ,GAAW1K,GAAIuK,GAAYM,IAC7C,GAAoB,MAAhBD,EAAsB,EACD,IAAjBA,IACAA,EAAe5c,EAAQ6L,MAAM7D,YAAYmG,IAC7C,MAAM4O,EAAInG,EAAYgG,GACtB,GAAIG,EAAE7b,SAAWiN,EACb,MAAM,IAAIxN,MAAM,kBAAkBwN,yBACtC2O,EAAStK,KAAKuK,EAClB,CAGA,MAAO,CAAEvB,KAFIrT,KAAe2U,GAEbtC,EADL8B,EAASO,GACD7K,IACtB,CACA,SAASgL,GAAYC,EAAQhS,GACzB,MAAM,IAAEgR,EAAG,SAAE7E,GAAa6F,GACpB,IAAEC,EAAG,UAAEC,GAAcnb,OAAOqJ,OAAO,CAAE+R,WAAW,EAAMF,KAAK,GAAQjS,GACnEoS,EAASH,EAAMjB,EAAI1C,gBAAkB0C,EAAIjC,oBAC/C,OAAOmD,EAAY,CAACE,EAAQjG,GAAYiG,CAC5C,CA9DArd,EAAQoM,aAHR,SAAsB2K,EAAYmB,GAAe,GAC7C,OAAO5L,EAAMwK,eAAeC,GAAYkB,WAAWC,EACvD,EAKAlY,EAAQmM,iBAHR,SAA0B+K,EAASC,EAAWC,EAAUc,GAAe,GACnE,OAAO5L,EAAM2K,cAAcC,EAASC,EAAWC,GAAUa,WAAWC,EACxE,EAuBAlY,EAAQkM,gBATR,SAAyBoR,EAAUC,EAASrF,GAAe,GACvD,GAAImE,EAAUiB,GACV,MAAM,IAAIrc,UAAU,kDACxB,IAAKob,EAAUkB,GACX,MAAM,IAAItc,UAAU,kDACxB,MAAMJ,EAAIqb,EAAmBqB,GAE7B,OADA1c,EAAE4V,iBACK5V,EAAE8S,SAASqD,EAAoBsG,IAAWrF,WAAWC,EAChE,EA+CAlY,EAAQiM,KATR9B,eAAoB+M,EAASsG,EAASvS,EAAO,CAAC,GAC1C,MAAM,KAAEuQ,EAAI,EAAEhB,EAAC,EAAExI,GAAM2K,GAAYzF,EAASsG,EAASvS,EAAK2R,cACpDa,EAAO,IAAI3C,EAx1BL,GAw1BuB1M,GAEnC,IAAI6N,EACJ,UAFMwB,EAAKlC,OAAOC,KAETS,EAAMJ,QAAe4B,EAAK/B,WAAYlB,EAAGxI,EAAG/G,EAAKmS,mBAChDK,EAAKlC,SACf,OAAOyB,GAAYf,EAAKhR,EAC5B,EAWAjL,EAAQgM,SATR,SAAkBkL,EAASsG,EAASvS,EAAO,CAAC,GACxC,MAAM,KAAEuQ,EAAI,EAAEhB,EAAC,EAAExI,GAAM2K,GAAYzF,EAASsG,EAASvS,EAAK2R,cACpDa,EAAO,IAAI3C,EAl2BL,GAk2BuB1M,GAEnC,IAAI6N,EACJ,IAFAwB,EAAKhC,WAAWD,KAEPS,EAAMJ,EAAS4B,EAAK7B,eAAgBpB,EAAGxI,EAAG/G,EAAKmS,aACpDK,EAAKhC,aACT,OAAOuB,GAAYf,EAAKhR,EAC5B,EAEA,MAAMyS,GAAQ,CAAEC,QAAQ,GAgCxB,SAASC,GAAyBC,GAC9B,OAAO9P,EAAIkH,EAAc4I,GAAKtR,EAAM/L,EACxC,CAHAR,EAAQ+L,OA9BR,SAAgBoL,EAAWD,EAASiF,EAAWlR,EAAOyS,IAClD,IAAIzB,EACJ,IACIA,EAAM3E,EAAmBH,GACzBD,EAAUN,EAAYM,EAC1B,CACA,MAAOkF,GACH,OAAO,CACX,CACA,MAAM,EAAE7K,EAAC,GAAQ0K,EACjB,GAAIhR,EAAK0S,QAAU1B,EAAI7C,WACnB,OAAO,EACX,MAAM9U,EAAIiT,EAAaL,GACvB,IAAInK,EACJ,IACIA,EAAImP,EAAmBC,EAC3B,CACA,MAAOC,GACH,OAAO,CACX,CACA,MAAM,EAAE5b,GAAM+L,EACRuR,EAAOlO,EAAOyH,EAAG7W,GACjBkX,EAAK3J,EAAIzJ,EAAIwZ,EAAMtd,GACnBmX,EAAK5J,EAAIwD,EAAIuM,EAAMtd,GACnBqX,EAAIvL,EAAMqG,KAAKqF,qBAAqBjL,EAAG2K,EAAIC,GACjD,QAAKE,GAEK9J,EAAI8J,EAAErJ,EAAGhO,KACN+Q,CACjB,EAKA,MAAMwM,GACF,WAAAvb,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,cAAOE,CAAQ/M,GACX,MAAM9I,EAAQ8V,EAAYhN,GAC1B,GAAqB,KAAjB9I,EAAMI,OACN,MAAM,IAAID,UAAU,oDAAoDH,EAAMI,UAClF,MAAMqQ,EAAI0D,EAAcnU,EAAM0C,SAAS,EAAG,KACpC6T,EAAIpC,EAAcnU,EAAM0C,SAAS,GAAI,KAC3C,OAAO,IAAIua,GAAiBxM,EAAG8F,EACnC,CACA,cAAAZ,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK8U,EAAoB3D,KAAO4H,EAAmB9B,GAC/C,MAAM,IAAI1W,MAAM,oBACxB,CACA,KAAAwX,GACI,OAAOL,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,CACA,UAAAY,GACI,OAAO1P,EAAWnI,KAAK+X,QAC3B,EAKJ,MAAM6F,GACF,WAAAxb,CAAYyD,EAAS8Q,EAAYkH,EAAUje,EAAQ6L,MAAM7D,eACrD,GAAe,MAAX/B,EACA,MAAM,IAAIhF,UAAU,sCAAsCgF,MAC9D7F,KAAKoa,EAAI5D,EAAY3Q,GACrB,MAAM,EAAEuI,EAAC,OAAEqD,GAAWzR,KAAK8d,UAAUlH,EAAoBD,IAIzD,GAHA3W,KAAK+d,GAAK3P,EACVpO,KAAK4R,EAAIH,EACTzR,KAAKge,KAAOxH,EAAYqH,GACC,KAArB7d,KAAKge,KAAKld,OACV,MAAM,IAAID,UAAU,4CAC5B,CACA,SAAAid,CAAUG,GACN,MAAMzK,EAAQtH,EAAMwK,eAAeuH,GAC7BxM,EAAS+B,EAAMkB,WAAauJ,EAAO9R,EAAM/L,EAAI6d,EACnD,MAAO,CAAEzK,QAAO/B,SAAQrD,EAAGoF,EAAMyE,SACrC,CACA,SAAAiG,CAAUtM,EAAGuM,GACT,OAAOpE,EAASnI,EAAIiD,EAAcsJ,GACtC,CACA,aAAAC,CAAcC,GACV,MAAMC,EAAK3Q,EAAIkH,EAAcwJ,GAAMlS,EAAM/L,GACzC,GAAIke,IAAOjS,EACP,MAAM,IAAI9L,MAAM,iDACpB,MAAQiT,MAAOiE,EAAGrJ,EAAGmQ,EAAI9M,OAAQvE,GAAMlN,KAAK8d,UAAUQ,GACtD,MAAO,CAAE7G,IAAG8G,KAAIrR,IACpB,CACA,WAAA0P,CAAYnF,EAAGvK,EAAGyP,EAAG/K,GACjB,OAAO,IAAI+L,GAAiBlG,EAAErJ,EAAGT,EAAIT,EAAIyP,EAAI/K,EAAGzF,EAAM/L,IAAIyX,YAC9D,CACA,KAAAmE,GACI,MAAM,IAAIzb,MAAM,mCACpB,CACA,UAAMie,GACF,MAAM,EAAEpE,EAAC,EAAExI,EAAC,GAAEmM,EAAE,KAAEC,GAAShe,KACrBye,EAAM7e,EAAQ6L,MAAMiT,WACpBC,EAAI3e,KAAKke,UAAUtM,QAAS6M,EAAIG,GAAKC,IAAKb,KAC1C,EAAEvG,EAAC,GAAE8G,EAAE,EAAErR,GAAMlN,KAAKoe,oBAAoBK,EAAIG,GAAKE,MAAOH,EAAGZ,EAAI3D,IAC/DuC,EAAIa,SAA+BiB,EAAIG,GAAKG,UAAWR,EAAIR,EAAI3D,IAC/DyB,EAAM7b,KAAK4c,YAAYnF,EAAGvK,EAAGyP,EAAG/K,GAGtC,aAFYoN,GAAcnD,EAAKzB,EAAG2D,IAC9B/d,KAAKgc,QACFH,CACX,CACA,QAAAoD,GACI,MAAM,EAAE7E,EAAC,EAAExI,EAAC,GAAEmM,EAAE,KAAEC,GAAShe,KACrBye,EAAM7e,EAAQ6L,MAAMyT,eACpBP,EAAI3e,KAAKke,UAAUtM,EAAG6M,EAAIG,GAAKC,IAAKb,KACpC,EAAEvG,EAAC,GAAE8G,EAAE,EAAErR,GAAMlN,KAAKoe,cAAcK,EAAIG,GAAKE,MAAOH,EAAGZ,EAAI3D,IACzDuC,EAAIa,GAAyBiB,EAAIG,GAAKG,UAAWR,EAAIR,EAAI3D,IACzDyB,EAAM7b,KAAK4c,YAAYnF,EAAGvK,EAAGyP,EAAG/K,GAGtC,OAFKuN,GAAkBtD,EAAKzB,EAAG2D,IAC3B/d,KAAKgc,QACFH,CACX,EAQJ,SAASuD,GAAkBrI,EAAWlR,EAASkW,GAC3C,MAAMsD,EAAMtI,aAAqB4G,GAC3B9B,EAAMwD,EAAMtI,EAAY4G,GAAiBpH,QAAQQ,GAGvD,OAFIsI,GACAxD,EAAIxF,iBACD,IACAwF,EACHzB,EAAG5D,EAAY3Q,GACf8G,EAAGmP,EAAmBC,GAE9B,CACA,SAASuD,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,GACpC,MAAMlF,EAAIvL,EAAMqG,KAAKqF,qBAAqBjL,EAAGiK,EAAoBK,GAAItJ,GAAKgP,EAAGxQ,EAAM/L,IACnF,SAAKqX,IAAMA,EAAE/C,YAAc+C,EAAErJ,IAAM+C,EAGvC,CACApH,eAAeiV,GAAcjI,EAAWlR,EAASkW,GAC7C,IACI,MAAM,EAAE5K,EAAC,EAAE8F,EAAC,EAAEmD,EAAC,EAAEzN,GAAMyS,GAAkBrI,EAAWlR,EAASkW,GACvDY,EAAIa,SAA+B5d,EAAQ6L,MAAMiT,WAAWE,GAAKG,UAAWhF,EAAS5I,GAAIxE,EAAEsL,SAAUmC,IAC3G,OAAOkF,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,EAC1C,CACA,MAAOX,GACH,OAAO,CACX,CACJ,CACA,SAASmD,GAAkBpI,EAAWlR,EAASkW,GAC3C,IACI,MAAM,EAAE5K,EAAC,EAAE8F,EAAC,EAAEmD,EAAC,EAAEzN,GAAMyS,GAAkBrI,EAAWlR,EAASkW,GACvDY,EAAIa,GAAyB5d,EAAQ6L,MAAMyT,eAAeN,GAAKG,UAAWhF,EAAS5I,GAAIxE,EAAEsL,SAAUmC,IACzG,OAAOkF,GAAsBnO,EAAGxE,EAAGsK,EAAG0F,EAC1C,CACA,MAAOX,GACH,GAAIA,aAAiBxN,EACjB,MAAMwN,EACV,OAAO,CACX,CACJ,CACApc,EAAQ8L,QAAU,CACdO,UAAW0R,GACX3R,aA1GJ,SAA6B2K,GACzB,OAAOzK,EAAMwK,eAAeC,GAAYsB,QAC5C,EAyGIpM,KAhDJ9B,eAA2BuB,EAAK8R,EAASS,GACrC,OAAO,IAAID,GAAyBtS,EAAK8R,EAASS,GAASW,MAC/D,EA+CI7S,OAAQqT,GACRpT,SA/CJ,SAAyBN,EAAK8R,EAASS,GACnC,OAAO,IAAID,GAAyBtS,EAAK8R,EAASS,GAASoB,UAC/D,EA8CIM,WAAYJ,IAEhBjT,EAAMqG,KAAKiC,eAAe,GAC1B,MAAMzP,GAAS,CACXC,KAAMoH,EACNlH,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,GAEhE2Z,GAAO,CACTG,UAAW,oBACXF,IAAK,cACLC,MAAO,iBAELU,GAAuB,CAAC,EAC9B5f,EAAQ6L,MAAQ,CACZrD,aACAD,aACAJ,cACA4F,MACA6B,SACA,iBAAAiQ,CAAkB9I,GACd,IAEI,OADAC,EAAoBD,IACb,CACX,CACA,MAAOqF,GACH,OAAO,CACX,CACJ,EACA0D,iBAAkB3F,EAClB4F,qBAAsB/I,EACtBgJ,iBAAmB5e,IACfA,EAAOwV,EAAYxV,GACnB,MAAM6e,EAAS7R,EAAW,EAC1B,GAAIhN,EAAKF,OAAS+e,GAAU7e,EAAKF,OAAS,KACtC,MAAM,IAAIP,MAAM,uDAGpB,OAAOwZ,EADKpM,EAAIkH,EAAc7T,GAAOmL,EAAM/L,EAAIkM,GAAOA,EAClC,EAExB1E,YAAa,CAAC2D,EAAc,MACxB,GAAIxG,GAAOG,IACP,OAAOH,GAAOG,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEhD,GAAIxG,GAAOC,KAAM,CAClB,MAAM,YAAE4C,GAAgB7C,GAAOC,KAC/B,OAAOpE,WAAWoI,KAAKpB,EAAY2D,GACvC,CAEI,MAAM,IAAIhL,MAAM,oDACpB,EAEJuf,iBAAkB,IAAMlgB,EAAQ6L,MAAMmU,iBAAiBhgB,EAAQ6L,MAAM7D,YAAYoG,EAAW,IAC5F,UAAA+R,CAAWnN,EAAa,EAAGY,EAAQtH,EAAMqG,MACrC,MAAMyN,EAASxM,IAAUtH,EAAMqG,KAAOiB,EAAQ,IAAItH,EAAMsH,EAAMpF,EAAGoF,EAAM5E,GAGvE,OAFAoR,EAAOxL,eAAe5B,GACtBoN,EAAOzM,SAAS/G,GACTwT,CACX,EACAja,OAAQgE,SAAUkW,KACd,GAAIlb,GAAOG,IAAK,CACZ,MAAMzC,QAAesC,GAAOG,IAAIgb,OAAOzb,OAAO,UAAWsD,KAAekY,IACxE,OAAO,IAAIrf,WAAW6B,EAC1B,CACK,GAAIsC,GAAOC,KAAM,CAClB,MAAM,WAAEmb,GAAepb,GAAOC,KACxBhE,EAAOmf,EAAW,UAExB,OADAF,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,+CACpB,EAEJwa,WAAYhR,MAAOxE,KAAQ0a,KACvB,GAAIlb,GAAOG,IAAK,CACZ,MAAMmb,QAAatb,GAAOG,IAAIgb,OAAOI,UAAU,MAAO/a,EAAK,CAAEkT,KAAM,OAAQzX,KAAM,CAAEyX,KAAM,aAAe,EAAO,CAAC,SAC1G5S,EAAUkC,KAAekY,GACzBxd,QAAesC,GAAOG,IAAIgb,OAAOrU,KAAK,OAAQwU,EAAMxa,GAC1D,OAAO,IAAIjF,WAAW6B,EAC1B,CACK,GAAIsC,GAAOC,KAAM,CAClB,MAAM,WAAEub,GAAexb,GAAOC,KACxBhE,EAAOuf,EAAW,SAAUhb,GAElC,OADA0a,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,oDACpB,EAEJigB,gBAAYvb,EACZwb,oBAAgBxb,EAChByZ,WAAY3U,MAAO0U,KAAQwB,KACvB,IAAIS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,QAAa/gB,EAAQ6L,MAAM1F,OAAOnF,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MACjFF,EAAO3Y,EAAY4Y,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAO9gB,EAAQ6L,MAAM1F,OAAO2a,KAAST,EAAS,EAElDf,eAAgB,CAACT,KAAQwB,KACrB,GAA2B,mBAAhBzF,EACP,MAAM,IAAIhM,EAAS,+CACvB,IAAIkS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,EAAOnG,EAAY5Z,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MAClEF,EAAO3Y,EAAY4Y,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAOlG,EAAYkG,KAAST,EAAS,EAEzCY,eAAgBlS,GAEpB/M,OAAOkf,iBAAiBlhB,EAAQ6L,MAAO,CACnC+U,WAAY,CACRO,cAAc,EACdvc,IAAG,IACQgW,EAEX,GAAArX,CAAI6d,GACKxG,IACDA,EAAcwG,EACtB,GAEJP,eAAgB,CACZM,cAAc,EACdvc,IAAG,IACQiW,EAEX,GAAAtX,CAAI6d,GACKvG,IACDA,EAAkBuG,EAC1B,2BCnlCRnhB,EAAOD,QAlHP,SAAeqhB,GACb,GAAIA,EAASngB,QAAU,IAAO,MAAM,IAAID,UAAU,qBAElD,IADA,IAAIqgB,EAAW,IAAItgB,WAAW,KACrB8I,EAAI,EAAGA,EAAIwX,EAASpgB,OAAQ4I,IACnCwX,EAASxX,GAAK,IAEhB,IAAK,IAAIhG,EAAI,EAAGA,EAAIud,EAASngB,OAAQ4C,IAAK,CACxC,IAAI0K,EAAI6S,EAASE,OAAOzd,GACpB0d,EAAKhT,EAAEwS,WAAW,GACtB,GAAqB,MAAjBM,EAASE,GAAe,MAAM,IAAIvgB,UAAUuN,EAAI,iBACpD8S,EAASE,GAAM1d,CACjB,CACA,IAAI6O,EAAO0O,EAASngB,OAChBugB,EAASJ,EAASE,OAAO,GACzBG,EAASpe,KAAKqe,IAAIhP,GAAQrP,KAAKqe,IAAI,KACnCC,EAAUte,KAAKqe,IAAI,KAAOre,KAAKqe,IAAIhP,GA8CvC,SAASkP,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAI7gB,UAAU,mBACtD,GAAsB,IAAlB6gB,EAAO5gB,OAAgB,OAAO,IAAIF,WAKtC,IAJA,IAAI+gB,EAAM,EAENC,EAAS,EACT9gB,EAAS,EACN4gB,EAAOC,KAASN,GACrBO,IACAD,IAMF,IAHA,IAAIE,GAAUH,EAAO5gB,OAAS6gB,GAAOL,EAAU,IAAO,EAClDQ,EAAO,IAAIlhB,WAAWihB,GAEnBH,EAAOC,IAAM,CAElB,IAAII,EAAQb,EAASQ,EAAOd,WAAWe,IAEvC,GAAc,MAAVI,EAAiB,OAErB,IADA,IAAIre,EAAI,EACCse,EAAMH,EAAO,GAAc,IAAVE,GAAere,EAAI5C,KAAqB,IAATkhB,EAAaA,IAAOte,IAC3Eqe,GAAUxP,EAAOuP,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAIxhB,MAAM,kBACnCO,EAAS4C,EACTie,GACF,CAGA,IADA,IAAIM,EAAMJ,EAAO/gB,EACVmhB,IAAQJ,GAAsB,IAAdC,EAAKG,IAC1BA,IAIF,IAFA,IAAIC,EAAM,IAAIthB,WAAWghB,GAAUC,EAAOI,IACtCvY,EAAIkY,EACDK,IAAQJ,GACbK,EAAIxY,KAAOoY,EAAKG,KAElB,OAAOC,CACT,CAMA,MAAO,CACL5Y,OA7FF,SAAiBoY,GAOf,GANIA,aAAkB9gB,aACXuhB,YAAYC,OAAOV,GAC5BA,EAAS,IAAI9gB,WAAW8gB,EAAOjf,OAAQif,EAAO/d,WAAY+d,EAAOjZ,YACxDM,MAAMsZ,QAAQX,KACvBA,EAAS9gB,WAAWoI,KAAK0Y,OAErBA,aAAkB9gB,YAAe,MAAM,IAAIC,UAAU,uBAC3D,GAAsB,IAAlB6gB,EAAO5gB,OAAgB,MAAO,GAMlC,IAJA,IAAI8gB,EAAS,EACT9gB,EAAS,EACTwhB,EAAS,EACTC,EAAOb,EAAO5gB,OACXwhB,IAAWC,GAA2B,IAAnBb,EAAOY,IAC/BA,IACAV,IAMF,IAHA,IAAIC,GAASU,EAAOD,GAAUd,EAAU,IAAO,EAC3CgB,EAAM,IAAI5hB,WAAWihB,GAElBS,IAAWC,GAAM,CAItB,IAHA,IAAIR,EAAQL,EAAOY,GAEf5e,EAAI,EACC+e,EAAMZ,EAAO,GAAc,IAAVE,GAAere,EAAI5C,KAAqB,IAAT2hB,EAAaA,IAAO/e,IAC3Eqe,GAAU,IAAMS,EAAIC,KAAU,EAC9BD,EAAIC,GAAQV,EAAQxP,IAAU,EAC9BwP,EAASA,EAAQxP,IAAU,EAE7B,GAAc,IAAVwP,EAAe,MAAM,IAAIxhB,MAAM,kBACnCO,EAAS4C,EACT4e,GACF,CAGA,IADA,IAAII,EAAMb,EAAO/gB,EACV4hB,IAAQb,GAAqB,IAAbW,EAAIE,IACzBA,IAIF,IADA,IAAItZ,EAAMiY,EAAOsB,OAAOf,GACjBc,EAAMb,IAAQa,EAAOtZ,GAAO6X,EAASE,OAAOqB,EAAIE,IACvD,OAAOtZ,CACT,EAkDEqY,aAAcA,EACdmB,OARF,SAAiBC,GACf,IAAIpgB,EAASgf,EAAaoB,GAC1B,GAAIpgB,EAAU,OAAOA,EACrB,MAAM,IAAIlC,MAAM,WAAagS,EAAO,aACtC,EAMF,4BCrHA3S,EAAQ6I,WAuCR,SAAqBqa,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,CAClD,EA3CAtjB,EAAQujB,YAiDR,SAAsBL,GACpB,IAAI1X,EAcA1H,EAbAqf,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBva,EAAM,IAAI4a,EAVhB,SAAsBN,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBG,CAAYP,EAAKG,EAAUC,IAEzCI,EAAU,EAGVvgB,EAAMmgB,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKvf,EAAI,EAAGA,EAAIX,EAAKW,GAAK,EACxB0H,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,GAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,GACpC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACrC6f,EAAUT,EAAIlC,WAAWld,EAAI,IAC/B8E,EAAI8a,KAAclY,GAAO,GAAM,IAC/B5C,EAAI8a,KAAclY,GAAO,EAAK,IAC9B5C,EAAI8a,KAAmB,IAANlY,EAmBnB,OAhBwB,IAApB8X,IACF9X,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,EAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACvC8E,EAAI8a,KAAmB,IAANlY,GAGK,IAApB8X,IACF9X,EACGmY,EAAUT,EAAIlC,WAAWld,KAAO,GAChC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACpC6f,EAAUT,EAAIlC,WAAWld,EAAI,KAAO,EACvC8E,EAAI8a,KAAclY,GAAO,EAAK,IAC9B5C,EAAI8a,KAAmB,IAANlY,GAGZ5C,CACT,EA5FA5I,EAAQ4jB,cAkHR,SAAwBC,GAQtB,IAPA,IAAIrY,EACArI,EAAM0gB,EAAM3iB,OACZ4iB,EAAa3gB,EAAM,EACnB4gB,EAAQ,GACRC,EAAiB,MAGZlgB,EAAI,EAAGmgB,EAAO9gB,EAAM2gB,EAAYhgB,EAAImgB,EAAMngB,GAAKkgB,EACtDD,EAAMvR,KAAK0R,EAAYL,EAAO/f,EAAIA,EAAIkgB,EAAkBC,EAAOA,EAAQngB,EAAIkgB,IAqB7E,OAjBmB,IAAfF,GACFtY,EAAMqY,EAAM1gB,EAAM,GAClB4gB,EAAMvR,KACJ2R,EAAO3Y,GAAO,GACd2Y,EAAQ3Y,GAAO,EAAK,IACpB,OAEsB,IAAfsY,IACTtY,GAAOqY,EAAM1gB,EAAM,IAAM,GAAK0gB,EAAM1gB,EAAM,GAC1C4gB,EAAMvR,KACJ2R,EAAO3Y,GAAO,IACd2Y,EAAQ3Y,GAAO,EAAK,IACpB2Y,EAAQ3Y,GAAO,EAAK,IACpB,MAIGuY,EAAMK,KAAK,GACpB,EA1IA,IALA,IAAID,EAAS,GACTR,EAAY,GACZH,EAA4B,oBAAfxiB,WAA6BA,WAAamI,MAEvDkb,EAAO,mEACFvgB,EAAI,EAAsBA,EAAbugB,KAAwBvgB,EAC5CqgB,EAAOrgB,GAAKugB,EAAKvgB,GACjB6f,EAAUU,EAAKrD,WAAWld,IAAMA,EAQlC,SAASsf,EAASF,GAChB,IAAI/f,EAAM+f,EAAIhiB,OAEd,GAAIiC,EAAM,EAAI,EACZ,MAAM,IAAIxC,MAAM,kDAKlB,IAAI0iB,EAAWH,EAAIoB,QAAQ,KAO3B,OANkB,IAAdjB,IAAiBA,EAAWlgB,GAMzB,CAACkgB,EAJcA,IAAalgB,EAC/B,EACA,EAAKkgB,EAAW,EAGtB,CAmEA,SAASa,EAAaL,EAAOU,EAAOC,GAGlC,IAFA,IAAIhZ,EARoBsE,EASpBjO,EAAS,GACJiC,EAAIygB,EAAOzgB,EAAI0gB,EAAK1gB,GAAK,EAChC0H,GACIqY,EAAM/f,IAAM,GAAM,WAClB+f,EAAM/f,EAAI,IAAM,EAAK,QACP,IAAf+f,EAAM/f,EAAI,IACbjC,EAAO2Q,KAdF2R,GADiBrU,EAeMtE,IAdT,GAAK,IACxB2Y,EAAOrU,GAAO,GAAK,IACnBqU,EAAOrU,GAAO,EAAI,IAClBqU,EAAa,GAANrU,IAaT,OAAOjO,EAAOuiB,KAAK,GACrB,CAlGAT,EAAU,IAAI3C,WAAW,IAAM,GAC/B2C,EAAU,IAAI3C,WAAW,IAAM,8BClB/Bhf,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQykB,SAAWzkB,EAAQ0kB,SAAW1kB,EAAQ2kB,iBAAmB3kB,EAAQ4kB,WAAa5kB,EAAQ6kB,cAAW,EACzG,MAAMC,EAAa,EAAQ,KACrBC,EAAc,EAAQ,KACtBC,EAAU,EAAQ,IACxBhlB,EAAQ6kB,SAAW,CACfI,QAAS,CACLC,MAAO,GACPC,KAAM,IAEVC,QAAS,CACLF,MAAO,GACPC,KAAM,KAId,MAAME,EAAyB,CAAC,EAChCA,EAAuB,GAAKrlB,EAAQ6kB,SAASI,QAAQC,MACrDG,EAAuB,GAAKrlB,EAAQ6kB,SAASI,QAAQE,KACrDE,EAAuB,KAAOrlB,EAAQ6kB,SAASO,QAAQF,MACvDG,EAAuB,KAAOrlB,EAAQ6kB,SAASO,QAAQD,KAEvD,MAAMG,EAAyB,CAAC,EAahC,SAASV,EAAWW,EAASC,GACzB,IAAKA,EAAWC,MAAM,qBAClB,MAAM,IAAI9kB,MAAM,8CAGpB,MAAO,KADW,EAAImkB,EAAWY,gBAAgBH,EAASC,IAE9D,CAOA,SAASb,EAAiBgB,GACtB,GAAIA,EAAQzkB,QAAU,EAClB,MAAM,IAAIP,MAAM,uCAEpB,GAAkB,KAAdglB,EAAQ,GACR,MAAM,IAAIhlB,MAAM,4CAEpB,OAAO,EAAImkB,EAAWc,gBAAgBD,EAAQ5gB,MAAM,GACxD,CAjCAugB,EAAuBtlB,EAAQ6kB,SAASI,QAAQC,OAAS,EACzDI,EAAuBtlB,EAAQ6kB,SAASI,QAAQE,MAAQ,EACxDG,EAAuBtlB,EAAQ6kB,SAASO,QAAQF,OAAS,IACzDI,EAAuBtlB,EAAQ6kB,SAASO,QAAQD,MAAQ,IAgBxDnlB,EAAQ4kB,WAAaA,EAerB5kB,EAAQ2kB,iBAAmBA,EAyB3B3kB,EAAQ0kB,SAhBR,SAAkBmB,EAAUN,GAAU,GAClC,MAAMO,EAAWf,EAAY/B,OAAO6C,GAC9BE,GAAgB,EAAIf,EAAQxc,YAAYsd,EAAS7iB,MACjD+iB,EAAc/b,UAAS,EAAI+a,EAAQxc,YAAYsd,EAASlO,QAAS,IACvE,IAAIqO,EAUJ,OATIV,EAAU,GACVU,EAAgBD,OAC4B3gB,IAAxCggB,EAAuBW,KACvBC,EAAgBZ,EAAuBW,KAI3CC,EAAgBV,EAEbX,EAAWqB,EAAeF,EACrC,EA6BA/lB,EAAQykB,SApBR,SAAkByB,EAAWX,GAAU,GACnC,MAAMO,EAAWnB,EAAiBuB,GAC5BD,EAAgBH,EAAS,GACzBC,EAAgBD,EAAS,GAC/B,IAAIK,EACAZ,EAAU,GACVY,EAAiBF,OAC6B5gB,IAA1CigB,EAAuBW,KACvBE,EAAiBb,EAAuBW,KAI5CE,EAAiBZ,EAErB,IAAI3N,EAASuO,EAAe7c,SAAS,IAIrC,OAHsB,IAAlBsO,EAAO1W,SACP0W,EAAS,IAAIA,KAEVmN,EAAYrb,OAAOqc,EAAenO,EAC7C,8BCxGA5V,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgjB,OAAShjB,EAAQ0J,YAAS,EAClC,MAAM0c,EAAW,EAAQ,IACnBpB,EAAU,EAAQ,IAClBqB,EAAQ,EAAQ,KAChBhF,EAAW,6DAUjBrhB,EAAQ0J,OATR,SAAgBzG,EAAM2U,EAAS,MAC3B,MAAM0O,EAA4B,iBAATrjB,GAAoB,EAAI+hB,EAAQzc,YAAYtF,GAAQA,EACvEsjB,EAAgC,iBAAX3O,GAAsB,EAAIoN,EAAQzc,YAAYqP,GAAU3U,EACnF,KAAMqjB,aAAqBtlB,YAAiBulB,aAAuBvlB,YAC/D,MAAM,IAAIC,UAAU,iDAExB,MAAMulB,GAAW,EAAIJ,EAASjgB,SAAQ,EAAIigB,EAASjgB,QAAQ,IAAInF,WAAW,IAAIulB,KAAgBD,MAC9F,OAAOD,EAAMhF,GAAU3X,OAAO,IAAI6c,KAAgBD,KAAcE,EAASzhB,MAAM,EAAG,IACtF,EAeA/E,EAAQgjB,OAbR,SAAgBC,GACZ,MAAMniB,EAAQulB,EAAMhF,GAAU2B,OAAOC,GAC/BsD,EAAczlB,EAAMiE,MAAM,EAAG,GAC7BuhB,EAAYxlB,EAAMiE,MAAM,GAAI,GAE5ByhB,GAAW,EAAIJ,EAASjgB,SAAQ,EAAIigB,EAASjgB,QAAQ,IAAInF,WAAW,IAAIulB,KAAgBD,MAM9F,OALAxlB,EAAMiE,OAAO,GAAGyb,SAAQ,CAACiG,EAAOC,KAC5B,GAAID,IAAUD,EAASE,GACnB,MAAM,IAAI/lB,MAAM,mBACpB,IAEG,CAAEiX,OAAQ2O,EAAatjB,KAAMqjB,EACxC,8BCjCAtkB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ4lB,eAAiB5lB,EAAQ0lB,oBAAiB,EAClD,MAAMU,EAAW,EAAQ,IACnBpB,EAAU,EAAQ,IAClB2B,EAAa,EAAQ,KAM3B,SAASC,EAAYC,GACjB,MAAMC,GAAW,EAAIV,EAASjgB,SAAQ,EAAIigB,EAASjgB,SAAQ,EAAI6e,EAAQzc,YAAYse,KAEnF,OADiB,EAAI7B,EAAQxc,YAAYse,EAAS/hB,MAAM,EAAG,GAE/D,CA+BA/E,EAAQ0lB,eAnBR,SAAwBH,EAAStiB,GAC7B,GAAIsiB,EAAU,GAAKA,GAAW,GAC1B,MAAM,IAAI5kB,MAAM,8CAEpB,IAAKsC,EAAKwiB,MAAM,kBACZ,MAAM,IAAI9kB,MAAM,oCAEpBsC,EAAOA,EAAK8jB,eACH7lB,OAAS,GAAM,IACpB+B,EAAO,IAAIA,KAEf,IAAI+jB,EAAazB,EAAQjc,SAAS,IACR,IAAtB0d,EAAW9lB,SACX8lB,EAAa,IAAIA,KAErB,MAAMC,EAAcL,EAAY,GAAGI,IAAa/jB,KAC1CikB,GAAS,EAAIP,EAAWQ,WAAW,GAAGlkB,IAAOgkB,KACnD,MAAO,GAAGN,EAAWS,IAAI7B,KAAW2B,GACxC,EA6BAlnB,EAAQ4lB,eAfR,SAAwByB,GACpBA,GAAU,EAAIV,EAAWW,cAAcD,GACvC,MAAMR,GAAU,EAAIF,EAAWY,WAAWF,EAAQtiB,MAAM,IAClDyiB,EAAcH,EAAQ,GACtB9B,EAAUoB,EAAWS,IAAI9C,QAAQkD,GACjChB,EAAWK,EAAQ9hB,OAAO,GAChC,IAAIiiB,EAAazB,EAAQjc,SAAS,IAIlC,GAH0B,IAAtB0d,EAAW9lB,SACX8lB,EAAa,IAAIA,KAEjBJ,EAAY,GAAGI,IAAaH,EAAQY,UAAU,EAAGZ,EAAQ3lB,OAAS,QAAUslB,EAC5E,MAAM,IAAI7lB,MAAM,8CAEpB,MAAO,CAAC4kB,EAASsB,EAAQY,UAAU,EAAGZ,EAAQ3lB,OAAS,GAC3D,8BCxEAc,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQunB,UAAYvnB,EAAQsnB,aAAetnB,EAAQmnB,UAAYnnB,EAAQonB,SAAM,EAC7E,MAAMpC,EAAU,EAAQ,IACxBhlB,EAAQonB,IAAM,mCACd,MAAMxd,EAAM,mBAkEZ,SAAS0d,EAAaI,GAIlB,OAAOA,EAASC,cAAcC,QAAQ,KAAM,KAAKA,QAAQ,OAAQ,IACrE,CAXA5nB,EAAQmnB,UApDR,SAAmBU,EAAUC,GAEzB,IAAKD,EAASpC,MAAM,kBAChB,MAAM,IAAI9kB,MAAM,4BAEhBknB,EAAS3mB,OAAS,GAAM,IACxB2mB,EAAW,IAAIA,KAGnB,IAAI/iB,EAAM,GACNqd,EAAQ,EACZ,IAAK,IAAIre,GAHT+jB,EAAWA,EAASd,eAGE7lB,OAAS,EAAG4C,GAAK,EAAGA,IACtC,GAAIqe,EAAQ,EAAG,CACX,MAAM4F,EAAcne,EAAI0a,QAAQuD,EAAS/jB,KAAOqe,EAChD,IAAI6F,EAAW,EACL,IAANlkB,IACAkkB,EAAWpe,EAAI0a,QAAQuD,EAAS/jB,EAAI,KAGxC,MAAMmkB,EAAW,EAAI9F,EACf+F,EAAcF,GAAY,GAAKC,IAAc,EAAIA,EACjDE,EAAcnoB,EAAQonB,IAAIW,EAAcG,GAC9C/F,EAAQ8F,EACRnjB,EAAIsjB,QAAQD,EAChB,MAEIhG,EAAQ,EAGhB,IAAIkG,EAAkB,EACtB,IAAK,IAAIvkB,EAAI,EAAGA,EAAIgB,EAAI5D,QACL,MAAX4D,EAAIhB,GADoBA,IAKxBukB,IAGRvjB,EAAMA,EAAIC,MAAMsjB,GAChB,MAAMC,GAAa,IAAIC,aAAcvF,QAAO,EAAIgC,EAAQzc,YAAYsf,IAAWpC,MAAM,YAC/E+C,EAA2BF,EAAaA,EAAW,GAAGpnB,OAAS,EACrE,IAAK,IAAI4C,EAAI,EAAGA,EAAI0kB,EAA0B1kB,IAC1CgB,EAAIsjB,QAAQpoB,EAAQonB,IAAI,IAE5B,GAAIU,EAAW,CACX,MAAMW,EAAQX,EAAYhjB,EAAI5D,OAC9B,IAAK,IAAI4C,EAAI,EAAGA,EAAI2kB,EAAO3kB,IACvBgB,EAAIsjB,QAAQpoB,EAAQonB,IAAI,GAEhC,CACA,OAAOtiB,EAAIsf,KAAK,GACpB,EAaApkB,EAAQsnB,aAAeA,EA+DvBtnB,EAAQunB,UAtDR,SAAmBG,EAAUI,GAGzB,KAFAJ,EAAWJ,EAAaI,IAEVjC,MAAM,KAAKzlB,EAAQonB,UAC7B,MAAM,IAAIzmB,MAAM,4BAEpB,MAAM2nB,EAAaZ,EAASjC,MAAM,IAAIzlB,EAAQonB,IAAI,OAC5CsB,EAAsBJ,EAAaA,EAAW,GAAGpnB,OAAS,EAChE,IAAI4D,EAAM,GACNqd,EAAQ,EACRwG,EAAY,EAChB,IAAK,IAAI7kB,EAAI4jB,EAASxmB,OAAS,EAAG4C,GAAK,EAAGA,IAAK,CACzB,IAAd6kB,IACA7jB,EAAIsjB,QAAQxe,EAAIuY,IAChBwG,EAAY,EACZxG,EAAQ,GAEZ,MACMyG,GADc5oB,EAAQonB,IAAI9C,QAAQoD,EAAS5jB,KAAO6kB,GACrBxG,EAC7B0G,EAAkBjf,EAAIgf,EAAe,IAG3C,GAFAD,GAAa,EACbxG,EAAQyG,GAAgB,EACpBzG,EAAQ,GAAKwG,EACb,MAAM,IAAIhoB,MAAM,4BAEpBmE,EAAIsjB,QAAQS,EAChB,CAEA/jB,EAAIsjB,QAAQxe,EAAIuY,IACZrd,EAAI5D,OAAS,GAAM,GACnB4D,EAAIsjB,QAAQ,KAEhB,IAAIU,EAAkB,EACtB,IAAK,IAAIhlB,EAAI,EAAGA,EAAIgB,EAAI5D,QACL,MAAX4D,EAAIhB,GADoBA,IAKxBglB,IAGRhkB,EAAMA,EAAIC,MAAM+jB,EAAmBA,EAAkB,GACrD,IAAIC,EAASjkB,EAAIsf,KAAK,IACtB,IAAK,IAAItgB,EAAI,EAAGA,EAAI4kB,EAAqB5kB,IACrCilB,EAAS,KAAKA,IAElB,GAAIjB,EAAW,CACX,MAAMW,EAAoB,EAAZX,EAAgBiB,EAAO7nB,OACrC,IAAK,IAAI4C,EAAI,EAAGA,EAAI2kB,EAAO3kB,GAAK,EAC5BilB,EAAS,KAAKA,GAEtB,CACA,OAAOA,CACX,8BCzI2G/oB,EAAQ,QAAuG,EACvM,EAAQ,KAIR,EAAQ,KAJ3B,MAOMgpB,EAAY,EAAQ,IAC1BhnB,OAAOC,eAAejC,EAAS,KAA/B,CAA+CipB,YAAY,EAAMrkB,IAAK,WAAc,OAAOokB,EAAUpE,UAAY,0CCVjH5iB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgjB,OAAShjB,EAAQ0J,OAAS1J,EAAQkpB,SAAWlpB,EAAQmpB,OAASnpB,EAAQ6F,SAAM,EACpF,MAAMujB,EAAc,EAAQ,KAC5B,SAASvjB,EAAIwjB,GACT,MAAO,GAAGA,IAAS,IAAItG,OAAO,GAAKsG,EAAOnoB,OAAS,GAAK,KAC5D,CAEA,SAASioB,EAAOE,GACZ,OAAOA,EAAOzB,QAAQ,KAAM,IAAIA,QAAQ,MAAO,KAAKA,QAAQ,MAAO,IACvE,CAEA,SAASsB,EAASI,GACd,OAAOzjB,EAAIyjB,GAAW1B,QAAQ,KAAM,KAAKA,QAAQ,KAAM,IAC3D,CAPA5nB,EAAQ6F,IAAMA,EAId7F,EAAQmpB,OAASA,EAIjBnpB,EAAQkpB,SAAWA,EAInBlpB,EAAQ0J,OAHR,SAAgB2f,GACZ,OAAOF,GAAO,EAAIC,EAAYxF,gBAAe,IAAIna,aAAcC,OAAO2f,IAC1E,EAKArpB,EAAQgjB,OAHR,SAAgBsG,GACZ,OAAO,IAAIf,aAAcvF,QAAO,EAAIoG,EAAY7F,aAAa1d,EAAIqjB,EAASI,KAC9E,8BCrBAtnB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQupB,cAAgBvpB,EAAQwpB,qBAAkB,EAClD,MAAMC,EAAc,EAAQ,KAC5BznB,OAAOC,eAAejC,EAAS,kBAAmB,CAAEipB,YAAY,EAAMrkB,IAAK,WAAc,OAAO6kB,EAAYD,eAAiB,IAC7H,MAAMD,EAAgB,CAClBG,OAAQD,EAAYD,iBAExBxpB,EAAQupB,cAAgBA,8BCPxBvnB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQwpB,qBAAkB,EAC1B,MAAMG,EAAS,EAAQ,KACjBvD,EAAW,EAAQ,IACnBwD,EAAO,EAAQ,KACfC,EAAsB,EAAQ,KAC9BC,EAAW,EAAQ,KACnB9E,EAAU,EAAQ,IAExB4E,EAAK/d,MAAMgV,eAAiB,CAAClb,KAAQokB,KACjC,MAAMzlB,EAAIqlB,EAAOnkB,KAAKnE,OAAO+kB,EAASjgB,OAAQR,GAE9C,OADAokB,EAAKvJ,SAAQ9U,GAAOpH,EAAEtB,OAAO0I,KACtBpH,EAAEO,QAAQ,EAErB,MAAM2kB,EACF,sBAAOQ,CAAgBjT,EAAYkT,GAAa,GAQ5C,OAP0B,KAAtBlT,EAAW7V,SACX6V,EAAaA,EAAWhS,MAAM,EAAG,KAEjCgS,EAAW7V,OAAS,KAEpB6V,EAAaA,EAAWxN,SAAS,GAAI,OAElC,EAAIyb,EAAQxc,YAAYohB,EAAKxd,aAAa2K,EAAYkT,GACjE,CACA,eAAOC,CAASC,EAAkBpT,EAAYqT,EAAS,QAEnD,IAAKD,IAAqBpT,EACtB,MAAM,IAAI+S,EAASO,uBAAuB,yDAE9C,MAAMC,EAAeV,EAAK5d,SAASme,EAAkBpT,EAAWhS,MAAM,EAAG,IAAK,CAC1EmY,KAAK,EACLE,WAAW,IAEf,GAAe,QAAXgN,EACA,OAAO,EAAIpF,EAAQxc,YAAY8hB,GACnC,GAAe,SAAXF,EACA,OAAO,EAAIP,EAAoBU,WAAWD,EAAc,SAC5D,MAAM3pB,MAAM,2BAChB,CACA,oBAAO6pB,CAAcC,GAEjB,OAAO,EAAIZ,EAAoBa,WAAWD,EAAe,QAC7D,CACA,iBAAOE,CAAWR,EAAkBS,EAAmBzO,GAEnD,IAAKgO,IAAqBS,IAAsBzO,EAC5C,MAAM,IAAI2N,EAASO,uBAAuB,wEAE9C,OAAOT,EAAK7d,OAAO6e,EAAmBT,EAAkBhO,EAAW,CAAEwB,QAAQ,GACjF,EAEJ3d,EAAQwpB,gBAAkBA,EAC1BA,EAAgBqB,cAAgB,2CCrDhC,IAAIC,EAAa1qB,MAAQA,KAAK0qB,WAAc,SAAUC,EAASC,EAAYje,EAAGke,GAE1E,OAAO,IAAKle,IAAMA,EAAIme,WAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUnpB,GAAS,IAAMopB,EAAKL,EAAUM,KAAKrpB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC1F,SAASyO,EAAStpB,GAAS,IAAMopB,EAAKL,EAAiB,MAAE/oB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC7F,SAASuO,EAAKxgB,GAJlB,IAAe5I,EAIa4I,EAAO2gB,KAAON,EAAQrgB,EAAO5I,QAJ1CA,EAIyD4I,EAAO5I,MAJhDA,aAAiB6K,EAAI7K,EAAQ,IAAI6K,GAAE,SAAUoe,GAAWA,EAAQjpB,EAAQ,KAIjBwpB,KAAKL,EAAWG,EAAW,CAC7GF,GAAML,EAAYA,EAAUU,MAAMZ,EAASC,GAAc,KAAKO,OAClE,GACJ,EACAvpB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ4rB,gBAAkB5rB,EAAQ6rB,gBAAa,EAC/C,MAAMzF,EAAW,EAAQ,IACzB,SAASyF,EAAWC,GAChB,OAAO,EAAI1F,EAASjgB,QAAQ2lB,EAChC,CACA9rB,EAAQ6rB,WAAaA,EA6BrB7rB,EAAQ4rB,gBA5BR,SAAyBE,GACrB,OAAOhB,EAAU1qB,UAAM,OAAQ,GAAQ,YACnC,IAEI,GADkD,oBAAX+E,aAAmD,IAAlBA,OAAOmb,OAClD,CAEzB,MAAMxf,EAAyB,iBAAVgrB,GAAqB,IAAIriB,aAAcC,OAAOoiB,GAASA,EACtE1qB,QAAa+D,OAAOmb,OAAOzb,OAAO,UAAW/D,GACnD,OAAO,IAAIE,WAAWI,EAC1B,CACK,CAED,MAAMoL,EAAa,EAAQ,KAC3B,IAAKA,EAAW+T,WACZ,MAAM,IAAI5f,MAAM,iDAEpB,OAAOuqB,QAAQC,QAAQ3e,EAAW+T,WAAW,UAAUvd,OAAO8oB,GAAOjnB,SACzE,CACJ,CACA,MAAOuX,GAKH,OAJA2P,QAAQpK,IAAIvF,GACZ2P,QAAQpK,IAAI,0LAGLuJ,QAAQC,QAAQU,EAAWC,GACtC,CACJ,GACJ,8BC3CA9pB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQgsB,iBAAc,EACtB,MAAMC,EAAY,EAAQ,KAmC1BjsB,EAAQgsB,YAlCR,SAAqBE,GACjB,GAAqB,iBAAVA,EAAoB,CAE3B,MAAMC,EAAaD,EAAME,MAAM,KAK/B,MAAO,CACHvV,OALWwV,KAAKC,MAAML,EAAUjJ,OAAOmJ,EAAW,KAMlDI,QALYF,KAAKC,MAAML,EAAUjJ,OAAOmJ,EAAW,KAMnDhV,UALcgV,EAAW,GAOjC,CACK,GAAqB,iBAAVD,EAAoB,CAChC,GAA6B,iBAAlBA,EAAMK,QACb,MAAM,IAAI5rB,MAAM,wDAEpB,IAAI4rB,EAAUL,EAAMK,QACK,MAArBL,EAAMK,QAAQ,KACdA,EAAUN,EAAUjJ,OAAOuJ,IAE/B,MAAMC,EAAa,GAKnB,OAJAN,EAAMrV,OAAO5G,KAAKwc,IACd,MAAM5V,EAASwV,KAAKC,MAAML,EAAUjJ,OAAOyJ,IAC3CD,EAAWha,KAAKqE,EAAO,IAEpB,CACHA,OAAQ2V,EACRD,QAASF,KAAKC,MAAMC,GACpBpV,UAAW+U,EAAM/U,UAEzB,CACJ,8BCtBAnV,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ0qB,UAAY1qB,EAAQuqB,eAAY,EAExC,MAAMnB,EAAc,EAAQ,KACtBsD,EAAc,EAAQ,KAC5B,SAASC,EAAaC,GAClB,OAASA,EAAU,EAAK,IAAMA,EAAU,GAAM,EAAI,EAAI,EAC1D,CACA,MAAMC,EAAmB,CACrBC,MAAOH,EAAa,KACpBI,MAAOJ,EAAa,KACpBK,MAAOL,EAAa,MAExB,SAASM,EAAoBC,GACzB,MAAMC,EAAaN,EAAiBK,GACpC,GAAIC,EACA,OAAOA,EAEX,MAAM,IAAIxsB,MAAM,sBAAsBusB,KAC1C,CACA,MAAME,EAAY,IAOlB,SAASC,EAAiBlW,GACtB,GAAIA,aAAqBnW,WACrB,OAAOmW,EAEN,GAAI,iBAAoBA,EACzB,OAAO,EAAIiS,EAAY7F,cAAa,EAAImJ,EAAY7mB,KAAKsR,IAE7D,MAAM,IAAIlW,UAAU,0DACxB,CA6DA,SAASqsB,EAAavnB,EAAKwe,EAAOgJ,GAC9B,IAAIC,EAAU,EACd,KAAOjJ,EAAQiJ,EAAUD,GAAiC,IAAzBxnB,EAAIwe,EAAQiJ,MACvCA,EAMN,OAJkBznB,EAAIwe,EAAQiJ,IAAYJ,KAEpCI,EAECA,CACX,CAXAxtB,EAAQuqB,UA3DR,SAAmBpT,EAAW+V,GAC1B,MAAMO,EAAiBJ,EAAiBlW,GAClCgW,EAAaF,EAAoBC,GAGjCQ,EAAwBP,EAAa,EACrCQ,EAAcF,EAAevsB,OACnC,IAAImG,EAAS,EACb,GAnBoBumB,KAmBhBH,EAAepmB,KACf,MAAM,IAAI1G,MAAM,iCAEpB,IAAIktB,EAAYJ,EAAepmB,KAI/B,GAHkB,MAAdwmB,IACAA,EAAYJ,EAAepmB,MAE3BsmB,EAActmB,EAASwmB,EACvB,MAAM,IAAIltB,MAAM,8BAA8BktB,aAAqBF,EAActmB,gBAErF,GA5BoBymB,IA4BhBL,EAAepmB,KACf,MAAM,IAAI1G,MAAM,yCAEpB,MAAMotB,EAAUN,EAAepmB,KAC/B,GAAIsmB,EAActmB,EAAS,EAAI0mB,EAC3B,MAAM,IAAIptB,MAAM,4BAA4BotB,aAAmBJ,EAActmB,EAAS,gBAE1F,GAAIqmB,EAAwBK,EACxB,MAAM,IAAIptB,MAAM,4BAA4BotB,eAAqBL,oBAErE,MAAMM,EAAU3mB,EAEhB,GADAA,GAAU0mB,EAvCUD,IAwChBL,EAAepmB,KACf,MAAM,IAAI1G,MAAM,yCAEpB,MAAMstB,EAAUR,EAAepmB,KAC/B,GAAIsmB,EAActmB,IAAW4mB,EACzB,MAAM,IAAIttB,MAAM,4BAA4BstB,iBAAuBN,EAActmB,MAErF,GAAIqmB,EAAwBO,EACxB,MAAM,IAAIttB,MAAM,4BAA4BstB,eAAqBP,oBAErE,MAAMQ,EAAU7mB,EAEhB,GADAA,GAAU4mB,EACN5mB,IAAWsmB,EACX,MAAM,IAAIhtB,MAAM,0CAA0CgtB,EAActmB,mBAE5E,MAAM8mB,EAAWhB,EAAaY,EACxBK,EAAWjB,EAAac,EACxBI,EAAM,IAAIrtB,WAAWmtB,EAAWJ,EAAUK,EAAWH,GAC3D,IAAK5mB,EAAS,EAAGA,EAAS8mB,IAAY9mB,EAClCgnB,EAAIhnB,GAAU,EAElBgnB,EAAI9qB,IAAIkqB,EAAejqB,SAASwqB,EAAU1qB,KAAKgrB,KAAKH,EAAU,GAAIH,EAAUD,GAAU1mB,GACtFA,EAAS8lB,EACT,IAAK,MAAMoB,EAAIlnB,EAAQA,EAASknB,EAAIH,IAAY/mB,EAC5CgnB,EAAIhnB,GAAU,EAGlB,OADAgnB,EAAI9qB,IAAIkqB,EAAejqB,SAAS0qB,EAAU5qB,KAAKgrB,KAAKF,EAAU,GAAIF,EAAUD,GAAU5mB,IAC/E,EAAIqlB,EAAYvD,SAAQ,EAAIC,EAAYxF,eAAeyK,GAClE,EA+DAruB,EAAQ0qB,UAlDR,SAAmBvT,EAAW+V,GAC1B/V,EAAYkW,EAAiBlW,GAC7B,MAAMgW,EAAaF,EAAoBC,GACjCO,EAAiBtW,EAAUjW,OACjC,GAAIusB,IAAgC,EAAbN,EACnB,MAAM,IAAIlsB,UAAU,IAAIisB,0BAAyC,EAAbC,kBAA+BM,MAEvF,MAAMU,EAAWb,EAAanW,EAAW,EAAGgW,GACtCiB,EAAWd,EAAanW,EAAWgW,EAAYhW,EAAUjW,QACzD6sB,EAAUZ,EAAagB,EACvBF,EAAUd,EAAaiB,EACvBI,EAAU,EAAQT,EAAU,EAAI,EAAIE,EACpCQ,EAAcD,EAAUpB,EACxBiB,EAAM,IAAIrtB,YAAYytB,EAAc,EAAI,GAAKD,GACnD,IAAInnB,EAAS,EAkCb,OAjCAgnB,EAAIhnB,KAjGgBumB,GAkGhBa,EAGAJ,EAAIhnB,KAAYmnB,GAKhBH,EAAIhnB,KAAY+lB,IAEhBiB,EAAIhnB,KAAsB,IAAVmnB,GAEpBH,EAAIhnB,KA7GgBymB,EA8GpBO,EAAIhnB,KAAY0mB,EACZI,EAAW,GACXE,EAAIhnB,KAAY,EAChBgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS,EAAG2pB,GAAa9lB,GAC3CA,GAAU8lB,IAGVkB,EAAI9qB,IAAI4T,EAAU3T,SAAS2qB,EAAUhB,GAAa9lB,GAClDA,GAAU8lB,EAAagB,GAE3BE,EAAIhnB,KAxHgBymB,EAyHpBO,EAAIhnB,KAAY4mB,EACZG,EAAW,GACXC,EAAIhnB,KAAY,EAChBgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS2pB,GAAa9lB,IAGxCgnB,EAAI9qB,IAAI4T,EAAU3T,SAAS2pB,EAAaiB,GAAW/mB,GAEhDgnB,CACX,4BC1KArsB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQ0uB,kBAAoB1uB,EAAQqqB,4BAAyB,EAC7D,MAAMA,UAA+B1pB,MACjC,WAAA6B,CAAYyD,GACRtD,QACAvC,KAAKyY,KAAO,yBACZzY,KAAK6F,QAAUA,GAAW,EAC9B,EAEJjG,EAAQqqB,uBAAyBA,EACjC,MAAMqE,UAA0B/tB,MAC5B,WAAA6B,CAAYyD,GACRtD,QACAvC,KAAKyY,KAAO,oBACZzY,KAAK6F,QAAUA,GAAW,EAC9B,EAEJjG,EAAQ0uB,kBAAoBA,oCCjB5B,IAAIC,EAAmBvuB,MAAQA,KAAKuuB,kBAAqB3sB,OAAOX,OAAS,SAAUktB,EAAG/T,EAAGlN,EAAGU,QAC7E3I,IAAP2I,IAAkBA,EAAKV,GAC3B,IAAIshB,EAAO5sB,OAAO6sB,yBAAyBrU,EAAGlN,GACzCshB,KAAS,QAASA,GAAQpU,EAAEsU,WAAaF,EAAKG,UAAYH,EAAKzN,gBAClEyN,EAAO,CAAE3F,YAAY,EAAMrkB,IAAK,WAAa,OAAO4V,EAAElN,EAAI,IAE5DtL,OAAOC,eAAessB,EAAGvgB,EAAI4gB,EAChC,EAAI,SAAUL,EAAG/T,EAAGlN,EAAGU,QACT3I,IAAP2I,IAAkBA,EAAKV,GAC3BihB,EAAEvgB,GAAMwM,EAAElN,EACb,GACG0hB,EAAgB5uB,MAAQA,KAAK4uB,cAAiB,SAASxU,EAAGxa,GAC1D,IAAK,IAAImP,KAAKqL,EAAa,YAANrL,GAAoBnN,OAAOmJ,UAAU8jB,eAAe7jB,KAAKpL,EAASmP,IAAIwf,EAAgB3uB,EAASwa,EAAGrL,EAC3H,EACAnN,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtD8sB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAehvB,GACpCgvB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAahvB,GAClCgvB,EAAa,EAAQ,KAAoBhvB,qCCnBzC,IAAI8qB,EAAa1qB,MAAQA,KAAK0qB,WAAc,SAAUC,EAASC,EAAYje,EAAGke,GAE1E,OAAO,IAAKle,IAAMA,EAAIme,WAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUnpB,GAAS,IAAMopB,EAAKL,EAAUM,KAAKrpB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC1F,SAASyO,EAAStpB,GAAS,IAAMopB,EAAKL,EAAiB,MAAE/oB,GAAS,CAAE,MAAO6a,GAAKqO,EAAOrO,EAAI,CAAE,CAC7F,SAASuO,EAAKxgB,GAJlB,IAAe5I,EAIa4I,EAAO2gB,KAAON,EAAQrgB,EAAO5I,QAJ1CA,EAIyD4I,EAAO5I,MAJhDA,aAAiB6K,EAAI7K,EAAQ,IAAI6K,GAAE,SAAUoe,GAAWA,EAAQjpB,EAAQ,KAIjBwpB,KAAKL,EAAWG,EAAW,CAC7GF,GAAML,EAAYA,EAAUU,MAAMZ,EAASC,GAAc,KAAKO,OAClE,GACJ,EACAvpB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQkvB,YAAclvB,EAAQmvB,0BAAuB,EACrD,MAAMlD,EAAY,EAAQ,KACpBmD,EAAkB,EAAQ,KAC1BtF,EAAW,EAAQ,KACnB1D,EAAW,EAAQ,KACzB,SAASiJ,EAAmB9C,EAAS1V,GACjC,MAAMsV,EAAa,GAEbmD,EAAgBrD,EAAUviB,OAAO2iB,KAAKkD,UAAU1Y,IACtDsV,EAAW3Z,KAAK8c,GAEhB,MAAME,EAAiBvD,EAAUviB,OAAO2iB,KAAKkD,UAAUhD,IAKvD,OAJAJ,EAAW3Z,KAAKgd,GAEKrD,EAAW/H,KAAK,IAGzC,CAKApkB,EAAQmvB,qBAJR,SAA8B5C,GAE1B,OAAO8C,EAAmB9C,EADX,CAAEkD,IAAK,MAAOvC,IAAK,SACW,GACjD,EAwDAltB,EAAQkvB,YAtDR,MACI,WAAA1sB,CAAYktB,EAAkBC,GAC1B,IAAMD,IAAoBC,EACtB,MAAM,IAAI7F,EAASO,uBAAuB,oDAE9C,GAAgC,iBAArBqF,EACP,MAAM,IAAI/uB,MAAM,gDAGpB,GADA+uB,EAAmBA,EAAiB/H,eAC/ByH,EAAgB7F,cAAc0F,eAAeS,GAC9C,MAAM,IAAI/uB,MAAM,6BAEpBP,KAAKwvB,UAAY,MACjBxvB,KAAKyvB,aAAeT,EAAgB7F,cAAcmG,GAClDtvB,KAAKuvB,cAAgBA,CACzB,CACA,MAAA9Y,CAAOA,EAAS,CAAC,GACb,MAAMiZ,EAAgB,CAAEL,IAAKrvB,KAAKwvB,UAAW1C,IAAK9sB,KAAKyvB,aAAahF,eACpE,OAAO7oB,OAAOqJ,OAAO,CAAC,EAAGykB,EAAejZ,EAC5C,CACA,IAAA5K,CAAKsgB,EAASwD,GAAW,EAAOC,EAAe,CAAC,GAE5C,MAAMnZ,EAASzW,KAAKyW,OAAOmZ,GAErBC,EAAeZ,EAAmB9C,EAAS1V,GAC3CsT,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAO7vB,KAAK8vB,qBAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,EAC9E,CACA,SAAAgG,CAAU5D,EAASwD,GAAW,EAAOC,EAAe,CAAC,GACjD,OAAOlF,EAAU1qB,UAAM,OAAQ,GAAQ,YAEnC,MAAMyW,EAASzW,KAAKyW,OAAOmZ,GAErBC,EAAeZ,EAAmB9C,EAAS1V,GAC3CsT,QAAyB,EAAI/D,EAASwF,iBAAiBqE,GAC7D,OAAO7vB,KAAK8vB,qBAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,EAC9E,GACJ,CACA,oBAAA+F,CAAqB3D,EAASwD,EAAUlZ,EAAQoZ,EAAc9F,GAE1D,MAAMhT,EAAY/W,KAAKyvB,aAAa3F,SAASC,EAAkB/pB,KAAKuvB,eACpE,OAAII,EACoB,CAChBlZ,OAAQ,CAACoV,EAAUviB,OAAO2iB,KAAKkD,UAAU1Y,KACzC0V,QAASF,KAAKkD,UAAUhD,GACxBpV,UAAW,CAACA,IAKT,CAAC8Y,EAAc9Y,GAAWiN,KAAK,IAE9C,+BCrFJpiB,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,IACtDlC,EAAQowB,mBAAgB,EACxB,MAAMnE,EAAY,EAAQ,KACpBmD,EAAkB,EAAQ,KAC1BtF,EAAW,EAAQ,KACnB1D,EAAW,EAAQ,KAgFzBpmB,EAAQowB,cA/ER,MACI,WAAA5tB,CAAYktB,EAAkBW,GAC1B,IAAMX,IAAoBW,EACtB,MAAM,IAAIvG,EAASO,uBAAuB,mDAE9C,GAAgC,iBAArBqF,EACP,KAAM,+CAGV,GADAA,EAAmBA,EAAiB/H,eAC/ByH,EAAgB7F,cAAc0F,eAAeS,GAC9C,KAAM,4BAEVtvB,KAAKwvB,UAAY,MACjBxvB,KAAKyvB,aAAeT,EAAgB7F,cAAcmG,GAClDtvB,KAAKiwB,aAAeA,CACxB,CACA,MAAAtkB,CAAOmgB,GACH,MAAqB,iBAAVA,EACA9rB,KAAKkwB,cAAcpE,GAAO,GAEX,iBAAVA,GACL9rB,KAAKmwB,eAAerE,GAAO,EAK1C,CACA,WAAAsE,CAAYtE,GACR,MAAqB,iBAAVA,EACA9rB,KAAKkwB,cAAcpE,GAAO,GAEX,iBAAVA,EACL9rB,KAAKmwB,eAAerE,GAAO,GAG3BhB,QAAQC,SAAQ,EAE/B,CACA,aAAAmF,CAAcpE,EAAO/hB,GAEjB,MAAMgiB,EAAaD,EAAME,MAAM,KAEzB6D,EAAe9D,EAAW,GAAK,IAAMA,EAAW,GAChDsE,EAAiBtG,IAEnB,MAAMS,EAAoBxqB,KAAKyvB,aAAarF,cAAc2B,EAAW,IAErE,OAAO/rB,KAAKyvB,aAAalF,WAAWR,EAAkBS,EAAmBxqB,KAAKiwB,aAAa,EAE/F,GAAIlmB,EACA,OAAO,EAAIic,EAASwF,iBAAiBqE,GAAcvE,MAAKvB,GAAoBsG,EAActG,KAEzF,CACD,MAAMA,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAOQ,EAActG,EACzB,CACJ,CACA,cAAAoG,CAAerE,EAAO/hB,GAClB,MAAM8lB,EAAe,CAAC/D,EAAc,OAAE9H,KAAK,KAAM6H,EAAUviB,OAAOwiB,EAAe,UAAI9H,KAAK,KAC1F,IAAIsM,GAAW,EACf,MAAMD,EAAiBtG,IACnB+B,EAAiB,UAAEjc,KAAKkH,IACpB,MAAMyT,EAAoBxqB,KAAKyvB,aAAarF,cAAcrT,GAChC/W,KAAKyvB,aAAalF,WAAWR,EAAkBS,EAAmBxqB,KAAKiwB,gBAE7FK,GAAW,EACf,IAEGA,GAEX,GAAIvmB,EACA,OAAO,EAAIic,EAASwF,iBAAiBqE,GAAcvE,MAAKvB,GAAoBsG,EAActG,KAEzF,CACD,MAAMA,GAAmB,EAAI/D,EAASyF,YAAYoE,GAClD,OAAOQ,EAActG,EACzB,CACJ,6BC1EJ,IAGIwG,EAAiB,4BAGjBC,EAAmB,iBAGnBC,EAAU,qBAEVC,EAAU,mBACVC,EAAU,gBAEVC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBACbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBASZC,EAAU,OAGVC,EAAe,8BAGfC,EAAW,mBAGXC,EAAgB,CAAC,EACrBA,EAAc5B,GAAW4B,EA7CV,kBA8CfA,EAAcd,GAAkBc,EAAcb,GAC9Ca,EAAc3B,GAAW2B,EAAc1B,GACvC0B,EAAcZ,GAAcY,EAAcX,GAC1CW,EAAcV,GAAWU,EAAcT,GACvCS,EAAcR,GAAYQ,EAAcvB,GACxCuB,EAActB,GAAasB,EAAcrB,GACzCqB,EAAcnB,GAAamB,EAAclB,GACzCkB,EAAcjB,GAAaiB,EAAchB,GACzCgB,EAAcP,GAAYO,EAAcN,GACxCM,EAAcL,GAAaK,EAAcJ,IAAa,EACtDI,EArDe,kBAqDWA,EAAczB,GACxCyB,EAAcf,IAAc,EAG5B,IAAIgB,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAO3wB,SAAWA,QAAU,EAAA2wB,EAGhFC,EAA0B,iBAARrtB,MAAoBA,MAAQA,KAAKvD,SAAWA,QAAUuD,KAGxEzF,EAAO4yB,GAAcE,GAAYC,SAAS,cAATA,GAGjCC,EAA4C9yB,IAAYA,EAAQ+yB,UAAY/yB,EAG5EgzB,EAAaF,GAA4C7yB,IAAWA,EAAO8yB,UAAY9yB,EAGvFgzB,EAAgBD,GAAcA,EAAWhzB,UAAY8yB,EAUzD,SAASI,EAAYjjB,EAAKkjB,GAGxB,OADAljB,EAAI1M,IAAI4vB,EAAK,GAAIA,EAAK,IACfljB,CACT,CAUA,SAASmjB,EAAY7vB,EAAKrB,GAGxB,OADAqB,EAAI+N,IAAIpP,GACDqB,CACT,CAsDA,SAAS8vB,EAAYxpB,EAAOypB,EAAUC,EAAaC,GACjD,IAAI9M,GAAS,EACTxlB,EAAS2I,EAAQA,EAAM3I,OAAS,EAKpC,IAHIsyB,GAAatyB,IACfqyB,EAAc1pB,IAAQ6c,MAEfA,EAAQxlB,GACfqyB,EAAcD,EAASC,EAAa1pB,EAAM6c,GAAQA,EAAO7c,GAE3D,OAAO0pB,CACT,CAwCA,SAASE,EAAavxB,GAGpB,IAAI4I,GAAS,EACb,GAAa,MAAT5I,GAA0C,mBAAlBA,EAAMoH,SAChC,IACEwB,KAAY5I,EAAQ,GACtB,CAAE,MAAO6a,GAAI,CAEf,OAAOjS,CACT,CASA,SAAS4oB,EAAWzjB,GAClB,IAAIyW,GAAS,EACT5b,EAAS3B,MAAM8G,EAAIgS,MAKvB,OAHAhS,EAAIuQ,SAAQ,SAASte,EAAOyD,GAC1BmF,IAAS4b,GAAS,CAAC/gB,EAAKzD,EAC1B,IACO4I,CACT,CAUA,SAAS6oB,EAAQC,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,CASA,SAASC,EAAWxwB,GAClB,IAAImjB,GAAS,EACT5b,EAAS3B,MAAM5F,EAAI0e,MAKvB,OAHA1e,EAAIid,SAAQ,SAASte,GACnB4I,IAAS4b,GAASxkB,CACpB,IACO4I,CACT,CAGA,IASMkpB,EATFC,EAAa9qB,MAAMgC,UACnB+oB,EAAYrB,SAAS1nB,UACrBgpB,EAAcnyB,OAAOmJ,UAGrBipB,EAAat0B,EAAK,sBAGlBu0B,GACEL,EAAM,SAASM,KAAKF,GAAcA,EAAWG,MAAQH,EAAWG,KAAKC,UAAY,KACvE,iBAAmBR,EAAO,GAItCS,EAAeP,EAAU5qB,SAGzB2lB,GAAiBkF,EAAYlF,eAO7ByF,GAAiBP,EAAY7qB,SAG7BqrB,GAAaC,OAAO,IACtBH,EAAarpB,KAAK6jB,IAAgBrH,QAzQjB,sBAyQuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5EiN,GAAS5B,EAAgBnzB,EAAK+0B,YAASxvB,EACvCyvB,GAASh1B,EAAKg1B,OACd9zB,GAAalB,EAAKkB,WAClB+zB,GAAepB,EAAQ3xB,OAAOgE,eAAgBhE,QAC9CgzB,GAAehzB,OAAOX,OACtB4zB,GAAuBd,EAAYc,qBACnCC,GAASjB,EAAWiB,OAGpBC,GAAmBnzB,OAAOozB,sBAC1BC,GAAiBR,GAASA,GAAOS,cAAWjwB,EAC5CkwB,GAAa5B,EAAQ3xB,OAAOuyB,KAAMvyB,QAGlC+G,GAAWysB,GAAU11B,EAAM,YAC3B21B,GAAMD,GAAU11B,EAAM,OACtBorB,GAAUsK,GAAU11B,EAAM,WAC1B41B,GAAMF,GAAU11B,EAAM,OACtB6U,GAAU6gB,GAAU11B,EAAM,WAC1B61B,GAAeH,GAAUxzB,OAAQ,UAGjC4zB,GAAqBC,GAAS9sB,IAC9B+sB,GAAgBD,GAASJ,IACzBM,GAAoBF,GAAS3K,IAC7B8K,GAAgBH,GAASH,IACzBO,GAAoBJ,GAASlhB,IAG7BuhB,GAAcpB,GAASA,GAAO3pB,eAAY9F,EAC1C8wB,GAAgBD,GAAcA,GAAYE,aAAU/wB,EASxD,SAAS9C,GAAK8zB,GACZ,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAyFA,SAASC,GAAUH,GACjB,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAuGA,SAASE,GAASJ,GAChB,IAAI3P,GAAS,EACTxlB,EAASm1B,EAAUA,EAAQn1B,OAAS,EAGxC,IADAd,KAAKk2B,UACI5P,EAAQxlB,GAAQ,CACvB,IAAIq1B,EAAQF,EAAQ3P,GACpBtmB,KAAKmD,IAAIgzB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAqFA,SAASG,GAAML,GACbj2B,KAAKu2B,SAAW,IAAIH,GAAUH,EAChC,CAwHA,SAASO,GAAYC,EAAQlxB,EAAKzD,GAChC,IAAI40B,EAAWD,EAAOlxB,GAChBspB,GAAe7jB,KAAKyrB,EAAQlxB,IAAQoxB,GAAGD,EAAU50B,UACxCmD,IAAVnD,GAAyByD,KAAOkxB,KACnCA,EAAOlxB,GAAOzD,EAElB,CAUA,SAAS80B,GAAantB,EAAOlE,GAE3B,IADA,IAAIzE,EAAS2I,EAAM3I,OACZA,KACL,GAAI61B,GAAGltB,EAAM3I,GAAQ,GAAIyE,GACvB,OAAOzE,EAGX,OAAQ,CACV,CA6BA,SAAS+1B,GAAU/0B,EAAOg1B,EAAQC,EAAQC,EAAYzxB,EAAKkxB,EAAQQ,GACjE,IAAIvsB,EAIJ,GAHIssB,IACFtsB,EAAS+rB,EAASO,EAAWl1B,EAAOyD,EAAKkxB,EAAQQ,GAASD,EAAWl1B,SAExDmD,IAAXyF,EACF,OAAOA,EAET,IAAKwsB,GAASp1B,GACZ,OAAOA,EAET,IAAIq1B,EAAQ9U,GAAQvgB,GACpB,GAAIq1B,GAEF,GADAzsB,EA2XJ,SAAwBjB,GACtB,IAAI3I,EAAS2I,EAAM3I,OACf4J,EAASjB,EAAMrH,YAAYtB,GAO/B,OAJIA,GAA6B,iBAAZ2I,EAAM,IAAkBolB,GAAe7jB,KAAKvB,EAAO,WACtEiB,EAAO4b,MAAQ7c,EAAM6c,MACrB5b,EAAOghB,MAAQjiB,EAAMiiB,OAEhBhhB,CACT,CArYa0sB,CAAet1B,IACnBg1B,EACH,OA6ON,SAAmBpV,EAAQjY,GACzB,IAAI6c,GAAS,EACTxlB,EAAS4gB,EAAO5gB,OAGpB,IADA2I,IAAUA,EAAQV,MAAMjI,MACfwlB,EAAQxlB,GACf2I,EAAM6c,GAAS5E,EAAO4E,GAExB,OAAO7c,CACT,CAtPa4tB,CAAUv1B,EAAO4I,OAErB,CACL,IAAI+T,EAAM6Y,GAAOx1B,GACby1B,EAAS9Y,GAAOmS,GAAWnS,GAAOoS,EAEtC,GAAIqE,GAASpzB,GACX,OA0HN,SAAqBW,EAAQq0B,GAC3B,GAAIA,EACF,OAAOr0B,EAAOkC,QAEhB,IAAI+F,EAAS,IAAIjI,EAAOL,YAAYK,EAAO3B,QAE3C,OADA2B,EAAO+0B,KAAK9sB,GACLA,CACT,CAjIa+sB,CAAY31B,EAAOg1B,GAE5B,GAAIrY,GAAOuS,GAAavS,GAAOgS,GAAY8G,IAAWd,EAAS,CAC7D,GAAIpD,EAAavxB,GACf,OAAO20B,EAAS30B,EAAQ,CAAC,EAG3B,GADA4I,EA+XN,SAAyB+rB,GACvB,MAAqC,mBAAtBA,EAAOr0B,aAA8Bs1B,GAAYjB,GAE5D,CAAC,EAxVES,GADWS,EAwVHhD,GAAa8B,IAvVH7B,GAAa+C,GAAS,CAAC,EADlD,IAAoBA,CA0VpB,CAnYeC,CAAgBL,EAAS,CAAC,EAAIz1B,IAClCg1B,EACH,OA6QR,SAAqBpV,EAAQ+U,GAC3B,OAAOoB,GAAWnW,EAAQoW,GAAWpW,GAAS+U,EAChD,CA/QesB,CAAYj2B,EAhD3B,SAAoB20B,EAAQ/U,GAC1B,OAAO+U,GAAUoB,GAAWnW,EAAQyS,GAAKzS,GAAS+U,EACpD,CA8CkCuB,CAAWttB,EAAQ5I,GAEjD,KAAO,CACL,IAAKuwB,EAAc5T,GACjB,OAAOgY,EAAS30B,EAAQ,CAAC,EAE3B4I,EA0YN,SAAwB+rB,EAAQhY,EAAKwZ,EAAWnB,GAC9C,IA5MmBoB,EA4MfC,EAAO1B,EAAOr0B,YAClB,OAAQqc,GACN,KAAK8S,EACH,OAAO6G,GAAiB3B,GAE1B,KAAK/F,EACL,KAAKC,EACH,OAAO,IAAIwH,GAAM1B,GAEnB,KAAKjF,EACH,OA3QN,SAAuBluB,EAAUwzB,GAC/B,IAAIr0B,EAASq0B,EAASsB,GAAiB90B,EAASb,QAAUa,EAASb,OACnE,OAAO,IAAIa,EAASlB,YAAYK,EAAQa,EAASK,WAAYL,EAASmF,WACxE,CAwQa4vB,CAAc5B,EAAQK,GAE/B,KAAKrF,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OA/MN,SAAyBqG,EAAYxB,GACnC,IAAIr0B,EAASq0B,EAASsB,GAAiBE,EAAW71B,QAAU61B,EAAW71B,OACvE,OAAO,IAAI61B,EAAWl2B,YAAYK,EAAQ61B,EAAW30B,WAAY20B,EAAWx3B,OAC9E,CA4May3B,CAAgB9B,EAAQK,GAEjC,KAAKhG,EACH,OArQN,SAAkBjhB,EAAKinB,EAAQmB,GAE7B,OAAOhF,EADK6D,EAASmB,EAAU3E,EAAWzjB,IAAM,GAAQyjB,EAAWzjB,GACzCijB,EAAa,IAAIjjB,EAAIzN,YACjD,CAkQao2B,CAAS/B,EAAQK,EAAQmB,GAElC,KAAKlH,EACL,KAAKK,EACH,OAAO,IAAI+G,EAAK1B,GAElB,KAAKvF,EACH,OAhQN,SAAqBuH,GACnB,IAAI/tB,EAAS,IAAI+tB,EAAOr2B,YAAYq2B,EAAO/W,OAAQwQ,EAAQgC,KAAKuE,IAEhE,OADA/tB,EAAOguB,UAAYD,EAAOC,UACnBhuB,CACT,CA4PaiuB,CAAYlC,GAErB,KAAKtF,EACH,OApPN,SAAkBhuB,EAAK2zB,EAAQmB,GAE7B,OAAOhF,EADK6D,EAASmB,EAAUtE,EAAWxwB,IAAM,GAAQwwB,EAAWxwB,GACzC6vB,EAAa,IAAI7vB,EAAIf,YACjD,CAiPaw2B,CAASnC,EAAQK,EAAQmB,GAElC,KAAK5G,EACH,OA3Oe6G,EA2OIzB,EA1OhBV,GAAgBn0B,OAAOm0B,GAAc/qB,KAAKktB,IAAW,CAAC,EA4O/D,CA5aeW,CAAe/2B,EAAO2c,EAAKoY,GAAWC,EACjD,CACF,CAEAG,IAAUA,EAAQ,IAAIX,IACtB,IAAIwC,EAAU7B,EAAMzyB,IAAI1C,GACxB,GAAIg3B,EACF,OAAOA,EAIT,GAFA7B,EAAM9zB,IAAIrB,EAAO4I,IAEZysB,EACH,IAAI4B,EAAQhC,EAsQhB,SAAoBN,GAClB,OAnOF,SAAwBA,EAAQuC,EAAUC,GACxC,IAAIvuB,EAASsuB,EAASvC,GACtB,OAAOpU,GAAQoU,GAAU/rB,EApwB3B,SAAmBjB,EAAOqR,GAKxB,IAJA,IAAIwL,GAAS,EACTxlB,EAASga,EAAOha,OAChBmG,EAASwC,EAAM3I,SAEVwlB,EAAQxlB,GACf2I,EAAMxC,EAASqf,GAASxL,EAAOwL,GAEjC,OAAO7c,CACT,CA2vBoCyvB,CAAUxuB,EAAQuuB,EAAYxC,GAClE,CAgOS0C,CAAe1C,EAAQtC,GAAM2D,GACtC,CAxQyBsB,CAAWt3B,GAASqyB,GAAKryB,GAUhD,OA5vBF,SAAmB2H,EAAOypB,GAIxB,IAHA,IAAI5M,GAAS,EACTxlB,EAAS2I,EAAQA,EAAM3I,OAAS,IAE3BwlB,EAAQxlB,IAC8B,IAAzCoyB,EAASzpB,EAAM6c,GAAQA,KAK/B,CA0uBE+S,CAAUN,GAASj3B,GAAO,SAASw3B,EAAU/zB,GACvCwzB,IAEFO,EAAWx3B,EADXyD,EAAM+zB,IAIR9C,GAAY9rB,EAAQnF,EAAKsxB,GAAUyC,EAAUxC,EAAQC,EAAQC,EAAYzxB,EAAKzD,EAAOm1B,GACvF,IACOvsB,CACT,CAqGA,SAAS0tB,GAAiBmB,GACxB,IAAI7uB,EAAS,IAAI6uB,EAAYn3B,YAAYm3B,EAAY9wB,YAErD,OADA,IAAI7H,GAAW8J,GAAQvH,IAAI,IAAIvC,GAAW24B,IACnC7uB,CACT,CA6GA,SAASmtB,GAAWnW,EAAQqX,EAAOtC,EAAQO,GACzCP,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAInQ,GAAS,EACTxlB,EAASi4B,EAAMj4B,SAEVwlB,EAAQxlB,GAAQ,CACvB,IAAIyE,EAAMwzB,EAAMzS,GAEZkT,EAAWxC,EACXA,EAAWP,EAAOlxB,GAAMmc,EAAOnc,GAAMA,EAAKkxB,EAAQ/U,QAClDzc,EAEJuxB,GAAYC,EAAQlxB,OAAkBN,IAAbu0B,EAAyB9X,EAAOnc,GAAOi0B,EAClE,CACA,OAAO/C,CACT,CAiCA,SAASgD,GAAW5pB,EAAKtK,GACvB,IAqKiBzD,EACb43B,EAtKA72B,EAAOgN,EAAI0mB,SACf,OAsKgB,WADZmD,SADa53B,EApKAyD,KAsKmB,UAARm0B,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV53B,EACU,OAAVA,GAvKDe,EAAmB,iBAAP0C,EAAkB,SAAW,QACzC1C,EAAKgN,GACX,CAUA,SAASulB,GAAUqB,EAAQlxB,GACzB,IAAIzD,EAj8BN,SAAkB20B,EAAQlxB,GACxB,OAAiB,MAAVkxB,OAAiBxxB,EAAYwxB,EAAOlxB,EAC7C,CA+7Bco0B,CAASlD,EAAQlxB,GAC7B,OAvOF,SAAsBzD,GACpB,SAAKo1B,GAASp1B,KAyYE0xB,EAzYiB1xB,EA0YxBmyB,GAAeA,KAAcT,MAvYvBoG,GAAW93B,IAAUuxB,EAAavxB,GAAUyyB,GAAapC,GACzD0H,KAAKpE,GAAS3zB,IAqY/B,IAAkB0xB,CApYlB,CAiOSsG,CAAah4B,GAASA,OAAQmD,CACvC,CA9tBA9C,GAAK4I,UAAUmrB,MAnEf,WACEl2B,KAAKu2B,SAAWhB,GAAeA,GAAa,MAAQ,CAAC,CACvD,EAkEApzB,GAAK4I,UAAkB,OAtDvB,SAAoBxF,GAClB,OAAOvF,KAAK+5B,IAAIx0B,WAAevF,KAAKu2B,SAAShxB,EAC/C,EAqDApD,GAAK4I,UAAUvG,IA1Cf,SAAiBe,GACf,IAAI1C,EAAO7C,KAAKu2B,SAChB,GAAIhB,GAAc,CAChB,IAAI7qB,EAAS7H,EAAK0C,GAClB,OAAOmF,IAAW6lB,OAAiBtrB,EAAYyF,CACjD,CACA,OAAOmkB,GAAe7jB,KAAKnI,EAAM0C,GAAO1C,EAAK0C,QAAON,CACtD,EAoCA9C,GAAK4I,UAAUgvB,IAzBf,SAAiBx0B,GACf,IAAI1C,EAAO7C,KAAKu2B,SAChB,OAAOhB,QAA6BtwB,IAAdpC,EAAK0C,GAAqBspB,GAAe7jB,KAAKnI,EAAM0C,EAC5E,EAuBApD,GAAK4I,UAAU5H,IAXf,SAAiBoC,EAAKzD,GAGpB,OAFW9B,KAAKu2B,SACXhxB,GAAQgwB,SAA0BtwB,IAAVnD,EAAuByuB,EAAiBzuB,EAC9D9B,IACT,EAmHAo2B,GAAUrrB,UAAUmrB,MAjFpB,WACEl2B,KAAKu2B,SAAW,EAClB,EAgFAH,GAAUrrB,UAAkB,OArE5B,SAAyBxF,GACvB,IAAI1C,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAE/B,QAAI+gB,EAAQ,IAIRA,GADYzjB,EAAK/B,OAAS,EAE5B+B,EAAKm3B,MAELlF,GAAO9pB,KAAKnI,EAAMyjB,EAAO,GAEpB,GACT,EAwDA8P,GAAUrrB,UAAUvG,IA7CpB,SAAsBe,GACpB,IAAI1C,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAE/B,OAAO+gB,EAAQ,OAAIrhB,EAAYpC,EAAKyjB,GAAO,EAC7C,EAyCA8P,GAAUrrB,UAAUgvB,IA9BpB,SAAsBx0B,GACpB,OAAOqxB,GAAa52B,KAAKu2B,SAAUhxB,IAAQ,CAC7C,EA6BA6wB,GAAUrrB,UAAU5H,IAjBpB,SAAsBoC,EAAKzD,GACzB,IAAIe,EAAO7C,KAAKu2B,SACZjQ,EAAQsQ,GAAa/zB,EAAM0C,GAO/B,OALI+gB,EAAQ,EACVzjB,EAAKuP,KAAK,CAAC7M,EAAKzD,IAEhBe,EAAKyjB,GAAO,GAAKxkB,EAEZ9B,IACT,EAiGAq2B,GAAStrB,UAAUmrB,MA/DnB,WACEl2B,KAAKu2B,SAAW,CACd,KAAQ,IAAIp0B,GACZ,IAAO,IAAKkzB,IAAOe,IACnB,OAAU,IAAIj0B,GAElB,EA0DAk0B,GAAStrB,UAAkB,OA/C3B,SAAwBxF,GACtB,OAAOk0B,GAAWz5B,KAAMuF,GAAa,OAAEA,EACzC,EA8CA8wB,GAAStrB,UAAUvG,IAnCnB,SAAqBe,GACnB,OAAOk0B,GAAWz5B,KAAMuF,GAAKf,IAAIe,EACnC,EAkCA8wB,GAAStrB,UAAUgvB,IAvBnB,SAAqBx0B,GACnB,OAAOk0B,GAAWz5B,KAAMuF,GAAKw0B,IAAIx0B,EACnC,EAsBA8wB,GAAStrB,UAAU5H,IAVnB,SAAqBoC,EAAKzD,GAExB,OADA23B,GAAWz5B,KAAMuF,GAAKpC,IAAIoC,EAAKzD,GACxB9B,IACT,EA+FAs2B,GAAMvrB,UAAUmrB,MApEhB,WACEl2B,KAAKu2B,SAAW,IAAIH,EACtB,EAmEAE,GAAMvrB,UAAkB,OAxDxB,SAAqBxF,GACnB,OAAOvF,KAAKu2B,SAAiB,OAAEhxB,EACjC,EAuDA+wB,GAAMvrB,UAAUvG,IA5ChB,SAAkBe,GAChB,OAAOvF,KAAKu2B,SAAS/xB,IAAIe,EAC3B,EA2CA+wB,GAAMvrB,UAAUgvB,IAhChB,SAAkBx0B,GAChB,OAAOvF,KAAKu2B,SAASwD,IAAIx0B,EAC3B,EA+BA+wB,GAAMvrB,UAAU5H,IAnBhB,SAAkBoC,EAAKzD,GACrB,IAAIm4B,EAAQj6B,KAAKu2B,SACjB,GAAI0D,aAAiB7D,GAAW,CAC9B,IAAI8D,EAAQD,EAAM1D,SAClB,IAAKlB,IAAQ6E,EAAMp5B,OAASq5B,IAE1B,OADAD,EAAM9nB,KAAK,CAAC7M,EAAKzD,IACV9B,KAETi6B,EAAQj6B,KAAKu2B,SAAW,IAAIF,GAAS6D,EACvC,CAEA,OADAD,EAAM92B,IAAIoC,EAAKzD,GACR9B,IACT,EAgcA,IAAI83B,GAAa/C,GAAmBxB,EAAQwB,GAAkBnzB,QAyhB9D,WACE,MAAO,EACT,EAlhBI01B,GAtQJ,SAAoBx1B,GAClB,OAAOwyB,GAAetpB,KAAKlJ,EAC7B,EAwXA,SAASs4B,GAAQt4B,EAAOhB,GAEtB,SADAA,EAAmB,MAAVA,EAAiB0vB,EAAmB1vB,KAE1B,iBAATgB,GAAqBswB,EAASyH,KAAK/3B,KAC1CA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQhB,CAC7C,CAkCA,SAAS42B,GAAY51B,GACnB,IAAIq2B,EAAOr2B,GAASA,EAAMM,YAG1B,OAAON,KAFqB,mBAARq2B,GAAsBA,EAAKptB,WAAcgpB,EAG/D,CASA,SAAS0B,GAASjC,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOa,EAAarpB,KAAKwoB,EAC3B,CAAE,MAAO7W,GAAI,CACb,IACE,OAAQ6W,EAAO,EACjB,CAAE,MAAO7W,GAAI,CACf,CACA,MAAO,EACT,CAwDA,SAASga,GAAG70B,EAAO4M,GACjB,OAAO5M,IAAU4M,GAAU5M,GAAUA,GAAS4M,GAAUA,CAC1D,EAzOK/F,IAAY2uB,GAAO,IAAI3uB,GAAS,IAAIwZ,YAAY,MAAQqP,GACxD6D,IAAOiC,GAAO,IAAIjC,KAAQvE,GAC1BhG,IAAWwM,GAAOxM,GAAQC,YAAckG,GACxCqE,IAAOgC,GAAO,IAAIhC,KAAQnE,GAC1B5c,IAAW+iB,GAAO,IAAI/iB,KAAY+c,KACrCgG,GAAS,SAASx1B,GAChB,IAAI4I,EAAS4pB,GAAetpB,KAAKlJ,GAC7Bq2B,EAAOztB,GAAUsmB,EAAYlvB,EAAMM,iBAAc6C,EACjDo1B,EAAalC,EAAO1C,GAAS0C,QAAQlzB,EAEzC,GAAIo1B,EACF,OAAQA,GACN,KAAK7E,GAAoB,OAAOhE,EAChC,KAAKkE,GAAe,OAAO5E,EAC3B,KAAK6E,GAAmB,OAAO1E,EAC/B,KAAK2E,GAAe,OAAOzE,EAC3B,KAAK0E,GAAmB,OAAOvE,EAGnC,OAAO5mB,CACT,GAsQF,IAAI2X,GAAUtZ,MAAMsZ,QA2BpB,SAASiY,GAAYx4B,GACnB,OAAgB,MAATA,GAqGT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAAS0uB,CAC7C,CAxG0B+J,CAASz4B,EAAMhB,UAAY84B,GAAW93B,EAChE,CAgDA,IAAIozB,GAAWD,IAsLf,WACE,OAAO,CACT,EArKA,SAAS2E,GAAW93B,GAGlB,IAAI2c,EAAMyY,GAASp1B,GAASwyB,GAAetpB,KAAKlJ,GAAS,GACzD,OAAO2c,GAAOmS,GAAWnS,GAAOoS,CAClC,CA0DA,SAASqG,GAASp1B,GAChB,IAAI43B,SAAc53B,EAClB,QAASA,IAAkB,UAAR43B,GAA4B,YAARA,EACzC,CA0DA,SAASvF,GAAKsC,GACZ,OAAO6D,GAAY7D,GAn7BrB,SAAuB30B,EAAO04B,GAG5B,IAAI9vB,EAAU2X,GAAQvgB,IAsrBxB,SAAqBA,GAEnB,OAmFF,SAA2BA,GACzB,OAmIF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CArIS24B,CAAa34B,IAAUw4B,GAAYx4B,EAC5C,CArFS44B,CAAkB54B,IAAU+sB,GAAe7jB,KAAKlJ,EAAO,aAC1D+yB,GAAqB7pB,KAAKlJ,EAAO,WAAawyB,GAAetpB,KAAKlJ,IAAU2uB,EAClF,CA1rBkCkK,CAAY74B,GAljB9C,SAAmB1B,EAAG8yB,GAIpB,IAHA,IAAI5M,GAAS,EACT5b,EAAS3B,MAAM3I,KAEVkmB,EAAQlmB,GACfsK,EAAO4b,GAAS4M,EAAS5M,GAE3B,OAAO5b,CACT,CA2iBMkwB,CAAU94B,EAAMhB,OAAQ+5B,QACxB,GAEA/5B,EAAS4J,EAAO5J,OAChBg6B,IAAgBh6B,EAEpB,IAAK,IAAIyE,KAAOzD,GACT04B,IAAa3L,GAAe7jB,KAAKlJ,EAAOyD,IACvCu1B,IAAuB,UAAPv1B,GAAmB60B,GAAQ70B,EAAKzE,KACpD4J,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CAk6B+BqwB,CAActE,GAtuB7C,SAAkBA,GAChB,IAAKiB,GAAYjB,GACf,OAAOtB,GAAWsB,GAEpB,IAAI/rB,EAAS,GACb,IAAK,IAAInF,KAAO3D,OAAO60B,GACjB5H,GAAe7jB,KAAKyrB,EAAQlxB,IAAe,eAAPA,GACtCmF,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CA2tBuDswB,CAASvE,EAChE,CAyCA52B,EAAOD,QA9VP,SAAmBkC,GACjB,OAAO+0B,GAAU/0B,GAAO,GAAM,EAChC,WCt3CA,IAOIm5B,EACAC,EARA73B,EAAUxD,EAAOD,QAAU,CAAC,EAUhC,SAASu7B,IACL,MAAM,IAAI56B,MAAM,kCACpB,CACA,SAAS66B,IACL,MAAM,IAAI76B,MAAM,oCACpB,CAqBA,SAAS86B,EAAWC,GAChB,GAAIL,IAAqBM,WAErB,OAAOA,WAAWD,EAAK,GAG3B,IAAKL,IAAqBE,IAAqBF,IAAqBM,WAEhE,OADAN,EAAmBM,WACZA,WAAWD,EAAK,GAE3B,IAEI,OAAOL,EAAiBK,EAAK,EACjC,CAAE,MAAM3e,GACJ,IAEI,OAAOse,EAAiBjwB,KAAK,KAAMswB,EAAK,EAC5C,CAAE,MAAM3e,GAEJ,OAAOse,EAAiBjwB,KAAKhL,KAAMs7B,EAAK,EAC5C,CACJ,CAGJ,EA5CC,WACG,IAEQL,EADsB,mBAAfM,WACYA,WAEAJ,CAE3B,CAAE,MAAOxe,GACLse,EAAmBE,CACvB,CACA,IAEQD,EADwB,mBAAjBM,aACcA,aAEAJ,CAE7B,CAAE,MAAOze,GACLue,EAAqBE,CACzB,CACJ,CAnBA,GAwEA,IAEIK,EAFAC,EAAQ,GACRC,GAAW,EAEXC,GAAc,EAElB,SAASC,IACAF,GAAaF,IAGlBE,GAAW,EACPF,EAAa36B,OACb46B,EAAQD,EAAaK,OAAOJ,GAE5BE,GAAc,EAEdF,EAAM56B,QACNi7B,IAER,CAEA,SAASA,IACL,IAAIJ,EAAJ,CAGA,IAAIK,EAAUX,EAAWQ,GACzBF,GAAW,EAGX,IADA,IAAI54B,EAAM24B,EAAM56B,OACViC,GAAK,CAGP,IAFA04B,EAAeC,EACfA,EAAQ,KACCE,EAAa74B,GACd04B,GACAA,EAAaG,GAAYK,MAGjCL,GAAc,EACd74B,EAAM24B,EAAM56B,MAChB,CACA26B,EAAe,KACfE,GAAW,EAnEf,SAAyBO,GACrB,GAAIhB,IAAuBM,aAEvB,OAAOA,aAAaU,GAGxB,IAAKhB,IAAuBE,IAAwBF,IAAuBM,aAEvE,OADAN,EAAqBM,aACdA,aAAaU,GAExB,IAEI,OAAOhB,EAAmBgB,EAC9B,CAAE,MAAOvf,GACL,IAEI,OAAOue,EAAmBlwB,KAAK,KAAMkxB,EACzC,CAAE,MAAOvf,GAGL,OAAOue,EAAmBlwB,KAAKhL,KAAMk8B,EACzC,CACJ,CAIJ,CA0CIC,CAAgBH,EAlBhB,CAmBJ,CAgBA,SAASI,EAAKd,EAAK7xB,GACfzJ,KAAKs7B,IAAMA,EACXt7B,KAAKyJ,MAAQA,CACjB,CAWA,SAAS4yB,IAAQ,CA5BjBh5B,EAAQ6E,SAAW,SAAUozB,GACzB,IAAIgB,EAAO,IAAIvzB,MAAMwzB,UAAUz7B,OAAS,GACxC,GAAIy7B,UAAUz7B,OAAS,EACnB,IAAK,IAAI4C,EAAI,EAAGA,EAAI64B,UAAUz7B,OAAQ4C,IAClC44B,EAAK54B,EAAI,GAAK64B,UAAU74B,GAGhCg4B,EAAMtpB,KAAK,IAAIgqB,EAAKd,EAAKgB,IACJ,IAAjBZ,EAAM56B,QAAiB66B,GACvBN,EAAWU,EAEnB,EAOAK,EAAKrxB,UAAUkxB,IAAM,WACjBj8B,KAAKs7B,IAAI/P,MAAM,KAAMvrB,KAAKyJ,MAC9B,EACApG,EAAQm5B,MAAQ,UAChBn5B,EAAQo5B,SAAU,EAClBp5B,EAAQq5B,IAAM,CAAC,EACfr5B,EAAQs5B,KAAO,GACft5B,EAAQ8hB,QAAU,GAClB9hB,EAAQohB,SAAW,CAAC,EAIpBphB,EAAQu5B,GAAKP,EACbh5B,EAAQw5B,YAAcR,EACtBh5B,EAAQy5B,KAAOT,EACfh5B,EAAQ05B,IAAMV,EACdh5B,EAAQ25B,eAAiBX,EACzBh5B,EAAQ45B,mBAAqBZ,EAC7Bh5B,EAAQ65B,KAAOb,EACfh5B,EAAQ85B,gBAAkBd,EAC1Bh5B,EAAQ+5B,oBAAsBf,EAE9Bh5B,EAAQg6B,UAAY,SAAU5kB,GAAQ,MAAO,EAAG,EAEhDpV,EAAQi6B,QAAU,SAAU7kB,GACxB,MAAM,IAAIlY,MAAM,mCACpB,EAEA8C,EAAQk6B,IAAM,WAAc,MAAO,GAAI,EACvCl6B,EAAQm6B,MAAQ,SAAUC,GACtB,MAAM,IAAIl9B,MAAM,iCACpB,EACA8C,EAAQq6B,MAAQ,WAAa,OAAO,CAAG,iBCvLvC79B,EAAOD,QAAU,EAAjB,qBCUA,WACE,IAAIF,EAAO,CAAC,EAGZ,GADAA,EAAKqK,MAA0C,EAAQ,KAC7B,iBAAfrK,EAAKqK,MACd,MAAM,IAAIxJ,MAAM,8DAElB,IAAIwJ,EAAQrK,EAAKqK,MAEjB,SAAS4zB,EAAQC,EAAQ1sB,GACvB,IAAKA,GAAsB,iBAARA,EACjB,OAAO0sB,EAIT,IAFA,IAAIzJ,EAAOvyB,OAAOuyB,KAAKjjB,GACnBxN,EAAIywB,EAAKrzB,OACN4C,KACLk6B,EAAOzJ,EAAKzwB,IAAMwN,EAAIijB,EAAKzwB,IAE7B,OAAOk6B,CACT,CAEA,SAASC,IACP,IAAIC,EAAM,CAAC,EACPxB,EAAOvzB,MAAMgC,UAAUpG,MAAMqG,KAAKuxB,WAClCpI,EAAO,KACPzwB,EAAI,KAWR,OATA44B,EAAKlc,SAAQ,SAAUsT,GACrB,GAAIA,GAAOA,EAAItxB,cAAgBR,OAG7B,IAFAuyB,EAAOvyB,OAAOuyB,KAAKT,GACnBhwB,EAAIywB,EAAKrzB,OACF4C,KACLo6B,EAAI3J,EAAKzwB,IAAMgwB,EAAIS,EAAKzwB,GAG9B,IACOo6B,CACT,CAQA,SAASC,IACP/9B,KAAKg+B,OAAS,CAAC,EAEfh+B,KAAKi+B,OAAS,SAAUD,GACtB,OAAOL,EAAQ39B,KAAKg+B,OAAQA,EAC9B,EAEAh+B,KAAKk+B,MAAQ,WACXl+B,KAAKg+B,OAAS,CAAC,CACjB,EAEAh+B,KAAKm+B,OAAS,SAAUC,GACjBC,EAAQ50B,MAAM20B,KACjBA,EAAS,CAACA,IAEZA,EAAOhe,SAAQ,SAAUke,UAChBt+B,KAAKg+B,OAAOM,EACrB,GAAGt+B,KACL,CACF,CAMA,SAASu+B,EAAWC,EAAQR,GAC1B,IAAIS,EAAS,CAAC,KAId,GAFAz+B,KAAK0+B,QAAUF,EACfx+B,KAAK2+B,QAAU,CAAC,EACF,MAAVX,EACF,IAAK,IAAIz4B,KAAOy4B,EACVp8B,OAAOmJ,UAAU8jB,eAAe7jB,KAAKgzB,EAAQz4B,KAC/CvF,KAAK2+B,QAAQ,IAAMp5B,GAAOy4B,EAAOz4B,IAKvCvF,KAAK4+B,UAAY,WACf,OAAOH,EAAO39B,MAChB,EAEAd,KAAK6+B,WAAa,WAEhB,OAAOJ,EAAO5uB,KAAI,SAAUnM,GAAK,OAAOA,EAAE8jB,QAAQ,OAAQ,OAA6B,IACpFxD,KAAK,KAAKwD,QAAQ,8BAA+B,IAEtD,EAEAxnB,KAAK8+B,cAAgB,SAAUrmB,GAE7B,OADAgmB,EAAOrsB,KAAK,wBAA0BynB,KAAKphB,GAAQA,EAAO,KAAOA,EAAO,MACjEzY,IACT,EAEAA,KAAK++B,aAAe,SAAUr7B,GAE5B,OADA+6B,EAAOrsB,KAAK,IAAM1O,EAAI,KACf1D,IACT,EAEAA,KAAKg/B,MAAQ,WAEX,OADAP,EAAOzE,MACAh6B,IACT,CACF,CAGA,IAAIq+B,EAAU,CACZY,SAAU,SAAUC,GAClB,MAA0B,mBAAZA,CAChB,EACArc,OAAQ,SAAUqc,GAChB,MAA0B,iBAAZA,CAChB,EACA/+B,OAAQ,SAAU++B,GAChB,MAA0B,iBAAZA,IAAyBp1B,MAAMo1B,EAC/C,EACAC,QAAS,SAAUD,GACjB,MAA0B,iBAAZA,GAAwBA,EAAU,GAAM,CACxD,EACAE,IAAK,SAAUF,GACb,MAA0B,iBAAZA,GAAwBp1B,MAAMo1B,EAC9C,EACAG,QAAS,SAAUH,GACjB,MAA0B,kBAAZA,CAChB,EACAI,KAAM,SAAUJ,GACd,OAAmB,OAAZA,CACT,EACAK,KAAM,SAAUL,GACd,OAAkB,MAAXA,GAAmBA,aAAmB90B,IAC/C,EACAqsB,OAAQ,SAAUyI,GAChB,MAA0B,iBAAZA,GAAmC,MAAXA,GAAmBA,EAAQ98B,cAAgB2G,KACnF,EACAU,MAAO,SAAUy1B,GACf,OAAkB,MAAXA,GAAmBA,EAAQ98B,cAAgB2G,KACpD,EACAy2B,IAAK,WACH,OAAO,CACT,GAGF,SAASC,EAAY/F,EAAMgG,GACzB,MAAoB,mBAAThG,EACFgG,aAAqBhG,EAGvB2E,EADP3E,EAAOA,KAAQ2E,EAAU3E,EAAO,OACXgG,EACvB,CAWA,SAASC,EAAWz5B,EAAGpE,GAIrB,IAHA,IAAI89B,EAAU,GACVl8B,EAAIwC,EAAEge,QAAQpiB,IAEJ,IAAP4B,GACLk8B,EAAQxtB,KAAK1O,GACbA,EAAIwC,EAAEge,QAAQpiB,EAAO4B,EAAI,GAE3B,OAAOk8B,CACT,CAMA,IAAIC,EAAW,CACbC,KAAM,KACNC,IAAK,sqCACL,YAAa,wEACbR,KAAM,sBACNS,aAAc,kEACdC,KAAM,wBACNC,MAAO,kBAiBPC,MAAO,IAAI3L,OAAO,+1RAGlB4L,QAAS,WACTjB,QAAS,cACTkB,QAAS,uBACTC,MAAO,YACPC,aAAc,eACdC,UAAW,iBACXC,WAAY,0BACZC,YAAa,YACbC,YAAa,YACbC,OAAQ,wEAKNC,EAAsB,CACxBC,SAAU,SAAUtC,EAAQkB,IAGd,KAFyB,kBAApBlB,EAAOsC,SAAyBtC,EAAOsC,SAAgC,SAApBtC,EAAOsC,gBAKlD,IAAdpB,GACT1/B,KAAK+gC,OAAO,8BAA+B,KAAM,WAErD,EACArH,KAAM,SAAU8E,EAAQkB,GAEtB,QAAyB,IAAdA,IAAqD,iBAAhBlB,EAAO9E,MAAuB8E,EAAO9E,gBAAgB3wB,OAAiC,mBAAhBy1B,EAAO9E,MAA7H,CAGA,IAAIsH,EAAQ3C,EAAQ50B,MAAM+0B,EAAO9E,MAAQ8E,EAAO9E,KAAO,CAAC8E,EAAO9E,MAC7CsH,EAAMC,MAAK,SAAUvH,GACrC,OAAO+F,EAAY/F,EAAMgG,EAC3B,MAEEsB,EAAQA,EAAMnxB,KAAI,SAAU8O,GAAK,MAAoB,mBAANA,EAAmB,kBAAoBA,EAAElG,KAAOkG,CAAG,IAClG3e,KAAK+gC,OAAO,WAAaC,EAAMhd,KAAK,QAAU,YAvFpD,SAAmB0b,GACjB,IAAK,IAAIh8B,KAAK26B,EACZ,GAAIoB,EAAY/7B,EAAGg8B,GACjB,MAAU,QAANh8B,GAAsB,WAANA,GAAkBg8B,EAAUt9B,cAAgBR,OACzD,kBAAoB89B,EAAUt9B,YAAYqW,KADiC/U,CAIxF,CAgFkEw9B,CAAUxB,GAAY,KAAM,QAP1F,CASF,EACAyB,WAAY,SAAU3C,EAAQkB,GAE5B,GADiC,iBAAtBlB,EAAO2C,aAA2B3C,EAAO2C,WAAoC,SAAtB3C,EAAO2C,YACxC,kBAAtB3C,EAAO2C,aAAkD,IAAtB3C,EAAO2C,aAA0B9C,EAAQ50B,MAAMi2B,IAAmC,iBAAdA,GAIlH,IADA,IAAI0B,EAAW,GACN19B,EAAI,EAAGA,EAAIg8B,EAAU5+B,OAAQ4C,IACpC,KAAI09B,EAASld,QAAQwb,EAAUh8B,KAAO,GAAtC,CAGA,IAAIk8B,EAAUD,EAAWD,EAAWA,EAAUh8B,IAC1Ck8B,EAAQ9+B,OAAS,IACnBsgC,EAAShvB,KAAKstB,EAAUh8B,IACxB1D,KAAK+gC,OAAO,cAAgBrB,EAAUh8B,GAAK,gCAAkCk8B,EAAQ5b,KAAK,MAAQ,IAAK,KAAM,cAJ/G,CAOJ,EACAqd,QAAS,SAAU7C,EAAQkB,GACzB,IACI4B,EAAS9C,EAAO6C,QACpB,GAAyB,iBAAd3B,EAAX,CAGA,IAAI6B,GAAU,EACTlD,EAAQ50B,MAAM63B,KACjBA,EAAS,CAACA,IAEZA,EAAOlhB,SAAQ,SAAUohB,GACF,iBAAVA,GAAsBA,KAAS3B,IACxC2B,EAAQ3B,EAAS2B,IAEfA,aAAiBhN,QACfgN,EAAM3H,KAAK6F,KACb6B,GAAU,EAGhB,IACKA,GAnBMvhC,KAoBJ+gC,OAAO,eAAiBO,EAAOtd,KAAK,QAAU,uBAAyB0b,EAAY,IAAK,KAAM,UAhBrG,CAkBF,EACA+B,UAAW,SAAUjD,EAAQkB,GACM,SAA7B7E,OAAO2D,EAAOiD,YAAyB/B,aAAqBt1B,MAAQN,MAAM41B,EAAUgC,YACtF1hC,KAAK+gC,OAAO,uBAAwB,KAAM,YAE9C,EACArZ,UAAW,SAAU8W,EAAQkB,GAC3B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIhY,EAAYrnB,OAAOm+B,EAAO9W,WAC1B5d,MAAM4d,IAGNgY,EAAU5+B,OAAS4mB,GACrB1nB,KAAK+gC,OAAO,uBAAyBrZ,EAAY,yBAA2BgY,EAAU5+B,OAAQ,KAAM,YANtG,CAQF,EACA6gC,UAAW,SAAUnD,EAAQkB,GAC3B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIiC,EAAYthC,OAAOm+B,EAAOmD,WAC1B73B,MAAM63B,IAGNjC,EAAU5+B,OAAS6gC,GACrB3hC,KAAK+gC,OAAO,wBAA0BY,EAAY,yBAA2BjC,EAAU5+B,OAAQ,KAAM,YANvG,CAQF,EACA8gC,YAAa,SAAUpD,EAAQkB,GAC7B,GAAyB,iBAAdA,GAA2BrB,EAAQ50B,MAAMi2B,GAApD,CAGA,IAAIkC,EAAcvhC,OAAOm+B,EAAOoD,aAC5B93B,MAAM83B,IAGNlC,EAAU5+B,SAAW8gC,GACvB5hC,KAAK+gC,OAAO,qBAAuBa,EAAc,0BAA4BlC,EAAU5+B,OAAQ,KAAM,cANvG,CAQF,EACA+gC,GAAI,SAAUrD,EAAQkB,GACpB,IAAIoC,EAAQzhC,OAAOm+B,EAAOqD,IACD,iBAAdnC,GAA0B51B,MAAMg4B,IAGvCpC,GAAaoC,GACf9hC,KAAK+gC,OAAO,qBAAuBe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,KAE9F,EACAqC,IAAK,SAAUvD,EAAQkB,GACrB,IAAIoC,EAAQzhC,OAAOm+B,EAAOuD,KACD,iBAAdrC,GAA0B51B,MAAMg4B,IAGvCpC,EAAYoC,GACd9hC,KAAK+gC,OAAO,iCAAmCe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,MAE1G,EACAsC,GAAI,SAAUxD,EAAQkB,GACpB,IAAIoC,EAAQzhC,OAAOm+B,EAAOwD,IACD,iBAAdtC,GAA0B51B,MAAMg4B,IAGvCpC,GAAaoC,GACf9hC,KAAK+gC,OAAO,wBAA0Be,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,KAEjG,EACAuC,IAAK,SAAUzD,EAAQkB,GACrB,IAAIoC,EAAQzhC,OAAOm+B,EAAOyD,KACD,iBAAdvC,GAA0B51B,MAAMg4B,IAGvCpC,EAAYoC,GACd9hC,KAAK+gC,OAAO,oCAAsCe,EAAQ,sBAAwBpC,EAAY,IAAK,KAAM,MAE7G,EACA/I,GAAI,SAAU6H,EAAQkB,GACpB,GAAyB,iBAAdA,GAA+C,iBAAdA,GAA+C,kBAAdA,EAA7E,CAGA,IAAIoC,EAAQtD,EAAO7H,GACnB,GAAqB,iBAAVmL,GAAuC,iBAAVA,GAAuC,kBAAVA,GAAwBzD,EAAQ50B,MAAMq4B,GAG3G,GAAIzD,EAAQ50B,MAAMq4B,GAAQ,CACxB,IAAK,IAAIp+B,EAAI,EAAGA,EAAIo+B,EAAMhhC,OAAQ4C,IAChC,GAAIg8B,IAAcoC,EAAMp+B,GACtB,OAGJ1D,KAAK+gC,OAAO,qBAAuBe,EAAMjyB,KAAI,SAAU1L,GACrD,MAAO,IAAMA,EAAI,GACnB,IAAG6f,KAAK,QAAU,uBAAyB0b,EAAY,IAAK,KAAM,KACpE,MACMA,IAAcoC,GAChB9hC,KAAK+gC,OAAO,qBAAuBe,EAAQ,uBAAyBpC,EAAY,IAAK,KAAM,KAhB/F,CAmBF,EACAwC,GAAI,SAAU1D,EAAQkB,GACpB,GAAyB,iBAAdA,GAA+C,iBAAdA,EAA5C,CAGA,IAAIoC,EAAQtD,EAAO0D,GACnB,GAAqB,iBAAVJ,GAAuC,iBAAVA,GAAuBzD,EAAQ50B,MAAMq4B,GAG7E,GAAIzD,EAAQ50B,MAAMq4B,IAChB,IAAK,IAAIp+B,EAAI,EAAGA,EAAIo+B,EAAMhhC,OAAQ4C,IAChC,GAAIg8B,IAAcoC,EAAMp+B,GAEtB,YADA1D,KAAK+gC,OAAO,yBAA2Be,EAAMp+B,GAAK,IAAK,KAAM,WAK7Dg8B,IAAcoC,GAChB9hC,KAAK+gC,OAAO,yBAA2Be,EAAQ,IAAK,KAAM,KAd9D,CAiBF,EACAK,SAAU,SAAU3D,EAAQ4D,GAC1B,IAAIC,EAAQ7D,EAAO2D,SACd9D,EAAQ5H,OAAO2L,KAGRC,EAAMpB,MAAK,SAAUqB,GAC/B,OAAQA,KAAUF,CACpB,KAEEpiC,KAAK+gC,OAAO,0BAA4BsB,EAAMxyB,KAAI,SAAUnM,GAC1D,MAAO,IAAMA,EAAI,GACnB,IAAGsgB,KAAK,QAAS,KAAM,YAE3B,EACAzG,OAAQ,SAAUihB,EAAQkB,GAExB,GAD6B,iBAAlBlB,EAAOjhB,SAAuBihB,EAAOjhB,OAA4B,SAAlBihB,EAAOjhB,SAC3C,IAAlBihB,EAAOjhB,QAAoB8gB,EAAQ5H,OAAOiJ,IAAerB,EAAQ5H,OAAO+H,EAAO+D,kBAI7C,IAA3B/D,EAAO+D,WAAW,KAAsB,CACjD,IAAIC,EAAW5gC,OAAOuyB,KAAKuL,GAAW+C,QAAO,SAAUl9B,GACrD,YAA0C,IAA3Bi5B,EAAO+D,WAAWh9B,EACnC,IACA,GAAIi9B,EAAS1hC,OAAS,EAAG,CACvB,IAAIwK,EAAM,wBAA0Bk3B,EAAS1hC,OAAS,EAAI,aAAe,YACvE,KAAO0hC,EAAS3yB,KAAI,SAAUnM,GAAK,MAAO,IAAMA,EAAI,GAAK,IAAGsgB,KAAK,MAAQ,IAPpEhkB,KAQF+gC,OAAOz1B,EAAK,KAAM,SACzB,CACF,CACF,EACA4oB,KAAM,SAAUsK,EAAQkB,EAAWgD,GACjC,IAAIv9B,EAAOnF,KAEX,GAAwB,mBAAb0iC,EACT,OAAO1iC,KAAK2iC,UAAUnE,EAAQkB,EAAWgD,IAE1CrE,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAAO9T,SAAQ,SAAU8T,GACvD,mBAATA,GACTA,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAE5B,GACF,EACA6C,WAAY,SAAU/D,EAAQkB,EAAWgD,GACvC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK4iC,gBAAgBpE,EAAQkB,EAAWgD,GAEjD,GAAMlE,EAAO+D,sBAAsB3gC,QAAa89B,aAAqB99B,OAArE,CAGA,IACI8B,EADA6+B,EAAa/D,EAAO+D,WAExB,GAAuB,MAAnBA,EAAW,KACb,IAAK7+B,KAAKg8B,EACJh8B,KAAK6+B,IAGTviC,KAAK8+B,cAAcp7B,GACnB1D,KAAK6iC,UAAUN,EAAW,KAAM7C,EAAUh8B,IAC1C1D,KAAKg/B,SAGT,IAAKt7B,KAAK6+B,EACE,MAAN7+B,IAGJ1D,KAAK8+B,cAAcp7B,GACnB1D,KAAK6iC,UAAUN,EAAW7+B,GAAIg8B,EAAUh8B,IACxC1D,KAAKg/B,QAnBP,CAqBF,EACA8D,MAAO,SAAUtE,EAAQkB,EAAWgD,GAClC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK+iC,WAAWvE,EAAQkB,EAAWgD,GAE5C,GAAMlE,EAAOsE,iBAAiBlhC,QAAa89B,aAAqB99B,OAAhE,CAGA,IACI8B,EAAGS,EADH2+B,EAAQtE,EAAOsE,MAMnB,GAAIzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAMi2B,GACxC,IAAKh8B,EAAI,EAAGS,EAAI2+B,EAAMhiC,OAAQ4C,EAAIS,EAAGT,IACnC1D,KAAK++B,aAAar7B,GAClB1D,KAAK6iC,UAAUC,EAAMp/B,GAAIg8B,EAAUh8B,IACnC1D,KAAKg/B,aAGP,IAAK,IAAIz5B,KAAOm6B,EACV99B,OAAOmJ,UAAU8jB,eAAe7jB,KAAK00B,EAAWn6B,KAClDvF,KAAK++B,aAAax5B,GAClBvF,KAAK6iC,UAAUC,EAAOpD,EAAUn6B,IAChCvF,KAAKg/B,QAlBX,CAsBF,GAGEgE,EAA2B,CAC7BL,UAAW,SAAUnE,EAAQkB,EAAWgD,GACtC,IAAIv9B,EAAOnF,KACX+J,EAAMk5B,WAAW5E,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAAO,SAAUA,EAAM7I,GACzF,GAAoB,mBAAT6I,EAAqB,CAC9B,GAAIA,EAAKpzB,OAAS,EAChB,OAAOozB,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAAWrU,GAE5C6I,EAAKlpB,KAAK7F,EAAMq5B,EAAQkB,EAC1B,CACA31B,EAAM7B,SAASmjB,EACjB,GAAGqX,EACL,EACAE,gBAAiB,SAAUpE,EAAQkB,EAAWgD,GAC5C,KAAMlE,EAAO+D,sBAAsB3gC,QAAYy8B,EAAQ5H,OAAOiJ,IAC5D,OAAOgD,IAET,IAAIv9B,EAAOnF,KACPuiC,EAAa/D,EAAO+D,WACxBx4B,EAAMm5B,OAAO,CACX,SAAU/X,GACR,GAAuB,MAAnBoX,EAAW,KACb,OAAOpX,IAETphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKuL,IAAY,SAAUh8B,EAAG2nB,GACpD,GAAI3nB,KAAK6+B,EACP,OAAOx4B,EAAM7B,SAASmjB,GAExBlmB,EAAK25B,cAAcp7B,GACnByB,EAAKg+B,eAAeZ,EAAW,KAAM7C,EAAUh8B,IAAI,SAAU0/B,GAC3Dj+B,EAAK65B,QACL3T,EAAK+X,EACP,GACF,GAAGjY,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKoO,IAAa,SAAU7+B,EAAG2nB,GACrD,GAAU,MAAN3nB,EACF,OAAOqG,EAAM7B,SAASmjB,GAExBlmB,EAAK25B,cAAcp7B,GACnByB,EAAKg+B,eAAeZ,EAAW7+B,GAAIg8B,EAAUh8B,IAAI,SAAU0/B,GACzDj+B,EAAK65B,QACL3T,EAAK+X,EACP,GACF,GAAGjY,EACL,GACCuX,EACL,EACAK,WAAY,SAAUvE,EAAQkB,EAAWgD,GACvC,KAAMlE,EAAOsE,iBAAiBlhC,QAAa89B,aAAqB99B,QAC9D,OAAO8gC,IAET,IAAIv9B,EAAOnF,KACP8iC,EAAQtE,EAAOsE,MAEfzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAMi2B,GACxC31B,EAAMs5B,YAAYP,EAAMhiC,QAAQ,SAAU4C,EAAG2nB,GAC3ClmB,EAAK45B,aAAar7B,GAClByB,EAAKg+B,eAAeL,EAAMp/B,GAAIg8B,EAAUh8B,IAAI,SAAU0/B,EAAK1+B,GACzDS,EAAK65B,QACL3T,EAAK+X,EAAK1+B,EACZ,IACAS,EAAK65B,OACP,GAAG0D,GAEH34B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKuL,IAAY,SAAUn6B,EAAK8lB,GACtDlmB,EAAK45B,aAAax5B,GAClBJ,EAAKg+B,eAAeL,EAAOpD,EAAUn6B,IAAM,SAAU69B,EAAK1+B,GACxDS,EAAK65B,QACL3T,EAAK+X,EAAK1+B,EACZ,GACF,GAAGg+B,EAEP,GAMF,SAASY,EAAW9E,EAAQR,GAC1BO,EAAWxzB,UAAU3I,YAAY4I,KAAKhL,KAAMw+B,EAAQX,EAAOyF,EAAWtF,OAAQA,IAC9E,IAAIuF,EAAS,GAEbvjC,KAAKwjC,aAAe5hC,OAAOuyB,KAAK0M,GAChC7gC,KAAKyjC,cAAgB7hC,OAAOuyB,KAAKn0B,KAAK2+B,SACtC3+B,KAAK49B,OAAS,KAEd59B,KAAK+gC,OAAS,SAAUl7B,EAASoe,EAAMyf,GACrC,IAAIC,EAAS,CACX1f,KAAMA,GAAQjkB,KAAK4jC,UAAY,KAC/BF,OAAQA,GAAU,UAClB79B,QAAS7F,KAAK6jC,WAAah+B,GAAW,aACtCi+B,SAAU9jC,KAAK+jC,UAAa/jC,KAAK+jC,UAAY,KAAO/jC,KAAK6+B,aAAe,IAAO7+B,KAAK6+B,cAGtF,OADA0E,EAAOnxB,KAAKuxB,GACL3jC,IACT,EAEAA,KAAK0K,OAAS,WACZ,MAAO,CACLsR,MAAOunB,EACPS,MAAyB,IAAlBT,EAAOziC,OACdkpB,OAAQ,WACN,OAAmB,IAAfhqB,KAAKgkC,MACA,qBAEFhkC,KAAKgc,MAAMnM,KAAI,SAAUnM,GAC9B,MAAO,YAAcA,EAAEogC,SAAW,KAAOpgC,EAAEmC,OAC7C,IAAGme,KAAK,KACV,EAEJ,CACF,CAEA2Z,EAAQ2F,EAAWv4B,UAAW81B,GAC9BlD,EAAQ2F,EAAWv4B,UAAWi4B,GAC9BrF,EAAQ2F,EAAY,IAAIvF,GAExBuF,EAAWv4B,UAAUk5B,SAAW,SAAUvE,EAAWgD,GAEnD,GADA1iC,KAAK49B,OAAS8B,EACU,mBAAbgD,EAAyB,CAClC,IAAIv9B,EAAOnF,KACX,OAAO+J,EAAM7B,UAAS,WACpB/C,EAAKg+B,eAAeh+B,EAAKu5B,QAASgB,GAAW,SAAU0D,GACrDj+B,EAAKy4B,OAAS,KACd8E,EAASU,EAAKj+B,EAAKuF,SACrB,GACF,GACF,CACA,OAAO1K,KAAK6iC,UAAU7iC,KAAK0+B,QAASgB,GAAWh1B,QACjD,EAEA44B,EAAWv4B,UAAU83B,UAAY,SAAUrE,EAAQkB,EAAWgD,GAc5D,OAbA1iC,KAAK4jC,SAAWpF,EAAOva,MAAQ,KAC/BjkB,KAAK6jC,UAAYrF,EAAOxiB,OAAS,KACjChc,KAAK+jC,UAAYvF,EAAO0F,OAAS,KACjClkC,KAAKwjC,aAAapjB,SAAQ,SAAU1c,KAC7BA,KAAK86B,IAAgB,aAAN96B,GAAwC,mBAAZ1D,KAAK0D,IACnD1D,KAAK0D,GAAG86B,EAAQkB,EAEpB,GAAG1/B,MACHA,KAAKyjC,cAAcrjB,SAAQ,SAAU1c,GAC/BA,KAAK86B,GAAqC,mBAApBx+B,KAAK2+B,QAAQj7B,IACrC1D,KAAK2+B,QAAQj7B,GAAGsH,KAAKhL,KAAMw+B,EAAQkB,EAEvC,GAAG1/B,MACIA,IACT,EAEAsjC,EAAWv4B,UAAUo4B,eAAiB,SAAU3E,EAAQkB,EAAWgD,GACjE,IAAIv9B,EAAOnF,KACXA,KAAK4jC,SAAWpF,EAAOva,MAAQ,KAC/BjkB,KAAK6jC,UAAYrF,EAAOxiB,OAAS,KACjChc,KAAK+jC,UAAYvF,EAAO0F,OAAS,KAEjCn6B,EAAMm5B,OAAO,CACX,SAAU/X,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAK0M,IAAsB,SAAUn9B,EAAG2nB,GAC9DthB,EAAM7B,UAAS,WACb,IAAKxE,KAAK86B,GAAgB,aAAN96B,IAAwC,mBAAZyB,EAAKzB,GAAmB,CACtE,GAAIyB,EAAKzB,GAAG5C,OAAS,EACnB,OAAOqE,EAAKzB,GAAG86B,EAAQkB,EAAWrU,GAEpClmB,EAAKzB,GAAG86B,EAAQkB,EAClB,CACArU,GACF,GACF,GAAGF,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKhvB,EAAKw5B,UAAU,SAAUj7B,EAAG2nB,GACvDthB,EAAM7B,UAAS,WACb,GAAIxE,KAAK86B,GAAqC,mBAApBr5B,EAAKw5B,QAAQj7B,GAAmB,CACxD,GAAIyB,EAAKw5B,QAAQj7B,GAAG5C,OAAS,EAC3B,OAAOqE,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQkB,EAAWrU,GAEvDlmB,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQkB,EACrC,CACArU,GACF,GACF,GAAGF,EACL,GACCuX,EACL,EAIA,IAAIyB,EAAa,CACfhkC,OAAQ,SAAUikC,EAAM5F,GACtB,IAAIp+B,EACJ,GAAoB,iBAATgkC,EACT,OAAOA,EACF,GAAa,KAATA,EACT,YAA0B,IAAf5F,EAAO6F,IACT7F,EAAO6F,IAET,KACF,GAAoB,iBAATD,GAEhB,GAAiB,iBADjBhkC,EAAIkkC,WAAWF,EAAK5c,QAAQ,KAAM,KAAKA,QAAQ,KAAM,MAEnD,OAAOpnB,OAEJ,GAAIgkC,aAAgBh6B,KACzB,OAAQg6B,EAEV,OAAO,IACT,EACAjF,QAAS,SAAUiF,EAAM5F,GACvB,IAAIp+B,EACJ,GAAoB,iBAATgkC,GAAqBA,EAAO,GAAM,EAC3C,OAAOA,EACF,GAAa,KAATA,EACT,YAA0B,IAAf5F,EAAO6F,IACT7F,EAAO6F,IAET,KACF,GAAoB,iBAATD,GAEhB,GAAiB,iBADjBhkC,EAAIyJ,SAASu6B,EAAK5c,QAAQ,KAAM,IAAK,KAEnC,OAAOpnB,MAEJ,IAAoB,iBAATgkC,EAChB,OAAOv6B,SAASu6B,EAAM,IACjB,GAAoB,kBAATA,EAChB,OAAIA,EAAe,EACZ,EACF,GAAIA,aAAgBh6B,KACzB,OAAQg6B,CACV,CACA,OAAO,IACT,EACAvhB,OAAQ,SAAUuhB,EAAM5F,GACtB,MAAoB,kBAAT4F,GAAsC,iBAATA,GAAqBA,aAAgBh6B,KACpEg6B,EAAKl7B,WACHm1B,EAAQ50B,MAAM26B,GAEnB5F,EAAOsE,OAAStE,EAAO+D,WAClB6B,EAEFA,EAAKpgB,KAAK6W,OAAO2D,EAAO+F,UAAY,MAClCH,aAAgBxiC,OAErB48B,EAAOsE,OAAStE,EAAO+D,WAClB6B,EAEFnY,KAAKkD,UAAUiV,GACG,iBAATA,GAAqBA,EAAKtjC,OACnCsjC,EAEF,IACT,EACA7E,KAAM,SAAU6E,EAAM5F,GACpB,GAAI4F,aAAgBh6B,KAClB,OAAOg6B,EAEP,IAAIxyB,EAAI,IAAIxH,KAAKg6B,GACjB,OAAKt6B,MAAM8H,EAAE8vB,WAIR,KAHI9vB,CAIb,EACAytB,QAAS,SAAU+E,EAAM5F,GACvB,YAAoB,IAAT4F,EAA6B,MACpB,iBAATA,GAA4C,UAAvBA,EAAKzd,kBAC5Byd,CACX,EACA3N,OAAQ,SAAU2N,EAAM5F,GACtB,GAAoB,iBAAT4F,GAAqB/F,EAAQ5H,OAAO2N,GAC7C,OAAOA,EAET,IACE,OAAOnY,KAAKC,MAAMkY,EACpB,CAAE,MAAOznB,GACP,OAAO,IACT,CACF,EACAlT,MAAO,SAAU26B,EAAM5F,GACrB,GAAIH,EAAQ50B,MAAM26B,GAChB,OAAOA,EAET,QAAoB,IAATA,EACT,OAAO,KAET,GAAoB,iBAATA,EAAmB,CAC5B,GAA6B,MAAzBA,EAAK/c,UAAU,EAAG,IAAiC,MAAnB+c,EAAKz/B,OAAO,GAC9C,IACE,OAAOsnB,KAAKC,MAAMkY,EACpB,CAAE,MAAOznB,GACP,OAAO,IACT,CAEF,OAAOynB,EAAKpY,MAAM6O,OAAO2D,EAAOgG,WAAa,KAC/C,CACA,OAAKnG,EAAQ50B,MAAM26B,GAGZ,KAFE,CAACA,EAGZ,GAGEK,EAAc,CAChBC,MAAO,SAAUN,GACf,OAAOA,EAAK7c,aACd,EACAod,MAAO,SAAUP,GACf,OAAOA,EAAKzd,aACd,EACA6V,MAAO,SAAU4H,GAEf,OAAOA,EAAK5c,QAAQ,QAAQ,SAAUod,GACpC,OAAOA,EAAIzjB,OAAO,GAAGoG,cAAgBqd,EAAIC,OAAO,GAAGle,aACrD,GACF,EACAme,WAAY,SAAUV,GACpB,OAAOA,EAAKjjB,OAAO,GAAGoG,cAAgB6c,EAAKS,OAAO,GAAGle,aACvD,EACAoe,QAAS,SAAUX,GACjB,OAAOA,EAAKjjB,OAAO,GAAGoG,cAAgB6c,EAAKS,OAAO,EACpD,EACAG,KAAM,SAAUZ,GACd,OAAOA,EAAKY,MACd,GAKEC,EAAwB,CAC1B1nB,OAAQ,SAAUihB,EAAQ4F,GAExB,MAD6B,iBAAlB5F,EAAOjhB,SAAuBihB,EAAOjhB,OAA4B,SAAlBihB,EAAOjhB,SAC3C,IAAlBihB,EAAOjhB,OACF6mB,EAEJ/F,EAAQ5H,OAAO+H,EAAO+D,aAGtBlE,EAAQ5H,OAAO2N,IAGpBxiC,OAAOuyB,KAAKiQ,GAAMhkB,SAAQ,SAAU7a,GAC5BA,KAAOi5B,EAAO+D,mBACX6B,EAAK7+B,EAEhB,IACO6+B,GAVEA,CAWX,EACAtD,SAAU,SAAUtC,EAAQ4F,GAE1B,OAAY,KADyB,kBAApB5F,EAAOsC,SAAyBtC,EAAOsC,SAAgC,UAApBtC,EAAOsC,gBAIvD,IAATsD,EAFFA,GAKTpkC,KAAK+gC,SACDvC,EAAO6F,MAAQj6B,KACV,IAAIA,KAENo0B,EAAO6F,IAChB,EACA3K,KAAM,SAAU8E,EAAQ4F,GAItB,GAA2B,iBAAhB5F,EAAO9E,MAAwD,mBAA5ByK,EAAW3F,EAAO9E,MAC9D,OAAO0K,EAET,IAAIhkC,EACA8kC,EAAiC,kBAApB1G,EAAOsC,UAAyBtC,EAAOsC,SASxD,MARuC,mBAA5BqD,EAAW3F,EAAO9E,OAEhB,QADXt5B,EAAI+jC,EAAW3F,EAAO9E,MAAM0K,EAAM5F,MACd0G,IAAU9kC,GAAK0J,MAAM1J,IAAc,OAANA,GAA8B,WAAhBo+B,EAAO9E,QACpEt5B,EAAIo+B,EAAO6F,KAEHa,IACV9kC,EAAIo+B,EAAO6F,MAEH,MAALjkC,QAAoC,IAAfo+B,EAAO6F,KAAuB7F,EAAO6F,MAAQjkC,IAAOA,IAAMgkC,GAClFpkC,KAAK+gC,SACE3gC,GAEFgkC,CACT,EACAe,MAAO,SAAU3G,EAAQ4F,GACvB,IAAIe,EAAQ3G,EAAO2G,MACnB,GAAoB,iBAATf,GAAuC,iBAAVe,IAAuB9G,EAAQ50B,MAAM07B,GAC3E,OAAOf,EAET,IAAIgB,GAAW,EAUf,OATC/G,EAAQ50B,MAAM07B,GAASA,EAAQ,CAACA,IAAQ/kB,SAAQ,SAAUilB,GACxB,mBAAtBZ,EAAYY,KACrBjB,EAAOK,EAAYY,GAAMjB,GACzBgB,GAAW,EAEf,IACIA,GACFplC,KAAK+gC,SAEAqD,CACT,EACAziC,IAAK,SAAU68B,EAAQ4F,GACrB,IAAIkB,EAAWjlC,OAAO+jC,GACtB,GAAIt6B,MAAMw7B,GACR,OAAOlB,EAET,IAAIziC,EAAMtB,OAAOm+B,EAAO78B,KACxB,OAAImI,MAAMnI,GACDyiC,EAELkB,EAAW3jC,GACb3B,KAAK+gC,SACEp/B,GAEFyiC,CACT,EACAlW,IAAK,SAAUsQ,EAAQ4F,GACrB,IAAIkB,EAAWjlC,OAAO+jC,GACtB,GAAIt6B,MAAMw7B,GACR,OAAOlB,EAET,IAAIlW,EAAM7tB,OAAOm+B,EAAOtQ,KACxB,OAAIpkB,MAAMokB,GACDkW,EAELkB,EAAWpX,GACbluB,KAAK+gC,SACE7S,GAEFkW,CACT,EACA1c,UAAW,SAAU8W,EAAQ4F,GAC3B,IAAItC,EAAQzhC,OAAOm+B,EAAO9W,WAC1B,GAAoB,iBAAT0c,GAAqBt6B,MAAMg4B,IAAUA,EAAQ,EACtD,OAAOsC,EAET,IAAIh7B,EAAM,GACNm8B,EAAMzD,EAAQsC,EAAKtjC,OACvB,GAAIykC,EAAM,EAAG,CACX,IAAK,IAAI7hC,EAAI,EAAGA,EAAI6hC,EAAK7hC,IACvB0F,GAAO,IAGT,OADApJ,KAAK+gC,SACEqD,EAAOh7B,CAChB,CACA,OAAOg7B,CACT,EACAzC,UAAW,SAAUnD,EAAQ4F,GAC3B,IAAItC,EAAQzhC,OAAOm+B,EAAOmD,WAC1B,MAAoB,iBAATyC,GAAqBt6B,MAAMg4B,IAAUA,EAAQ,EAC/CsC,EAELA,EAAKtjC,OAASghC,GAChB9hC,KAAK+gC,SACEqD,EAAKz/B,MAAM,EAAGm9B,IAEhBsC,CACT,EACA7B,WAAY,SAAU/D,EAAQ4F,EAAM1B,GAClC,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK4iC,gBAAgBpE,EAAQ4F,EAAM1B,GAE5C,IAAK0B,GAAwB,iBAATA,EAClB,OAAOA,EAET,IACIh5B,EACA1H,EAFA6+B,EAAa/D,EAAO+D,WAGxB,QAA+B,IAApBA,EAAW,KACpB,IAAK7+B,KAAK0gC,EACJ1gC,KAAK6+B,IAGTviC,KAAK8+B,cAAcp7B,SAEA,KADnB0H,EAAMpL,KAAKwlC,UAAUjD,EAAW,KAAM6B,EAAK1gC,MACT,SAAU6+B,EAAW,QACrD6B,EAAK1gC,GAAK0H,GAEZpL,KAAKg/B,SAGT,IAAKt7B,KAAK6+B,EACE,MAAN7+B,IACF1D,KAAK8+B,cAAcp7B,SAEA,KADnB0H,EAAMpL,KAAKwlC,UAAUjD,EAAW7+B,GAAI0gC,EAAK1gC,MACP,SAAU6+B,EAAW7+B,MACrD0gC,EAAK1gC,GAAK0H,GAEZpL,KAAKg/B,SAGT,OAAOoF,CACT,EACAtB,MAAO,SAAUtE,EAAQ4F,EAAM1B,GAC7B,GAAwB,mBAAbA,EACT,OAAO1iC,KAAK+iC,WAAWvE,EAAQ4F,EAAM1B,GAEvC,KAAMlE,EAAOsE,iBAAiBlhC,QAAawiC,aAAgBxiC,QACzD,OAAOwiC,EAET,IAAI1gC,EACJ,GAAI26B,EAAQ50B,MAAM+0B,EAAOsE,QAAUzE,EAAQ50B,MAAM26B,GAAO,CACtD,IAAI1c,EAAY8W,EAAOsE,MAAMhiC,OAASsjC,EAAKtjC,OAAS09B,EAAOsE,MAAMhiC,OAASsjC,EAAKtjC,OAC/E,IAAK4C,EAAI,EAAGA,EAAIgkB,EAAWhkB,IACzB1D,KAAK++B,aAAar7B,GAClB0gC,EAAK1gC,GAAK1D,KAAKwlC,UAAUhH,EAAOsE,MAAMp/B,GAAI0gC,EAAK1gC,IAC/C1D,KAAKg/B,OAET,MACE,IAAKt7B,KAAK0gC,EACJxiC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKo5B,EAAM1gC,KAC7C1D,KAAK++B,aAAar7B,GAClB0gC,EAAK1gC,GAAK1D,KAAKwlC,UAAUhH,EAAOsE,MAAOsB,EAAK1gC,IAC5C1D,KAAKg/B,SAIX,OAAOoF,CACT,EACAlQ,KAAM,SAAUsK,EAAQ4F,EAAM1B,GAC5B,MAAwB,mBAAbA,EACF1iC,KAAK2iC,UAAUnE,EAAQ4F,EAAM1B,KAE1BrE,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,OAEzD9T,SAAQ,SAAU8T,GACF,mBAATA,IACTkQ,EAAOlQ,EAAKlpB,KAAKhL,KAAMw+B,EAAQ4F,GAEnC,GAAGpkC,MACIokC,EACT,GAGEqB,EAA6B,CAC/B9C,UAAW,SAAUnE,EAAQ4F,EAAM1B,GACjC,IAAIv9B,EAAOnF,KACP0lC,EAAQrH,EAAQ50B,MAAM+0B,EAAOtK,MAAQsK,EAAOtK,KAAO,CAACsK,EAAOtK,MAE/DnqB,EAAMk5B,WAAWyC,GAAO,SAAUxR,EAAM7I,GACtC,GAAoB,mBAAT6I,EAAqB,CAC9B,GAAIA,EAAKpzB,OAAS,EAChB,OAAOozB,EAAKlpB,KAAK7F,EAAMq5B,EAAQ4F,GAAM,SAAUhB,EAAK1+B,GAClD,GAAI0+B,EACF,OAAO/X,EAAK+X,GAEdgB,EAAO1/B,EACP2mB,GACF,IAEF+Y,EAAOlQ,EAAKlpB,KAAK7F,EAAMq5B,EAAQ4F,EACjC,CACA/Y,GACF,IAAG,SAAU+X,GACXV,EAASU,EAAKgB,EAChB,GACF,EACAxB,gBAAiB,SAAUpE,EAAQ4F,EAAM1B,GACvC,IAAK0B,GAAwB,iBAATA,EAClB,OAAO1B,EAAS,KAAM0B,GAExB,IAAIj/B,EAAOnF,KACPuiC,EAAa/D,EAAO+D,WAExBx4B,EAAMm5B,OAAO,CACX,SAAU/X,GACR,GAAuB,MAAnBoX,EAAW,KACb,OAAOpX,IAET,IAAIwa,EAAUpD,EAAW,KACzBx4B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKiQ,IAAO,SAAU1gC,EAAGynB,GAC/C,GAAIznB,KAAK6+B,EACP,OAAOpX,IAEThmB,EAAK25B,cAAcp7B,GACnByB,EAAKygC,eAAeD,EAASvB,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,QAEhC,IAARA,IACT0/B,EAAK1gC,GAAKgB,GAEZS,EAAK65B,QACL7T,GACF,GACF,GAAGA,EACL,EACA,SAAUA,GACRphB,EAAMk5B,WAAWrhC,OAAOuyB,KAAKoO,IAAa,SAAU7+B,EAAGynB,GACrD,GAAU,MAANznB,EACF,OAAOynB,IAEThmB,EAAK25B,cAAcp7B,GACnByB,EAAKygC,eAAerD,EAAW7+B,GAAI0gC,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,GACzD,GAAI0+B,EACF,OAAOjY,EAAKiY,QAEK,IAAR1+B,IACT0/B,EAAK1gC,GAAKgB,GAEZS,EAAK65B,QACL7T,GACF,GACF,GAAGA,EACL,IACC,SAAUiY,GACX,OAAOV,EAASU,EAAKgB,EACvB,GACF,EACArB,WAAY,SAAUvE,EAAQ4F,EAAM1B,GAClC,KAAMlE,EAAOsE,iBAAiBlhC,QAAawiC,aAAgBxiC,QACzD,OAAO8gC,EAAS,KAAM0B,GAExB,IAAIj/B,EAAOnF,KACP8iC,EAAQtE,EAAOsE,MACnB,GAAIzE,EAAQ50B,MAAMq5B,IAAUzE,EAAQ50B,MAAM26B,GAAO,CAC/C,IAAI1c,EAAYob,EAAMhiC,OAASsjC,EAAKtjC,OAASgiC,EAAMhiC,OAASsjC,EAAKtjC,OACjEiJ,EAAMs5B,YAAY3b,GAAW,SAAUhkB,EAAGynB,GACxChmB,EAAK45B,aAAar7B,GAClByB,EAAKygC,eAAe9C,EAAMp/B,GAAI0gC,EAAK1gC,IAAI,SAAU0/B,EAAK1+B,GACpD,GAAI0+B,EACF,OAAOjY,EAAKiY,GAEdgB,EAAK1gC,GAAKgB,EACVS,EAAK65B,QACL7T,GACF,GACF,IAAG,SAAUiY,GACXV,EAASU,EAAKgB,EAChB,GACF,MACEr6B,EAAMk5B,WAAWrhC,OAAOuyB,KAAKiQ,IAAO,SAAU7+B,EAAK4lB,GACjDhmB,EAAK45B,aAAax5B,GAClBJ,EAAKygC,eAAe9C,EAAOsB,EAAK7+B,IAAM,SAAU69B,EAAK1+B,GACnD,GAAI0+B,EACF,OAAOjY,IAETiZ,EAAK7+B,GAAOb,EACZS,EAAK65B,QACL7T,GACF,GACF,IAAG,SAAUiY,GACXV,EAASU,EAAKgB,EAChB,IAEF,OAAOA,CACT,GAMF,SAASyB,EAAarH,EAAQR,GAC5BO,EAAWxzB,UAAU3I,YAAY4I,KAAKhL,KAAMw+B,EAAQX,EAAOgI,EAAa7H,OAAQA,IAChF,IAAI8H,EAAa,GAEjB9lC,KAAKwjC,aAAe5hC,OAAOuyB,KAAK8Q,GAChCjlC,KAAKyjC,cAAgB7hC,OAAOuyB,KAAKn0B,KAAK2+B,SACtC3+B,KAAK49B,OAAS,KAEd59B,KAAK+gC,OAAS,SAAUl7B,GACtB,IAAIkgC,EAAS,CACXlgC,QAASA,GAAW,gBACpBi+B,SAAU9jC,KAAK+jC,UAAa/jC,KAAK+jC,UAAY,KAAO/jC,KAAK6+B,aAAe,IAAO7+B,KAAK6+B,cAEjFiH,EAAW7E,MAAK,SAAUtkB,GAAK,OAAOA,EAAEmnB,WAAaiC,EAAOjC,QAAU,KACzEgC,EAAW1zB,KAAK2zB,EAEpB,EAEA/lC,KAAK0K,OAAS,SAAU7H,GAGtB,MAAO,CACLA,KAAMA,EACNmjC,UAAWF,EACX9b,OAAQ,WACN,OAAOhqB,KAAKgmC,UAAUn2B,KAAI,SAAUnM,GAClC,MAAO,YAAcA,EAAEogC,SAAW,IAAMpgC,EAAEmC,OAC5C,IAAGme,KAAK,KACV,EAGJ,CACF,CAEA2Z,EAAQkI,EAAa96B,UAAWk6B,GAChCtH,EAAQkI,EAAa96B,UAAW06B,GAChC9H,EAAQkI,EAAc,IAAI9H,GAE1B8H,EAAa96B,UAAUk7B,SAAW,SAAU7B,EAAM1B,GAEhD,GADA1iC,KAAK49B,OAASwG,EACU,mBAAb1B,EAAyB,CAClC,IAAIv9B,EAAOnF,KACX,OAAOA,KAAK4lC,eAAe5lC,KAAK0+B,QAAS0F,GAAM,SAAUhB,EAAKvgC,GAC5DsC,EAAKy4B,OAAS,KACd8E,EAASU,EAAKj+B,EAAKuF,OAAO7H,GAC5B,GACF,CACA,IAAIA,EAAO7C,KAAKwlC,UAAUxlC,KAAK0+B,QAAS0F,GAExC,OADApkC,KAAK49B,OAAS,KACP59B,KAAK0K,OAAO7H,EACrB,EAEAgjC,EAAa96B,UAAUy6B,UAAY,SAAUhH,EAAQ4F,GAYnD,OAXApkC,KAAK+jC,UAAYvF,EAAO0F,OAAS,KACjClkC,KAAKwjC,aAAapjB,SAAQ,SAAU1c,KAC7BA,KAAK86B,IAAgB,aAAN96B,GAAwC,mBAAZ1D,KAAK0D,KACnD0gC,EAAOpkC,KAAK0D,GAAG86B,EAAQ4F,GAE3B,GAAGpkC,MACHA,KAAKyjC,cAAcrjB,SAAQ,SAAU1c,GAC/BA,KAAK86B,GAAqC,mBAApBx+B,KAAK2+B,QAAQj7B,KACrC0gC,EAAOpkC,KAAK2+B,QAAQj7B,GAAGsH,KAAKhL,KAAMw+B,EAAQ4F,GAE9C,GAAGpkC,MACIokC,CACT,EAEAyB,EAAa96B,UAAU66B,eAAiB,SAAUpH,EAAQ4F,EAAM1B,GAC9D,IAAIv9B,EAAOnF,KACXA,KAAK+jC,UAAYvF,EAAO0F,OAAS,KAEjCn6B,EAAMm8B,UAAU,CACd,SAAU/a,GACRphB,EAAMU,OAAOtF,EAAKq+B,aAAcY,GAAM,SAAUtiC,EAAO4B,EAAGynB,GACxDphB,EAAM7B,UAAS,WACb,IAAKxE,KAAK86B,GAAgB,aAAN96B,IAAwC,mBAAZyB,EAAKzB,GAAmB,CACtE,GAAIyB,EAAKzB,GAAG5C,OAAS,EACnB,OAAOqE,EAAKzB,GAAG86B,EAAQ18B,EAAOqpB,GAEhCrpB,EAAQqD,EAAKzB,GAAG86B,EAAQ18B,EAC1B,CACAqpB,EAAK,KAAMrpB,EACb,GACF,GAAGqpB,EACL,EACA,SAAUgb,EAAOhb,GACfphB,EAAMU,OAAOtF,EAAKs+B,cAAe0C,GAAO,SAAUrkC,EAAO4B,EAAGynB,GAC1DphB,EAAM7B,UAAS,WACb,GAAIxE,KAAK86B,GAAqC,mBAApBr5B,EAAKw5B,QAAQj7B,GAAmB,CACxD,GAAIyB,EAAKw5B,QAAQj7B,GAAG5C,OAAS,EAC3B,OAAOqE,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQ18B,EAAOqpB,GAEnDrpB,EAAQqD,EAAKw5B,QAAQj7B,GAAGsH,KAAK7F,EAAMq5B,EAAQ18B,EAC7C,CACAqpB,EAAK,KAAMrpB,EACb,GACF,GAAGqpB,EACL,GACCuX,EACL,EAIA,IACI0D,EAAU,WAEVC,EAAQ,CACVC,IAAK,SAAU3kC,EAAKusB,GAClB,OAAOvsB,GAAO,EAAIuB,KAAKqjC,UAAYrY,EAAMvsB,EAAM,GACjD,EACA6kC,MAAO,SAAU7kC,EAAKusB,GACpB,OAAQhrB,KAAKqjC,UAAYrY,EAAMvsB,GAAOA,CACxC,EACAnB,KAAM,WACJ,OAAQ0C,KAAKqjC,SAAW,EAC1B,EACAE,KAAM,SAAU9kC,EAAKusB,GACnB,OAAO2M,OAAO6L,aAAa1mC,KAAKsmC,IAAI3kC,EAAKusB,GAC3C,EACAyY,SAAU,SAAUC,GAClB,OAAOA,EAAK5mC,KAAKsmC,IAAI,EAAGM,EAAK9lC,OAAS,GACxC,GAGE+lC,EAAgB,CAClB,YAAa,WACX,OAAO,IAAIz8B,MAAO08B,aACpB,EACAvH,KAAM,WACJ,OAAO,IAAIn1B,MAAO08B,cAActf,QAAQ,OAAQ,GAClD,EACAyY,KAAM,WACJ,OAAO,IAAI71B,MAAO28B,mBAAmB,CAAC,EAAG,CAAEC,QAAQ,GACrD,EACA9G,MAAO,SAAUv+B,EAAKusB,GACpB,IAAIjX,EAAI,IACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,0BAEtB,OAAO1vB,CACT,EACAmpB,QAAS,WACP,MAAO,GAAKiG,EAAMC,IAAI,EAAGF,EAC3B,EACAjH,QAAS,WACP,OAAqB,IAAjBkH,EAAM7lC,OACD,IAAMR,KAAKogC,UAEbpgC,KAAKogC,SACd,EACAC,QAAS,WACP,OAAOrgC,KAAKm/B,UAAY,IAAMn/B,KAAKogC,SACrC,EACAE,MAAO,SAAU3+B,EAAKusB,GACpB,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,wDAEtB,OAAO1vB,CACT,EACAspB,aAAc,SAAU5+B,EAAKusB,GAC3B,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,kEAEtB,OAAO1vB,CACT,EACAupB,UAAW,SAAU7+B,EAAKusB,GACxB,IAAIjX,EAAI,GACJtV,EAAM,IACRA,EAAM,GAER,IAAK,IAAI+B,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,GAAMxqB,EAAIS,EAAGT,IAC9CuT,GAAKovB,EAAMM,SAAS,0EAEtB,OAAO1vB,CACT,EACAwpB,WAAY,SAAU9+B,EAAKusB,GAEzB,IADA,IAAIjX,EAAIovB,EAAMM,SAAS,8DACdjjC,EAAI,EAAGS,EAAIkiC,EAAMC,IAAI3kC,EAAKusB,EAAM,GAAIxqB,EAAIS,EAAGT,IAClDuT,GAAKovB,EAAMM,SAAS,0EAEtB,OAAO1vB,CACT,GAGF,SAASgwB,EAAWzI,GAClB,IAAI78B,GA7FQ,WA8FRusB,EAAMkY,EAcV,OAZkB,MAAd5H,EAAOyD,IACTtgC,EAAM68B,EAAOyD,IACS,MAAbzD,EAAOwD,KAChBrgC,EAAM68B,EAAOwD,GAAK,GAEF,MAAdxD,EAAOuD,IACT7T,EAAMsQ,EAAOuD,IACS,MAAbvD,EAAOqD,KAChB3T,EAAMsQ,EAAOqD,GAAK,GAIb,CAAElgC,IAAKA,EAAKusB,IAAKA,EAE1B,CAEA,IAAIgZ,EAAiB,CACnBrkB,OAAQ,SAAU2b,GAChB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAI1f,EAAI,GACJyQ,EAAgC,MAApB8W,EAAO9W,UAAoB8W,EAAO9W,UAAY,EAC1Dia,EAAgC,MAApBnD,EAAOmD,UAAoBnD,EAAOmD,UAAY,GAC9D,GAA8B,iBAAnBnD,EAAO6C,SAAiE,mBAAlCwF,EAAcrI,EAAO6C,SACpE,OAAOwF,EAAcrI,EAAO6C,SAAS3Z,EAAWia,GAIlD,IADA,IAAIx9B,EAA0B,MAAtBq6B,EAAOoD,YAAsBpD,EAAOoD,YAAcyE,EAAMC,IAAI5e,EAAWia,GACtEj+B,EAAI,EAAGA,EAAIS,EAAGT,IACrBuT,GAAKovB,EAAMI,KAAK,GAAI,KAEtB,OAAOxvB,CACT,EACA9W,OAAQ,SAAUq+B,GAChB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAImL,EAAQmF,EAAWzI,GACnBp+B,EAAIimC,EAAMG,MAAM1E,EAAMngC,IAAKmgC,EAAM5T,KACrC,GAAiB,MAAbsQ,EAAO0D,GAET,IADA,IAAIA,EAAK7D,EAAQ50B,MAAM+0B,EAAO0D,IAAM1D,EAAO0D,GAAK,CAAC1D,EAAO0D,KAC9B,IAAnBA,EAAGhe,QAAQ9jB,IAChBA,EAAIimC,EAAMG,MAAM1E,EAAMngC,IAAKmgC,EAAM5T,KAGrC,OAAO9tB,CACT,EACA++B,QAAS,SAAUX,GACjB,GAAiB,MAAbA,EAAO7H,GACT,OAAO6H,EAAO7H,GAEhB,IAAImL,EAAQmF,EAAWzI,GACnBp+B,EAAIimC,EAAMC,IAAIxE,EAAMngC,IAAKmgC,EAAM5T,KACnC,GAAiB,MAAbsQ,EAAO0D,GAET,IADA,IAAIA,EAAK7D,EAAQ50B,MAAM+0B,EAAO0D,IAAM1D,EAAO0D,GAAK,CAAC1D,EAAO0D,KAC9B,IAAnBA,EAAGhe,QAAQ9jB,IAChBA,EAAIimC,EAAMC,IAAIxE,EAAMngC,IAAKmgC,EAAM5T,KAGnC,OAAO9tB,CACT,EACAi/B,QAAS,SAAUb,GACjB,OAAiB,MAAbA,EAAO7H,GACF6H,EAAO7H,GAET0P,EAAM7lC,MACf,EACA8+B,KAAM,SAAUd,GACd,OAAO,IACT,EACAe,KAAM,SAAUf,GACd,OAAiB,MAAbA,EAAO7H,GACF6H,EAAO7H,GAET,IAAIvsB,IACb,EACAqsB,OAAQ,SAAU+H,GAChB,IAAIrQ,EAAI,CAAC,EACLgZ,EAAO3I,EAAO+D,YAAc,CAAC,EAEjC,IAAK,IAAIh9B,KAAO4hC,EACd,GAAIvlC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKm8B,EAAM5hC,GAAM,CACnD,IAA2B,IAAvB4hC,EAAK5hC,GAAKu7B,WAAsC,IAAjBuF,EAAM7lC,OACvC,SAEF,GAAY,MAAR+E,EACF4oB,EAAE5oB,GAAOvF,KAAKsb,SAAS6rB,EAAK5hC,SAK5B,IAHA,IAAI6hC,EAAK,gBACLC,EAAYD,EAAK,EACjBhnC,EAAIimC,EAAMC,IAAI,EAAG,GACZ5iC,EAAI,EAAGA,GAAKtD,EAAGsD,IAChB2jC,KAAaF,IACjBhZ,EAAEkZ,GAAarnC,KAAKsb,SAAS6rB,EAAK5hC,KAEpC8hC,EAAYD,EAAK1jC,CAGvB,CAEF,OAAOyqB,CACT,EACA1kB,MAAO,SAAU+0B,GACf,IAII9E,EACAgG,EACA7d,EACAne,EANAo/B,EAAQtE,EAAOsE,OAAS,CAAC,EACzBpb,EAAgC,MAApB8W,EAAO9W,UAAoB8W,EAAO9W,UAAY,EAC1Dia,EAAgC,MAApBnD,EAAOmD,UAAoBnD,EAAOmD,UAAY,GAM9D,GAAItD,EAAQ50B,MAAMq5B,GAWhB,IAVAjhB,EAAOihB,EAAMhiC,OACa,MAAtB09B,EAAOoD,YACT/f,EAAO2c,EAAOoD,YACL/f,EAAO6F,EAChB7F,EAAO6F,EACE7F,EAAO8f,IAChB9f,EAAO8f,GAETjC,EAAY,IAAI32B,MAAM8Y,GACtB6X,EAAO,KACFh2B,EAAI,EAAGA,EAAIme,EAAMne,IACpBg2B,EAAOoJ,EAAMp/B,GAAGg2B,MAAQ,MACpB2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAEzC4+B,EAAUh8B,GAzBH1D,KAyBa05B,GAAMoJ,EAAMp/B,SASlC,IANAme,EAA6B,MAAtB2c,EAAOoD,YAAsBpD,EAAOoD,YAAcyE,EAAMC,IAAI5e,EAAWia,GAC9EjC,EAAY,IAAI32B,MAAM8Y,GACtB6X,EAAOoJ,EAAMpJ,MAAQ,MACjB2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAEpC4C,EAAI,EAAGA,EAAIme,EAAMne,IACpBg8B,EAAUh8B,GAnCH1D,KAmCa05B,GAAMoJ,GAG9B,OAAOpD,CACT,EACAF,IAAK,SAAUhB,GACb,IAAIJ,EAASx8B,OAAOuyB,KAAK+S,GAEzB,OAAOlnC,KADCo+B,EAAOiI,EAAMC,IAAI,EAAGlI,EAAOt9B,OAAS,KAC7B09B,EACjB,GAIF,SAAS8I,IAET,CAEA3J,EAAQ2J,EAAmBv8B,UAAWm8B,GAEtC,IAAIK,EAAY,KAChBD,EAAmBjmC,SAAW,WAI5B,OAHMkmC,aAAqBD,IACzBC,EAAY,IAAID,GAEXC,CACT,EAEAD,EAAmBv8B,UAAUuQ,SAAW,SAAUkjB,GAChD,IAAI9E,EAAO8E,EAAO9E,MAAQ,MAI1B,OAHI2E,EAAQ50B,MAAMiwB,KAChBA,EAAOA,EAAK2M,EAAMC,IAAI,EAAG5M,EAAK54B,OAAS,KAElCd,KAAK05B,GAAM8E,EACpB,EAGA,IAAIgJ,EAAkB,CAAC,EAGc3nC,EAAOD,QAC1CC,EAAOD,QAAU4nC,EAEjBr1B,OAAOq1B,gBAAkBA,EAG3BA,EAAgBC,gBAAkB,SAAUjJ,EAAQR,GAClD,OAAO,IAAI6H,EAAarH,EAAQR,EAClC,EAEAwJ,EAAgBE,cAAgB,SAAUlJ,EAAQR,GAChD,OAAO,IAAIsF,EAAW9E,EAAQR,EAChC,EAEAwJ,EAAgBlE,WAAaA,EAC7BkE,EAAgB3B,aAAeA,EAE/B2B,EAAgBvB,SAAW,SAAUzH,EAAQ4F,EAAMpG,EAAQ0E,GAKzD,OAJyB,IAArBnG,UAAUz7B,QAAkC,mBAAXk9B,IACnC0E,EAAW1E,EACXA,EAAS,MAEJ,IAAI6H,EAAarH,EAAQR,GAAQiI,SAAS7B,EAAM1B,EACzD,EAEA8E,EAAgBvD,SAAW,SAAUzF,EAAQkB,EAAW1B,EAAQ0E,GAK9D,OAJyB,IAArBnG,UAAUz7B,QAAkC,mBAAXk9B,IACnC0E,EAAW1E,EACXA,EAAS,MAEJ,IAAIsF,EAAW9E,EAAQR,GAAQiG,SAASvE,EAAWgD,EAC5D,EAEA8E,EAAgBlsB,SAAW,SAAUkjB,EAAQp+B,GAC3C,GAAiB,iBAANA,EAAgB,CAEzB,IADA,IAAI+Q,EAAI,IAAIpI,MAAM3I,GACTsD,EAAI,EAAGA,EAAItD,EAAGsD,IACrByN,EAAEzN,GAAK4jC,EAAmBjmC,WAAWia,SAASkjB,GAEhD,OAAOrtB,CACT,CACA,OAAOm2B,EAAmBjmC,WAAWia,SAASkjB,EAChD,CACD,CA3iDD,iDCNQ,SAAW5+B,GAAW,aAE9B,SAAS+E,EAAMgjC,EAAWxjB,GACtBA,GAAc,EAGd,IAFA,IAAIyjB,EAAS1kC,KAAKgrB,IAAIyZ,EAAU7mC,OAASqjB,EAAO,GAC5C0jB,EAAS9+B,MAAM6+B,GACXE,EAAM,EAAGA,EAAMF,EAAQE,IAC3BD,EAAOC,GAAOH,EAAUxjB,EAAQ2jB,GAEpC,OAAOD,CACX,CA+CA,IAAItc,EAAQ,SAASwc,GACjB,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5B,OAAO,WACH,IAAIyL,EAAWrjC,EAAM43B,WACrB,OAAOwL,EAAGxc,MAAM,KAAM+Q,EAAKR,OAAOkM,GACtC,CACJ,EAEIC,EAAgB,SAAUF,GAC1B,OAAO,WACH,IAAIzL,EAAO33B,EAAM43B,WACbmG,EAAWpG,EAAKtC,MACpB+N,EAAG/8B,KAAKhL,KAAMs8B,EAAMoG,EACxB,CACJ,EA2BA,SAASxL,EAASp1B,GAChB,IAAI43B,SAAc53B,EAClB,OAAgB,MAATA,IAA0B,UAAR43B,GAA4B,YAARA,EAC/C,CAEA,IAAIwO,EAA0C,mBAAjBC,cAA+BA,aACxDC,EAAiC,iBAAZ/kC,GAAoD,mBAArBA,EAAQ6E,SAEhE,SAASmgC,EAASN,GACdxM,WAAWwM,EAAI,EACnB,CAEA,SAASO,EAAKC,GACV,OAAO,SAAUR,GACb,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5BgM,GAAM,WACFR,EAAGxc,MAAM,KAAM+Q,EACnB,GACJ,CACJ,CAYA,IAAIkM,EAAiBF,EARjBJ,EACSC,aACFC,EACE/kC,EAAQ6E,SAERmgC,GA6Db,SAASI,EAASjV,GACd,OAAOyU,GAAc,SAAU3L,EAAMoG,GACjC,IAAIh4B,EACJ,IACIA,EAAS8oB,EAAKjI,MAAMvrB,KAAMs8B,EAC9B,CAAE,MAAO3f,GACL,OAAO+lB,EAAS/lB,EACpB,CAEIua,EAASxsB,IAAkC,mBAAhBA,EAAO4gB,KAClC5gB,EAAO4gB,MAAK,SAASxpB,GACjB4mC,EAAehG,EAAU,KAAM5gC,EACnC,IAAG,SAASshC,GACRsF,EAAehG,EAAUU,EAAIv9B,QAAUu9B,EAAM,IAAI7iC,MAAM6iC,GAC3D,IAEAV,EAAS,KAAMh4B,EAEvB,GACJ,CAEA,SAASg+B,EAAehG,EAAU1mB,EAAOla,GACrC,IACI4gC,EAAS1mB,EAAOla,EACpB,CAAE,MAAO6a,GACL6rB,EAAeG,EAAShsB,EAC5B,CACJ,CAEA,SAASgsB,EAAQ3sB,GACb,MAAMA,CACV,CAEA,IAAI4sB,EAAmC,mBAAXlU,OAE5B,SAASmU,EAAQd,GACb,OAAOa,GAA6C,kBAA3Bb,EAAGrT,OAAOoU,YACvC,CAEA,SAASC,EAAUC,GACf,OAAOH,EAAQG,GAAWP,EAASO,GAAWA,CAClD,CAEA,SAASC,EAAYC,GACjB,OAAO,SAASC,GACZ,IAAI7M,EAAO33B,EAAM43B,UAAW,GACxB6M,EAAKnB,GAAc,SAAS3L,EAAMoG,GAClC,IAAI2G,EAAOrpC,KACX,OAAOkpC,EAAOC,GAAK,SAAUpB,EAAI79B,GAC7B6+B,EAAUhB,GAAIxc,MAAM8d,EAAM/M,EAAKR,OAAO5xB,GAC1C,GAAGw4B,EACP,IACA,OAAIpG,EAAKx7B,OACEsoC,EAAG7d,MAAMvrB,KAAMs8B,GAGf8M,CAEf,CACJ,CAGA,IAAI9W,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAO3wB,SAAWA,QAAU,EAAA2wB,EAGhFC,EAA0B,iBAARrtB,MAAoBA,MAAQA,KAAKvD,SAAWA,QAAUuD,KAGxEzF,EAAO4yB,GAAcE,GAAYC,SAAS,cAATA,GAGjC6W,EAAW5pC,EAAKg1B,OAGhBX,EAAcnyB,OAAOmJ,UAGrB8jB,EAAiBkF,EAAYlF,eAO7B0a,EAAuBxV,EAAY7qB,SAGnCsgC,EAAmBF,EAAWA,EAASR,iBAAc7jC,EA8BzD,IAOIwkC,EAPgB7nC,OAAOmJ,UAOgB7B,SAc3C,IAAIwgC,EAAU,gBACVC,EAAe,qBAGfC,EAAiBN,EAAWA,EAASR,iBAAc7jC,EASvD,SAAS4kC,EAAW/nC,GAClB,OAAa,MAATA,OACemD,IAAVnD,EAAsB6nC,EAAeD,EAEtCE,GAAkBA,KAAkBhoC,OAAOE,GA3DrD,SAAmBA,GACjB,IAAIgoC,EAAQjb,EAAe7jB,KAAKlJ,EAAO0nC,GACnC/qB,EAAM3c,EAAM0nC,GAEhB,IACE1nC,EAAM0nC,QAAoBvkC,EAC1B,IAAI8kC,GAAW,CACjB,CAAE,MAAOptB,GAAI,CAEb,IAAIjS,EAAS6+B,EAAqBv+B,KAAKlJ,GAQvC,OAPIioC,IACED,EACFhoC,EAAM0nC,GAAoB/qB,SAEnB3c,EAAM0nC,IAGV9+B,CACT,CA0CMs/B,CAAUloC,GAvBhB,SAAwBA,GACtB,OAAO2nC,EAAuBz+B,KAAKlJ,EACrC,CAsBMwyB,CAAexyB,EACrB,CAGA,IAAImoC,EAAW,yBACXrZ,EAAU,oBACVC,EAAS,6BACTqZ,EAAW,iBA8Bf,IAAI1Z,EAAmB,iBA4BvB,SAAS+J,EAASz4B,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAAS0uB,CAC7C,CA2BA,SAAS8J,EAAYx4B,GACnB,OAAgB,MAATA,GAAiBy4B,EAASz4B,EAAMhB,UAtEzC,SAAoBgB,GAClB,IAAKo1B,EAASp1B,GACZ,OAAO,EAIT,IAAI2c,EAAMorB,EAAW/nC,GACrB,OAAO2c,GAAOmS,GAAWnS,GAAOoS,GAAUpS,GAAOwrB,GAAYxrB,GAAOyrB,CACtE,CA8DqDtQ,CAAW93B,EAChE,CAIA,IAAIqoC,EAAY,CAAC,EAcjB,SAAS9N,IAET,CAEA,SAASS,EAAKiL,GACV,OAAO,WACH,GAAW,OAAPA,EAAJ,CACA,IAAIqC,EAASrC,EACbA,EAAK,KACLqC,EAAO7e,MAAMvrB,KAAMu8B,UAHI,CAI3B,CACJ,CAEA,IAAI8N,EAAmC,mBAAX3V,QAAyBA,OAAO4V,SAExDC,EAAc,SAAUC,GACxB,OAAOH,GAAkBG,EAAKH,IAAmBG,EAAKH,IAC1D,EA6CA,SAAS5P,EAAa34B,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAYA,SAAS2oC,EAAgB3oC,GACvB,OAAO24B,EAAa34B,IAVR,sBAUkB+nC,EAAW/nC,EAC3C,CAGA,IAAI4oC,EAAgB9oC,OAAOmJ,UAGvB4/B,EAAmBD,EAAc7b,eAGjCgG,EAAuB6V,EAAc7V,qBAoBrC8F,EAAc8P,EAAgB,WAAa,OAAOlO,SAAW,CAA/B,IAAsCkO,EAAkB,SAAS3oC,GACjG,OAAO24B,EAAa34B,IAAU6oC,EAAiB3/B,KAAKlJ,EAAO,YACxD+yB,EAAqB7pB,KAAKlJ,EAAO,SACtC,EAyBIugB,EAAUtZ,MAAMsZ,QAoBpB,IAAIqQ,EAAgC,iBAAX9yB,GAAuBA,IAAYA,EAAQ+yB,UAAY/yB,EAG5EgzB,EAAaF,GAA4C7yB,IAAWA,EAAO8yB,UAAY9yB,EAMvF40B,GAHgB7B,GAAcA,EAAWhzB,UAAY8yB,EAG5BhzB,EAAK+0B,YAASxvB,EAsBvCiwB,IAnBiBT,GAASA,GAAOS,cAAWjwB,IAjBhD,WACE,OAAO,CACT,EAqCI2lC,GAAqB,iBAGrBxY,GAAW,mBAUf,SAASgI,GAAQt4B,EAAOhB,GACtB,IAAI44B,SAAc53B,EAGlB,SAFAhB,EAAmB,MAAVA,EAAiB8pC,GAAqB9pC,KAGpC,UAAR44B,GACU,UAARA,GAAoBtH,GAASyH,KAAK/3B,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQhB,CACjD,CAGA,IA2BI+pC,GAAiB,CAAC,EACtBA,GAZiB,yBAYYA,GAXZ,yBAYjBA,GAXc,sBAWYA,GAVX,uBAWfA,GAVe,uBAUYA,GATZ,uBAUfA,GATsB,8BASYA,GARlB,wBAShBA,GARgB,yBAQY,EAC5BA,GAjCgB,sBAiCYA,GAhCb,kBAiCfA,GApBqB,wBAoBYA,GAhCnB,oBAiCdA,GApBkB,qBAoBYA,GAhChB,iBAiCdA,GAhCe,kBAgCYA,GA/BX,qBAgChBA,GA/Ba,gBA+BYA,GA9BT,mBA+BhBA,GA9BgB,mBA8BYA,GA7BZ,mBA8BhBA,GA7Ba,gBA6BYA,GA5BT,mBA6BhBA,GA5BiB,qBA4BY,EA4B7B,IAPmBrX,GAOfsX,GAAkC,iBAAXlrC,GAAuBA,IAAYA,EAAQ+yB,UAAY/yB,EAG9EmrC,GAAeD,IAA8CjrC,IAAWA,EAAO8yB,UAAY9yB,EAM3FmrC,GAHkBD,IAAgBA,GAAanrC,UAAYkrC,IAG1BxY,EAAWjvB,QAG5C4nC,GAAY,WACd,IAIE,OAFYF,IAAgBA,GAAaG,SAAWH,GAAaG,QAAQ,QAAQlK,OAO1EgK,IAAeA,GAAY1N,SAAW0N,GAAY1N,QAAQ,OACnE,CAAE,MAAO3gB,GAAI,CACf,CAZe,GAeXwuB,GAAmBF,IAAYA,GAASG,aAmBxCA,GAAeD,IArDA3X,GAqD6B2X,GApDvC,SAASrpC,GACd,OAAO0xB,GAAK1xB,EACd,GAfF,SAA0BA,GACxB,OAAO24B,EAAa34B,IAClBy4B,EAASz4B,EAAMhB,WAAa+pC,GAAehB,EAAW/nC,GAC1D,EAoEIupC,GAHgBzpC,OAAOmJ,UAGU8jB,eAUrC,SAASkM,GAAcj5B,EAAO04B,GAC5B,IAAIrD,EAAQ9U,EAAQvgB,GAChBwpC,GAASnU,GAASwD,EAAY74B,GAC9BypC,GAAUpU,IAAUmU,GAASpW,GAASpzB,GACtC0pC,GAAUrU,IAAUmU,IAAUC,GAAUH,GAAatpC,GACrDg5B,EAAc3D,GAASmU,GAASC,GAAUC,EAC1C9gC,EAASowB,EAjUf,SAAmB16B,EAAG8yB,GAIpB,IAHA,IAAI5M,GAAS,EACT5b,EAAS3B,MAAM3I,KAEVkmB,EAAQlmB,GACfsK,EAAO4b,GAAS4M,EAAS5M,GAE3B,OAAO5b,CACT,CAyT6BkwB,CAAU94B,EAAMhB,OAAQ+5B,QAAU,GACzD/5B,EAAS4J,EAAO5J,OAEpB,IAAK,IAAIyE,KAAOzD,GACT04B,IAAa6Q,GAAiBrgC,KAAKlJ,EAAOyD,IACzCu1B,IAEQ,UAAPv1B,GAECgmC,IAAkB,UAAPhmC,GAA0B,UAAPA,IAE9BimC,IAAkB,UAAPjmC,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD60B,GAAQ70B,EAAKzE,KAElB4J,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CAGA,IAAI+gC,GAAgB7pC,OAAOmJ,UA+B3B,IAAIoqB,GAPJ,SAAiB3B,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,CAGiBH,CAAQ3xB,OAAOuyB,KAAMvyB,QAMlC8pC,GAHgB9pC,OAAOmJ,UAGU8jB,eASrC,SAASmM,GAASvE,GAChB,GArCI0B,GADer2B,EAsCF20B,IArCG30B,EAAMM,YAGnBN,KAFqB,mBAARq2B,GAAsBA,EAAKptB,WAAc0gC,IAqC3D,OAAOtW,GAAWsB,GAvCtB,IAAqB30B,EACfq2B,EAwCAztB,EAAS,GACb,IAAK,IAAInF,KAAO3D,OAAO60B,GACjBiV,GAAiB1gC,KAAKyrB,EAAQlxB,IAAe,eAAPA,GACxCmF,EAAO0H,KAAK7M,GAGhB,OAAOmF,CACT,CA8BA,SAASypB,GAAKsC,GACZ,OAAO6D,EAAY7D,GAAUsE,GAActE,GAAUuE,GAASvE,EAChE,CAkCA,SAAS6T,GAASE,GACd,GAAIlQ,EAAYkQ,GACZ,OAlCR,SAA6BA,GACzB,IAAI9mC,GAAK,EACLX,EAAMynC,EAAK1pC,OACf,OAAO,WACH,QAAS4C,EAAIX,EAAM,CAACjB,MAAO0oC,EAAK9mC,GAAI6B,IAAK7B,GAAK,IAClD,CACJ,CA4BeioC,CAAoBnB,GAG/B,IAlB0B1/B,EACtB8gC,EACAloC,EACAX,EAeAunC,EAAWC,EAAYC,GAC3B,OAAOF,EA9BX,SAA8BA,GAC1B,IAAI5mC,GAAK,EACT,OAAO,WACH,IAAI2Q,EAAOi2B,EAASnf,OACpB,OAAI9W,EAAKgX,KACE,MACX3nB,IACO,CAAC5B,MAAOuS,EAAKvS,MAAOyD,IAAK7B,GACpC,CACJ,CAqBsBmoC,CAAqBvB,IAlBnCsB,EAAQzX,GADcrpB,EAmB8C0/B,GAjBpE9mC,GAAK,EACLX,EAAM6oC,EAAM9qC,OACT,SAASqqB,IACZ,IAAI5lB,EAAMqmC,IAAQloC,GAClB,MAAY,cAAR6B,EACO4lB,IAEJznB,EAAIX,EAAM,CAACjB,MAAOgJ,EAAIvF,GAAMA,IAAKA,GAAO,IACnD,EAUJ,CAEA,SAASumC,GAAS/D,GACd,OAAO,WACH,GAAW,OAAPA,EAAa,MAAM,IAAIxnC,MAAM,gCACjC,IAAI6pC,EAASrC,EACbA,EAAK,KACLqC,EAAO7e,MAAMvrB,KAAMu8B,UACvB,CACJ,CAEA,SAASwP,GAAajK,GAClB,OAAO,SAAUh3B,EAAKooB,EAAUwP,GAE5B,GADAA,EAAW5F,EAAK4F,GAAYrG,GACxByF,GAAS,IAAMh3B,EACf,OAAO43B,EAAS,MAEpB,IAAIsJ,EAAW1B,GAASx/B,GACpBugB,GAAO,EACP4gB,EAAU,EACVC,GAAU,EAEd,SAASC,EAAiB/I,EAAKthC,GAE3B,GADAmqC,GAAW,EACP7I,EACA/X,GAAO,EACPqX,EAASU,OAER,IAAIthC,IAAUqoC,GAAc9e,GAAQ4gB,GAAW,EAEhD,OADA5gB,GAAO,EACAqX,EAAS,MAEVwJ,GACNE,GACJ,CACJ,CAEA,SAASA,IAEL,IADAF,GAAU,EACHD,EAAUnK,IAAUzW,GAAM,CAC7B,IAAIghB,EAAOL,IACX,GAAa,OAATK,EAKA,OAJAhhB,GAAO,OACH4gB,GAAW,GACXvJ,EAAS,OAIjBuJ,GAAW,EACX/Y,EAASmZ,EAAKvqC,MAAOuqC,EAAK9mC,IAAKumC,GAASK,GAC5C,CACAD,GAAU,CACd,CAEAE,GACJ,CACJ,CAsBA,SAASE,GAAY9B,EAAM1I,EAAO5O,EAAUwP,GACxCqJ,GAAajK,EAAbiK,CAAoBvB,EAAMzB,EAAU7V,GAAWwP,EACnD,CAEA,SAAS6J,GAAQxE,EAAIjG,GACjB,OAAO,SAAU0K,EAAUtZ,EAAUwP,GACjC,OAAOqF,EAAGyE,EAAU1K,EAAO5O,EAAUwP,EACzC,CACJ,CAGA,SAAS+J,GAAgBjC,EAAMtX,EAAUwP,GACrCA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI/V,EAAQ,EACRomB,EAAY,EACZ5rC,EAAS0pC,EAAK1pC,OAKlB,SAAS6rC,EAAiBvJ,EAAKthC,GACvBshC,EACAV,EAASU,KACCsJ,IAAc5rC,GAAWgB,IAAUqoC,GAC7CzH,EAAS,KAEjB,CAEA,IAZe,IAAX5hC,GACA4hC,EAAS,MAWNpc,EAAQxlB,EAAQwlB,IACnB4M,EAASsX,EAAKlkB,GAAQA,EAAOwlB,GAASa,GAE9C,CAGA,IAAIC,GAAgBL,GAAQD,GAAaO,KAyCrCC,GAAS,SAAStC,EAAMtX,EAAUwP,IACPpI,EAAYkQ,GAAQiC,GAAkBG,IAC5CpC,EAAMzB,EAAU7V,GAAWwP,EACpD,EAEA,SAASqK,GAAWhF,GAChB,OAAO,SAAUj9B,EAAKooB,EAAUwP,GAC5B,OAAOqF,EAAG+E,GAAQhiC,EAAKi+B,EAAU7V,GAAWwP,EAChD,CACJ,CAEA,SAASsK,GAAU9D,EAAQ1gC,EAAK0qB,EAAUwP,GACtCA,EAAWA,GAAYrG,EACvB7zB,EAAMA,GAAO,GACb,IAAIykC,EAAU,GACVpyB,EAAU,EACVqyB,EAAYnE,EAAU7V,GAE1BgW,EAAO1gC,GAAK,SAAU1G,EAAOqrC,EAAGzK,GAC5B,IAAIpc,EAAQzL,IACZqyB,EAAUprC,GAAO,SAAUshC,EAAKn6B,GAC5BgkC,EAAQ3mB,GAASrd,EACjBy5B,EAASU,EACb,GACJ,IAAG,SAAUA,GACTV,EAASU,EAAK6J,EAClB,GACJ,CAsCA,IAAIp9B,GAAMk9B,GAAWC,IAmCjBI,GAAYnE,EAAYp5B,IAE5B,SAASw9B,GAAgBtF,GACrB,OAAO,SAAUj9B,EAAKg3B,EAAO5O,EAAUwP,GACnC,OAAOqF,EAAGgE,GAAajK,GAAQh3B,EAAKi+B,EAAU7V,GAAWwP,EAC7D,CACJ,CAqBA,IAAI4K,GAAWD,GAAgBL,IAoB3BO,GAAYhB,GAAQe,GAAU,GAqB9BE,GAAkBvE,EAAYsE,IAWlC,SAASlU,GAAU5vB,EAAOypB,GAIxB,IAHA,IAAI5M,GAAS,EACTxlB,EAAkB,MAAT2I,EAAgB,EAAIA,EAAM3I,SAE9BwlB,EAAQxlB,IAC8B,IAAzCoyB,EAASzpB,EAAM6c,GAAQA,EAAO7c,KAIpC,OAAOA,CACT,CAqCA,IA5BuBgkC,GA4BnBC,GA3BK,SAASjX,EAAQvD,EAAU8F,GAMhC,IALA,IAAI1S,GAAS,EACTkmB,EAAW5qC,OAAO60B,GAClBsC,EAAQC,EAASvC,GACjB31B,EAASi4B,EAAMj4B,OAEZA,KAAU,CACf,IAAIyE,EAAMwzB,EAAM0U,GAAY3sC,IAAWwlB,GACvC,IAA+C,IAA3C4M,EAASsZ,EAASjnC,GAAMA,EAAKinC,GAC/B,KAEJ,CACA,OAAO/V,CACT,EAwBF,SAASkX,GAAWlX,EAAQvD,GAC1B,OAAOuD,GAAUiX,GAAQjX,EAAQvD,EAAUiB,GAC7C,CAgCA,SAASyZ,GAAU9rC,GACjB,OAAOA,GAAUA,CACnB,CAiCA,SAAS+rC,GAAYpkC,EAAO3H,EAAOgsC,GACjC,OAAOhsC,GAAUA,EAtBnB,SAAuB2H,EAAO3H,EAAOgsC,GAInC,IAHA,IAAIxnB,EAAQwnB,EAAY,EACpBhtC,EAAS2I,EAAM3I,SAEVwlB,EAAQxlB,GACf,GAAI2I,EAAM6c,KAAWxkB,EACnB,OAAOwkB,EAGX,OAAQ,CACV,CAaMynB,CAActkC,EAAO3H,EAAOgsC,GAxDlC,SAAuBrkC,EAAOukC,EAAWF,EAAWL,GAIlD,IAHA,IAAI3sC,EAAS2I,EAAM3I,OACfwlB,EAAQwnB,GAAaL,EAAY,GAAK,GAElCA,EAAYnnB,MAAYA,EAAQxlB,GACtC,GAAIktC,EAAUvkC,EAAM6c,GAAQA,EAAO7c,GACjC,OAAO6c,EAGX,OAAQ,CACV,CA+CM2nB,CAAcxkC,EAAOmkC,GAAWE,EACtC,CAiFA,IAAII,GAAO,SAAUC,EAAOC,EAAa1L,GACV,mBAAhB0L,IAEP1L,EAAW0L,EACXA,EAAc,MAElB1L,EAAW5F,EAAK4F,GAAYrG,GAC5B,IACIgS,EADUla,GAAKga,GACIrtC,OACvB,IAAKutC,EACD,OAAO3L,EAAS,MAEf0L,IACDA,EAAcC,GAGlB,IAAIpB,EAAU,CAAC,EACXqB,EAAe,EACfC,GAAW,EAEXlR,EAAYz7B,OAAOX,OAAO,MAE1ButC,EAAa,GAGbC,EAAe,GAEfC,EAAwB,CAAC,EAsC7B,SAASC,EAAYppC,EAAKqpC,GACtBJ,EAAWp8B,MAAK,YAkCpB,SAAiB7M,EAAKqpC,GAClB,IAAIL,EAAJ,CAEA,IAAIM,EAAe/C,IAAS,SAAS1I,EAAK14B,GAKtC,GAJA4jC,IACI/R,UAAUz7B,OAAS,IACnB4J,EAAS/F,EAAM43B,UAAW,IAE1B6G,EAAK,CACL,IAAI0L,EAAc,CAAC,EACnBnB,GAAWV,GAAS,SAASjsB,EAAK+tB,GAC9BD,EAAYC,GAAQ/tB,CACxB,IACA8tB,EAAYvpC,GAAOmF,EACnB6jC,GAAW,EACXlR,EAAYz7B,OAAOX,OAAO,MAE1ByhC,EAASU,EAAK0L,EAClB,MACI7B,EAAQ1nC,GAAOmF,EA1BvB2uB,GADoBgE,EA4BC93B,IA5BsB,IAClB,SAAUwiC,GAC/BA,GACJ,IACAiH,GA0BA,IAEAV,IACA,IAAIW,EAASlG,EAAU6F,EAAKA,EAAK9tC,OAAS,IACtC8tC,EAAK9tC,OAAS,EACdmuC,EAAOhC,EAAS4B,GAEhBI,EAAOJ,EA5BS,CA8BxB,CAhEQK,CAAQ3pC,EAAKqpC,EACjB,GACJ,CAEA,SAASI,IACL,GAA0B,IAAtBR,EAAW1tC,QAAiC,IAAjBwtC,EAC3B,OAAO5L,EAAS,KAAMuK,GAE1B,KAAMuB,EAAW1tC,QAAUwtC,EAAeF,GAC5BI,EAAW3lC,OACrBozB,EAGR,CA4EA,SAASkT,EAAcC,GACnB,IAAI1kC,EAAS,GAMb,OALAijC,GAAWQ,GAAO,SAAUS,EAAMrpC,GAC1B8c,EAAQusB,IAASf,GAAYe,EAAMQ,EAAU,IAAM,GACnD1kC,EAAO0H,KAAK7M,EAEpB,IACOmF,CACX,CAvIAijC,GAAWQ,GAAO,SAAUS,EAAMrpC,GAC9B,IAAK8c,EAAQusB,GAIT,OAFAD,EAAYppC,EAAK,CAACqpC,SAClBH,EAAar8B,KAAK7M,GAItB,IAAI8pC,EAAeT,EAAKjqC,MAAM,EAAGiqC,EAAK9tC,OAAS,GAC3CwuC,EAAwBD,EAAavuC,OACzC,GAA8B,IAA1BwuC,EAGA,OAFAX,EAAYppC,EAAKqpC,QACjBH,EAAar8B,KAAK7M,GAGtBmpC,EAAsBnpC,GAAO+pC,EAE7BjW,GAAUgW,GAAc,SAAUE,GAC9B,IAAKpB,EAAMoB,GACP,MAAM,IAAIhvC,MAAM,oBAAsBgF,EAClC,oCACAgqC,EAAiB,QACjBF,EAAarrB,KAAK,OA+BlC,IAAqBorB,EAAUrH,EACvByH,EADuBzH,EA7BK,WAEM,KAD9BuH,GAEIX,EAAYppC,EAAKqpC,EAEzB,GAyBAY,EAAgBnS,EADH+R,EA7BDG,MAgCZC,EAAgBnS,EAAU+R,GAAY,IAG1CI,EAAcp9B,KAAK21B,EA7BnB,GACJ,IAyEA,WAMI,IAFA,IACIltB,EAAU,EACP4zB,EAAa3tC,QAEhB+Z,IACAwe,GAAU8V,EAFIV,EAAazU,QAEW,SAAUyV,GACD,KAArCf,EAAsBe,IACxBhB,EAAar8B,KAAKq9B,EAE1B,IAGJ,GAAI50B,IAAYwzB,EACZ,MAAM,IAAI9tC,MACN,gEAGZ,CA5FAmvC,GACAV,GAsGJ,EAWA,SAASW,GAASlmC,EAAOypB,GAKvB,IAJA,IAAI5M,GAAS,EACTxlB,EAAkB,MAAT2I,EAAgB,EAAIA,EAAM3I,OACnC4J,EAAS3B,MAAMjI,KAEVwlB,EAAQxlB,GACf4J,EAAO4b,GAAS4M,EAASzpB,EAAM6c,GAAQA,EAAO7c,GAEhD,OAAOiB,CACT,CAGA,IAAI2mB,GAAY,kBAyBhB,IAAIue,GAAW,IAGX9Z,GAAcwT,EAAWA,EAASv+B,eAAY9F,EAC9C4qC,GAAiB/Z,GAAcA,GAAY5sB,cAAWjE,EAU1D,SAAS6qC,GAAahuC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIugB,EAAQvgB,GAEV,OAAO6tC,GAAS7tC,EAAOguC,IAAgB,GAEzC,GA7BF,SAAkBhuC,GAChB,MAAuB,iBAATA,GACX24B,EAAa34B,IAAU+nC,EAAW/nC,IAAUuvB,EACjD,CA0BM0e,CAASjuC,GACX,OAAO+tC,GAAiBA,GAAe7kC,KAAKlJ,GAAS,GAEvD,IAAI4I,EAAU5I,EAAQ,GACtB,MAAkB,KAAV4I,GAAkB,EAAI5I,IAAW8tC,GAAY,KAAOllC,CAC9D,CAyCA,SAASslC,GAAUvmC,EAAO0a,EAAOC,GAC/B,IAAItjB,EAAS2I,EAAM3I,OAEnB,OADAsjB,OAAcnf,IAARmf,EAAoBtjB,EAASsjB,GAC1BD,GAASC,GAAOtjB,EAAU2I,EAjCrC,SAAmBA,EAAO0a,EAAOC,GAC/B,IAAIkC,GAAS,EACTxlB,EAAS2I,EAAM3I,OAEfqjB,EAAQ,IACVA,GAASA,EAAQrjB,EAAS,EAAKA,EAASqjB,IAE1CC,EAAMA,EAAMtjB,EAASA,EAASsjB,GACpB,IACRA,GAAOtjB,GAETA,EAASqjB,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIzZ,EAAS3B,MAAMjI,KACVwlB,EAAQxlB,GACf4J,EAAO4b,GAAS7c,EAAM6c,EAAQnC,GAEhC,OAAOzZ,CACT,CAc6CulC,CAAUxmC,EAAO0a,EAAOC,EACrE,CA+CA,IAWI8rB,GAAe1b,OAAO,uFAc1B,IAAI2b,GAAkB,kBAQlBC,GAAW,IAAMD,GAAkB,IACnCE,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAOJ,GAAkB,IACvCK,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAO1BK,KACXC,GAAW,oBAEXC,GAAQD,GAAWF,IADP,gBAA0B,CAACH,GAAaC,GAAYC,IAAYzsB,KAAK,KAAO,IAAM4sB,GAAWF,GAAW,MAEpHI,GAAW,MAAQ,CAACP,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAUpsB,KAAK,KAAO,IAGxG+sB,GAAYvc,OAAO8b,GAAS,MAAQA,GAAS,KAAOQ,GAAWD,GAAO,KAoB1E,SAASG,GAAcnuB,GACrB,OAnDF,SAAoBA,GAClB,OAAOqtB,GAAarW,KAAKhX,EAC3B,CAiDSouB,CAAWpuB,GAZpB,SAAwBA,GACtB,OAAOA,EAAOwC,MAAM0rB,KAAc,EACpC,CAWMG,CAAeruB,GA7ErB,SAAsBA,GACpB,OAAOA,EAAOmJ,MAAM,GACtB,CA4EMmlB,CAAatuB,EACnB,CA4BA,IAAIuuB,GAAS,aAwBb,SAASpM,GAAKniB,EAAQwuB,EAAOC,GAE3B,IADAzuB,EA7BgB,OADA/gB,EA8BE+gB,GA7BK,GAAKitB,GAAahuC,MA8B1BwvC,QAAmBrsC,IAAVosC,GACtB,OAAOxuB,EAAO2E,QAAQ4pB,GAAQ,IAhClC,IAAkBtvC,EAkChB,IAAK+gB,KAAYwuB,EAAQvB,GAAauB,IACpC,OAAOxuB,EAET,IAAI0uB,EAAaP,GAAcnuB,GAC3B2uB,EAAaR,GAAcK,GAI/B,OAAOrB,GAAUuB,EA/JnB,SAAyBA,EAAYC,GAInC,IAHA,IAAIlrB,GAAS,EACTxlB,EAASywC,EAAWzwC,SAEfwlB,EAAQxlB,GAAU+sC,GAAY2D,EAAYD,EAAWjrB,GAAQ,IAAM,IAC5E,OAAOA,CACT,CAsJcmrB,CAAgBF,EAAYC,GA5K1C,SAAuBD,EAAYC,GAGjC,IAFA,IAAIlrB,EAAQirB,EAAWzwC,OAEhBwlB,KAAWunB,GAAY2D,EAAYD,EAAWjrB,GAAQ,IAAM,IACnE,OAAOA,CACT,CAwKYorB,CAAcH,EAAYC,GAAc,GAETxtB,KAAK,GAChD,CAEA,IAAI2tB,GAAU,qDACVC,GAAe,IACfC,GAAS,eACTC,GAAiB,mCA8FrB,SAASC,GAAW5D,EAAOzL,GACvB,IAAIsP,EAAW,CAAC,EAEhBrE,GAAWQ,GAAO,SAAUc,EAAQ1pC,GAChC,IAAI0sC,EACAC,EAAYrJ,EAAQoG,GACpBkD,GACED,GAA+B,IAAlBjD,EAAOnuC,QACrBoxC,GAA+B,IAAlBjD,EAAOnuC,OAEzB,GAAIuhB,EAAQ4sB,GACRgD,EAAShD,EAAOtqC,MAAM,GAAI,GAC1BsqC,EAASA,EAAOA,EAAOnuC,OAAS,GAEhCkxC,EAASzsC,GAAO0sC,EAAOnW,OAAOmW,EAAOnxC,OAAS,EAAIsxC,EAAUnD,QACzD,GAAIkD,EAEPH,EAASzsC,GAAO0pC,MACb,CAEH,GADAgD,EA/GZ,SAAqBze,GAOjB,OAJAA,GADAA,GADAA,EAAOA,EAAKtqB,WAAWse,QAAQsqB,GAAgB,KACnCzsB,MAAMssB,IAAS,GAAGnqB,QAAQ,IAAK,KAC7BgM,EAAKxH,MAAM4lB,IAAgB,IAC7B/hC,KAAI,SAAU6jB,GACtB,OAAOsR,GAAKtR,EAAIlM,QAAQqqB,GAAQ,IACpC,GAEJ,CAuGqBQ,CAAYpD,GACC,IAAlBA,EAAOnuC,SAAiBoxC,GAA+B,IAAlBD,EAAOnxC,OAC5C,MAAM,IAAIP,MAAM,0DAIf2xC,GAAWD,EAAOjY,MAEvBgY,EAASzsC,GAAO0sC,EAAOnW,OAAOsW,EAClC,CAEA,SAASA,EAAQnF,EAASqF,GACtB,IAAIC,EAAU5C,GAASsC,GAAQ,SAAUx5B,GACrC,OAAOw0B,EAAQx0B,EACnB,IACA85B,EAAQngC,KAAKkgC,GACbvJ,EAAUkG,GAAQ1jB,MAAM,KAAMgnB,EAClC,CACJ,IAEArE,GAAK8D,EAAUtP,EACnB,CAMA,SAAS8P,KACLxyC,KAAKyyC,KAAOzyC,KAAK0yC,KAAO,KACxB1yC,KAAKc,OAAS,CAClB,CAEA,SAAS6xC,GAAWC,EAAK5tC,GACrB4tC,EAAI9xC,OAAS,EACb8xC,EAAIH,KAAOG,EAAIF,KAAO1tC,CAC1B,CA4EA,SAAS02B,GAAMmX,EAAQzE,EAAajiB,GAChC,GAAmB,MAAfiiB,EACAA,EAAc,OAEb,GAAmB,IAAhBA,EACJ,MAAM,IAAI7tC,MAAM,gCAGpB,IAAIuyC,EAAU/J,EAAU8J,GACpBE,EAAa,EACbC,EAAc,GAEdC,GAAsB,EAC1B,SAASC,EAAQrwC,EAAMswC,EAAezQ,GAClC,GAAgB,MAAZA,GAAwC,mBAAbA,EAC3B,MAAM,IAAIniC,MAAM,oCAMpB,GAJA4Z,EAAEi5B,SAAU,EACP/wB,EAAQxf,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAK/B,QAAgBqZ,EAAEk5B,OAEvB,OAAO7K,GAAe,WAClBruB,EAAEm5B,OACN,IAGJ,IAAK,IAAI5vC,EAAI,EAAGS,EAAItB,EAAK/B,OAAQ4C,EAAIS,EAAGT,IAAK,CACzC,IAAI2Q,EAAO,CACPxR,KAAMA,EAAKa,GACXg/B,SAAUA,GAAYrG,GAGtB8W,EACAh5B,EAAEo5B,OAAOvrB,QAAQ3T,GAEjB8F,EAAEo5B,OAAOnhC,KAAKiC,EAEtB,CAEK4+B,IACDA,GAAsB,EACtBzK,GAAe,WACXyK,GAAsB,EACtB94B,EAAE9W,SACN,IAER,CAEA,SAASmwC,EAAMrF,GACX,OAAO,SAAS/K,GACZ2P,GAAc,EAEd,IAAK,IAAIrvC,EAAI,EAAGS,EAAIgqC,EAAMrtC,OAAQ4C,EAAIS,EAAGT,IAAK,CAC1C,IAAIkrC,EAAOT,EAAMzqC,GAEb4iB,EAAQunB,GAAYmF,EAAapE,EAAM,GAC7B,IAAVtoB,EACA0sB,EAAYnqC,QACLyd,EAAQ,GACf0sB,EAAYle,OAAOxO,EAAO,GAG9BsoB,EAAKlM,SAASnX,MAAMqjB,EAAMrS,WAEf,MAAP6G,GACAjpB,EAAE6B,MAAMonB,EAAKwL,EAAK/rC,KAE1B,CAEIkwC,GAAe54B,EAAEi0B,YAAcj0B,EAAE1X,QACjC0X,EAAEs5B,cAGFt5B,EAAEk5B,QACFl5B,EAAEm5B,QAENn5B,EAAE9W,SACN,CACJ,CAEA,IAAIqwC,GAAe,EACfv5B,EAAI,CACJo5B,OAAQ,IAAIf,GACZpE,YAAaA,EACbjiB,QAASA,EACTwnB,UAAWtX,EACXoX,YAAYpX,EACZ55B,OAAQ2rC,EAAc,EACtBwF,MAAOvX,EACPiX,MAAOjX,EACPrgB,MAAOqgB,EACP+W,SAAS,EACTS,QAAQ,EACRzhC,KAAM,SAAUvP,EAAM6/B,GAClBwQ,EAAQrwC,GAAM,EAAO6/B,EACzB,EACAoR,KAAM,WACF35B,EAAEm5B,MAAQjX,EACVliB,EAAEo5B,OAAOK,OACb,EACA5rB,QAAS,SAAUnlB,EAAM6/B,GACrBwQ,EAAQrwC,GAAM,EAAM6/B,EACxB,EACAvE,OAAQ,SAAU4V,GACd55B,EAAEo5B,OAAOpV,OAAO4V,EACpB,EACA1wC,QAAS,WAGL,IAAIqwC,EAAJ,CAIA,IADAA,GAAe,GACRv5B,EAAE05B,QAAUd,EAAa54B,EAAEi0B,aAAej0B,EAAEo5B,OAAOzyC,QAAO,CAC7D,IAAIqtC,EAAQ,GAAItrC,EAAO,GACnBsB,EAAIgW,EAAEo5B,OAAOzyC,OACbqZ,EAAEgS,UAAShoB,EAAIjB,KAAKvB,IAAIwC,EAAGgW,EAAEgS,UACjC,IAAK,IAAIzoB,EAAI,EAAGA,EAAIS,EAAGT,IAAK,CACxB,IAAIsB,EAAOmV,EAAEo5B,OAAO1qC,QACpBslC,EAAM/7B,KAAKpN,GACXguC,EAAY5gC,KAAKpN,GACjBnC,EAAKuP,KAAKpN,EAAKnC,KACnB,CAEAkwC,GAAc,EAEU,IAApB54B,EAAEo5B,OAAOzyC,QACTqZ,EAAEy5B,QAGFb,IAAe54B,EAAEi0B,aACjBj0B,EAAEw5B,YAGN,IAAIzpC,EAAK4hC,GAAS0H,EAAMrF,IACxB2E,EAAQjwC,EAAMqH,EAClB,CACAwpC,GAAe,CA1Bf,CA2BJ,EACA5yC,OAAQ,WACJ,OAAOqZ,EAAEo5B,OAAOzyC,MACpB,EACAmrC,QAAS,WACL,OAAO8G,CACX,EACAC,YAAa,WACT,OAAOA,CACX,EACAK,KAAM,WACF,OAAOl5B,EAAEo5B,OAAOzyC,OAASiyC,IAAe,CAC5C,EACAiB,MAAO,WACH75B,EAAE05B,QAAS,CACf,EACAI,OAAQ,YACa,IAAb95B,EAAE05B,SACN15B,EAAE05B,QAAS,EACXrL,EAAeruB,EAAE9W,SACrB,GAEJ,OAAO8W,CACX,CA+EA,SAAS+5B,GAAMrB,EAAQ1mB,GACnB,OAAOuP,GAAMmX,EAAQ,EAAG1mB,EAC5B,CA9TAqmB,GAAIznC,UAAUopC,WAAa,SAASnvC,GAQhC,OAPIA,EAAKovC,KAAMpvC,EAAKovC,KAAKjpB,KAAOnmB,EAAKmmB,KAChCnrB,KAAKyyC,KAAOztC,EAAKmmB,KAClBnmB,EAAKmmB,KAAMnmB,EAAKmmB,KAAKipB,KAAOpvC,EAAKovC,KAChCp0C,KAAK0yC,KAAO1tC,EAAKovC,KAEtBpvC,EAAKovC,KAAOpvC,EAAKmmB,KAAO,KACxBnrB,KAAKc,QAAU,EACRkE,CACX,EAEAwtC,GAAIznC,UAAU6oC,MAAQ,WAClB,KAAM5zC,KAAKyyC,MAAMzyC,KAAK6I,QACtB,OAAO7I,IACX,EAEAwyC,GAAIznC,UAAUspC,YAAc,SAASrvC,EAAMsvC,GACvCA,EAAQF,KAAOpvC,EACfsvC,EAAQnpB,KAAOnmB,EAAKmmB,KAChBnmB,EAAKmmB,KAAMnmB,EAAKmmB,KAAKipB,KAAOE,EAC3Bt0C,KAAK0yC,KAAO4B,EACjBtvC,EAAKmmB,KAAOmpB,EACZt0C,KAAKc,QAAU,CACnB,EAEA0xC,GAAIznC,UAAUwpC,aAAe,SAASvvC,EAAMsvC,GACxCA,EAAQF,KAAOpvC,EAAKovC,KACpBE,EAAQnpB,KAAOnmB,EACXA,EAAKovC,KAAMpvC,EAAKovC,KAAKjpB,KAAOmpB,EAC3Bt0C,KAAKyyC,KAAO6B,EACjBtvC,EAAKovC,KAAOE,EACZt0C,KAAKc,QAAU,CACnB,EAEA0xC,GAAIznC,UAAUid,QAAU,SAAShjB,GACzBhF,KAAKyyC,KAAMzyC,KAAKu0C,aAAav0C,KAAKyyC,KAAMztC,GACvC2tC,GAAW3yC,KAAMgF,EAC1B,EAEAwtC,GAAIznC,UAAUqH,KAAO,SAASpN,GACtBhF,KAAK0yC,KAAM1yC,KAAKq0C,YAAYr0C,KAAK0yC,KAAM1tC,GACtC2tC,GAAW3yC,KAAMgF,EAC1B,EAEAwtC,GAAIznC,UAAUlC,MAAQ,WAClB,OAAO7I,KAAKyyC,MAAQzyC,KAAKm0C,WAAWn0C,KAAKyyC,KAC7C,EAEAD,GAAIznC,UAAUivB,IAAM,WAChB,OAAOh6B,KAAK0yC,MAAQ1yC,KAAKm0C,WAAWn0C,KAAK0yC,KAC7C,EAEAF,GAAIznC,UAAUypC,QAAU,WAGpB,IAFA,IAAIhsC,EAAMO,MAAM/I,KAAKc,QACjB2zC,EAAOz0C,KAAKyyC,KACR3K,EAAM,EAAGA,EAAM9nC,KAAKc,OAAQgnC,IAChCt/B,EAAIs/B,GAAO2M,EAAK5xC,KAChB4xC,EAAOA,EAAKtpB,KAEhB,OAAO3iB,CACX,EAEAgqC,GAAIznC,UAAUozB,OAAS,SAAU4V,GAE7B,IADA,IAAIU,EAAOz0C,KAAKyyC,KACRgC,GAAM,CACV,IAAItpB,EAAOspB,EAAKtpB,KACZ4oB,EAAOU,IACPz0C,KAAKm0C,WAAWM,GAEpBA,EAAOtpB,CACX,CACA,OAAOnrB,IACX,EAyQA,IAAI00C,GAAenI,GAAQD,GAAa,GA0CxC,SAAS7hC,GAAO+/B,EAAMmK,EAAMzhB,EAAUwP,GAClCA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI6Q,EAAYnE,EAAU7V,GAC1BwhB,GAAalK,GAAM,SAASp8B,EAAG1K,EAAGg/B,GAC9BwK,EAAUyH,EAAMvmC,GAAG,SAASg1B,EAAKn6B,GAC7B0rC,EAAO1rC,EACPy5B,EAASU,EACb,GACJ,IAAG,SAASA,GACRV,EAASU,EAAKuR,EAClB,GACJ,CAwCA,SAASC,KACL,IAAIC,EAAalF,GAASpT,UAAWwM,GACrC,OAAO,WACH,IAAIzM,EAAO33B,EAAM43B,WACb8M,EAAOrpC,KAEPkK,EAAKoyB,EAAKA,EAAKx7B,OAAS,GACX,mBAANoJ,EACPoyB,EAAKtC,MAEL9vB,EAAKmyB,EAGT5xB,GAAOoqC,EAAYvY,GAAM,SAASwY,EAAS/M,EAAI79B,GAC3C69B,EAAGxc,MAAM8d,EAAMyL,EAAQhZ,QAAO,SAASsH,GACnC,IAAI2R,EAAWpwC,EAAM43B,UAAW,GAChCryB,EAAGk5B,EAAK2R,EACZ,IACJ,IACA,SAAS3R,EAAK6J,GACV/iC,EAAGqhB,MAAM8d,EAAM,CAACjG,GAAKtH,OAAOmR,GAChC,GACJ,CACJ,CAqCA,IAAI+H,GAAU,WACV,OAAOJ,GAAIrpB,MAAM,KAAM5mB,EAAM43B,WAAW0Y,UAC5C,EAEIC,GAAUnsC,MAAMgC,UAAU+wB,OAoB1BqZ,GAAc,SAAS3K,EAAM1I,EAAO5O,EAAUwP,GAC9CA,EAAWA,GAAYrG,EACvB,IAAI6Q,EAAYnE,EAAU7V,GAC1Boa,GAAS9C,EAAM1I,GAAO,SAAS9gB,EAAK0hB,GAChCwK,EAAUlsB,GAAK,SAASoiB,GACpB,OAAIA,EAAYV,EAASU,GAClBV,EAAS,KAAM/9B,EAAM43B,UAAW,GAC3C,GACJ,IAAG,SAAS6G,EAAKgS,GAEb,IADA,IAAI1qC,EAAS,GACJhH,EAAI,EAAGA,EAAI0xC,EAAWt0C,OAAQ4C,IAC/B0xC,EAAW1xC,KACXgH,EAASwqC,GAAQ3pB,MAAM7gB,EAAQ0qC,EAAW1xC,KAIlD,OAAOg/B,EAASU,EAAK14B,EACzB,GACJ,EA2BIoxB,GAASyQ,GAAQ4I,GAAatI,KAoB9BwI,GAAe9I,GAAQ4I,GAAa,GA4CpCG,GAAW,WACX,IAAIx6B,EAASnW,EAAM43B,WACfD,EAAO,CAAC,MAAMR,OAAOhhB,GACzB,OAAO,WAEH,OADeyhB,UAAUA,UAAUz7B,OAAS,GAC5ByqB,MAAMvrB,KAAMs8B,EAChC,CACJ,EAkBA,SAASiZ,GAASzzC,GAChB,OAAOA,CACT,CAEA,SAAS0zC,GAAcnvB,EAAOovB,GAC1B,OAAO,SAASvM,EAAQ1gC,EAAK0qB,EAAUhpB,GACnCA,EAAKA,GAAMmyB,EACX,IACIqZ,EADAC,GAAa,EAEjBzM,EAAO1gC,GAAK,SAAS1G,EAAOqrC,EAAGzK,GAC3BxP,EAASpxB,GAAO,SAASshC,EAAK14B,GACtB04B,EACAV,EAASU,GACF/c,EAAM3b,KAAYgrC,GACzBC,GAAa,EACbD,EAAaD,GAAU,EAAM3zC,GAC7B4gC,EAAS,KAAMyH,IAEfzH,GAER,GACJ,IAAG,SAASU,GACJA,EACAl5B,EAAGk5B,GAEHl5B,EAAG,KAAMyrC,EAAaD,EAAaD,GAAU,GAErD,GACJ,CACJ,CAEA,SAASG,GAAe3sC,EAAGmF,GACvB,OAAOA,CACX,CAqCA,IAAIynC,GAAS9I,GAAWyI,GAAcD,GAAUK,KAwB5CE,GAAczI,GAAgBmI,GAAcD,GAAUK,KAsBtDG,GAAexJ,GAAQuJ,GAAa,GAExC,SAASE,GAAYv9B,GACjB,OAAO,SAAUsvB,GACb,IAAIzL,EAAO33B,EAAM43B,UAAW,GAC5BD,EAAKlqB,MAAK,SAAUgxB,GAChB,IAAI9G,EAAO33B,EAAM43B,UAAW,GACL,iBAAZ5Q,UACHyX,EACIzX,QAAQ3P,OACR2P,QAAQ3P,MAAMonB,GAEXzX,QAAQlT,IACf4gB,GAAUiD,GAAM,SAAUluB,GACtBud,QAAQlT,GAAMrK,EAClB,IAGZ,IACA26B,EAAUhB,GAAIxc,MAAM,KAAM+Q,EAC9B,CACJ,CA+BA,IAAImB,GAAMuY,GAAY,OAsBtB,SAASC,GAASlO,EAAIlO,EAAM6I,GACxBA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Z,EAAMnN,EAAUhB,GAChBoO,EAAQpN,EAAUlP,GAEtB,SAAS1O,EAAKiY,GACV,GAAIA,EAAK,OAAOV,EAASU,GACzB,IAAI9G,EAAO33B,EAAM43B,UAAW,GAC5BD,EAAKlqB,KAAKiU,GACV8vB,EAAM5qB,MAAMvrB,KAAMs8B,EACtB,CAEA,SAASjW,EAAM+c,EAAKgT,GAChB,OAAIhT,EAAYV,EAASU,GACpBgT,OACLF,EAAI/qB,GADeuX,EAAS,KAEhC,CAEArc,EAAM,MAAM,EAEhB,CAwBA,SAASgwB,GAASnjB,EAAU2G,EAAM6I,GAC9BA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Q,EAAYnE,EAAU7V,GACtB/H,EAAO,SAASiY,GAChB,GAAIA,EAAK,OAAOV,EAASU,GACzB,IAAI9G,EAAO33B,EAAM43B,UAAW,GAC5B,GAAI1C,EAAKtO,MAAMvrB,KAAMs8B,GAAO,OAAO4Q,EAAU/hB,GAC7CuX,EAASnX,MAAM,KAAM,CAAC,MAAMuQ,OAAOQ,GACvC,EACA4Q,EAAU/hB,EACd,CAsBA,SAASmrB,GAAQpjB,EAAU2G,EAAM6I,GAC7B2T,GAASnjB,GAAU,WACf,OAAQ2G,EAAKtO,MAAMvrB,KAAMu8B,UAC7B,GAAGmG,EACP,CAsCA,SAAS6T,GAAO1c,EAAMkO,EAAIrF,GACtBA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Z,EAAMnN,EAAUhB,GAChBoO,EAAQpN,EAAUlP,GAEtB,SAAS1O,EAAKiY,GACV,GAAIA,EAAK,OAAOV,EAASU,GACzB+S,EAAM9vB,EACV,CAEA,SAASA,EAAM+c,EAAKgT,GAChB,OAAIhT,EAAYV,EAASU,GACpBgT,OACLF,EAAI/qB,GADeuX,EAAS,KAEhC,CAEAyT,EAAM9vB,EACV,CAEA,SAASmwB,GAActjB,GACnB,OAAO,SAAUpxB,EAAOwkB,EAAOoc,GAC3B,OAAOxP,EAASpxB,EAAO4gC,EAC3B,CACJ,CA2DA,SAAS+T,GAAUjM,EAAMtX,EAAUwP,GAC/BoK,GAAOtC,EAAMgM,GAAczN,EAAU7V,IAAYwP,EACrD,CAsBA,SAASgU,GAAYlM,EAAM1I,EAAO5O,EAAUwP,GACxCqJ,GAAajK,EAAbiK,CAAoBvB,EAAMgM,GAAczN,EAAU7V,IAAYwP,EAClE,CAqBA,IAAIO,GAAasJ,GAAQmK,GAAa,GAqCtC,SAASC,GAAY5O,GACjB,OAAIc,EAAQd,GAAYA,EACjBE,GAAc,SAAU3L,EAAMoG,GACjC,IAAIkU,GAAO,EACXta,EAAKlqB,MAAK,WACN,IAAIykC,EAAYta,UACZqa,EACApO,GAAe,WACX9F,EAASnX,MAAM,KAAMsrB,EACzB,IAEAnU,EAASnX,MAAM,KAAMsrB,EAE7B,IACA9O,EAAGxc,MAAMvrB,KAAMs8B,GACfsa,GAAO,CACX,GACJ,CAEA,SAASE,GAAM7tC,GACX,OAAQA,CACZ,CA8BA,IAAIuB,GAAQuiC,GAAWyI,GAAcsB,GAAOA,KAsBxCC,GAAa1J,GAAgBmI,GAAcsB,GAAOA,KAqBlDE,GAAczK,GAAQwK,GAAY,GAStC,SAASE,GAAa1xC,GACpB,OAAO,SAASkxB,GACd,OAAiB,MAAVA,OAAiBxxB,EAAYwxB,EAAOlxB,EAC7C,CACF,CAEA,SAAS2xC,GAAYhO,EAAQ1gC,EAAK0qB,EAAUwP,GACxC,IAAIyU,EAAc,IAAIpuC,MAAMP,EAAI1H,QAChCooC,EAAO1gC,GAAK,SAAU4F,EAAGkY,EAAOoc,GAC5BxP,EAAS9kB,GAAG,SAAUg1B,EAAKn6B,GACvBkuC,EAAY7wB,KAAWrd,EACvBy5B,EAASU,EACb,GACJ,IAAG,SAAUA,GACT,GAAIA,EAAK,OAAOV,EAASU,GAEzB,IADA,IAAI6J,EAAU,GACLvpC,EAAI,EAAGA,EAAI8E,EAAI1H,OAAQ4C,IACxByzC,EAAYzzC,IAAIupC,EAAQ76B,KAAK5J,EAAI9E,IAEzCg/B,EAAS,KAAMuK,EACnB,GACJ,CAEA,SAASmK,GAAclO,EAAQsB,EAAMtX,EAAUwP,GAC3C,IAAIuK,EAAU,GACd/D,EAAOsB,GAAM,SAAUp8B,EAAGkY,EAAOoc,GAC7BxP,EAAS9kB,GAAG,SAAUg1B,EAAKn6B,GACnBm6B,EACAV,EAASU,IAELn6B,GACAgkC,EAAQ76B,KAAK,CAACkU,MAAOA,EAAOxkB,MAAOsM,IAEvCs0B,IAER,GACJ,IAAG,SAAUU,GACLA,EACAV,EAASU,GAETV,EAAS,KAAMiN,GAAS1C,EAAQoK,MAAK,SAAUnxC,EAAGzF,GAC9C,OAAOyF,EAAEogB,MAAQ7lB,EAAE6lB,KACvB,IAAI2wB,GAAa,UAEzB,GACJ,CAEA,SAASK,GAAQpO,EAAQsB,EAAMtX,EAAUwP,IACxBpI,EAAYkQ,GAAQ0M,GAAcE,IACxClO,EAAQsB,EAAMzB,EAAU7V,GAAWwP,GAAYrG,EAC1D,CA6BA,IAAIoG,GAASsK,GAAWuK,IAqBpBC,GAAclK,GAAgBiK,IAmB9BE,GAAejL,GAAQgL,GAAa,GA+BxC,SAASE,GAAQ1P,EAAI2P,GACjB,IAAIrsB,EAAOygB,GAAS4L,GAAWrb,GAC3BuS,EAAO7F,EAAU4N,GAAY5O,KAEjC,SAAS5c,EAAKiY,GACV,GAAIA,EAAK,OAAO/X,EAAK+X,GACrBwL,EAAKzjB,EACT,CACAA,EACJ,CAqBA,IAAIwsB,GAAe,SAASnN,EAAM1I,EAAO5O,EAAUwP,GAC/CA,EAAWA,GAAYrG,EACvB,IAAI6Q,EAAYnE,EAAU7V,GAC1Boa,GAAS9C,EAAM1I,GAAO,SAAS9gB,EAAK0hB,GAChCwK,EAAUlsB,GAAK,SAASoiB,EAAK79B,GACzB,OAAI69B,EAAYV,EAASU,GAClBV,EAAS,KAAM,CAACn9B,IAAKA,EAAKyb,IAAKA,GAC1C,GACJ,IAAG,SAASoiB,EAAKgS,GAKb,IAJA,IAAI1qC,EAAS,CAAC,EAEVmkB,EAAiBjtB,OAAOmJ,UAAU8jB,eAE7BnrB,EAAI,EAAGA,EAAI0xC,EAAWt0C,OAAQ4C,IACnC,GAAI0xC,EAAW1xC,GAAI,CACf,IAAI6B,EAAM6vC,EAAW1xC,GAAG6B,IACpByb,EAAMo0B,EAAW1xC,GAAGsd,IAEpB6N,EAAe7jB,KAAKN,EAAQnF,GAC5BmF,EAAOnF,GAAK6M,KAAK4O,GAEjBtW,EAAOnF,GAAO,CAACyb,EAEvB,CAGJ,OAAO0hB,EAASU,EAAK14B,EACzB,GACJ,EAsCIktC,GAAUrL,GAAQoL,GAAc9K,KAqBhCgL,GAAgBtL,GAAQoL,GAAc,GA6BtCp2B,GAAMy0B,GAAY,OAuBtB,SAAS8B,GAAehtC,EAAKg3B,EAAO5O,EAAUwP,GAC1CA,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI0b,EAAS,CAAC,EACV7K,EAAYnE,EAAU7V,GAC1BoZ,GAAYxhC,EAAKg3B,GAAO,SAAS9gB,EAAKzb,EAAK4lB,GACvC+hB,EAAUlsB,EAAKzb,GAAK,SAAU69B,EAAK14B,GAC/B,GAAI04B,EAAK,OAAOjY,EAAKiY,GACrB2U,EAAOxyC,GAAOmF,EACdygB,GACJ,GACJ,IAAG,SAAUiY,GACTV,EAASU,EAAK2U,EAClB,GACJ,CA+CA,IAAIC,GAAYzL,GAAQuL,GAAgBjL,KAqBpCoL,GAAkB1L,GAAQuL,GAAgB,GAE9C,SAAS/d,GAAIjvB,EAAKvF,GACd,OAAOA,KAAOuF,CAClB,CAuCA,SAASotC,GAAQnQ,EAAIoQ,GACjB,IAAIxD,EAAO/yC,OAAOX,OAAO,MACrBm3C,EAASx2C,OAAOX,OAAO,MAC3Bk3C,EAASA,GAAU5C,GACnB,IAAIW,EAAMnN,EAAUhB,GAChBsQ,EAAWpQ,GAAc,SAAkB3L,EAAMoG,GACjD,IAAIn9B,EAAM4yC,EAAO5sB,MAAM,KAAM+Q,GACzBvC,GAAI4a,EAAMpvC,GACVijC,GAAe,WACX9F,EAASnX,MAAM,KAAMopB,EAAKpvC,GAC9B,IACOw0B,GAAIqe,EAAQ7yC,GACnB6yC,EAAO7yC,GAAK6M,KAAKswB,IAEjB0V,EAAO7yC,GAAO,CAACm9B,GACfwT,EAAI3qB,MAAM,KAAM+Q,EAAKR,QAAO,WACxB,IAAIQ,EAAO33B,EAAM43B,WACjBoY,EAAKpvC,GAAO+2B,EACZ,IAAIniB,EAAIi+B,EAAO7yC,UACR6yC,EAAO7yC,GACd,IAAK,IAAI7B,EAAI,EAAGS,EAAIgW,EAAErZ,OAAQ4C,EAAIS,EAAGT,IACjCyW,EAAEzW,GAAG6nB,MAAM,KAAM+Q,EAEzB,KAER,IAGA,OAFA+b,EAAS1D,KAAOA,EAChB0D,EAASC,WAAavQ,EACfsQ,CACX,CA2CA,IAAInwC,GAAWogC,EARXF,EACW/kC,EAAQ6E,SACZggC,EACIC,aAEAE,GAKf,SAASkQ,GAAUrP,EAAQiF,EAAOzL,GAC9BA,EAAWA,GAAYrG,EACvB,IAAI4Q,EAAU3S,EAAY6T,GAAS,GAAK,CAAC,EAEzCjF,EAAOiF,GAAO,SAAUS,EAAMrpC,EAAKm9B,GAC/BqG,EAAU6F,EAAV7F,EAAgB,SAAU3F,EAAK14B,GACvB6xB,UAAUz7B,OAAS,IACnB4J,EAAS/F,EAAM43B,UAAW,IAE9B0Q,EAAQ1nC,GAAOmF,EACfg4B,EAASU,EACb,GACJ,IAAG,SAAUA,GACTV,EAASU,EAAK6J,EAClB,GACJ,CAuEA,SAASuL,GAAcrK,EAAOzL,GAC1B6V,GAAUzL,GAAQqB,EAAOzL,EAC7B,CAqBA,SAAS+V,GAAgBtK,EAAOrM,EAAOY,GACnC6V,GAAUxM,GAAajK,GAAQqM,EAAOzL,EAC1C,CA2GA,IAAIgW,GAAU,SAAU7F,EAAQzE,GAC5B,IAAI0E,EAAU/J,EAAU8J,GACxB,OAAOnX,IAAM,SAAUoH,EAAO54B,GAC1B4oC,EAAQhQ,EAAM,GAAI54B,EACtB,GAAGkkC,EAAa,EACpB,EAyBIuK,GAAgB,SAAS9F,EAAQzE,GAEjC,IAAIj0B,EAAIu+B,GAAQ7F,EAAQzE,GA4CxB,OAzCAj0B,EAAE/H,KAAO,SAASvP,EAAM+1C,EAAUlW,GAE9B,GADgB,MAAZA,IAAkBA,EAAWrG,GACT,mBAAbqG,EACP,MAAM,IAAIniC,MAAM,oCAMpB,GAJA4Z,EAAEi5B,SAAU,EACP/wB,EAAQxf,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAK/B,OAEL,OAAO0nC,GAAe,WAClBruB,EAAEm5B,OACN,IAGJsF,EAAWA,GAAY,EAEvB,IADA,IAAIC,EAAW1+B,EAAEo5B,OAAOd,KACjBoG,GAAYD,GAAYC,EAASD,UACpCC,EAAWA,EAAS1tB,KAGxB,IAAK,IAAIznB,EAAI,EAAGS,EAAItB,EAAK/B,OAAQ4C,EAAIS,EAAGT,IAAK,CACzC,IAAI2Q,EAAO,CACPxR,KAAMA,EAAKa,GACXk1C,SAAUA,EACVlW,SAAUA,GAGVmW,EACA1+B,EAAEo5B,OAAOgB,aAAasE,EAAUxkC,GAEhC8F,EAAEo5B,OAAOnhC,KAAKiC,EAEtB,CACAm0B,EAAeruB,EAAE9W,QACrB,SAGO8W,EAAE6N,QAEF7N,CACX,EAsCA,SAAS2+B,GAAK3K,EAAOzL,GAEjB,GADAA,EAAW5F,EAAK4F,GAAYrG,IACvBha,EAAQ8rB,GAAQ,OAAOzL,EAAS,IAAI7hC,UAAU,yDACnD,IAAKstC,EAAMrtC,OAAQ,OAAO4hC,IAC1B,IAAK,IAAIh/B,EAAI,EAAGS,EAAIgqC,EAAMrtC,OAAQ4C,EAAIS,EAAGT,IACrCqlC,EAAUoF,EAAMzqC,GAAhBqlC,CAAoBrG,EAE5B,CAwBA,SAAS/yB,GAAalG,EAAOkrC,EAAMzhB,EAAUwP,GAEzCj4B,GADe9F,EAAM8E,GAAOwrC,UACXN,EAAMzhB,EAAUwP,EACrC,CAyCA,SAASqW,GAAQhR,GACb,IAAImO,EAAMnN,EAAUhB,GACpB,OAAOE,GAAc,SAAmB3L,EAAM0c,GAe1C,OAdA1c,EAAKlqB,MAAK,SAAkB4J,EAAOi9B,GAI3B,IAAIn3C,EAHJka,EACAg9B,EAAgB,KAAM,CAAEh9B,MAAOA,KAI3Bla,EADAy6B,UAAUz7B,QAAU,EACZm4C,EAEAt0C,EAAM43B,UAAW,GAE7Byc,EAAgB,KAAM,CAAEl3C,MAAOA,IAEvC,IAEOo0C,EAAI3qB,MAAMvrB,KAAMs8B,EAC3B,GACJ,CAqEA,SAAS4c,GAAW/K,GAChB,IAAIlB,EASJ,OARI5qB,EAAQ8rB,GACRlB,EAAU0C,GAASxB,EAAO4K,KAE1B9L,EAAU,CAAC,EACXU,GAAWQ,GAAO,SAASS,EAAMrpC,GAC7B0nC,EAAQ1nC,GAAOwzC,GAAQ/tC,KAAKhL,KAAM4uC,EACtC,KAEG3B,CACX,CAEA,SAASkM,GAASjQ,EAAQ1gC,EAAK0qB,EAAUwP,GACrC4U,GAAQpO,EAAQ1gC,GAAK,SAAS1G,EAAOoI,GACjCgpB,EAASpxB,GAAO,SAASshC,EAAKn6B,GAC1BiB,EAAGk5B,GAAMn6B,EACb,GACJ,GAAGy5B,EACP,CA6BA,IAAI1X,GAAS+hB,GAAWoM,IAqBpBC,GAAc/L,GAAgB8L,IAmB9BE,GAAe9M,GAAQ6M,GAAa,GAqBxC,SAASE,GAAWx3C,GAClB,OAAO,WACL,OAAOA,CACT,CACF,CAsFA,SAASy3C,GAAM1uC,EAAM+jC,EAAMlM,GACvB,IAGI8W,EAAU,CACVC,MAJgB,EAKhBC,aAAcJ,GAJK,IA+BvB,GARI/c,UAAUz7B,OAAS,GAAqB,mBAAT+J,GAC/B63B,EAAWkM,GAAQvS,EACnBuS,EAAO/jC,IAlBX,SAAoB4E,EAAKkP,GACrB,GAAiB,iBAANA,EACPlP,EAAIgqC,OAAS96B,EAAE86B,OAVH,EAYZhqC,EAAIiqC,aAAqC,mBAAf/6B,EAAEg7B,SACxBh7B,EAAEg7B,SACFL,IAAY36B,EAAEg7B,UAbH,GAeflqC,EAAImqC,YAAcj7B,EAAEi7B,gBACjB,IAAiB,iBAANj7B,GAA+B,iBAANA,EAGvC,MAAM,IAAIpe,MAAM,qCAFhBkP,EAAIgqC,OAAS96B,GAlBD,CAqBhB,CACJ,CAMIk7B,CAAWL,EAAS3uC,GACpB63B,EAAWA,GAAYrG,GAGP,mBAATuS,EACP,MAAM,IAAIruC,MAAM,qCAGpB,IAAIu5C,EAAQ/Q,EAAU6F,GAElBmL,EAAU,GACd,SAASC,IACLF,GAAM,SAAS1W,GACPA,GAAO2W,IAAYP,EAAQC,QACI,mBAAvBD,EAAQI,aACZJ,EAAQI,YAAYxW,IACxB7H,WAAWye,EAAcR,EAAQE,aAAaK,IAE9CrX,EAASnX,MAAM,KAAMgR,UAE7B,GACJ,CAEAyd,EACJ,CA8BA,IAAIC,GAAY,SAAUpvC,EAAM+jC,GACvBA,IACDA,EAAO/jC,EACPA,EAAO,MAEX,IAAIivC,EAAQ/Q,EAAU6F,GACtB,OAAO3G,GAAc,SAAU3L,EAAMoG,GACjC,SAASuM,EAAO/kC,GACZ4vC,EAAMvuB,MAAM,KAAM+Q,EAAKR,OAAO5xB,GAClC,CAEIW,EAAM0uC,GAAM1uC,EAAMokC,EAAQvM,GACzB6W,GAAMtK,EAAQvM,EAEvB,GACJ,EAkEA,SAASQ,GAAOiL,EAAOzL,GACnB6V,GAAU7D,GAAcvG,EAAOzL,EACnC,CAgCA,IAAIzB,GAAO8L,GAAWyI,GAAc0E,QAAS3E,KAuBzC4E,GAAY9M,GAAgBmI,GAAc0E,QAAS3E,KAsBnD6E,GAAa7N,GAAQ4N,GAAW,GAiDpC,SAASE,GAAQ7P,EAAMtX,EAAUwP,GAC7B,IAAIwK,EAAYnE,EAAU7V,GAW1B,SAASonB,EAAWpiC,EAAMqiC,GACtB,IAAIr0C,EAAIgS,EAAKsiC,SAAU/5C,EAAI85C,EAAMC,SACjC,OAAOt0C,EAAIzF,GAAK,EAAIyF,EAAIzF,EAAI,EAAI,CACpC,CAbAoP,GAAI26B,GAAM,SAAUp8B,EAAGs0B,GACnBwK,EAAU9+B,GAAG,SAAUg1B,EAAKoX,GACxB,GAAIpX,EAAK,OAAOV,EAASU,GACzBV,EAAS,KAAM,CAAC5gC,MAAOsM,EAAGosC,SAAUA,GACxC,GACJ,IAAG,SAAUpX,EAAK6J,GACd,GAAI7J,EAAK,OAAOV,EAASU,GACzBV,EAAS,KAAMiN,GAAS1C,EAAQoK,KAAKiD,GAAarD,GAAa,UACnE,GAMJ,CA2CA,SAASjb,GAAQgN,EAASyR,EAAcC,GACpC,IAAI3S,EAAKgB,EAAUC,GAEnB,OAAOf,GAAc,SAAU3L,EAAMoG,GACjC,IACIiY,EADAC,GAAW,EAcfte,EAAKlqB,MAAK,WACDwoC,IACDlY,EAASnX,MAAM,KAAMgR,WACrBf,aAAamf,GAErB,IAGAA,EAAQpf,YAnBR,WACI,IAAI9iB,EAAOuwB,EAAQvwB,MAAQ,YACvBuD,EAAS,IAAIzb,MAAM,sBAAwBkY,EAAO,gBACtDuD,EAAMiI,KAAO,YACTy2B,IACA1+B,EAAM0+B,KAAOA,GAEjBE,GAAW,EACXlY,EAAS1mB,EACb,GAUoCy+B,GACpC1S,EAAGxc,MAAM,KAAM+Q,EACnB,GACJ,CAGA,IAAIue,GAAa33C,KAAK43C,KAClBC,GAAY73C,KAAKgrB,IAyCrB,SAAS8sB,GAAU3yB,EAAOyZ,EAAO5O,EAAUwP,GACvC,IAAIwK,EAAYnE,EAAU7V,GAC1Boa,GA9BJ,SAAmBnpB,EAAOC,EAAK8G,EAAMuiB,GAKnC,IAJA,IAAInnB,GAAS,EACTxlB,EAASi6C,GAAUF,IAAYz2B,EAAMD,IAAU+G,GAAQ,IAAK,GAC5DxgB,EAAS3B,MAAMjI,GAEZA,KACL4J,EAAO+iC,EAAY3sC,IAAWwlB,GAASnC,EACvCA,GAAS+G,EAEX,OAAOxgB,CACT,CAoBauwC,CAAU,EAAG5yB,EAAO,GAAIyZ,EAAOoL,EAAWxK,EACvD,CAkCA,IAAI+W,GAAQlN,GAAQyO,GAAWnO,KAgB3BxJ,GAAckJ,GAAQyO,GAAW,GA4CrC,SAASvnB,GAAW+W,EAAMrX,EAAaD,EAAUwP,GACzCnG,UAAUz7B,QAAU,IACpB4hC,EAAWxP,EACXA,EAAWC,EACXA,EAAc9Q,EAAQmoB,GAAQ,GAAK,CAAC,GAExC9H,EAAW5F,EAAK4F,GAAYrG,GAC5B,IAAI6Q,EAAYnE,EAAU7V,GAE1B4Z,GAAOtC,GAAM,SAASvhC,EAAGiE,EAAGhD,GACxBgjC,EAAU/Z,EAAalqB,EAAGiE,EAAGhD,EACjC,IAAG,SAASk5B,GACRV,EAASU,EAAKjQ,EAClB,GACJ,CAuCA,SAAS+nB,GAAQ/M,EAAOzL,GACpB,IACIh4B,EADAsR,EAAQ,KAEZ0mB,EAAWA,GAAYrG,EACvB4G,GAAWkL,GAAO,SAASS,EAAMlM,GAC7BqG,EAAU6F,EAAV7F,EAAgB,SAAU3F,EAAK1+B,GAEvBgG,EADA6xB,UAAUz7B,OAAS,EACV6D,EAAM43B,UAAW,GAEjB73B,EAEbsX,EAAQonB,EACRV,GAAUU,EACd,GACJ,IAAG,WACCV,EAAS1mB,EAAOtR,EACpB,GACJ,CAeA,SAASywC,GAAUpT,GACf,OAAO,WACH,OAAQA,EAAGuQ,YAAcvQ,GAAIxc,MAAM,KAAMgR,UAC7C,CACJ,CAoCA,SAAS6e,GAAOvhB,EAAM3G,EAAUwP,GAC5BA,EAAWoJ,GAASpJ,GAAYrG,GAChC,IAAI6Q,EAAYnE,EAAU7V,GAC1B,IAAK2G,IAAQ,OAAO6I,EAAS,MAC7B,IAAIvX,EAAO,SAASiY,GAChB,GAAIA,EAAK,OAAOV,EAASU,GACzB,GAAIvJ,IAAQ,OAAOqT,EAAU/hB,GAC7B,IAAImR,EAAO33B,EAAM43B,UAAW,GAC5BmG,EAASnX,MAAM,KAAM,CAAC,MAAMuQ,OAAOQ,GACvC,EACA4Q,EAAU/hB,EACd,CAwBA,SAASkwB,GAAMxhB,EAAM3G,EAAUwP,GAC3B0Y,IAAO,WACH,OAAQvhB,EAAKtO,MAAMvrB,KAAMu8B,UAC7B,GAAGrJ,EAAUwP,EACjB,CA2DA,IAAIwD,GAAY,SAASiI,EAAOzL,GAE5B,GADAA,EAAW5F,EAAK4F,GAAYrG,IACvBha,EAAQ8rB,GAAQ,OAAOzL,EAAS,IAAIniC,MAAM,8DAC/C,IAAK4tC,EAAMrtC,OAAQ,OAAO4hC,IAC1B,IAAI4Y,EAAY,EAEhB,SAASC,EAASjf,GACd,IAAIsS,EAAO7F,EAAUoF,EAAMmN,MAC3Bhf,EAAKlqB,KAAK05B,GAAS3gB,IACnByjB,EAAKrjB,MAAM,KAAM+Q,EACrB,CAEA,SAASnR,EAAKiY,GACV,GAAIA,GAAOkY,IAAcnN,EAAMrtC,OAC3B,OAAO4hC,EAASnX,MAAM,KAAMgR,WAEhCgf,EAAS52C,EAAM43B,UAAW,GAC9B,CAEAgf,EAAS,GACb,EAmEIj1B,GAAQ,CACRiF,MAAOA,EACP6hB,UAAWA,GACXI,gBAAiBA,GACjB/E,SAAUA,EACVyF,KAAMA,GACN6D,WAAYA,GACZmC,MAAOA,GACPc,QAASA,GACTlZ,OAAQA,GACRqZ,YAAaA,GACbE,aAAcA,GACdC,SAAUA,GACVO,OAAQA,GACRC,YAAaA,GACbC,aAAcA,GACdtY,IAAKA,GACLwY,SAAUA,GACVK,QAASA,GACTD,SAAUA,GACVE,OAAQA,GACRiF,KAAM/E,GACNA,UAAWC,GACX5J,OAAQA,GACRR,YAAaA,GACboI,aAAcA,GACdzR,WAAYA,GACZ0T,YAAaA,GACbnsC,MAAOA,GACPusC,WAAYA,GACZC,YAAaA,GACbvU,OAAQA,GACR8U,YAAaA,GACbC,aAAcA,GACdC,QAASA,GACTG,QAASA,GACTD,aAAcA,GACdE,cAAeA,GACft2B,IAAKA,GACL1R,IAAKA,GACLy9B,SAAUA,GACVC,UAAWA,GACXyK,UAAWA,GACXF,eAAgBA,GAChBG,gBAAiBA,GACjBC,QAASA,GACThwC,SAAUA,GACVuzC,SAAUjD,GACVA,cAAeC,GACfE,cAAeA,GACfjd,MAAOgd,GACPI,KAAMA,GACNruC,OAAQA,GACRkF,YAAaA,GACbopC,QAASA,GACTG,WAAYA,GACZluB,OAAQA,GACRouB,YAAaA,GACbC,aAAcA,GACdE,MAAOA,GACPU,UAAWA,GACXrF,IAAKA,GACL1R,OAAQA,GACRiF,aAAcK,EACdvH,KAAMA,GACNkZ,UAAWA,GACXC,WAAYA,GACZC,OAAQA,GACRre,QAASA,GACTyd,MAAOA,GACPiC,WAAYV,GACZ3X,YAAaA,GACb5P,UAAWA,GACXynB,QAASA,GACTC,UAAWA,GACXE,MAAOA,GACPnV,UAAWA,GACXkV,OAAQA,GAGRO,IAAKnxC,GACLoxC,SAAU7E,GACV8E,UAAW7E,GACXxX,IAAKyB,GACL6a,SAAU3B,GACV4B,UAAW3B,GACX4B,KAAMnG,GACNoG,UAAWnG,GACXoG,WAAYnG,GACZ31B,QAASq2B,GACT0F,cAAelZ,GACfmZ,aAAc1F,GACd2F,UAAWvP,GACXwP,gBAAiB5H,GACjB6H,eAAgBjQ,GAChBkQ,OAAQ/xC,GACRgyC,MAAOhyC,GACPiyC,MAAO/sC,GACPgtC,OAAQla,GACRma,YAAarF,GACbsF,aAAcrF,GACdsF,SAAUrU,GAGd7oC,EAAiB,QAAI0mB,GACrB1mB,EAAQ2rB,MAAQA,EAChB3rB,EAAQwtC,UAAYA,GACpBxtC,EAAQ4tC,gBAAkBA,GAC1B5tC,EAAQ6oC,SAAWA,EACnB7oC,EAAQsuC,KAAOA,GACftuC,EAAQmyC,WAAaA,GACrBnyC,EAAQs0C,MAAQA,GAChBt0C,EAAQo1C,QAAUA,GAClBp1C,EAAQk8B,OAASA,GACjBl8B,EAAQu1C,YAAcA,GACtBv1C,EAAQy1C,aAAeA,GACvBz1C,EAAQ01C,SAAWA,GACnB11C,EAAQi2C,OAASA,GACjBj2C,EAAQk2C,YAAcA,GACtBl2C,EAAQm2C,aAAeA,GACvBn2C,EAAQ69B,IAAMA,GACd79B,EAAQq2C,SAAWA,GACnBr2C,EAAQ02C,QAAUA,GAClB12C,EAAQy2C,SAAWA,GACnBz2C,EAAQ22C,OAASA,GACjB32C,EAAQ47C,KAAO/E,GACf72C,EAAQ62C,UAAYC,GACpB92C,EAAQktC,OAASA,GACjBltC,EAAQ0sC,YAAcA,GACtB1sC,EAAQ80C,aAAeA,GACvB90C,EAAQqjC,WAAaA,GACrBrjC,EAAQ+2C,YAAcA,GACtB/2C,EAAQ4K,MAAQA,GAChB5K,EAAQm3C,WAAaA,GACrBn3C,EAAQo3C,YAAcA,GACtBp3C,EAAQ6iC,OAASA,GACjB7iC,EAAQ23C,YAAcA,GACtB33C,EAAQ43C,aAAeA,GACvB53C,EAAQ63C,QAAUA,GAClB73C,EAAQg4C,QAAUA,GAClBh4C,EAAQ+3C,aAAeA,GACvB/3C,EAAQi4C,cAAgBA,GACxBj4C,EAAQ2hB,IAAMA,GACd3hB,EAAQiQ,IAAMA,GACdjQ,EAAQ0tC,SAAWA,GACnB1tC,EAAQ2tC,UAAYA,GACpB3tC,EAAQo4C,UAAYA,GACpBp4C,EAAQk4C,eAAiBA,GACzBl4C,EAAQq4C,gBAAkBA,GAC1Br4C,EAAQs4C,QAAUA,GAClBt4C,EAAQsI,SAAWA,GACnBtI,EAAQ67C,SAAWjD,GACnB54C,EAAQ44C,cAAgBC,GACxB74C,EAAQ+4C,cAAgBA,GACxB/4C,EAAQ87B,MAAQgd,GAChB94C,EAAQk5C,KAAOA,GACfl5C,EAAQ6K,OAASA,GACjB7K,EAAQ+P,YAAcA,GACtB/P,EAAQm5C,QAAUA,GAClBn5C,EAAQs5C,WAAaA,GACrBt5C,EAAQorB,OAASA,GACjBprB,EAAQw5C,YAAcA,GACtBx5C,EAAQy5C,aAAeA,GACvBz5C,EAAQ25C,MAAQA,GAChB35C,EAAQq6C,UAAYA,GACpBr6C,EAAQg1C,IAAMA,GACdh1C,EAAQsjC,OAASA,GACjBtjC,EAAQuoC,aAAeK,EACvB5oC,EAAQqhC,KAAOA,GACfrhC,EAAQu6C,UAAYA,GACpBv6C,EAAQw6C,WAAaA,GACrBx6C,EAAQy6C,OAASA,GACjBz6C,EAAQo8B,QAAUA,GAClBp8B,EAAQ65C,MAAQA,GAChB75C,EAAQ87C,WAAaV,GACrBp7C,EAAQyjC,YAAcA,GACtBzjC,EAAQ6zB,UAAYA,GACpB7zB,EAAQs7C,QAAUA,GAClBt7C,EAAQu7C,UAAYA,GACpBv7C,EAAQy7C,MAAQA,GAChBz7C,EAAQsmC,UAAYA,GACpBtmC,EAAQw7C,OAASA,GACjBx7C,EAAQ+7C,IAAMnxC,GACd5K,EAAQg8C,SAAW7E,GACnBn3C,EAAQi8C,UAAY7E,GACpBp3C,EAAQ4/B,IAAMyB,GACdrhC,EAAQk8C,SAAW3B,GACnBv6C,EAAQm8C,UAAY3B,GACpBx6C,EAAQo8C,KAAOnG,GACfj2C,EAAQq8C,UAAYnG,GACpBl2C,EAAQs8C,WAAanG,GACrBn2C,EAAQwgB,QAAUq2B,GAClB72C,EAAQu8C,cAAgBlZ,GACxBrjC,EAAQw8C,aAAe1F,GACvB92C,EAAQy8C,UAAYvP,GACpBltC,EAAQ08C,gBAAkB5H,GAC1B90C,EAAQ28C,eAAiBjQ,GACzB1sC,EAAQ48C,OAAS/xC,GACjB7K,EAAQ68C,MAAQhyC,GAChB7K,EAAQ88C,MAAQ/sC,GAChB/P,EAAQ+8C,OAASla,GACjB7iC,EAAQg9C,YAAcrF,GACtB33C,EAAQi9C,aAAerF,GACvB53C,EAAQk9C,SAAWrU,EAEnB7mC,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,GAErD,CA1+KgEnC,CAAQC,+BCGvEC,EAAOD,QAAU,EAAjB,+BCJW,SAAS+e,EAAEA,EAAExN,IAAI,MAAMA,GAAGA,EAAEwN,EAAE7d,UAAUqQ,EAAEwN,EAAE7d,QAAQ,IAAI,IAAIV,EAAE,EAAEuc,EAAE,IAAI5T,MAAMoI,GAAG/Q,EAAE+Q,EAAE/Q,IAAIuc,EAAEvc,GAAGue,EAAEve,GAAG,OAAOuc,CAAC,CAAC,SAASxL,EAAEA,EAAE/Q,GAAG,IAAIuc,EAAE,GAAG,oBAAoB+X,QAAQ,MAAMvjB,EAAEujB,OAAO4V,UAAU,CAAC,GAAGvhC,MAAMsZ,QAAQlR,KAAKwL,EAAE,SAASxL,EAAE/Q,GAAG,GAAG+Q,EAAE,CAAC,GAAG,iBAAiBA,EAAE,OAAOwN,EAAExN,OAAE,GAAQ,IAAIwL,EAAE/a,OAAOmJ,UAAU7B,SAAS8B,KAAKmG,GAAGxM,MAAM,GAAG,GAAG,MAAM,WAAWgY,GAAGxL,EAAE/O,cAAcua,EAAExL,EAAE/O,YAAYqW,MAAM,QAAQkE,GAAG,QAAQA,EAAE5T,MAAMC,KAAKmI,GAAG,cAAcwL,GAAG,2CAA2Ckd,KAAKld,GAAGgC,EAAExN,OAAE,QAAQ,CAAM,CAAC,CAArS,CAAuSA,KAAK/Q,GAAG+Q,GAAG,iBAAiBA,EAAErQ,OAAO,CAAC6b,IAAIxL,EAAEwL,GAAG,IAAIzW,EAAE,EAAE,OAAO,WAAW,OAAOA,GAAGiL,EAAErQ,OAAO,CAACuqB,MAAK,GAAI,CAACA,MAAK,EAAGvpB,MAAMqP,EAAEjL,KAAK,CAAC,CAAC,MAAM,IAAIrF,UAAU,wIAAwI,CAAC,OAAO8b,EAAExL,EAAEujB,OAAO4V,aAAanf,KAAK4xB,KAAKpgC,EAAE,CAAC,SAASvc,EAAEue,EAAEve,GAAG,YAAO,IAASA,IAAIA,EAAE,iaAAiaA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE,GAAG,YAAO,IAASue,IAAIve,GAAG,WAAWue,GAAGxN,EAAEqW,QAAQ,YAAYpnB,EAAE,CAApF,CAAsFue,EAAEq+B,QAAQ58C,GAAGA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE,GAAG,YAAO,IAASue,IAAIve,GAAG,QAAQue,GAAGxN,EAAEqW,QAAQ,SAASpnB,EAAE,CAA9E,CAAgFue,EAAEs+B,KAAK78C,GAAGA,EAAE,SAASue,EAAExN,GAAG,IAAI/Q,EAAE+Q,EAAE,QAAG,IAASwN,EAAE,IAAI,IAAIhC,KAAKgC,EAAElG,KAAKkG,EAAElG,MAAM,IAAIkG,EAAEu+B,IAAIv+B,EAAEu+B,KAAK,GAAGv+B,EAAEve,EAAEA,EAAEonB,QAAQ,IAAI7K,EAAE,IAAIgC,EAAEhC,GAAG,MAAM,OAAOvc,CAAC,CAA/H,CAAiIue,EAAEw+B,IAAI/8C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,WAAW1F,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,OAAO7K,EAAE,CAA5K,CAA8KgC,EAAE0+B,GAAGj9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,UAAU1F,EAAEqmC,GAAG,IAAI,CAAC,OAAOl9C,EAAEonB,QAAQ,MAAM7K,EAAE,CAAxK,CAA0KgC,EAAEzY,EAAE9F,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,aAAa1F,EAAEqmC,GAAG,IAAI,CAAC,OAAOl9C,EAAEonB,QAAQ,SAAS7K,EAAE,CAA9K,CAAgLgC,EAAE4+B,KAAKn9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,cAAc1F,EAAEitB,MAAM,IAAI,CAAC,OAAO9jC,EAAEonB,QAAQ,UAAU7K,EAAE,CAAnL,CAAqLgC,EAAE6+B,MAAMp9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,WAAW1F,EAAEwmC,WAAW,KAAKxmC,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,OAAO7K,EAAE,CAA9L,CAAgMgC,EAAE++B,GAAGt9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAEmmC,KAAK,IAAI,CAAC,OAAOh9C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA9K,CAAgLgC,EAAEg/B,IAAIv9C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY,IAAIwR,EAAElX,EAAE2tB,IAAI,iBAAiBzW,EAAExR,GAAG,IAAIwR,EAAE,IAAIA,aAAaplB,QAAQ4T,GAAGwR,EAAEte,KAAI,SAAU8O,GAAG,MAAM,IAAIA,EAAE,GAAI,IAAGqF,KAAK,MAAMrH,GAAG,IAAI,CAAC,OAAOvc,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA/R,CAAiSgC,EAAEimB,IAAIxkC,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAE2hC,SAAS,KAAKj8B,GAAG1F,EAAE2mC,OAAO,KAAKjhC,GAAG1F,EAAE4mC,KAAK,KAAKlhC,GAAG1F,EAAE6mC,OAAO,IAAI,CAAC,OAAO19C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAAnO,CAAqOgC,EAAEo/B,IAAI39C,GAAGA,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAEpU,KAAK,IAAI,CAAC,OAAOzC,EAAEonB,QAAQ,QAAQ7K,EAAE,CAA9K,CAAgLgC,EAAEq/B,IAAI59C,IAAIA,EAAE,SAASue,EAAExN,GAAGA,GAAGA,EAAEA,EAAEqW,QAAQ,SAAS7I,EAAEq+B,WAAWr+B,EAAEw+B,KAAKx+B,EAAEw+B,IAAI1kC,MAAM,KAAK+O,QAAQ,cAAa,IAAKpd,MAAM08B,eAAe,IAAI1mC,EAAE8C,KAAK+6C,MAAM7zC,KAAKC,MAAM,KAAK,OAAO8G,EAAEqW,QAAQ,SAAS,GAAGpnB,EAAE,CAA1L,CAA4Lue,EAAEve,EAAE,SAASue,EAAEve,GAAG,IAAIuc,EAAE,GAAG,GAAGgC,EAAE,IAAI,IAAIzY,EAAExC,EAAEyN,EAAEwN,KAAKzY,EAAExC,KAAK2nB,MAAM,CAAC,IAAIpU,EAAE/Q,EAAEpE,MAAM6a,IAAI1F,EAAEwB,MAAM,KAAK,KAAKxB,EAAEimC,MAAMvgC,GAAG1F,EAAEimC,IAAI,MAAMvgC,GAAG,YAAY1F,EAAE2hC,SAAS,KAAKj8B,GAAG1F,EAAE2mC,OAAO,KAAKjhC,GAAG,IAAI1F,EAAE6mC,OAAO,KAAK,CAAC,OAAO19C,EAAEonB,QAAQ,QAAQ7K,EAAE,CAAzN,CAA2NgC,EAAEu/B,IAAI99C,KAAKonB,QAAQ,YAAY,OAAO,CAAC,SAAS7K,EAAEgC,GAAG,OAAO,SAASA,GAAG,IAAI,IAAIve,EAAEuc,EAAE,CAAC,EAAE4V,EAAEphB,EAAEwN,EAAEqN,MAAM,SAAS5rB,EAAEmyB,KAAKlH,MAAM,CAAC,IAAInnB,EAAE9D,EAAE0B,MAAM,GAAGoC,GAAGA,EAAE8gC,OAAO,CAAC,IAAIpzB,EAAE1N,EAAEqjB,cAAc,YAAYsS,KAAKjoB,IAAI+K,EAAEioB,IAAIjoB,EAAEioB,KAAK,GAAGjoB,EAAEioB,IAAIxyB,KAAK8H,EAAEhW,KAAK,IAAI0N,EAAEsS,QAAQ,WAAWvH,EAAEqgC,QAAQ94C,EAAE8nB,MAAM,QAAQ,GAAG,IAAIpa,EAAEsS,QAAQ,QAAQvH,EAAEsgC,KAAKpzC,SAAS3F,EAAE8nB,MAAM,QAAQ,GAAG,IAAI,YAAY6N,KAAKjoB,GAAG+K,EAAEwgC,IAAIj3C,EAAEhC,GAAG,WAAW21B,KAAKjoB,IAAI+K,EAAE0gC,GAAG1gC,EAAE0gC,IAAI,GAAG1gC,EAAE0gC,GAAGjrC,KAAK1O,EAAEQ,KAAK,UAAU21B,KAAKjoB,IAAI+K,EAAEzW,EAAEyW,EAAEzW,GAAG,GAAGyW,EAAEzW,EAAEkM,KAAK6E,EAAE/S,EAAEyY,EAAEzW,KAAK,aAAa2zB,KAAKjoB,IAAI+K,EAAE4gC,KAAK5gC,EAAE4gC,MAAM,GAAG5gC,EAAE4gC,KAAKnrC,KAAK+b,EAAEjqB,KAAK,cAAc21B,KAAKjoB,IAAI+K,EAAE6gC,MAAM7gC,EAAE6gC,OAAO,GAAG7gC,EAAE6gC,MAAMprC,KAAKjO,EAAED,KAAK,WAAW21B,KAAKjoB,IAAI+K,EAAE+gC,GAAG/gC,EAAE+gC,IAAI,GAAG/gC,EAAE+gC,GAAGtrC,KAAKrD,EAAE7K,KAAK,YAAY21B,KAAKjoB,IAAI+K,EAAEghC,IAAIhhC,EAAEghC,KAAK,GAAGhhC,EAAEghC,IAAIvrC,KAAKjM,EAAEjC,EAAEyY,EAAEghC,IAAIhhC,EAAEqgC,WAAW,YAAYnjB,KAAKjoB,IAAI+K,EAAEohC,IAAIphC,EAAEohC,KAAK,GAAGphC,EAAEohC,IAAI3rC,KAAKO,EAAEzO,KAAK,YAAY21B,KAAKjoB,IAAI+K,EAAEqhC,IAAIrhC,EAAEqhC,KAAK,GAAGrhC,EAAEqhC,IAAI5rC,KAAKgI,EAAElW,KAAK,YAAY21B,KAAKjoB,KAAK+K,EAAEuhC,IAAIvhC,EAAEuhC,KAAK,GAAGvhC,EAAEuhC,IAAI9rC,KAAKnJ,EAAE/E,IAAI,CAAC,CAAC,OAAOyY,CAAC,CAAp0B,CAAs0BgC,EAAE,SAASA,GAAG,IAAI,IAAIxN,EAAE,GAAG/Q,EAAE,kBAAkBuc,EAAEvc,EAAE8zB,KAAKvV,GAAG,OAAOhC,GAAG,CAAC,IAAIzW,EAAEyW,EAAE,GAAG6K,QAAQ,QAAQ,KAAKrW,EAAEiB,KAAK,CAACiT,MAAM1I,EAAEwhC,YAAYj4C,IAAIyW,EAAEvc,EAAE8zB,KAAKvV,EAAE,CAAC,IAAI,IAAIjb,EAAEib,EAAEqN,MAAM,IAAI/U,EAAE,EAAEkX,EAAEhd,EAAE8F,EAAEkX,EAAErtB,OAAOmW,IAAI,CAAC,IAAI9S,EAAEgqB,EAAElX,GAAGlI,EAAE5K,EAAEkhB,MAAM3hB,EAAEoxB,OAAO/lB,EAAEuX,MAAMvX,EAAE,GAAGjO,OAAOqD,EAAEg6C,YAAY,CAAC,OAAOz6C,EAAEsgB,KAAK,IAAIwD,QAAQ,WAAW,IAAI,CAAxS,CAA0S7I,EAAE,SAASA,GAAG,OAAOA,EAAE6I,QAAQ,iBAAgB,SAAU7I,EAAExN,GAAG,OAAOA,GAAG,EAAG,GAAE,CAA3E,CAA6EwN,IAAI,CAAC,SAASzY,EAAEyY,GAAG,IAAIxN,EAAE,CAAC,EAAE/Q,EAAEue,EAAEqmB,OAAOhZ,MAAM,QAAQrP,EAAEvc,EAAEU,OAAO,OAAOqQ,EAAEsH,KAAKrY,EAAE,GAAG+Q,EAAEitC,QAAQv0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEktC,OAAOx0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEooC,MAAM1vC,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEmtC,QAAQz0C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEotC,OAAO10C,SAASzJ,EAAEuc,EAAE,GAAG,IAAIxL,EAAEqtC,MAAMp+C,EAAEuc,EAAE,GAAGxL,EAAEstC,MAAMr+C,EAAEuc,EAAE,GAAG7S,MAAM1J,EAAE,MAAM+Q,EAAE+rC,IAAIrzC,SAASzJ,EAAE,GAAG,KAAK+Q,CAAC,CAAC,SAASzN,EAAEib,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGisC,KAAKjsC,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS6W,EAAE0H,EAAExN,GAAG,IAAI/Q,EAAEue,EAAEqmB,OAAOhZ,MAAM,QAAQrP,EAAEgC,EAAEqmB,OAAOzd,cAAcyE,MAAM,QAAQ9lB,EAAE,CAACuS,KAAKrY,EAAE,GAAGk9C,GAAGl9C,EAAEA,EAAEU,OAAO,IAAI,OAAO,IAAI6b,EAAE+hC,YAAY,OAAOx4C,EAAEuS,KAAKtH,EAAErQ,OAAOqQ,EAAEA,EAAErQ,OAAO,GAAG2X,KAAK,KAAK3O,MAAM1J,EAAE,MAAM8F,EAAEg3C,IAAIrzC,SAASzJ,EAAE,GAAG,KAAK8F,CAAC,CAAC,SAASioB,EAAExP,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGmsC,GAAGnsC,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS+D,EAAEwa,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAG+yB,MAAM/yB,EAAEA,EAAErQ,OAAO,IAAI,OAAOgJ,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS2O,EAAE4P,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAGssC,WAAW5zC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIg9C,KAAKjsC,EAAE/Q,EAAE,IAAI,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,CAAC,SAASzC,EAAEyE,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAO3f,MAAM,6BAA6B,IAAIlU,EAAE,MAAM,IAAI5Q,MAAM,kCAAkC,IAAIH,EAAEuc,EAAExL,EAAErQ,OAAOoF,EAAEiL,EAAE+S,QAAQ,OAAO,SAASxgB,EAAEib,GAAG,OAAOA,EAAEuF,QAAQ,MAAM,IAAIvF,EAAEA,EAAEqN,MAAM,KAAK,IAAIrN,CAAC,CAACve,EAAEuc,EAAEzW,EAAE,EAAE,EAAE,GAAG41B,OAAO3qB,EAAExM,MAAMuB,EAAE,GAAG2J,IAAInM,IAAIA,EAAEyN,EAAEwL,EAAE,IAAI,IAAI1F,EAAE,CAACwB,KAAKtH,EAAE,GAAGyzB,IAAIxkC,GAAG,OAAO0J,MAAMqH,EAAE,MAAM8F,EAAEimC,IAAIrzC,SAASsH,EAAE,GAAG,KAAK8F,CAAC,CAAC,SAAS9Q,EAAEwY,EAAExN,EAAE/Q,GAAG,IAAIuc,EAAEgC,EAAEqmB,OAAOhZ,MAAM,QAAQ,IAAIrN,EAAEqmB,OAAOzd,cAAcyE,MAAM,QAAQ0yB,YAAY,QAAQvtC,EAAEA,EAAErQ,OAAO,IAAI6b,EAAEqL,QAAQ7W,EAAEA,EAAErQ,OAAO,GAAG2X,MAAM,IAAIvS,EAAE,CAACuS,KAAKkE,EAAE,GAAGgiC,SAAShiC,EAAE,GAAG,IAAIvc,EAAEg9C,KAAKzgC,EAAEA,EAAE7b,OAAO,IAAI,OAAOgJ,MAAM6S,EAAE,MAAMzW,EAAEg3C,IAAIrzC,SAAS8S,EAAE,GAAG,KAAKzW,CAAC,CAAC,SAASyM,EAAEgM,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAG2sC,OAAO3sC,EAAE/Q,EAAE,GAAGw4C,SAAS/uC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIw9C,OAAO/zC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIy9C,KAAKh0C,SAASsH,EAAE/Q,EAAE,GAAG,KAAK,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,CAAC,SAASvC,EAAEuE,GAAG,IAAI,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE,CAACqY,KAAKtH,EAAE,GAAGtO,KAAK,IAAI8Z,EAAExL,EAAErQ,OAAO6b,KAAK,GAAGvc,EAAEyC,KAAKsO,EAAEwL,GAAG,IAAIvc,EAAEyC,KAAKmiC,OAAO,OAAOl7B,MAAMqH,EAAE,MAAM/Q,EAAE88C,IAAIrzC,SAASsH,EAAE,GAAG,KAAK/Q,CAAC,CAAC,SAAS6I,EAAE0V,GAAG,IAAIxN,EAAEwN,EAAEqmB,OAAOhZ,MAAM,QAAQ5rB,EAAE+Q,EAAErQ,OAAO6b,EAAE,CAAClE,KAAKtH,EAAE,GAAG2sC,OAAO3sC,EAAE/Q,EAAE,GAAGonB,QAAQ,KAAK,IAAIoxB,SAAS/uC,SAASsH,EAAE/Q,EAAE,GAAG,IAAIw9C,OAAO/zC,SAASsH,EAAE/Q,EAAE,GAAG,KAAK,OAAO0J,MAAMqH,EAAE,MAAMwL,EAAEugC,IAAIrzC,SAASsH,EAAE,GAAG,KAAKwL,CAAC,EAAkB,WAA2H,IAAIxL,EAApH,SAAWwN,GAAG3e,KAAK4+C,aAAa,iBAAiBjgC,EAAEsN,KAAKC,MAAMD,KAAKkD,UAAUxQ,IAAI,iBAAiBA,EAAEhC,EAAEgC,QAAG,CAAM,EAAS5T,UAAiBoG,EAAE0tC,OAAO,WAAW,OAAO7+C,KAAK4+C,YAAY,EAAEztC,EAAEjI,SAAS,WAAW,OAAO9I,EAAEJ,KAAK6+C,SAAS,CAAG,EAAlP,GAAsPj/C,EAAQk/C,aAAa1+C,EAAER,EAAQm/C,cAAcpiC,qCCC7iPqiC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBj6C,IAAjBk6C,EACH,OAAOA,EAAav/C,QAGrB,IAAIC,EAASm/C,EAAyBE,GAAY,CACjDE,GAAIF,EACJG,QAAQ,EACRz/C,QAAS,CAAC,GAUX,OANA0/C,EAAoBJ,GAAUl0C,KAAKnL,EAAOD,QAASC,EAAQA,EAAOD,QAASq/C,GAG3Ep/C,EAAOw/C,QAAS,EAGTx/C,EAAOD,OACf,ChCzBIM,EAAW0B,OAAOgE,eAAkBkF,GAASlJ,OAAOgE,eAAekF,GAASA,GAASA,EAAa,UAQtGm0C,EAAoBtgC,EAAI,SAAS7c,EAAOy9C,GAEvC,GADU,EAAPA,IAAUz9C,EAAQ9B,KAAK8B,IAChB,EAAPy9C,EAAU,OAAOz9C,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPy9C,GAAaz9C,EAAM4sB,WAAY,OAAO5sB,EAC1C,GAAW,GAAPy9C,GAAoC,mBAAfz9C,EAAMwpB,KAAqB,OAAOxpB,CAC5D,CACA,IAAIu7C,EAAKz7C,OAAOX,OAAO,MACvBg+C,EAAoB9tC,EAAEksC,GACtB,IAAIhZ,EAAM,CAAC,EACXpkC,EAAiBA,GAAkB,CAAC,KAAMC,EAAS,CAAC,GAAIA,EAAS,IAAKA,EAASA,IAC/E,IAAI,IAAIs/C,EAAiB,EAAPD,GAAYz9C,EAAyB,iBAAX09C,KAAyBv/C,EAAeikB,QAAQs7B,GAAUA,EAAUt/C,EAASs/C,GACxH59C,OAAO69C,oBAAoBD,GAASp/B,SAAS7a,GAAS8+B,EAAI9+B,GAAO,IAAOzD,EAAMyD,KAI/E,OAFA8+B,EAAa,QAAI,IAAM,EACvB4a,EAAoBrtC,EAAEyrC,EAAIhZ,GACnBgZ,CACR,EiCxBA4B,EAAoBrtC,EAAI,CAAChS,EAAS8/C,KACjC,IAAI,IAAIn6C,KAAOm6C,EACXT,EAAoB9wB,EAAEuxB,EAAYn6C,KAAS05C,EAAoB9wB,EAAEvuB,EAAS2F,IAC5E3D,OAAOC,eAAejC,EAAS2F,EAAK,CAAEsjB,YAAY,EAAMrkB,IAAKk7C,EAAWn6C,IAE1E,ECND05C,EAAoB1sB,EAAI,WACvB,GAA0B,iBAAfotB,WAAyB,OAAOA,WAC3C,IACC,OAAO3/C,MAAQ,IAAIyyB,SAAS,cAAb,EAChB,CAAE,MAAO9V,GACR,GAAsB,iBAAXxK,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxB8sC,EAAoB9wB,EAAI,CAACrjB,EAAKq8B,IAAUvlC,OAAOmJ,UAAU8jB,eAAe7jB,KAAKF,EAAKq8B,GCClF8X,EAAoB9tC,EAAKvR,IACH,oBAAX80B,QAA0BA,OAAOoU,aAC1ClnC,OAAOC,eAAejC,EAAS80B,OAAOoU,YAAa,CAAEhnC,MAAO,WAE7DF,OAAOC,eAAejC,EAAS,aAAc,CAAEkC,OAAO,GAAO,ECL9Dm9C,EAAoBW,IAAO//C,IAC1BA,EAAOggD,MAAQ,GACVhgD,EAAOigD,WAAUjgD,EAAOigD,SAAW,IACjCjgD,6aCmDD,SAASkgD,IACZ,IAAInuC,GAAI,IAAIxH,MAAOs3B,UAInB,MAH2B,oBAAhBse,aAA0D,mBAApBA,YAAY31C,MACzDuH,GAAKouC,YAAY31C,OAEd,uCAAuCmd,QAAQ,SAASrhB,IAC3D,MAAMgL,GAAKS,EAAoB,GAAhB1O,KAAKqjC,UAAiB,GAAK,EAE1C,OADA30B,EAAI1O,KAAKwF,MAAMkJ,EAAI,KACL,MAANzL,EAAYgL,EAAS,EAAJA,EAAW,GAAKjI,SAAS,GAAG,GAE7D,CAoLA,MAAMJ,EAAQC,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACqsC,EAAGzpC,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OCpPxE,SAAShJ,EAAOC,GACnB,IAAKC,OAAOC,cAAcF,IAAMA,EAAI,EAChC,MAAM,IAAIG,MAAM,2BAA2BH,IACnD,CAKO,SAASM,EAAMD,KAAME,GACxB,KAAMF,aAAaG,YACf,MAAM,IAAIC,UAAU,uBACxB,GAAIF,EAAQG,OAAS,IAAMH,EAAQI,SAASN,EAAEK,QAC1C,MAAM,IAAID,UAAU,iCAAiCF,oBAA0BF,EAAEK,SACzF,CAoBA,MAQA,EARe,CACXX,SACAK,KA/BG,SAAcC,GACjB,GAAiB,kBAANA,EACP,MAAM,IAAIF,MAAM,yBAAyBE,IACjD,EA6BIC,QACAM,KAvBG,SAAcA,GACjB,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKC,OAC1C,MAAM,IAAIV,MAAM,mDACpBJ,EAAOa,EAAKE,WACZf,EAAOa,EAAKG,SAChB,EAmBIC,OAlBG,SAAgBC,EAAUC,GAAgB,GAC7C,GAAID,EAASE,UACT,MAAM,IAAIhB,MAAM,oCACpB,GAAIe,GAAiBD,EAASG,SAC1B,MAAM,IAAIjB,MAAM,wCACxB,EAcIkB,OAbG,SAAgBC,EAAKL,GACxBX,EAAMgB,GACN,MAAMC,EAAMN,EAASH,UACrB,GAAIQ,EAAIZ,OAASa,EACb,MAAM,IAAIpB,MAAM,yDAAyDoB,IAEjF,GCxBagB,GCNY,iBAATwC,MAAqB,WAAYA,MAAOA,KAAKJ,ODMlCyD,GAAQ,IAAIG,SAASH,EAAI/F,OAAQ+F,EAAI7E,WAAY6E,EAAIC,aAEnEnB,EAAO,CAACsB,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAIxE,GAHgF,KAA5D,IAAIjI,WAAW,IAAIyF,YAAY,CAAC,YAAa5D,QAAQ,GAIrE,MAAM,IAAIlC,MAAM,+CAyDb,SAASyC,EAAQH,GAGpB,GAFoB,iBAATA,IACPA,EARD,SAAqBuG,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvI,UAAU,2CAA2CuI,GAEnE,OAAO,IAAIC,aAAcC,OAAOF,EACpC,CAGe,CAAYvG,MACjBA,aAAgBjC,YAClB,MAAM,IAAIC,UAAU,iDAAiDgC,MACzE,OAAOA,CACX,CA9DckG,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAkFxE,MAAMhH,EAET,KAAAwI,GACI,OAAO3K,KAAK6E,YAChB,EAUG,SAAS8C,EAAgBuD,GAC5B,MAAMC,EAAStF,GAAYqF,IAAkBtI,OAAOI,EAAQ6C,IAAUpB,SAChE2G,EAAMF,IAIZ,OAHAC,EAAMjK,UAAYkK,EAAIlK,UACtBiK,EAAMhK,SAAWiK,EAAIjK,SACrBgK,EAAMlK,OAAS,IAAMiK,IACdC,CACX,CEpHA,MAAM9F,UAAalD,EACf,WAAAC,CAAYpB,EAAMsE,GACd/C,QACAvC,KAAKwB,UAAW,EAChBxB,KAAKuB,WAAY,EACjB,OAAYP,GACZ,MAAMuE,EAAMvC,EAAQsC,GAEpB,GADAtF,KAAKwF,MAAQxE,EAAKC,SACe,mBAAtBjB,KAAKwF,MAAM5C,OAClB,MAAM,IAAI/B,UAAU,uDACxBb,KAAKmB,SAAWnB,KAAKwF,MAAMrE,SAC3BnB,KAAKkB,UAAYlB,KAAKwF,MAAMtE,UAC5B,MAAMC,EAAWnB,KAAKmB,SAChBsE,EAAM,IAAI7E,WAAWO,GAE3BsE,EAAItC,IAAIoC,EAAIzE,OAASK,EAAWH,EAAKC,SAAS2B,OAAO2C,GAAKd,SAAWc,GACrE,IAAK,IAAI7B,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,GACd1D,KAAKwF,MAAM5C,OAAO6C,GAElBzF,KAAK0F,MAAQ1E,EAAKC,SAElB,IAAK,IAAIyC,EAAI,EAAGA,EAAI+B,EAAI3E,OAAQ4C,IAC5B+B,EAAI/B,IAAM,IACd1D,KAAK0F,MAAM9C,OAAO6C,GAClBA,EAAIhC,KAAK,EACb,CACA,MAAAb,CAAO+C,GAGH,OAFA,SAAc3F,MACdA,KAAKwF,MAAM5C,OAAO+C,GACX3F,IACX,CACA,UAAAwD,CAAW9B,GACP,SAAc1B,MACd,QAAa0B,EAAK1B,KAAKkB,WACvBlB,KAAKwB,UAAW,EAChBxB,KAAKwF,MAAMhC,WAAW9B,GACtB1B,KAAK0F,MAAM9C,OAAOlB,GAClB1B,KAAK0F,MAAMlC,WAAW9B,GACtB1B,KAAK4E,SACT,CACA,MAAAH,GACI,MAAM/C,EAAM,IAAId,WAAWZ,KAAK0F,MAAMxE,WAEtC,OADAlB,KAAKwD,WAAW9B,GACTA,CACX,CACA,UAAAmD,CAAWC,GAEPA,IAAOA,EAAKlD,OAAOX,OAAOW,OAAOgE,eAAe5F,MAAO,CAAC,IACxD,MAAM,MAAE0F,EAAK,MAAEF,EAAK,SAAEhE,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAclB,KAQnE,OANA8E,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACfuD,EAAG3D,SAAWA,EACd2D,EAAG5D,UAAYA,EACf4D,EAAGY,MAAQA,EAAMb,WAAWC,EAAGY,OAC/BZ,EAAGU,MAAQA,EAAMX,WAAWC,EAAGU,OACxBV,CACX,CACA,OAAAF,GACI5E,KAAKuB,WAAY,EACjBvB,KAAK0F,MAAMd,UACX5E,KAAKwF,MAAMZ,SACf,EAQG,MAAMQ,EAAO,CAACpE,EAAMuE,EAAKM,IAAY,IAAIR,EAAKrE,EAAMuE,GAAK3C,OAAOiD,GAASpB,SAChFW,EAAKnE,OAAS,CAACD,EAAMuE,IAAQ,IAAIF,EAAKrE,EAAMuE,GC3DrC,MAAMvD,UAAaG,EACtB,WAAAC,CAAYjB,EAAUD,EAAWmB,EAAWC,GACxCC,QACAvC,KAAKmB,SAAWA,EAChBnB,KAAKkB,UAAYA,EACjBlB,KAAKqC,UAAYA,EACjBrC,KAAKsC,KAAOA,EACZtC,KAAKwB,UAAW,EAChBxB,KAAKc,OAAS,EACdd,KAAKwC,IAAM,EACXxC,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAS,IAAI7B,WAAWO,GAC7BnB,KAAK0C,KAAOC,EAAW3C,KAAKyC,OAChC,CACA,MAAAG,CAAOC,GACH,SAAc7C,MACd,MAAM,KAAE0C,EAAI,OAAED,EAAM,SAAEtB,GAAanB,KAE7B+C,GADNF,EAAOG,EAAQH,IACE/B,OACjB,IAAK,IAAI0B,EAAM,EAAGA,EAAMO,GAAM,CAC1B,MAAME,EAAOC,KAAKvB,IAAIR,EAAWnB,KAAKwC,IAAKO,EAAMP,GAEjD,GAAIS,IAAS9B,EAMbsB,EAAOU,IAAIN,EAAKO,SAASZ,EAAKA,EAAMS,GAAOjD,KAAKwC,KAChDxC,KAAKwC,KAAOS,EACZT,GAAOS,EACHjD,KAAKwC,MAAQrB,IACbnB,KAAKqD,QAAQX,EAAM,GACnB1C,KAAKwC,IAAM,OAXf,CACI,MAAMc,EAAWX,EAAWE,GAC5B,KAAO1B,GAAY4B,EAAMP,EAAKA,GAAOrB,EACjCnB,KAAKqD,QAAQC,EAAUd,EAE/B,CAQJ,CAGA,OAFAxC,KAAKc,QAAU+B,EAAK/B,OACpBd,KAAKuD,aACEvD,IACX,CACA,UAAAwD,CAAW9B,GACP,SAAc1B,MACd,SAAc0B,EAAK1B,MACnBA,KAAKwB,UAAW,EAIhB,MAAM,OAAEiB,EAAM,KAAEC,EAAI,SAAEvB,EAAQ,KAAEmB,GAAStC,KACzC,IAAI,IAAEwC,GAAQxC,KAEdyC,EAAOD,KAAS,IAChBxC,KAAKyC,OAAOW,SAASZ,GAAKiB,KAAK,GAE3BzD,KAAKqC,UAAYlB,EAAWqB,IAC5BxC,KAAKqD,QAAQX,EAAM,GACnBF,EAAM,GAGV,IAAK,IAAIkB,EAAIlB,EAAKkB,EAAIvC,EAAUuC,IAC5BjB,EAAOiB,GAAK,GAxExB,SAAsBhB,EAAMiB,EAAY7B,EAAOQ,GAC3C,GAAiC,mBAAtBI,EAAKkB,aACZ,OAAOlB,EAAKkB,aAAaD,EAAY7B,EAAOQ,GAChD,MAAMuB,EAAOC,OAAO,IACdC,EAAWD,OAAO,YAClBE,EAAK3D,OAAQyB,GAAS+B,EAAQE,GAC9BE,EAAK5D,OAAOyB,EAAQiC,GACpBG,EAAI5B,EAAO,EAAI,EACf6B,EAAI7B,EAAO,EAAI,EACrBI,EAAK0B,UAAUT,EAAaO,EAAGF,EAAI1B,GACnCI,EAAK0B,UAAUT,EAAaQ,EAAGF,EAAI3B,EACvC,CAiEQsB,CAAalB,EAAMvB,EAAW,EAAG2C,OAAqB,EAAd9D,KAAKc,QAAawB,GAC1DtC,KAAKqD,QAAQX,EAAM,GACnB,MAAM2B,EAAQ1B,EAAWjB,GACnBqB,EAAM/C,KAAKkB,UAEjB,GAAI6B,EAAM,EACN,MAAM,IAAIxC,MAAM,+CACpB,MAAM+D,EAASvB,EAAM,EACfwB,EAAQvE,KAAKwE,MACnB,GAAIF,EAASC,EAAMzD,OACf,MAAM,IAAIP,MAAM,sCACpB,IAAK,IAAImD,EAAI,EAAGA,EAAIY,EAAQZ,IACxBW,EAAMD,UAAU,EAAIV,EAAGa,EAAMb,GAAIpB,EACzC,CACA,MAAAmC,GACI,MAAM,OAAEhC,EAAM,UAAEvB,GAAclB,KAC9BA,KAAKwD,WAAWf,GAChB,MAAMiC,EAAMjC,EAAOkC,MAAM,EAAGzD,GAE5B,OADAlB,KAAK4E,UACEF,CACX,CACA,UAAAG,CAAWC,GACPA,IAAOA,EAAK,IAAI9E,KAAKoC,aACrB0C,EAAG3B,OAAOnD,KAAKwE,OACf,MAAM,SAAErD,EAAQ,OAAEsB,EAAM,OAAE3B,EAAM,SAAEU,EAAQ,UAAED,EAAS,IAAEiB,GAAQxC,KAO/D,OANA8E,EAAGhE,OAASA,EACZgE,EAAGtC,IAAMA,EACTsC,EAAGtD,SAAWA,EACdsD,EAAGvD,UAAYA,EACXT,EAASK,GACT2D,EAAGrC,OAAOU,IAAIV,GACXqC,CACX,EC5GJ,MAEMmB,EAAM,CAACC,EAAGzF,EAAG0F,IAAOD,EAAIzF,EAAMyF,EAAIC,EAAM1F,EAAI0F,EAI5CC,EAAW,IAAIC,YAAY,CAC7B,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlFC,EAAK,IAAID,YAAY,CACvB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlFE,EAAW,IAAIF,YAAY,IACjC,MAAMG,UAAexE,EACjB,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GAGjBvC,KAAKyG,EAAY,EAARH,EAAG,GACZtG,KAAK0G,EAAY,EAARJ,EAAG,GACZtG,KAAK2G,EAAY,EAARL,EAAG,GACZtG,KAAK4G,EAAY,EAARN,EAAG,GACZtG,KAAK6G,EAAY,EAARP,EAAG,GACZtG,KAAK8G,EAAY,EAARR,EAAG,GACZtG,KAAK+G,EAAY,EAART,EAAG,GACZtG,KAAKgH,EAAY,EAARV,EAAG,EAChB,CACA,GAAA9B,GACI,MAAM,EAAEiC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACnC,MAAO,CAACyG,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAA7D,CAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBhH,KAAKyG,EAAQ,EAAJA,EACTzG,KAAK0G,EAAQ,EAAJA,EACT1G,KAAK2G,EAAQ,EAAJA,EACT3G,KAAK4G,EAAQ,EAAJA,EACT5G,KAAK6G,EAAQ,EAAJA,EACT7G,KAAK8G,EAAQ,EAAJA,EACT9G,KAAK+G,EAAQ,EAAJA,EACT/G,KAAKgH,EAAQ,EAAJA,CACb,CACA,OAAA3D,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCV,EAAS7C,GAAKhB,EAAKwE,UAAUD,GAAQ,GACzC,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyD,EAAMZ,EAAS7C,EAAI,IACnB0D,EAAKb,EAAS7C,EAAI,GAClB2D,EAAKC,EAAKH,EAAK,GAAKG,EAAKH,EAAK,IAAOA,IAAQ,EAC7CI,EAAKD,EAAKF,EAAI,IAAME,EAAKF,EAAI,IAAOA,IAAO,GACjDb,EAAS7C,GAAM6D,EAAKhB,EAAS7C,EAAI,GAAK2D,EAAKd,EAAS7C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE+C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMhH,KACjC,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM8D,EAAMR,GADGM,EAAKT,EAAG,GAAKS,EAAKT,EAAG,IAAMS,EAAKT,EAAG,OAnEjDX,EAoE4BW,GAAGC,GApEPZ,EAoEUa,GAAKX,EAAS1C,GAAK6C,EAAS7C,GAAM,EAE/D+D,GADSH,EAAKb,EAAG,GAAKa,EAAKb,EAAG,IAAMa,EAAKb,EAAG,KAC7BR,EAAIQ,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIY,EAAM,EACfZ,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKe,EAAKC,EAAM,CACpB,CA/EI,IAACvB,EAiFLO,EAAKA,EAAIzG,KAAKyG,EAAK,EACnBC,EAAKA,EAAI1G,KAAK0G,EAAK,EACnBC,EAAKA,EAAI3G,KAAK2G,EAAK,EACnBC,EAAKA,EAAI5G,KAAK4G,EAAK,EACnBC,EAAKA,EAAI7G,KAAK6G,EAAK,EACnBC,EAAKA,EAAI9G,KAAK8G,EAAK,EACnBC,EAAKA,EAAI/G,KAAK+G,EAAK,EACnBC,EAAKA,EAAIhH,KAAKgH,EAAK,EACnBhH,KAAKmD,IAAIsD,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzD,GACIgD,EAAS9C,KAAK,EAClB,CACA,OAAAmB,GACI5E,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BnD,KAAKyC,OAAOgB,KAAK,EACrB,EAGJ,MAAMiE,UAAelB,EACjB,WAAApE,GACIG,QACAvC,KAAKyG,GAAI,WACTzG,KAAK0G,EAAI,UACT1G,KAAK2G,EAAI,UACT3G,KAAK4G,GAAI,UACT5G,KAAK6G,GAAI,QACT7G,KAAK8G,EAAI,WACT9G,KAAK+G,EAAI,WACT/G,KAAKgH,GAAI,WACThH,KAAKkB,UAAY,EACrB,EAMG,MAAM,EAASyG,GAAgB,IAAM,IAAInB,IAC1BmB,GAAgB,IAAM,IAAID,4BCxHhD,MAAM2E,EAAMvI,OAAO,GACbwI,EAAMxI,OAAO,GACbyI,EAAMzI,OAAO,GACb0I,EAAM1I,OAAO,GACb2I,EAAM3I,OAAO,GACbqI,EAAQvK,OAAO8K,OAAO,CACxBxG,EAAGmG,EACH5L,EAAGqD,OAAO,GACV6I,EAAG7I,OAAO,sEACV1D,EAAG0D,OAAO,sEACVI,EAAGoI,EACHM,GAAI9I,OAAO,iFACX+I,GAAI/I,OAAO,iFACXgJ,KAAMhJ,OAAO,wEAEXiJ,EAAa,CAAC7G,EAAGzF,KAAOyF,EAAIzF,EAAI8L,GAAO9L,EACvCuM,EAAO,CACTF,KAAMhJ,OAAO,sEACb,WAAAmJ,CAAYC,GACR,MAAM,EAAE9M,GAAM+L,EACRgB,EAAKrJ,OAAO,sCACZsJ,GAAMd,EAAMxI,OAAO,sCACnBuJ,EAAKvJ,OAAO,uCACZwJ,EAAKH,EACLI,EAAYzJ,OAAO,uCACnB0J,EAAKT,EAAWO,EAAKJ,EAAG9M,GACxBqN,EAAKV,GAAYK,EAAKF,EAAG9M,GAC/B,IAAIsN,EAAKC,GAAIT,EAAIM,EAAKL,EAAKM,EAAKJ,EAAIjN,GAChCwN,EAAKD,IAAKH,EAAKJ,EAAKK,EAAKH,EAAIlN,GACjC,MAAMyN,EAAQH,EAAKH,EACbO,EAAQF,EAAKL,EAKnB,GAJIM,IACAH,EAAKtN,EAAIsN,GACTI,IACAF,EAAKxN,EAAIwN,GACTF,EAAKH,GAAaK,EAAKL,EACvB,MAAM,IAAIhN,MAAM,2CAA6C2M,GAEjE,MAAO,CAAEW,QAAOH,KAAII,QAAOF,KAC/B,GAEEG,EAAW,GACXC,EAAW,GAKjB,SAASG,EAAYC,GACjB,MAAM,EAAElI,EAAC,EAAEzF,GAAM0L,EACXkC,EAAKV,GAAIS,EAAIA,GACbE,EAAKX,GAAIU,EAAKD,GACpB,OAAOT,GAAIW,EAAKpI,EAAIkI,EAAI3N,EAC5B,CACA,MAAM8N,EAAmBpC,EAAMjG,IAAMmG,EACrC,MAAMmC,UAAiBjO,MACnB,WAAA6B,CAAYyD,GACRtD,MAAMsD,EACV,EAEJ,SAAS4I,EAAeC,GACpB,KAAMA,aAAiBC,GACnB,MAAM,IAAI9N,UAAU,yBAC5B,CACA,MAAM8N,EACF,WAAAvM,CAAYgM,EAAGQ,EAAGC,GACd7O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,EACT5O,KAAK6O,EAAIA,CACb,CACA,iBAAOC,CAAWC,GACd,KAAMA,aAAa,GACf,MAAM,IAAIlO,UAAU,4CAExB,OAAIkO,EAAEC,OAAO,EAAMC,MACRN,EAAcM,KAClB,IAAIN,EAAcI,EAAEX,EAAGW,EAAEH,EAAGtC,EACvC,CACA,oBAAO4C,CAAcC,GACjB,MAAMC,EAkkBd,SAAqBC,EAAMN,EAAI5C,EAAMQ,GACjC,MAAM2C,EAAU,IAAIvG,MAAMsG,EAAKvO,QAOzByO,EAAWC,GANMH,EAAK5E,QAAO,CAACgF,EAAKC,EAAKhM,IACtCgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAK+L,EACN9B,GAAI8B,EAAMC,EAAKX,KACvBzC,GACqCyC,GAOxC,OANAM,EAAKM,aAAY,CAACF,EAAKC,EAAKhM,IACpBgM,IAAQrD,EACDoD,GACXH,EAAQ5L,GAAKiK,GAAI8B,EAAMH,EAAQ5L,GAAIqL,GAC5BpB,GAAI8B,EAAMC,EAAKX,KACvBQ,GACID,CACX,CAllBsBM,CAAYT,EAAOU,KAAKd,GAAMA,EAAEF,KAC9C,OAAOM,EAAOU,KAAI,CAACd,EAAGrL,IAAMqL,EAAEe,SAASV,EAAM1L,KACjD,CACA,iBAAOqM,CAAWZ,GACd,OAAOR,EAAcO,cAAcC,GAAQU,IAAIlB,EAAcG,WACjE,CACA,MAAAE,CAAON,GACHD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAC1B4B,EAAO3C,GAAIuC,EAAKA,GAChBK,EAAO5C,GAAI0C,EAAKA,GAChBG,EAAK7C,GAAIqC,EAAKO,GACdE,EAAK9C,GAAIwC,EAAKG,GACdI,EAAK/C,GAAIA,GAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,GAAIA,GAAIyC,EAAKF,GAAMI,GAC9B,OAAOE,IAAOC,GAAMC,IAAOC,CAC/B,CACA,MAAAC,GACI,OAAO,IAAIjC,EAAc3O,KAAKoO,EAAGT,IAAK3N,KAAK4O,GAAI5O,KAAK6O,EACxD,CACA,MAAAgC,GACI,MAAQzC,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,KAC1ByG,EAAIkH,GAAIqC,EAAKA,GACbtJ,EAAIiH,GAAIsC,EAAKA,GACbtJ,EAAIgH,GAAIjH,EAAIA,GACZoK,EAAMd,EAAKtJ,EACXE,EAAI+G,GAAIpB,GAAOoB,GAAImD,EAAMA,GAAOrK,EAAIE,IACpCE,EAAI8G,GAAInB,EAAM/F,GACdK,EAAI6G,GAAI9G,EAAIA,GACZkK,EAAKpD,GAAI7G,EAAIyF,EAAM3F,GACnBoK,EAAKrD,GAAI9G,GAAKD,EAAImK,GAAMtE,EAAM9F,GAC9BsK,EAAKtD,GAAIpB,EAAM0D,EAAKC,GAC1B,OAAO,IAAIvB,EAAcoC,EAAIC,EAAIC,EACrC,CACA,GAAAC,CAAIxC,GACAD,EAAeC,GACf,MAAQN,EAAG4B,EAAIpB,EAAGqB,EAAIpB,EAAGqB,GAAOlQ,MACxBoO,EAAG+B,EAAIvB,EAAGwB,EAAIvB,EAAGwB,GAAO3B,EAChC,GAAIyB,IAAO9D,GAAO+D,IAAO/D,EACrB,OAAOrM,KACX,GAAIgQ,IAAO3D,GAAO4D,IAAO5D,EACrB,OAAOqC,EACX,MAAM4B,EAAO3C,GAAIuC,EAAKA,GAChBK,EAAO5C,GAAI0C,EAAKA,GAChBG,EAAK7C,GAAIqC,EAAKO,GACdE,EAAK9C,GAAIwC,EAAKG,GACdI,EAAK/C,GAAIA,GAAIsC,EAAKI,GAAME,GACxBI,EAAKhD,GAAIA,GAAIyC,EAAKF,GAAMI,GACxBtJ,EAAI2G,GAAI8C,EAAKD,GACbW,EAAIxD,GAAIgD,EAAKD,GACnB,GAAI1J,IAAMqF,EACN,OAAI8E,IAAM9E,EACCrM,KAAK6Q,SAGLlC,EAAcM,KAG7B,MAAMmC,EAAKzD,GAAI3G,EAAIA,GACbqK,EAAM1D,GAAI3G,EAAIoK,GACdE,EAAI3D,GAAI6C,EAAKY,GACbL,EAAKpD,GAAIwD,EAAIA,EAAIE,EAAM9E,EAAM+E,GAC7BN,EAAKrD,GAAIwD,GAAKG,EAAIP,GAAML,EAAKW,GAC7BJ,EAAKtD,GAAIuC,EAAKG,EAAKrJ,GACzB,OAAO,IAAI2H,EAAcoC,EAAIC,EAAIC,EACrC,CACA,QAAAM,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,cAAAY,CAAeC,GACX,MAAMC,EAAK/C,EAAcM,KACzB,GAAsB,iBAAXwC,GAAuBA,IAAWpF,EACzC,OAAOqF,EACX,IAAItR,EAAIuR,GAAgBF,GACxB,GAAIrR,IAAMkM,EACN,OAAOtM,KACX,IAAKuO,EAAkB,CACnB,IAAIQ,EAAI2C,EACJE,EAAI5R,KACR,KAAOI,EAAIiM,GACHjM,EAAIkM,IACJyC,EAAIA,EAAEmC,IAAIU,IACdA,EAAIA,EAAEf,SACNzQ,IAAMkM,EAEV,OAAOyC,CACX,CACA,IAAI,MAAElB,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAC5CyR,EAAMH,EACNI,EAAMJ,EACNE,EAAI5R,KACR,KAAO0N,EAAKrB,GAAOuB,EAAKvB,GAChBqB,EAAKpB,IACLuF,EAAMA,EAAIX,IAAIU,IACdhE,EAAKtB,IACLwF,EAAMA,EAAIZ,IAAIU,IAClBA,EAAIA,EAAEf,SACNnD,IAAOpB,EACPsB,IAAOtB,EAOX,OALIuB,IACAgE,EAAMA,EAAIjB,UACV9C,IACAgE,EAAMA,EAAIlB,UACdkB,EAAM,IAAInD,EAAchB,GAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GACpDgD,EAAIX,IAAIY,EACnB,CACA,gBAAAC,CAAiBC,GACb,MAAMC,EAAU1D,EAAmB,IAAMyD,EAAI,EAAI,IAAMA,EAAI,EACrD7C,EAAS,GACf,IAAIJ,EAAI/O,KACJkS,EAAOnD,EACX,IAAK,IAAIoD,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7CD,EAAOnD,EACPI,EAAOiD,KAAKF,GACZ,IAAK,IAAIxO,EAAI,EAAGA,EAAI,IAAMsO,EAAI,GAAItO,IAC9BwO,EAAOA,EAAKhB,IAAInC,GAChBI,EAAOiD,KAAKF,GAEhBnD,EAAImD,EAAKrB,QACb,CACA,OAAO1B,CACX,CACA,IAAAkD,CAAKjS,EAAGkS,IACCA,GAAetS,KAAKgP,OAAOL,EAAc4D,QAC1CD,EAAc,EAAMC,MACxB,MAAMP,EAAKM,GAAeA,EAAYE,cAAiB,EACvD,GAAI,IAAMR,EACN,MAAM,IAAIzR,MAAM,iEAEpB,IAAIkS,EAAcH,GAAeI,EAAiBlO,IAAI8N,GACjDG,IACDA,EAAczS,KAAK+R,iBAAiBC,GAChCM,GAAqB,IAANN,IACfS,EAAc9D,EAAcoB,WAAW0C,GACvCC,EAAiBvP,IAAImP,EAAaG,KAG1C,IAAI1D,EAAIJ,EAAcM,KAClB0D,EAAIhE,EAAc4D,KACtB,MAAMN,EAAU,GAAK1D,EAAmB,IAAMyD,EAAI,IAAMA,GAClDY,EAAa,IAAMZ,EAAI,GACvBa,EAAO/O,OAAO,GAAKkO,EAAI,GACvBc,EAAY,GAAKd,EACjBe,EAAUjP,OAAOkO,GACvB,IAAK,IAAIG,EAAS,EAAGA,EAASF,EAASE,IAAU,CAC7C,MAAMlL,EAASkL,EAASS,EACxB,IAAII,EAAQ3S,OAAOD,EAAIyS,GACvBzS,IAAM2S,EACFC,EAAQJ,IACRI,GAASF,EACT1S,GAAKkM,GAET,MAAM2G,EAAUhM,EACViM,EAAUjM,EAAS/D,KAAKiQ,IAAIH,GAAS,EACrCI,EAAQjB,EAAS,GAAM,EACvBkB,EAAQL,EAAQ,EACR,IAAVA,EACAL,EAAIA,EAAEzB,IAAIoC,EAAgBF,EAAOX,EAAYQ,KAG7ClE,EAAIA,EAAEmC,IAAIoC,EAAgBD,EAAOZ,EAAYS,IAErD,CACA,MAAO,CAAEnE,IAAG4D,IAChB,CACA,QAAAY,CAAS9B,EAAQa,GACb,IACIkB,EACAC,EAFArT,EAAIuR,GAAgBF,GAGxB,GAAIlD,EAAkB,CAClB,MAAM,MAAEV,EAAK,GAAEH,EAAE,MAAEI,EAAK,GAAEF,GAAOZ,EAAKC,YAAY7M,GAClD,IAAM2O,EAAG8C,EAAKc,EAAGe,GAAQ1T,KAAKqS,KAAK3E,EAAI4E,IACjCvD,EAAG+C,EAAKa,EAAGgB,GAAQ3T,KAAKqS,KAAKzE,EAAI0E,GACvCT,EAAMyB,EAAgBzF,EAAOgE,GAC7BC,EAAMwB,EAAgBxF,EAAOgE,GAC7BA,EAAM,IAAInD,EAAchB,GAAImE,EAAI1D,EAAIpB,EAAKF,MAAOgF,EAAIlD,EAAGkD,EAAIjD,GAC3D2E,EAAQ3B,EAAIX,IAAIY,GAChB2B,EAAOC,EAAIxC,IAAIyC,EACnB,KACK,CACD,MAAM,EAAE5E,EAAC,EAAE4D,GAAM3S,KAAKqS,KAAKjS,EAAGkS,GAC9BkB,EAAQzE,EACR0E,EAAOd,CACX,CACA,OAAOhE,EAAcoB,WAAW,CAACyD,EAAOC,IAAO,EACnD,CACA,QAAA3D,CAAS8D,GACL,MAAM,EAAExF,EAAC,EAAEQ,EAAC,EAAEC,GAAM7O,KACd6T,EAAM7T,KAAKgP,OAAOL,EAAcM,MAC1B,MAAR2E,IACAA,EAAOC,EAAMpH,EAAM+C,GAAOX,IAC9B,MAAMiF,EAAMF,EACNG,EAAMpG,GAAImG,EAAMA,GAChBE,EAAMrG,GAAIoG,EAAMD,GAChBG,EAAKtG,GAAIS,EAAI2F,GACbG,EAAKvG,GAAIiB,EAAIoF,GACbG,EAAKxG,GAAIkB,EAAIiF,GACnB,GAAID,EACA,OAAO,EAAM5E,KACjB,GAAIkF,IAAO7H,EACP,MAAM,IAAI/L,MAAM,oBACpB,OAAO,IAAI,EAAM0T,EAAIC,EACzB,EAIJ,SAASZ,EAAgBc,EAAWC,GAChC,MAAMC,EAAMD,EAAKzD,SACjB,OAAOwD,EAAYE,EAAMD,CAC7B,CALA1F,EAAc4D,KAAO,IAAI5D,EAAcxC,EAAMS,GAAIT,EAAMU,GAAIP,GAC3DqC,EAAcM,KAAO,IAAIN,EAActC,EAAKC,EAAKD,GAKjD,MAAMqG,EAAmB,IAAI6B,QACtB,MAAM,EACT,WAAAnS,CAAYgM,EAAGQ,GACX5O,KAAKoO,EAAIA,EACTpO,KAAK4O,EAAIA,CACb,CACA,cAAA4F,CAAe5B,GACX5S,KAAKwS,aAAeI,EACpBF,EAAiB+B,OAAOzU,KAC5B,CACA,QAAA0U,GACI,OAAO1U,KAAK4O,EAAIrC,IAAQF,CAC5B,CACA,wBAAOsI,CAAkBjU,GACrB,MAAMkU,EAA2B,KAAjBlU,EAAMI,OAChBsN,EAAIyG,GAAcD,EAAUlU,EAAQA,EAAM0C,SAAS,IACzD,IAAK0R,GAAoB1G,GACrB,MAAM,IAAI7N,MAAM,yBAEpB,IAAIqO,EA6SZ,SAAiBR,GACb,MAAM,EAAEzB,GAAMR,EACR4I,EAAMjR,OAAO,GACbkR,EAAOlR,OAAO,IACdmR,EAAOnR,OAAO,IACdoR,EAAOpR,OAAO,IACdqR,EAAOrR,OAAO,IACdsR,EAAOtR,OAAO,IACdwJ,EAAMc,EAAIA,EAAIA,EAAKzB,EACnB0I,EAAM/H,EAAKA,EAAKc,EAAKzB,EACrB2I,EAAMC,GAAKF,EAAI7I,GAAO6I,EAAM1I,EAC5B6I,EAAMD,GAAKD,EAAI9I,GAAO6I,EAAM1I,EAC5B8I,EAAOF,GAAKC,EAAIjJ,GAAOe,EAAMX,EAC7B+I,EAAOH,GAAKE,EAAKT,GAAQS,EAAO9I,EAChCgJ,EAAOJ,GAAKG,EAAKT,GAAQS,EAAO/I,EAChCiJ,EAAOL,GAAKI,EAAKR,GAAQQ,EAAOhJ,EAChCkJ,EAAQN,GAAKK,EAAKR,GAAQQ,EAAOjJ,EACjCmJ,EAAQP,GAAKM,EAAMV,GAAQQ,EAAOhJ,EAClCoJ,EAAQR,GAAKO,EAAMtJ,GAAO6I,EAAM1I,EAChCqJ,EAAMT,GAAKQ,EAAMb,GAAQQ,EAAO/I,EAChCsJ,EAAMV,GAAKS,EAAIjB,GAAOzH,EAAMX,EAC5BuJ,EAAKX,GAAKU,EAAI1J,GAEpB,GADY2J,EAAKA,EAAMvJ,IACZyB,EACP,MAAM,IAAI7N,MAAM,2BACpB,OAAO2V,CACX,CAvUgBC,CADGhI,EAAYC,IAEvB,MAAMgI,GAAUxH,EAAItC,KAASA,EACzBsI,EACIwB,IACAxH,EAAIjB,IAAKiB,IAG6B,IAAP,EAAXlO,EAAM,MACP0V,IACnBxH,EAAIjB,IAAKiB,IAEjB,MAAM4E,EAAQ,IAAI,EAAMpF,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,0BAAO8C,CAAoB5V,GACvB,MAAM0N,EAAIyG,GAAcnU,EAAM0C,SAAS,EAAG2K,KACpCa,EAAIiG,GAAcnU,EAAM0C,SAAS2K,GAAcA,KAC/CyF,EAAQ,IAAI,EAAMpF,EAAGQ,GAE3B,OADA4E,EAAM6C,iBACC7C,CACX,CACA,cAAO+C,CAAQ/M,GACX,MAAM9I,EAAQ8V,GAAYhN,GACpBzG,EAAMrC,EAAMI,OACZ2V,EAAS/V,EAAM,GACrB,GAAIqC,IAAQgL,EACR,OAAO/N,KAAK2U,kBAAkBjU,GAClC,GArScqN,KAqSVhL,IAAqC,IAAX0T,GAA8B,IAAXA,GAC7C,OAAOzW,KAAK2U,kBAAkBjU,GAElC,GAvSgB,KAuSZqC,GAAsC,IAAX0T,EAC3B,OAAOzW,KAAKsW,oBAAoB5V,GACpC,MAAM,IAAIH,MAAM,wGAAsIwC,IAC1J,CACA,qBAAO2T,CAAeC,GAClB,OAAO,EAAMpE,KAAKgB,SAASqD,GAAoBD,GACnD,CACA,oBAAOE,CAAcC,EAASC,EAAWC,GACrC,MAAM,EAAG,EAAEC,GAsdnB,SAA4BF,GACxB,GAAIA,aAAqB,EAErB,OADAA,EAAUV,iBACHU,EAEX,IACI,OAAO,EAAU4B,QAAQ5B,EAC7B,CACA,MAAOiF,GACH,OAAO,EAAUxD,YAAYzB,EACjC,CACJ,CAjeyBG,CAAmBH,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGhW,SAASiW,GACvB,MAAM,IAAIzW,MAAM,wCACpB,MAAM2D,EAuUd,SAAsBlD,EAAMqZ,GAAe,GACvC,MAAMnW,EANV,SAAoBxD,GAChB,MAAM4Z,EAAuB,EAAf5Z,EAAMI,OAAakN,IAC3B0B,EAAMmF,GAAcnU,GAC1B,OAAO4Z,EAAQ,EAAI5K,GAAO5L,OAAOwW,GAAS5K,CAC9C,CAEc6K,CAAWvZ,GACrB,GAAIqZ,EACA,OAAOnW,EACX,MAAM,EAAE9D,GAAM+L,EACd,OAAOjI,GAAK9D,EAAI8D,EAAI9D,EAAI8D,CAC5B,CA7UkBiT,CAAaX,GAAYM,KAC7B,EAAE1W,GAAM+L,EACRiL,EAAoB,IAAbJ,GAA+B,IAAbA,EAAiB7F,EAAI/Q,EAAI+Q,EAClDkG,EAAO7H,GAAO4H,EAAMhX,GACpBkX,EAAK3J,IAAKzJ,EAAImT,EAAMjX,GACpBmX,EAAK5J,GAAIsJ,EAAII,EAAMjX,GACnBoX,EAAoB,EAAXR,EAAe,KAAO,KAC/BS,EAAI,EAAMlB,QAAQiB,EAASE,EAAYN,IACvCO,EAAI,EAAMpF,KAAKqF,qBAAqBH,EAAGH,EAAIC,GACjD,IAAKI,EACD,MAAM,IAAIpX,MAAM,+CAEpB,OADAoX,EAAEtB,iBACKsB,CACX,CACA,UAAAE,CAAWC,GAAe,GACtB,OAAO,GAAW9X,KAAK+X,MAAMD,GACjC,CACA,KAAAC,CAAMD,GAAe,GACjB,MAAM1J,EAAIsJ,EAAY1X,KAAKoO,GAC3B,OAAI0J,EAEO,GADQ9X,KAAK0U,WAAa,KAAO,OACrBtG,IAGZ,KAAKA,IAAIsJ,EAAY1X,KAAK4O,IAEzC,CACA,MAAAoJ,GACI,OAAOhY,KAAK+X,OAAM,GAAMpT,MAAM,EAClC,CACA,MAAAsT,GACI,OAAOjY,KAAK6X,YAAW,GAAMlT,MAAM,EACvC,CACA,cAAA0R,GACI,MAAM/K,EAAM,kCACN,EAAE8C,EAAC,EAAEQ,GAAM5O,KACjB,IAAK8U,GAAoB1G,KAAO0G,GAAoBlG,GAChD,MAAM,IAAIrO,MAAM+K,GACpB,MAAM4M,EAAOvK,GAAIiB,EAAIA,GAErB,GAAIjB,GAAIuK,EADM/J,EAAYC,MACA/B,EACtB,MAAM,IAAI9L,MAAM+K,EACxB,CACA,MAAA0D,CAAON,GACH,OAAO1O,KAAKoO,IAAMM,EAAMN,GAAKpO,KAAK4O,IAAMF,EAAME,CAClD,CACA,MAAAgC,GACI,OAAO,IAAI,EAAM5Q,KAAKoO,EAAGT,IAAK3N,KAAK4O,GACvC,CACA,MAAAiC,GACI,OAAOlC,EAAcG,WAAW9O,MAAM6Q,SAASf,UACnD,CACA,GAAAoB,CAAIxC,GACA,OAAOC,EAAcG,WAAW9O,MAAMkR,IAAIvC,EAAcG,WAAWJ,IAAQoB,UAC/E,CACA,QAAAyB,CAAS7C,GACL,OAAO1O,KAAKkR,IAAIxC,EAAMkC,SAC1B,CACA,QAAA2C,CAAS9B,GACL,OAAO9C,EAAcG,WAAW9O,MAAMuT,SAAS9B,EAAQzR,MAAM8P,UACjE,CACA,oBAAA8H,CAAqBD,EAAGzR,EAAGzF,GACvB,MAAMkM,EAAIgC,EAAcG,WAAW9O,MAC7BmY,EAAKjS,IAAMmG,GAAOnG,IAAMoG,GAAOtM,OAAS,EAAMuS,KAAO5F,EAAE6E,eAAetL,GAAKyG,EAAE4G,SAASrN,GACtFkS,EAAKzJ,EAAcG,WAAW6I,GAAGnG,eAAe/Q,GAChD4X,EAAMF,EAAGjH,IAAIkH,GACnB,OAAOC,EAAIrJ,OAAOL,EAAcM,WAAQhK,EAAYoT,EAAIvI,UAC5D,EAIJ,SAASwI,EAASrB,GACd,OAAO5W,OAAOwJ,SAASoN,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASsB,EAAY1V,GACjB,GAAIA,EAAK/B,OAAS,GAAiB,IAAZ+B,EAAK,GACxB,MAAM,IAAItC,MAAM,kCAAkC,EAAWsC,MAEjE,MAAME,EAAMF,EAAK,GACX6B,EAAM7B,EAAKO,SAAS,EAAGL,EAAM,GACnC,IAAKA,GAAO2B,EAAI5D,SAAWiC,EACvB,MAAM,IAAIxC,MAAM,2CAEpB,GAAe,IAAXmE,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAInE,MAAM,8CAEpB,MAAO,CAAEsC,KAAMgS,GAAcnQ,GAAMwT,KAAMrV,EAAKO,SAASL,EAAM,GACjE,CAlBA,EAAMwP,KAAO,IAAI,EAAMpG,EAAMS,GAAIT,EAAMU,IACvC,EAAMoC,KAAO,IAAI,EAAM5C,EAAKA,GAgCrB,MAAM,EACT,WAAAjK,CAAY+O,EAAG8F,GACXjX,KAAKmR,EAAIA,EACTnR,KAAKiX,EAAIA,EACTjX,KAAKqW,gBACT,CACA,kBAAOmC,CAAYhP,GACf,MAAMhB,EAAMgB,aAAe5I,WACrB6X,EAAO,wBACb,GAAmB,iBAARjP,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,GAAG4X,oCAC3B,MAAMrP,EAAMZ,EAAM,EAAWgB,GAAOA,EACpC,GAAmB,MAAfJ,EAAItI,OACJ,MAAM,IAAIP,MAAM,GAAGkY,2BACvB,OAAO,IAAI,EAAUC,EAAYtP,EAAIzE,MAAM,EAAG,KAAM+T,EAAYtP,EAAIzE,MAAM,GAAI,MAClF,CACA,cAAOgU,CAAQnP,GACX,MAAMhB,EAAMgB,aAAe5I,WAC3B,GAAmB,iBAAR4I,IAAqBhB,EAC5B,MAAM,IAAI3H,UAAU,oDACxB,MAAM,EAAEsQ,EAAC,EAAE8F,GAlCnB,SAA2BpU,GACvB,GAAIA,EAAK/B,OAAS,GAAgB,IAAX+B,EAAK,GACxB,MAAM,IAAItC,MAAM,0BAA0B,EAAWsC,MAEzD,GAAIA,EAAK,KAAOA,EAAK/B,OAAS,EAC1B,MAAM,IAAIP,MAAM,uCAEpB,MAAQsC,KAAMsO,EAAG+G,KAAMU,GAAWL,EAAY1V,EAAKO,SAAS,KACpDP,KAAMoU,EAAGiB,KAAMW,GAAeN,EAAYK,GAClD,GAAIC,EAAW/X,OACX,MAAM,IAAIP,MAAM,gDAAgD,EAAWsY,MAE/E,MAAO,CAAE1H,IAAG8F,IAChB,CAqByB6B,CAAkBtQ,EAAMgB,EAAM,GAAWA,IAC1D,OAAO,IAAI,EAAU2H,EAAG8F,EAC5B,CACA,cAAOV,CAAQ/M,GACX,OAAOxJ,KAAK2Y,QAAQnP,EACxB,CACA,cAAA6M,GACI,MAAM,EAAElF,EAAC,EAAE8F,GAAMjX,KACjB,IAAK+Y,GAAmB5H,GACpB,MAAM,IAAI5Q,MAAM,0CACpB,IAAKwY,GAAmB9B,GACpB,MAAM,IAAI1W,MAAM,yCACxB,CACA,QAAAyY,GACI,MAAMC,EAAO9M,EAAM/L,GAAKkM,EACxB,OAAOtM,KAAKiX,EAAIgC,CACpB,CACA,UAAAC,GACI,OAAOlZ,KAAKgZ,WAAa,IAAI,EAAUhZ,KAAKmR,EAAGxD,IAAK3N,KAAKiX,EAAG9K,EAAM/L,IAAMJ,IAC5E,CACA,aAAAmZ,GACI,OAAO,GAAWnZ,KAAKoZ,WAC3B,CACA,QAAAA,GACI,MAAMC,EAAOf,EAASgB,EAAoBtZ,KAAKiX,IACzCsC,EAAOjB,EAASgB,EAAoBtZ,KAAKmR,IACzCqI,EAAQH,EAAKvY,OAAS,EACtB2Y,EAAQF,EAAKzY,OAAS,EACtB4Y,EAAOJ,EAAoBE,GAC3BG,EAAOL,EAAoBG,GAEjC,MAAO,KADQH,EAAoBG,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOL,GAClD,CACA,UAAAxB,GACI,OAAO7X,KAAKmZ,eAChB,CACA,KAAApB,GACI,OAAO/X,KAAKoZ,UAChB,CACA,iBAAAQ,GACI,OAAO,GAAW5Z,KAAK6Z,eAC3B,CACA,YAAAA,GACI,OAAOnC,EAAY1X,KAAKmR,GAAKuG,EAAY1X,KAAKiX,EAClD,EAEJ,SAAS,KAAe1M,GACpB,IAAKA,EAAOC,OAAO/J,GAAMA,aAAaG,aAClC,MAAM,IAAIL,MAAM,4BACpB,GAAsB,IAAlBgK,EAAOzJ,OACP,OAAOyJ,EAAO,GAClB,MAAMzJ,EAASyJ,EAAOE,QAAO,CAACvE,EAAGsC,IAAQtC,EAAIsC,EAAI1H,QAAQ,GACnD4J,EAAS,IAAI9J,WAAWE,GAC9B,IAAK,IAAI4C,EAAI,EAAG+B,EAAM,EAAG/B,EAAI6G,EAAOzJ,OAAQ4C,IAAK,CAC7C,MAAM8E,EAAM+B,EAAO7G,GACnBgH,EAAOvH,IAAIqF,EAAK/C,GAChBA,GAAO+C,EAAI1H,MACf,CACA,OAAO4J,CACX,CACA,MAAM,EAAQ3B,MAAMC,KAAK,CAAElI,OAAQ,MAAO,CAACmI,EAAGvF,IAAMA,EAAEwF,SAAS,IAAIC,SAAS,EAAG,OAC/E,SAAS,EAAWI,GAChB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,IAAI9F,EAAI,EAAGA,EAAI6F,EAAOzI,OAAQ4C,IAC/B8F,GAAO,EAAMD,EAAO7F,IAExB,OAAO8F,CACX,CACA,MAAMsQ,EAAYhW,OAAO,uEACzB,SAAS4T,EAAYhI,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAInP,MAAM,mBACpB,KAAM8L,GAAOqD,GAAOA,EAAMoK,GACtB,MAAM,IAAIvZ,MAAM,kCACpB,OAAOmP,EAAIxG,SAAS,IAAIC,SAAS,GAAI,IACzC,CACA,SAAS4Q,EAASrK,GACd,MAAMjP,EAAI,GAAWiX,EAAYhI,IACjC,GAAiB,KAAbjP,EAAEK,OACF,MAAM,IAAIP,MAAM,4BACpB,OAAOE,CACX,CACA,SAAS6Y,EAAoB5J,GACzB,MAAMlG,EAAMkG,EAAIxG,SAAS,IACzB,OAAoB,EAAbM,EAAI1I,OAAa,IAAI0I,IAAQA,CACxC,CACA,SAASkP,EAAYlP,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,4CAA8C2I,GAEtE,OAAO1F,OAAO,KAAK0F,IACvB,CACA,SAAS,GAAWA,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA6C2I,GAErE,GAAIA,EAAI1I,OAAS,EACb,MAAM,IAAIP,MAAM,4CAA8CiJ,EAAI1I,QACtE,MAAM2I,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CACA,SAASoL,GAAcnU,GACnB,OAAOgY,EAAY,EAAWhY,GAClC,CACA,SAAS8V,GAAYhN,GACjB,OAAOA,aAAe5I,WAAaA,WAAWoI,KAAKQ,GAAO,GAAWA,EACzE,CACA,SAASmI,GAAgBjC,GACrB,GAAmB,iBAARA,GAAoBrP,OAAOC,cAAcoP,IAAQA,EAAM,EAC9D,OAAO5L,OAAO4L,GAClB,GAAmB,iBAARA,GAAoBqJ,GAAmBrJ,GAC9C,OAAOA,EACX,MAAM,IAAI7O,UAAU,sDACxB,CACA,SAAS8M,GAAIzH,EAAGzF,EAAI0L,EAAMQ,GACtB,MAAMjC,EAASxE,EAAIzF,EACnB,OAAOiK,GAAU2B,EAAM3B,EAASjK,EAAIiK,CACxC,CACA,SAAS6K,GAAKnH,EAAG4L,GACb,MAAM,EAAErN,GAAMR,EACd,IAAIzH,EAAM0J,EACV,KAAO4L,KAAU3N,GACb3H,GAAOA,EACPA,GAAOiI,EAEX,OAAOjI,CACX,CA4BA,SAAS8K,GAAOrP,EAAQ8Z,EAAS9N,EAAMQ,GACnC,GAAIxM,IAAWkM,GAAO4N,GAAU5N,EAC5B,MAAM,IAAI9L,MAAM,6CAA6CJ,SAAc8Z,KAE/E,IAAI/T,EAAIyH,GAAIxN,EAAQ8Z,GAChBxZ,EAAIwZ,EACJ7L,EAAI/B,EAAKuC,EAAItC,EAAK4N,EAAI5N,EAAKrD,EAAIoD,EACnC,KAAOnG,IAAMmG,GAAK,CACd,MAAM8N,EAAI1Z,EAAIyF,EACRiL,EAAI1Q,EAAIyF,EACRkU,EAAIhM,EAAI8L,EAAIC,EACZ/Z,EAAIwO,EAAI3F,EAAIkR,EAClB1Z,EAAIyF,EAAGA,EAAIiL,EAAG/C,EAAI8L,EAAGtL,EAAI3F,EAAGiR,EAAIE,EAAGnR,EAAI7I,CAC3C,CAEA,GADYK,IACA6L,EACR,MAAM,IAAI/L,MAAM,0BACpB,OAAOoN,GAAIS,EAAG6L,EAClB,CA8BA,IAAIO,GACAC,GAuEJ,SAAS1B,GAAmBrJ,GACxB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAM/L,CACpC,CACA,SAAS0U,GAAoBpF,GACzB,OAAOrD,EAAMqD,GAAOA,EAAMvD,EAAMQ,CACpC,CAsBA,SAASiK,GAAoBrR,GACzB,IAAImK,EACJ,GAAmB,iBAARnK,EACPmK,EAAMnK,OAEL,GAAmB,iBAARA,GAAoBlF,OAAOC,cAAciF,IAAQA,EAAM,EACnEmK,EAAM5L,OAAOyB,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAmB,KAAfA,EAAIzE,OACJ,MAAM,IAAIP,MAAM,oCACpBmP,EAAMgJ,EAAYnT,EACtB,KACK,MAAIA,aAAe3E,YAMpB,MAAM,IAAIC,UAAU,8BALpB,GAAI0E,EAAIzE,SAAWkN,EACf,MAAM,IAAIzN,MAAM,oCACpBmP,EAAMmF,GAActP,EAIxB,CACA,IAAKwT,GAAmBrJ,GACpB,MAAM,IAAInP,MAAM,qCACpB,OAAOmP,CACX,CAoRA,EAAM6C,KAAKiC,eAAe,GAC1B,MAAM,GAAS,CACXxP,KAAM,EACNE,IAAqB,iBAATC,MAAqB,WAAYA,KAAOA,KAAKJ,YAASE,GAOhEua,GAAuB,CAAC,EACjB,GAAQ,CACjBpX,WAAU,EACVD,WAAU,GACVJ,YAAW,EACX4F,OACA6B,UACA,iBAAAiQ,CAAkB9I,GACd,IAEI,OADAC,GAAoBD,IACb,CACX,CACA,MAAOqF,GACH,OAAO,CACX,CACJ,EACA0D,iBAAkB3F,EAClB4F,qBAAsB/I,GACtBgJ,iBAAmB5e,IAGf,IAFAA,EAAOwV,GAAYxV,IAEVF,OADMkN,IACahN,EAAKF,OAAS,KACtC,MAAM,IAAIP,MAAM,uDAGpB,OAAOwZ,EADKpM,GAAIkH,GAAc7T,GAAOmL,EAAM/L,EAAIkM,GAAOA,EAClC,EAExB1E,YAAa,CAAC2D,EAAc,MACxB,GAAI,GAAOrG,IACP,OAAO,GAAOA,IAAIsG,gBAAgB,IAAI5K,WAAW2K,IAEhD,GAAI,GAAOvG,KAAM,CAClB,MAAM,YAAE4C,GAAgB,GAAO5C,KAC/B,OAAOpE,WAAWoI,KAAKpB,EAAY2D,GACvC,CAEI,MAAM,IAAIhL,MAAM,oDACpB,EAEJuf,iBAAkB,IAAM,GAAMF,iBAAiB,GAAMhY,YAAYoG,KACjE,UAAA+R,CAAWnN,EAAa,EAAGY,EAAQ,EAAMjB,MACrC,MAAMyN,EAASxM,IAAU,EAAMjB,KAAOiB,EAAQ,IAAI,EAAMA,EAAMpF,EAAGoF,EAAM5E,GAGvE,OAFAoR,EAAOxL,eAAe5B,GACtBoN,EAAOzM,SAAS/G,GACTwT,CACX,EACAja,OAAQgE,SAAUkW,KACd,GAAI,GAAO/a,IAAK,CACZ,MAAMzC,QAAe,GAAOyC,IAAIgb,OAAOzb,OAAO,UAAW,KAAewb,IACxE,OAAO,IAAIrf,WAAW6B,EAC1B,CACK,GAAI,GAAOuC,KAAM,CAClB,MAAM,WAAEmb,GAAe,GAAOnb,KACxBhE,EAAOmf,EAAW,UAExB,OADAF,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,+CACpB,EAEJwa,WAAYhR,MAAOxE,KAAQ0a,KACvB,GAAI,GAAO/a,IAAK,CACZ,MAAMmb,QAAa,GAAOnb,IAAIgb,OAAOI,UAAU,MAAO/a,EAAK,CAAEkT,KAAM,OAAQzX,KAAM,CAAEyX,KAAM,aAAe,EAAO,CAAC,SAC1G5S,EAAU,KAAeoa,GACzBxd,QAAe,GAAOyC,IAAIgb,OAAOrU,KAAK,OAAQwU,EAAMxa,GAC1D,OAAO,IAAIjF,WAAW6B,EAC1B,CACK,GAAI,GAAOuC,KAAM,CAClB,MAAM,WAAEub,GAAe,GAAOvb,KACxBhE,EAAOuf,EAAW,SAAUhb,GAElC,OADA0a,EAASG,SAAShG,GAAMpZ,EAAK4B,OAAOwX,KAC7BxZ,WAAWoI,KAAKhI,EAAKyD,SAChC,CAEI,MAAM,IAAIlE,MAAM,oDACpB,EAEJigB,gBAAYvb,EACZwb,oBAAgBxb,EAChByZ,WAAY3U,MAAO0U,KAAQwB,KACvB,IAAIS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,QAAa,GAAM5a,OAAOnF,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MACzEF,EAAO,EAAYC,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAO,GAAM3a,OAAO2a,KAAST,EAAS,EAE1Cf,eAAgB,CAACT,KAAQwB,KACrB,GAA2B,mBAAhBzF,GACP,MAAM,IAAIhM,EAAS,+CACvB,IAAIkS,EAAOlB,GAAqBf,GAChC,QAAaxZ,IAATyb,EAAoB,CACpB,MAAMC,EAAOnG,GAAY5Z,WAAWoI,KAAKyV,GAAMtY,GAAMA,EAAEya,WAAW,MAClEF,EAAO,EAAYC,EAAMA,GACzBnB,GAAqBf,GAAOiC,CAChC,CACA,OAAOlG,GAAYkG,KAAST,EAAS,EAEzCY,eAAgBlS,GAEpB/M,OAAOkf,iBAAiB,GAAO,CAC3BN,WAAY,CACRO,cAAc,EACdvc,IAAG,IACQgW,GAEX,GAAArX,CAAI6d,GACKxG,KACDA,GAAcwG,EACtB,GAEJP,eAAgB,CACZM,cAAc,EACdvc,IAAG,IACQiW,GAEX,GAAAtX,CAAI6d,GACKvG,KACDA,GAAkBuG,EAC1B,KCjsCD,MCADi/B,GAAmB,CACrBC,eAAgB,SAChBC,QAAS,CACL,iBAAkB,aASnBp2C,eAAeq2C,GAAa10B,EAAO20B,GACtC,MAAMC,EAAY,CAAC,EAGnB,OAFA1+C,OAAOqJ,OAAOq1C,EAAWL,GAAkBI,SACjBE,MAAM70B,EAAO40B,EAE3C,CA8BO,SAASE,MAAiBlkB,GAC7B,MAAM,SAAEmkB,EAAQ,YAAEC,GAZtB,SAA8BpkB,GAC1B,IAAImkB,EAAWL,GACXM,EAAc,GAOlB,OANIpkB,EAAKx7B,OAAS,GAAwB,mBAAZw7B,EAAK,KAC/BmkB,EAAWnkB,EAAKzzB,SAEhByzB,EAAKx7B,OAAS,IACd4/C,EAAcpkB,GAEX,CAAEmkB,WAAUC,cACvB,CAEsCC,CAAqBrkB,GA0BvD,OAzBgBvyB,MAAOg2B,EAAKsgB,KACxB,IAAIO,EAAc,CAAE7gB,MAAKsgB,KAAMA,GAAQ,CAAC,GACxC,IAAK,MAAMQ,KAAcH,EACS,mBAAnBG,EAAWC,MAKlBF,QAJqB91B,QAAQC,QAAQ81B,EAAWC,IAAI,CAChDP,MAAOE,KACJG,MAEiBA,GAGhC,IAAIG,QAAiBN,EAASG,EAAY7gB,IAAK6gB,EAAYP,MAC3D,IAAK,MAAMQ,KAAcH,EACrB,GAA+B,mBAApBG,EAAWzc,KAAqB,CACvC,MAAM15B,QAAeogB,QAAQC,QAAQ81B,EAAWzc,KAAK,CACjDmc,MAAOE,EACP1gB,IAAK6gB,EAAY7gB,IACjBsgB,KAAMO,EAAYP,KAClBU,SAAUA,GAAUp2C,SAAWo2C,KAEnCA,EAAWr2C,GAAUq2C,CACzB,CAEJ,OAAOA,CAAQ,CAGvB,CC3EO,IAAIC,GAKAC,GAMA,GAKAC,GAJAC,IAXX,SAAWH,GACPA,EAAQA,EAAiB,QAAI,GAAK,UAClCA,EAAQA,EAAiB,QAAI,YAAc,SAC9C,CAHD,CAGGA,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACPA,EAAcA,EAAuB,QAAI,WAAa,UACtDA,EAAcA,EAAuB,QAAI,YAAc,SAC1D,CAHD,CAGGA,KAAkBA,GAAgB,CAAC,IACND,GAAQI,SAE7BD,GAGR,KAAuB,GAAqB,CAAC,IAFzBA,GAA4B,QAAI,GAAK,UACxDA,GAAmBA,GAA4B,QAAI,KAAO,UAG9D,SAAWD,GACPA,EAAeA,EAAiC,iBAAI,IAAM,mBAC1DA,EAAeA,EAAgC,gBAAI,IAAM,kBACzDA,EAAeA,EAAiC,iBAAI,IAAM,mBAC1DA,EAAeA,EAAgC,gBAAI,IAAM,iBAC5D,CALD,CAKGA,KAAmBA,GAAiB,CAAC,IACG,GAAmBE,QCrBvD,MAAM,GAAiB,CAC1BC,QAASL,GAAQI,QACjBE,mBAAoB,GAAmBF,QACvCG,cAAeN,GAAcG,QAC7BI,WAAY,KACZC,YAAa,gCACbC,eAAgB,CACZC,UAAWT,GAAeU,iBAC1BC,SAAUX,GAAeY,iBAE7BC,OAAQ,CAAEC,QHZkB,gCGcnBC,GAAiB,CAC1BZ,QAASL,GAAQkB,QACjBZ,mBAAoB,GAAmBY,QACvCX,cAAeN,GAAciB,QAC7BV,WAAY,KACZC,YAAa,gCACbC,eAAgB,CACZC,UAAWT,GAAeiB,iBAC1BN,SAAUX,GAAekB,iBAE7BL,OAAQ,CAAEC,QHvBkB,gCGyBnBK,GAAgB,IACtBJ,GACHP,eAAgB,IAAKO,GAAeP,gBACpCF,WAAY,KACZO,OAAQ,CAAEC,QH5BY,0BG8BbM,GAAiB,IACvBD,GACHX,eAAgB,IAAKW,GAAcX,gBACnCK,OAAQ,IAAKM,GAAcN,SAiBxB,SAAS,GAAYQ,GACxB,MAAuB,iBAAZA,EAfR,SAAyB9pC,GAC5B,OAAQA,GACJ,IAAK,UACD,OAAO,GACX,IAAK,UACD,OAAOwpC,GACX,IAAK,SACD,OAAOI,GACX,IAAK,UACD,OAAOC,GACX,QACI,MAAM,IAAI/hD,MAAM,yBAAyBkY,KAErD,CAGe+pC,CAAgBD,GACpBA,CACX,KCtCW,GAYAE,GAMAC,GAjBAC,cAAAA,GAUR,KAAgB,GAAc,CAAC,IATlBA,GAA2B,cAAI,GAAK,gBAChDA,GAAYA,GAA2B,cAAI,GAAK,gBAChDA,GAAYA,GAAoC,uBAAI,GAAK,yBACzDA,GAAYA,GAA0B,aAAI,GAAK,eAC/CA,GAAYA,GAA8B,iBAAI,GAAK,mBACnDA,GAAYA,GAAsB,SAAI,GAAK,WAC3CA,GAAYA,GAAoC,uBAAI,GAAK,yBACzDA,GAAYA,GAA0B,aAAI,GAAK,eAC/CA,GAAYA,GAA8B,iBAAI,GAAK,mBAGvD,SAAWF,GACPA,EAAeA,EAAyB,SAAI,GAAK,WACjDA,EAAeA,EAAyB,SAAI,GAAK,WACjDA,EAAeA,EAAyB,SAAI,GAAK,UACpD,CAJD,CAIGA,KAAmBA,GAAiB,CAAC,IAExC,SAAWC,GACPA,EAAWA,EAAwB,YAAI,GAAK,cAC5CA,EAAWA,EAAyB,aAAI,GAAK,eAC7CA,EAAWA,EAAgB,IAAI,GAAK,KACvC,CAJD,CAIGA,KAAeA,GAAa,CAAC,IAezB,IAAIE,GAKAC,GAMAC,GAKA,GAUA,GAKAC,GAQAC,GAKAC,GAMAC,GAMAC,GAKAC,GAOAC,GAzCAC,GAVAC,GA7Beb,GAAWc,YACXd,GAAWe,aACXf,GAAWgB,IAChChB,GAAWc,YAAcd,GAAWc,YACpCd,GAAWe,aAAef,GAAWe,aACrCf,GAAWgB,IAAMhB,GAAWgB,IAQjC,SAAWd,GACPA,EAAkBA,EAAyB,MAAI,GAAK,QACpDA,EAAkBA,EAAwB,KAAI,GAAK,MACtD,CAHD,CAGGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAAkBA,EAAuB,IAAI,GAAK,MAClDA,EAAkBA,EAA4B,SAAI,GAAK,WACvDA,EAAkBA,EAA+B,YAAI,GAAK,aAC7D,CAJD,CAIGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAASA,EAAmB,SAAI,GAAK,WACrCA,EAASA,EAAoB,UAAI,GAAK,WACzC,CAHD,CAGGA,KAAaA,GAAW,CAAC,KAEjBS,GAOR,KAAoB,GAAkB,CAAC,IANtBA,GAAuB,MAAI,GAAK,QAChDA,GAAgBA,GAAsB,KAAI,GAAK,OAC/CA,GAAgBA,GAAwB,OAAI,GAAK,SACjDA,GAAgBA,GAAuB,MAAI,GAAK,QAChDA,GAAgBA,GAAmC,kBAAI,GAAK,oBAC5DA,GAAgBA,GAAoC,mBAAI,GAAK,sBAItDD,GAGR,KAAmB,GAAiB,CAAC,IAFrBA,GAA2B,WAAI,GAAK,aACnDA,GAAeA,GAA6B,aAAI,GAAK,eAGzD,SAAWP,GACPA,EAAsBA,EAA6B,MAAI,GAAK,QAC5DA,EAAsBA,EAA+B,QAAI,GAAK,UAC9DA,EAAsBA,EAAoC,aAAI,GAAK,eACnEA,EAAsBA,EAA4B,KAAI,GAAK,OAC3DA,EAAsBA,EAAiC,UAAI,GAAK,WACnE,CAND,CAMGA,KAA0BA,GAAwB,CAAC,IAEtD,SAAWC,GACPA,EAAyBA,EAAgC,MAAI,IAAM,QACnEA,EAAyBA,EAAsC,YAAI,IAAM,aAC5E,CAHD,CAGGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAyBA,EAAiC,OAAI,GAAK,SACnEA,EAAyBA,EAAmC,SAAI,GAAK,WACrEA,EAAyBA,EAAmC,SAAI,GAAK,UACxE,CAJD,CAIGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAUA,EAAe,IAAI,GAAK,MAClCA,EAAUA,EAAoB,SAAI,GAAK,WACvCA,EAAUA,EAAuB,YAAI,GAAK,aAC7C,CAJD,CAIGA,KAAcA,GAAY,CAAC,IAE9B,SAAWC,GACPA,EAAkBA,EAA8B,WAAI,GAAK,aACzDA,EAAkBA,EAA4B,SAAI,GAAK,UAC1D,CAHD,CAGGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAAcA,EAAmC,oBAAI,GAAK,sBAC1DA,EAAcA,EAAqC,sBAAI,GAAK,wBAC5DA,EAAcA,EAAmC,oBAAI,GAAK,sBAC1DA,EAAcA,EAAqC,sBAAI,GAAK,uBAC/D,CALD,CAKGA,KAAkBA,GAAgB,CAAC,IAEtC,SAAWC,GACPA,EAAgC,cAAI,gBACpCA,EAAkC,gBAAI,kBACtCA,EAAsC,oBAAI,sBAC1CA,EAA4B,UAAI,YAChCA,EAA2B,SAAI,WAC/BA,EAAiC,eAAI,iBACrCA,EAAiC,eAAI,iBACrCA,EAAuC,qBAAI,uBAC3CA,EAAsC,oBAAI,sBAC1CA,EAAwC,sBAAI,wBAC5CA,EAAiD,+BAAI,iCACrDA,EAAuD,qCAAI,uCAC3DA,EAA4C,0BAAI,4BAChDA,EAAwC,sBAAI,wBAC5CA,EAAuC,qBAAI,uBAC3CA,EAA8C,4BAAI,8BAClDA,EAAwC,sBAAI,wBAC5CA,EAAqC,mBAAI,oBAC5C,CAnBD,CAmBGA,KAAqBA,GAAmB,CAAC,IC5I5C,MAAMM,GAAM,IAAI/iD,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzEgjD,GAAKhjD,WAAWoI,KAAK,CAAElI,OAAQ,KAAM,CAACqsC,EAAGzpC,IAAMA,IAC/CmgD,GAAKD,GAAG/zC,KAAKnM,IAAO,EAAIA,EAAI,GAAK,KACvC,IAAIogD,GAAO,CAACF,IACRG,GAAO,CAACF,IACZ,IAAK,IAAIngD,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIgG,IAAK,CAACo6C,GAAMC,IACjBr6C,EAAE0I,KAAK1I,EAAEhG,GAAGmM,KAAK3C,GAAMy2C,GAAIz2C,MACnC,MAAM82C,GAAS,CACX,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDn0C,KAAKnM,GAAM,IAAI9C,WAAW8C,KACtBugD,GAAUH,GAAKj0C,KAAI,CAACi4B,EAAKpkC,IAAMokC,EAAIj4B,KAAKnG,GAAMs6C,GAAOtgD,GAAGgG,OACxDw6C,GAAUH,GAAKl0C,KAAI,CAACi4B,EAAKpkC,IAAMokC,EAAIj4B,KAAKnG,GAAMs6C,GAAOtgD,GAAGgG,OACxDy6C,GAAK,IAAI99C,YAAY,CAAC,EAAY,WAAY,WAAY,WAAY,aACtE+9C,GAAK,IAAI/9C,YAAY,CAAC,WAAY,WAAY,WAAY,WAAY,IAEtEg+C,GAAO,CAACz7C,EAAMC,IAAWD,GAAQC,EAAUD,IAAU,GAAKC,EAEhE,SAAS8J,GAAE2xC,EAAOl2C,EAAGQ,EAAGC,GACpB,OAAc,IAAVy1C,EACOl2C,EAAIQ,EAAIC,EACA,IAAVy1C,EACGl2C,EAAIQ,GAAOR,EAAIS,EACR,IAAVy1C,GACGl2C,GAAKQ,GAAKC,EACH,IAAVy1C,EACGl2C,EAAIS,EAAMD,GAAKC,EAEhBT,GAAKQ,GAAKC,EACzB,CAEA,MAAM01C,GAAM,IAAIl+C,YAAY,IACrB,MAAMm+C,WAAkBxiD,EAC3B,WAAAI,GACIG,MAAM,GAAI,GAAI,GAAG,GACjBvC,KAAKykD,GAAK,WACVzkD,KAAKyc,IAAK,UACVzc,KAAK0kD,IAAK,WACV1kD,KAAK2kD,GAAK,UACV3kD,KAAK4kD,IAAK,UACd,CACA,GAAApgD,GACI,MAAM,GAAEigD,EAAE,GAAEhoC,EAAE,GAAEioC,EAAE,GAAEC,EAAE,GAAEC,GAAO5kD,KAC/B,MAAO,CAACykD,EAAIhoC,EAAIioC,EAAIC,EAAIC,EAC5B,CACA,GAAAzhD,CAAIshD,EAAIhoC,EAAIioC,EAAIC,EAAIC,GAChB5kD,KAAKykD,GAAU,EAALA,EACVzkD,KAAKyc,GAAU,EAALA,EACVzc,KAAK0kD,GAAU,EAALA,EACV1kD,KAAK2kD,GAAU,EAALA,EACV3kD,KAAK4kD,GAAU,EAALA,CACd,CACA,OAAAvhD,CAAQX,EAAMuE,GACV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCs9C,GAAI7gD,GAAKhB,EAAKwE,UAAUD,GAAQ,GAEpC,IAAI49C,EAAe,EAAV7kD,KAAKykD,GAAQK,EAAKD,EAAIE,EAAe,EAAV/kD,KAAKyc,GAAQuoC,EAAKD,EAAIE,EAAe,EAAVjlD,KAAK0kD,GAAQQ,EAAKD,EAAIE,EAAe,EAAVnlD,KAAK2kD,GAAQS,EAAKD,EAAIE,EAAe,EAAVrlD,KAAK4kD,GAAQU,EAAKD,EAGvI,IAAK,IAAIf,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMiB,EAAS,EAAIjB,EACbkB,EAAMrB,GAAGG,GAAQmB,EAAMrB,GAAGE,GAC1BoB,EAAK5B,GAAKQ,GAAQqB,EAAK5B,GAAKO,GAC5B/oC,EAAK0oC,GAAQK,GAAQsB,EAAK1B,GAAQI,GACxC,IAAK,IAAI5gD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMmiD,EAAMxB,GAAKQ,EAAKlyC,GAAE2xC,EAAOS,EAAIE,EAAIE,GAAMZ,GAAImB,EAAGhiD,IAAM8hD,EAAKjqC,EAAG7X,IAAM2hD,EAAM,EAC9ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfd,GAAKY,EAAI,IAASA,EAAKF,EAAIA,EAAKc,CAC3D,CAEA,IAAK,IAAIniD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMoiD,EAAMzB,GAAKS,EAAKnyC,GAAE4yC,EAAQP,EAAIE,EAAIE,GAAMb,GAAIoB,EAAGjiD,IAAM+hD,EAAKG,EAAGliD,IAAM4hD,EAAM,EAC/ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAff,GAAKa,EAAI,IAASA,EAAKF,EAAIA,EAAKc,CAC3D,CACJ,CAEA9lD,KAAKmD,IAAKnD,KAAKyc,GAAKwoC,EAAKG,EAAM,EAAIplD,KAAK0kD,GAAKS,EAAKG,EAAM,EAAItlD,KAAK2kD,GAAKU,EAAKP,EAAM,EAAI9kD,KAAK4kD,GAAKC,EAAKG,EAAM,EAAIhlD,KAAKykD,GAAKM,EAAKG,EAAM,EACvI,CACA,UAAA3hD,GACIghD,GAAI9gD,KAAK,EACb,CACA,OAAAmB,GACI5E,KAAKuB,WAAY,EACjBvB,KAAKyC,OAAOgB,KAAK,GACjBzD,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EACzB,EAMG,MAAM4iD,GAAYp+C,GAAgB,IAAM,IAAI68C,KClG7CwB,GAAaliD,OAAO,GAAK,GAAK,GAC9BD,GAAOC,OAAO,IAEb,SAASmiD,GAAQ7lD,EAAG8lD,GAAK,GAC5B,OAAIA,EACO,CAAEhiD,EAAG7D,OAAOD,EAAI4lD,IAAa7hD,EAAG9D,OAAQD,GAAKyD,GAAQmiD,KACzD,CAAE9hD,EAAsC,EAAnC7D,OAAQD,GAAKyD,GAAQmiD,IAAiB7hD,EAA4B,EAAzB9D,OAAOD,EAAI4lD,IACpE,CAqCA,MAeA,GAnDO,SAAeG,EAAKD,GAAK,GAC5B,IAAIE,EAAK,IAAI//C,YAAY8/C,EAAIrlD,QACzBulD,EAAK,IAAIhgD,YAAY8/C,EAAIrlD,QAC7B,IAAK,IAAI4C,EAAI,EAAGA,EAAIyiD,EAAIrlD,OAAQ4C,IAAK,CACjC,MAAM,EAAEQ,EAAC,EAAEC,GAAM8hD,GAAQE,EAAIziD,GAAIwiD,IAChCE,EAAG1iD,GAAI2iD,EAAG3iD,IAAM,CAACQ,EAAGC,EACzB,CACA,MAAO,CAACiiD,EAAIC,EAChB,EA2CA,GAxCc,CAACniD,EAAGC,EAAG8S,IAAM/S,IAAM+S,EAwCjC,GAvCc,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAM8S,EAuCpD,GArCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,IAAM+S,EAAM9S,GAAM,GAAK8S,EAqCpD,GApCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAM8S,EAoCrD,GAlCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,GAAM,GAAK+S,EAAO9S,IAAO8S,EAAI,GAkC1D,GAjCe,CAAC/S,EAAGC,EAAG8S,IAAO/S,IAAO+S,EAAI,GAAQ9S,GAAM,GAAK8S,EAiC3D,GApBO,SAAamvC,EAAIC,EAAIC,EAAIC,GAC5B,MAAMpiD,GAAKkiD,IAAO,IAAME,IAAO,GAC/B,MAAO,CAAEriD,EAAIkiD,EAAKE,GAAOniD,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBA,GAfc,CAACkiD,EAAIE,EAAIC,KAAQH,IAAO,IAAME,IAAO,IAAMC,IAAO,GAehE,GAdc,CAACC,EAAKL,EAAIE,EAAII,IAAQN,EAAKE,EAAKI,GAAOD,EAAM,GAAK,GAAM,GAAM,EAc5E,GAbc,CAACJ,EAAIE,EAAIC,EAAIG,KAAQN,IAAO,IAAME,IAAO,IAAMC,IAAO,IAAMG,IAAO,GAajF,GAZc,CAACF,EAAKL,EAAIE,EAAII,EAAIE,IAAQR,EAAKE,EAAKI,EAAKE,GAAOH,EAAM,GAAK,GAAM,GAAM,EAYrF,GAVc,CAACA,EAAKL,EAAIE,EAAII,EAAIE,EAAIC,IAAQT,EAAKE,EAAKI,EAAKE,EAAKC,GAAOJ,EAAM,GAAK,GAAM,GAAM,EAU9F,GAXc,CAACJ,EAAIE,EAAIC,EAAIG,EAAIG,KAAQT,IAAO,IAAME,IAAO,IAAMC,IAAO,IAAMG,IAAO,IAAMG,IAAO,IC3C3FC,GAAWC,IAAa,GAAU,CACrC,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpEn3C,KAAIzP,GAAK0D,OAAO1D,MAEZ6mD,GAAa,IAAI5gD,YAAY,IAC7B6gD,GAAa,IAAI7gD,YAAY,IAC5B,MAAM8gD,WAAenlD,EACxB,WAAAI,GACIG,MAAM,IAAK,GAAI,IAAI,GAKnBvC,KAAKomD,GAAK,WACVpmD,KAAKqmD,IAAK,UACVrmD,KAAKsmD,IAAK,WACVtmD,KAAKumD,IAAK,WACVvmD,KAAK0mD,GAAK,WACV1mD,KAAKwmD,IAAK,SACVxmD,KAAK4mD,IAAK,WACV5mD,KAAK2mD,GAAK,WACV3mD,KAAK6mD,GAAK,WACV7mD,KAAK8mD,IAAK,WACV9mD,KAAKonD,IAAK,WACVpnD,KAAKqnD,GAAK,UACVrnD,KAAKsnD,GAAK,UACVtnD,KAAKunD,IAAK,SACVvnD,KAAKwnD,GAAK,WACVxnD,KAAKynD,GAAK,SACd,CAEA,GAAAjjD,GACI,MAAM,GAAE4hD,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEG,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAED,EAAE,GAAEE,EAAE,GAAEC,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOznD,KAC3E,MAAO,CAAComD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAAtkD,CAAIijD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DznD,KAAKomD,GAAU,EAALA,EACVpmD,KAAKqmD,GAAU,EAALA,EACVrmD,KAAKsmD,GAAU,EAALA,EACVtmD,KAAKumD,GAAU,EAALA,EACVvmD,KAAK0mD,GAAU,EAALA,EACV1mD,KAAKwmD,GAAU,EAALA,EACVxmD,KAAK4mD,GAAU,EAALA,EACV5mD,KAAK2mD,GAAU,EAALA,EACV3mD,KAAK6mD,GAAU,EAALA,EACV7mD,KAAK8mD,GAAU,EAALA,EACV9mD,KAAKonD,GAAU,EAALA,EACVpnD,KAAKqnD,GAAU,EAALA,EACVrnD,KAAKsnD,GAAU,EAALA,EACVtnD,KAAKunD,GAAU,EAALA,EACVvnD,KAAKwnD,GAAU,EAALA,EACVxnD,KAAKynD,GAAU,EAALA,CACd,CACA,OAAApkD,CAAQX,EAAMuE,GAEV,IAAK,IAAIvD,EAAI,EAAGA,EAAI,GAAIA,IAAKuD,GAAU,EACnCggD,GAAWvjD,GAAKhB,EAAKwE,UAAUD,GAC/BigD,GAAWxjD,GAAKhB,EAAKwE,UAAWD,GAAU,GAE9C,IAAK,IAAIvD,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAMgkD,EAA4B,EAArBT,GAAWvjD,EAAI,IACtBikD,EAA4B,EAArBT,GAAWxjD,EAAI,IACtBkkD,EAAM,GAAWF,EAAMC,EAAM,GAAK,GAAWD,EAAMC,EAAM,GAAK,GAAUD,EAAMC,EAAM,GACpFE,EAAM,GAAWH,EAAMC,EAAM,GAAK,GAAWD,EAAMC,EAAM,GAAK,GAAUD,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,GAAWvjD,EAAI,GACrBqkD,EAA0B,EAApBb,GAAWxjD,EAAI,GACrBskD,EAAM,GAAWF,EAAKC,EAAK,IAAM,GAAWD,EAAKC,EAAK,IAAM,GAAUD,EAAKC,EAAK,GAChFE,EAAM,GAAWH,EAAKC,EAAK,IAAM,GAAWD,EAAKC,EAAK,IAAM,GAAUD,EAAKC,EAAK,GAEhFG,EAAO,GAAUL,EAAKI,EAAKf,GAAWxjD,EAAI,GAAIwjD,GAAWxjD,EAAI,KAC7DykD,EAAO,GAAUD,EAAMN,EAAKI,EAAKf,GAAWvjD,EAAI,GAAIujD,GAAWvjD,EAAI,KACzEujD,GAAWvjD,GAAY,EAAPykD,EAChBjB,GAAWxjD,GAAY,EAAPwkD,CACpB,CACA,IAAI,GAAE9B,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEG,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAED,EAAE,GAAEE,EAAE,GAAEC,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOznD,KAEzE,IAAK,IAAI0D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAM0kD,EAAU,GAAWvB,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EuB,EAAU,GAAWxB,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAE/EwB,EAAQzB,EAAKO,GAAQP,EAAKS,EAI1BiB,EAAO,GAAUd,EAAIY,EAHbvB,EAAKO,GAAQP,EAAKS,EAGUP,GAAUtjD,GAAIwjD,GAAWxjD,IAC7D8kD,EAAM,GAAUD,EAAMf,EAAIY,EAASE,EAAMvB,GAAUrjD,GAAIujD,GAAWvjD,IAClE+kD,EAAa,EAAPF,EAENG,EAAU,GAAWtC,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EsC,EAAU,GAAWvC,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAAM,GAAWD,EAAIC,EAAI,IAC/EuC,EAAQxC,EAAKE,EAAOF,EAAKM,EAAOJ,EAAKI,EACrCmC,EAAQxC,EAAKE,EAAOF,EAAKG,EAAOD,EAAKC,EAC3CgB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALP,EACLQ,EAAU,EAALP,IACF5iD,EAAG2iD,EAAI1iD,GAAU,GAAa,EAALyiD,EAAa,EAALD,EAAc,EAAN6B,EAAe,EAANC,IACrD7B,EAAU,EAALF,EACLC,EAAU,EAALH,EACLE,EAAU,EAALJ,EACLE,EAAU,EAALD,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACL,MAAMyC,EAAM,GAAUL,EAAKE,EAASE,GACpCzC,EAAK,GAAU0C,EAAKN,EAAKE,EAASE,GAClCvC,EAAW,EAANyC,CACT,GAEG5kD,EAAGkiD,EAAIjiD,EAAGkiD,GAAO,GAAkB,EAAVrmD,KAAKomD,GAAkB,EAAVpmD,KAAKqmD,GAAa,EAALD,EAAa,EAALC,MAC3DniD,EAAGoiD,EAAIniD,EAAGoiD,GAAO,GAAkB,EAAVvmD,KAAKsmD,GAAkB,EAAVtmD,KAAKumD,GAAa,EAALD,EAAa,EAALC,MAC3DriD,EAAGwiD,EAAIviD,EAAGqiD,GAAO,GAAkB,EAAVxmD,KAAK0mD,GAAkB,EAAV1mD,KAAKwmD,GAAa,EAALE,EAAa,EAALF,MAC3DtiD,EAAG0iD,EAAIziD,EAAGwiD,GAAO,GAAkB,EAAV3mD,KAAK4mD,GAAkB,EAAV5mD,KAAK2mD,GAAa,EAALC,EAAa,EAALD,MAC3DziD,EAAG2iD,EAAI1iD,GAAU,GAAkB,EAAVnE,KAAK6mD,GAAkB,EAAV7mD,KAAK8mD,GAAa,EAALD,EAAa,EAALC,MAC3D5iD,EAAOC,EAAGkjD,GAAO,GAAkB,EAAVrnD,KAAKonD,GAAkB,EAAVpnD,KAAKqnD,GAAa,EAALD,EAAa,EAALC,MAC3DnjD,EAAGojD,EAAInjD,EAAGojD,GAAO,GAAkB,EAAVvnD,KAAKsnD,GAAkB,EAAVtnD,KAAKunD,GAAa,EAALD,EAAa,EAALC,MAC3DrjD,EAAGsjD,EAAIrjD,EAAGsjD,GAAO,GAAkB,EAAVznD,KAAKwnD,GAAkB,EAAVxnD,KAAKynD,GAAa,EAALD,EAAa,EAALC,IAC9DznD,KAAKmD,IAAIijD,EAAIC,EAAIC,EAAIC,EAAIG,EAAIF,EAAII,EAAID,EAAIE,EAAIC,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAAlkD,GACI0jD,GAAWxjD,KAAK,GAChByjD,GAAWzjD,KAAK,EACpB,CACA,OAAAmB,GACI5E,KAAKyC,OAAOgB,KAAK,GACjBzD,KAAKmD,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAEJ,MAAM4lD,WAAmB5B,GACrB,WAAA/kD,GACIG,QAEAvC,KAAKomD,IAAK,WACVpmD,KAAKqmD,GAAK,UACVrmD,KAAKsmD,GAAK,WACVtmD,KAAKumD,IAAK,WACVvmD,KAAK0mD,GAAK,UACV1mD,KAAKwmD,GAAK,UACVxmD,KAAK4mD,GAAK,WACV5mD,KAAK2mD,GAAK,WACV3mD,KAAK6mD,GAAK,UACV7mD,KAAK8mD,GAAK,WACV9mD,KAAKonD,GAAK,WACVpnD,KAAKqnD,GAAK,SACVrnD,KAAKsnD,GAAK,WACVtnD,KAAKunD,GAAK,WACVvnD,KAAKwnD,GAAK,UACVxnD,KAAKynD,IAAK,WACVznD,KAAKkB,UAAY,EACrB,EAEJ,MAAM8nD,WAAmB7B,GACrB,WAAA/kD,GACIG,QAEAvC,KAAKomD,GAAK,UACVpmD,KAAKqmD,IAAK,SACVrmD,KAAKsmD,IAAK,WACVtmD,KAAKumD,IAAK,UACVvmD,KAAK0mD,GAAK,UACV1mD,KAAKwmD,GAAK,WACVxmD,KAAK4mD,IAAK,WACV5mD,KAAK2mD,GAAK,WACV3mD,KAAK6mD,IAAK,WACV7mD,KAAK8mD,IAAK,WACV9mD,KAAKonD,IAAK,WACVpnD,KAAKqnD,GAAK,WACVrnD,KAAKsnD,GAAK,UACVtnD,KAAKunD,GAAK,UACVvnD,KAAKwnD,GAAK,UACVxnD,KAAKynD,IAAK,WACVznD,KAAKkB,UAAY,EACrB,EAEJ,MAAM+nD,WAAe9B,GACjB,WAAA/kD,GACIG,QAEAvC,KAAKomD,IAAK,UACVpmD,KAAKqmD,IAAK,WACVrmD,KAAKsmD,GAAK,WACVtmD,KAAKumD,GAAK,UACVvmD,KAAK0mD,IAAK,WACV1mD,KAAKwmD,GAAK,UACVxmD,KAAK4mD,GAAK,UACV5mD,KAAK2mD,IAAK,UACV3mD,KAAK6mD,GAAK,WACV7mD,KAAK8mD,IAAK,QACV9mD,KAAKonD,IAAK,WACVpnD,KAAKqnD,GAAK,WACVrnD,KAAKsnD,IAAK,UACVtnD,KAAKunD,GAAK,WACVvnD,KAAKwnD,GAAK,WACVxnD,KAAKynD,IAAK,WACVznD,KAAKkB,UAAY,EACrB,EAEkByG,GAAgB,IAAM,IAAIw/C,KACtBx/C,GAAgB,IAAM,IAAIohD,KAC1BphD,GAAgB,IAAM,IAAIqhD,KAC9BrhD,GAAgB,IAAM,IAAIshD,YC/MzC,MAOM,GAAav9B,GhBwNnB,SAAoBniB,GACvB,KAAMA,aAAkB3I,YACpB,MAAM,IAAIL,MAAM,uBACpB,IAAIiJ,EAAM,GACV,IAAK,MAAM0Q,KAAK3Q,EACZC,GAAOV,EAAMoR,GAEjB,OAAO1Q,CACX,CgB/NW,CARY,CAACkiB,GACbq6B,GAAU,EAAOr6B,IAON,CAAQA,IC9BvB,IAAI,GACAw9B,GCmBJ,SAASC,GAAwBptC,EAAWwmC,EAAU,WACzDA,EAAU,GAAYA,GACtBxmC,EAAiC,iBAAdA,ElBwOhB,SAAoBvS,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAI3I,UAAU,2CAA2C2I,GAvDhE,IAAmB1H,EA0DtB0H,GA1DsB1H,EAyDN0H,EAAhBA,EAxDO,OAAOqwB,KAAK/3B,GACbA,EAAM6C,MAAM,GACZ7C,GAuDIhB,OAAS,EAAI,IAAI0I,IAAQA,EACnC,MAAMC,EAAQ,IAAI7I,WAAW4I,EAAI1I,OAAS,GAC1C,IAAK,IAAI4C,EAAI,EAAGA,EAAI+F,EAAM3I,OAAQ4C,IAAK,CACnC,MAAMgG,EAAQ,EAAJhG,EACJiG,EAAUH,EAAI7E,MAAM+E,EAAGA,EAAI,GAC3BE,EAAOvJ,OAAOwJ,SAASF,EAAS,IACtC,GAAItJ,OAAOyJ,MAAMF,IAASA,EAAO,EAC7B,MAAM,IAAIrJ,MAAM,yBACpBkJ,EAAM/F,GAAKkG,CACf,CACA,OAAOH,CACX,CkBxPgD,CAAWsS,GAAaA,EACpE,MAAMqtC,ECrBH,SAAkCC,EAAU9G,GAE/C,OADAA,EAAU,GAAYA,GAAW,IACzB8G,GACJ,KAAK,GAAgBC,MACjB,OAAQ/G,EAAQjB,oBACZ,KAAK,GAAmBF,QACpB,OAAOF,GAAeU,iBAC1B,KAAK,GAAmBM,QACpB,OAAOhB,GAAeiB,iBAC1B,QACI,MAAM,IAAI5hD,MAAM,iCAAiCgiD,EAAQjB,mCAAmC+H,KAExG,KAAK,GAAgBE,KACrB,KAAK,GAAgBC,kBACrB,KAAK,GAAgBC,OACrB,KAAK,GAAgBC,MACrB,KAAK,GAAgBC,mBACjB,OAAQpH,EAAQjB,oBACZ,KAAK,GAAmBF,QACpB,OAAOF,GAAeY,gBAC1B,KAAK,GAAmBI,QACpB,OAAOhB,GAAekB,gBAC1B,QACI,MAAM,IAAI7hD,MAAM,iCAAiCgiD,EAAQjB,mCAAmC+H,KAExG,QACI,MAAM,IAAI9oD,MAAM,uBAAuB8oD,KAEnD,CDPoBO,CAAyB,GAAgBN,MAAO/G,GEa7D,IAAgCp9B,EAASnkB,EAGhB6oD,EFb5B,OEa4BA,GAHO1kC,EFZCikC,EEYQpoD,EFZC,GAAU+a,GEahD,CAAE2d,KAAM,GAAeowB,QAAS3kC,UAAS4kC,QAAS/oD,KAGlD,SAAW6oD,EAAQ1kC,QAAS0kC,EAAQE,QFb/C,CGVO,SAASC,GACdC,EACAtzC,EACAuzC,EACAC,EACA76B,EAAmB,SACnB86B,EAAW,IAAIhgD,KACfigD,ErBtBK,WACH,OAAO,IAAIjgD,MAAK,IAAIA,MAAOkgD,aAAY,IAAIlgD,MAAOmgD,cAAgB,GACtE,CqBoBcC,IAEZ,GAAyB,WAArBl7B,EACF,MAAM,IAAI/uB,MAAM,mCAGlB,MAAMwb,EAAY,EAAAqN,gBAAgBQ,gBAAgBjT,GAE7CuzC,IACHA,EAAU,CAAEnuC,cAGTouC,IACHA,EAAS,CAAEpuC,cAGb,MAAM0uC,EAAc,IAAI,EAAA37B,YAAYQ,EAAkB3Y,GAEhDwV,EAAU,CACdu+B,IAAK3K,IACL4K,IAAKP,EAAStjB,cACd8jB,IAAKP,EAAUvjB,cACfojB,UACAC,SACAU,MAAOZ,GAGT,OAAOQ,EAAY5+C,KAAKsgB,EAC1B,CAOO,SAAS2+B,GAAiBh/B,GAC/B,MAAO,CACLA,QACAi/B,cAAc,IAAAn/B,aAAYE,GAE9B,CAUO,SAASk/B,GAAmBl/B,EAAem/B,GAChD,MAAMF,GAAe,IAAAn/B,aAAYE,GAC3BK,EAAU4+B,EAAa5+B,QAC7B,GAAuB,iBAAZA,EACT,MAAM,IAAI5rB,MAAM,2CAIlB,IAAI4rB,EAAQ0C,eAAe,aAAc1C,EAAQ+9B,QAK/C,MAAM,IAAI3pD,MAAM,gCAJhB,IAAK4rB,EAAQ+9B,QAAQr7B,eAAe,aAClC,MAAM,IAAItuB,MAAM,2CAOpB,IAAI4rB,EAAQ0C,eAAe,YAAa1C,EAAQg+B,OAK9C,MAAM,IAAI5pD,MAAM,gCAJhB,IAAK4rB,EAAQg+B,OAAOt7B,eAAe,aACjC,MAAM,IAAItuB,MAAM,2CAOpB,IAAK4rB,EAAQ0C,eAAe,SAC1B,MAAM,IAAItuB,MAAM,8BAGlB,MAAM2qD,EAAmB/+B,EAAQg+B,OAAkCpuC,UAC7D8tC,EAAUV,GAAwB+B,GAExC,GAAID,IAAuBC,QAEpB,GAAID,IAAuBpB,EAGhC,MAAM,IAAItpD,MAAM,8DAGlB,MAAM4qD,EAAgB,IAAI,EAAAn7B,cAAc+6B,EAAat0C,OAAOqW,IAAeo+B,GAC3E,IAAKC,EACH,MAAM,IAAI5qD,MAAM,0BAIlB,IADsB4qD,EAAcx/C,OAAOmgB,GAEzC,MAAM,IAAIvrB,MAAM,6BAGlB,OAAOwqD,CACT,CAWO,SAASK,GACdt/B,EACAm/B,EAAoC,MAEpC,IAAIF,EAEFA,EADEE,EACaD,GAAmBl/B,EAAOm/B,IAE1B,IAAAr/B,aAAYE,GAG7B,IAAIm+B,EAAU,CAAC,EACf,GAAIc,EAAal8B,eAAe,WAAY,CAC1C,MAAM1C,EAAU4+B,EAAa5+B,QAC7B,GAAuB,iBAAZA,EACT,MAAM,IAAI5rB,MAAM,2CAEd4rB,EAAQ0C,eAAe,WACzBo7B,EAAU99B,EAAQ0+B,MAEtB,CAEA,OAAOZ,CACT,CCvJA,SAASoB,GAAcC,EAAqBzoD,GAC1C,IAAI0oD,EAIJ,OAHI1oD,EAAK2oD,OAAS3oD,EAAK2oD,MAAMzrB,MAC3BwrB,EAAW1oD,EAAK2oD,MAAMzrB,KAEjB,CACL,QAAS,UACT0rB,QAASH,EACTI,WAAY7oD,EAAK8oD,SACjBC,UAAW,OACXL,WAEJ,ELpBWrC,GAaR,KAAmB,GAAiB,CAAC,IAZrBA,GAAwB,QAAI,GAAK,UAChDA,GAAeA,GAA0B,UAAI,GAAK,YAClDA,GAAeA,GAAqC,qBAAI,GAAK,uBAC7DA,GAAeA,GAA2B,WAAI,GAAK,aACnDA,GAAeA,GAAsB,MAAI,GAAK,QAC9CA,GAAeA,GAA8B,cAAI,GAAK,gBACtDA,GAAeA,GAA0B,UAAI,GAAK,YAClDA,GAAeA,GAAmC,mBAAI,GAAK,qBAC3DA,GAAeA,GAAwB,QAAI,GAAK,UAChDA,GAAeA,GAAiC,iBAAI,GAAK,mBACzDA,GAAeA,GAAwC,wBAAI,IAAM,0BACjEA,GAAeA,GAAqC,qBAAI,IAAM,uBCHlE,GAAMzoC,eAAiB,CAAClb,KAAQokB,KAC5B,MAAMzlB,EAAIkB,EAAKnE,OAAO,EAAQsE,GAE9B,OADAokB,EAAKvJ,SAAQ9U,GAAOpH,EAAEtB,OAAO0I,KACtBpH,EAAEO,QAAQ,0BKbrB,MCCMonD,GAAS,CAAC,QAAS,OAAQ,OAAQ,QAAS,QAC5CC,GAAa,CAAC,EACdC,GAAa,CAAC,EACpB,IAAK,IAAIzlC,EAAQ,EAAGA,EAAQulC,GAAO/qD,OAAQwlB,IAAS,CAChD,MAAM0lC,EAAQH,GAAOvlC,GACrBwlC,GAAWE,GAAS1lC,EACpBylC,GAAWzlC,GAAS0lC,CACxB,CACO,MAAM,GACT,YAAOhwC,CAAMnW,GACJ7F,KAAKisD,UAAU,UAEpBtgC,QAAQ3P,MAAMhc,KAAKksD,WAAW,QAASrmD,GAC3C,CACA,WAAOsmD,CAAKtmD,GACH7F,KAAKisD,UAAU,SAEpBtgC,QAAQwgC,KAAKnsD,KAAKksD,WAAW,OAAQrmD,GACzC,CACA,WAAO60C,CAAK70C,GACH7F,KAAKisD,UAAU,SAEpBtgC,QAAQpK,IAAIvhB,KAAKksD,WAAW,OAAQrmD,GACxC,CACA,YAAOumD,CAAMvmD,GACJ7F,KAAKisD,UAAU,UAEpBtgC,QAAQpK,IAAIvhB,KAAKksD,WAAW,QAASrmD,GACzC,CACA,iBAAOqmD,CAAWF,EAAOnmD,GACrB,MAAO,IAAImmD,EAAMzkC,kBAAkB1hB,GACvC,CACA,gBAAOomD,CAAUD,GAEb,OADqBF,GAA0B,OACxBA,GAAWE,EACtC,ECRJ,MAAMK,GAA2C,CAC/C3yB,KAAM,SACN6I,WAAY,CACV,WAAY,CAAE7I,KAAM,SAAUoH,UAAU,GACxC,QAAS,CAAEpH,KAAM,YAOd,MAAM4yB,GAGX,WAAAlqD,CAAY6nD,EAAU,CAAC,GACrBjqD,KAAKusD,SAAW3qD,OAAOqJ,OACrB,CAAC,EACD,CACE,WAAY,sBAEdg/C,EAEJ,CAEA,MAAApL,GACE,OAAOj9C,OAAOqJ,OAAO,CAAC,EAAGjL,KAAKusD,SAChC,CAEA,OAAAC,CAAQ71C,GACN,OAAOqzC,GAAiBhqD,KAAK6+C,SAAUloC,EACzC,CAEA,qBAAO81C,CAAexC,EAAc1sC,GAAS,GAE3C,OADA8uC,GAAiB9uC,OAASA,EACnB,YAAmB8uC,GAAkBpC,EAC9C,CAEA,gBAAOyC,CAAU5gC,EAAem/B,EAAoC,MAClE,MAAMhB,EAAUmB,GAAet/B,EAAOm/B,GACtC,OAAO,IAAIqB,GAAQrC,EACrB,CAEA,mBAAOnL,CAAa6N,EAAoBC,GACtC,OAAOC,GAAoBF,EAAYC,EACzC,EAGF,MAAME,GAAyB,CAC7BpzB,KAAM,SACNnc,QAAQ,EACRglB,WAAY,CACV,WAAY,CAAE7I,KAAM,SAAUoH,UAAU,GACxC,QAAS,CAAEpH,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,GACnCroB,KAAM,CAAEihB,KAAM,SAAUoH,UAAU,GAClCisB,UAAW,CAAErzB,KAAM,SAAUoH,UAAU,GACvCksB,WAAY,CAAEtzB,KAAM,SAAUoH,UAAU,GACxCmsB,YAAa,CAAEvzB,KAAM,SAAUoH,UAAU,GACzCosB,MAAO,CACLxzB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjBjhB,KAAM,CAAEihB,KAAM,SAAUoH,UAAU,GAClCqsB,WAAY,CAAEzzB,KAAM,SAAUoH,UAAU,MAI9CssB,QAAS,CACP1zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjBqG,IAAK,CAAErG,KAAM,SAAUoH,UAAU,MAIvCusB,QAAS,CACP3zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB+xB,QAAS,CAAE/xB,KAAM,SAAUoH,UAAU,GACrC4qB,WAAY,CAAEhyB,KAAM,SAAUoH,UAAU,GACxC8qB,UAAW,CAAElyB,KAAM,SAAUoH,UAAU,GACvCyqB,SAAU,CAAE7xB,KAAM,SAAUoH,UAAU,GACtCwsB,aAAc,CAAE5zB,KAAM,SAAUoH,UAAU,GAC1CysB,eAAgB,CAAE7zB,KAAM,SAAUoH,UAAU,MAIlD0sB,SAAU,CACR9zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,MAIzC2sB,MAAO,CACL/zB,KAAM,QACNoH,UAAU,EACVgC,MAAO,CACLpJ,KAAM,SACN6I,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjB,MAAO,CAAEA,KAAM,SAAUoH,UAAU,MAIzC+oB,QAAS,CACPnwB,KAAM,SACNoH,UAAU,EACVyB,WAAY,CACV,QAAS,CAAE7I,KAAM,UACjBg0B,cAAe,CAAEh0B,KAAM,SAAUoH,UAAU,GAC3C6sB,gBAAiB,CAAEj0B,KAAM,SAAUoH,UAAU,GAC7C8sB,WAAY,CAAEl0B,KAAM,SAAUoH,UAAU,GACxC+sB,eAAgB,CAAEn0B,KAAM,SAAUoH,UAAU,KAGhDgtB,UAAW,CAAEp0B,KAAM,SAAUoH,UAAU,GACvCitB,MAAO,CAAEr0B,KAAM,SAAUoH,UAAU,KAOhC,MAAMktB,WAAe1B,GAC1B,WAAAlqD,CAAY6nD,EAA+B,CAAE,QAAS,WACpD1nD,MAAM0nD,GACNjqD,KAAKusD,SAAW3qD,OAAOqJ,OACrB,CAAC,EACD,CACE,QAAS,UAEXjL,KAAKusD,SAET,CAEA,qBAAOE,CAAexC,EAAc1sC,GAAS,GAE3C,OADAuvC,GAAuBvvC,OAASA,EACzB,YAAmB8uC,GAAkBpC,EAC9C,CAEA,gBAAOyC,CAAU5gC,EAAem/B,EAAoC,MAClE,MAAMhB,EAAUmB,GAAet/B,EAAOm/B,GACtC,OAAO,IAAI+C,GAAO/D,EACpB,CAEA,uBAAOgE,CAAiBC,GACtB,MAAMjE,EHhKH,SAAmCA,GACxC,MAAMkE,EAcF,CACF,QAAS,UAGX,GAAIlE,EAAS,CACPA,EAAQxxC,MAAQwxC,EAAQxxC,KAAK21C,YAC/BD,EAAY11C,KAAOwxC,EAAQxxC,KAAK21C,WAG9BnE,EAAQoE,MACVF,EAAYlB,YAAchD,EAAQoE,KAGhCpE,EAAQqE,UAAYrE,EAAQqE,SAASF,YACvCD,EAAYtE,QAAU,CACpB,QAAS,gBACT8D,gBAAiB1D,EAAQqE,SAASF,YAItC,MAAMG,EAAS,GACXtE,EAAQuE,QAAUvE,EAAQuE,OAAOzuB,KACnCwuB,EAAOn8C,KAAK,CACV,QAAS,cACTqG,KAAM,SACN00C,WAAYlD,EAAQuE,OAAOzuB,MAG3BkqB,EAAQwE,OAASxE,EAAQwE,MAAM1uB,KACjCwuB,EAAOn8C,KAAK,CACV,QAAS,cACTqG,KAAM,QACN00C,WAAYlD,EAAQwE,MAAM1uB,MAG1BwuB,EAAOztD,SACTqtD,EAAYjB,MAAQqB,GAGlBtE,EAAQmD,UACVe,EAAYf,QAAU,CACpB,CACE,QAAS,UACTrtB,IAAKkqB,EAAQmD,WAKnB,MAAMsB,EAAW,GACbzE,EAAQ0E,SAAW1E,EAAQ0E,QAAQ9E,SACrC6E,EAASt8C,KAAK,CACZ,QAAS,UACTw8C,KAAM,UACNnD,QAAS,UACTC,WAAYzB,EAAQ0E,QAAQ9E,UAG5BI,EAAQ4E,SAAW5E,EAAQ4E,QAAQlD,UACrC+C,EAASt8C,KAAKi5C,GAAc,UAAWpB,EAAQ4E,UAE7C5E,EAAQ6E,UAAY7E,EAAQ6E,SAASnD,UACvC+C,EAASt8C,KAAKi5C,GAAc,WAAYpB,EAAQ6E,WAE9C7E,EAAQ8E,QAAU9E,EAAQ8E,OAAOpD,UACnC+C,EAASt8C,KAAKi5C,GAAc,SAAUpB,EAAQ8E,SAG5C9E,EAAQ+E,MACN/E,EAAQ+E,KAAKluD,OAAS,GACpBmpD,EAAQ+E,KAAK,IAAM/E,EAAQ+E,KAAK,GAAGC,gBACrCP,EAASt8C,KAAK,CACZ,QAAS,UACTw8C,KAAM,MACNnD,QAAS,QACTC,WAAYzB,EAAQ+E,KAAK,GAAGC,iBAKhChF,EAAQiF,KAAOjF,EAAQiF,IAAInvB,KAC7B2uB,EAASt8C,KAAK,CACZ,QAAS,UACTw8C,KAAM,MACNnD,QAAS,MACTC,WAAYzB,EAAQiF,IAAIC,YACxBhC,WAAYlD,EAAQiF,IAAInvB,MAI5BouB,EAAYd,QAAUqB,CACxB,CAEA,OAAOP,CACT,CGoDoBiB,CAA0BlB,GAC1C,OAAO,IAAIF,GAAO/D,EACpB,CAEA,MAAApL,GACE,MAAO,CACLoL,QAASjqD,KAAKiqD,UACdxxC,KAAMzY,KAAKyY,OACXs0C,UAAW/sD,KAAK+sD,YAChBC,WAAYhtD,KAAKgtD,aACjBC,YAAajtD,KAAKitD,cAClBoC,UAAWrvD,KAAKqvD,YAChBC,iBAAkBtvD,KAAKsvD,mBACvBzF,QAAS7pD,KAAK6pD,UACdiE,UAAW9tD,KAAK8tD,YAChByB,YAAavvD,KAAKuvD,cAClBC,cAAexvD,KAAKwvD,gBAExB,CAEA,OAAAvF,GACE,OAAOroD,OAAOqJ,OAAO,CAAC,EAAGjL,KAAKusD,SAChC,CAEA,IAAA9zC,GACE,OCtNG,SAAiBwxC,GACtB,IAAKA,EACH,OAAO,KAGT,IAAIxxC,EAAO,KAYX,OAXIwxC,EAAQxxC,KACVA,EAAOwxC,EAAQxxC,MACNwxC,EAAQ8C,WAAa9C,EAAQ+C,cACtCv0C,EAAO,GACHwxC,EAAQ8C,YACVt0C,EAAOwxC,EAAQ8C,WAEb9C,EAAQ+C,aACVv0C,GAAQ,IAAIwxC,EAAQ+C,eAGjBv0C,CACT,CDoMWg3C,CAAQzvD,KAAKiqD,UACtB,CAEA,SAAA8C,GACE,OClMG,SAAsB9C,GAC3B,IAAKA,EACH,OAAO,KAGT,IAAI8C,EAAY,KAOhB,OANI9C,EAAQ8C,UACVA,EAAY9C,EAAQ8C,UACX9C,EAAQxxC,OAEjBs0C,EADkB9C,EAAQxxC,KAAKuT,MAAM,KACfrnB,MAAM,GAAI,GAAGqf,KAAK,MAEnC+oC,CACT,CDqLW2C,CAAa1vD,KAAKiqD,UAC3B,CAEA,UAAA+C,GACE,OCnLG,SAAuB/C,GAC5B,IAAKA,EACH,OAAO,KAGT,IAAI+C,EAAa,KAOjB,OANI/C,EAAQ+C,WACVA,EAAa/C,EAAQ+C,WACZ/C,EAAQxxC,OAEjBu0C,EADkB/C,EAAQxxC,KAAKuT,MAAM,KACdgO,OAElBgzB,CACT,CDsKW2C,CAAc3vD,KAAKiqD,UAC5B,CAEA,WAAAgD,GACE,OCpKG,SAAwBhD,GAC7B,IAAKA,EACH,OAAO,KAGT,IAAIgD,EAAc,KAIlB,OAHIhD,EAAQgD,cACVA,EAAchD,EAAQgD,aAEjBA,CACT,CD0JW2C,CAAe5vD,KAAKiqD,UAC7B,CAEA,SAAAoF,GACE,OCxJG,SAAsBpF,GAC3B,IAAKA,EACH,OAAO,KAGT,IAAI4F,EAAkC,KAWtC,OAVI5F,EAAQiD,OACVjD,EAAQiD,MAAMr9C,KAAKq9C,GACE,WAAfA,EAAMz0C,MACRo3C,EAAmB3C,EAAMC,WAClB0C,GAEA,OAINA,CACT,CDuIWC,CAAa9vD,KAAKiqD,UAC3B,CAEA,gBAAAqF,CAAiBS,GACf,OCrIG,SAA6B9F,EAAc8F,GAChD,IAAK9F,EACH,OAAO,KAGT,MAAM+F,EAA0B,GAiChC,OAhCI/F,EAAQp7B,eAAe,YAAckhC,GACvC9F,EAAQoD,QAAQx9C,KAAKw9C,IACnB,IAAI4C,GAAiB,EACjB1E,EAAW,KAoBf,OAlBAwE,EAAclgD,KAAIqgD,IACZA,EAAarhC,eAAe,eAC9BqhC,EAAa3E,SAAW2E,EAAaC,cAGrCD,EAAalsB,OACbksB,EAAazE,UAAY4B,EAAQ5B,SACjCyE,EAAaxE,aAAe2B,EAAQ3B,aACpCwE,EAAa3E,WAEb0E,GAAiB,EACjB1E,EAAW2E,EAAa3E,SACjB,OAMP0E,GACF5C,EAAQ9B,SAAWA,EACnByE,EAAiB59C,KAAKi7C,GACfA,GAEA,IACT,IAGG2C,CACT,CD8FWI,CAAoBpwD,KAAKiqD,UAAW8F,EAC7C,CAEA,OAAAlG,GACE,OCxDG,SAAoBI,GACzB,IAAKA,EACH,OAAO,KAGT,IAAIoG,EAAgB,KAEpB,GAAIpG,EAAQp7B,eAAe,WAAY,CACrC,MAAMyhC,EAAe,GAEjBrG,EAAQJ,QAAQh7B,eAAe,kBACjCyhC,EAAal+C,KAAK63C,EAAQJ,QAAQ6D,eAEhCzD,EAAQJ,QAAQh7B,eAAe,oBACjCyhC,EAAal+C,KAAK63C,EAAQJ,QAAQ8D,iBAEhC1D,EAAQJ,QAAQh7B,eAAe,eACjCyhC,EAAal+C,KAAK63C,EAAQJ,QAAQ+D,YAEhC3D,EAAQJ,QAAQh7B,eAAe,mBACjCyhC,EAAal+C,KAAK63C,EAAQJ,QAAQgE,gBAGhCyC,EAAaxvD,SACfuvD,EAAgBC,EAAatsC,KAAK,MAEtC,CAEA,OAAOqsC,CACT,CD2BWE,CAAWvwD,KAAKiqD,UACzB,CAEA,SAAA6D,GACE,OCzBG,SAAsB7D,GAC3B,IAAKA,EACH,OAAO,KAGT,MAAMuG,EAAa,CACjB,UACA,WACA,QACA,QACA,MACA,OACA,OACA,SACA,YACA,UACA,WACA,YAGF,IAAIC,EAAkB,KAEtB,GAAIxG,EAAQp7B,eAAe,aAAc,CACvC,MAAM0Q,EAAO,IAAIn1B,KAAK6/C,EAAQ6D,WAC9B2C,EAAkB,GAAGD,EAAWjxB,EAAKmxB,eAAenxB,EAAKoxB,cAAcpxB,EAAKgrB,eAC9E,CAEA,OAAOkG,CACT,CDHWG,CAAa5wD,KAAKiqD,UAC3B,CAEA,WAAAsF,GACE,OClFG,SAAwBtF,GAC7B,IAAKA,EACH,OAAO,KAGT,IAAIsF,EAAc,GAMlB,OAJItF,EAAQp7B,eAAe,WACzB0gC,EAActF,EAAQwD,OAGjB8B,CACT,CDsEWsB,CAAe7wD,KAAKiqD,UAC7B,CAEA,aAAAuF,GACE,OCxG6BvF,EDwGLjqD,KAAKiqD,WCjG3BA,EAAQp7B,eAAe,YAClBo7B,EAAQuD,SAHY,GAHpB,KAFJ,IAA0BvD,CDyG/B,EAUK,SAAS4C,GAAoBjvB,EAAgBkzB,GAClD,IAAKA,EAAa/vD,SAAS,OACzB,MAAM,IAAIR,MAAM,0BAGlB,MAAMwwD,EAAYD,EAAa9kC,MAAM,OAAO,GACtCglC,EAAWF,EAAa9kC,MAAM,OAAO,GAAGA,MAAM,KAI9CilC,EAAW,CACfjU,QAASpf,EACTqf,KAAM,KACNiB,IAAK,CACH,CACEzlC,KAAM,aACNmgC,SAAU,GACVgF,OAAQ,EACRE,OAAQ,GAAGiT,OAXFC,EAAS,MACHA,EAASrsD,MAAM,GAAGqf,KAAK,UAiB5C,OAAO,KAAA86B,cAAamS,EAFK,6BAG3B,CAQO,SAASC,GAAgBC,GAC9B,IAAKA,EAAatiC,eAAe,OAC/B,OAAO,KAET,IAAK9lB,MAAMsZ,QAAQ8uC,EAAajT,KAC9B,OAAO,KAET,GAAIiT,EAAajT,IAAIp9C,OAAS,EAC5B,OAAO,KAGT,MAAMswD,EAAeD,EAAajT,IAAIzb,QACnC4uB,GAAgBA,EAAOxiC,eAAe,WAA6B,eAAhBwiC,EAAO54C,OAG7D,GAAI24C,EAAatwD,OAAS,EACxB,OAAO,KAGT,MAAMwwD,EAAmBF,EAAa,GAEtC,IAAKE,EAAiBziC,eAAe,UACnC,OAAO,KAET,IAAIiiC,EAAeQ,EAAiBxT,OAUpC,OARIgT,EAAaS,WAAW,UAEjBT,EAAaS,WAAW,UAGjCT,EAAe,WAAWA,KAGrBA,CACT,CASO,SAASU,GACd3mD,GApVF,MAyVE,MAAM03C,EAAU,GAAY,SAAA13C,EAAK03C,SAAL,EAAgB,WACtCR,EAASngD,OAAOqJ,OAAO,CAAC,EdvRzB,SAA2Bs3C,GAC9B,OAAIA,EAAQR,OAAOxB,MACRgC,EAAQR,OACZ,IACAQ,EAAQR,OACXxB,MAAOC,KAEf,CcgRmCiR,CAAkBlP,GAAU13C,EAAKk3C,QAElE,OAAO,IAAIj3B,SAAQ,CAACC,EAASC,KAC3B,IAAImmC,EAAe,KACnB,IACEA,GAAe,KAAApS,eAAcl0C,EAAKomD,UAC7BE,EAAatiC,eAAe,aAC/BsiC,EAAe,KAEnB,CAAE,MAAOx0C,GACPqO,EAAOrO,EACT,CAEA,IAAIm0C,EAA8B,KAClC,GAAIK,GAAgBvvD,OAAOuyB,KAAKg9B,GAAcrwD,OAAS,EACrDgwD,EAAeI,GAAgBC,QAE/B,IACE,OAAOpmC,EAAQijC,GAAOC,iBAAiBhiC,KAAKC,MAAMrhB,EAAKomD,WAAWhH,UACpE,CAAE,MAAOjuC,GACP,OAAOgP,EAAOhP,EAChB,CAGE80C,EACF/O,EACGxB,MAAMuQ,GACNxlC,MAAKy1B,GAAYA,EAAS2Q,SAC1BpmC,MAAKqmC,GAAgB1lC,KAAKC,MAAMylC,KAChCrmC,MAAKsmC,IACJ,MACM3H,EAAUmB,GADKwG,EACuB,GAAG9lC,MAAOjhB,EAAKogD,oBAC3DlgC,EAAQk/B,EAAQ,IAEjB4H,OAAM71C,IACL,GAAOA,MACL,uDAAuD80C,MAAiB90C,KAE1EgP,EAAOhP,EAAM,KAGjB,GAAOowC,MAAM,yDACbrhC,EAAQ,CAAC,GACX,GAEJ,CEzXO,SAAS+mC,GACdb,EACAhG,EACAvoB,EACAqvB,EAAmBvR,MAEnB,IAAI2Q,EAAe,KACnB,IAEE,GADAA,GAAe,KAAApS,eAAckS,IACxBE,EAAatiC,eAAe,WAE/B,MADAsiC,EAAe,KACT,IAAI5wD,MAAM,iCAEpB,CAAE,MAAOoc,GACPgP,QAAQ3P,MAAMW,EAChB,CAEA,IAAIm0C,EAAe,KACnB,GAAIK,GAAgBvvD,OAAOuyB,KAAKg9B,GAAcrwD,OAAS,EACrDgwD,EAAeI,GAAgBC,GAc7BL,EACFiB,EAAQjB,GACLxlC,MAAMy1B,GAAkBA,EAAS2Q,SACjCpmC,MAAMqmC,GAAsB1lC,KAAKC,MAAMylC,KACvCrmC,MAAMsmC,IACL,MAEM3H,EAAUmB,GAFKwG,EACM,GAAG9lC,MACQm/B,GAEtCvoB,EAASunB,EAAQ,IAElB4H,OAAO71C,IACN2P,QAAQwgC,KAAKnwC,EAAM,KAGvB2P,QAAQwgC,KAAK,4BACbzpB,EAAS,CAAC,QA/BZ,CAGE,IAAIunB,EAAU,KACd,IACEA,EAAUh+B,KAAKC,MAAM+kC,GAErBhH,EADe+D,GAAOC,iBAAiBhE,GACtBA,SACnB,CAAE,MAAOjuC,GACP2P,QAAQwgC,KAAKnwC,EACf,CACA0mB,EAASunB,EAEX,CAoBF","sources":["webpack://StacksProfile/webpack/universalModuleDefinition","webpack://StacksProfile/webpack/runtime/create fake namespace object","webpack://StacksProfile/../../node_modules/@noble/hashes/_assert.js","webpack://StacksProfile/../../node_modules/@noble/hashes/_sha2.js","webpack://StacksProfile/../../node_modules/@noble/hashes/cryptoBrowser.js","webpack://StacksProfile/../../node_modules/@noble/hashes/hmac.js","webpack://StacksProfile/../../node_modules/@noble/hashes/sha256.js","webpack://StacksProfile/../../node_modules/@noble/hashes/utils.js","webpack://StacksProfile/../../node_modules/@noble/secp256k1/lib/index.js","webpack://StacksProfile/../../node_modules/base-x/src/index.js","webpack://StacksProfile/../../node_modules/base64-js/index.js","webpack://StacksProfile/../../node_modules/c32check/lib/address.js","webpack://StacksProfile/../../node_modules/c32check/lib/base58check.js","webpack://StacksProfile/../../node_modules/c32check/lib/checksum.js","webpack://StacksProfile/../../node_modules/c32check/lib/encoding.js","webpack://StacksProfile/../../node_modules/c32check/lib/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/base64Url.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/secp256k1.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/cryptoClients/sha256.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/decode.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/ecdsaSigFormatter.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/errors.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/index.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/signer.js","webpack://StacksProfile/../../node_modules/jsontokens/lib/verifier.js","webpack://StacksProfile/../../node_modules/lodash.clonedeep/index.js","webpack://StacksProfile/../../node_modules/process/browser.js","webpack://StacksProfile/../../node_modules/schema-inspector/index.js","webpack://StacksProfile/../../node_modules/schema-inspector/lib/schema-inspector.js","webpack://StacksProfile/../../node_modules/schema-inspector/node_modules/async/dist/async.js","webpack://StacksProfile/../../node_modules/zone-file/dist/index.js","webpack://StacksProfile/../../node_modules/zone-file/dist/zone-file.cjs.production.min.js","webpack://StacksProfile/webpack/bootstrap","webpack://StacksProfile/webpack/runtime/define property getters","webpack://StacksProfile/webpack/runtime/global","webpack://StacksProfile/webpack/runtime/hasOwnProperty shorthand","webpack://StacksProfile/webpack/runtime/make namespace object","webpack://StacksProfile/webpack/runtime/node module decorator","webpack://StacksProfile/../common/dist/esm/utils.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_assert.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/utils.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/cryptoBrowser.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/hmac.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_sha2.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/sha256.js","webpack://StacksProfile/../../node_modules/@noble/secp256k1/lib/esm/index.js","webpack://StacksProfile/../common/dist/esm/constants.js","webpack://StacksProfile/../common/dist/esm/fetch.js","webpack://StacksProfile/../network/dist/esm/constants.js","webpack://StacksProfile/../network/dist/esm/network.js","webpack://StacksProfile/../transactions/dist/esm/constants.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/ripemd160.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/_u64.js","webpack://StacksProfile/../../node_modules/@noble/hashes/esm/sha512.js","webpack://StacksProfile/../transactions/dist/esm/utils.js","webpack://StacksProfile/../transactions/dist/esm/wire/types.js","webpack://StacksProfile/../transactions/dist/esm/keys.js","webpack://StacksProfile/../transactions/dist/esm/address.js","webpack://StacksProfile/../transactions/dist/esm/wire/helpers.js","webpack://StacksProfile/./src/profileTokens.ts","webpack://StacksProfile/./src/profileSchemas/personLegacy.ts","webpack://StacksProfile/../common/dist/esm/config.js","webpack://StacksProfile/../common/dist/esm/logger.js","webpack://StacksProfile/./src/profile.ts","webpack://StacksProfile/./src/profileSchemas/personUtils.ts","webpack://StacksProfile/./src/profileSchemas/personZoneFiles.ts"],"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[\"StacksProfile\"] = factory();\n\telse\n\t\troot[\"StacksProfile\"] = factory();\n})(this, () => {\nreturn ","var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8\|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes \|\| [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.output = exports.exists = exports.hash = exports.bytes = exports.bool = exports.number = void 0;\nfunction number(n) {\n if (!Number.isSafeInteger(n) \|\| n < 0)\n throw new Error(`Wrong positive integer: ${n}`);\n}\nexports.number = number;\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`Expected boolean, not ${b}`);\n}\nexports.bool = bool;\nfunction bytes(b, ...lengths) {\n if (!(b instanceof Uint8Array))\n throw new TypeError('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new TypeError(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexports.bytes = bytes;\nfunction hash(hash) {\n if (typeof hash !== 'function' \|\| typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nexports.hash = hash;\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nexports.exists = exists;\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexports.output = output;\nconst assert = {\n number,\n bool,\n bytes,\n hash,\n exists,\n output,\n};\nexports.default = assert;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SHA2 = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nclass SHA2 extends utils_js_1.Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = (0, utils_js_1.createView)(this.buffer);\n }\n update(data) {\n _assert_js_1.default.exists(this);\n const { view, buffer, blockLen } = this;\n data = (0, utils_js_1.toBytes)(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = (0, utils_js_1.createView)(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n _assert_js_1.default.exists(this);\n _assert_js_1.default.output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024*6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = (0, utils_js_1.createView)(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\| (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\nexports.SHA2 = SHA2;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.crypto = void 0;\nexports.crypto = {\n node: undefined,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hmac = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// HMAC (RFC 2104)\nclass HMAC extends utils_js_1.Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n _assert_js_1.default.hash(hash);\n const key = (0, utils_js_1.toBytes)(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new TypeError('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n _assert_js_1.default.exists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n _assert_js_1.default.exists(this);\n _assert_js_1.default.bytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to \|\| (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/*\n HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n /\nconst hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nexports.hmac = hmac;\nexports.hmac.create = (hash, key) => new HMAC(hash, key);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha224 = exports.sha256 = void 0;\nconst _sha2_js_1 = require(\"./_sha2.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends _sha2_js_1.SHA2 {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = IV[0] \| 0;\n this.B = IV[1] \| 0;\n this.C = IV[2] \| 0;\n this.D = IV[3] \| 0;\n this.E = IV[4] \| 0;\n this.F = IV[5] \| 0;\n this.G = IV[6] \| 0;\n this.H = IV[7] \| 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = (0, utils_js_1.rotr)(W15, 7) ^ (0, utils_js_1.rotr)(W15, 18) ^ (W15 >>> 3);\n const s1 = (0, utils_js_1.rotr)(W2, 17) ^ (0, utils_js_1.rotr)(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = (0, utils_js_1.rotr)(E, 6) ^ (0, utils_js_1.rotr)(E, 11) ^ (0, utils_js_1.rotr)(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = (0, utils_js_1.rotr)(A, 2) ^ (0, utils_js_1.rotr)(A, 13) ^ (0, utils_js_1.rotr)(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 \| 0;\n this.B = 0x367cd507 \| 0;\n this.C = 0x3070dd17 \| 0;\n this.D = 0xf70e5939 \| 0;\n this.E = 0xffc00b31 \| 0;\n this.F = 0x68581511 \| 0;\n this.G = 0x64f98fa7 \| 0;\n this.H = 0xbefa4fa4 \| 0;\n this.outputLen = 28;\n }\n}\n/\n SHA2-256 hash function\n * @param message - data that would be hashed\n /\nexports.sha256 = (0, utils_js_1.wrapConstructor)(() => new SHA256());\nexports.sha224 = (0, utils_js_1.wrapConstructor)(() => new SHA224());\n","\"use strict\";\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = exports.wrapConstructorWithOpts = exports.wrapConstructor = exports.checkOpts = exports.Hash = exports.concatBytes = exports.toBytes = exports.utf8ToBytes = exports.asyncLoop = exports.nextTick = exports.hexToBytes = exports.bytesToHex = exports.isLE = exports.rotr = exports.createView = exports.u32 = exports.u8 = void 0;\n// The import here is via the package name. This is to ensure\n// that exports mapping/resolution does fall into place.\nconst crypto_1 = require(\"@noble/hashes/crypto\");\n// Cast array to different type\nconst u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.u8 = u8;\nconst u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\nexports.u32 = u32;\n// Cast array to view\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.createView = createView;\n// The rotate right (circular right shift) operation for uint32\nconst rotr = (word, shift) => (word << (32 - shift)) \| (word >>> shift);\nexports.rotr = rotr;\nexports.isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// There is almost no big endian hardware, but js typed arrays uses platform specific endianness.\n// So, just to be sure not to corrupt anything.\nif (!exports.isLE)\n throw new Error('Non little-endian hardware is not supported');\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/\n @example bytesToHex(Uint8Array.from([0xde, 0xad, 0xbe, 0xef]))\n /\nfunction bytesToHex(uint8a) {\n // pre-caching improves the speed 6x\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nexports.bytesToHex = bytesToHex;\n/\n @example hexToBytes('deadbeef')\n /\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex');\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nexports.hexToBytes = hexToBytes;\n// There is no setImmediate in browser and setTimeout is slow. However, call to async function will return Promise\n// which will be fullfiled only on next scheduler queue processing step and this is exactly what we need.\nconst nextTick = async () => { };\nexports.nextTick = nextTick;\n// Returns control to thread each 'tick' ms to avoid blocking\nasync function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await (0, exports.nextTick)();\n ts += diff;\n }\n}\nexports.asyncLoop = asyncLoop;\nfunction utf8ToBytes(str) {\n if (typeof str !== 'string') {\n throw new TypeError(`utf8ToBytes expected string, got ${typeof str}`);\n }\n return new TextEncoder().encode(str);\n}\nexports.utf8ToBytes = utf8ToBytes;\nfunction toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n if (!(data instanceof Uint8Array))\n throw new TypeError(`Expected input type is Uint8Array (got ${typeof data})`);\n return data;\n}\nexports.toBytes = toBytes;\n/*\n Concats Uint8Array-s into one; like `Buffer.concat([buf1, buf2])`\n * @example concatBytes(buf1, buf2)\n /\nfunction concatBytes(...arrays) {\n if (!arrays.every((a) => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nexports.concatBytes = concatBytes;\n// For runtime check if class implements interface\nclass Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\nexports.Hash = Hash;\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj) => Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\nfunction checkOpts(defaults, opts) {\n if (opts !== undefined && (typeof opts !== 'object' \|\| !isPlainObject(opts)))\n throw new TypeError('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexports.checkOpts = checkOpts;\nfunction wrapConstructor(hashConstructor) {\n const hashC = (message) => hashConstructor().update(toBytes(message)).digest();\n const tmp = hashConstructor();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashConstructor();\n return hashC;\n}\nexports.wrapConstructor = wrapConstructor;\nfunction wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexports.wrapConstructorWithOpts = wrapConstructorWithOpts;\n/\n Secure PRNG\n /\nfunction randomBytes(bytesLength = 32) {\n if (crypto_1.crypto.web) {\n return crypto_1.crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto_1.crypto.node) {\n return new Uint8Array(crypto_1.crypto.node.randomBytes(bytesLength).buffer);\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n}\nexports.randomBytes = randomBytes;\n","\"use strict\";\n/! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) /\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.utils = exports.schnorr = exports.verify = exports.signSync = exports.sign = exports.getSharedSecret = exports.recoverPublicKey = exports.getPublicKey = exports.Signature = exports.Point = exports.CURVE = void 0;\nconst nodeCrypto = require(\"crypto\");\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nexports.CURVE = CURVE;\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 \|\| k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n \|\| Y2 === _0n)\n return this;\n if (X1 === _0n \|\| Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n \|\| k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) \|\| 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 (W - 1);\n const mask = BigInt(2 W - 1);\n const maxNumber = 2 W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nclass Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 \|\| header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 \|\| recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) \|\| !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n \|\| a === _1n \|\| this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nexports.Point = Point;\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 \|\| data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len \|\| res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 \|\| data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nclass Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nexports.Signature = Signature;\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res = res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n \|\| modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' \|\| hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' \|\| qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return exports.utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) \| Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nfunction getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexports.getPublicKey = getPublicKey;\nfunction recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nexports.recoverPublicKey = recoverPublicKey;\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr \|\| str) && item.length;\n if (arr)\n return len === compressedLen \|\| len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 \|\| len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nfunction getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nexports.getSharedSecret = getSharedSecret;\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = exports.utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nexports.sign = sign;\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexports.signSync = signSync;\nconst vopts = { strict: true };\nfunction verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nexports.verify = verify;\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) \|\| !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = exports.utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = exports.utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = exports.utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R \|\| !R.hasEvenY() \|\| R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await exports.utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(exports.utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexports.schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexports.utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen \|\| hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => exports.utils.hashToPrivateKey(exports.utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await exports.utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return exports.utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(exports.utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 \|\| i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 \|\| i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) \|\n (revLookup[b64.charCodeAt(i + 1)] << 12) \|\n (revLookup[b64.charCodeAt(i + 2)] << 6) \|\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) \|\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) \|\n (revLookup[b64.charCodeAt(i + 1)] << 4) \|\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32ToB58 = exports.b58ToC32 = exports.c32addressDecode = exports.c32address = exports.versions = void 0;\nconst checksum_1 = require(\"./checksum\");\nconst base58check = require(\"./base58check\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nexports.versions = {\n mainnet: {\n p2pkh: 22,\n p2sh: 20, // 'M'\n },\n testnet: {\n p2pkh: 26,\n p2sh: 21, // 'N'\n },\n};\n// address conversion : bitcoin to stacks\nconst ADDR_BITCOIN_TO_STACKS = {};\nADDR_BITCOIN_TO_STACKS[0] = exports.versions.mainnet.p2pkh;\nADDR_BITCOIN_TO_STACKS[5] = exports.versions.mainnet.p2sh;\nADDR_BITCOIN_TO_STACKS[111] = exports.versions.testnet.p2pkh;\nADDR_BITCOIN_TO_STACKS[196] = exports.versions.testnet.p2sh;\n// address conversion : stacks to bitcoin\nconst ADDR_STACKS_TO_BITCOIN = {};\nADDR_STACKS_TO_BITCOIN[exports.versions.mainnet.p2pkh] = 0;\nADDR_STACKS_TO_BITCOIN[exports.versions.mainnet.p2sh] = 5;\nADDR_STACKS_TO_BITCOIN[exports.versions.testnet.p2pkh] = 111;\nADDR_STACKS_TO_BITCOIN[exports.versions.testnet.p2sh] = 196;\n/*\n Make a c32check address with the given version and hash160\n * The only difference between a c32check string and c32 address\n * is that the letter 'S' is pre-pended.\n * @param {number} version - the address version number\n * @param {string} hash160hex - the hash160 to encode (must be a hash160)\n * @returns {string} the address\n /\nfunction c32address(version, hash160hex) {\n if (!hash160hex.match(/^[0-9a-fA-F]{40}$/)) {\n throw new Error('Invalid argument: not a hash160 hex string');\n }\n const c32string = (0, checksum_1.c32checkEncode)(version, hash160hex);\n return `S${c32string}`;\n}\nexports.c32address = c32address;\n/\n Decode a c32 address into its version and hash160\n * @param {string} c32addr - the c32check-encoded address\n * @returns {[number, string]} a tuple with the version and hash160\n /\nfunction c32addressDecode(c32addr) {\n if (c32addr.length <= 5) {\n throw new Error('Invalid c32 address: invalid length');\n }\n if (c32addr[0] != 'S') {\n throw new Error('Invalid c32 address: must start with \"S\"');\n }\n return (0, checksum_1.c32checkDecode)(c32addr.slice(1));\n}\nexports.c32addressDecode = c32addressDecode;\n/\n * Convert a base58check address to a c32check address.\n * Try to convert the version number if one is not given.\n * @param {string} b58check - the base58check encoded address\n * @param {number} version - the version number, if not inferred from the address\n * @returns {string} the c32 address with the given version number (or the\n * semantically-equivalent c32 version number, if not given)\n /\nfunction b58ToC32(b58check, version = -1) {\n const addrInfo = base58check.decode(b58check);\n const hash160String = (0, utils_1.bytesToHex)(addrInfo.data);\n const addrVersion = parseInt((0, utils_1.bytesToHex)(addrInfo.prefix), 16);\n let stacksVersion;\n if (version < 0) {\n stacksVersion = addrVersion;\n if (ADDR_BITCOIN_TO_STACKS[addrVersion] !== undefined) {\n stacksVersion = ADDR_BITCOIN_TO_STACKS[addrVersion];\n }\n }\n else {\n stacksVersion = version;\n }\n return c32address(stacksVersion, hash160String);\n}\nexports.b58ToC32 = b58ToC32;\n/\n * Convert a c32check address to a base58check address.\n * @param {string} c32string - the c32check address\n * @param {number} version - the version number, if not inferred from the address\n * @returns {string} the base58 address with the given version number (or the\n * semantically-equivalent bitcoin version number, if not given)\n /\nfunction c32ToB58(c32string, version = -1) {\n const addrInfo = c32addressDecode(c32string);\n const stacksVersion = addrInfo[0];\n const hash160String = addrInfo[1];\n let bitcoinVersion;\n if (version < 0) {\n bitcoinVersion = stacksVersion;\n if (ADDR_STACKS_TO_BITCOIN[stacksVersion] !== undefined) {\n bitcoinVersion = ADDR_STACKS_TO_BITCOIN[stacksVersion];\n }\n }\n else {\n bitcoinVersion = version;\n }\n let prefix = bitcoinVersion.toString(16);\n if (prefix.length === 1) {\n prefix = `0${prefix}`;\n }\n return base58check.encode(hash160String, prefix);\n}\nexports.c32ToB58 = c32ToB58;\n","/\n * From https://github.com/wzbg/base58check\n * @Author: zyc\n * @Date: 2016-09-11 23:36:05\n /\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decode = exports.encode = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst basex = require(\"base-x\");\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\nfunction encode(data, prefix = '00') {\n const dataBytes = typeof data === 'string' ? (0, utils_1.hexToBytes)(data) : data;\n const prefixBytes = typeof prefix === 'string' ? (0, utils_1.hexToBytes)(prefix) : data;\n if (!(dataBytes instanceof Uint8Array) \|\| !(prefixBytes instanceof Uint8Array)) {\n throw new TypeError('Argument must be of type Uint8Array or string');\n }\n const checksum = (0, sha256_1.sha256)((0, sha256_1.sha256)(new Uint8Array([...prefixBytes, ...dataBytes])));\n return basex(ALPHABET).encode([...prefixBytes, ...dataBytes, ...checksum.slice(0, 4)]);\n}\nexports.encode = encode;\nfunction decode(string) {\n const bytes = basex(ALPHABET).decode(string);\n const prefixBytes = bytes.slice(0, 1);\n const dataBytes = bytes.slice(1, -4);\n // todo: for better performance replace spread with `concatBytes` method\n const checksum = (0, sha256_1.sha256)((0, sha256_1.sha256)(new Uint8Array([...prefixBytes, ...dataBytes])));\n bytes.slice(-4).forEach((check, index) => {\n if (check !== checksum[index]) {\n throw new Error('Invalid checksum');\n }\n });\n return { prefix: prefixBytes, data: dataBytes };\n}\nexports.decode = decode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32checkDecode = exports.c32checkEncode = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst encoding_1 = require(\"./encoding\");\n/\n Get the c32check checksum of a hex-encoded string\n * @param {string} dataHex - the hex string\n * @returns {string} the c32 checksum, as a bin-encoded string\n /\nfunction c32checksum(dataHex) {\n const dataHash = (0, sha256_1.sha256)((0, sha256_1.sha256)((0, utils_1.hexToBytes)(dataHex)));\n const checksum = (0, utils_1.bytesToHex)(dataHash.slice(0, 4));\n return checksum;\n}\n/\n Encode a hex string as a c32check string. This is a lot like how\n * base58check works in Bitcoin-land, but this algorithm uses the\n * z-base-32 alphabet instead of the base58 alphabet. The algorithm\n * is as follows:\n * * calculate the c32checksum of version + data\n * * c32encode version + data + c32checksum\n * @param {number} version - the version string (between 0 and 31)\n * @param {string} data - the data to encode\n * @returns {string} the c32check representation\n /\nfunction c32checkEncode(version, data) {\n if (version < 0 \|\| version >= 32) {\n throw new Error('Invalid version (must be between 0 and 31)');\n }\n if (!data.match(/^[0-9a-fA-F]$/)) {\n throw new Error('Invalid data (not a hex string)');\n }\n data = data.toLowerCase();\n if (data.length % 2 !== 0) {\n data = `0${data}`;\n }\n let versionHex = version.toString(16);\n if (versionHex.length === 1) {\n versionHex = `0${versionHex}`;\n }\n const checksumHex = c32checksum(`${versionHex}${data}`);\n const c32str = (0, encoding_1.c32encode)(`${data}${checksumHex}`);\n return `${encoding_1.c32[version]}${c32str}`;\n}\nexports.c32checkEncode = c32checkEncode;\n/\n Decode a c32check string back into its version and data payload. This is\n * a lot like how base58check works in Bitcoin-land, but this algorithm uses\n * the z-base-32 alphabet instead of the base58 alphabet. The algorithm\n * is as follows:\n * * extract the version, data, and checksum\n * * verify the checksum matches c32checksum(version + data)\n * * return data\n * @param {string} c32data - the c32check-encoded string\n * @returns {array} [version (number), data (string)]. The returned data\n * will be a hex string. Throws an exception if the checksum does not match.\n /\nfunction c32checkDecode(c32data) {\n c32data = (0, encoding_1.c32normalize)(c32data);\n const dataHex = (0, encoding_1.c32decode)(c32data.slice(1));\n const versionChar = c32data[0];\n const version = encoding_1.c32.indexOf(versionChar);\n const checksum = dataHex.slice(-8);\n let versionHex = version.toString(16);\n if (versionHex.length === 1) {\n versionHex = `0${versionHex}`;\n }\n if (c32checksum(`${versionHex}${dataHex.substring(0, dataHex.length - 8)}`) !== checksum) {\n throw new Error('Invalid c32check string: checksum mismatch');\n }\n return [version, dataHex.substring(0, dataHex.length - 8)];\n}\nexports.c32checkDecode = c32checkDecode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.c32decode = exports.c32normalize = exports.c32encode = exports.c32 = void 0;\nconst utils_1 = require(\"@noble/hashes/utils\");\nexports.c32 = '0123456789ABCDEFGHJKMNPQRSTVWXYZ';\nconst hex = '0123456789abcdef';\n/\n Encode a hex string as a c32 string. Note that the hex string is assumed\n * to be big-endian (and the resulting c32 string will be as well).\n * @param {string} inputHex - the input to encode\n * @param {number} minLength - the minimum length of the c32 string\n * @returns {string} the c32check-encoded representation of the data, as a string\n /\nfunction c32encode(inputHex, minLength) {\n // must be hex\n if (!inputHex.match(/^[0-9a-fA-F]$/)) {\n throw new Error('Not a hex-encoded string');\n }\n if (inputHex.length % 2 !== 0) {\n inputHex = `0${inputHex}`;\n }\n inputHex = inputHex.toLowerCase();\n let res = [];\n let carry = 0;\n for (let i = inputHex.length - 1; i >= 0; i--) {\n if (carry < 4) {\n const currentCode = hex.indexOf(inputHex[i]) >> carry;\n let nextCode = 0;\n if (i !== 0) {\n nextCode = hex.indexOf(inputHex[i - 1]);\n }\n // carry = 0, nextBits is 1, carry = 1, nextBits is 2\n const nextBits = 1 + carry;\n const nextLowBits = nextCode % (1 << nextBits) << (5 - nextBits);\n const curC32Digit = exports.c32[currentCode + nextLowBits];\n carry = nextBits;\n res.unshift(curC32Digit);\n }\n else {\n carry = 0;\n }\n }\n let C32leadingZeros = 0;\n for (let i = 0; i < res.length; i++) {\n if (res[i] !== '0') {\n break;\n }\n else {\n C32leadingZeros++;\n }\n }\n res = res.slice(C32leadingZeros);\n const zeroPrefix = new TextDecoder().decode((0, utils_1.hexToBytes)(inputHex)).match(/^\\u0000/);\n const numLeadingZeroBytesInHex = zeroPrefix ? zeroPrefix[0].length : 0;\n for (let i = 0; i < numLeadingZeroBytesInHex; i++) {\n res.unshift(exports.c32[0]);\n }\n if (minLength) {\n const count = minLength - res.length;\n for (let i = 0; i < count; i++) {\n res.unshift(exports.c32[0]);\n }\n }\n return res.join('');\n}\nexports.c32encode = c32encode;\n/\n * Normalize a c32 string\n * @param {string} c32input - the c32-encoded input string\n * @returns {string} the canonical representation of the c32 input string\n /\nfunction c32normalize(c32input) {\n // must be upper-case\n // replace all O's with 0's\n // replace all I's and L's with 1's\n return c32input.toUpperCase().replace(/O/g, '0').replace(/L\|I/g, '1');\n}\nexports.c32normalize = c32normalize;\n/\n * Decode a c32 string back into a hex string. Note that the c32 input\n * string is assumed to be big-endian (and the resulting hex string will\n * be as well).\n * @param {string} c32input - the c32-encoded input to decode\n * @param {number} minLength - the minimum length of the output hex string (in bytes)\n * @returns {string} the hex-encoded representation of the data, as a string\n /\nfunction c32decode(c32input, minLength) {\n c32input = c32normalize(c32input);\n // must result in a c32 string\n if (!c32input.match(`^[${exports.c32}]$`)) {\n throw new Error('Not a c32-encoded string');\n }\n const zeroPrefix = c32input.match(`^${exports.c32[0]}`);\n const numLeadingZeroBytes = zeroPrefix ? zeroPrefix[0].length : 0;\n let res = [];\n let carry = 0;\n let carryBits = 0;\n for (let i = c32input.length - 1; i >= 0; i--) {\n if (carryBits === 4) {\n res.unshift(hex[carry]);\n carryBits = 0;\n carry = 0;\n }\n const currentCode = exports.c32.indexOf(c32input[i]) << carryBits;\n const currentValue = currentCode + carry;\n const currentHexDigit = hex[currentValue % 16];\n carryBits += 1;\n carry = currentValue >> 4;\n if (carry > 1 << carryBits) {\n throw new Error('Panic error in decoding.');\n }\n res.unshift(currentHexDigit);\n }\n // one last carry\n res.unshift(hex[carry]);\n if (res.length % 2 === 1) {\n res.unshift('0');\n }\n let hexLeadingZeros = 0;\n for (let i = 0; i < res.length; i++) {\n if (res[i] !== '0') {\n break;\n }\n else {\n hexLeadingZeros++;\n }\n }\n res = res.slice(hexLeadingZeros - (hexLeadingZeros % 2));\n let hexStr = res.join('');\n for (let i = 0; i < numLeadingZeroBytes; i++) {\n hexStr = `00${hexStr}`;\n }\n if (minLength) {\n const count = minLength 2 - hexStr.length;\n for (let i = 0; i < count; i += 2) {\n hexStr = `00${hexStr}`;\n }\n }\n return hexStr;\n}\nexports.c32decode = c32decode;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.b58ToC32 = exports.c32ToB58 = exports.versions = exports.c32normalize = exports.c32addressDecode = exports.c32address = exports.c32checkDecode = exports.c32checkEncode = exports.c32decode = exports.c32encode = void 0;\nconst encoding_1 = require(\"./encoding\");\nObject.defineProperty(exports, \"c32encode\", { enumerable: true, get: function () { return encoding_1.c32encode; } });\nObject.defineProperty(exports, \"c32decode\", { enumerable: true, get: function () { return encoding_1.c32decode; } });\nObject.defineProperty(exports, \"c32normalize\", { enumerable: true, get: function () { return encoding_1.c32normalize; } });\nconst checksum_1 = require(\"./checksum\");\nObject.defineProperty(exports, \"c32checkEncode\", { enumerable: true, get: function () { return checksum_1.c32checkEncode; } });\nObject.defineProperty(exports, \"c32checkDecode\", { enumerable: true, get: function () { return checksum_1.c32checkDecode; } });\nconst address_1 = require(\"./address\");\nObject.defineProperty(exports, \"c32address\", { enumerable: true, get: function () { return address_1.c32address; } });\nObject.defineProperty(exports, \"c32addressDecode\", { enumerable: true, get: function () { return address_1.c32addressDecode; } });\nObject.defineProperty(exports, \"c32ToB58\", { enumerable: true, get: function () { return address_1.c32ToB58; } });\nObject.defineProperty(exports, \"b58ToC32\", { enumerable: true, get: function () { return address_1.b58ToC32; } });\nObject.defineProperty(exports, \"versions\", { enumerable: true, get: function () { return address_1.versions; } });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decode = exports.encode = exports.unescape = exports.escape = exports.pad = void 0;\nconst base64_js_1 = require(\"base64-js\");\nfunction pad(base64) {\n return `${base64}${'='.repeat(4 - (base64.length % 4 \|\| 4))}`;\n}\nexports.pad = pad;\nfunction escape(base64) {\n return base64.replace(/=/g, '').replace(/\\+/g, '-').replace(/\\//g, '_');\n}\nexports.escape = escape;\nfunction unescape(base64Url) {\n return pad(base64Url).replace(/-/g, '+').replace(/_/g, '/');\n}\nexports.unescape = unescape;\nfunction encode(base64) {\n return escape((0, base64_js_1.fromByteArray)(new TextEncoder().encode(base64)));\n}\nexports.encode = encode;\nfunction decode(base64Url) {\n return new TextDecoder().decode((0, base64_js_1.toByteArray)(pad(unescape(base64Url))));\n}\nexports.decode = decode;\n//# sourceMappingURL=base64Url.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.cryptoClients = exports.SECP256K1Client = void 0;\nconst secp256k1_1 = require(\"./secp256k1\");\nObject.defineProperty(exports, \"SECP256K1Client\", { enumerable: true, get: function () { return secp256k1_1.SECP256K1Client; } });\nconst cryptoClients = {\n ES256K: secp256k1_1.SECP256K1Client,\n};\nexports.cryptoClients = cryptoClients;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SECP256K1Client = void 0;\nconst hmac_1 = require(\"@noble/hashes/hmac\");\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst secp = require(\"@noble/secp256k1\");\nconst ecdsaSigFormatter_1 = require(\"../ecdsaSigFormatter\");\nconst errors_1 = require(\"../errors\");\nconst utils_1 = require(\"@noble/hashes/utils\");\n// required to use noble secp https://github.com/paulmillr/noble-secp256k1\nsecp.utils.hmacSha256Sync = (key, ...msgs) => {\n const h = hmac_1.hmac.create(sha256_1.sha256, key);\n msgs.forEach(msg => h.update(msg));\n return h.digest();\n};\nclass SECP256K1Client {\n static derivePublicKey(privateKey, compressed = true) {\n if (privateKey.length === 66) {\n privateKey = privateKey.slice(0, 64);\n }\n if (privateKey.length < 64) {\n // backward compatibly accept too short private keys\n privateKey = privateKey.padStart(64, '0');\n }\n return (0, utils_1.bytesToHex)(secp.getPublicKey(privateKey, compressed));\n }\n static signHash(signingInputHash, privateKey, format = 'jose') {\n // make sure the required parameters are provided\n if (!signingInputHash \|\| !privateKey) {\n throw new errors_1.MissingParametersError('a signing input hash and private key are all required');\n }\n const derSignature = secp.signSync(signingInputHash, privateKey.slice(0, 64), {\n der: true,\n canonical: false,\n });\n if (format === 'der')\n return (0, utils_1.bytesToHex)(derSignature);\n if (format === 'jose')\n return (0, ecdsaSigFormatter_1.derToJose)(derSignature, 'ES256');\n throw Error('Invalid signature format');\n }\n static loadSignature(joseSignature) {\n // create and return the DER-formatted signature bytes\n return (0, ecdsaSigFormatter_1.joseToDer)(joseSignature, 'ES256');\n }\n static verifyHash(signingInputHash, derSignatureBytes, publicKey) {\n // make sure the required parameters are provided\n if (!signingInputHash \|\| !derSignatureBytes \|\| !publicKey) {\n throw new errors_1.MissingParametersError('a signing input hash, der signature, and public key are all required');\n }\n return secp.verify(derSignatureBytes, signingInputHash, publicKey, { strict: false });\n }\n}\nexports.SECP256K1Client = SECP256K1Client;\nSECP256K1Client.algorithmName = 'ES256K';\n//# sourceMappingURL=secp256k1.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) \|\| function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P \|\| (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments \|\| [])).next());\n });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hashSha256Async = exports.hashSha256 = void 0;\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nfunction hashSha256(input) {\n return (0, sha256_1.sha256)(input);\n}\nexports.hashSha256 = hashSha256;\nfunction hashSha256Async(input) {\n return __awaiter(this, void 0, void 0, function* () {\n try {\n const isSubtleCryptoAvailable = typeof crypto !== 'undefined' && typeof crypto.subtle !== 'undefined';\n if (isSubtleCryptoAvailable) {\n // Use the W3C Web Crypto API if available (running in a web browser).\n const bytes = typeof input === 'string' ? new TextEncoder().encode(input) : input;\n const hash = yield crypto.subtle.digest('SHA-256', bytes);\n return new Uint8Array(hash);\n }\n else {\n // Otherwise try loading the Node.js `crypto` module (running in Node.js, or an older browser with a polyfill).\n const nodeCrypto = require('crypto');\n if (!nodeCrypto.createHash) {\n throw new Error('`crypto` module does not contain `createHash`');\n }\n return Promise.resolve(nodeCrypto.createHash('sha256').update(input).digest());\n }\n }\n catch (error) {\n console.log(error);\n console.log('Crypto lib not found. Neither the global `crypto.subtle` Web Crypto API, ' +\n 'nor the or the Node.js `require(\"crypto\").createHash` module is available. ' +\n 'Falling back to JS implementation.');\n return Promise.resolve(hashSha256(input));\n }\n });\n}\nexports.hashSha256Async = hashSha256Async;\n//# sourceMappingURL=sha256.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeToken = void 0;\nconst base64url = require(\"./base64Url\");\nfunction decodeToken(token) {\n if (typeof token === 'string') {\n // decompose the token into parts\n const tokenParts = token.split('.');\n const header = JSON.parse(base64url.decode(tokenParts[0]));\n const payload = JSON.parse(base64url.decode(tokenParts[1]));\n const signature = tokenParts[2];\n // return the token object\n return {\n header: header,\n payload: payload,\n signature: signature,\n };\n }\n else if (typeof token === 'object') {\n if (typeof token.payload !== 'string') {\n throw new Error('Expected token payload to be a base64 or json string');\n }\n let payload = token.payload;\n if (token.payload[0] !== '{') {\n payload = base64url.decode(payload);\n }\n const allHeaders = [];\n token.header.map((headerValue) => {\n const header = JSON.parse(base64url.decode(headerValue));\n allHeaders.push(header);\n });\n return {\n header: allHeaders,\n payload: JSON.parse(payload),\n signature: token.signature,\n };\n }\n}\nexports.decodeToken = decodeToken;\n//# sourceMappingURL=decode.js.map","\"use strict\";\n// NOTICE\n// Copyright 2015 D2L Corporation\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.joseToDer = exports.derToJose = void 0;\n// The following code is adapted from https://github.com/Brightspace/node-ecdsa-sig-formatter\nconst base64_js_1 = require(\"base64-js\");\nconst base64Url_1 = require(\"./base64Url\");\nfunction getParamSize(keySize) {\n return ((keySize / 8) \| 0) + (keySize % 8 === 0 ? 0 : 1);\n}\nconst paramBytesForAlg = {\n ES256: getParamSize(256),\n ES384: getParamSize(384),\n ES512: getParamSize(521),\n};\nfunction getParamBytesForAlg(alg) {\n const paramBytes = paramBytesForAlg[alg];\n if (paramBytes) {\n return paramBytes;\n }\n throw new Error(`Unknown algorithm \"${alg}\"`);\n}\nconst MAX_OCTET = 0x80;\nconst CLASS_UNIVERSAL = 0;\nconst PRIMITIVE_BIT = 0x20;\nconst TAG_SEQ = 0x10;\nconst TAG_INT = 0x02;\nconst ENCODED_TAG_SEQ = TAG_SEQ \| PRIMITIVE_BIT \| (CLASS_UNIVERSAL << 6);\nconst ENCODED_TAG_INT = TAG_INT \| (CLASS_UNIVERSAL << 6);\nfunction signatureAsBytes(signature) {\n if (signature instanceof Uint8Array) {\n return signature;\n }\n else if ('string' === typeof signature) {\n return (0, base64_js_1.toByteArray)((0, base64Url_1.pad)(signature));\n }\n throw new TypeError('ECDSA signature must be a Base64 string or a Uint8Array');\n}\nfunction derToJose(signature, alg) {\n const signatureBytes = signatureAsBytes(signature);\n const paramBytes = getParamBytesForAlg(alg);\n // the DER encoded param should at most be the param size, plus a padding\n // zero, since due to being a signed integer\n const maxEncodedParamLength = paramBytes + 1;\n const inputLength = signatureBytes.length;\n let offset = 0;\n if (signatureBytes[offset++] !== ENCODED_TAG_SEQ) {\n throw new Error('Could not find expected \"seq\"');\n }\n let seqLength = signatureBytes[offset++];\n if (seqLength === (MAX_OCTET \| 1)) {\n seqLength = signatureBytes[offset++];\n }\n if (inputLength - offset < seqLength) {\n throw new Error(`\"seq\" specified length of \"${seqLength}\", only \"${inputLength - offset}\" remaining`);\n }\n if (signatureBytes[offset++] !== ENCODED_TAG_INT) {\n throw new Error('Could not find expected \"int\" for \"r\"');\n }\n const rLength = signatureBytes[offset++];\n if (inputLength - offset - 2 < rLength) {\n throw new Error(`\"r\" specified length of \"${rLength}\", only \"${inputLength - offset - 2}\" available`);\n }\n if (maxEncodedParamLength < rLength) {\n throw new Error(`\"r\" specified length of \"${rLength}\", max of \"${maxEncodedParamLength}\" is acceptable`);\n }\n const rOffset = offset;\n offset += rLength;\n if (signatureBytes[offset++] !== ENCODED_TAG_INT) {\n throw new Error('Could not find expected \"int\" for \"s\"');\n }\n const sLength = signatureBytes[offset++];\n if (inputLength - offset !== sLength) {\n throw new Error(`\"s\" specified length of \"${sLength}\", expected \"${inputLength - offset}\"`);\n }\n if (maxEncodedParamLength < sLength) {\n throw new Error(`\"s\" specified length of \"${sLength}\", max of \"${maxEncodedParamLength}\" is acceptable`);\n }\n const sOffset = offset;\n offset += sLength;\n if (offset !== inputLength) {\n throw new Error(`Expected to consume entire array, but \"${inputLength - offset}\" bytes remain`);\n }\n const rPadding = paramBytes - rLength;\n const sPadding = paramBytes - sLength;\n const dst = new Uint8Array(rPadding + rLength + sPadding + sLength);\n for (offset = 0; offset < rPadding; ++offset) {\n dst[offset] = 0;\n }\n dst.set(signatureBytes.subarray(rOffset + Math.max(-rPadding, 0), rOffset + rLength), offset);\n offset = paramBytes;\n for (const o = offset; offset < o + sPadding; ++offset) {\n dst[offset] = 0;\n }\n dst.set(signatureBytes.subarray(sOffset + Math.max(-sPadding, 0), sOffset + sLength), offset);\n return (0, base64Url_1.escape)((0, base64_js_1.fromByteArray)(dst));\n}\nexports.derToJose = derToJose;\nfunction countPadding(buf, start, stop) {\n let padding = 0;\n while (start + padding < stop && buf[start + padding] === 0) {\n ++padding;\n }\n const needsSign = buf[start + padding] >= MAX_OCTET;\n if (needsSign) {\n --padding;\n }\n return padding;\n}\nfunction joseToDer(signature, alg) {\n signature = signatureAsBytes(signature);\n const paramBytes = getParamBytesForAlg(alg);\n const signatureBytes = signature.length;\n if (signatureBytes !== paramBytes * 2) {\n throw new TypeError(`\"${alg}\" signatures must be \"${paramBytes * 2}\" bytes, saw \"${signatureBytes}\"`);\n }\n const rPadding = countPadding(signature, 0, paramBytes);\n const sPadding = countPadding(signature, paramBytes, signature.length);\n const rLength = paramBytes - rPadding;\n const sLength = paramBytes - sPadding;\n const rsBytes = 1 + 1 + rLength + 1 + 1 + sLength;\n const shortLength = rsBytes < MAX_OCTET;\n const dst = new Uint8Array((shortLength ? 2 : 3) + rsBytes);\n let offset = 0;\n dst[offset++] = ENCODED_TAG_SEQ;\n if (shortLength) {\n // Bit 8 has value \"0\"\n // bits 7-1 give the length.\n dst[offset++] = rsBytes;\n }\n else {\n // Bit 8 of first octet has value \"1\"\n // bits 7-1 give the number of additional length octets.\n dst[offset++] = MAX_OCTET \| 1;\n // length, base 256\n dst[offset++] = rsBytes & 0xff;\n }\n dst[offset++] = ENCODED_TAG_INT;\n dst[offset++] = rLength;\n if (rPadding < 0) {\n dst[offset++] = 0;\n dst.set(signature.subarray(0, paramBytes), offset);\n offset += paramBytes;\n }\n else {\n dst.set(signature.subarray(rPadding, paramBytes), offset);\n offset += paramBytes - rPadding;\n }\n dst[offset++] = ENCODED_TAG_INT;\n dst[offset++] = sLength;\n if (sPadding < 0) {\n dst[offset++] = 0;\n dst.set(signature.subarray(paramBytes), offset);\n }\n else {\n dst.set(signature.subarray(paramBytes + sPadding), offset);\n }\n return dst;\n}\nexports.joseToDer = joseToDer;\n//# sourceMappingURL=ecdsaSigFormatter.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InvalidTokenError = exports.MissingParametersError = void 0;\nclass MissingParametersError extends Error {\n constructor(message) {\n super();\n this.name = 'MissingParametersError';\n this.message = message \|\| '';\n }\n}\nexports.MissingParametersError = MissingParametersError;\nclass InvalidTokenError extends Error {\n constructor(message) {\n super();\n this.name = 'InvalidTokenError';\n this.message = message \|\| '';\n }\n}\nexports.InvalidTokenError = InvalidTokenError;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) \|\| (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc \|\| (\"get\" in desc ? !m.__esModule : desc.writable \|\| desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) \|\| function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./signer\"), exports);\n__exportStar(require(\"./verifier\"), exports);\n__exportStar(require(\"./decode\"), exports);\n__exportStar(require(\"./errors\"), exports);\n__exportStar(require(\"./cryptoClients\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) \|\| function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P \|\| (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments \|\| [])).next());\n });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenSigner = exports.createUnsecuredToken = void 0;\nconst base64url = require(\"./base64Url\");\nconst cryptoClients_1 = require(\"./cryptoClients\");\nconst errors_1 = require(\"./errors\");\nconst sha256_1 = require(\"./cryptoClients/sha256\");\nfunction createSigningInput(payload, header) {\n const tokenParts = [];\n // add in the header\n const encodedHeader = base64url.encode(JSON.stringify(header));\n tokenParts.push(encodedHeader);\n // add in the payload\n const encodedPayload = base64url.encode(JSON.stringify(payload));\n tokenParts.push(encodedPayload);\n // prepare the message\n const signingInput = tokenParts.join('.');\n // return the signing input\n return signingInput;\n}\nfunction createUnsecuredToken(payload) {\n const header = { typ: 'JWT', alg: 'none' };\n return createSigningInput(payload, header) + '.';\n}\nexports.createUnsecuredToken = createUnsecuredToken;\nclass TokenSigner {\n constructor(signingAlgorithm, rawPrivateKey) {\n if (!(signingAlgorithm && rawPrivateKey)) {\n throw new errors_1.MissingParametersError('a signing algorithm and private key are required');\n }\n if (typeof signingAlgorithm !== 'string') {\n throw new Error('signing algorithm parameter must be a string');\n }\n signingAlgorithm = signingAlgorithm.toUpperCase();\n if (!cryptoClients_1.cryptoClients.hasOwnProperty(signingAlgorithm)) {\n throw new Error('invalid signing algorithm');\n }\n this.tokenType = 'JWT';\n this.cryptoClient = cryptoClients_1.cryptoClients[signingAlgorithm];\n this.rawPrivateKey = rawPrivateKey;\n }\n header(header = {}) {\n const defaultHeader = { typ: this.tokenType, alg: this.cryptoClient.algorithmName };\n return Object.assign({}, defaultHeader, header);\n }\n sign(payload, expanded = false, customHeader = {}) {\n // generate the token header\n const header = this.header(customHeader);\n // prepare the message to be signed\n const signingInput = createSigningInput(payload, header);\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return this.createWithSignedHash(payload, expanded, header, signingInput, signingInputHash);\n }\n signAsync(payload, expanded = false, customHeader = {}) {\n return __awaiter(this, void 0, void 0, function* () {\n // generate the token header\n const header = this.header(customHeader);\n // prepare the message to be signed\n const signingInput = createSigningInput(payload, header);\n const signingInputHash = yield (0, sha256_1.hashSha256Async)(signingInput);\n return this.createWithSignedHash(payload, expanded, header, signingInput, signingInputHash);\n });\n }\n createWithSignedHash(payload, expanded, header, signingInput, signingInputHash) {\n // sign the message and add in the signature\n const signature = this.cryptoClient.signHash(signingInputHash, this.rawPrivateKey);\n if (expanded) {\n const signedToken = {\n header: [base64url.encode(JSON.stringify(header))],\n payload: JSON.stringify(payload),\n signature: [signature],\n };\n return signedToken;\n }\n else {\n return [signingInput, signature].join('.');\n }\n }\n}\nexports.TokenSigner = TokenSigner;\n//# sourceMappingURL=signer.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenVerifier = void 0;\nconst base64url = require(\"./base64Url\");\nconst cryptoClients_1 = require(\"./cryptoClients\");\nconst errors_1 = require(\"./errors\");\nconst sha256_1 = require(\"./cryptoClients/sha256\");\nclass TokenVerifier {\n constructor(signingAlgorithm, rawPublicKey) {\n if (!(signingAlgorithm && rawPublicKey)) {\n throw new errors_1.MissingParametersError('a signing algorithm and public key are required');\n }\n if (typeof signingAlgorithm !== 'string') {\n throw 'signing algorithm parameter must be a string';\n }\n signingAlgorithm = signingAlgorithm.toUpperCase();\n if (!cryptoClients_1.cryptoClients.hasOwnProperty(signingAlgorithm)) {\n throw 'invalid signing algorithm';\n }\n this.tokenType = 'JWT';\n this.cryptoClient = cryptoClients_1.cryptoClients[signingAlgorithm];\n this.rawPublicKey = rawPublicKey;\n }\n verify(token) {\n if (typeof token === 'string') {\n return this.verifyCompact(token, false);\n }\n else if (typeof token === 'object') {\n return this.verifyExpanded(token, false);\n }\n else {\n return false;\n }\n }\n verifyAsync(token) {\n if (typeof token === 'string') {\n return this.verifyCompact(token, true);\n }\n else if (typeof token === 'object') {\n return this.verifyExpanded(token, true);\n }\n else {\n return Promise.resolve(false);\n }\n }\n verifyCompact(token, async) {\n // decompose the token into parts\n const tokenParts = token.split('.');\n // calculate the signing input hash\n const signingInput = tokenParts[0] + '.' + tokenParts[1];\n const performVerify = (signingInputHash) => {\n // extract the signature as a DER array\n const derSignatureBytes = this.cryptoClient.loadSignature(tokenParts[2]);\n // verify the signed hash\n return this.cryptoClient.verifyHash(signingInputHash, derSignatureBytes, this.rawPublicKey);\n };\n if (async) {\n return (0, sha256_1.hashSha256Async)(signingInput).then(signingInputHash => performVerify(signingInputHash));\n }\n else {\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return performVerify(signingInputHash);\n }\n }\n verifyExpanded(token, async) {\n const signingInput = [token['header'].join('.'), base64url.encode(token['payload'])].join('.');\n let verified = true;\n const performVerify = (signingInputHash) => {\n token['signature'].map((signature) => {\n const derSignatureBytes = this.cryptoClient.loadSignature(signature);\n const signatureVerified = this.cryptoClient.verifyHash(signingInputHash, derSignatureBytes, this.rawPublicKey);\n if (!signatureVerified) {\n verified = false;\n }\n });\n return verified;\n };\n if (async) {\n return (0, sha256_1.hashSha256Async)(signingInput).then(signingInputHash => performVerify(signingInputHash));\n }\n else {\n const signingInputHash = (0, sha256_1.hashSha256)(signingInput);\n return performVerify(signingInputHash);\n }\n }\n}\nexports.TokenVerifier = TokenVerifier;\n//# sourceMappingURL=verifier.js.map","/*\n lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n /\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/\n Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n /\nvar reRegExpChar = /[\\\\^$.+?()[\\]{}\|]/g;\n\n/** Used to match `RegExp` flags from their coerced string values. /\nvar reFlags = /\\w$/;\n\n/** Used to detect host constructors (Safari). /\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/** Used to identify `toStringTag` values supported by `_.clone`. /\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/\n Adds the key-value `pair` to `map`.\n \n @private\n * @param {Object} map The map to modify.\n * @param {Array} pair The key-value pair to add.\n * @returns {Object} Returns `map`.\n /\nfunction addMapEntry(map, pair) {\n // Don't return `map.set` because it's not chainable in IE 11.\n map.set(pair[0], pair[1]);\n return map;\n}\n\n/\n Adds `value` to `set`.\n \n @private\n * @param {Object} set The set to modify.\n * @param {} value The value to add.\n @returns {Object} Returns `set`.\n /\nfunction addSetEntry(set, value) {\n // Don't return `set.add` because it's not chainable in IE 11.\n set.add(value);\n return set;\n}\n\n/\n A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array ? array.length : 0;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\n/\n Appends the elements of `values` to `array`.\n \n @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n /\nfunction arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n}\n\n/\n A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {} Returns the accumulated value.\n /\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array ? array.length : 0;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n}\n\n/*\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/\n Gets the value at `key` of `object`.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {} Returns the property value.\n /\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\n/*\n Checks if `value` is a host object in IE < 9.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n /\nfunction isHostObject(value) {\n // Many host objects are `Object` objects that can coerce to strings\n // despite having improperly defined `toString` methods.\n var result = false;\n if (value != null && typeof value.toString != 'function') {\n try {\n result = !!(value + '');\n } catch (e) {}\n }\n return result;\n}\n\n/\n Converts `map` to its key-value pairs.\n \n @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n /\nfunction mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n}\n\n/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/\n Converts `set` to an array of its values.\n \n @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n /\nfunction setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n}\n\n/* Used for built-in method references. /\nvar arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/* Used to detect overreaching core-js shims. /\nvar coreJsData = root['__core-js_shared__'];\n\n/* Used to detect methods masquerading as native. /\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO \|\| '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar objectToString = objectProto.toString;\n\n/* Used to detect if a method is native. /\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty\|(function).?(?=\\\\\\()\| for .+?(?=\\\\\\])/g, '$1.?') + '$'\n);\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined,\n Symbol = root.Symbol,\n Uint8Array = root.Uint8Array,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeKeys = overArg(Object.keys, Object);\n\n/ Built-in method references that are verified to be native. /\nvar DataView = getNative(root, 'DataView'),\n Map = getNative(root, 'Map'),\n Promise = getNative(root, 'Promise'),\n Set = getNative(root, 'Set'),\n WeakMap = getNative(root, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n/* Used to detect maps, sets, and weakmaps. /\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/\n Creates a hash object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Hash(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the hash.\n \n @private\n * @name clear\n * @memberOf Hash\n /\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/\n Removes `key` and its value from the hash.\n \n @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction hashDelete(key) {\n return this.has(key) && delete this.__data__[key];\n}\n\n/\n Gets the hash value for `key`.\n \n @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/*\n Checks if a hash value for `key` exists.\n \n @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/\n Sets the hash `key` to `value`.\n \n @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the hash instance.\n /\nfunction hashSet(key, value) {\n var data = this.__data__;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/\n Creates an list cache object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction ListCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the list cache.\n \n @private\n * @name clear\n * @memberOf ListCache\n /\nfunction listCacheClear() {\n this.__data__ = [];\n}\n\n/\n Removes `key` and its value from the list cache.\n \n @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n return true;\n}\n\n/\n Gets the list cache value for `key`.\n \n @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\n/*\n Checks if a list cache value for `key` exists.\n \n @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\n/\n Sets the list cache `key` to `value`.\n \n @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the list cache instance.\n /\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/\n Creates a map cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction MapCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/\n Removes all key-value entries from the map.\n \n @private\n * @name clear\n * @memberOf MapCache\n /\nfunction mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map \|\| ListCache),\n 'string': new Hash\n };\n}\n\n/\n Removes `key` and its value from the map.\n \n @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction mapCacheDelete(key) {\n return getMapData(this, key)['delete'](key);\n}\n\n/\n Gets the map value for `key`.\n \n @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\n/*\n Checks if a map value for `key` exists.\n \n @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\n/\n Sets the map `key` to `value`.\n \n @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the map cache instance.\n /\nfunction mapCacheSet(key, value) {\n getMapData(this, key).set(key, value);\n return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/\n Creates a stack cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Stack(entries) {\n this.__data__ = new ListCache(entries);\n}\n\n/\n Removes all key-value entries from the stack.\n \n @private\n * @name clear\n * @memberOf Stack\n /\nfunction stackClear() {\n this.__data__ = new ListCache;\n}\n\n/\n Removes `key` and its value from the stack.\n \n @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction stackDelete(key) {\n return this.__data__['delete'](key);\n}\n\n/\n Gets the stack value for `key`.\n \n @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\n/*\n Checks if a stack value for `key` exists.\n \n @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction stackHas(key) {\n return this.__data__.has(key);\n}\n\n/\n Sets the stack `key` to `value`.\n \n @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the stack cache instance.\n /\nfunction stackSet(key, value) {\n var cache = this.__data__;\n if (cache instanceof ListCache) {\n var pairs = cache.__data__;\n if (!Map \|\| (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n return this;\n }\n cache = this.__data__ = new MapCache(pairs);\n }\n cache.set(key, value);\n return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/\n Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n // Safari 9 makes `arguments.length` enumerable in strict mode.\n var result = (isArray(value) \|\| isArguments(value))\n ? baseTimes(value.length, String)\n : [];\n\n var length = result.length,\n skipIndexes = !!length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (key == 'length' \|\| isIndex(key, length)))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n \n @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {} value The value to assign.\n /\nfunction assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) \|\|\n (value === undefined && !(key in object))) {\n object[key] = value;\n }\n}\n\n/*\n Gets the index at which the `key` is found in `array` of key-value pairs.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} key The key to search for.\n @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n}\n\n/\n The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n \n @private\n * @param {} value The value to clone.\n @param {boolean} [isDeep] Specify a deep clone.\n * @param {boolean} [isFull] Specify a clone including symbols.\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {} Returns the cloned value.\n /\nfunction baseClone(value, isDeep, isFull, customizer, key, object, stack) {\n var result;\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag \|\| tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag \|\| tag == argsTag \|\| (isFunc && !object)) {\n if (isHostObject(value)) {\n return object ? value : {};\n }\n result = initCloneObject(isFunc ? {} : value);\n if (!isDeep) {\n return copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, baseClone, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack \|\| (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (!isArr) {\n var props = isFull ? getAllKeys(value) : keys(value);\n }\n arrayEach(props \|\| value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));\n });\n return result;\n}\n\n/*\n The base implementation of `_.create` without support for assigning\n * properties to the created object.\n \n @private\n * @param {Object} prototype The object to inherit from.\n * @returns {Object} Returns the new object.\n /\nfunction baseCreate(proto) {\n return isObject(proto) ? objectCreate(proto) : {};\n}\n\n/\n The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\n/\n The base implementation of `getTag`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n return objectToString.call(value);\n}\n\n/\n The base implementation of `_.isNative` without bad shim checks.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n /\nfunction baseIsNative(value) {\n if (!isObject(value) \|\| isMasked(value)) {\n return false;\n }\n var pattern = (isFunction(value) \|\| isHostObject(value)) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\n/\n The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Creates a clone of `buffer`.\n \n @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n /\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var result = new buffer.constructor(buffer.length);\n buffer.copy(result);\n return result;\n}\n\n/\n Creates a clone of `arrayBuffer`.\n \n @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n /\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\n/\n Creates a clone of `dataView`.\n \n @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n /\nfunction cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\n/\n Creates a clone of `map`.\n \n @private\n * @param {Object} map The map to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned map.\n /\nfunction cloneMap(map, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);\n return arrayReduce(array, addMapEntry, new map.constructor);\n}\n\n/\n Creates a clone of `regexp`.\n \n @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n /\nfunction cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n}\n\n/\n Creates a clone of `set`.\n \n @private\n * @param {Object} set The set to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned set.\n /\nfunction cloneSet(set, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);\n return arrayReduce(array, addSetEntry, new set.constructor);\n}\n\n/\n Creates a clone of the `symbol` object.\n \n @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n /\nfunction cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\n/\n Creates a clone of `typedArray`.\n \n @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n /\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/\n Copies the values of `source` to `array`.\n \n @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n /\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array \|\| (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\n/\n Copies properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n /\nfunction copyObject(source, props, object, customizer) {\n object \|\| (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n assignValue(object, key, newValue === undefined ? source[key] : newValue);\n }\n return object;\n}\n\n/\n Copies own symbol properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n}\n\n/\n Creates an array of own enumerable property names and symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\n/\n Gets the data for `map`.\n \n @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {} Returns the map data.\n /\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\n/*\n Gets the native function at `key` of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {} Returns the function if it's native, else `undefined`.\n /\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\n/*\n Creates an array of the own enumerable symbol properties of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray;\n\n/\n Gets the `toStringTag` of `value`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11,\n// for data views in Edge < 14, and promises in Node.js.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) \|\|\n (Map && getTag(new Map) != mapTag) \|\|\n (Promise && getTag(Promise.resolve()) != promiseTag) \|\|\n (Set && getTag(new Set) != setTag) \|\|\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = objectToString.call(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : undefined;\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n}\n\n/\n Initializes an array clone.\n \n @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n /\nfunction initCloneArray(array) {\n var length = array.length,\n result = array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n}\n\n/\n Initializes an object clone.\n \n @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\n/\n Initializes an object clone based on its `toStringTag`.\n \n Note: This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n \n @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneByTag(object, tag, cloneFunc, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return cloneMap(object, isDeep, cloneFunc);\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return cloneSet(object, isDeep, cloneFunc);\n\n case symbolTag:\n return cloneSymbol(object);\n }\n}\n\n/\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n length = length == null ? MAX_SAFE_INTEGER : length;\n return !!length &&\n (typeof value == 'number' \|\| reIsUint.test(value)) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/\n Checks if `value` is suitable for use as unique object key.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n /\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' \|\| type == 'number' \|\| type == 'symbol' \|\| type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\n/\n Checks if `func` has its source masked.\n \n @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n /\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto;\n\n return value === proto;\n}\n\n/\n Converts `func` to its source code.\n \n @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n /\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\n/\n This method is like `_.clone` except that it recursively clones `value`.\n \n @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {} value The value to recursively clone.\n @returns {} Returns the deep cloned value.\n @see _.clone\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n /\nfunction cloneDeep(value) {\n return baseClone(value, true, true);\n}\n\n/\n Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n \n var object = { 'a': 1 };\n * var other = { 'a': 1 };\n \n _.eq(object, object);\n * // => true\n \n _.eq(object, other);\n * // => false\n \n _.eq('a', 'a');\n * // => true\n \n _.eq('a', Object('a'));\n * // => false\n \n _.eq(NaN, NaN);\n * // => true\n /\nfunction eq(value, other) {\n return value === other \|\| (value !== value && other !== other);\n}\n\n/\n Checks if `value` is likely an `arguments` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nfunction isArguments(value) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n (!propertyIsEnumerable.call(value, 'callee') \|\| objectToString.call(value) == argsTag);\n}\n\n/\n Checks if `value` is classified as an `Array` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/\n This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n \n _.isArrayLikeObject([1, 2, 3]);\n * // => true\n \n _.isArrayLikeObject(document.body.children);\n * // => true\n \n _.isArrayLikeObject('abc');\n * // => false\n \n _.isArrayLikeObject(_.noop);\n * // => false\n /\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\n/\n Checks if `value` is classified as a `Function` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 8-9 which returns 'object' for typed array and other constructors.\n var tag = isObject(value) ? objectToString.call(value) : '';\n return tag == funcTag \|\| tag == genTag;\n}\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return !!value && (type == 'object' \|\| type == 'function');\n}\n\n/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/\n This method returns a new empty array.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n \n var arrays = _.times(2, _.stubArray);\n \n console.log(arrays);\n * // => [[], []]\n \n console.log(arrays[0] === arrays[1]);\n * // => false\n /\nfunction stubArray() {\n return [];\n}\n\n/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = cloneDeep;\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout \|\| !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout \|\| !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining \|\| !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","module.exports = require('./lib/schema-inspector');\n","// Disable no-var because we need to support old IE for now.\n/ eslint-disable no-var /\n// Disable space-before-function-paren for compatibility with VS Code default JS formatter.\n/ eslint-disable space-before-function-paren /\n\n/\n * This module is intended to be executed both on client side and server side.\n * No error should be thrown. (soft error handling)\n /\n\n(function () {\n var root = {};\n // Dependencies --------------------------------------------------------------\n root.async = (typeof require === 'function') ? require('async') : window.async;\n if (typeof root.async !== 'object') {\n throw new Error('Module async is required (https://github.com/caolan/async)');\n }\n var async = root.async;\n\n function _extend(origin, add) {\n if (!add \|\| typeof add !== 'object') {\n return origin;\n }\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n }\n\n function _merge() {\n var ret = {};\n var args = Array.prototype.slice.call(arguments);\n var keys = null;\n var i = null;\n\n args.forEach(function (arg) {\n if (arg && arg.constructor === Object) {\n keys = Object.keys(arg);\n i = keys.length;\n while (i--) {\n ret[keys[i]] = arg[keys[i]];\n }\n }\n });\n return ret;\n }\n\n // Customisable class (Base class) -------------------------------------------\n // Use with operation \"new\" to extend Validation and Sanitization themselves,\n // not their prototype. In other words, constructor shall be call to extend\n // those functions, instead of being in their constructor, like this:\n // _extend(Validation, new Customisable);\n\n function Customisable() {\n this.custom = {};\n\n this.extend = function (custom) {\n return _extend(this.custom, custom);\n };\n\n this.reset = function () {\n this.custom = {};\n };\n\n this.remove = function (fields) {\n if (!_typeIs.array(fields)) {\n fields = [fields];\n }\n fields.forEach(function (field) {\n delete this.custom[field];\n }, this);\n };\n }\n\n // Inspection class (Base class) ---------------------------------------------\n // Use to extend Validation and Sanitization prototypes. Inspection\n // constructor shall be called in derived class constructor.\n\n function Inspection(schema, custom) {\n var _stack = ['@'];\n\n this._schema = schema;\n this._custom = {};\n if (custom != null) {\n for (var key in custom) {\n if (Object.prototype.hasOwnProperty.call(custom, key)) {\n this._custom['$' + key] = custom[key];\n }\n }\n }\n\n this._getDepth = function () {\n return _stack.length;\n };\n\n this._dumpStack = function () {\n / eslint-disable no-control-regex /\n return _stack.map(function (i) { return i.replace(/^\\[/g, '\\u001b\\u001c\\u001d\\u001e'); })\n .join('.').replace(/\\.\\u001b\\u001c\\u001d\\u001e/g, '[');\n / eslint-enable no-control-regex /\n };\n\n this._deeperObject = function (name) {\n _stack.push((/^[a-z$_][a-z0-9$_]$/i).test(name) ? name : '[\"' + name + '\"]');\n return this;\n };\n\n this._deeperArray = function (i) {\n _stack.push('[' + i + ']');\n return this;\n };\n\n this._back = function () {\n _stack.pop();\n return this;\n };\n }\n // Simple types --------------------------------------------------------------\n // If the property is not defined or is not in this list:\n var _typeIs = {\n function: function (element) {\n return typeof element === 'function';\n },\n string: function (element) {\n return typeof element === 'string';\n },\n number: function (element) {\n return typeof element === 'number' && !isNaN(element);\n },\n integer: function (element) {\n return typeof element === 'number' && element % 1 === 0;\n },\n NaN: function (element) {\n return typeof element === 'number' && isNaN(element);\n },\n boolean: function (element) {\n return typeof element === 'boolean';\n },\n null: function (element) {\n return element === null;\n },\n date: function (element) {\n return element != null && element instanceof Date;\n },\n object: function (element) {\n return typeof element === 'object' && element != null && element.constructor !== Array;\n },\n array: function (element) {\n return element != null && element.constructor === Array;\n },\n any: function () {\n return true;\n }\n };\n\n function _simpleType(type, candidate) {\n if (typeof type === 'function') {\n return candidate instanceof type;\n }\n type = type in _typeIs ? type : 'any';\n return _typeIs[type](candidate);\n }\n\n function _realType(candidate) {\n for (var i in _typeIs) {\n if (_simpleType(i, candidate)) {\n if (i !== 'any' && (i !== 'object' \|\| candidate.constructor === Object)) { return i; }\n return 'an instance of ' + candidate.constructor.name;\n }\n }\n }\n\n function getIndexes(a, value) {\n var indexes = [];\n var i = a.indexOf(value);\n\n while (i !== -1) {\n indexes.push(i);\n i = a.indexOf(value, i + 1);\n }\n return indexes;\n }\n\n // Available formats ---------------------------------------------------------\n /* eslint-disable no-useless-escape /\n // TODO: Study these regex expressions and add more tests so we can consider removing\n // rule no-useless-escape.\n var _formats = {\n void: /^$/,\n url: /^(https?\|ftp):\\/\\/(((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:)@)?(((\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5])\\.(\\d\|[1-9]\\d\|1\\d\\d\|2[0-4]\\d\|25[0-5]))\|((([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.)?(([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.?)(:\\d)?)(\\/((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)+(\\/(([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)))?)?(\\?((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)\|[\\uE000-\\uF8FF]\|\\/\|\\?))?(\\#((([a-z]\|\\d\|-\|\\.\|_\|~\|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])\|(%[\\da-f]{2})\|[!\\$&'\$\$\\\\+,;=]\|:\|@)\|\\/\|\\?))?$/i,\n 'date-time': /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d{3})?(Z?\|(-\|\\+)\\d{2}:\\d{2})$/,\n date: /^\\d{4}-\\d{2}-\\d{2}$/,\n coolDateTime: /^\\d{4}(-\|\\/)\\d{2}(-\|\\/)\\d{2}(T\| )\\d{2}:\\d{2}:\\d{2}(\\.\\d{3})?Z?$/,\n time: /^\\d{2}\\:\\d{2}\\:\\d{2}$/,\n color: /^#([0-9a-f])+$/i,\n // 2021-03-13 - Email regex was replaced with result of running email-safe-regex\n // latest version as of that day in order so fix GHSL-2020-35.\n // const emailRegexSafe = require('email-regex-safe');\n // const regexString = emailRegexSafe({\n // exact: true,\n // returnString: true,\n // });\n // <using debugger to inspect state of regexString after previous statement>\n //\n // Note that this regex is pretty flexible, but it's a bit stricter than\n // what we had before. It requires the local part of the email address to\n // be at least two characters. Was able to find some justification for\n // this at https://stackoverflow.com/a/15783334/5051165. Test suite\n // was corrected accordingly.\n /* eslint-disable prefer-regex-literals /\n / eslint-disable quotes /\n email: new RegExp(`(?:[^\\\\W_](?:[\\\\w\\\\.\\\\+]+)@(?:localhost\|(?:25[0-5]\|2[0-4]\\\\d\|1\\\\d\\\\d\|[1-9]\\\\d\|\\\\d)(?:\\\\.(?:25[0-5]\|2[0-4]\\\\d\|1\\\\d\\\\d\|[1-9]\\\\d\|\\\\d)){3}\|(?:(?:[a-z\\\\u00a1-\\\\uffff0-9][-_])[a-z\\\\u00a1-\\\\uffff0-9]+)(?:\\\\.(?:[a-z\\\\u00a1-\\\\uffff0-9]-)[a-z\\\\u00a1-\\\\uffff0-9]+)(?:\\\\.(?:northwesternmutual\|travelersinsurance\|vermögensberatung\|vermögensberater\|americanexpress\|kerryproperties\|sandvikcoromant\|afamilycompany\|americanfamily\|bananarepublic\|cancerresearch\|cookingchannel\|kerrylogistics\|weatherchannel\|international\|lifeinsurance\|spreadbetting\|travelchannel\|wolterskluwer\|construction\|lplfinancial\|scholarships\|versicherung\|accountants\|barclaycard\|blackfriday\|blockbuster\|bridgestone\|calvinklein\|contractors\|creditunion\|engineering\|enterprises\|foodnetwork\|investments\|kerryhotels\|lamborghini\|motorcycles\|olayangroup\|photography\|playstation\|productions\|progressive\|redumbrella\|williamhill\|சிங்கப்பூர்\|accountant\|apartments\|associates\|basketball\|bnpparibas\|boehringer\|capitalone\|consulting\|creditcard\|cuisinella\|eurovision\|extraspace\|foundation\|healthcare\|immobilien\|industries\|management\|mitsubishi\|nationwide\|nextdirect\|onyourside\|properties\|protection\|prudential\|realestate\|republican\|restaurant\|schaeffler\|swiftcover\|tatamotors\|technology\|university\|vlaanderen\|volkswagen\|accenture\|alfaromeo\|allfinanz\|amsterdam\|analytics\|aquarelle\|barcelona\|bloomberg\|christmas\|community\|directory\|education\|equipment\|fairwinds\|financial\|firestone\|fresenius\|frontdoor\|fujixerox\|furniture\|goldpoint\|hisamitsu\|homedepot\|homegoods\|homesense\|institute\|insurance\|kuokgroup\|lancaster\|landrover\|lifestyle\|marketing\|marshalls\|melbourne\|microsoft\|panasonic\|passagens\|pramerica\|richardli\|scjohnson\|shangrila\|solutions\|statebank\|statefarm\|stockholm\|travelers\|vacations\|موريتانيا\|yodobashi\|abudhabi\|airforce\|allstate\|attorney\|barclays\|barefoot\|bargains\|baseball\|boutique\|bradesco\|broadway\|brussels\|budapest\|builders\|business\|capetown\|catering\|catholic\|cipriani\|cityeats\|cleaning\|clinique\|clothing\|commbank\|computer\|delivery\|deloitte\|democrat\|diamonds\|discount\|discover\|download\|engineer\|ericsson\|etisalat\|exchange\|feedback\|fidelity\|firmdale\|football\|frontier\|goodyear\|grainger\|graphics\|guardian\|hdfcbank\|helsinki\|holdings\|hospital\|infiniti\|ipiranga\|istanbul\|jpmorgan\|lighting\|lundbeck\|marriott\|maserati\|mckinsey\|memorial\|merckmsd\|mortgage\|observer\|partners\|pharmacy\|pictures\|plumbing\|property\|redstone\|reliance\|saarland\|samsclub\|security\|services\|shopping\|showtime\|softbank\|software\|stcgroup\|supplies\|training\|vanguard\|ventures\|verisign\|woodside\|السعودية\|yokohama\|abogado\|academy\|agakhan\|alibaba\|android\|athleta\|auction\|audible\|auspost\|avianca\|banamex\|bauhaus\|bentley\|bestbuy\|booking\|brother\|bugatti\|capital\|caravan\|careers\|channel\|charity\|chintai\|citadel\|clubmed\|college\|cologne\|comcast\|company\|compare\|contact\|cooking\|corsica\|country\|coupons\|courses\|cricket\|cruises\|dentist\|digital\|domains\|exposed\|express\|farmers\|fashion\|ferrari\|ferrero\|finance\|fishing\|fitness\|flights\|florist\|flowers\|forsale\|frogans\|fujitsu\|gallery\|genting\|godaddy\|grocery\|guitars\|hamburg\|hangout\|hitachi\|holiday\|hosting\|hoteles\|hotmail\|hyundai\|ismaili\|jewelry\|juniper\|kitchen\|komatsu\|lacaixa\|lanxess\|lasalle\|latrobe\|leclerc\|limited\|lincoln\|markets\|monster\|netbank\|netflix\|network\|neustar\|okinawa\|oldnavy\|organic\|origins\|philips\|pioneer\|politie\|realtor\|recipes\|rentals\|reviews\|rexroth\|samsung\|sandvik\|schmidt\|schwarz\|science\|shiksha\|singles\|staples\|storage\|support\|surgery\|systems\|temasek\|theater\|theatre\|tickets\|tiffany\|toshiba\|trading\|walmart\|wanggou\|watches\|weather\|website\|wedding\|whoswho\|windows\|winners\|xfinity\|католик\|الجزائر\|العليان\|اتصالات\|پاکستان\|البحرين\|كاثوليك\|இந்தியா\|yamaxun\|youtube\|zuerich\|abarth\|abbott\|abbvie\|africa\|agency\|airbus\|airtel\|alipay\|alsace\|alstom\|amazon\|anquan\|aramco\|author\|bayern\|beauty\|berlin\|bharti\|bostik\|boston\|broker\|camera\|career\|casino\|center\|chanel\|chrome\|church\|circle\|claims\|clinic\|coffee\|comsec\|condos\|coupon\|credit\|cruise\|dating\|datsun\|dealer\|degree\|dental\|design\|direct\|doctor\|dunlop\|dupont\|durban\|emerck\|energy\|estate\|events\|expert\|family\|flickr\|futbol\|gallup\|garden\|george\|giving\|global\|google\|gratis\|health\|hermes\|hiphop\|hockey\|hotels\|hughes\|imamat\|insure\|intuit\|jaguar\|joburg\|juegos\|kaufen\|kinder\|kindle\|kosher\|lancia\|latino\|lawyer\|lefrak\|living\|locker\|london\|luxury\|madrid\|maison\|makeup\|market\|mattel\|mobile\|monash\|mormon\|moscow\|museum\|mutual\|nagoya\|natura\|nissan\|nissay\|norton\|nowruz\|office\|olayan\|online\|oracle\|orange\|otsuka\|pfizer\|photos\|physio\|pictet\|quebec\|racing\|realty\|reisen\|repair\|report\|review\|rocher\|rogers\|ryukyu\|safety\|sakura\|sanofi\|school\|schule\|search\|secure\|select\|shouji\|soccer\|social\|stream\|studio\|supply\|suzuki\|swatch\|sydney\|taipei\|taobao\|target\|tattoo\|tennis\|tienda\|tjmaxx\|tkmaxx\|toyota\|travel\|unicom\|viajes\|viking\|villas\|virgin\|vision\|voting\|voyage\|vuelos\|walter\|webcam\|xihuan\|москва\|онлайн\|ファッション\|भारतम्\|ارامكو\|امارات\|الاردن\|المغرب\|ابوظبي\|مليسيا\|இலங்கை\|فلسطين\|yachts\|yandex\|zappos\|actor\|adult\|aetna\|amfam\|amica\|apple\|archi\|audio\|autos\|azure\|baidu\|beats\|bible\|bingo\|black\|boats\|bosch\|build\|canon\|cards\|chase\|cheap\|cisco\|citic\|click\|cloud\|coach\|codes\|crown\|cymru\|dabur\|dance\|deals\|delta\|drive\|dubai\|earth\|edeka\|email\|epson\|faith\|fedex\|final\|forex\|forum\|gallo\|games\|gifts\|gives\|glade\|glass\|globo\|gmail\|green\|gripe\|group\|gucci\|guide\|homes\|honda\|horse\|house\|hyatt\|ikano\|irish\|iveco\|jetzt\|koeln\|kyoto\|lamer\|lease\|legal\|lexus\|lilly\|linde\|lipsy\|lixil\|loans\|locus\|lotte\|lotto\|macys\|mango\|media\|miami\|money\|movie\|nexus\|nikon\|ninja\|nokia\|nowtv\|omega\|osaka\|paris\|parts\|party\|phone\|photo\|pizza\|place\|poker\|praxi\|press\|prime\|promo\|quest\|radio\|rehab\|reise\|ricoh\|rocks\|rodeo\|rugby\|salon\|sener\|seven\|sharp\|shell\|shoes\|skype\|sling\|smart\|smile\|solar\|space\|sport\|stada\|store\|study\|style\|sucks\|swiss\|tatar\|tires\|tirol\|tmall\|today\|tokyo\|tools\|toray\|total\|tours\|trade\|trust\|tunes\|tushu\|ubank\|vegas\|video\|vodka\|volvo\|wales\|watch\|weber\|weibo\|works\|world\|xerox\|ישראל\|বাংলা\|భారత్\|भारोत\|संगठन\|ایران\|بازار\|بھارت\|سودان\|همراه\|سورية\|ഭാരതം\|嘉里大酒店\|yahoo\|aarp\|able\|adac\|aero\|akdn\|ally\|amex\|arab\|army\|arpa\|arte\|asda\|asia\|audi\|auto\|baby\|band\|bank\|bbva\|beer\|best\|bike\|bing\|blog\|blue\|bofa\|bond\|book\|buzz\|cafe\|call\|camp\|care\|cars\|casa\|case\|cash\|cbre\|cern\|chat\|citi\|city\|club\|cool\|coop\|cyou\|data\|date\|dclk\|deal\|dell\|desi\|diet\|dish\|docs\|duck\|dvag\|erni\|fage\|fail\|fans\|farm\|fast\|fiat\|fido\|film\|fire\|fish\|flir\|food\|ford\|free\|fund\|game\|gbiz\|gent\|ggee\|gift\|gmbh\|gold\|golf\|goog\|guge\|guru\|hair\|haus\|hdfc\|help\|here\|hgtv\|host\|hsbc\|icbc\|ieee\|imdb\|immo\|info\|itau\|java\|jeep\|jobs\|jprs\|kddi\|kiwi\|kpmg\|kred\|land\|lego\|lgbt\|lidl\|life\|like\|limo\|link\|live\|loan\|loft\|love\|ltda\|luxe\|maif\|meet\|meme\|menu\|mini\|mint\|mobi\|moda\|moto\|name\|navy\|news\|next\|nico\|nike\|ollo\|open\|page\|pars\|pccw\|pics\|ping\|pink\|play\|plus\|pohl\|porn\|post\|prod\|prof\|qpon\|raid\|read\|reit\|rent\|rest\|rich\|rmit\|room\|rsvp\|ruhr\|safe\|sale\|sarl\|save\|saxo\|scot\|seat\|seek\|sexy\|shaw\|shia\|shop\|show\|silk\|sina\|site\|skin\|sncf\|sohu\|song\|sony\|spot\|star\|surf\|talk\|taxi\|team\|tech\|teva\|tiaa\|tips\|town\|toys\|tube\|vana\|visa\|viva\|vivo\|vote\|voto\|wang\|weir\|wien\|wiki\|wine\|work\|xbox\|ಭಾರತ\|ଭାରତ\|大众汽车\|ভাৰত\|ভারত\|موقع\|香格里拉\|сайт\|アマゾン\|дети\|ポイント\|ලංකා\|電訊盈科\|クラウド\|ભારત\|भारत\|عمان\|بارت\|ڀارت\|عراق\|شبكة\|بيتك\|组织机构\|تونس\|グーグル\|ਭਾਰਤ\|yoga\|zara\|zero\|zone\|aaa\|abb\|abc\|aco\|ads\|aeg\|afl\|aig\|anz\|aol\|app\|art\|aws\|axa\|bar\|bbc\|bbt\|bcg\|bcn\|bet\|bid\|bio\|biz\|bms\|bmw\|bom\|boo\|bot\|box\|buy\|bzh\|cab\|cal\|cam\|car\|cat\|cba\|cbn\|cbs\|ceo\|cfa\|cfd\|com\|cpa\|crs\|csc\|dad\|day\|dds\|dev\|dhl\|diy\|dnp\|dog\|dot\|dtv\|dvr\|eat\|eco\|edu\|esq\|eus\|fan\|fit\|fly\|foo\|fox\|frl\|ftr\|fun\|fyi\|gal\|gap\|gay\|gdn\|gea\|gle\|gmo\|gmx\|goo\|gop\|got\|gov\|hbo\|hiv\|hkt\|hot\|how\|ibm\|ice\|icu\|ifm\|inc\|ing\|ink\|int\|ist\|itv\|jcb\|jio\|jll\|jmp\|jnj\|jot\|joy\|kfh\|kia\|kim\|kpn\|krd\|lat\|law\|lds\|llc\|llp\|lol\|lpl\|ltd\|man\|map\|mba\|med\|men\|mil\|mit\|mlb\|mls\|mma\|moe\|moi\|mom\|mov\|msd\|mtn\|mtr\|nab\|nba\|nec\|net\|new\|nfl\|ngo\|nhk\|now\|nra\|nrw\|ntt\|nyc\|obi\|off\|one\|ong\|onl\|ooo\|org\|ott\|ovh\|pay\|pet\|phd\|pid\|pin\|pnc\|pro\|pru\|pub\|pwc\|qvc\|red\|ren\|ril\|rio\|rip\|run\|rwe\|sap\|sas\|sbi\|sbs\|sca\|scb\|ses\|sew\|sex\|sfr\|ski\|sky\|soy\|spa\|srl\|stc\|tab\|tax\|tci\|tdk\|tel\|thd\|tjx\|top\|trv\|tui\|tvs\|ubs\|uno\|uol\|ups\|vet\|vig\|vin\|vip\|wed\|win\|wme\|wow\|wtc\|wtf\|xin\|कॉम\|セール\|คอม\|我爱你\|қаз\|срб\|бел\|קום\|淡马锡\|орг\|नेट\|ストア\|мкд\|كوم\|中文网\|ком\|укр\|亚马逊\|诺基亚\|飞利浦\|мон\|عرب\|ไทย\|рус\|ລາວ\|みんな\|天主教\|مصر\|قطر\|հայ\|新加坡\|xxx\|xyz\|you\|yun\|zip\|ac\|ad\|ae\|af\|ag\|ai\|al\|am\|ao\|aq\|ar\|as\|at\|au\|aw\|ax\|az\|ba\|bb\|bd\|be\|bf\|bg\|bh\|bi\|bj\|bm\|bn\|bo\|br\|bs\|bt\|bv\|bw\|by\|bz\|ca\|cc\|cd\|cf\|cg\|ch\|ci\|ck\|cl\|cm\|cn\|co\|cr\|cu\|cv\|cw\|cx\|cy\|cz\|de\|dj\|dk\|dm\|do\|dz\|ec\|ee\|eg\|er\|es\|et\|eu\|fi\|fj\|fk\|fm\|fo\|fr\|ga\|gb\|gd\|ge\|gf\|gg\|gh\|gi\|gl\|gm\|gn\|gp\|gq\|gr\|gs\|gt\|gu\|gw\|gy\|hk\|hm\|hn\|hr\|ht\|hu\|id\|ie\|il\|im\|in\|io\|iq\|ir\|is\|it\|je\|jm\|jo\|jp\|ke\|kg\|kh\|ki\|km\|kn\|kp\|kr\|kw\|ky\|kz\|la\|lb\|lc\|li\|lk\|lr\|ls\|lt\|lu\|lv\|ly\|ma\|mc\|md\|me\|mg\|mh\|mk\|ml\|mm\|mn\|mo\|mp\|mq\|mr\|ms\|mt\|mu\|mv\|mw\|mx\|my\|mz\|na\|nc\|ne\|nf\|ng\|ni\|nl\|no\|np\|nr\|nu\|nz\|om\|pa\|pe\|pf\|pg\|ph\|pk\|pl\|pm\|pn\|pr\|ps\|pt\|pw\|py\|qa\|re\|ro\|rs\|ru\|rw\|sa\|sb\|sc\|sd\|se\|sg\|sh\|si\|sj\|sk\|sl\|sm\|sn\|so\|sr\|ss\|st\|su\|sv\|sx\|sy\|sz\|tc\|td\|tf\|tg\|th\|tj\|tk\|tl\|tm\|tn\|to\|tr\|tt\|tv\|tw\|tz\|ua\|ug\|uk\|us\|uy\|uz\|va\|vc\|ve\|vg\|vi\|vn\|vu\|wf\|ws\|佛山\|慈善\|集团\|在线\|한국\|点看\|八卦\|公益\|公司\|网站\|移动\|联通\|бг\|时尚\|微博\|삼성\|商标\|商店\|商城\|ею\|新闻\|家電\|中信\|中国\|中國\|娱乐\|谷歌\|购物\|通販\|网店\|餐厅\|网络\|香港\|食品\|台湾\|台灣\|手机\|澳門\|닷컴\|政府\|გე\|机构\|健康\|招聘\|рф\|大拿\|ευ\|ελ\|世界\|書籍\|网址\|닷넷\|コム\|游戏\|企业\|信息\|嘉里\|广东\|政务\|ye\|yt\|za\|zm\|zw))))`),\n /* eslint-enable prefer-regex-literals /\n / eslint-enable quotes /\n numeric: /^[0-9]+$/,\n integer: /^\\-?[0-9]+$/,\n decimal: /^\\-?[0-9]\\.?[0-9]+$/,\n alpha: /^[a-z]+$/i,\n alphaNumeric: /^[a-z0-9]+$/i,\n alphaDash: /^[a-z0-9_-]+$/i,\n javascript: /^[a-z_\\$][a-z0-9_\\$]$/i,\n upperString: /^[A-Z ]$/,\n lowerString: /^[a-z ]$/,\n v4uuid: /^[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[0-9a-f]{4}-[0-9a-f]{12}$/i\n };\n / eslint-enable no-useless-escape /\n\n // Validation ------------------------------------------------------------------\n var _validationAttribut = {\n optional: function (schema, candidate) {\n var opt = typeof schema.optional === 'boolean' ? schema.optional : (schema.optional === 'true'); // Default is false\n\n if (opt === true) {\n return;\n }\n if (typeof candidate === 'undefined') {\n this.report('is missing and not optional', null, 'optional');\n }\n },\n type: function (schema, candidate) {\n // return because optional function already handle this case\n if (typeof candidate === 'undefined' \|\| (typeof schema.type !== 'string' && !(schema.type instanceof Array) && typeof schema.type !== 'function')) {\n return;\n }\n var types = _typeIs.array(schema.type) ? schema.type : [schema.type];\n var typeIsValid = types.some(function (type) {\n return _simpleType(type, candidate);\n });\n if (!typeIsValid) {\n types = types.map(function (t) { return typeof t === 'function' ? 'an instance of ' + t.name : t; });\n this.report('must be ' + types.join(' or ') + ', but is ' + _realType(candidate), null, 'type');\n }\n },\n uniqueness: function (schema, candidate) {\n if (typeof schema.uniqueness === 'string') { schema.uniqueness = (schema.uniqueness === 'true'); }\n if (typeof schema.uniqueness !== 'boolean' \|\| schema.uniqueness === false \|\| (!_typeIs.array(candidate) && typeof candidate !== 'string')) {\n return;\n }\n var reported = [];\n for (var i = 0; i < candidate.length; i++) {\n if (reported.indexOf(candidate[i]) >= 0) {\n continue;\n }\n var indexes = getIndexes(candidate, candidate[i]);\n if (indexes.length > 1) {\n reported.push(candidate[i]);\n this.report('has value [' + candidate[i] + '] more than once at indexes [' + indexes.join(', ') + ']', null, 'uniqueness');\n }\n }\n },\n pattern: function (schema, candidate) {\n var self = this;\n var regexs = schema.pattern;\n if (typeof candidate !== 'string') {\n return;\n }\n var matches = false;\n if (!_typeIs.array(regexs)) {\n regexs = [regexs];\n }\n regexs.forEach(function (regex) {\n if (typeof regex === 'string' && regex in _formats) {\n regex = _formats[regex];\n }\n if (regex instanceof RegExp) {\n if (regex.test(candidate)) {\n matches = true;\n }\n }\n });\n if (!matches) {\n self.report('must match [' + regexs.join(' or ') + '], but is equal to \"' + candidate + '\"', null, 'pattern');\n }\n },\n validDate: function (schema, candidate) {\n if (String(schema.validDate) === 'true' && candidate instanceof Date && isNaN(candidate.getTime())) {\n this.report('must be a valid date', null, 'validDate');\n }\n },\n minLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var minLength = Number(schema.minLength);\n if (isNaN(minLength)) {\n return;\n }\n if (candidate.length < minLength) {\n this.report('must be longer than ' + minLength + ' elements, but it has ' + candidate.length, null, 'minLength');\n }\n },\n maxLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var maxLength = Number(schema.maxLength);\n if (isNaN(maxLength)) {\n return;\n }\n if (candidate.length > maxLength) {\n this.report('must be shorter than ' + maxLength + ' elements, but it has ' + candidate.length, null, 'maxLength');\n }\n },\n exactLength: function (schema, candidate) {\n if (typeof candidate !== 'string' && !_typeIs.array(candidate)) {\n return;\n }\n var exactLength = Number(schema.exactLength);\n if (isNaN(exactLength)) {\n return;\n }\n if (candidate.length !== exactLength) {\n this.report('must have exactly ' + exactLength + ' elements, but it have ' + candidate.length, null, 'exactLength');\n }\n },\n lt: function (schema, candidate) {\n var limit = Number(schema.lt);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate >= limit) {\n this.report('must be less than ' + limit + ', but is equal to \"' + candidate + '\"', null, 'lt');\n }\n },\n lte: function (schema, candidate) {\n var limit = Number(schema.lte);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate > limit) {\n this.report('must be less than or equal to ' + limit + ', but is equal to \"' + candidate + '\"', null, 'lte');\n }\n },\n gt: function (schema, candidate) {\n var limit = Number(schema.gt);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate <= limit) {\n this.report('must be greater than ' + limit + ', but is equal to \"' + candidate + '\"', null, 'gt');\n }\n },\n gte: function (schema, candidate) {\n var limit = Number(schema.gte);\n if (typeof candidate !== 'number' \|\| isNaN(limit)) {\n return;\n }\n if (candidate < limit) {\n this.report('must be greater than or equal to ' + limit + ', but is equal to \"' + candidate + '\"', null, 'gte');\n }\n },\n eq: function (schema, candidate) {\n if (typeof candidate !== 'number' && typeof candidate !== 'string' && typeof candidate !== 'boolean') {\n return;\n }\n var limit = schema.eq;\n if (typeof limit !== 'number' && typeof limit !== 'string' && typeof limit !== 'boolean' && !_typeIs.array(limit)) {\n return;\n }\n if (_typeIs.array(limit)) {\n for (var i = 0; i < limit.length; i++) {\n if (candidate === limit[i]) {\n return;\n }\n }\n this.report('must be equal to [' + limit.map(function (l) {\n return '\"' + l + '\"';\n }).join(' or ') + '], but is equal to \"' + candidate + '\"', null, 'eq');\n } else {\n if (candidate !== limit) {\n this.report('must be equal to \"' + limit + '\", but is equal to \"' + candidate + '\"', null, 'eq');\n }\n }\n },\n ne: function (schema, candidate) {\n if (typeof candidate !== 'number' && typeof candidate !== 'string') {\n return;\n }\n var limit = schema.ne;\n if (typeof limit !== 'number' && typeof limit !== 'string' && !_typeIs.array(limit)) {\n return;\n }\n if (_typeIs.array(limit)) {\n for (var i = 0; i < limit.length; i++) {\n if (candidate === limit[i]) {\n this.report('must not be equal to \"' + limit[i] + '\"', null, 'ne');\n return;\n }\n }\n } else {\n if (candidate === limit) {\n this.report('must not be equal to \"' + limit + '\"', null, 'ne');\n }\n }\n },\n someKeys: function (schema, candidat) {\n var _keys = schema.someKeys;\n if (!_typeIs.object(candidat)) {\n return;\n }\n var valid = _keys.some(function (action) {\n return (action in candidat);\n });\n if (!valid) {\n this.report('must have at least key ' + _keys.map(function (i) {\n return '\"' + i + '\"';\n }).join(' or '), null, 'someKeys');\n }\n },\n strict: function (schema, candidate) {\n if (typeof schema.strict === 'string') { schema.strict = (schema.strict === 'true'); }\n if (schema.strict !== true \|\| !_typeIs.object(candidate) \|\| !_typeIs.object(schema.properties)) {\n return;\n }\n var self = this;\n if (typeof schema.properties[''] === 'undefined') {\n var intruder = Object.keys(candidate).filter(function (key) {\n return (typeof schema.properties[key] === 'undefined');\n });\n if (intruder.length > 0) {\n var msg = 'should not contains ' + (intruder.length > 1 ? 'properties' : 'property') +\n ' [' + intruder.map(function (i) { return '\"' + i + '\"'; }).join(', ') + ']';\n self.report(msg, null, 'strict');\n }\n }\n },\n exec: function (schema, candidate, callback) {\n var self = this;\n\n if (typeof callback === 'function') {\n return this.asyncExec(schema, candidate, callback);\n }\n (_typeIs.array(schema.exec) ? schema.exec : [schema.exec]).forEach(function (exec) {\n if (typeof exec === 'function') {\n exec.call(self, schema, candidate);\n }\n });\n },\n properties: function (schema, candidate, callback) {\n if (typeof callback === 'function') {\n return this.asyncProperties(schema, candidate, callback);\n }\n if (!(schema.properties instanceof Object) \|\| !(candidate instanceof Object)) {\n return;\n }\n var properties = schema.properties;\n var i;\n if (properties[''] != null) {\n for (i in candidate) {\n if (i in properties) {\n continue;\n }\n this._deeperObject(i);\n this._validate(properties[''], candidate[i]);\n this._back();\n }\n }\n for (i in properties) {\n if (i === '') {\n continue;\n }\n this._deeperObject(i);\n this._validate(properties[i], candidate[i]);\n this._back();\n }\n },\n items: function (schema, candidate, callback) {\n if (typeof callback === 'function') {\n return this.asyncItems(schema, candidate, callback);\n }\n if (!(schema.items instanceof Object) \|\| !(candidate instanceof Object)) {\n return;\n }\n var items = schema.items;\n var i, l;\n // If provided schema is an array\n // then call validate for each case\n // else it is an Object\n // then call validate for each key\n if (_typeIs.array(items) && _typeIs.array(candidate)) {\n for (i = 0, l = items.length; i < l; i++) {\n this._deeperArray(i);\n this._validate(items[i], candidate[i]);\n this._back();\n }\n } else {\n for (var key in candidate) {\n if (Object.prototype.hasOwnProperty.call(candidate, key)) {\n this._deeperArray(key);\n this._validate(items, candidate[key]);\n this._back();\n }\n }\n }\n }\n };\n\n var _asyncValidationAttribut = {\n asyncExec: function (schema, candidate, callback) {\n var self = this;\n async.eachSeries(_typeIs.array(schema.exec) ? schema.exec : [schema.exec], function (exec, done) {\n if (typeof exec === 'function') {\n if (exec.length > 2) {\n return exec.call(self, schema, candidate, done);\n }\n exec.call(self, schema, candidate);\n }\n async.nextTick(done);\n }, callback);\n },\n asyncProperties: function (schema, candidate, callback) {\n if (!(schema.properties instanceof Object) \|\| !_typeIs.object(candidate)) {\n return callback();\n }\n var self = this;\n var properties = schema.properties;\n async.series([\n function (next) {\n if (properties[''] == null) {\n return next();\n }\n async.eachSeries(Object.keys(candidate), function (i, done) {\n if (i in properties) {\n return async.nextTick(done);\n }\n self._deeperObject(i);\n self._asyncValidate(properties[''], candidate[i], function (err) {\n self._back();\n done(err);\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(properties), function (i, done) {\n if (i === '') {\n return async.nextTick(done);\n }\n self._deeperObject(i);\n self._asyncValidate(properties[i], candidate[i], function (err) {\n self._back();\n done(err);\n });\n }, next);\n }\n ], callback);\n },\n asyncItems: function (schema, candidate, callback) {\n if (!(schema.items instanceof Object) \|\| !(candidate instanceof Object)) {\n return callback();\n }\n var self = this;\n var items = schema.items;\n\n if (_typeIs.array(items) && _typeIs.array(candidate)) {\n async.timesSeries(items.length, function (i, done) {\n self._deeperArray(i);\n self._asyncValidate(items[i], candidate[i], function (err, res) {\n self._back();\n done(err, res);\n });\n self._back();\n }, callback);\n } else {\n async.eachSeries(Object.keys(candidate), function (key, done) {\n self._deeperArray(key);\n self._asyncValidate(items, candidate[key], function (err, res) {\n self._back();\n done(err, res);\n });\n }, callback);\n }\n }\n };\n\n // Validation Class ----------------------------------------------------------\n // inherits from Inspection class (actually we just call Inspection\n // constructor with the new context, because its prototype is empty\n function Validation(schema, custom) {\n Inspection.prototype.constructor.call(this, schema, _merge(Validation.custom, custom));\n var _error = [];\n\n this._basicFields = Object.keys(_validationAttribut);\n this._customFields = Object.keys(this._custom);\n this.origin = null;\n\n this.report = function (message, code, reason) {\n var newErr = {\n code: code \|\| this.userCode \|\| null,\n reason: reason \|\| 'unknown',\n message: this.userError \|\| message \|\| 'is invalid',\n property: this.userAlias ? (this.userAlias + ' (' + this._dumpStack() + ')') : this._dumpStack()\n };\n _error.push(newErr);\n return this;\n };\n\n this.result = function () {\n return {\n error: _error,\n valid: _error.length === 0,\n format: function () {\n if (this.valid === true) {\n return 'Candidate is valid';\n }\n return this.error.map(function (i) {\n return 'Property ' + i.property + ': ' + i.message;\n }).join('\\n');\n }\n };\n };\n }\n\n _extend(Validation.prototype, _validationAttribut);\n _extend(Validation.prototype, _asyncValidationAttribut);\n _extend(Validation, new Customisable());\n\n Validation.prototype.validate = function (candidate, callback) {\n this.origin = candidate;\n if (typeof callback === 'function') {\n var self = this;\n return async.nextTick(function () {\n self._asyncValidate(self._schema, candidate, function (err) {\n self.origin = null;\n callback(err, self.result());\n });\n });\n }\n return this._validate(this._schema, candidate).result();\n };\n\n Validation.prototype._validate = function (schema, candidate, callback) {\n this.userCode = schema.code \|\| null;\n this.userError = schema.error \|\| null;\n this.userAlias = schema.alias \|\| null;\n this._basicFields.forEach(function (i) {\n if ((i in schema \|\| i === 'optional') && typeof this[i] === 'function') {\n this[i](schema, candidate);\n }\n }, this);\n this._customFields.forEach(function (i) {\n if (i in schema && typeof this._custom[i] === 'function') {\n this._custom[i].call(this, schema, candidate);\n }\n }, this);\n return this;\n };\n\n Validation.prototype._asyncValidate = function (schema, candidate, callback) {\n var self = this;\n this.userCode = schema.code \|\| null;\n this.userError = schema.error \|\| null;\n this.userAlias = schema.alias \|\| null;\n\n async.series([\n function (next) {\n async.eachSeries(Object.keys(_validationAttribut), function (i, done) {\n async.nextTick(function () {\n if ((i in schema \|\| i === 'optional') && typeof self[i] === 'function') {\n if (self[i].length > 2) {\n return self[i](schema, candidate, done);\n }\n self[i](schema, candidate);\n }\n done();\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(self._custom), function (i, done) {\n async.nextTick(function () {\n if (i in schema && typeof self._custom[i] === 'function') {\n if (self._custom[i].length > 2) {\n return self._custom[i].call(self, schema, candidate, done);\n }\n self._custom[i].call(self, schema, candidate);\n }\n done();\n });\n }, next);\n }\n ], callback);\n };\n\n // Sanitization ----------------------------------------------------------------\n // functions called by _sanitization.type method.\n var _forceType = {\n number: function (post, schema) {\n var n;\n if (typeof post === 'number') {\n return post;\n } else if (post === '') {\n if (typeof schema.def !== 'undefined') {\n return schema.def;\n }\n return null;\n } else if (typeof post === 'string') {\n n = parseFloat(post.replace(/,/g, '.').replace(/ /g, ''));\n if (typeof n === 'number') {\n return n;\n }\n } else if (post instanceof Date) {\n return +post;\n }\n return null;\n },\n integer: function (post, schema) {\n var n;\n if (typeof post === 'number' && post % 1 === 0) {\n return post;\n } else if (post === '') {\n if (typeof schema.def !== 'undefined') {\n return schema.def;\n }\n return null;\n } else if (typeof post === 'string') {\n n = parseInt(post.replace(/ /g, ''), 10);\n if (typeof n === 'number') {\n return n;\n }\n } else if (typeof post === 'number') {\n return parseInt(post, 10);\n } else if (typeof post === 'boolean') {\n if (post) { return 1; }\n return 0;\n } else if (post instanceof Date) {\n return +post;\n }\n return null;\n },\n string: function (post, schema) {\n if (typeof post === 'boolean' \|\| typeof post === 'number' \|\| post instanceof Date) {\n return post.toString();\n } else if (_typeIs.array(post)) {\n // If user authorize array and strings...\n if (schema.items \|\| schema.properties) {\n return post;\n }\n return post.join(String(schema.joinWith \|\| ','));\n } else if (post instanceof Object) {\n // If user authorize objects ans strings...\n if (schema.items \|\| schema.properties) {\n return post;\n }\n return JSON.stringify(post);\n } else if (typeof post === 'string' && post.length) {\n return post;\n }\n return null;\n },\n date: function (post, schema) {\n if (post instanceof Date) {\n return post;\n } else {\n var d = new Date(post);\n if (!isNaN(d.getTime())) { // if valid date\n return d;\n }\n }\n return null;\n },\n boolean: function (post, schema) {\n if (typeof post === 'undefined') return null;\n if (typeof post === 'string' && post.toLowerCase() === 'false') return false;\n return !!post;\n },\n object: function (post, schema) {\n if (typeof post !== 'string' \|\| _typeIs.object(post)) {\n return post;\n }\n try {\n return JSON.parse(post);\n } catch (e) {\n return null;\n }\n },\n array: function (post, schema) {\n if (_typeIs.array(post)) {\n return post;\n }\n if (typeof post === 'undefined') {\n return null;\n }\n if (typeof post === 'string') {\n if (post.substring(0, 1) === '[' && post.slice(-1) === ']') {\n try {\n return JSON.parse(post);\n } catch (e) {\n return null;\n }\n }\n return post.split(String(schema.splitWith \|\| ','));\n }\n if (!_typeIs.array(post)) {\n return [post];\n }\n return null;\n }\n };\n\n var _applyRules = {\n upper: function (post) {\n return post.toUpperCase();\n },\n lower: function (post) {\n return post.toLowerCase();\n },\n title: function (post) {\n // Fix by seb (replace \\w\\S* by \\S* => exemple : coucou ça va)\n return post.replace(/\\S/g, function (txt) {\n return txt.charAt(0).toUpperCase() + txt.substr(1).toLowerCase();\n });\n },\n capitalize: function (post) {\n return post.charAt(0).toUpperCase() + post.substr(1).toLowerCase();\n },\n ucfirst: function (post) {\n return post.charAt(0).toUpperCase() + post.substr(1);\n },\n trim: function (post) {\n return post.trim();\n }\n };\n\n // Every function return the future value of each property. Therefore you\n // have to return post even if you do not change its value\n var _sanitizationAttribut = {\n strict: function (schema, post) {\n if (typeof schema.strict === 'string') { schema.strict = (schema.strict === 'true'); }\n if (schema.strict !== true) {\n return post;\n }\n if (!_typeIs.object(schema.properties)) {\n return post;\n }\n if (!_typeIs.object(post)) {\n return post;\n }\n Object.keys(post).forEach(function (key) {\n if (!(key in schema.properties)) {\n delete post[key];\n }\n });\n return post;\n },\n optional: function (schema, post) {\n var opt = typeof schema.optional === 'boolean' ? schema.optional : (schema.optional !== 'false'); // Default: true\n if (opt === true) {\n return post;\n }\n if (typeof post !== 'undefined') {\n return post;\n }\n this.report();\n if (schema.def === Date) {\n return new Date();\n }\n return schema.def;\n },\n type: function (schema, post) {\n // if (_typeIs['object'](post) \|\| _typeIs.array(post)) {\n // return post;\n // }\n if (typeof schema.type !== 'string' \|\| typeof _forceType[schema.type] !== 'function') {\n return post;\n }\n var n;\n var opt = typeof schema.optional === 'boolean' ? schema.optional : true;\n if (typeof _forceType[schema.type] === 'function') {\n n = _forceType[schema.type](post, schema);\n if ((n === null && !opt) \|\| (!n && isNaN(n)) \|\| (n === null && schema.type === 'string')) {\n n = schema.def;\n }\n } else if (!opt) {\n n = schema.def;\n }\n if ((n != null \|\| (typeof schema.def !== 'undefined' && schema.def === n)) && n !== post) {\n this.report();\n return n;\n }\n return post;\n },\n rules: function (schema, post) {\n var rules = schema.rules;\n if (typeof post !== 'string' \|\| (typeof rules !== 'string' && !_typeIs.array(rules))) {\n return post;\n }\n var modified = false;\n (_typeIs.array(rules) ? rules : [rules]).forEach(function (rule) {\n if (typeof _applyRules[rule] === 'function') {\n post = _applyRules[rule](post);\n modified = true;\n }\n });\n if (modified) {\n this.report();\n }\n return post;\n },\n min: function (schema, post) {\n var postTest = Number(post);\n if (isNaN(postTest)) {\n return post;\n }\n var min = Number(schema.min);\n if (isNaN(min)) {\n return post;\n }\n if (postTest < min) {\n this.report();\n return min;\n }\n return post;\n },\n max: function (schema, post) {\n var postTest = Number(post);\n if (isNaN(postTest)) {\n return post;\n }\n var max = Number(schema.max);\n if (isNaN(max)) {\n return post;\n }\n if (postTest > max) {\n this.report();\n return max;\n }\n return post;\n },\n minLength: function (schema, post) {\n var limit = Number(schema.minLength);\n if (typeof post !== 'string' \|\| isNaN(limit) \|\| limit < 0) {\n return post;\n }\n var str = '';\n var gap = limit - post.length;\n if (gap > 0) {\n for (var i = 0; i < gap; i++) {\n str += '-';\n }\n this.report();\n return post + str;\n }\n return post;\n },\n maxLength: function (schema, post) {\n var limit = Number(schema.maxLength);\n if (typeof post !== 'string' \|\| isNaN(limit) \|\| limit < 0) {\n return post;\n }\n if (post.length > limit) {\n this.report();\n return post.slice(0, limit);\n }\n return post;\n },\n properties: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncProperties(schema, post, callback);\n }\n if (!post \|\| typeof post !== 'object') {\n return post;\n }\n var properties = schema.properties;\n var tmp;\n var i;\n if (typeof properties[''] !== 'undefined') {\n for (i in post) {\n if (i in properties) {\n continue;\n }\n this._deeperObject(i);\n tmp = this._sanitize(properties[''], post[i]);\n if (typeof tmp !== 'undefined' \|\| 'exec' in properties['']) {\n post[i] = tmp;\n }\n this._back();\n }\n }\n for (i in properties) {\n if (i !== '') {\n this._deeperObject(i);\n tmp = this._sanitize(properties[i], post[i]);\n if (typeof tmp !== 'undefined' \|\| 'exec' in properties[i]) {\n post[i] = tmp;\n }\n this._back();\n }\n }\n return post;\n },\n items: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncItems(schema, post, callback);\n }\n if (!(schema.items instanceof Object) \|\| !(post instanceof Object)) {\n return post;\n }\n var i;\n if (_typeIs.array(schema.items) && _typeIs.array(post)) {\n var minLength = schema.items.length < post.length ? schema.items.length : post.length;\n for (i = 0; i < minLength; i++) {\n this._deeperArray(i);\n post[i] = this._sanitize(schema.items[i], post[i]);\n this._back();\n }\n } else {\n for (i in post) {\n if (Object.prototype.hasOwnProperty.call(post, i)) {\n this._deeperArray(i);\n post[i] = this._sanitize(schema.items, post[i]);\n this._back();\n }\n }\n }\n return post;\n },\n exec: function (schema, post, callback) {\n if (typeof callback === 'function') {\n return this.asyncExec(schema, post, callback);\n }\n var execs = _typeIs.array(schema.exec) ? schema.exec : [schema.exec];\n\n execs.forEach(function (exec) {\n if (typeof exec === 'function') {\n post = exec.call(this, schema, post);\n }\n }, this);\n return post;\n }\n };\n\n var _asyncSanitizationAttribut = {\n asyncExec: function (schema, post, callback) {\n var self = this;\n var execs = _typeIs.array(schema.exec) ? schema.exec : [schema.exec];\n\n async.eachSeries(execs, function (exec, done) {\n if (typeof exec === 'function') {\n if (exec.length > 2) {\n return exec.call(self, schema, post, function (err, res) {\n if (err) {\n return done(err);\n }\n post = res;\n done();\n });\n }\n post = exec.call(self, schema, post);\n }\n done();\n }, function (err) {\n callback(err, post);\n });\n },\n asyncProperties: function (schema, post, callback) {\n if (!post \|\| typeof post !== 'object') {\n return callback(null, post);\n }\n var self = this;\n var properties = schema.properties;\n\n async.series([\n function (next) {\n if (properties[''] == null) {\n return next();\n }\n var globing = properties[''];\n async.eachSeries(Object.keys(post), function (i, next) {\n if (i in properties) {\n return next();\n }\n self._deeperObject(i);\n self._asyncSanitize(globing, post[i], function (err, res) {\n if (err) { / Error can safely be ignored here / }\n if (typeof res !== 'undefined') {\n post[i] = res;\n }\n self._back();\n next();\n });\n }, next);\n },\n function (next) {\n async.eachSeries(Object.keys(properties), function (i, next) {\n if (i === '') {\n return next();\n }\n self._deeperObject(i);\n self._asyncSanitize(properties[i], post[i], function (err, res) {\n if (err) {\n return next(err);\n }\n if (typeof res !== 'undefined') {\n post[i] = res;\n }\n self._back();\n next();\n });\n }, next);\n }\n ], function (err) {\n return callback(err, post);\n });\n },\n asyncItems: function (schema, post, callback) {\n if (!(schema.items instanceof Object) \|\| !(post instanceof Object)) {\n return callback(null, post);\n }\n var self = this;\n var items = schema.items;\n if (_typeIs.array(items) && _typeIs.array(post)) {\n var minLength = items.length < post.length ? items.length : post.length;\n async.timesSeries(minLength, function (i, next) {\n self._deeperArray(i);\n self._asyncSanitize(items[i], post[i], function (err, res) {\n if (err) {\n return next(err);\n }\n post[i] = res;\n self._back();\n next();\n });\n }, function (err) {\n callback(err, post);\n });\n } else {\n async.eachSeries(Object.keys(post), function (key, next) {\n self._deeperArray(key);\n self._asyncSanitize(items, post[key], function (err, res) {\n if (err) {\n return next();\n }\n post[key] = res;\n self._back();\n next();\n });\n }, function (err) {\n callback(err, post);\n });\n }\n return post;\n }\n };\n\n // Sanitization Class --------------------------------------------------------\n // inherits from Inspection class (actually we just call Inspection\n // constructor with the new context, because its prototype is empty\n function Sanitization(schema, custom) {\n Inspection.prototype.constructor.call(this, schema, _merge(Sanitization.custom, custom));\n var _reporting = [];\n\n this._basicFields = Object.keys(_sanitizationAttribut);\n this._customFields = Object.keys(this._custom);\n this.origin = null;\n\n this.report = function (message) {\n var newNot = {\n message: message \|\| 'was sanitized',\n property: this.userAlias ? (this.userAlias + ' (' + this._dumpStack() + ')') : this._dumpStack()\n };\n if (!_reporting.some(function (e) { return e.property === newNot.property; })) {\n _reporting.push(newNot);\n }\n };\n\n this.result = function (data) {\n // For old IE.\n /* eslint-disable object-shorthand /\n return {\n data: data,\n reporting: _reporting,\n format: function () {\n return this.reporting.map(function (i) {\n return 'Property ' + i.property + ' ' + i.message;\n }).join('\\n');\n }\n };\n / eslint-enable object-shorthand /\n };\n }\n\n _extend(Sanitization.prototype, _sanitizationAttribut);\n _extend(Sanitization.prototype, _asyncSanitizationAttribut);\n _extend(Sanitization, new Customisable());\n\n Sanitization.prototype.sanitize = function (post, callback) {\n this.origin = post;\n if (typeof callback === 'function') {\n var self = this;\n return this._asyncSanitize(this._schema, post, function (err, data) {\n self.origin = null;\n callback(err, self.result(data));\n });\n }\n var data = this._sanitize(this._schema, post);\n this.origin = null;\n return this.result(data);\n };\n\n Sanitization.prototype._sanitize = function (schema, post) {\n this.userAlias = schema.alias \|\| null;\n this._basicFields.forEach(function (i) {\n if ((i in schema \|\| i === 'optional') && typeof this[i] === 'function') {\n post = this[i](schema, post);\n }\n }, this);\n this._customFields.forEach(function (i) {\n if (i in schema && typeof this._custom[i] === 'function') {\n post = this._custom[i].call(this, schema, post);\n }\n }, this);\n return post;\n };\n\n Sanitization.prototype._asyncSanitize = function (schema, post, callback) {\n var self = this;\n this.userAlias = schema.alias \|\| null;\n\n async.waterfall([\n function (next) {\n async.reduce(self._basicFields, post, function (value, i, next) {\n async.nextTick(function () {\n if ((i in schema \|\| i === 'optional') && typeof self[i] === 'function') {\n if (self[i].length > 2) {\n return self[i](schema, value, next);\n }\n value = self[i](schema, value);\n }\n next(null, value);\n });\n }, next);\n },\n function (inter, next) {\n async.reduce(self._customFields, inter, function (value, i, next) {\n async.nextTick(function () {\n if (i in schema && typeof self._custom[i] === 'function') {\n if (self._custom[i].length > 2) {\n return self._custom[i].call(self, schema, value, next);\n }\n value = self._custom[i].call(self, schema, value);\n }\n next(null, value);\n });\n }, next);\n }\n ], callback);\n };\n\n // ---------------------------------------------------------------------------\n\n var INT_MIN = -2147483648;\n var INT_MAX = 2147483647;\n\n var _rand = {\n int: function (min, max) {\n return min + (0 \| Math.random() (max - min + 1));\n },\n float: function (min, max) {\n return (Math.random() * (max - min) + min);\n },\n bool: function () {\n return (Math.random() > 0.5);\n },\n char: function (min, max) {\n return String.fromCharCode(this.int(min, max));\n },\n fromList: function (list) {\n return list[this.int(0, list.length - 1)];\n }\n };\n\n var _formatSample = {\n 'date-time': function () {\n return new Date().toISOString();\n },\n date: function () {\n return new Date().toISOString().replace(/T.$/, '');\n },\n time: function () {\n return new Date().toLocaleTimeString({}, { hour12: false });\n },\n color: function (min, max) {\n var s = '#';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('0123456789abcdefABCDEF');\n }\n return s;\n },\n numeric: function () {\n return '' + _rand.int(0, INT_MAX);\n },\n integer: function () {\n if (_rand.bool() === true) {\n return '-' + this.numeric();\n }\n return this.numeric();\n },\n decimal: function () {\n return this.integer() + '.' + this.numeric();\n },\n alpha: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ');\n }\n return s;\n },\n alphaNumeric: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789');\n }\n return s;\n },\n alphaDash: function (min, max) {\n var s = '';\n if (min < 1) {\n min = 1;\n }\n for (var i = 0, l = _rand.int(min, max); i < l; i++) {\n s += _rand.fromList('_-abcdefghijklmnopqrstuvwxyz_-ABCDEFGHIJKLMNOPQRSTUVWXYZ_-0123456789_-');\n }\n return s;\n },\n javascript: function (min, max) {\n var s = _rand.fromList('_$abcdefghijklmnopqrstuvwxyz_$ABCDEFGHIJKLMNOPQRSTUVWXYZ_$');\n for (var i = 0, l = _rand.int(min, max - 1); i < l; i++) {\n s += _rand.fromList('_$abcdefghijklmnopqrstuvwxyz_$ABCDEFGHIJKLMNOPQRSTUVWXYZ_$0123456789_$');\n }\n return s;\n }\n };\n\n function _getLimits(schema) {\n var min = INT_MIN;\n var max = INT_MAX;\n\n if (schema.gte != null) {\n min = schema.gte;\n } else if (schema.gt != null) {\n min = schema.gt + 1;\n }\n if (schema.lte != null) {\n max = schema.lte;\n } else if (schema.lt != null) {\n max = schema.lt - 1;\n }\n // For old IE.\n / eslint-disable object-shorthand /\n return { min: min, max: max };\n / eslint-enable object-shorthand /\n }\n\n var _typeGenerator = {\n string: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var s = '';\n var minLength = schema.minLength != null ? schema.minLength : 0;\n var maxLength = schema.maxLength != null ? schema.maxLength : 32;\n if (typeof schema.pattern === 'string' && typeof _formatSample[schema.pattern] === 'function') {\n return _formatSample[schema.pattern](minLength, maxLength);\n }\n\n var l = schema.exactLength != null ? schema.exactLength : _rand.int(minLength, maxLength);\n for (var i = 0; i < l; i++) {\n s += _rand.char(32, 126);\n }\n return s;\n },\n number: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var limit = _getLimits(schema);\n var n = _rand.float(limit.min, limit.max);\n if (schema.ne != null) {\n var ne = _typeIs.array(schema.ne) ? schema.ne : [schema.ne];\n while (ne.indexOf(n) !== -1) {\n n = _rand.float(limit.min, limit.max);\n }\n }\n return n;\n },\n integer: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n var limit = _getLimits(schema);\n var n = _rand.int(limit.min, limit.max);\n if (schema.ne != null) {\n var ne = _typeIs.array(schema.ne) ? schema.ne : [schema.ne];\n while (ne.indexOf(n) !== -1) {\n n = _rand.int(limit.min, limit.max);\n }\n }\n return n;\n },\n boolean: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n return _rand.bool();\n },\n null: function (schema) {\n return null;\n },\n date: function (schema) {\n if (schema.eq != null) {\n return schema.eq;\n }\n return new Date();\n },\n object: function (schema) {\n var o = {};\n var prop = schema.properties \|\| {};\n\n for (var key in prop) {\n if (Object.prototype.hasOwnProperty.call(prop, key)) {\n if (prop[key].optional === true && _rand.bool() === true) {\n continue;\n }\n if (key !== '') {\n o[key] = this.generate(prop[key]);\n } else {\n var rk = '__random_key_';\n var randomKey = rk + 0;\n var n = _rand.int(1, 9);\n for (var i = 1; i <= n; i++) {\n if (!(randomKey in prop)) {\n o[randomKey] = this.generate(prop[key]);\n }\n randomKey = rk + i;\n }\n }\n }\n }\n return o;\n },\n array: function (schema) {\n var self = this;\n var items = schema.items \|\| {};\n var minLength = schema.minLength != null ? schema.minLength : 0;\n var maxLength = schema.maxLength != null ? schema.maxLength : 16;\n var type;\n var candidate;\n var size;\n var i;\n\n if (_typeIs.array(items)) {\n size = items.length;\n if (schema.exactLength != null) {\n size = schema.exactLength;\n } else if (size < minLength) {\n size = minLength;\n } else if (size > maxLength) {\n size = maxLength;\n }\n candidate = new Array(size);\n type = null;\n for (i = 0; i < size; i++) {\n type = items[i].type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n candidate[i] = self[type](items[i]);\n }\n } else {\n size = schema.exactLength != null ? schema.exactLength : _rand.int(minLength, maxLength);\n candidate = new Array(size);\n type = items.type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n for (i = 0; i < size; i++) {\n candidate[i] = self[type](items);\n }\n }\n return candidate;\n },\n any: function (schema) {\n var fields = Object.keys(_typeGenerator);\n var i = fields[_rand.int(0, fields.length - 2)];\n return this[i](schema);\n }\n };\n\n // CandidateGenerator Class (Singleton) --------------------------------------\n function CandidateGenerator() {\n // Maybe extends Inspection class too ?\n }\n\n _extend(CandidateGenerator.prototype, _typeGenerator);\n\n var _instance = null;\n CandidateGenerator.instance = function () {\n if (!(_instance instanceof CandidateGenerator)) {\n _instance = new CandidateGenerator();\n }\n return _instance;\n };\n\n CandidateGenerator.prototype.generate = function (schema) {\n var type = schema.type \|\| 'any';\n if (_typeIs.array(type)) {\n type = type[_rand.int(0, type.length - 1)];\n }\n return this[type](schema);\n };\n\n // Exports ---------------------------------------------------------------------\n var SchemaInspector = {};\n\n // if server-side (node.js) else client-side\n if (typeof module !== 'undefined' && module.exports) {\n module.exports = SchemaInspector;\n } else {\n window.SchemaInspector = SchemaInspector;\n }\n\n SchemaInspector.newSanitization = function (schema, custom) {\n return new Sanitization(schema, custom);\n };\n\n SchemaInspector.newValidation = function (schema, custom) {\n return new Validation(schema, custom);\n };\n\n SchemaInspector.Validation = Validation;\n SchemaInspector.Sanitization = Sanitization;\n\n SchemaInspector.sanitize = function (schema, post, custom, callback) {\n if (arguments.length === 3 && typeof custom === 'function') {\n callback = custom;\n custom = null;\n }\n return new Sanitization(schema, custom).sanitize(post, callback);\n };\n\n SchemaInspector.validate = function (schema, candidate, custom, callback) {\n if (arguments.length === 3 && typeof custom === 'function') {\n callback = custom;\n custom = null;\n }\n return new Validation(schema, custom).validate(candidate, callback);\n };\n\n SchemaInspector.generate = function (schema, n) {\n if (typeof n === 'number') {\n var r = new Array(n);\n for (var i = 0; i < n; i++) {\n r[i] = CandidateGenerator.instance().generate(schema);\n }\n return r;\n }\n return CandidateGenerator.instance().generate(schema);\n };\n})();\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n typeof define === 'function' && define.amd ? define(['exports'], factory) :\n (factory((global.async = global.async \|\| {})));\n}(this, (function (exports) { 'use strict';\n\nfunction slice(arrayLike, start) {\n start = start\|0;\n var newLen = Math.max(arrayLike.length - start, 0);\n var newArr = Array(newLen);\n for(var idx = 0; idx < newLen; idx++) {\n newArr[idx] = arrayLike[start + idx];\n }\n return newArr;\n}\n\n/*\n Creates a continuation function with some arguments already applied.\n \n Useful as a shorthand when combined with other control flow functions. Any\n * arguments passed to the returned function are added to the arguments\n * originally passed to apply.\n \n @name apply\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {Function} fn - The function you want to eventually apply all\n * arguments to. Invokes with (arguments...).\n * @param {...} arguments... - Any number of arguments to automatically apply\n when the continuation is called.\n * @returns {Function} the partially-applied function\n * @example\n \n // using apply\n * async.parallel([\n * async.apply(fs.writeFile, 'testfile1', 'test1'),\n * async.apply(fs.writeFile, 'testfile2', 'test2')\n * ]);\n \n \n * // the same process without using apply\n * async.parallel([\n * function(callback) {\n * fs.writeFile('testfile1', 'test1', callback);\n * },\n * function(callback) {\n * fs.writeFile('testfile2', 'test2', callback);\n * }\n * ]);\n \n // It's possible to pass any number of additional arguments when calling the\n * // continuation:\n \n node> var fn = async.apply(sys.puts, 'one');\n * node> fn('two', 'three');\n * one\n * two\n * three\n /\nvar apply = function(fn/, ...args/) {\n var args = slice(arguments, 1);\n return function(/callArgs/) {\n var callArgs = slice(arguments);\n return fn.apply(null, args.concat(callArgs));\n };\n};\n\nvar initialParams = function (fn) {\n return function (/...args, callback/) {\n var args = slice(arguments);\n var callback = args.pop();\n fn.call(this, args, callback);\n };\n};\n\n/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' \|\| type == 'function');\n}\n\nvar hasSetImmediate = typeof setImmediate === 'function' && setImmediate;\nvar hasNextTick = typeof process === 'object' && typeof process.nextTick === 'function';\n\nfunction fallback(fn) {\n setTimeout(fn, 0);\n}\n\nfunction wrap(defer) {\n return function (fn/, ...args/) {\n var args = slice(arguments, 1);\n defer(function () {\n fn.apply(null, args);\n });\n };\n}\n\nvar _defer;\n\nif (hasSetImmediate) {\n _defer = setImmediate;\n} else if (hasNextTick) {\n _defer = process.nextTick;\n} else {\n _defer = fallback;\n}\n\nvar setImmediate$1 = wrap(_defer);\n\n/\n Take a sync function and make it async, passing its return value to a\n * callback. This is useful for plugging sync functions into a waterfall,\n * series, or other async functions. Any arguments passed to the generated\n * function will be passed to the wrapped function (except for the final\n * callback argument). Errors thrown will be passed to the callback.\n \n If the function passed to `asyncify` returns a Promise, that promises's\n * resolved/rejected state will be used to call the callback, rather than simply\n * the synchronous return value.\n \n This also means you can asyncify ES2017 `async` functions.\n \n @name asyncify\n * @static\n * @memberOf module:Utils\n * @method\n * @alias wrapSync\n * @category Util\n * @param {Function} func - The synchronous function, or Promise-returning\n * function to convert to an {@link AsyncFunction}.\n * @returns {AsyncFunction} An asynchronous wrapper of the `func`. To be\n * invoked with `(args..., callback)`.\n * @example\n \n // passing a regular synchronous function\n * async.waterfall([\n * async.apply(fs.readFile, filename, \"utf8\"),\n * async.asyncify(JSON.parse),\n * function (data, next) {\n * // data is the result of parsing the text.\n * // If there was a parsing error, it would have been caught.\n * }\n * ], callback);\n \n // passing a function returning a promise\n * async.waterfall([\n * async.apply(fs.readFile, filename, \"utf8\"),\n * async.asyncify(function (contents) {\n * return db.model.create(contents);\n * }),\n * function (model, next) {\n * // `model` is the instantiated model object.\n * // If there was an error, this function would be skipped.\n * }\n * ], callback);\n \n // es2017 example, though `asyncify` is not needed if your JS environment\n * // supports async functions out of the box\n * var q = async.queue(async.asyncify(async function(file) {\n * var intermediateStep = await processFile(file);\n * return await somePromise(intermediateStep)\n * }));\n \n q.push(files);\n /\nfunction asyncify(func) {\n return initialParams(function (args, callback) {\n var result;\n try {\n result = func.apply(this, args);\n } catch (e) {\n return callback(e);\n }\n // if result is Promise object\n if (isObject(result) && typeof result.then === 'function') {\n result.then(function(value) {\n invokeCallback(callback, null, value);\n }, function(err) {\n invokeCallback(callback, err.message ? err : new Error(err));\n });\n } else {\n callback(null, result);\n }\n });\n}\n\nfunction invokeCallback(callback, error, value) {\n try {\n callback(error, value);\n } catch (e) {\n setImmediate$1(rethrow, e);\n }\n}\n\nfunction rethrow(error) {\n throw error;\n}\n\nvar supportsSymbol = typeof Symbol === 'function';\n\nfunction isAsync(fn) {\n return supportsSymbol && fn[Symbol.toStringTag] === 'AsyncFunction';\n}\n\nfunction wrapAsync(asyncFn) {\n return isAsync(asyncFn) ? asyncify(asyncFn) : asyncFn;\n}\n\nfunction applyEach$1(eachfn) {\n return function(fns/, ...args/) {\n var args = slice(arguments, 1);\n var go = initialParams(function(args, callback) {\n var that = this;\n return eachfn(fns, function (fn, cb) {\n wrapAsync(fn).apply(that, args.concat(cb));\n }, callback);\n });\n if (args.length) {\n return go.apply(this, args);\n }\n else {\n return go;\n }\n };\n}\n\n/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\n/* Built-in value references. /\nvar Symbol$1 = root.Symbol;\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/* Built-in value references. /\nvar symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/\n A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the raw `toStringTag`.\n /\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag$1),\n tag = value[symToStringTag$1];\n\n try {\n value[symToStringTag$1] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag$1] = tag;\n } else {\n delete value[symToStringTag$1];\n }\n }\n return result;\n}\n\n/* Used for built-in method references. /\nvar objectProto$1 = Object.prototype;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString$1 = objectProto$1.toString;\n\n/\n Converts `value` to a string using `Object.prototype.toString`.\n \n @private\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n /\nfunction objectToString(value) {\n return nativeObjectToString$1.call(value);\n}\n\n/* `Object#toString` result references. /\nvar nullTag = '[object Null]';\nvar undefinedTag = '[object Undefined]';\n\n/* Built-in value references. /\nvar symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/\n The base implementation of `getTag` without fallbacks for buggy environments.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\n/* `Object#toString` result references. /\nvar asyncTag = '[object AsyncFunction]';\nvar funcTag = '[object Function]';\nvar genTag = '[object GeneratorFunction]';\nvar proxyTag = '[object Proxy]';\n\n/\n Checks if `value` is classified as a `Function` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag \|\| tag == genTag \|\| tag == asyncTag \|\| tag == proxyTag;\n}\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n// A temporary value used to identify if the loop should be broken.\n// See #1064, #1293\nvar breakLoop = {};\n\n/\n This method returns `undefined`.\n \n @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n \n _.times(2, _.noop);\n * // => [undefined, undefined]\n /\nfunction noop() {\n // No operation performed.\n}\n\nfunction once(fn) {\n return function () {\n if (fn === null) return;\n var callFn = fn;\n fn = null;\n callFn.apply(this, arguments);\n };\n}\n\nvar iteratorSymbol = typeof Symbol === 'function' && Symbol.iterator;\n\nvar getIterator = function (coll) {\n return iteratorSymbol && coll[iteratorSymbol] && coll[iteratorSymbol]();\n};\n\n/\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]';\n\n/\n The base implementation of `_.isArguments`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n /\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/* Used for built-in method references. /\nvar objectProto$3 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$2 = objectProto$3.hasOwnProperty;\n\n/* Built-in value references. /\nvar propertyIsEnumerable = objectProto$3.propertyIsEnumerable;\n\n/\n Checks if `value` is likely an `arguments` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty$2.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\n/\n Checks if `value` is classified as an `Array` object.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\n/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\n/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER$1 = 9007199254740991;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/*\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER$1 : length;\n\n return !!length &&\n (type == 'number' \|\|\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/* `Object#toString` result references. /\nvar argsTag$1 = '[object Arguments]';\nvar arrayTag = '[object Array]';\nvar boolTag = '[object Boolean]';\nvar dateTag = '[object Date]';\nvar errorTag = '[object Error]';\nvar funcTag$1 = '[object Function]';\nvar mapTag = '[object Map]';\nvar numberTag = '[object Number]';\nvar objectTag = '[object Object]';\nvar regexpTag = '[object RegExp]';\nvar setTag = '[object Set]';\nvar stringTag = '[object String]';\nvar weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]';\nvar dataViewTag = '[object DataView]';\nvar float32Tag = '[object Float32Array]';\nvar float64Tag = '[object Float64Array]';\nvar int8Tag = '[object Int8Array]';\nvar int16Tag = '[object Int16Array]';\nvar int32Tag = '[object Int32Array]';\nvar uint8Tag = '[object Uint8Array]';\nvar uint8ClampedTag = '[object Uint8ClampedArray]';\nvar uint16Tag = '[object Uint16Array]';\nvar uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values of typed arrays. /\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag$1] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag$1] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/\n The base implementation of `_.isTypedArray` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n /\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/\n The base implementation of `_.unary` without support for storing metadata.\n \n @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n /\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\n/* Detect free variable `exports`. /\nvar freeExports$1 = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule$1 = freeExports$1 && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports$1 = freeModule$1 && freeModule$1.exports === freeExports$1;\n\n/* Detect free variable `process` from Node.js. /\nvar freeProcess = moduleExports$1 && freeGlobal.process;\n\n/* Used to access faster Node.js helpers. /\nvar nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule$1 && freeModule$1.require && freeModule$1.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n}());\n\n/ Node.js helper references. /\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/\n Checks if `value` is classified as a typed array.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n \n _.isTypedArray(new Uint8Array);\n * // => true\n \n _.isTypedArray([]);\n * // => false\n /\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/* Used for built-in method references. /\nvar objectProto$2 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$1 = objectProto$2.hasOwnProperty;\n\n/\n Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr \|\| isArg \|\| isBuff \|\| isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty$1.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' \|\|\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' \|\| key == 'parent')) \|\|\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' \|\| key == 'byteLength' \|\| key == 'byteOffset')) \|\|\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/* Used for built-in method references. /\nvar objectProto$5 = Object.prototype;\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto$5;\n\n return value === proto;\n}\n\n/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeKeys = overArg(Object.keys, Object);\n\n/* Used for built-in method references. /\nvar objectProto$4 = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty$3 = objectProto$4.hasOwnProperty;\n\n/\n The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty$3.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nfunction createArrayIterator(coll) {\n var i = -1;\n var len = coll.length;\n return function next() {\n return ++i < len ? {value: coll[i], key: i} : null;\n }\n}\n\nfunction createES2015Iterator(iterator) {\n var i = -1;\n return function next() {\n var item = iterator.next();\n if (item.done)\n return null;\n i++;\n return {value: item.value, key: i};\n }\n}\n\nfunction createObjectIterator(obj) {\n var okeys = keys(obj);\n var i = -1;\n var len = okeys.length;\n return function next() {\n var key = okeys[++i];\n if (key === '__proto__') {\n return next();\n }\n return i < len ? {value: obj[key], key: key} : null;\n };\n}\n\nfunction iterator(coll) {\n if (isArrayLike(coll)) {\n return createArrayIterator(coll);\n }\n\n var iterator = getIterator(coll);\n return iterator ? createES2015Iterator(iterator) : createObjectIterator(coll);\n}\n\nfunction onlyOnce(fn) {\n return function() {\n if (fn === null) throw new Error(\"Callback was already called.\");\n var callFn = fn;\n fn = null;\n callFn.apply(this, arguments);\n };\n}\n\nfunction _eachOfLimit(limit) {\n return function (obj, iteratee, callback) {\n callback = once(callback \|\| noop);\n if (limit <= 0 \|\| !obj) {\n return callback(null);\n }\n var nextElem = iterator(obj);\n var done = false;\n var running = 0;\n var looping = false;\n\n function iterateeCallback(err, value) {\n running -= 1;\n if (err) {\n done = true;\n callback(err);\n }\n else if (value === breakLoop \|\| (done && running <= 0)) {\n done = true;\n return callback(null);\n }\n else if (!looping) {\n replenish();\n }\n }\n\n function replenish () {\n looping = true;\n while (running < limit && !done) {\n var elem = nextElem();\n if (elem === null) {\n done = true;\n if (running <= 0) {\n callback(null);\n }\n return;\n }\n running += 1;\n iteratee(elem.value, elem.key, onlyOnce(iterateeCallback));\n }\n looping = false;\n }\n\n replenish();\n };\n}\n\n/\n The same as [`eachOf`]{@link module:Collections.eachOf} but runs a maximum of `limit` async operations at a\n * time.\n \n @name eachOfLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`. The `key` is the item's key, or index in the case of an\n * array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nfunction eachOfLimit(coll, limit, iteratee, callback) {\n _eachOfLimit(limit)(coll, wrapAsync(iteratee), callback);\n}\n\nfunction doLimit(fn, limit) {\n return function (iterable, iteratee, callback) {\n return fn(iterable, limit, iteratee, callback);\n };\n}\n\n// eachOf implementation optimized for array-likes\nfunction eachOfArrayLike(coll, iteratee, callback) {\n callback = once(callback \|\| noop);\n var index = 0,\n completed = 0,\n length = coll.length;\n if (length === 0) {\n callback(null);\n }\n\n function iteratorCallback(err, value) {\n if (err) {\n callback(err);\n } else if ((++completed === length) \|\| value === breakLoop) {\n callback(null);\n }\n }\n\n for (; index < length; index++) {\n iteratee(coll[index], index, onlyOnce(iteratorCallback));\n }\n}\n\n// a generic version of eachOf which can handle array, object, and iterator cases.\nvar eachOfGeneric = doLimit(eachOfLimit, Infinity);\n\n/\n Like [`each`]{@link module:Collections.each}, except that it passes the key (or index) as the second argument\n * to the iteratee.\n \n @name eachOf\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEachOf\n * @category Collection\n * @see [async.each]{@link module:Collections.each}\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each\n * item in `coll`.\n * The `key` is the item's key, or index in the case of an array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n \n var obj = {dev: \"/dev.json\", test: \"/test.json\", prod: \"/prod.json\"};\n * var configs = {};\n \n async.forEachOf(obj, function (value, key, callback) {\n * fs.readFile(__dirname + value, \"utf8\", function (err, data) {\n * if (err) return callback(err);\n * try {\n * configs[key] = JSON.parse(data);\n * } catch (e) {\n * return callback(e);\n * }\n * callback();\n * });\n * }, function (err) {\n * if (err) console.error(err.message);\n * // configs is now a map of JSON data\n * doSomethingWith(configs);\n * });\n /\nvar eachOf = function(coll, iteratee, callback) {\n var eachOfImplementation = isArrayLike(coll) ? eachOfArrayLike : eachOfGeneric;\n eachOfImplementation(coll, wrapAsync(iteratee), callback);\n};\n\nfunction doParallel(fn) {\n return function (obj, iteratee, callback) {\n return fn(eachOf, obj, wrapAsync(iteratee), callback);\n };\n}\n\nfunction _asyncMap(eachfn, arr, iteratee, callback) {\n callback = callback \|\| noop;\n arr = arr \|\| [];\n var results = [];\n var counter = 0;\n var _iteratee = wrapAsync(iteratee);\n\n eachfn(arr, function (value, _, callback) {\n var index = counter++;\n _iteratee(value, function (err, v) {\n results[index] = v;\n callback(err);\n });\n }, function (err) {\n callback(err, results);\n });\n}\n\n/\n Produces a new collection of values by mapping each value in `coll` through\n * the `iteratee` function. The `iteratee` is called with an item from `coll`\n * and a callback for when it has finished processing. Each of these callback\n * takes 2 arguments: an `error`, and the transformed item from `coll`. If\n * `iteratee` passes an error to its callback, the main `callback` (for the\n * `map` function) is immediately called with the error.\n \n Note, that since this function applies the `iteratee` to each item in\n * parallel, there is no guarantee that the `iteratee` functions will complete\n * in order. However, the results array will be in the same order as the\n * original `coll`.\n \n If `map` is passed an Object, the results will be an Array. The results\n * will roughly be in the order of the original Objects' keys (but this can\n * vary across JavaScript engines).\n \n @name map\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an Array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @example\n \n async.map(['file1','file2','file3'], fs.stat, function(err, results) {\n * // results is now an array of stats for each file\n * });\n /\nvar map = doParallel(_asyncMap);\n\n/\n Applies the provided arguments to each function in the array, calling\n * `callback` after all functions have completed. If you only provide the first\n * argument, `fns`, then it will return a function which lets you pass in the\n * arguments as if it were a single function call. If more arguments are\n * provided, `callback` is required while `args` is still optional.\n \n @name applyEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} fns - A collection of {@link AsyncFunction}s\n * to all call with the same arguments\n * @param {...} [args] - any number of separate arguments to pass to the\n function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument, `fns`, is provided, it will\n * return a function which lets you pass in the arguments as if it were a single\n * function call. The signature is `(..args, callback)`. If invoked with any\n * arguments, `callback` is required.\n * @example\n \n async.applyEach([enableSearch, updateSchema], 'bucket', callback);\n \n // partial application example:\n * async.each(\n * buckets,\n * async.applyEach([enableSearch, updateSchema]),\n * callback\n * );\n /\nvar applyEach = applyEach$1(map);\n\nfunction doParallelLimit(fn) {\n return function (obj, limit, iteratee, callback) {\n return fn(_eachOfLimit(limit), obj, wrapAsync(iteratee), callback);\n };\n}\n\n/\n The same as [`map`]{@link module:Collections.map} but runs a maximum of `limit` async operations at a time.\n \n @name mapLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n /\nvar mapLimit = doParallelLimit(_asyncMap);\n\n/\n The same as [`map`]{@link module:Collections.map} but runs only a single async operation at a time.\n \n @name mapSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n /\nvar mapSeries = doLimit(mapLimit, 1);\n\n/\n The same as [`applyEach`]{@link module:ControlFlow.applyEach} but runs only a single async operation at a time.\n \n @name applyEachSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.applyEach]{@link module:ControlFlow.applyEach}\n * @category Control Flow\n * @param {Array\|Iterable\|Object} fns - A collection of {@link AsyncFunction}s to all\n * call with the same arguments\n * @param {...} [args] - any number of separate arguments to pass to the\n function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument is provided, it will return\n * a function which lets you pass in the arguments as if it were a single\n * function call.\n /\nvar applyEachSeries = applyEach$1(mapSeries);\n\n/\n A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\n/\n Creates a base function for methods like `_.forIn` and `_.forOwn`.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n}\n\n/\n The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n /\nvar baseFor = createBaseFor();\n\n/\n The base implementation of `_.forOwn` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n /\nfunction baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n}\n\n/\n The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.isNaN` without support for number objects.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n /\nfunction baseIsNaN(value) {\n return value !== value;\n}\n\n/\n A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n}\n\n/\n The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\n/\n Determines the best order for running the {@link AsyncFunction}s in `tasks`, based on\n * their requirements. Each function can optionally depend on other functions\n * being completed first, and each function is run as soon as its requirements\n * are satisfied.\n \n If any of the {@link AsyncFunction}s pass an error to their callback, the `auto` sequence\n * will stop. Further tasks will not execute (so any other functions depending\n * on it will not run), and the main `callback` is immediately called with the\n * error.\n \n {@link AsyncFunction}s also receive an object containing the results of functions which\n * have completed so far as the first argument, if they have dependencies. If a\n * task function has no dependencies, it will only be passed a callback.\n \n @name auto\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Object} tasks - An object. Each of its properties is either a\n * function or an array of requirements, with the {@link AsyncFunction} itself the last item\n * in the array. The object's key of a property serves as the name of the task\n * defined by that property, i.e. can be used when specifying requirements for\n * other tasks. The function receives one or two arguments:\n * * a `results` object, containing the results of the previously executed\n * functions, only passed if the task has any dependencies,\n * * a `callback(err, result)` function, which must be called when finished,\n * passing an `error` (which can be `null`) and the result of the function's\n * execution.\n * @param {number} [concurrency=Infinity] - An optional `integer` for\n * determining the maximum number of tasks that can be run in parallel. By\n * default, as many as possible.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback. Results are always returned; however, if an\n * error occurs, no further `tasks` will be performed, and the results object\n * will only contain partial results. Invoked with (err, results).\n * @returns undefined\n * @example\n \n async.auto({\n * // this function will just be passed a callback\n * readData: async.apply(fs.readFile, 'data.txt', 'utf-8'),\n * showData: ['readData', function(results, cb) {\n * // results.readData is the file's contents\n * // ...\n * }]\n * }, callback);\n \n async.auto({\n * get_data: function(callback) {\n * console.log('in get_data');\n * // async code to get some data\n * callback(null, 'data', 'converted to array');\n * },\n * make_folder: function(callback) {\n * console.log('in make_folder');\n * // async code to create a directory to store a file in\n * // this is run at the same time as getting the data\n * callback(null, 'folder');\n * },\n * write_file: ['get_data', 'make_folder', function(results, callback) {\n * console.log('in write_file', JSON.stringify(results));\n * // once there is some data and the directory exists,\n * // write the data to a file in the directory\n * callback(null, 'filename');\n * }],\n * email_link: ['write_file', function(results, callback) {\n * console.log('in email_link', JSON.stringify(results));\n * // once the file is written let's email a link to it...\n * // results.write_file contains the filename returned by write_file.\n * callback(null, {'file':results.write_file, 'email':'user@example.com'});\n * }]\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('results = ', results);\n * });\n /\nvar auto = function (tasks, concurrency, callback) {\n if (typeof concurrency === 'function') {\n // concurrency is optional, shift the args.\n callback = concurrency;\n concurrency = null;\n }\n callback = once(callback \|\| noop);\n var keys$$1 = keys(tasks);\n var numTasks = keys$$1.length;\n if (!numTasks) {\n return callback(null);\n }\n if (!concurrency) {\n concurrency = numTasks;\n }\n\n var results = {};\n var runningTasks = 0;\n var hasError = false;\n\n var listeners = Object.create(null);\n\n var readyTasks = [];\n\n // for cycle detection:\n var readyToCheck = []; // tasks that have been identified as reachable\n // without the possibility of returning to an ancestor task\n var uncheckedDependencies = {};\n\n baseForOwn(tasks, function (task, key) {\n if (!isArray(task)) {\n // no dependencies\n enqueueTask(key, [task]);\n readyToCheck.push(key);\n return;\n }\n\n var dependencies = task.slice(0, task.length - 1);\n var remainingDependencies = dependencies.length;\n if (remainingDependencies === 0) {\n enqueueTask(key, task);\n readyToCheck.push(key);\n return;\n }\n uncheckedDependencies[key] = remainingDependencies;\n\n arrayEach(dependencies, function (dependencyName) {\n if (!tasks[dependencyName]) {\n throw new Error('async.auto task `' + key +\n '` has a non-existent dependency `' +\n dependencyName + '` in ' +\n dependencies.join(', '));\n }\n addListener(dependencyName, function () {\n remainingDependencies--;\n if (remainingDependencies === 0) {\n enqueueTask(key, task);\n }\n });\n });\n });\n\n checkForDeadlocks();\n processQueue();\n\n function enqueueTask(key, task) {\n readyTasks.push(function () {\n runTask(key, task);\n });\n }\n\n function processQueue() {\n if (readyTasks.length === 0 && runningTasks === 0) {\n return callback(null, results);\n }\n while(readyTasks.length && runningTasks < concurrency) {\n var run = readyTasks.shift();\n run();\n }\n\n }\n\n function addListener(taskName, fn) {\n var taskListeners = listeners[taskName];\n if (!taskListeners) {\n taskListeners = listeners[taskName] = [];\n }\n\n taskListeners.push(fn);\n }\n\n function taskComplete(taskName) {\n var taskListeners = listeners[taskName] \|\| [];\n arrayEach(taskListeners, function (fn) {\n fn();\n });\n processQueue();\n }\n\n\n function runTask(key, task) {\n if (hasError) return;\n\n var taskCallback = onlyOnce(function(err, result) {\n runningTasks--;\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n }\n if (err) {\n var safeResults = {};\n baseForOwn(results, function(val, rkey) {\n safeResults[rkey] = val;\n });\n safeResults[key] = result;\n hasError = true;\n listeners = Object.create(null);\n\n callback(err, safeResults);\n } else {\n results[key] = result;\n taskComplete(key);\n }\n });\n\n runningTasks++;\n var taskFn = wrapAsync(task[task.length - 1]);\n if (task.length > 1) {\n taskFn(results, taskCallback);\n } else {\n taskFn(taskCallback);\n }\n }\n\n function checkForDeadlocks() {\n // Kahn's algorithm\n // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm\n // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html\n var currentTask;\n var counter = 0;\n while (readyToCheck.length) {\n currentTask = readyToCheck.pop();\n counter++;\n arrayEach(getDependents(currentTask), function (dependent) {\n if (--uncheckedDependencies[dependent] === 0) {\n readyToCheck.push(dependent);\n }\n });\n }\n\n if (counter !== numTasks) {\n throw new Error(\n 'async.auto cannot execute tasks due to a recursive dependency'\n );\n }\n }\n\n function getDependents(taskName) {\n var result = [];\n baseForOwn(tasks, function (task, key) {\n if (isArray(task) && baseIndexOf(task, taskName, 0) >= 0) {\n result.push(key);\n }\n });\n return result;\n }\n};\n\n/\n A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\n/* `Object#toString` result references. /\nvar symbolTag = '[object Symbol]';\n\n/\n Checks if `value` is classified as a `Symbol` primitive or object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n \n _.isSymbol(Symbol.iterator);\n * // => true\n \n _.isSymbol('abc');\n * // => false\n /\nfunction isSymbol(value) {\n return typeof value == 'symbol' \|\|\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol$1 ? Symbol$1.prototype : undefined;\nvar symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/\n The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n \n @private\n * @param {} value The value to process.\n @returns {string} Returns the string.\n /\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\n/\n The base implementation of `_.slice` without an iteratee call guard.\n \n @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n /\nfunction baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n}\n\n/\n Casts `array` to a slice if it's needed.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n /\nfunction castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n \n @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n /\nfunction charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n}\n\n/\n Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n \n @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n /\nfunction charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n}\n\n/\n Converts an ASCII `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction asciiToArray(string) {\n return string.split('');\n}\n\n/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange;\nvar rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsZWJ = '\\\\u200d';\n\n/* Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). /\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n/\n Checks if `string` contains Unicode symbols.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n /\nfunction hasUnicode(string) {\n return reHasUnicode.test(string);\n}\n\n/* Used to compose unicode character classes. /\nvar rsAstralRange$1 = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange$1 = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange$1 = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange$1 = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange$1 = rsComboMarksRange$1 + reComboHalfMarksRange$1 + rsComboSymbolsRange$1;\nvar rsVarRange$1 = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsAstral = '[' + rsAstralRange$1 + ']';\nvar rsCombo = '[' + rsComboRange$1 + ']';\nvar rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]';\nvar rsModifier = '(?:' + rsCombo + '\|' + rsFitz + ')';\nvar rsNonAstral = '[^' + rsAstralRange$1 + ']';\nvar rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}';\nvar rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]';\nvar rsZWJ$1 = '\\\\u200d';\n\n/* Used to compose unicode regexes. /\nvar reOptMod = rsModifier + '?';\nvar rsOptVar = '[' + rsVarRange$1 + ']?';\nvar rsOptJoin = '(?:' + rsZWJ$1 + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('\|') + ')' + rsOptVar + reOptMod + ')';\nvar rsSeq = rsOptVar + reOptMod + rsOptJoin;\nvar rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('\|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). /\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')\|' + rsSymbol + rsSeq, 'g');\n\n/\n Converts a Unicode `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction unicodeToArray(string) {\n return string.match(reUnicode) \|\| [];\n}\n\n/\n Converts `string` to an array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n /\nfunction stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n}\n\n/\n Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n * @example\n \n _.toString(null);\n * // => ''\n \n _.toString(-0);\n * // => '-0'\n \n _.toString([1, 2, 3]);\n * // => '1,2,3'\n /\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\n/* Used to match leading and trailing whitespace. /\nvar reTrim = /^\\s+\|\\s+$/g;\n\n/\n Removes leading and trailing whitespace or specified characters from `string`.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n \n _.trim(' abc ');\n * // => 'abc'\n \n _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n \n _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n /\nfunction trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard \|\| chars === undefined)) {\n return string.replace(reTrim, '');\n }\n if (!string \|\| !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n}\n\nvar FN_ARGS = /^(?:async\\s+)?(function)?\\s[^\$]\\(\\s([^\$])\\)/m;\nvar FN_ARG_SPLIT = /,/;\nvar FN_ARG = /(=.+)?(\\s)$/;\nvar STRIP_COMMENTS = /((\\/\\/.$)\|(\\/\\[\\s\\S]?\\\\/))/mg;\n\nfunction parseParams(func) {\n func = func.toString().replace(STRIP_COMMENTS, '');\n func = func.match(FN_ARGS)[2].replace(' ', '');\n func = func ? func.split(FN_ARG_SPLIT) : [];\n func = func.map(function (arg){\n return trim(arg.replace(FN_ARG, ''));\n });\n return func;\n}\n\n/*\n A dependency-injected version of the [async.auto]{@link module:ControlFlow.auto} function. Dependent\n * tasks are specified as parameters to the function, after the usual callback\n * parameter, with the parameter names matching the names of the tasks it\n * depends on. This can provide even more readable task graphs which can be\n * easier to maintain.\n \n If a final callback is specified, the task results are similarly injected,\n * specified as named parameters after the initial error parameter.\n \n The autoInject function is purely syntactic sugar and its semantics are\n * otherwise equivalent to [async.auto]{@link module:ControlFlow.auto}.\n \n @name autoInject\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.auto]{@link module:ControlFlow.auto}\n * @category Control Flow\n * @param {Object} tasks - An object, each of whose properties is an {@link AsyncFunction} of\n * the form 'func([dependencies...], callback). The object's key of a property\n * serves as the name of the task defined by that property, i.e. can be used\n * when specifying requirements for other tasks.\n * * The `callback` parameter is a `callback(err, result)` which must be called\n * when finished, passing an `error` (which can be `null`) and the result of\n * the function's execution. The remaining parameters name other tasks on\n * which the task is dependent, and the results from those tasks are the\n * arguments of those parameters.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback, and a `results` object with any completed\n * task results, similar to `auto`.\n * @example\n \n // The example from `auto` can be rewritten as follows:\n * async.autoInject({\n * get_data: function(callback) {\n * // async code to get some data\n * callback(null, 'data', 'converted to array');\n * },\n * make_folder: function(callback) {\n * // async code to create a directory to store a file in\n * // this is run at the same time as getting the data\n * callback(null, 'folder');\n * },\n * write_file: function(get_data, make_folder, callback) {\n * // once there is some data and the directory exists,\n * // write the data to a file in the directory\n * callback(null, 'filename');\n * },\n * email_link: function(write_file, callback) {\n * // once the file is written let's email a link to it...\n * // write_file contains the filename returned by write_file.\n * callback(null, {'file':write_file, 'email':'user@example.com'});\n * }\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('email_link = ', results.email_link);\n * });\n \n // If you are using a JS minifier that mangles parameter names, `autoInject`\n * // will not work with plain functions, since the parameter names will be\n * // collapsed to a single letter identifier. To work around this, you can\n * // explicitly specify the names of the parameters your task function needs\n * // in an array, similar to Angular.js dependency injection.\n \n // This still has an advantage over plain `auto`, since the results a task\n * // depends on are still spread into arguments.\n * async.autoInject({\n * //...\n * write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {\n * callback(null, 'filename');\n * }],\n * email_link: ['write_file', function(write_file, callback) {\n * callback(null, {'file':write_file, 'email':'user@example.com'});\n * }]\n * //...\n * }, function(err, results) {\n * console.log('err = ', err);\n * console.log('email_link = ', results.email_link);\n * });\n /\nfunction autoInject(tasks, callback) {\n var newTasks = {};\n\n baseForOwn(tasks, function (taskFn, key) {\n var params;\n var fnIsAsync = isAsync(taskFn);\n var hasNoDeps =\n (!fnIsAsync && taskFn.length === 1) \|\|\n (fnIsAsync && taskFn.length === 0);\n\n if (isArray(taskFn)) {\n params = taskFn.slice(0, -1);\n taskFn = taskFn[taskFn.length - 1];\n\n newTasks[key] = params.concat(params.length > 0 ? newTask : taskFn);\n } else if (hasNoDeps) {\n // no dependencies, use the function as-is\n newTasks[key] = taskFn;\n } else {\n params = parseParams(taskFn);\n if (taskFn.length === 0 && !fnIsAsync && params.length === 0) {\n throw new Error(\"autoInject task functions require explicit parameters.\");\n }\n\n // remove callback param\n if (!fnIsAsync) params.pop();\n\n newTasks[key] = params.concat(newTask);\n }\n\n function newTask(results, taskCb) {\n var newArgs = arrayMap(params, function (name) {\n return results[name];\n });\n newArgs.push(taskCb);\n wrapAsync(taskFn).apply(null, newArgs);\n }\n });\n\n auto(newTasks, callback);\n}\n\n// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation\n// used for queues. This implementation assumes that the node provided by the user can be modified\n// to adjust the next and last properties. We implement only the minimal functionality\n// for queue support.\nfunction DLL() {\n this.head = this.tail = null;\n this.length = 0;\n}\n\nfunction setInitial(dll, node) {\n dll.length = 1;\n dll.head = dll.tail = node;\n}\n\nDLL.prototype.removeLink = function(node) {\n if (node.prev) node.prev.next = node.next;\n else this.head = node.next;\n if (node.next) node.next.prev = node.prev;\n else this.tail = node.prev;\n\n node.prev = node.next = null;\n this.length -= 1;\n return node;\n};\n\nDLL.prototype.empty = function () {\n while(this.head) this.shift();\n return this;\n};\n\nDLL.prototype.insertAfter = function(node, newNode) {\n newNode.prev = node;\n newNode.next = node.next;\n if (node.next) node.next.prev = newNode;\n else this.tail = newNode;\n node.next = newNode;\n this.length += 1;\n};\n\nDLL.prototype.insertBefore = function(node, newNode) {\n newNode.prev = node.prev;\n newNode.next = node;\n if (node.prev) node.prev.next = newNode;\n else this.head = newNode;\n node.prev = newNode;\n this.length += 1;\n};\n\nDLL.prototype.unshift = function(node) {\n if (this.head) this.insertBefore(this.head, node);\n else setInitial(this, node);\n};\n\nDLL.prototype.push = function(node) {\n if (this.tail) this.insertAfter(this.tail, node);\n else setInitial(this, node);\n};\n\nDLL.prototype.shift = function() {\n return this.head && this.removeLink(this.head);\n};\n\nDLL.prototype.pop = function() {\n return this.tail && this.removeLink(this.tail);\n};\n\nDLL.prototype.toArray = function () {\n var arr = Array(this.length);\n var curr = this.head;\n for(var idx = 0; idx < this.length; idx++) {\n arr[idx] = curr.data;\n curr = curr.next;\n }\n return arr;\n};\n\nDLL.prototype.remove = function (testFn) {\n var curr = this.head;\n while(!!curr) {\n var next = curr.next;\n if (testFn(curr)) {\n this.removeLink(curr);\n }\n curr = next;\n }\n return this;\n};\n\nfunction queue(worker, concurrency, payload) {\n if (concurrency == null) {\n concurrency = 1;\n }\n else if(concurrency === 0) {\n throw new Error('Concurrency must not be zero');\n }\n\n var _worker = wrapAsync(worker);\n var numRunning = 0;\n var workersList = [];\n\n var processingScheduled = false;\n function _insert(data, insertAtFront, callback) {\n if (callback != null && typeof callback !== 'function') {\n throw new Error('task callback must be a function');\n }\n q.started = true;\n if (!isArray(data)) {\n data = [data];\n }\n if (data.length === 0 && q.idle()) {\n // call drain immediately if there are no tasks\n return setImmediate$1(function() {\n q.drain();\n });\n }\n\n for (var i = 0, l = data.length; i < l; i++) {\n var item = {\n data: data[i],\n callback: callback \|\| noop\n };\n\n if (insertAtFront) {\n q._tasks.unshift(item);\n } else {\n q._tasks.push(item);\n }\n }\n\n if (!processingScheduled) {\n processingScheduled = true;\n setImmediate$1(function() {\n processingScheduled = false;\n q.process();\n });\n }\n }\n\n function _next(tasks) {\n return function(err){\n numRunning -= 1;\n\n for (var i = 0, l = tasks.length; i < l; i++) {\n var task = tasks[i];\n\n var index = baseIndexOf(workersList, task, 0);\n if (index === 0) {\n workersList.shift();\n } else if (index > 0) {\n workersList.splice(index, 1);\n }\n\n task.callback.apply(task, arguments);\n\n if (err != null) {\n q.error(err, task.data);\n }\n }\n\n if (numRunning <= (q.concurrency - q.buffer) ) {\n q.unsaturated();\n }\n\n if (q.idle()) {\n q.drain();\n }\n q.process();\n };\n }\n\n var isProcessing = false;\n var q = {\n _tasks: new DLL(),\n concurrency: concurrency,\n payload: payload,\n saturated: noop,\n unsaturated:noop,\n buffer: concurrency / 4,\n empty: noop,\n drain: noop,\n error: noop,\n started: false,\n paused: false,\n push: function (data, callback) {\n _insert(data, false, callback);\n },\n kill: function () {\n q.drain = noop;\n q._tasks.empty();\n },\n unshift: function (data, callback) {\n _insert(data, true, callback);\n },\n remove: function (testFn) {\n q._tasks.remove(testFn);\n },\n process: function () {\n // Avoid trying to start too many processing operations. This can occur\n // when callbacks resolve synchronously (#1267).\n if (isProcessing) {\n return;\n }\n isProcessing = true;\n while(!q.paused && numRunning < q.concurrency && q._tasks.length){\n var tasks = [], data = [];\n var l = q._tasks.length;\n if (q.payload) l = Math.min(l, q.payload);\n for (var i = 0; i < l; i++) {\n var node = q._tasks.shift();\n tasks.push(node);\n workersList.push(node);\n data.push(node.data);\n }\n\n numRunning += 1;\n\n if (q._tasks.length === 0) {\n q.empty();\n }\n\n if (numRunning === q.concurrency) {\n q.saturated();\n }\n\n var cb = onlyOnce(_next(tasks));\n _worker(data, cb);\n }\n isProcessing = false;\n },\n length: function () {\n return q._tasks.length;\n },\n running: function () {\n return numRunning;\n },\n workersList: function () {\n return workersList;\n },\n idle: function() {\n return q._tasks.length + numRunning === 0;\n },\n pause: function () {\n q.paused = true;\n },\n resume: function () {\n if (q.paused === false) { return; }\n q.paused = false;\n setImmediate$1(q.process);\n }\n };\n return q;\n}\n\n/\n A cargo of tasks for the worker function to complete. Cargo inherits all of\n * the same methods and event callbacks as [`queue`]{@link module:ControlFlow.queue}.\n * @typedef {Object} CargoObject\n * @memberOf module:ControlFlow\n * @property {Function} length - A function returning the number of items\n * waiting to be processed. Invoke like `cargo.length()`.\n * @property {number} payload - An `integer` for determining how many tasks\n * should be process per round. This property can be changed after a `cargo` is\n * created to alter the payload on-the-fly.\n * @property {Function} push - Adds `task` to the `queue`. The callback is\n * called once the `worker` has finished processing the task. Instead of a\n * single task, an array of `tasks` can be submitted. The respective callback is\n * used for every task in the list. Invoke like `cargo.push(task, [callback])`.\n * @property {Function} saturated - A callback that is called when the\n * `queue.length()` hits the concurrency and further tasks will be queued.\n * @property {Function} empty - A callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - A callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke like `cargo.idle()`.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke like `cargo.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke like `cargo.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. Invoke like `cargo.kill()`.\n /\n\n/\n Creates a `cargo` object with the specified payload. Tasks added to the\n * cargo will be processed altogether (up to the `payload` limit). If the\n * `worker` is in progress, the task is queued until it becomes available. Once\n * the `worker` has completed some tasks, each callback of those tasks is\n * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)\n * for how `cargo` and `queue` work.\n \n While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers\n * at a time, cargo passes an array of tasks to a single worker, repeating\n * when the worker is finished.\n \n @name cargo\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An asynchronous function for processing an array\n * of queued tasks. Invoked with `(tasks, callback)`.\n * @param {number} [payload=Infinity] - An optional `integer` for determining\n * how many tasks should be processed per round; if omitted, the default is\n * unlimited.\n * @returns {module:ControlFlow.CargoObject} A cargo object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the cargo and inner queue.\n * @example\n \n // create a cargo object with payload 2\n * var cargo = async.cargo(function(tasks, callback) {\n * for (var i=0; i<tasks.length; i++) {\n * console.log('hello ' + tasks[i].name);\n * }\n * callback();\n * }, 2);\n \n // add some items\n * cargo.push({name: 'foo'}, function(err) {\n * console.log('finished processing foo');\n * });\n * cargo.push({name: 'bar'}, function(err) {\n * console.log('finished processing bar');\n * });\n * cargo.push({name: 'baz'}, function(err) {\n * console.log('finished processing baz');\n * });\n /\nfunction cargo(worker, payload) {\n return queue(worker, 1, payload);\n}\n\n/\n The same as [`eachOf`]{@link module:Collections.eachOf} but runs only a single async operation at a time.\n \n @name eachOfSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Invoked with (err).\n /\nvar eachOfSeries = doLimit(eachOfLimit, 1);\n\n/\n Reduces `coll` into a single value using an async `iteratee` to return each\n * successive step. `memo` is the initial state of the reduction. This function\n * only operates in series.\n \n For performance reasons, it may make sense to split a call to this function\n * into a parallel map, and then use the normal `Array.prototype.reduce` on the\n * results. This function is for situations where each step in the reduction\n * needs to be async; if you can get the data before reducing it, then it's\n * probably a good idea to do so.\n \n @name reduce\n * @static\n * @memberOf module:Collections\n * @method\n * @alias inject\n * @alias foldl\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {} memo - The initial state of the reduction.\n @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n * @example\n \n async.reduce([1,2,3], 0, function(memo, item, callback) {\n * // pointless async:\n * process.nextTick(function() {\n * callback(null, memo + item)\n * });\n * }, function(err, result) {\n * // result is now equal to the last value of memo, which is 6\n * });\n /\nfunction reduce(coll, memo, iteratee, callback) {\n callback = once(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n eachOfSeries(coll, function(x, i, callback) {\n _iteratee(memo, x, function(err, v) {\n memo = v;\n callback(err);\n });\n }, function(err) {\n callback(err, memo);\n });\n}\n\n/\n Version of the compose function that is more natural to read. Each function\n * consumes the return value of the previous function. It is the equivalent of\n * [compose]{@link module:ControlFlow.compose} with the arguments reversed.\n \n Each function is executed with the `this` binding of the composed function.\n \n @name seq\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.compose]{@link module:ControlFlow.compose}\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} a function that composes the `functions` in order\n * @example\n \n // Requires lodash (or underscore), express3 and dresende's orm2.\n * // Part of an app, that fetches cats of the logged user.\n * // This example uses `seq` function to avoid overnesting and error\n * // handling clutter.\n * app.get('/cats', function(request, response) {\n * var User = request.models.User;\n * async.seq(\n * _.bind(User.get, User), // 'User.get' has signature (id, callback(err, data))\n * function(user, fn) {\n * user.getCats(fn); // 'getCats' has signature (callback(err, data))\n * }\n * )(req.session.user_id, function (err, cats) {\n * if (err) {\n * console.error(err);\n * response.json({ status: 'error', message: err.message });\n * } else {\n * response.json({ status: 'ok', message: 'Cats found', data: cats });\n * }\n * });\n * });\n /\nfunction seq(/...functions/) {\n var _functions = arrayMap(arguments, wrapAsync);\n return function(/...args/) {\n var args = slice(arguments);\n var that = this;\n\n var cb = args[args.length - 1];\n if (typeof cb == 'function') {\n args.pop();\n } else {\n cb = noop;\n }\n\n reduce(_functions, args, function(newargs, fn, cb) {\n fn.apply(that, newargs.concat(function(err/, ...nextargs/) {\n var nextargs = slice(arguments, 1);\n cb(err, nextargs);\n }));\n },\n function(err, results) {\n cb.apply(that, [err].concat(results));\n });\n };\n}\n\n/\n Creates a function which is a composition of the passed asynchronous\n * functions. Each function consumes the return value of the function that\n * follows. Composing functions `f()`, `g()`, and `h()` would produce the result\n * of `f(g(h()))`, only this version uses callbacks to obtain the return values.\n \n Each function is executed with the `this` binding of the composed function.\n \n @name compose\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} an asynchronous function that is the composed\n * asynchronous `functions`\n * @example\n \n function add1(n, callback) {\n * setTimeout(function () {\n * callback(null, n + 1);\n * }, 10);\n * }\n \n function mul3(n, callback) {\n * setTimeout(function () {\n * callback(null, n * 3);\n * }, 10);\n * }\n \n var add1mul3 = async.compose(mul3, add1);\n * add1mul3(4, function (err, result) {\n * // result now equals 15\n * });\n /\nvar compose = function(/...args/) {\n return seq.apply(null, slice(arguments).reverse());\n};\n\nvar _concat = Array.prototype.concat;\n\n/\n The same as [`concat`]{@link module:Collections.concat} but runs a maximum of `limit` async operations at a time.\n \n @name concatLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n /\nvar concatLimit = function(coll, limit, iteratee, callback) {\n callback = callback \|\| noop;\n var _iteratee = wrapAsync(iteratee);\n mapLimit(coll, limit, function(val, callback) {\n _iteratee(val, function(err /, ...args/) {\n if (err) return callback(err);\n return callback(null, slice(arguments, 1));\n });\n }, function(err, mapResults) {\n var result = [];\n for (var i = 0; i < mapResults.length; i++) {\n if (mapResults[i]) {\n result = _concat.apply(result, mapResults[i]);\n }\n }\n\n return callback(err, result);\n });\n};\n\n/\n Applies `iteratee` to each item in `coll`, concatenating the results. Returns\n * the concatenated list. The `iteratee`s are called in parallel, and the\n * results are concatenated as they return. There is no guarantee that the\n * results array will be returned in the original order of `coll` passed to the\n * `iteratee` function.\n \n @name concat\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @example\n \n async.concat(['dir1','dir2','dir3'], fs.readdir, function(err, files) {\n * // files is now a list of filenames that exist in the 3 directories\n * });\n /\nvar concat = doLimit(concatLimit, Infinity);\n\n/\n The same as [`concat`]{@link module:Collections.concat} but runs only a single async operation at a time.\n \n @name concatSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`.\n * The iteratee should complete with an array an array of results.\n * Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n /\nvar concatSeries = doLimit(concatLimit, 1);\n\n/\n Returns a function that when called, calls-back with the values provided.\n * Useful as the first function in a [`waterfall`]{@link module:ControlFlow.waterfall}, or for plugging values in to\n * [`auto`]{@link module:ControlFlow.auto}.\n \n @name constant\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {...} arguments... - Any number of arguments to automatically invoke\n callback with.\n * @returns {AsyncFunction} Returns a function that when invoked, automatically\n * invokes the callback with the previous given arguments.\n * @example\n \n async.waterfall([\n * async.constant(42),\n * function (value, next) {\n * // value === 42\n * },\n * //...\n * ], callback);\n \n async.waterfall([\n * async.constant(filename, \"utf8\"),\n * fs.readFile,\n * function (fileData, next) {\n * //...\n * }\n * //...\n * ], callback);\n \n async.auto({\n * hostname: async.constant(\"https://server.net/\"),\n * port: findFreePort,\n * launchServer: [\"hostname\", \"port\", function (options, cb) {\n * startServer(options, cb);\n * }],\n * //...\n * }, callback);\n /\nvar constant = function(/...values/) {\n var values = slice(arguments);\n var args = [null].concat(values);\n return function (/...ignoredArgs, callback/) {\n var callback = arguments[arguments.length - 1];\n return callback.apply(this, args);\n };\n};\n\n/\n This method returns the first argument it receives.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {} value Any value.\n @returns {} Returns `value`.\n @example\n \n var object = { 'a': 1 };\n \n console.log(_.identity(object) === object);\n * // => true\n /\nfunction identity(value) {\n return value;\n}\n\nfunction _createTester(check, getResult) {\n return function(eachfn, arr, iteratee, cb) {\n cb = cb \|\| noop;\n var testPassed = false;\n var testResult;\n eachfn(arr, function(value, _, callback) {\n iteratee(value, function(err, result) {\n if (err) {\n callback(err);\n } else if (check(result) && !testResult) {\n testPassed = true;\n testResult = getResult(true, value);\n callback(null, breakLoop);\n } else {\n callback();\n }\n });\n }, function(err) {\n if (err) {\n cb(err);\n } else {\n cb(null, testPassed ? testResult : getResult(false));\n }\n });\n };\n}\n\nfunction _findGetResult(v, x) {\n return x;\n}\n\n/\n Returns the first value in `coll` that passes an async truth test. The\n * `iteratee` is applied in parallel, meaning the first iteratee to return\n * `true` will fire the detect `callback` with that result. That means the\n * result might not be the first item in the original `coll` (in terms of order)\n * that passes the test.\n\n * If order within the original `coll` is important, then look at\n * [`detectSeries`]{@link module:Collections.detectSeries}.\n \n @name detect\n * @static\n * @memberOf module:Collections\n * @method\n * @alias find\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @example\n \n async.detect(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // result now equals the first file in the list that exists\n * });\n /\nvar detect = doParallel(_createTester(identity, _findGetResult));\n\n/\n The same as [`detect`]{@link module:Collections.detect} but runs a maximum of `limit` async operations at a\n * time.\n \n @name detectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findLimit\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n /\nvar detectLimit = doParallelLimit(_createTester(identity, _findGetResult));\n\n/\n The same as [`detect`]{@link module:Collections.detect} but runs only a single async operation at a time.\n \n @name detectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findSeries\n * @category Collections\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n /\nvar detectSeries = doLimit(detectLimit, 1);\n\nfunction consoleFunc(name) {\n return function (fn/, ...args/) {\n var args = slice(arguments, 1);\n args.push(function (err/, ...args/) {\n var args = slice(arguments, 1);\n if (typeof console === 'object') {\n if (err) {\n if (console.error) {\n console.error(err);\n }\n } else if (console[name]) {\n arrayEach(args, function (x) {\n console[name](x);\n });\n }\n }\n });\n wrapAsync(fn).apply(null, args);\n };\n}\n\n/\n Logs the result of an [`async` function]{@link AsyncFunction} to the\n * `console` using `console.dir` to display the properties of the resulting object.\n * Only works in Node.js or in browsers that support `console.dir` and\n * `console.error` (such as FF and Chrome).\n * If multiple arguments are returned from the async function,\n * `console.dir` is called on each argument in order.\n \n @name dir\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...} arguments... - Any number of arguments to apply to the function.\n @example\n \n // in a module\n * var hello = function(name, callback) {\n * setTimeout(function() {\n * callback(null, {hello: name});\n * }, 1000);\n * };\n \n // in the node repl\n * node> async.dir(hello, 'world');\n * {hello: 'world'}\n /\nvar dir = consoleFunc('dir');\n\n/\n The post-check version of [`during`]{@link module:ControlFlow.during}. To reflect the difference in\n * the order of operations, the arguments `test` and `fn` are switched.\n \n Also a version of [`doWhilst`]{@link module:ControlFlow.doWhilst} with asynchronous `test` function.\n * @name doDuring\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.during]{@link module:ControlFlow.during}\n * @category Control Flow\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (...args, callback), where `...args` are the\n * non-error args from the previous callback of `fn`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error if one occurred, otherwise `null`.\n /\nfunction doDuring(fn, test, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _fn = wrapAsync(fn);\n var _test = wrapAsync(test);\n\n function next(err/, ...args/) {\n if (err) return callback(err);\n var args = slice(arguments, 1);\n args.push(check);\n _test.apply(this, args);\n }\n\n function check(err, truth) {\n if (err) return callback(err);\n if (!truth) return callback(null);\n _fn(next);\n }\n\n check(null, true);\n\n}\n\n/\n The post-check version of [`whilst`]{@link module:ControlFlow.whilst}. To reflect the difference in\n * the order of operations, the arguments `test` and `iteratee` are switched.\n \n `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.\n \n @name doWhilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - A function which is called each time `test`\n * passes. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped.\n * `callback` will be passed an error and any arguments passed to the final\n * `iteratee`'s callback. Invoked with (err, [results]);\n /\nfunction doWhilst(iteratee, test, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n var next = function(err/, ...args/) {\n if (err) return callback(err);\n var args = slice(arguments, 1);\n if (test.apply(this, args)) return _iteratee(next);\n callback.apply(null, [null].concat(args));\n };\n _iteratee(next);\n}\n\n/\n Like ['doWhilst']{@link module:ControlFlow.doWhilst}, except the `test` is inverted. Note the\n * argument ordering differs from `until`.\n \n @name doUntil\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.doWhilst]{@link module:ControlFlow.doWhilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n /\nfunction doUntil(iteratee, test, callback) {\n doWhilst(iteratee, function() {\n return !test.apply(this, arguments);\n }, callback);\n}\n\n/\n Like [`whilst`]{@link module:ControlFlow.whilst}, except the `test` is an asynchronous function that\n * is passed a callback in the form of `function (err, truth)`. If error is\n * passed to `test` or `fn`, the main callback is immediately called with the\n * value of the error.\n \n @name during\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (callback).\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error, if one occurred, otherwise `null`.\n * @example\n \n var count = 0;\n \n async.during(\n * function (callback) {\n * return callback(null, count < 5);\n * },\n * function (callback) {\n * count++;\n * setTimeout(callback, 1000);\n * },\n * function (err) {\n * // 5 seconds have passed\n * }\n * );\n /\nfunction during(test, fn, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _fn = wrapAsync(fn);\n var _test = wrapAsync(test);\n\n function next(err) {\n if (err) return callback(err);\n _test(check);\n }\n\n function check(err, truth) {\n if (err) return callback(err);\n if (!truth) return callback(null);\n _fn(next);\n }\n\n _test(check);\n}\n\nfunction _withoutIndex(iteratee) {\n return function (value, index, callback) {\n return iteratee(value, callback);\n };\n}\n\n/\n Applies the function `iteratee` to each item in `coll`, in parallel.\n * The `iteratee` is called with an item from the list, and a callback for when\n * it has finished. If the `iteratee` passes an error to its `callback`, the\n * main `callback` (for the `each` function) is immediately called with the\n * error.\n \n Note, that since this function applies `iteratee` to each item in parallel,\n * there is no guarantee that the iteratee functions will complete in order.\n \n @name each\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEach\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to\n * each item in `coll`. Invoked with (item, callback).\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOf`.\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n \n // assuming openFiles is an array of file names and saveFile is a function\n * // to save the modified contents of that file:\n \n async.each(openFiles, saveFile, function(err){\n * // if any of the saves produced an error, err would equal that error\n * });\n \n // assuming openFiles is an array of file names\n * async.each(openFiles, function(file, callback) {\n \n // Perform operation on file here.\n * console.log('Processing file ' + file);\n \n if( file.length > 32 ) {\n * console.log('This file name is too long');\n * callback('File name too long');\n * } else {\n * // Do work to process file here\n * console.log('File processed');\n * callback();\n * }\n * }, function(err) {\n * // if any of the file processing produced an error, err would equal that error\n * if( err ) {\n * // One of the iterations produced an error.\n * // All processing will now stop.\n * console.log('A file failed to process');\n * } else {\n * console.log('All files have been processed successfully');\n * }\n * });\n /\nfunction eachLimit(coll, iteratee, callback) {\n eachOf(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/\n The same as [`each`]{@link module:Collections.each} but runs a maximum of `limit` async operations at a time.\n \n @name eachLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfLimit`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nfunction eachLimit$1(coll, limit, iteratee, callback) {\n _eachOfLimit(limit)(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/\n The same as [`each`]{@link module:Collections.each} but runs only a single async operation at a time.\n \n @name eachSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfSeries`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n /\nvar eachSeries = doLimit(eachLimit$1, 1);\n\n/\n Wrap an async function and ensure it calls its callback on a later tick of\n * the event loop. If the function already calls its callback on a next tick,\n * no extra deferral is added. This is useful for preventing stack overflows\n * (`RangeError: Maximum call stack size exceeded`) and generally keeping\n * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)\n * contained. ES2017 `async` functions are returned as-is -- they are immune\n * to Zalgo's corrupting influences, as they always resolve on a later tick.\n \n @name ensureAsync\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - an async function, one that expects a node-style\n * callback as its last argument.\n * @returns {AsyncFunction} Returns a wrapped function with the exact same call\n * signature as the function passed in.\n * @example\n \n function sometimesAsync(arg, callback) {\n * if (cache[arg]) {\n * return callback(null, cache[arg]); // this would be synchronous!!\n * } else {\n * doSomeIO(arg, callback); // this IO would be asynchronous\n * }\n * }\n \n // this has a risk of stack overflows if many results are cached in a row\n * async.mapSeries(args, sometimesAsync, done);\n \n // this will defer sometimesAsync's callback if necessary,\n * // preventing stack overflows\n * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);\n /\nfunction ensureAsync(fn) {\n if (isAsync(fn)) return fn;\n return initialParams(function (args, callback) {\n var sync = true;\n args.push(function () {\n var innerArgs = arguments;\n if (sync) {\n setImmediate$1(function () {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n fn.apply(this, args);\n sync = false;\n });\n}\n\nfunction notId(v) {\n return !v;\n}\n\n/\n Returns `true` if every element in `coll` satisfies an async test. If any\n * iteratee call returns `false`, the main `callback` is immediately called.\n \n @name every\n * @static\n * @memberOf module:Collections\n * @method\n * @alias all\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @example\n \n async.every(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // if result is true then every file exists\n * });\n /\nvar every = doParallel(_createTester(notId, notId));\n\n/\n The same as [`every`]{@link module:Collections.every} but runs a maximum of `limit` async operations at a time.\n \n @name everyLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n /\nvar everyLimit = doParallelLimit(_createTester(notId, notId));\n\n/\n The same as [`every`]{@link module:Collections.every} but runs only a single async operation at a time.\n \n @name everySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in series.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n /\nvar everySeries = doLimit(everyLimit, 1);\n\n/\n The base implementation of `_.property` without support for deep paths.\n \n @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n}\n\nfunction filterArray(eachfn, arr, iteratee, callback) {\n var truthValues = new Array(arr.length);\n eachfn(arr, function (x, index, callback) {\n iteratee(x, function (err, v) {\n truthValues[index] = !!v;\n callback(err);\n });\n }, function (err) {\n if (err) return callback(err);\n var results = [];\n for (var i = 0; i < arr.length; i++) {\n if (truthValues[i]) results.push(arr[i]);\n }\n callback(null, results);\n });\n}\n\nfunction filterGeneric(eachfn, coll, iteratee, callback) {\n var results = [];\n eachfn(coll, function (x, index, callback) {\n iteratee(x, function (err, v) {\n if (err) {\n callback(err);\n } else {\n if (v) {\n results.push({index: index, value: x});\n }\n callback();\n }\n });\n }, function (err) {\n if (err) {\n callback(err);\n } else {\n callback(null, arrayMap(results.sort(function (a, b) {\n return a.index - b.index;\n }), baseProperty('value')));\n }\n });\n}\n\nfunction _filter(eachfn, coll, iteratee, callback) {\n var filter = isArrayLike(coll) ? filterArray : filterGeneric;\n filter(eachfn, coll, wrapAsync(iteratee), callback \|\| noop);\n}\n\n/\n Returns a new array of all the values in `coll` which pass an async truth\n * test. This operation is performed in parallel, but the results array will be\n * in the same order as the original.\n \n @name filter\n * @static\n * @memberOf module:Collections\n * @method\n * @alias select\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n \n async.filter(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, results) {\n * // results now equals an array of the existing files\n * });\n /\nvar filter = doParallel(_filter);\n\n/\n The same as [`filter`]{@link module:Collections.filter} but runs a maximum of `limit` async operations at a\n * time.\n \n @name filterLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar filterLimit = doParallelLimit(_filter);\n\n/\n The same as [`filter`]{@link module:Collections.filter} but runs only a single async operation at a time.\n \n @name filterSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectSeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results)\n /\nvar filterSeries = doLimit(filterLimit, 1);\n\n/\n Calls the asynchronous function `fn` with a callback parameter that allows it\n * to call itself again, in series, indefinitely.\n\n * If an error is passed to the callback then `errback` is called with the\n * error, and execution stops, otherwise it will never be called.\n \n @name forever\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} fn - an async function to call repeatedly.\n * Invoked with (next).\n * @param {Function} [errback] - when `fn` passes an error to it's callback,\n * this function will be called, and execution stops. Invoked with (err).\n * @example\n \n async.forever(\n * function(next) {\n * // next is suitable for passing to things that need a callback(err [, whatever]);\n * // it will result in this function being called again.\n * },\n * function(err) {\n * // if next is called with a value in its first parameter, it will appear\n * // in here as 'err', and execution will stop.\n * }\n * );\n /\nfunction forever(fn, errback) {\n var done = onlyOnce(errback \|\| noop);\n var task = wrapAsync(ensureAsync(fn));\n\n function next(err) {\n if (err) return done(err);\n task(next);\n }\n next();\n}\n\n/\n The same as [`groupBy`]{@link module:Collections.groupBy} but runs a maximum of `limit` async operations at a time.\n \n @name groupByLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n /\nvar groupByLimit = function(coll, limit, iteratee, callback) {\n callback = callback \|\| noop;\n var _iteratee = wrapAsync(iteratee);\n mapLimit(coll, limit, function(val, callback) {\n _iteratee(val, function(err, key) {\n if (err) return callback(err);\n return callback(null, {key: key, val: val});\n });\n }, function(err, mapResults) {\n var result = {};\n // from MDN, handle object having an `hasOwnProperty` prop\n var hasOwnProperty = Object.prototype.hasOwnProperty;\n\n for (var i = 0; i < mapResults.length; i++) {\n if (mapResults[i]) {\n var key = mapResults[i].key;\n var val = mapResults[i].val;\n\n if (hasOwnProperty.call(result, key)) {\n result[key].push(val);\n } else {\n result[key] = [val];\n }\n }\n }\n\n return callback(err, result);\n });\n};\n\n/\n Returns a new object, where each value corresponds to an array of items, from\n * `coll`, that returned the corresponding key. That is, the keys of the object\n * correspond to the values passed to the `iteratee` callback.\n \n Note: Since this function applies the `iteratee` to each item in parallel,\n * there is no guarantee that the `iteratee` functions will complete in order.\n * However, the values for each key in the `result` will be in the same order as\n * the original `coll`. For Objects, the values will roughly be in the order of\n * the original Objects' keys (but this can vary across JavaScript engines).\n \n @name groupBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n * @example\n \n async.groupBy(['userId1', 'userId2', 'userId3'], function(userId, callback) {\n * db.findById(userId, function(err, user) {\n * if (err) return callback(err);\n * return callback(null, user.age);\n * });\n * }, function(err, result) {\n * // result is object containing the userIds grouped by age\n * // e.g. { 30: ['userId1', 'userId3'], 42: ['userId2']};\n * });\n /\nvar groupBy = doLimit(groupByLimit, Infinity);\n\n/\n The same as [`groupBy`]{@link module:Collections.groupBy} but runs only a single async operation at a time.\n \n @name groupBySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n /\nvar groupBySeries = doLimit(groupByLimit, 1);\n\n/\n Logs the result of an `async` function to the `console`. Only works in\n * Node.js or in browsers that support `console.log` and `console.error` (such\n * as FF and Chrome). If multiple arguments are returned from the async\n * function, `console.log` is called on each argument in order.\n \n @name log\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...} arguments... - Any number of arguments to apply to the function.\n @example\n \n // in a module\n * var hello = function(name, callback) {\n * setTimeout(function() {\n * callback(null, 'hello ' + name);\n * }, 1000);\n * };\n \n // in the node repl\n * node> async.log(hello, 'world');\n * 'hello world'\n /\nvar log = consoleFunc('log');\n\n/\n The same as [`mapValues`]{@link module:Collections.mapValues} but runs a maximum of `limit` async operations at a\n * time.\n \n @name mapValuesLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n /\nfunction mapValuesLimit(obj, limit, iteratee, callback) {\n callback = once(callback \|\| noop);\n var newObj = {};\n var _iteratee = wrapAsync(iteratee);\n eachOfLimit(obj, limit, function(val, key, next) {\n _iteratee(val, key, function (err, result) {\n if (err) return next(err);\n newObj[key] = result;\n next();\n });\n }, function (err) {\n callback(err, newObj);\n });\n}\n\n/\n A relative of [`map`]{@link module:Collections.map}, designed for use with objects.\n \n Produces a new Object by mapping each value of `obj` through the `iteratee`\n * function. The `iteratee` is called each `value` and `key` from `obj` and a\n * callback for when it has finished processing. Each of these callbacks takes\n * two arguments: an `error`, and the transformed item from `obj`. If `iteratee`\n * passes an error to its callback, the main `callback` (for the `mapValues`\n * function) is immediately called with the error.\n \n Note, the order of the keys in the result is not guaranteed. The keys will\n * be roughly in the order they complete, (but this is very engine-specific)\n \n @name mapValues\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @example\n \n async.mapValues({\n * f1: 'file1',\n * f2: 'file2',\n * f3: 'file3'\n * }, function (file, key, callback) {\n * fs.stat(file, callback);\n * }, function(err, result) {\n * // result is now a map of stats for each file, e.g.\n * // {\n * // f1: [stats for file1],\n * // f2: [stats for file2],\n * // f3: [stats for file3]\n * // }\n * });\n /\n\nvar mapValues = doLimit(mapValuesLimit, Infinity);\n\n/\n The same as [`mapValues`]{@link module:Collections.mapValues} but runs only a single async operation at a time.\n \n @name mapValuesSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n /\nvar mapValuesSeries = doLimit(mapValuesLimit, 1);\n\nfunction has(obj, key) {\n return key in obj;\n}\n\n/\n Caches the results of an async function. When creating a hash to store\n * function results against, the callback is omitted from the hash and an\n * optional hash function can be used.\n \n If no hash function is specified, the first argument is used as a hash key,\n * which may work reasonably if it is a string or a data type that converts to a\n * distinct string. Note that objects and arrays will not behave reasonably.\n * Neither will cases where the other arguments are significant. In such cases,\n * specify your own hash function.\n \n The cache of results is exposed as the `memo` property of the function\n * returned by `memoize`.\n \n @name memoize\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function to proxy and cache results from.\n * @param {Function} hasher - An optional function for generating a custom hash\n * for storing results. It has all the arguments applied to it apart from the\n * callback, and must be synchronous.\n * @returns {AsyncFunction} a memoized version of `fn`\n * @example\n \n var slow_fn = function(name, callback) {\n * // do something\n * callback(null, result);\n * };\n * var fn = async.memoize(slow_fn);\n \n // fn can now be used as if it were slow_fn\n * fn('some name', function() {\n * // callback\n * });\n /\nfunction memoize(fn, hasher) {\n var memo = Object.create(null);\n var queues = Object.create(null);\n hasher = hasher \|\| identity;\n var _fn = wrapAsync(fn);\n var memoized = initialParams(function memoized(args, callback) {\n var key = hasher.apply(null, args);\n if (has(memo, key)) {\n setImmediate$1(function() {\n callback.apply(null, memo[key]);\n });\n } else if (has(queues, key)) {\n queues[key].push(callback);\n } else {\n queues[key] = [callback];\n _fn.apply(null, args.concat(function(/args/) {\n var args = slice(arguments);\n memo[key] = args;\n var q = queues[key];\n delete queues[key];\n for (var i = 0, l = q.length; i < l; i++) {\n q[i].apply(null, args);\n }\n }));\n }\n });\n memoized.memo = memo;\n memoized.unmemoized = fn;\n return memoized;\n}\n\n/\n Calls `callback` on a later loop around the event loop. In Node.js this just\n * calls `process.nextTick`. In the browser it will use `setImmediate` if\n * available, otherwise `setTimeout(callback, 0)`, which means other higher\n * priority events may precede the execution of `callback`.\n \n This is used internally for browser-compatibility purposes.\n \n @name nextTick\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.setImmediate]{@link module:Utils.setImmediate}\n * @category Util\n * @param {Function} callback - The function to call on a later loop around\n * the event loop. Invoked with (args...).\n * @param {...} args... - any number of additional arguments to pass to the\n callback on the next tick.\n * @example\n \n var call_order = [];\n * async.nextTick(function() {\n * call_order.push('two');\n * // call_order now equals ['one','two']\n * });\n * call_order.push('one');\n \n async.setImmediate(function (a, b, c) {\n * // a, b, and c equal 1, 2, and 3\n * }, 1, 2, 3);\n /\nvar _defer$1;\n\nif (hasNextTick) {\n _defer$1 = process.nextTick;\n} else if (hasSetImmediate) {\n _defer$1 = setImmediate;\n} else {\n _defer$1 = fallback;\n}\n\nvar nextTick = wrap(_defer$1);\n\nfunction _parallel(eachfn, tasks, callback) {\n callback = callback \|\| noop;\n var results = isArrayLike(tasks) ? [] : {};\n\n eachfn(tasks, function (task, key, callback) {\n wrapAsync(task)(function (err, result) {\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n }\n results[key] = result;\n callback(err);\n });\n }, function (err) {\n callback(err, results);\n });\n}\n\n/\n Run the `tasks` collection of functions in parallel, without waiting until\n * the previous function has completed. If any of the functions pass an error to\n * its callback, the main `callback` is immediately called with the value of the\n * error. Once the `tasks` have completed, the results are passed to the final\n * `callback` as an array.\n \n Note: `parallel` is about kicking-off I/O tasks in parallel, not about\n * parallel execution of code. If your tasks do not use any timers or perform\n * any I/O, they will actually be executed in series. Any synchronous setup\n * sections for each task will happen one after the other. JavaScript remains\n * single-threaded.\n \n Hint: Use [`reflect`]{@link module:Utils.reflect} to continue the\n * execution of other tasks when a task fails.\n \n It is also possible to use an object instead of an array. Each property will\n * be run as a function and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.parallel}.\n \n @name parallel\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n \n @example\n * async.parallel([\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * // the results array will equal ['one','two'] even though\n * // the second function had a shorter timeout.\n * });\n \n // an example using an object instead of an array\n * async.parallel({\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 1);\n * }, 200);\n * },\n * two: function(callback) {\n * setTimeout(function() {\n * callback(null, 2);\n * }, 100);\n * }\n * }, function(err, results) {\n * // results is now equals to: {one: 1, two: 2}\n * });\n /\nfunction parallelLimit(tasks, callback) {\n _parallel(eachOf, tasks, callback);\n}\n\n/\n The same as [`parallel`]{@link module:ControlFlow.parallel} but runs a maximum of `limit` async operations at a\n * time.\n \n @name parallelLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.parallel]{@link module:ControlFlow.parallel}\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n /\nfunction parallelLimit$1(tasks, limit, callback) {\n _parallel(_eachOfLimit(limit), tasks, callback);\n}\n\n/\n A queue of tasks for the worker function to complete.\n * @typedef {Object} QueueObject\n * @memberOf module:ControlFlow\n * @property {Function} length - a function returning the number of items\n * waiting to be processed. Invoke with `queue.length()`.\n * @property {boolean} started - a boolean indicating whether or not any\n * items have been pushed and processed by the queue.\n * @property {Function} running - a function returning the number of items\n * currently being processed. Invoke with `queue.running()`.\n * @property {Function} workersList - a function returning the array of items\n * currently being processed. Invoke with `queue.workersList()`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke with `queue.idle()`.\n * @property {number} concurrency - an integer for determining how many `worker`\n * functions should be run in parallel. This property can be changed after a\n * `queue` is created to alter the concurrency on-the-fly.\n * @property {Function} push - add a new task to the `queue`. Calls `callback`\n * once the `worker` has finished processing the task. Instead of a single task,\n * a `tasks` array can be submitted. The respective callback is used for every\n * task in the list. Invoke with `queue.push(task, [callback])`,\n * @property {Function} unshift - add a new task to the front of the `queue`.\n * Invoke with `queue.unshift(task, [callback])`.\n * @property {Function} remove - remove items from the queue that match a test\n * function. The test function will be passed an object with a `data` property,\n * and a `priority` property, if this is a\n * [priorityQueue]{@link module:ControlFlow.priorityQueue} object.\n * Invoked with `queue.remove(testFn)`, where `testFn` is of the form\n * `function ({data, priority}) {}` and returns a Boolean.\n * @property {Function} saturated - a callback that is called when the number of\n * running workers hits the `concurrency` limit, and further tasks will be\n * queued.\n * @property {Function} unsaturated - a callback that is called when the number\n * of running workers is less than the `concurrency` & `buffer` limits, and\n * further tasks will not be queued.\n * @property {number} buffer - A minimum threshold buffer in order to say that\n * the `queue` is `unsaturated`.\n * @property {Function} empty - a callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - a callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} error - a callback that is called when a task errors.\n * Has the signature `function(error, task)`.\n * @property {boolean} paused - a boolean for determining whether the queue is\n * in a paused state.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke with `queue.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke with `queue.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. No more tasks\n * should be pushed to the queue after calling this function. Invoke with `queue.kill()`.\n /\n\n/\n Creates a `queue` object with the specified `concurrency`. Tasks added to the\n * `queue` are processed in parallel (up to the `concurrency` limit). If all\n * `worker`s are in progress, the task is queued until one becomes available.\n * Once a `worker` completes a `task`, that `task`'s callback is called.\n \n @name queue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`. Invoked with (task, callback).\n * @param {number} [concurrency=1] - An `integer` for determining how many\n * `worker` functions should be run in parallel. If omitted, the concurrency\n * defaults to `1`. If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A queue object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the queue.\n * @example\n \n // create a queue object with concurrency 2\n * var q = async.queue(function(task, callback) {\n * console.log('hello ' + task.name);\n * callback();\n * }, 2);\n \n // assign a callback\n * q.drain = function() {\n * console.log('all items have been processed');\n * };\n \n // add some items to the queue\n * q.push({name: 'foo'}, function(err) {\n * console.log('finished processing foo');\n * });\n * q.push({name: 'bar'}, function (err) {\n * console.log('finished processing bar');\n * });\n \n // add some items to the queue (batch-wise)\n * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {\n * console.log('finished processing item');\n * });\n \n // add some items to the front of the queue\n * q.unshift({name: 'bar'}, function (err) {\n * console.log('finished processing bar');\n * });\n /\nvar queue$1 = function (worker, concurrency) {\n var _worker = wrapAsync(worker);\n return queue(function (items, cb) {\n _worker(items[0], cb);\n }, concurrency, 1);\n};\n\n/\n The same as [async.queue]{@link module:ControlFlow.queue} only tasks are assigned a priority and\n * completed in ascending priority order.\n \n @name priorityQueue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`.\n * Invoked with (task, callback).\n * @param {number} concurrency - An `integer` for determining how many `worker`\n * functions should be run in parallel. If omitted, the concurrency defaults to\n * `1`. If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A priorityQueue object to manage the tasks. There are two\n * differences between `queue` and `priorityQueue` objects:\n * * `push(task, priority, [callback])` - `priority` should be a number. If an\n * array of `tasks` is given, all tasks will be assigned the same priority.\n * * The `unshift` method was removed.\n /\nvar priorityQueue = function(worker, concurrency) {\n // Start with a normal queue\n var q = queue$1(worker, concurrency);\n\n // Override push to accept second parameter representing priority\n q.push = function(data, priority, callback) {\n if (callback == null) callback = noop;\n if (typeof callback !== 'function') {\n throw new Error('task callback must be a function');\n }\n q.started = true;\n if (!isArray(data)) {\n data = [data];\n }\n if (data.length === 0) {\n // call drain immediately if there are no tasks\n return setImmediate$1(function() {\n q.drain();\n });\n }\n\n priority = priority \|\| 0;\n var nextNode = q._tasks.head;\n while (nextNode && priority >= nextNode.priority) {\n nextNode = nextNode.next;\n }\n\n for (var i = 0, l = data.length; i < l; i++) {\n var item = {\n data: data[i],\n priority: priority,\n callback: callback\n };\n\n if (nextNode) {\n q._tasks.insertBefore(nextNode, item);\n } else {\n q._tasks.push(item);\n }\n }\n setImmediate$1(q.process);\n };\n\n // Remove unshift function\n delete q.unshift;\n\n return q;\n};\n\n/\n Runs the `tasks` array of functions in parallel, without waiting until the\n * previous function has completed. Once any of the `tasks` complete or pass an\n * error to its callback, the main `callback` is immediately called. It's\n * equivalent to `Promise.race()`.\n \n @name race\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array containing [async functions]{@link AsyncFunction}\n * to run. Each function can complete with an optional `result` value.\n * @param {Function} callback - A callback to run once any of the functions have\n * completed. This function gets an error or result from the first function that\n * completed. Invoked with (err, result).\n * @returns undefined\n * @example\n \n async.race([\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ],\n * // main callback\n * function(err, result) {\n * // the result will be equal to 'two' as it finishes earlier\n * });\n /\nfunction race(tasks, callback) {\n callback = once(callback \|\| noop);\n if (!isArray(tasks)) return callback(new TypeError('First argument to race must be an array of functions'));\n if (!tasks.length) return callback();\n for (var i = 0, l = tasks.length; i < l; i++) {\n wrapAsync(tasks[i])(callback);\n }\n}\n\n/\n Same as [`reduce`]{@link module:Collections.reduce}, only operates on `array` in reverse order.\n \n @name reduceRight\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reduce]{@link module:Collections.reduce}\n * @alias foldr\n * @category Collection\n * @param {Array} array - A collection to iterate over.\n * @param {} memo - The initial state of the reduction.\n @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n /\nfunction reduceRight (array, memo, iteratee, callback) {\n var reversed = slice(array).reverse();\n reduce(reversed, memo, iteratee, callback);\n}\n\n/\n Wraps the async function in another function that always completes with a\n * result object, even when it errors.\n \n The result object has either the property `error` or `value`.\n \n @name reflect\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function you want to wrap\n * @returns {Function} - A function that always passes null to it's callback as\n * the error. The second argument to the callback will be an `object` with\n * either an `error` or a `value` property.\n * @example\n \n async.parallel([\n * async.reflect(function(callback) {\n * // do some stuff ...\n * callback(null, 'one');\n * }),\n * async.reflect(function(callback) {\n * // do some more stuff but error ...\n * callback('bad stuff happened');\n * }),\n * async.reflect(function(callback) {\n * // do some more stuff ...\n * callback(null, 'two');\n * })\n * ],\n * // optional callback\n * function(err, results) {\n * // values\n * // results[0].value = 'one'\n * // results[1].error = 'bad stuff happened'\n * // results[2].value = 'two'\n * });\n /\nfunction reflect(fn) {\n var _fn = wrapAsync(fn);\n return initialParams(function reflectOn(args, reflectCallback) {\n args.push(function callback(error, cbArg) {\n if (error) {\n reflectCallback(null, { error: error });\n } else {\n var value;\n if (arguments.length <= 2) {\n value = cbArg;\n } else {\n value = slice(arguments, 1);\n }\n reflectCallback(null, { value: value });\n }\n });\n\n return _fn.apply(this, args);\n });\n}\n\n/\n A helper function that wraps an array or an object of functions with `reflect`.\n \n @name reflectAll\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.reflect]{@link module:Utils.reflect}\n * @category Util\n * @param {Array\|Object\|Iterable} tasks - The collection of\n * [async functions]{@link AsyncFunction} to wrap in `async.reflect`.\n * @returns {Array} Returns an array of async functions, each wrapped in\n * `async.reflect`\n * @example\n \n let tasks = [\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * function(callback) {\n * // do some more stuff but error ...\n * callback(new Error('bad stuff happened'));\n * },\n * function(callback) {\n * setTimeout(function() {\n * callback(null, 'two');\n * }, 100);\n * }\n * ];\n \n async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n * // values\n * // results[0].value = 'one'\n * // results[1].error = Error('bad stuff happened')\n * // results[2].value = 'two'\n * });\n \n // an example using an object instead of an array\n * let tasks = {\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 'one');\n * }, 200);\n * },\n * two: function(callback) {\n * callback('two');\n * },\n * three: function(callback) {\n * setTimeout(function() {\n * callback(null, 'three');\n * }, 100);\n * }\n * };\n \n async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n * // values\n * // results.one.value = 'one'\n * // results.two.error = 'two'\n * // results.three.value = 'three'\n * });\n /\nfunction reflectAll(tasks) {\n var results;\n if (isArray(tasks)) {\n results = arrayMap(tasks, reflect);\n } else {\n results = {};\n baseForOwn(tasks, function(task, key) {\n results[key] = reflect.call(this, task);\n });\n }\n return results;\n}\n\nfunction reject$1(eachfn, arr, iteratee, callback) {\n _filter(eachfn, arr, function(value, cb) {\n iteratee(value, function(err, v) {\n cb(err, !v);\n });\n }, callback);\n}\n\n/\n The opposite of [`filter`]{@link module:Collections.filter}. Removes values that pass an `async` truth test.\n \n @name reject\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n \n async.reject(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, results) {\n * // results now equals an array of missing files\n * createFiles(results);\n * });\n /\nvar reject = doParallel(reject$1);\n\n/\n The same as [`reject`]{@link module:Collections.reject} but runs a maximum of `limit` async operations at a\n * time.\n \n @name rejectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar rejectLimit = doParallelLimit(reject$1);\n\n/\n The same as [`reject`]{@link module:Collections.reject} but runs only a single async operation at a time.\n \n @name rejectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n /\nvar rejectSeries = doLimit(rejectLimit, 1);\n\n/\n Creates a function that returns `value`.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {} value The value to return from the new function.\n @returns {Function} Returns the new constant function.\n * @example\n \n var objects = _.times(2, _.constant({ 'a': 1 }));\n \n console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n \n console.log(objects[0] === objects[1]);\n * // => true\n /\nfunction constant$1(value) {\n return function() {\n return value;\n };\n}\n\n/\n Attempts to get a successful response from `task` no more than `times` times\n * before returning an error. If the task is successful, the `callback` will be\n * passed the result of the successful task. If all attempts fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n \n @name retry\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @see [async.retryable]{@link module:ControlFlow.retryable}\n * @param {Object\|number} [opts = {times: 5, interval: 0}\| 5] - Can be either an\n * object with `times` and `interval` or a number.\n * * `times` - The number of attempts to make before giving up. The default\n * is `5`.\n * * `interval` - The time to wait between retries, in milliseconds. The\n * default is `0`. The interval may also be specified as a function of the\n * retry count (see example).\n * * `errorFilter` - An optional synchronous function that is invoked on\n * erroneous result. If it returns `true` the retry attempts will continue;\n * if the function returns `false` the retry flow is aborted with the current\n * attempt's error and result being returned to the final callback.\n * Invoked with (err).\n * * If `opts` is a number, the number specifies the number of times to retry,\n * with the default interval of `0`.\n * @param {AsyncFunction} task - An async function to retry.\n * Invoked with (callback).\n * @param {Function} [callback] - An optional callback which is called when the\n * task has succeeded, or after the final failed attempt. It receives the `err`\n * and `result` arguments of the last attempt at completing the `task`. Invoked\n * with (err, results).\n \n @example\n \n // The `retry` function can be used as a stand-alone control flow by passing\n * // a callback, as shown below:\n \n // try calling apiMethod 3 times\n * async.retry(3, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod 3 times, waiting 200 ms between each retry\n * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod 10 times with exponential backoff\n * // (i.e. intervals of 100, 200, 400, 800, 1600, ... milliseconds)\n * async.retry({\n * times: 10,\n * interval: function(retryCount) {\n * return 50 * Math.pow(2, retryCount);\n * }\n * }, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod the default 5 times no delay between each retry\n * async.retry(apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // try calling apiMethod only when error condition satisfies, all other\n * // errors will abort the retry control flow and return to final callback\n * async.retry({\n * errorFilter: function(err) {\n * return err.message === 'Temporary error'; // only retry on a specific error\n * }\n * }, apiMethod, function(err, result) {\n * // do something with the result\n * });\n \n // to retry individual methods that are not as reliable within other\n * // control flow functions, use the `retryable` wrapper:\n * async.auto({\n * users: api.getUsers.bind(api),\n * payments: async.retryable(3, api.getPayments.bind(api))\n * }, function(err, results) {\n * // do something with the results\n * });\n \n /\nfunction retry(opts, task, callback) {\n var DEFAULT_TIMES = 5;\n var DEFAULT_INTERVAL = 0;\n\n var options = {\n times: DEFAULT_TIMES,\n intervalFunc: constant$1(DEFAULT_INTERVAL)\n };\n\n function parseTimes(acc, t) {\n if (typeof t === 'object') {\n acc.times = +t.times \|\| DEFAULT_TIMES;\n\n acc.intervalFunc = typeof t.interval === 'function' ?\n t.interval :\n constant$1(+t.interval \|\| DEFAULT_INTERVAL);\n\n acc.errorFilter = t.errorFilter;\n } else if (typeof t === 'number' \|\| typeof t === 'string') {\n acc.times = +t \|\| DEFAULT_TIMES;\n } else {\n throw new Error(\"Invalid arguments for async.retry\");\n }\n }\n\n if (arguments.length < 3 && typeof opts === 'function') {\n callback = task \|\| noop;\n task = opts;\n } else {\n parseTimes(options, opts);\n callback = callback \|\| noop;\n }\n\n if (typeof task !== 'function') {\n throw new Error(\"Invalid arguments for async.retry\");\n }\n\n var _task = wrapAsync(task);\n\n var attempt = 1;\n function retryAttempt() {\n _task(function(err) {\n if (err && attempt++ < options.times &&\n (typeof options.errorFilter != 'function' \|\|\n options.errorFilter(err))) {\n setTimeout(retryAttempt, options.intervalFunc(attempt));\n } else {\n callback.apply(null, arguments);\n }\n });\n }\n\n retryAttempt();\n}\n\n/*\n A close relative of [`retry`]{@link module:ControlFlow.retry}. This method\n * wraps a task and makes it retryable, rather than immediately calling it\n * with retries.\n \n @name retryable\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.retry]{@link module:ControlFlow.retry}\n * @category Control Flow\n * @param {Object\|number} [opts = {times: 5, interval: 0}\| 5] - optional\n * options, exactly the same as from `retry`\n * @param {AsyncFunction} task - the asynchronous function to wrap.\n * This function will be passed any arguments passed to the returned wrapper.\n * Invoked with (...args, callback).\n * @returns {AsyncFunction} The wrapped function, which when invoked, will\n * retry on an error, based on the parameters specified in `opts`.\n * This function will accept the same parameters as `task`.\n * @example\n \n async.auto({\n * dep1: async.retryable(3, getFromFlakyService),\n * process: [\"dep1\", async.retryable(3, function (results, cb) {\n * maybeProcessData(results.dep1, cb);\n * })]\n * }, callback);\n /\nvar retryable = function (opts, task) {\n if (!task) {\n task = opts;\n opts = null;\n }\n var _task = wrapAsync(task);\n return initialParams(function (args, callback) {\n function taskFn(cb) {\n _task.apply(null, args.concat(cb));\n }\n\n if (opts) retry(opts, taskFn, callback);\n else retry(taskFn, callback);\n\n });\n};\n\n/\n Run the functions in the `tasks` collection in series, each one running once\n * the previous function has completed. If any functions in the series pass an\n * error to its callback, no more functions are run, and `callback` is\n * immediately called with the value of the error. Otherwise, `callback`\n * receives an array of results when `tasks` have completed.\n \n It is also possible to use an object instead of an array. Each property will\n * be run as a function, and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.series}.\n \n Note that while many implementations preserve the order of object\n * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)\n * explicitly states that\n \n > The mechanics and order of enumerating the properties is not specified.\n \n So if you rely on the order in which your series of functions are executed,\n * and want this to work on all platforms, consider using an array.\n \n @name series\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection containing\n * [async functions]{@link AsyncFunction} to run in series.\n * Each function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This function gets a results array (or object)\n * containing all the result arguments passed to the `task` callbacks. Invoked\n * with (err, result).\n * @example\n * async.series([\n * function(callback) {\n * // do some stuff ...\n * callback(null, 'one');\n * },\n * function(callback) {\n * // do some more stuff ...\n * callback(null, 'two');\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * // results is now equal to ['one', 'two']\n * });\n \n async.series({\n * one: function(callback) {\n * setTimeout(function() {\n * callback(null, 1);\n * }, 200);\n * },\n * two: function(callback){\n * setTimeout(function() {\n * callback(null, 2);\n * }, 100);\n * }\n * }, function(err, results) {\n * // results is now equal to: {one: 1, two: 2}\n * });\n /\nfunction series(tasks, callback) {\n _parallel(eachOfSeries, tasks, callback);\n}\n\n/\n Returns `true` if at least one element in the `coll` satisfies an async test.\n * If any iteratee call returns `true`, the main `callback` is immediately\n * called.\n \n @name some\n * @static\n * @memberOf module:Collections\n * @method\n * @alias any\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @example\n \n async.some(['file1','file2','file3'], function(filePath, callback) {\n * fs.access(filePath, function(err) {\n * callback(null, !err)\n * });\n * }, function(err, result) {\n * // if result is true then at least one of the files exists\n * });\n /\nvar some = doParallel(_createTester(Boolean, identity));\n\n/\n The same as [`some`]{@link module:Collections.some} but runs a maximum of `limit` async operations at a time.\n \n @name someLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anyLimit\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n /\nvar someLimit = doParallelLimit(_createTester(Boolean, identity));\n\n/\n The same as [`some`]{@link module:Collections.some} but runs only a single async operation at a time.\n \n @name someSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anySeries\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in series.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n /\nvar someSeries = doLimit(someLimit, 1);\n\n/\n Sorts a list by the results of running each `coll` value through an async\n * `iteratee`.\n \n @name sortBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a value to use as the sort criteria as\n * its `result`.\n * Invoked with (item, callback).\n * @param {Function} callback - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is the items\n * from the original `coll` sorted by the values returned by the `iteratee`\n * calls. Invoked with (err, results).\n * @example\n \n async.sortBy(['file1','file2','file3'], function(file, callback) {\n * fs.stat(file, function(err, stats) {\n * callback(err, stats.mtime);\n * });\n * }, function(err, results) {\n * // results is now the original array of files sorted by\n * // modified date\n * });\n \n // By modifying the callback parameter the\n * // sorting order can be influenced:\n \n // ascending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n * callback(null, x);\n * }, function(err,result) {\n * // result callback\n * });\n \n // descending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n * callback(null, x-1); //<- x-1 instead of x, turns the order around\n * }, function(err,result) {\n * // result callback\n * });\n /\nfunction sortBy (coll, iteratee, callback) {\n var _iteratee = wrapAsync(iteratee);\n map(coll, function (x, callback) {\n _iteratee(x, function (err, criteria) {\n if (err) return callback(err);\n callback(null, {value: x, criteria: criteria});\n });\n }, function (err, results) {\n if (err) return callback(err);\n callback(null, arrayMap(results.sort(comparator), baseProperty('value')));\n });\n\n function comparator(left, right) {\n var a = left.criteria, b = right.criteria;\n return a < b ? -1 : a > b ? 1 : 0;\n }\n}\n\n/\n Sets a time limit on an asynchronous function. If the function does not call\n * its callback within the specified milliseconds, it will be called with a\n * timeout error. The code property for the error object will be `'ETIMEDOUT'`.\n \n @name timeout\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} asyncFn - The async function to limit in time.\n * @param {number} milliseconds - The specified time limit.\n * @param {} [info] - Any variable you want attached (`string`, `object`, etc)\n to timeout Error for more information..\n * @returns {AsyncFunction} Returns a wrapped function that can be used with any\n * of the control flow functions.\n * Invoke this function with the same parameters as you would `asyncFunc`.\n * @example\n \n function myFunction(foo, callback) {\n * doAsyncTask(foo, function(err, data) {\n * // handle errors\n * if (err) return callback(err);\n \n // do some stuff ...\n \n // return processed data\n * return callback(null, data);\n * });\n * }\n \n var wrapped = async.timeout(myFunction, 1000);\n \n // call `wrapped` as you would `myFunction`\n * wrapped({ bar: 'bar' }, function(err, data) {\n * // if `myFunction` takes < 1000 ms to execute, `err`\n * // and `data` will have their expected values\n \n // else `err` will be an Error with the code 'ETIMEDOUT'\n * });\n /\nfunction timeout(asyncFn, milliseconds, info) {\n var fn = wrapAsync(asyncFn);\n\n return initialParams(function (args, callback) {\n var timedOut = false;\n var timer;\n\n function timeoutCallback() {\n var name = asyncFn.name \|\| 'anonymous';\n var error = new Error('Callback function \"' + name + '\" timed out.');\n error.code = 'ETIMEDOUT';\n if (info) {\n error.info = info;\n }\n timedOut = true;\n callback(error);\n }\n\n args.push(function () {\n if (!timedOut) {\n callback.apply(null, arguments);\n clearTimeout(timer);\n }\n });\n\n // setup timer and call original function\n timer = setTimeout(timeoutCallback, milliseconds);\n fn.apply(null, args);\n });\n}\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeCeil = Math.ceil;\nvar nativeMax = Math.max;\n\n/\n The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n \n @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n /\nfunction baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step \|\| 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n}\n\n/\n The same as [times]{@link module:ControlFlow.times} but runs a maximum of `limit` async operations at a\n * time.\n \n @name timesLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} count - The number of times to run the function.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see [async.map]{@link module:Collections.map}.\n /\nfunction timeLimit(count, limit, iteratee, callback) {\n var _iteratee = wrapAsync(iteratee);\n mapLimit(baseRange(0, count, 1), limit, _iteratee, callback);\n}\n\n/\n Calls the `iteratee` function `n` times, and accumulates results in the same\n * manner you would use with [map]{@link module:Collections.map}.\n \n @name times\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n * @example\n \n // Pretend this is some complicated async factory\n * var createUser = function(id, callback) {\n * callback(null, {\n * id: 'user' + id\n * });\n * };\n \n // generate 5 users\n * async.times(5, function(n, next) {\n * createUser(n, function(err, user) {\n * next(err, user);\n * });\n * }, function(err, users) {\n * // we should now have 5 users\n * });\n /\nvar times = doLimit(timeLimit, Infinity);\n\n/\n The same as [times]{@link module:ControlFlow.times} but runs only a single async operation at a time.\n \n @name timesSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n /\nvar timesSeries = doLimit(timeLimit, 1);\n\n/\n A relative of `reduce`. Takes an Object or Array, and iterates over each\n * element in series, each step potentially mutating an `accumulator` value.\n * The type of the accumulator defaults to the type of collection passed in.\n \n @name transform\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array\|Iterable\|Object} coll - A collection to iterate over.\n * @param {} [accumulator] - The initial state of the transform. If omitted,\n it will default to an empty Object or Array, depending on the type of `coll`\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * collection that potentially modifies the accumulator.\n * Invoked with (accumulator, item, key, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the transformed accumulator.\n * Invoked with (err, result).\n * @example\n \n async.transform([1,2,3], function(acc, item, index, callback) {\n * // pointless async:\n * process.nextTick(function() {\n * acc.push(item * 2)\n * callback(null)\n * });\n * }, function(err, result) {\n * // result is now equal to [2, 4, 6]\n * });\n \n @example\n \n async.transform({a: 1, b: 2, c: 3}, function (obj, val, key, callback) {\n * setImmediate(function () {\n * obj[key] = val * 2;\n * callback();\n * })\n * }, function (err, result) {\n * // result is equal to {a: 2, b: 4, c: 6}\n * })\n /\nfunction transform (coll, accumulator, iteratee, callback) {\n if (arguments.length <= 3) {\n callback = iteratee;\n iteratee = accumulator;\n accumulator = isArray(coll) ? [] : {};\n }\n callback = once(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n\n eachOf(coll, function(v, k, cb) {\n _iteratee(accumulator, v, k, cb);\n }, function(err) {\n callback(err, accumulator);\n });\n}\n\n/\n It runs each task in series but stops whenever any of the functions were\n * successful. If one of the tasks were successful, the `callback` will be\n * passed the result of the successful task. If all tasks fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n \n @name tryEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array\|Iterable\|Object} tasks - A collection containing functions to\n * run, each function is passed a `callback(err, result)` it must call on\n * completion with an error `err` (which can be `null`) and an optional `result`\n * value.\n * @param {Function} [callback] - An optional callback which is called when one\n * of the tasks has succeeded, or all have failed. It receives the `err` and\n * `result` arguments of the last attempt at completing the `task`. Invoked with\n * (err, results).\n * @example\n * async.tryEach([\n * function getDataFromFirstWebsite(callback) {\n * // Try getting the data from the first website\n * callback(err, data);\n * },\n * function getDataFromSecondWebsite(callback) {\n * // First website failed,\n * // Try getting the data from the backup website\n * callback(err, data);\n * }\n * ],\n * // optional callback\n * function(err, results) {\n * Now do something with the data.\n * });\n \n /\nfunction tryEach(tasks, callback) {\n var error = null;\n var result;\n callback = callback \|\| noop;\n eachSeries(tasks, function(task, callback) {\n wrapAsync(task)(function (err, res/, ...args/) {\n if (arguments.length > 2) {\n result = slice(arguments, 1);\n } else {\n result = res;\n }\n error = err;\n callback(!err);\n });\n }, function () {\n callback(error, result);\n });\n}\n\n/*\n Undoes a [memoize]{@link module:Utils.memoize}d function, reverting it to the original,\n * unmemoized form. Handy for testing.\n \n @name unmemoize\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.memoize]{@link module:Utils.memoize}\n * @category Util\n * @param {AsyncFunction} fn - the memoized function\n * @returns {AsyncFunction} a function that calls the original unmemoized function\n /\nfunction unmemoize(fn) {\n return function () {\n return (fn.unmemoized \|\| fn).apply(null, arguments);\n };\n}\n\n/\n Repeatedly call `iteratee`, while `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs.\n \n @name whilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns undefined\n * @example\n \n var count = 0;\n * async.whilst(\n * function() { return count < 5; },\n * function(callback) {\n * count++;\n * setTimeout(function() {\n * callback(null, count);\n * }, 1000);\n * },\n * function (err, n) {\n * // 5 seconds have passed, n = 5\n * }\n * );\n /\nfunction whilst(test, iteratee, callback) {\n callback = onlyOnce(callback \|\| noop);\n var _iteratee = wrapAsync(iteratee);\n if (!test()) return callback(null);\n var next = function(err/, ...args/) {\n if (err) return callback(err);\n if (test()) return _iteratee(next);\n var args = slice(arguments, 1);\n callback.apply(null, [null].concat(args));\n };\n _iteratee(next);\n}\n\n/\n Repeatedly call `iteratee` until `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs. `callback` will be passed an error and any\n * arguments passed to the final `iteratee`'s callback.\n \n The inverse of [whilst]{@link module:ControlFlow.whilst}.\n \n @name until\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n /\nfunction until(test, iteratee, callback) {\n whilst(function() {\n return !test.apply(this, arguments);\n }, iteratee, callback);\n}\n\n/\n Runs the `tasks` array of functions in series, each passing their results to\n * the next in the array. However, if any of the `tasks` pass an error to their\n * own callback, the next function is not executed, and the main `callback` is\n * immediately called with the error.\n \n @name waterfall\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array of [async functions]{@link AsyncFunction}\n * to run.\n * Each function should complete with any number of `result` values.\n * The `result` values will be passed as arguments, in order, to the next task.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This will be passed the results of the last task's\n * callback. Invoked with (err, [results]).\n * @returns undefined\n * @example\n \n async.waterfall([\n * function(callback) {\n * callback(null, 'one', 'two');\n * },\n * function(arg1, arg2, callback) {\n * // arg1 now equals 'one' and arg2 now equals 'two'\n * callback(null, 'three');\n * },\n * function(arg1, callback) {\n * // arg1 now equals 'three'\n * callback(null, 'done');\n * }\n * ], function (err, result) {\n * // result now equals 'done'\n * });\n \n // Or, with named functions:\n * async.waterfall([\n * myFirstFunction,\n * mySecondFunction,\n * myLastFunction,\n * ], function (err, result) {\n * // result now equals 'done'\n * });\n * function myFirstFunction(callback) {\n * callback(null, 'one', 'two');\n * }\n * function mySecondFunction(arg1, arg2, callback) {\n * // arg1 now equals 'one' and arg2 now equals 'two'\n * callback(null, 'three');\n * }\n * function myLastFunction(arg1, callback) {\n * // arg1 now equals 'three'\n * callback(null, 'done');\n * }\n /\nvar waterfall = function(tasks, callback) {\n callback = once(callback \|\| noop);\n if (!isArray(tasks)) return callback(new Error('First argument to waterfall must be an array of functions'));\n if (!tasks.length) return callback();\n var taskIndex = 0;\n\n function nextTask(args) {\n var task = wrapAsync(tasks[taskIndex++]);\n args.push(onlyOnce(next));\n task.apply(null, args);\n }\n\n function next(err/, ...args/) {\n if (err \|\| taskIndex === tasks.length) {\n return callback.apply(null, arguments);\n }\n nextTask(slice(arguments, 1));\n }\n\n nextTask([]);\n};\n\n/\n An \"async function\" in the context of Async is an asynchronous function with\n * a variable number of parameters, with the final parameter being a callback.\n * (`function (arg1, arg2, ..., callback) {}`)\n * The final callback is of the form `callback(err, results...)`, which must be\n * called once the function is completed. The callback should be called with a\n * Error as its first argument to signal that an error occurred.\n * Otherwise, if no error occurred, it should be called with `null` as the first\n * argument, and any additional `result` arguments that may apply, to signal\n * successful completion.\n * The callback must be called exactly once, ideally on a later tick of the\n * JavaScript event loop.\n \n This type of function is also referred to as a \"Node-style async function\",\n * or a \"continuation passing-style function\" (CPS). Most of the methods of this\n * library are themselves CPS/Node-style async functions, or functions that\n * return CPS/Node-style async functions.\n \n Wherever we accept a Node-style async function, we also directly accept an\n * [ES2017 `async` function]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function}.\n * In this case, the `async` function will not be passed a final callback\n * argument, and any thrown error will be used as the `err` argument of the\n * implicit callback, and the return value will be used as the `result` value.\n * (i.e. a `rejected` of the returned Promise becomes the `err` callback\n * argument, and a `resolved` value becomes the `result`.)\n \n Note, due to JavaScript limitations, we can only detect native `async`\n * functions and not transpilied implementations.\n * Your environment must have `async`/`await` support for this to work.\n * (e.g. Node > v7.6, or a recent version of a modern browser).\n * If you are using `async` functions through a transpiler (e.g. Babel), you\n * must still wrap the function with [asyncify]{@link module:Utils.asyncify},\n * because the `async function` will be compiled to an ordinary function that\n * returns a promise.\n \n @typedef {Function} AsyncFunction\n * @static\n /\n\n/\n Async is a utility module which provides straight-forward, powerful functions\n * for working with asynchronous JavaScript. Although originally designed for\n * use with [Node.js](http://nodejs.org) and installable via\n * `npm install --save async`, it can also be used directly in the browser.\n * @module async\n * @see AsyncFunction\n /\n\n\n/\n A collection of `async` functions for manipulating collections, such as\n * arrays and objects.\n * @module Collections\n /\n\n/\n A collection of `async` functions for controlling the flow through a script.\n * @module ControlFlow\n /\n\n/\n A collection of `async` utility functions.\n * @module Utils\n /\n\nvar index = {\n apply: apply,\n applyEach: applyEach,\n applyEachSeries: applyEachSeries,\n asyncify: asyncify,\n auto: auto,\n autoInject: autoInject,\n cargo: cargo,\n compose: compose,\n concat: concat,\n concatLimit: concatLimit,\n concatSeries: concatSeries,\n constant: constant,\n detect: detect,\n detectLimit: detectLimit,\n detectSeries: detectSeries,\n dir: dir,\n doDuring: doDuring,\n doUntil: doUntil,\n doWhilst: doWhilst,\n during: during,\n each: eachLimit,\n eachLimit: eachLimit$1,\n eachOf: eachOf,\n eachOfLimit: eachOfLimit,\n eachOfSeries: eachOfSeries,\n eachSeries: eachSeries,\n ensureAsync: ensureAsync,\n every: every,\n everyLimit: everyLimit,\n everySeries: everySeries,\n filter: filter,\n filterLimit: filterLimit,\n filterSeries: filterSeries,\n forever: forever,\n groupBy: groupBy,\n groupByLimit: groupByLimit,\n groupBySeries: groupBySeries,\n log: log,\n map: map,\n mapLimit: mapLimit,\n mapSeries: mapSeries,\n mapValues: mapValues,\n mapValuesLimit: mapValuesLimit,\n mapValuesSeries: mapValuesSeries,\n memoize: memoize,\n nextTick: nextTick,\n parallel: parallelLimit,\n parallelLimit: parallelLimit$1,\n priorityQueue: priorityQueue,\n queue: queue$1,\n race: race,\n reduce: reduce,\n reduceRight: reduceRight,\n reflect: reflect,\n reflectAll: reflectAll,\n reject: reject,\n rejectLimit: rejectLimit,\n rejectSeries: rejectSeries,\n retry: retry,\n retryable: retryable,\n seq: seq,\n series: series,\n setImmediate: setImmediate$1,\n some: some,\n someLimit: someLimit,\n someSeries: someSeries,\n sortBy: sortBy,\n timeout: timeout,\n times: times,\n timesLimit: timeLimit,\n timesSeries: timesSeries,\n transform: transform,\n tryEach: tryEach,\n unmemoize: unmemoize,\n until: until,\n waterfall: waterfall,\n whilst: whilst,\n\n // aliases\n all: every,\n allLimit: everyLimit,\n allSeries: everySeries,\n any: some,\n anyLimit: someLimit,\n anySeries: someSeries,\n find: detect,\n findLimit: detectLimit,\n findSeries: detectSeries,\n forEach: eachLimit,\n forEachSeries: eachSeries,\n forEachLimit: eachLimit$1,\n forEachOf: eachOf,\n forEachOfSeries: eachOfSeries,\n forEachOfLimit: eachOfLimit,\n inject: reduce,\n foldl: reduce,\n foldr: reduceRight,\n select: filter,\n selectLimit: filterLimit,\n selectSeries: filterSeries,\n wrapSync: asyncify\n};\n\nexports['default'] = index;\nexports.apply = apply;\nexports.applyEach = applyEach;\nexports.applyEachSeries = applyEachSeries;\nexports.asyncify = asyncify;\nexports.auto = auto;\nexports.autoInject = autoInject;\nexports.cargo = cargo;\nexports.compose = compose;\nexports.concat = concat;\nexports.concatLimit = concatLimit;\nexports.concatSeries = concatSeries;\nexports.constant = constant;\nexports.detect = detect;\nexports.detectLimit = detectLimit;\nexports.detectSeries = detectSeries;\nexports.dir = dir;\nexports.doDuring = doDuring;\nexports.doUntil = doUntil;\nexports.doWhilst = doWhilst;\nexports.during = during;\nexports.each = eachLimit;\nexports.eachLimit = eachLimit$1;\nexports.eachOf = eachOf;\nexports.eachOfLimit = eachOfLimit;\nexports.eachOfSeries = eachOfSeries;\nexports.eachSeries = eachSeries;\nexports.ensureAsync = ensureAsync;\nexports.every = every;\nexports.everyLimit = everyLimit;\nexports.everySeries = everySeries;\nexports.filter = filter;\nexports.filterLimit = filterLimit;\nexports.filterSeries = filterSeries;\nexports.forever = forever;\nexports.groupBy = groupBy;\nexports.groupByLimit = groupByLimit;\nexports.groupBySeries = groupBySeries;\nexports.log = log;\nexports.map = map;\nexports.mapLimit = mapLimit;\nexports.mapSeries = mapSeries;\nexports.mapValues = mapValues;\nexports.mapValuesLimit = mapValuesLimit;\nexports.mapValuesSeries = mapValuesSeries;\nexports.memoize = memoize;\nexports.nextTick = nextTick;\nexports.parallel = parallelLimit;\nexports.parallelLimit = parallelLimit$1;\nexports.priorityQueue = priorityQueue;\nexports.queue = queue$1;\nexports.race = race;\nexports.reduce = reduce;\nexports.reduceRight = reduceRight;\nexports.reflect = reflect;\nexports.reflectAll = reflectAll;\nexports.reject = reject;\nexports.rejectLimit = rejectLimit;\nexports.rejectSeries = rejectSeries;\nexports.retry = retry;\nexports.retryable = retryable;\nexports.seq = seq;\nexports.series = series;\nexports.setImmediate = setImmediate$1;\nexports.some = some;\nexports.someLimit = someLimit;\nexports.someSeries = someSeries;\nexports.sortBy = sortBy;\nexports.timeout = timeout;\nexports.times = times;\nexports.timesLimit = timeLimit;\nexports.timesSeries = timesSeries;\nexports.transform = transform;\nexports.tryEach = tryEach;\nexports.unmemoize = unmemoize;\nexports.until = until;\nexports.waterfall = waterfall;\nexports.whilst = whilst;\nexports.all = every;\nexports.allLimit = everyLimit;\nexports.allSeries = everySeries;\nexports.any = some;\nexports.anyLimit = someLimit;\nexports.anySeries = someSeries;\nexports.find = detect;\nexports.findLimit = detectLimit;\nexports.findSeries = detectSeries;\nexports.forEach = eachLimit;\nexports.forEachSeries = eachSeries;\nexports.forEachLimit = eachLimit$1;\nexports.forEachOf = eachOf;\nexports.forEachOfSeries = eachOfSeries;\nexports.forEachOfLimit = eachOfLimit;\nexports.inject = reduce;\nexports.foldl = reduce;\nexports.foldr = reduceRight;\nexports.select = filter;\nexports.selectLimit = filterLimit;\nexports.selectSeries = filterSeries;\nexports.wrapSync = asyncify;\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","\n'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./zone-file.cjs.production.min.js')\n} else {\n module.exports = require('./zone-file.cjs.development.js')\n}\n","\"use strict\";function t(t,r){(null==r\|\|r>t.length)&&(r=t.length);for(var n=0,e=new Array(r);n<r;n++)e[n]=t[n];return e}function r(r,n){var e;if(\"undefined\"==typeof Symbol\|\|null==r[Symbol.iterator]){if(Array.isArray(r)\|\|(e=function(r,n){if(r){if(\"string\"==typeof r)return t(r,void 0);var e=Object.prototype.toString.call(r).slice(8,-1);return\"Object\"===e&&r.constructor&&(e=r.constructor.name),\"Map\"===e\|\|\"Set\"===e?Array.from(r):\"Arguments\"===e\|\|/^(?:Ui\|I)nt(?:8\|16\|32)(?:Clamped)?Array$/.test(e)?t(r,void 0):void 0}}(r))\|\|n&&r&&\"number\"==typeof r.length){e&&(r=e);var a=0;return function(){return a>=r.length?{done:!0}:{done:!1,value:r[a++]}}}throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\")}return(e=r[Symbol.iterator]()).next.bind(e)}function n(t,n){return void 0===n&&(n=\"{$origin}\\n{$ttl}\\n\\n; SOA Record\\n{name} {ttl} IN SOA {mname}{rname}(\\n{serial} ;serial\\n{refresh} ;refresh\\n{retry} ;retry\\n{expire} ;expire\\n{minimum} ;minimum ttl\\n)\\n\\n; NS Records\\n{ns}\\n\\n; MX Records\\n{mx}\\n\\n; A Records\\n{a}\\n\\n; AAAA Records\\n{aaaa}\\n\\n; CNAME Records\\n{cname}\\n\\n; PTR Records\\n{ptr}\\n\\n; TXT Records\\n{txt}\\n\\n; SRV Records\\n{srv}\\n\\n; SPF Records\\n{spf}\\n\\n; URI Records\\n{uri}\\n\"),n=function(t,r){var n=\"\";return void 0!==t&&(n+=\"$ORIGIN \"+t),r.replace(\"{$origin}\",n)}(t.$origin,n),n=function(t,r){var n=\"\";return void 0!==t&&(n+=\"$TTL \"+t),r.replace(\"{$ttl}\",n)}(t.$ttl,n),n=function(t,r){var n=r;if(void 0!==t)for(var e in t.name=t.name\|\|\"@\",t.ttl=t.ttl\|\|\"\",t)n=n.replace(\"{\"+e+\"}\",t[e]+\"\\t\");return n}(t.soa,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tNS\\t\"+s.host+\"\\n\"}return n.replace(\"{ns}\",e)}(t.ns,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tA\\t\"+s.ip+\"\\n\"}return n.replace(\"{a}\",e)}(t.a,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tAAAA\\t\"+s.ip+\"\\n\"}return n.replace(\"{aaaa}\",e)}(t.aaaa,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tCNAME\\t\"+s.alias+\"\\n\"}return n.replace(\"{cname}\",e)}(t.cname,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tMX\\t\"+s.preference+\"\\t\"+s.host+\"\\n\"}return n.replace(\"{mx}\",e)}(t.mx,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tPTR\\t\"+s.host+\"\\n\"}return n.replace(\"{ptr}\",e)}(t.ptr,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tTXT\\t\";var o=s.txt;\"string\"==typeof o?e+='\"'+o+'\"':o instanceof Array&&(e+=o.map((function(t){return'\"'+t+'\"'})).join(\" \")),e+=\"\\n\"}return n.replace(\"{txt}\",e)}(t.txt,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tSRV\\t\"+s.priority+\"\\t\",e+=s.weight+\"\\t\",e+=s.port+\"\\t\",e+=s.target+\"\\n\"}return n.replace(\"{srv}\",e)}(t.srv,n),n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tSPF\\t\"+s.data+\"\\n\"}return n.replace(\"{spf}\",e)}(t.spf,n),(n=function(t,r){r=(r=r.replace(\"{zone}\",t.$origin\|\|!!t.soa&&t.soa.name\|\|\"\")).replace(\"{datetime}\",(new Date).toISOString());var n=Math.round(Date.now()/1e3);return r.replace(\"{time}\",\"\"+n)}(t,n=function(t,n){var e=\"\";if(t)for(var a,i=r(t);!(a=i()).done;){var s=a.value;e+=(s.name\|\|\"@\")+\"\\t\",s.ttl&&(e+=s.ttl+\"\\t\"),e+=\"IN\\tURI\\t\"+s.priority+\"\\t\",e+=s.weight+\"\\t\",e+='\"'+s.target+'\"\\n'}return n.replace(\"{uri}\",e)}(t.uri,n))).replace(/\\n{2,}/gim,\"\\n\\n\")}function e(t){return function(t){for(var n,e={},g=r(t.split(\"\\n\"));!(n=g()).done;){var h=n.value;if(h&&h.trim()){var d=h.toUpperCase();/\\s+TXT\\s+/.test(d)?(e.txt=e.txt\|\|[],e.txt.push(u(h))):0===d.indexOf(\"$ORIGIN\")?e.$origin=h.split(/\\s+/g)[1]:0===d.indexOf(\"$TTL\")?e.$ttl=parseInt(h.split(/\\s+/g)[1],10):/\\s+SOA\\s+/.test(d)?e.soa=a(h):/\\s+NS\\s+/.test(d)?(e.ns=e.ns\|\|[],e.ns.push(i(h))):/\\s+A\\s+/.test(d)?(e.a=e.a\|\|[],e.a.push(s(h,e.a))):/\\s+AAAA\\s+/.test(d)?(e.aaaa=e.aaaa\|\|[],e.aaaa.push(o(h))):/\\s+CNAME\\s+/.test(d)?(e.cname=e.cname\|\|[],e.cname.push(l(h))):/\\s+MX\\s+/.test(d)?(e.mx=e.mx\|\|[],e.mx.push(p(h))):/\\s+PTR\\s+/.test(d)?(e.ptr=e.ptr\|\|[],e.ptr.push(c(h,e.ptr,e.$origin))):/\\s+SRV\\s+/.test(d)?(e.srv=e.srv\|\|[],e.srv.push(f(h))):/\\s+SPF\\s+/.test(d)?(e.spf=e.spf\|\|[],e.spf.push(m(h))):/\\s+URI\\s+/.test(d)&&(e.uri=e.uri\|\|[],e.uri.push(v(h)))}}return e}(t=function(t){for(var r=[],n=/\$[\\s\\S]?\$/gim,e=n.exec(t);null!==e;){var a=e[0].replace(/\\s+/gm,\" \");r.push({match:e,replacement:a}),e=n.exec(t)}for(var i=t.split(\"\"),s=0,o=r;s<o.length;s++){var l=o[s],p=l.match;i.splice(p.index,p[0].length,l.replacement)}return i.join(\"\").replace(/\$\|\$/gim,\" \")}(t=function(t){return t.replace(/(^\|[^\\\\]);./g,(function(t,r){return r\|\|\"\"}))}(t)))}function a(t){var r={},n=t.trim().split(/\\s+/g),e=n.length;return r.name=n[0],r.minimum=parseInt(n[e-1],10),r.expire=parseInt(n[e-2],10),r.retry=parseInt(n[e-3],10),r.refresh=parseInt(n[e-4],10),r.serial=parseInt(n[e-5],10),r.rname=n[e-6],r.mname=n[e-7],isNaN(n[1])\|\|(r.ttl=parseInt(n[1],10)),r}function i(t){var r=t.trim().split(/\\s+/g),n={name:r[0],host:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function s(t,r){var n=t.trim().split(/\\s+/g),e=t.trim().toUpperCase().split(/\\s+/g),a={name:n[0],ip:n[n.length-1]};return 0===e.lastIndexOf(\"A\")&&(a.name=r.length?r[r.length-1].name:\"@\"),isNaN(n[1])\|\|(a.ttl=parseInt(n[1],10)),a}function o(t){var r=t.trim().split(/\\s+/g),n={name:r[0],ip:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function l(t){var r=t.trim().split(/\\s+/g),n={name:r[0],alias:r[r.length-1]};return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function p(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],preference:parseInt(r[n-2],10),host:r[n-1]};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}function u(t){var r=t.trim().match(/[^\\s\"']+\|\"[^\"]\"\|'[^']'/g);if(!r)throw new Error(\"Failure to tokenize TXT record\");var n,e=r.length,a=r.indexOf(\"TXT\");function i(t){return t.indexOf('\"')>-1&&(t=t.split('\"')[1]),t}n=e-a-1>1?[].concat(r.slice(a+1).map(i)):i(r[e-1]);var s={name:r[0],txt:n};return isNaN(r[1])\|\|(s.ttl=parseInt(r[1],10)),s}function c(t,r,n){var e=t.trim().split(/\\s+/g);0===t.trim().toUpperCase().split(/\\s+/g).lastIndexOf(\"PTR\")&&r[r.length-1]&&e.unshift(r[r.length-1].name);var a={name:e[0],fullname:e[0]+\".\"+n,host:e[e.length-1]};return isNaN(e[1])\|\|(a.ttl=parseInt(e[1],10)),a}function f(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],target:r[n-1],priority:parseInt(r[n-4],10),weight:parseInt(r[n-3],10),port:parseInt(r[n-2],10)};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}function m(t){for(var r=t.trim().split(/\\s+/g),n={name:r[0],data:\"\"},e=r.length;e-- >4;)n.data=r[e]+\" \"+n.data.trim();return isNaN(r[1])\|\|(n.ttl=parseInt(r[1],10)),n}function v(t){var r=t.trim().split(/\\s+/g),n=r.length,e={name:r[0],target:r[n-1].replace(/\"/g,\"\"),priority:parseInt(r[n-3],10),weight:parseInt(r[n-2],10)};return isNaN(r[1])\|\|(e.ttl=parseInt(r[1],10)),e}exports.ZoneFile=function(){function t(t){this.jsonZoneFile=\"object\"==typeof t?JSON.parse(JSON.stringify(t)):\"string\"==typeof t?e(t):void 0}var r=t.prototype;return r.toJSON=function(){return this.jsonZoneFile},r.toString=function(){return n(this.toJSON())},t}(),exports.makeZoneFile=n,exports.parseZoneFile=e;\n//# sourceMappingURL=zone-file.cjs.production.min.js.map\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\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__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this \|\| new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\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};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","import { Logger } from './logger';\nexport const BLOCKSTACK_HANDLER = 'blockstack';\nexport function nextYear() {\n return new Date(new Date().setFullYear(new Date().getFullYear() + 1));\n}\nexport function nextMonth() {\n return new Date(new Date().setMonth(new Date().getMonth() + 1));\n}\nexport function nextHour() {\n return new Date(new Date().setHours(new Date().getHours() + 1));\n}\nexport function megabytesToBytes(megabytes) {\n if (!Number.isFinite(megabytes)) {\n return 0;\n }\n return Math.floor(megabytes 1024 * 1024);\n}\nexport function getAesCbcOutputLength(inputByteLength) {\n const cipherTextLength = (Math.floor(inputByteLength / 16) + 1) * 16;\n return cipherTextLength;\n}\nexport function getBase64OutputLength(inputByteLength) {\n const encodedLength = Math.ceil(inputByteLength / 3) * 4;\n return encodedLength;\n}\nexport function updateQueryStringParameter(uri, key, value) {\n const re = new RegExp(`([?&])${key}=.?(&\|$)`, 'i');\n const separator = uri.indexOf('?') !== -1 ? '&' : '?';\n if (uri.match(re)) {\n return uri.replace(re, `$1${key}=${value}$2`);\n }\n else {\n return `${uri}${separator}${key}=${value}`;\n }\n}\nexport function isLaterVersion(v1, v2) {\n if (v1 === undefined \|\| v1 === '') {\n v1 = '0.0.0';\n }\n if (v2 === undefined \|\| v1 === '') {\n v2 = '0.0.0';\n }\n const v1tuple = v1.split('.').map(x => parseInt(x, 10));\n const v2tuple = v2.split('.').map(x => parseInt(x, 10));\n for (let index = 0; index < v2.length; index++) {\n if (index >= v1.length) {\n v2tuple.push(0);\n }\n if (v1tuple[index] < v2tuple[index]) {\n return false;\n }\n }\n return true;\n}\nexport function makeUUID4() {\n let d = new Date().getTime();\n if (typeof performance !== 'undefined' && typeof performance.now === 'function') {\n d += performance.now();\n }\n return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, c => {\n const r = (d + Math.random() 16) % 16 \| 0;\n d = Math.floor(d / 16);\n return (c === 'x' ? r : (r & 0x3) \| 0x8).toString(16);\n });\n}\nexport function isSameOriginAbsoluteUrl(uri1, uri2) {\n try {\n const parsedUri1 = new URL(uri1);\n const parsedUri2 = new URL(uri2);\n const port1 = parseInt(parsedUri1.port \|\| '0', 10) \| 0 \|\| (parsedUri1.protocol === 'https:' ? 443 : 80);\n const port2 = parseInt(parsedUri2.port \|\| '0', 10) \| 0 \|\| (parsedUri2.protocol === 'https:' ? 443 : 80);\n const match = {\n scheme: parsedUri1.protocol === parsedUri2.protocol,\n hostname: parsedUri1.hostname === parsedUri2.hostname,\n port: port1 === port2,\n absolute: (uri1.includes('http://') \|\| uri1.includes('https://')) &&\n (uri2.includes('http://') \|\| uri2.includes('https://')),\n };\n return match.scheme && match.hostname && match.port && match.absolute;\n }\n catch (error) {\n console.log(error);\n console.log('Parsing error in same URL origin check');\n return false;\n }\n}\nexport function getGlobalScope() {\n if (typeof self !== 'undefined') {\n return self;\n }\n if (typeof window !== 'undefined') {\n return window;\n }\n if (typeof global !== 'undefined') {\n return global;\n }\n throw new Error('Unexpected runtime environment - no supported global scope (`window`, `self`, `global`) available');\n}\nfunction getAPIUsageErrorMessage(scopeObject, apiName, usageDesc) {\n if (usageDesc) {\n return `Use of '${usageDesc}' requires \\`${apiName}\\` which is unavailable on the '${scopeObject}' object within the currently executing environment.`;\n }\n else {\n return `\\`${apiName}\\` is unavailable on the '${scopeObject}' object within the currently executing environment.`;\n }\n}\nexport function getGlobalObject(name, { throwIfUnavailable, usageDesc, returnEmptyObject } = {}) {\n let globalScope = undefined;\n try {\n globalScope = getGlobalScope();\n if (globalScope) {\n const obj = globalScope[name];\n if (obj) {\n return obj;\n }\n }\n }\n catch (error) {\n Logger.error(`Error getting object '${name}' from global scope '${globalScope}': ${error}`);\n }\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n if (returnEmptyObject) {\n return {};\n }\n return undefined;\n}\nexport function getGlobalObjects(names, { throwIfUnavailable, usageDesc, returnEmptyObject } = {}) {\n let globalScope;\n try {\n globalScope = getGlobalScope();\n }\n catch (error) {\n Logger.error(`Error getting global scope: ${error}`);\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, names[0].toString(), usageDesc);\n Logger.error(errMsg);\n throw errMsg;\n }\n else if (returnEmptyObject) {\n globalScope = {};\n }\n }\n const result = {};\n for (let i = 0; i < names.length; i++) {\n const name = names[i];\n try {\n if (globalScope) {\n const obj = globalScope[name];\n if (obj) {\n result[name] = obj;\n }\n else if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n else if (returnEmptyObject) {\n result[name] = {};\n }\n }\n }\n catch (error) {\n if (throwIfUnavailable) {\n const errMsg = getAPIUsageErrorMessage(globalScope, name.toString(), usageDesc);\n Logger.error(errMsg);\n throw new Error(errMsg);\n }\n }\n }\n return result;\n}\nexport function intToBytes(value, byteLength) {\n return bigIntToBytes(intToBigInt(value), byteLength);\n}\nexport function intToBigInt(value) {\n if (typeof value === 'bigint')\n return value;\n if (typeof value === 'string')\n return BigInt(value);\n if (typeof value === 'number') {\n if (!Number.isInteger(value)) {\n throw new RangeError(`Invalid value. Values of type 'number' must be an integer.`);\n }\n if (value > Number.MAX_SAFE_INTEGER) {\n throw new RangeError(`Invalid value. Values of type 'number' must be less than or equal to ${Number.MAX_SAFE_INTEGER}. For larger values, try using a BigInt instead.`);\n }\n return BigInt(value);\n }\n if (isInstance(value, Uint8Array))\n return BigInt(`0x${bytesToHex(value)}`);\n throw new TypeError(`intToBigInt: Invalid value type. Must be a number, bigint, BigInt-compatible string, or Uint8Array.`);\n}\nexport function with0x(value) {\n return /^0x/i.test(value)\n ? value\n : `0x${value}`;\n}\nexport function without0x(value) {\n return /^0x/i.test(value)\n ? value.slice(2)\n : value;\n}\nexport function hexToBigInt(hex) {\n if (typeof hex !== 'string')\n throw new TypeError(`hexToBigInt: expected string, got ${typeof hex}`);\n return BigInt(`0x${hex}`);\n}\nexport function intToHex(integer, byteLength = 8) {\n const value = typeof integer === 'bigint' ? integer : intToBigInt(integer);\n return value.toString(16).padStart(byteLength * 2, '0');\n}\nexport function hexToInt(hex) {\n return parseInt(hex, 16);\n}\nexport function bigIntToBytes(value, length = 16) {\n const hex = intToHex(value, length);\n return hexToBytes(hex);\n}\nexport function toTwos(value, width) {\n if (value < -(BigInt(1) << (width - BigInt(1))) \|\|\n (BigInt(1) << (width - BigInt(1))) - BigInt(1) < value) {\n throw `Unable to represent integer in width: ${width}`;\n }\n if (value >= BigInt(0)) {\n return BigInt(value);\n }\n return value + (BigInt(1) << width);\n}\nfunction nthBit(value, n) {\n return value & (BigInt(1) << n);\n}\nexport function bytesToTwosBigInt(bytes) {\n return fromTwos(BigInt(`0x${bytesToHex(bytes)}`), BigInt(bytes.byteLength * 8));\n}\nexport function fromTwos(value, width) {\n if (nthBit(value, width - BigInt(1))) {\n return value - (BigInt(1) << width);\n }\n return value;\n}\nconst hexes = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\nexport function bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (const u of uint8a) {\n hex += hexes[u];\n }\n return hex;\n}\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError(`hexToBytes: expected string, got ${typeof hex}`);\n }\n hex = without0x(hex);\n hex = hex.length % 2 ? `0${hex}` : hex;\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nexport function utf8ToBytes(str) {\n return new TextEncoder().encode(str);\n}\nexport function bytesToUtf8(arr) {\n return new TextDecoder().decode(arr);\n}\nexport function asciiToBytes(str) {\n const byteArray = [];\n for (let i = 0; i < str.length; i++) {\n byteArray.push(str.charCodeAt(i) & 0xff);\n }\n return new Uint8Array(byteArray);\n}\nexport function bytesToAscii(arr) {\n return String.fromCharCode.apply(null, arr);\n}\nfunction isNotOctet(octet) {\n return !Number.isInteger(octet) \|\| octet < 0 \|\| octet > 255;\n}\nexport function octetsToBytes(numbers) {\n if (numbers.some(isNotOctet))\n throw new Error('Some values are invalid bytes.');\n return new Uint8Array(numbers);\n}\nexport function concatBytes(...arrays) {\n if (!arrays.every(a => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nexport function concatArray(elements) {\n return concatBytes(...elements.map(e => {\n if (typeof e === 'number')\n return octetsToBytes([e]);\n if (e instanceof Array)\n return octetsToBytes(e);\n return e;\n }));\n}\nexport function isInstance(object, clazz) {\n return object instanceof clazz \|\| object?.constructor?.name?.toLowerCase() === clazz.name;\n}\nexport function validateHash256(hex) {\n hex = without0x(hex);\n if (hex.length !== 64)\n return false;\n return /^[0-9a-fA-F]+$/.test(hex);\n}\n//# sourceMappingURL=utils.js.map","export function number(n) {\n if (!Number.isSafeInteger(n) \|\| n < 0)\n throw new Error(`Wrong positive integer: ${n}`);\n}\nexport function bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`Expected boolean, not ${b}`);\n}\nexport function bytes(b, ...lengths) {\n if (!(b instanceof Uint8Array))\n throw new TypeError('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new TypeError(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexport function hash(hash) {\n if (typeof hash !== 'function' \|\| typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nexport function exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nexport function output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nconst assert = {\n number,\n bool,\n bytes,\n hash,\n exists,\n output,\n};\nexport default assert;\n","/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n// The import here is via the package name. This is to ensure\n// that exports mapping/resolution does fall into place.\nimport { crypto } from '@noble/hashes/crypto';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) \| (word >>> shift);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// There is almost no big endian hardware, but js typed arrays uses platform specific endianness.\n// So, just to be sure not to corrupt anything.\nif (!isLE)\n throw new Error('Non little-endian hardware is not supported');\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/*\n @example bytesToHex(Uint8Array.from([0xde, 0xad, 0xbe, 0xef]))\n /\nexport function bytesToHex(uint8a) {\n // pre-caching improves the speed 6x\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Uint8Array expected');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\n/\n @example hexToBytes('deadbeef')\n /\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex');\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\n// There is no setImmediate in browser and setTimeout is slow. However, call to async function will return Promise\n// which will be fullfiled only on next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string') {\n throw new TypeError(`utf8ToBytes expected string, got ${typeof str}`);\n }\n return new TextEncoder().encode(str);\n}\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n if (!(data instanceof Uint8Array))\n throw new TypeError(`Expected input type is Uint8Array (got ${typeof data})`);\n return data;\n}\n/*\n Concats Uint8Array-s into one; like `Buffer.concat([buf1, buf2])`\n * @example concatBytes(buf1, buf2)\n /\nexport function concatBytes(...arrays) {\n if (!arrays.every((a) => a instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\n// For runtime check if class implements interface\nexport class Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj) => Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && (typeof opts !== 'object' \|\| !isPlainObject(opts)))\n throw new TypeError('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexport function wrapConstructor(hashConstructor) {\n const hashC = (message) => hashConstructor().update(toBytes(message)).digest();\n const tmp = hashConstructor();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashConstructor();\n return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\n/\n Secure PRNG\n /\nexport function randomBytes(bytesLength = 32) {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n return new Uint8Array(crypto.node.randomBytes(bytesLength).buffer);\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n}\n","export const crypto = {\n node: undefined,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\n","import assert from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nclass HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n assert.hash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new TypeError('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n assert.exists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n assert.exists(this);\n assert.bytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to \|\| (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/\n HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n /\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n","import assert from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n assert.exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n assert.exists(this);\n assert.output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to \|\| (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\n","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends SHA2 {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = IV[0] \| 0;\n this.B = IV[1] \| 0;\n this.C = IV[2] \| 0;\n this.D = IV[3] \| 0;\n this.E = IV[4] \| 0;\n this.F = IV[5] \| 0;\n this.G = IV[6] \| 0;\n this.H = IV[7] \| 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 \| 0;\n this.B = 0x367cd507 \| 0;\n this.C = 0x3070dd17 \| 0;\n this.D = 0xf70e5939 \| 0;\n this.E = 0xffc00b31 \| 0;\n this.F = 0x68581511 \| 0;\n this.G = 0x64f98fa7 \| 0;\n this.H = 0xbefa4fa4 \| 0;\n this.outputLen = 28;\n }\n}\n/*\n SHA2-256 hash function\n * @param message - data that would be hashed\n /\nexport const sha256 = wrapConstructor(() => new SHA256());\nexport const sha224 = wrapConstructor(() => new SHA224());\n","/! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) /\nimport as nodeCrypto from 'crypto';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 \|\| k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nexport { CURVE };\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n \|\| Y2 === _0n)\n return this;\n if (X1 === _0n \|\| Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n \|\| k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) \|\| 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 (W - 1);\n const mask = BigInt(2 W - 1);\n const maxNumber = 2 W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nexport class Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 \|\| header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 \|\| recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) \|\| !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n \|\| a === _1n \|\| this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 \|\| data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len \|\| res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 \|\| data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nexport class Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) \|\| byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res = res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n \|\| modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' \|\| hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' \|\| qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) \| Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nexport function getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexport function recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr \|\| str) && item.length;\n if (arr)\n return len === compressedLen \|\| len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 \|\| len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nexport function getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexport { sign, signSync };\nconst vopts = { strict: true };\nexport function verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) \|\| !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R \|\| !R.hasEvenY() \|\| R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexport const schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexport const utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen \|\| hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => utils.hashToPrivateKey(utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","export const HIRO_MAINNET_URL = 'https://api.mainnet.hiro.so';\nexport const HIRO_TESTNET_URL = 'https://api.testnet.hiro.so';\nexport const DEVNET_URL = 'http://localhost:3999';\nexport const GAIA_URL = 'https://hub.blockstack.org';\nexport const PRIVATE_KEY_BYTES_COMPRESSED = 33;\nexport const PRIVATE_KEY_BYTES_UNCOMPRESSED = 32;\n//# sourceMappingURL=constants.js.map","const defaultFetchOpts = {\n referrerPolicy: 'origin',\n headers: {\n 'x-hiro-product': 'stacksjs',\n },\n};\nexport const getFetchOptions = () => {\n return defaultFetchOpts;\n};\nexport const setFetchOptions = (ops) => {\n return Object.assign(defaultFetchOpts, ops);\n};\nexport async function fetchWrapper(input, init) {\n const fetchOpts = {};\n Object.assign(fetchOpts, defaultFetchOpts, init);\n const fetchResult = await fetch(input, fetchOpts);\n return fetchResult;\n}\nexport function hostMatches(host, pattern) {\n if (typeof pattern === 'string')\n return pattern === host;\n return pattern.exec(host);\n}\nexport function createApiKeyMiddleware({ apiKey, host = /(.)api(.)(\\.stacks\\.co\|\\.hiro\\.so)$/i, httpHeader = 'x-api-key', }) {\n return {\n pre: context => {\n const reqUrl = new URL(context.url);\n if (!hostMatches(reqUrl.host, host))\n return;\n const headers = context.init.headers instanceof Headers\n ? context.init.headers\n : (context.init.headers = new Headers(context.init.headers));\n headers.set(httpHeader, apiKey);\n },\n };\n}\nfunction argsForCreateFetchFn(args) {\n let fetchLib = fetchWrapper;\n let middlewares = [];\n if (args.length > 0 && typeof args[0] === 'function') {\n fetchLib = args.shift();\n }\n if (args.length > 0) {\n middlewares = args;\n }\n return { fetchLib, middlewares };\n}\nexport function createFetchFn(...args) {\n const { fetchLib, middlewares } = argsForCreateFetchFn(args);\n const fetchFn = async (url, init) => {\n let fetchParams = { url, init: init ?? {} };\n for (const middleware of middlewares) {\n if (typeof middleware.pre === 'function') {\n const result = await Promise.resolve(middleware.pre({\n fetch: fetchLib,\n ...fetchParams,\n }));\n fetchParams = result ?? fetchParams;\n }\n }\n let response = await fetchLib(fetchParams.url, fetchParams.init);\n for (const middleware of middlewares) {\n if (typeof middleware.post === 'function') {\n const result = await Promise.resolve(middleware.post({\n fetch: fetchLib,\n url: fetchParams.url,\n init: fetchParams.init,\n response: response?.clone() ?? response,\n }));\n response = result ?? response;\n }\n }\n return response;\n };\n return fetchFn;\n}\n//# sourceMappingURL=fetch.js.map","export var ChainId;\n(function (ChainId) {\n ChainId[ChainId[\"Mainnet\"] = 1] = \"Mainnet\";\n ChainId[ChainId[\"Testnet\"] = 2147483648] = \"Testnet\";\n})(ChainId \|\| (ChainId = {}));\nexport var PeerNetworkId;\n(function (PeerNetworkId) {\n PeerNetworkId[PeerNetworkId[\"Mainnet\"] = 385875968] = \"Mainnet\";\n PeerNetworkId[PeerNetworkId[\"Testnet\"] = 4278190080] = \"Testnet\";\n})(PeerNetworkId \|\| (PeerNetworkId = {}));\nexport const DEFAULT_CHAIN_ID = ChainId.Mainnet;\nexport var TransactionVersion;\n(function (TransactionVersion) {\n TransactionVersion[TransactionVersion[\"Mainnet\"] = 0] = \"Mainnet\";\n TransactionVersion[TransactionVersion[\"Testnet\"] = 128] = \"Testnet\";\n})(TransactionVersion \|\| (TransactionVersion = {}));\nexport var AddressVersion;\n(function (AddressVersion) {\n AddressVersion[AddressVersion[\"MainnetSingleSig\"] = 22] = \"MainnetSingleSig\";\n AddressVersion[AddressVersion[\"MainnetMultiSig\"] = 20] = \"MainnetMultiSig\";\n AddressVersion[AddressVersion[\"TestnetSingleSig\"] = 26] = \"TestnetSingleSig\";\n AddressVersion[AddressVersion[\"TestnetMultiSig\"] = 21] = \"TestnetMultiSig\";\n})(AddressVersion \|\| (AddressVersion = {}));\nexport const DEFAULT_TRANSACTION_VERSION = TransactionVersion.Mainnet;\nexport function whenTransactionVersion(transactionVersion) {\n return (map) => map[transactionVersion];\n}\n//# sourceMappingURL=constants.js.map","import { DEVNET_URL, HIRO_MAINNET_URL, HIRO_TESTNET_URL, createFetchFn, } from '@stacks/common';\nimport { AddressVersion, ChainId, PeerNetworkId, TransactionVersion } from './constants';\nexport const STACKS_MAINNET = {\n chainId: ChainId.Mainnet,\n transactionVersion: TransactionVersion.Mainnet,\n peerNetworkId: PeerNetworkId.Mainnet,\n magicBytes: 'X2',\n bootAddress: 'SP000000000000000000002Q6VF78',\n addressVersion: {\n singleSig: AddressVersion.MainnetSingleSig,\n multiSig: AddressVersion.MainnetMultiSig,\n },\n client: { baseUrl: HIRO_MAINNET_URL },\n};\nexport const STACKS_TESTNET = {\n chainId: ChainId.Testnet,\n transactionVersion: TransactionVersion.Testnet,\n peerNetworkId: PeerNetworkId.Testnet,\n magicBytes: 'T2',\n bootAddress: 'ST000000000000000000002AMW42H',\n addressVersion: {\n singleSig: AddressVersion.TestnetSingleSig,\n multiSig: AddressVersion.TestnetMultiSig,\n },\n client: { baseUrl: HIRO_TESTNET_URL },\n};\nexport const STACKS_DEVNET = {\n ...STACKS_TESTNET,\n addressVersion: { ...STACKS_TESTNET.addressVersion },\n magicBytes: 'id',\n client: { baseUrl: DEVNET_URL },\n};\nexport const STACKS_MOCKNET = {\n ...STACKS_DEVNET,\n addressVersion: { ...STACKS_DEVNET.addressVersion },\n client: { ...STACKS_DEVNET.client },\n};\nexport const StacksNetworks = ['mainnet', 'testnet', 'devnet', 'mocknet'];\nexport function networkFromName(name) {\n switch (name) {\n case 'mainnet':\n return STACKS_MAINNET;\n case 'testnet':\n return STACKS_TESTNET;\n case 'devnet':\n return STACKS_DEVNET;\n case 'mocknet':\n return STACKS_MOCKNET;\n default:\n throw new Error(`Unknown network name: ${name}`);\n }\n}\nexport function networkFrom(network) {\n if (typeof network === 'string')\n return networkFromName(network);\n return network;\n}\nexport function defaultUrlFromNetwork(network) {\n if (!network)\n return HIRO_MAINNET_URL;\n network = networkFrom(network);\n return !network \|\| network.transactionVersion === TransactionVersion.Mainnet\n ? HIRO_MAINNET_URL\n : network.magicBytes === 'id'\n ? DEVNET_URL\n : HIRO_TESTNET_URL;\n}\nexport function clientFromNetwork(network) {\n if (network.client.fetch)\n return network.client;\n return {\n ...network.client,\n fetch: createFetchFn(),\n };\n}\n//# sourceMappingURL=network.js.map","export const BLOCKSTACK_DEFAULT_GAIA_HUB_URL = 'https://hub.blockstack.org';\nexport const MAX_STRING_LENGTH_BYTES = 128;\nexport const CLARITY_INT_SIZE = 128;\nexport const CLARITY_INT_BYTE_SIZE = 16;\nexport const COINBASE_BYTES_LENGTH = 32;\nexport const VRF_PROOF_BYTES_LENGTH = 80;\nexport const RECOVERABLE_ECDSA_SIG_LENGTH_BYTES = 65;\nexport const COMPRESSED_PUBKEY_LENGTH_BYTES = 32;\nexport const UNCOMPRESSED_PUBKEY_LENGTH_BYTES = 64;\nexport const MEMO_MAX_LENGTH_BYTES = 34;\nconst MAX_PAYLOAD_LEN = 1 + 16 * 1024 * 1024;\nconst PREAMBLE_ENCODED_SIZE = 165;\nconst MAX_RELAYERS_LEN = 16;\nconst PEER_ADDRESS_ENCODED_SIZE = 16;\nconst HASH160_ENCODED_SIZE = 20;\nconst NEIGHBOR_ADDRESS_ENCODED_SIZE = PEER_ADDRESS_ENCODED_SIZE + 2 + HASH160_ENCODED_SIZE;\nconst RELAY_DATA_ENCODED_SIZE = NEIGHBOR_ADDRESS_ENCODED_SIZE + 4;\nexport const STRING_MAX_LENGTH = MAX_PAYLOAD_LEN + (PREAMBLE_ENCODED_SIZE + MAX_RELAYERS_LEN * RELAY_DATA_ENCODED_SIZE);\nexport var PayloadType;\n(function (PayloadType) {\n PayloadType[PayloadType[\"TokenTransfer\"] = 0] = \"TokenTransfer\";\n PayloadType[PayloadType[\"SmartContract\"] = 1] = \"SmartContract\";\n PayloadType[PayloadType[\"VersionedSmartContract\"] = 6] = \"VersionedSmartContract\";\n PayloadType[PayloadType[\"ContractCall\"] = 2] = \"ContractCall\";\n PayloadType[PayloadType[\"PoisonMicroblock\"] = 3] = \"PoisonMicroblock\";\n PayloadType[PayloadType[\"Coinbase\"] = 4] = \"Coinbase\";\n PayloadType[PayloadType[\"CoinbaseToAltRecipient\"] = 5] = \"CoinbaseToAltRecipient\";\n PayloadType[PayloadType[\"TenureChange\"] = 7] = \"TenureChange\";\n PayloadType[PayloadType[\"NakamotoCoinbase\"] = 8] = \"NakamotoCoinbase\";\n})(PayloadType \|\| (PayloadType = {}));\nexport var ClarityVersion;\n(function (ClarityVersion) {\n ClarityVersion[ClarityVersion[\"Clarity1\"] = 1] = \"Clarity1\";\n ClarityVersion[ClarityVersion[\"Clarity2\"] = 2] = \"Clarity2\";\n ClarityVersion[ClarityVersion[\"Clarity3\"] = 3] = \"Clarity3\";\n})(ClarityVersion \|\| (ClarityVersion = {}));\nexport var AnchorMode;\n(function (AnchorMode) {\n AnchorMode[AnchorMode[\"OnChainOnly\"] = 1] = \"OnChainOnly\";\n AnchorMode[AnchorMode[\"OffChainOnly\"] = 2] = \"OffChainOnly\";\n AnchorMode[AnchorMode[\"Any\"] = 3] = \"Any\";\n})(AnchorMode \|\| (AnchorMode = {}));\nexport const AnchorModeNames = ['onChainOnly', 'offChainOnly', 'any'];\nconst AnchorModeMap = {\n [AnchorModeNames[0]]: AnchorMode.OnChainOnly,\n [AnchorModeNames[1]]: AnchorMode.OffChainOnly,\n [AnchorModeNames[2]]: AnchorMode.Any,\n [AnchorMode.OnChainOnly]: AnchorMode.OnChainOnly,\n [AnchorMode.OffChainOnly]: AnchorMode.OffChainOnly,\n [AnchorMode.Any]: AnchorMode.Any,\n};\nexport function anchorModeFrom(mode) {\n if (mode in AnchorModeMap)\n return AnchorModeMap[mode];\n throw new Error(`Invalid anchor mode \"${mode}\", must be one of: ${AnchorModeNames.join(', ')}`);\n}\nexport var PostConditionMode;\n(function (PostConditionMode) {\n PostConditionMode[PostConditionMode[\"Allow\"] = 1] = \"Allow\";\n PostConditionMode[PostConditionMode[\"Deny\"] = 2] = \"Deny\";\n})(PostConditionMode \|\| (PostConditionMode = {}));\nexport var PostConditionType;\n(function (PostConditionType) {\n PostConditionType[PostConditionType[\"STX\"] = 0] = \"STX\";\n PostConditionType[PostConditionType[\"Fungible\"] = 1] = \"Fungible\";\n PostConditionType[PostConditionType[\"NonFungible\"] = 2] = \"NonFungible\";\n})(PostConditionType \|\| (PostConditionType = {}));\nexport var AuthType;\n(function (AuthType) {\n AuthType[AuthType[\"Standard\"] = 4] = \"Standard\";\n AuthType[AuthType[\"Sponsored\"] = 5] = \"Sponsored\";\n})(AuthType \|\| (AuthType = {}));\nexport var AddressHashMode;\n(function (AddressHashMode) {\n AddressHashMode[AddressHashMode[\"P2PKH\"] = 0] = \"P2PKH\";\n AddressHashMode[AddressHashMode[\"P2SH\"] = 1] = \"P2SH\";\n AddressHashMode[AddressHashMode[\"P2WPKH\"] = 2] = \"P2WPKH\";\n AddressHashMode[AddressHashMode[\"P2WSH\"] = 3] = \"P2WSH\";\n AddressHashMode[AddressHashMode[\"P2SHNonSequential\"] = 5] = \"P2SHNonSequential\";\n AddressHashMode[AddressHashMode[\"P2WSHNonSequential\"] = 7] = \"P2WSHNonSequential\";\n})(AddressHashMode \|\| (AddressHashMode = {}));\nexport { AddressVersion } from '@stacks/network';\nexport var PubKeyEncoding;\n(function (PubKeyEncoding) {\n PubKeyEncoding[PubKeyEncoding[\"Compressed\"] = 0] = \"Compressed\";\n PubKeyEncoding[PubKeyEncoding[\"Uncompressed\"] = 1] = \"Uncompressed\";\n})(PubKeyEncoding \|\| (PubKeyEncoding = {}));\nexport var FungibleConditionCode;\n(function (FungibleConditionCode) {\n FungibleConditionCode[FungibleConditionCode[\"Equal\"] = 1] = \"Equal\";\n FungibleConditionCode[FungibleConditionCode[\"Greater\"] = 2] = \"Greater\";\n FungibleConditionCode[FungibleConditionCode[\"GreaterEqual\"] = 3] = \"GreaterEqual\";\n FungibleConditionCode[FungibleConditionCode[\"Less\"] = 4] = \"Less\";\n FungibleConditionCode[FungibleConditionCode[\"LessEqual\"] = 5] = \"LessEqual\";\n})(FungibleConditionCode \|\| (FungibleConditionCode = {}));\nexport var NonFungibleConditionCode;\n(function (NonFungibleConditionCode) {\n NonFungibleConditionCode[NonFungibleConditionCode[\"Sends\"] = 16] = \"Sends\";\n NonFungibleConditionCode[NonFungibleConditionCode[\"DoesNotSend\"] = 17] = \"DoesNotSend\";\n})(NonFungibleConditionCode \|\| (NonFungibleConditionCode = {}));\nexport var PostConditionPrincipalId;\n(function (PostConditionPrincipalId) {\n PostConditionPrincipalId[PostConditionPrincipalId[\"Origin\"] = 1] = \"Origin\";\n PostConditionPrincipalId[PostConditionPrincipalId[\"Standard\"] = 2] = \"Standard\";\n PostConditionPrincipalId[PostConditionPrincipalId[\"Contract\"] = 3] = \"Contract\";\n})(PostConditionPrincipalId \|\| (PostConditionPrincipalId = {}));\nexport var AssetType;\n(function (AssetType) {\n AssetType[AssetType[\"STX\"] = 0] = \"STX\";\n AssetType[AssetType[\"Fungible\"] = 1] = \"Fungible\";\n AssetType[AssetType[\"NonFungible\"] = 2] = \"NonFungible\";\n})(AssetType \|\| (AssetType = {}));\nexport var TenureChangeCause;\n(function (TenureChangeCause) {\n TenureChangeCause[TenureChangeCause[\"BlockFound\"] = 0] = \"BlockFound\";\n TenureChangeCause[TenureChangeCause[\"Extended\"] = 1] = \"Extended\";\n})(TenureChangeCause \|\| (TenureChangeCause = {}));\nexport var AuthFieldType;\n(function (AuthFieldType) {\n AuthFieldType[AuthFieldType[\"PublicKeyCompressed\"] = 0] = \"PublicKeyCompressed\";\n AuthFieldType[AuthFieldType[\"PublicKeyUncompressed\"] = 1] = \"PublicKeyUncompressed\";\n AuthFieldType[AuthFieldType[\"SignatureCompressed\"] = 2] = \"SignatureCompressed\";\n AuthFieldType[AuthFieldType[\"SignatureUncompressed\"] = 3] = \"SignatureUncompressed\";\n})(AuthFieldType \|\| (AuthFieldType = {}));\nexport var TxRejectedReason;\n(function (TxRejectedReason) {\n TxRejectedReason[\"Serialization\"] = \"Serialization\";\n TxRejectedReason[\"Deserialization\"] = \"Deserialization\";\n TxRejectedReason[\"SignatureValidation\"] = \"SignatureValidation\";\n TxRejectedReason[\"FeeTooLow\"] = \"FeeTooLow\";\n TxRejectedReason[\"BadNonce\"] = \"BadNonce\";\n TxRejectedReason[\"NotEnoughFunds\"] = \"NotEnoughFunds\";\n TxRejectedReason[\"NoSuchContract\"] = \"NoSuchContract\";\n TxRejectedReason[\"NoSuchPublicFunction\"] = \"NoSuchPublicFunction\";\n TxRejectedReason[\"BadFunctionArgument\"] = \"BadFunctionArgument\";\n TxRejectedReason[\"ContractAlreadyExists\"] = \"ContractAlreadyExists\";\n TxRejectedReason[\"PoisonMicroblocksDoNotConflict\"] = \"PoisonMicroblocksDoNotConflict\";\n TxRejectedReason[\"PoisonMicroblockHasUnknownPubKeyHash\"] = \"PoisonMicroblockHasUnknownPubKeyHash\";\n TxRejectedReason[\"PoisonMicroblockIsInvalid\"] = \"PoisonMicroblockIsInvalid\";\n TxRejectedReason[\"BadAddressVersionByte\"] = \"BadAddressVersionByte\";\n TxRejectedReason[\"NoCoinbaseViaMempool\"] = \"NoCoinbaseViaMempool\";\n TxRejectedReason[\"ServerFailureNoSuchChainTip\"] = \"ServerFailureNoSuchChainTip\";\n TxRejectedReason[\"ServerFailureDatabase\"] = \"ServerFailureDatabase\";\n TxRejectedReason[\"ServerFailureOther\"] = \"ServerFailureOther\";\n})(TxRejectedReason \|\| (TxRejectedReason = {}));\n//# sourceMappingURL=constants.js.map","import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = Uint8Array.from({ length: 16 }, (_, i) => i);\nconst Pi = Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n for (let j of [idxL, idxR])\n j.push(j[i].map((k) => Rho[k]));\nconst shifts = [\n [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = new Uint32Array([0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]);\nconst Kr = new Uint32Array([0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) \| (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n if (group === 0)\n return x ^ y ^ z;\n else if (group === 1)\n return (x & y) \| (~x & z);\n else if (group === 2)\n return (x \| ~y) ^ z;\n else if (group === 3)\n return (x & z) \| (y & ~z);\n else\n return x ^ (y \| ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = new Uint32Array(16);\nexport class RIPEMD160 extends SHA2 {\n constructor() {\n super(64, 20, 8, true);\n this.h0 = 0x67452301 \| 0;\n this.h1 = 0xefcdab89 \| 0;\n this.h2 = 0x98badcfe \| 0;\n this.h3 = 0x10325476 \| 0;\n this.h4 = 0xc3d2e1f0 \| 0;\n }\n get() {\n const { h0, h1, h2, h3, h4 } = this;\n return [h0, h1, h2, h3, h4];\n }\n set(h0, h1, h2, h3, h4) {\n this.h0 = h0 \| 0;\n this.h1 = h1 \| 0;\n this.h2 = h2 \| 0;\n this.h3 = h3 \| 0;\n this.h4 = h4 \| 0;\n }\n process(view, offset) {\n for (let i = 0; i < 16; i++, offset += 4)\n BUF[i] = view.getUint32(offset, true);\n // prettier-ignore\n let al = this.h0 \| 0, ar = al, bl = this.h1 \| 0, br = bl, cl = this.h2 \| 0, cr = cl, dl = this.h3 \| 0, dr = dl, el = this.h4 \| 0, er = el;\n // Instead of iterating 0 to 80, we split it into 5 groups\n // And use the groups in constants, functions, etc. Much simpler\n for (let group = 0; group < 5; group++) {\n const rGroup = 4 - group;\n const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n for (let i = 0; i < 16; i++) {\n const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) \| 0;\n al = el, el = dl, dl = rotl(cl, 10) \| 0, cl = bl, bl = tl; // prettier-ignore\n }\n // 2 loops are 10% faster\n for (let i = 0; i < 16; i++) {\n const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) \| 0;\n ar = er, er = dr, dr = rotl(cr, 10) \| 0, cr = br, br = tr; // prettier-ignore\n }\n }\n // Add the compressed chunk to the current hash value\n this.set((this.h1 + cl + dr) \| 0, (this.h2 + dl + er) \| 0, (this.h3 + el + ar) \| 0, (this.h4 + al + br) \| 0, (this.h0 + bl + cr) \| 0);\n }\n roundClean() {\n BUF.fill(0);\n }\n destroy() {\n this.destroyed = true;\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0);\n }\n}\n/*\n RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n /\nexport const ripemd160 = wrapConstructor(() => new RIPEMD160());\n","const U32_MASK64 = BigInt(2 * 32 - 1);\nconst _32n = BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nexport function fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) \| 0, l: Number(n & U32_MASK64) \| 0 };\n}\nexport function split(lst, le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nexport const toBig = (h, l) => (BigInt(h >>> 0) << _32n) \| BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) \| (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) \| (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) \| (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (h, l) => l;\nconst rotr32L = (h, l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) \| (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) \| (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) \| (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) \| (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\n// Removing \"export\" has 5% perf penalty -_-\nexport function add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 32) \| 0)) \| 0, l: l \| 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 32) \| 0)) \| 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 32) \| 0)) \| 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 32) \| 0)) \| 0;\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","import { SHA2 } from './_sha2.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n)));\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = new Uint32Array(80);\nconst SHA512_W_L = new Uint32Array(80);\nexport class SHA512 extends SHA2 {\n constructor() {\n super(128, 64, 16, false);\n // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n // Also looks cleaner and easier to verify with spec.\n // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x6a09e667 \| 0;\n this.Al = 0xf3bcc908 \| 0;\n this.Bh = 0xbb67ae85 \| 0;\n this.Bl = 0x84caa73b \| 0;\n this.Ch = 0x3c6ef372 \| 0;\n this.Cl = 0xfe94f82b \| 0;\n this.Dh = 0xa54ff53a \| 0;\n this.Dl = 0x5f1d36f1 \| 0;\n this.Eh = 0x510e527f \| 0;\n this.El = 0xade682d1 \| 0;\n this.Fh = 0x9b05688c \| 0;\n this.Fl = 0x2b3e6c1f \| 0;\n this.Gh = 0x1f83d9ab \| 0;\n this.Gl = 0xfb41bd6b \| 0;\n this.Hh = 0x5be0cd19 \| 0;\n this.Hl = 0x137e2179 \| 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n SHA512_W_H.fill(0);\n SHA512_W_L.fill(0);\n }\n destroy() {\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nclass SHA512_224 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x8c3d37c8 \| 0;\n this.Al = 0x19544da2 \| 0;\n this.Bh = 0x73e19966 \| 0;\n this.Bl = 0x89dcd4d6 \| 0;\n this.Ch = 0x1dfab7ae \| 0;\n this.Cl = 0x32ff9c82 \| 0;\n this.Dh = 0x679dd514 \| 0;\n this.Dl = 0x582f9fcf \| 0;\n this.Eh = 0x0f6d2b69 \| 0;\n this.El = 0x7bd44da8 \| 0;\n this.Fh = 0x77e36f73 \| 0;\n this.Fl = 0x04c48942 \| 0;\n this.Gh = 0x3f9d85a8 \| 0;\n this.Gl = 0x6a1d36c8 \| 0;\n this.Hh = 0x1112e6ad \| 0;\n this.Hl = 0x91d692a1 \| 0;\n this.outputLen = 28;\n }\n}\nclass SHA512_256 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x22312194 \| 0;\n this.Al = 0xfc2bf72c \| 0;\n this.Bh = 0x9f555fa3 \| 0;\n this.Bl = 0xc84c64c2 \| 0;\n this.Ch = 0x2393b86b \| 0;\n this.Cl = 0x6f53b151 \| 0;\n this.Dh = 0x96387719 \| 0;\n this.Dl = 0x5940eabd \| 0;\n this.Eh = 0x96283ee2 \| 0;\n this.El = 0xa88effe3 \| 0;\n this.Fh = 0xbe5e1e25 \| 0;\n this.Fl = 0x53863992 \| 0;\n this.Gh = 0x2b0199fc \| 0;\n this.Gl = 0x2c85b8aa \| 0;\n this.Hh = 0x0eb72ddc \| 0;\n this.Hl = 0x81c52ca2 \| 0;\n this.outputLen = 32;\n }\n}\nclass SHA384 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0xcbbb9d5d \| 0;\n this.Al = 0xc1059ed8 \| 0;\n this.Bh = 0x629a292a \| 0;\n this.Bl = 0x367cd507 \| 0;\n this.Ch = 0x9159015a \| 0;\n this.Cl = 0x3070dd17 \| 0;\n this.Dh = 0x152fecd8 \| 0;\n this.Dl = 0xf70e5939 \| 0;\n this.Eh = 0x67332667 \| 0;\n this.El = 0xffc00b31 \| 0;\n this.Fh = 0x8eb44a87 \| 0;\n this.Fl = 0x68581511 \| 0;\n this.Gh = 0xdb0c2e0d \| 0;\n this.Gl = 0x64f98fa7 \| 0;\n this.Hh = 0x47b5481d \| 0;\n this.Hl = 0xbefa4fa4 \| 0;\n this.outputLen = 48;\n }\n}\nexport const sha512 = wrapConstructor(() => new SHA512());\nexport const sha512_224 = wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = wrapConstructor(() => new SHA512_256());\nexport const sha384 = wrapConstructor(() => new SHA384());\n","import { ripemd160 } from '@noble/hashes/ripemd160';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { sha512_256 } from '@noble/hashes/sha512';\nimport { utils } from '@noble/secp256k1';\nimport { bytesToHex, concatArray, concatBytes, utf8ToBytes } from '@stacks/common';\nimport { c32addressDecode } from 'c32check';\nimport lodashCloneDeep from 'lodash.clonedeep';\nimport { deserializeCV, serializeCV } from './clarity';\nexport { verify as verifySignature } from '@noble/secp256k1';\nexport const randomBytes = (bytesLength) => utils.randomBytes(bytesLength);\nexport const leftPadHex = (hexString) => hexString.length % 2 ? `0${hexString}` : hexString;\nexport const leftPadHexToLength = (hexString, length) => hexString.padStart(length, '0');\nexport const rightPadHexToLength = (hexString, length) => hexString.padEnd(length, '0');\nexport const exceedsMaxLengthBytes = (string, maxLengthBytes) => string ? utf8ToBytes(string).length > maxLengthBytes : false;\nexport function cloneDeep(obj) {\n return lodashCloneDeep(obj);\n}\nexport function omit(obj, prop) {\n const clone = cloneDeep(obj);\n delete clone[prop];\n return clone;\n}\nexport const hash160 = (input) => {\n return ripemd160(sha256(input));\n};\nexport const txidFromData = (data) => {\n return bytesToHex(sha512_256(data));\n};\nexport const txidFromBytes = txidFromData;\nexport const hashP2PKH = (input) => {\n return bytesToHex(hash160(input));\n};\nexport const hashP2WPKH = (input) => {\n const keyHash = hash160(input);\n const redeemScript = concatBytes(new Uint8Array([0]), new Uint8Array([keyHash.length]), keyHash);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport const hashP2SH = (numSigs, pubKeys) => {\n if (numSigs > 15 \|\| pubKeys.length > 15) {\n throw Error('P2SH multisig address can only contain up to 15 public keys');\n }\n const bytesArray = [];\n bytesArray.push(80 + numSigs);\n pubKeys.forEach(pubKey => {\n bytesArray.push(pubKey.length);\n bytesArray.push(pubKey);\n });\n bytesArray.push(80 + pubKeys.length);\n bytesArray.push(174);\n const redeemScript = concatArray(bytesArray);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport const hashP2WSH = (numSigs, pubKeys) => {\n if (numSigs > 15 \|\| pubKeys.length > 15) {\n throw Error('P2WSH multisig address can only contain up to 15 public keys');\n }\n const scriptArray = [];\n scriptArray.push(80 + numSigs);\n pubKeys.forEach(pubKey => {\n scriptArray.push(pubKey.length);\n scriptArray.push(pubKey);\n });\n scriptArray.push(80 + pubKeys.length);\n scriptArray.push(174);\n const script = concatArray(scriptArray);\n const digest = sha256(script);\n const bytesArray = [];\n bytesArray.push(0);\n bytesArray.push(digest.length);\n bytesArray.push(digest);\n const redeemScript = concatArray(bytesArray);\n const redeemScriptHash = hash160(redeemScript);\n return bytesToHex(redeemScriptHash);\n};\nexport function isClarityName(name) {\n const regex = /^[a-zA-Z]([a-zA-Z0-9]\|[-_!?+<>=/])$\|^[-+=/]$\|^[<>]=?$/;\n return regex.test(name) && name.length < 128;\n}\nexport function cvToHex(cv) {\n const serialized = serializeCV(cv);\n return `0x${serialized}`;\n}\nexport function hexToCV(hex) {\n return deserializeCV(hex);\n}\nexport const parseReadOnlyResponse = (response) => {\n if (response.okay)\n return hexToCV(response.result);\n throw new Error(response.cause);\n};\nexport const validateStacksAddress = (address) => {\n try {\n c32addressDecode(address);\n return true;\n }\n catch (e) {\n return false;\n }\n};\nexport function parseContractId(contractId) {\n const [address, name] = contractId.split('.');\n if (!address \|\| !name)\n throw new Error(`Invalid contract identifier: ${contractId}`);\n return [address, name];\n}\n//# sourceMappingURL=utils.js.map","export var StacksWireType;\n(function (StacksWireType) {\n StacksWireType[StacksWireType[\"Address\"] = 0] = \"Address\";\n StacksWireType[StacksWireType[\"Principal\"] = 1] = \"Principal\";\n StacksWireType[StacksWireType[\"LengthPrefixedString\"] = 2] = \"LengthPrefixedString\";\n StacksWireType[StacksWireType[\"MemoString\"] = 3] = \"MemoString\";\n StacksWireType[StacksWireType[\"Asset\"] = 4] = \"Asset\";\n StacksWireType[StacksWireType[\"PostCondition\"] = 5] = \"PostCondition\";\n StacksWireType[StacksWireType[\"PublicKey\"] = 6] = \"PublicKey\";\n StacksWireType[StacksWireType[\"LengthPrefixedList\"] = 7] = \"LengthPrefixedList\";\n StacksWireType[StacksWireType[\"Payload\"] = 8] = \"Payload\";\n StacksWireType[StacksWireType[\"MessageSignature\"] = 9] = \"MessageSignature\";\n StacksWireType[StacksWireType[\"StructuredDataSignature\"] = 10] = \"StructuredDataSignature\";\n StacksWireType[StacksWireType[\"TransactionAuthField\"] = 11] = \"TransactionAuthField\";\n})(StacksWireType \|\| (StacksWireType = {}));\nexport function whenWireType(wireType) {\n return (wireTypeMap) => wireTypeMap[wireType];\n}\n//# sourceMappingURL=types.js.map","import { hmac } from '@noble/hashes/hmac';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { getPublicKey as nobleGetPublicKey, Point, Signature, signSync, utils, } from '@noble/secp256k1';\nimport { bytesToHex, hexToBigInt, hexToBytes, intToHex, parseRecoverableSignatureVrs, PRIVATE_KEY_BYTES_COMPRESSED, privateKeyToBytes, signatureRsvToVrs, signatureVrsToRsv, } from '@stacks/common';\nimport { networkFrom, STACKS_MAINNET } from '@stacks/network';\nimport { c32address } from 'c32check';\nimport { addressHashModeToVersion } from './address';\nimport { AddressHashMode, PubKeyEncoding } from './constants';\nimport { hash160, hashP2PKH } from './utils';\nimport { addressFromVersionHash, addressToString, StacksWireType } from './wire';\nutils.hmacSha256Sync = (key, ...msgs) => {\n const h = hmac.create(sha256, key);\n msgs.forEach(msg => h.update(msg));\n return h.digest();\n};\nexport function getAddressFromPrivateKey(privateKey, network = 'mainnet') {\n network = networkFrom(network);\n const publicKey = privateKeyToPublic(privateKey);\n return getAddressFromPublicKey(publicKey, network);\n}\nexport function getAddressFromPublicKey(publicKey, network = 'mainnet') {\n network = networkFrom(network);\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n const addrVer = addressHashModeToVersion(AddressHashMode.P2PKH, network);\n const addr = addressFromVersionHash(addrVer, hashP2PKH(publicKey));\n const addrString = addressToString(addr);\n return addrString;\n}\nexport function createStacksPublicKey(publicKey) {\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return {\n type: StacksWireType.PublicKey,\n data: publicKey,\n };\n}\nexport function publicKeyFromSignatureVrs(messageHash, messageSignature, pubKeyEncoding = PubKeyEncoding.Compressed) {\n const parsedSignature = parseRecoverableSignatureVrs(messageSignature);\n const signature = new Signature(hexToBigInt(parsedSignature.r), hexToBigInt(parsedSignature.s));\n const point = Point.fromSignature(messageHash, signature, parsedSignature.recoveryId);\n const compressed = pubKeyEncoding === PubKeyEncoding.Compressed;\n return point.toHex(compressed);\n}\nexport function publicKeyFromSignatureRsv(messageHash, messageSignature, pubKeyEncoding = PubKeyEncoding.Compressed) {\n return publicKeyFromSignatureVrs(messageHash, signatureRsvToVrs(messageSignature), pubKeyEncoding);\n}\nexport function privateKeyToHex(publicKey) {\n return typeof publicKey === 'string' ? publicKey : bytesToHex(publicKey);\n}\nexport const publicKeyToHex = privateKeyToHex;\nexport const isPrivateKeyCompressed = privateKeyIsCompressed;\nexport function privateKeyIsCompressed(privateKey) {\n const length = typeof privateKey === 'string' ? privateKey.length / 2 : privateKey.byteLength;\n return length === PRIVATE_KEY_BYTES_COMPRESSED;\n}\nexport const isPublicKeyCompressed = publicKeyIsCompressed;\nexport function publicKeyIsCompressed(publicKey) {\n return !publicKeyToHex(publicKey).startsWith('04');\n}\nexport function privateKeyToPublic(privateKey) {\n privateKey = privateKeyToBytes(privateKey);\n const isCompressed = privateKeyIsCompressed(privateKey);\n return bytesToHex(nobleGetPublicKey(privateKey.slice(0, 32), isCompressed));\n}\nexport function compressPublicKey(publicKey) {\n return Point.fromHex(publicKeyToHex(publicKey)).toHex(true);\n}\nexport function uncompressPublicKey(publicKey) {\n return Point.fromHex(publicKeyToHex(publicKey)).toHex(false);\n}\nexport const makeRandomPrivKey = randomPrivateKey;\nexport function randomPrivateKey() {\n return compressPrivateKey(utils.randomPrivateKey());\n}\nexport function signWithKey(privateKey, messageHash) {\n privateKey = privateKeyToBytes(privateKey);\n const [rawSignature, recoveryId] = signSync(messageHash, privateKey.slice(0, 32), {\n canonical: true,\n recovered: true,\n });\n if (recoveryId == null) {\n throw new Error('No signature recoveryId received');\n }\n const recoveryIdHex = intToHex(recoveryId, 1);\n return recoveryIdHex + Signature.fromHex(rawSignature).toCompactHex();\n}\nexport function signMessageHashRsv({ messageHash, privateKey, }) {\n return signatureVrsToRsv(signWithKey(privateKey, messageHash));\n}\nexport function compressPrivateKey(privateKey) {\n privateKey = privateKeyToHex(privateKey);\n return privateKey.length == PRIVATE_KEY_BYTES_COMPRESSED 2\n ? privateKey\n : `${privateKey}01`;\n}\nexport function privateKeyToAddress(privateKey, network) {\n const publicKey = privateKeyToPublic(privateKey);\n return publicKeyToAddressSingleSig(publicKey, network);\n}\nexport function publicKeyToAddress(...args) {\n if (typeof args[0] === 'number')\n return _publicKeyToAddress(...args);\n return publicKeyToAddressSingleSig(...args);\n}\nfunction _publicKeyToAddress(version, publicKey) {\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return c32address(version, bytesToHex(hash160(publicKey)));\n}\nexport function publicKeyToAddressSingleSig(publicKey, network) {\n network = network ? networkFrom(network) : STACKS_MAINNET;\n publicKey = typeof publicKey === 'string' ? hexToBytes(publicKey) : publicKey;\n return c32address(network.addressVersion.singleSig, bytesToHex(hash160(publicKey)));\n}\n//# sourceMappingURL=keys.js.map","import { STACKS_MAINNET, TransactionVersion, networkFrom, } from '@stacks/network';\nimport { AddressHashMode, AddressVersion } from './constants';\nexport function addressHashModeToVersion(hashMode, network) {\n network = networkFrom(network ?? STACKS_MAINNET);\n switch (hashMode) {\n case AddressHashMode.P2PKH:\n switch (network.transactionVersion) {\n case TransactionVersion.Mainnet:\n return AddressVersion.MainnetSingleSig;\n case TransactionVersion.Testnet:\n return AddressVersion.TestnetSingleSig;\n default:\n throw new Error(`Unexpected transactionVersion ${network.transactionVersion} for hashMode ${hashMode}`);\n }\n case AddressHashMode.P2SH:\n case AddressHashMode.P2SHNonSequential:\n case AddressHashMode.P2WPKH:\n case AddressHashMode.P2WSH:\n case AddressHashMode.P2WSHNonSequential:\n switch (network.transactionVersion) {\n case TransactionVersion.Mainnet:\n return AddressVersion.MainnetMultiSig;\n case TransactionVersion.Testnet:\n return AddressVersion.TestnetMultiSig;\n default:\n throw new Error(`Unexpected transactionVersion ${network.transactionVersion} for hashMode ${hashMode}`);\n }\n default:\n throw new Error(`Unexpected hashMode ${hashMode}`);\n }\n}\n//# sourceMappingURL=address.js.map","import { c32address } from 'c32check';\nimport { AddressHashMode, PayloadType } from '../constants';\nimport { publicKeyIsCompressed } from '../keys';\nimport { hashP2PKH, hashP2SH, hashP2WPKH, hashP2WSH } from '../utils';\nimport { createAsset, createContractPrincipal, createStandardPrincipal } from './create';\nimport { serializePublicKeyBytes } from './serialization';\nimport { StacksWireType, } from './types';\nexport function addressFromPublicKeys(version, hashMode, numSigs, publicKeys) {\n if (publicKeys.length === 0) {\n throw Error('Invalid number of public keys');\n }\n if (hashMode === AddressHashMode.P2PKH \|\| hashMode === AddressHashMode.P2WPKH) {\n if (publicKeys.length !== 1 \|\| numSigs !== 1) {\n throw Error('Invalid number of public keys or signatures');\n }\n }\n if (hashMode === AddressHashMode.P2WPKH \|\|\n hashMode === AddressHashMode.P2WSH \|\|\n hashMode === AddressHashMode.P2WSHNonSequential) {\n if (!publicKeys.map(p => p.data).every(publicKeyIsCompressed)) {\n throw Error('Public keys must be compressed for segwit');\n }\n }\n switch (hashMode) {\n case AddressHashMode.P2PKH:\n return addressFromVersionHash(version, hashP2PKH(publicKeys[0].data));\n case AddressHashMode.P2WPKH:\n return addressFromVersionHash(version, hashP2WPKH(publicKeys[0].data));\n case AddressHashMode.P2SH:\n case AddressHashMode.P2SHNonSequential:\n return addressFromVersionHash(version, hashP2SH(numSigs, publicKeys.map(serializePublicKeyBytes)));\n case AddressHashMode.P2WSH:\n case AddressHashMode.P2WSHNonSequential:\n return addressFromVersionHash(version, hashP2WSH(numSigs, publicKeys.map(serializePublicKeyBytes)));\n }\n}\nexport function addressFromVersionHash(version, hash) {\n return { type: StacksWireType.Address, version, hash160: hash };\n}\nexport function addressToString(address) {\n return c32address(address.version, address.hash160);\n}\nexport function isTokenTransferPayload(p) {\n return p.payloadType === PayloadType.TokenTransfer;\n}\nexport function isContractCallPayload(p) {\n return p.payloadType === PayloadType.ContractCall;\n}\nexport function isSmartContractPayload(p) {\n return p.payloadType === PayloadType.SmartContract;\n}\nexport function isPoisonPayload(p) {\n return p.payloadType === PayloadType.PoisonMicroblock;\n}\nexport function isCoinbasePayload(p) {\n return p.payloadType === PayloadType.Coinbase;\n}\nexport function parseAssetString(id) {\n const [assetAddress, assetContractName, assetTokenName] = id.split(/\\.\|::/);\n const asset = createAsset(assetAddress, assetContractName, assetTokenName);\n return asset;\n}\nexport function parsePrincipalString(principalString) {\n if (principalString.includes('.')) {\n const [address, contractName] = principalString.split('.');\n return createContractPrincipal(address, contractName);\n }\n else {\n return createStandardPrincipal(principalString);\n }\n}\n//# sourceMappingURL=helpers.js.map","import { decodeToken, SECP256K1Client, TokenSigner, TokenVerifier } from 'jsontokens';\nimport { TokenInterface } from 'jsontokens/lib/decode';\nimport { nextYear, makeUUID4 } from '@stacks/common';\nimport { getAddressFromPublicKey } from '@stacks/transactions';\n\n/*\n Signs a profile token\n * @param {Object} profile - the JSON of the profile to be signed\n * @param {String} privateKey - the signing private key\n * @param {Object} subject - the entity that the information is about\n * @param {Object} issuer - the entity that is issuing the token\n * @param {String} signingAlgorithm - the signing algorithm to use\n * @param {Date} issuedAt - the time of issuance of the token\n * @param {Date} expiresAt - the time of expiration of the token\n * @returns {Object} - the signed profile token\n \n /\nexport function signProfileToken(\n profile: any,\n privateKey: string,\n subject?: any,\n issuer?: any,\n signingAlgorithm = 'ES256K',\n issuedAt = new Date(),\n expiresAt = nextYear()\n): string {\n if (signingAlgorithm !== 'ES256K') {\n throw new Error('Signing algorithm not supported');\n }\n\n const publicKey = SECP256K1Client.derivePublicKey(privateKey);\n\n if (!subject) {\n subject = { publicKey };\n }\n\n if (!issuer) {\n issuer = { publicKey };\n }\n\n const tokenSigner = new TokenSigner(signingAlgorithm, privateKey);\n\n const payload = {\n jti: makeUUID4(),\n iat: issuedAt.toISOString(),\n exp: expiresAt.toISOString(),\n subject,\n issuer,\n claim: profile,\n };\n\n return tokenSigner.sign(payload);\n}\n\n/*\n Wraps a token for a profile token file\n * @param {String} token - the token to be wrapped\n * @returns {Object} - including `token` and `decodedToken`\n /\nexport function wrapProfileToken(token: string) {\n return {\n token,\n decodedToken: decodeToken(token),\n };\n}\n\n/\n Verifies a profile token\n * @param {String} token - the token to be verified\n * @param {String} publicKeyOrAddress - the public key or address of the\n * keypair that is thought to have signed the token\n * @returns {Object} - the verified, decoded profile token\n * @throws {Error} - throws an error if token verification fails\n /\nexport function verifyProfileToken(token: string, publicKeyOrAddress: string): TokenInterface {\n const decodedToken = decodeToken(token);\n const payload = decodedToken.payload;\n if (typeof payload === 'string') {\n throw new Error('Unexpected token payload type of string');\n }\n\n // Inspect and verify the subject\n if (payload.hasOwnProperty('subject') && payload.subject) {\n if (!payload.subject.hasOwnProperty('publicKey')) {\n throw new Error(\"Token doesn't have a subject public key\");\n }\n } else {\n throw new Error(\"Token doesn't have a subject\");\n }\n\n // Inspect and verify the issuer\n if (payload.hasOwnProperty('issuer') && payload.issuer) {\n if (!payload.issuer.hasOwnProperty('publicKey')) {\n throw new Error(\"Token doesn't have an issuer public key\");\n }\n } else {\n throw new Error(\"Token doesn't have an issuer\");\n }\n\n // Inspect and verify the claim\n if (!payload.hasOwnProperty('claim')) {\n throw new Error(\"Token doesn't have a claim\");\n }\n\n const issuerPublicKey = (payload.issuer as Record<string, string>).publicKey;\n const address = getAddressFromPublicKey(issuerPublicKey);\n\n if (publicKeyOrAddress === issuerPublicKey) {\n // pass\n } else if (publicKeyOrAddress === address) {\n // pass\n } else {\n throw new Error('Token issuer public key does not match the verifying value');\n }\n\n const tokenVerifier = new TokenVerifier(decodedToken.header.alg as string, issuerPublicKey);\n if (!tokenVerifier) {\n throw new Error('Invalid token verifier');\n }\n\n const tokenVerified = tokenVerifier.verify(token);\n if (!tokenVerified) {\n throw new Error('Token verification failed');\n }\n\n return decodedToken;\n}\n\n/\n Extracts a profile from an encoded token and optionally verifies it,\n * if `publicKeyOrAddress` is provided.\n * @param {String} token - the token to be extracted\n * @param {String} publicKeyOrAddress - the public key or address of the\n * keypair that is thought to have signed the token\n * @returns {Object} - the profile extracted from the encoded token\n * @throws {Error} - if the token isn't signed by the provided `publicKeyOrAddress`\n /\nexport function extractProfile(\n token: string,\n publicKeyOrAddress: string \| null = null\n): Record<string, any> {\n let decodedToken;\n if (publicKeyOrAddress) {\n decodedToken = verifyProfileToken(token, publicKeyOrAddress);\n } else {\n decodedToken = decodeToken(token);\n }\n\n let profile = {};\n if (decodedToken.hasOwnProperty('payload')) {\n const payload = decodedToken.payload;\n if (typeof payload === 'string') {\n throw new Error('Unexpected token payload type of string');\n }\n if (payload.hasOwnProperty('claim')) {\n profile = payload.claim as Record<string, any>;\n }\n }\n\n return profile;\n}\n","import { ProfileType } from '../types';\n\n/\n \n * @param serviceName\n * @param data\n \n @ignore\n /\nfunction formatAccount(serviceName: string, data: any) {\n let proofUrl;\n if (data.proof && data.proof.url) {\n proofUrl = data.proof.url;\n }\n return {\n '@type': 'Account',\n service: serviceName,\n identifier: data.username,\n proofType: 'http',\n proofUrl,\n };\n}\n\n/\n \n * @param profile\n \n @ignore\n /\nexport function getPersonFromLegacyFormat(profile: any) {\n const profileData: {\n ['@type']: ProfileType;\n account?: any[];\n name?: string;\n description?: string;\n address?: {\n ['@type']: string;\n addressLocality: string;\n };\n image?: any[];\n website?: {\n ['@type']: string;\n url: string;\n }[];\n } = {\n '@type': 'Person',\n };\n\n if (profile) {\n if (profile.name && profile.name.formatted) {\n profileData.name = profile.name.formatted;\n }\n\n if (profile.bio) {\n profileData.description = profile.bio;\n }\n\n if (profile.location && profile.location.formatted) {\n profileData.address = {\n '@type': 'PostalAddress',\n addressLocality: profile.location.formatted,\n };\n }\n\n const images = [];\n if (profile.avatar && profile.avatar.url) {\n images.push({\n '@type': 'ImageObject',\n name: 'avatar',\n contentUrl: profile.avatar.url,\n });\n }\n if (profile.cover && profile.cover.url) {\n images.push({\n '@type': 'ImageObject',\n name: 'cover',\n contentUrl: profile.cover.url,\n });\n }\n if (images.length) {\n profileData.image = images;\n }\n\n if (profile.website) {\n profileData.website = [\n {\n '@type': 'WebSite',\n url: profile.website,\n },\n ];\n }\n\n const accounts = [];\n if (profile.bitcoin && profile.bitcoin.address) {\n accounts.push({\n '@type': 'Account',\n role: 'payment',\n service: 'bitcoin',\n identifier: profile.bitcoin.address,\n });\n }\n if (profile.twitter && profile.twitter.username) {\n accounts.push(formatAccount('twitter', profile.twitter));\n }\n if (profile.facebook && profile.facebook.username) {\n accounts.push(formatAccount('facebook', profile.facebook));\n }\n if (profile.github && profile.github.username) {\n accounts.push(formatAccount('github', profile.github));\n }\n\n if (profile.auth) {\n if (profile.auth.length > 0) {\n if (profile.auth[0] && profile.auth[0].publicKeychain) {\n accounts.push({\n '@type': 'Account',\n role: 'key',\n service: 'bip32',\n identifier: profile.auth[0].publicKeychain,\n });\n }\n }\n }\n if (profile.pgp && profile.pgp.url) {\n accounts.push({\n '@type': 'Account',\n role: 'key',\n service: 'pgp',\n identifier: profile.pgp.fingerprint,\n contentUrl: profile.pgp.url,\n });\n }\n\n profileData.account = accounts;\n }\n\n return profileData;\n}\n","const config = {\n network: {\n layer1: 'placeholder',\n },\n logLevel: 'debug',\n};\nexport { config };\n//# sourceMappingURL=config.js.map","import { config } from './config';\nconst levels = ['debug', 'info', 'warn', 'error', 'none'];\nconst levelToInt = {};\nconst intToLevel = {};\nfor (let index = 0; index < levels.length; index++) {\n const level = levels[index];\n levelToInt[level] = index;\n intToLevel[index] = level;\n}\nexport class Logger {\n static error(message) {\n if (!this.shouldLog('error'))\n return;\n console.error(this.logMessage('error', message));\n }\n static warn(message) {\n if (!this.shouldLog('warn'))\n return;\n console.warn(this.logMessage('warn', message));\n }\n static info(message) {\n if (!this.shouldLog('info'))\n return;\n console.log(this.logMessage('info', message));\n }\n static debug(message) {\n if (!this.shouldLog('debug'))\n return;\n console.log(this.logMessage('debug', message));\n }\n static logMessage(level, message) {\n return `[${level.toUpperCase()}] ${message}`;\n }\n static shouldLog(level) {\n const currentLevel = levelToInt[config.logLevel];\n return currentLevel <= levelToInt[level];\n }\n}\n//# sourceMappingURL=logger.js.map","import { extractProfile, signProfileToken } from './profileTokens';\n\nimport { getPersonFromLegacyFormat } from './profileSchemas';\nimport {\n getAddress,\n getAvatarUrl,\n getBirthDate,\n getConnections,\n getDescription,\n getFamilyName,\n getGivenName,\n getName,\n getOrganizations,\n getVerifiedAccounts,\n} from './profileSchemas/personUtils';\n\n// TODO: bring into this monorepo/convert to ts\n// @ts-ignore\nimport { makeZoneFile, parseZoneFile } from 'zone-file';\n\n// Could not find a declaration file for module\n// @ts-ignore\nimport as inspector from 'schema-inspector';\n\nimport { Logger } from '@stacks/common';\nimport { NetworkClientParam, clientFromNetwork, networkFrom } from '@stacks/network';\nimport { PublicPersonProfile } from './types';\n\nconst schemaDefinition: { [key: string]: any } = {\n type: 'object',\n properties: {\n '@context': { type: 'string', optional: true },\n '@type': { type: 'string' },\n },\n};\n\n/*\n Represents a user profile\n /\nexport class Profile {\n _profile: { [key: string]: any };\n\n constructor(profile = {}) {\n this._profile = Object.assign(\n {},\n {\n '@context': 'http://schema.org/',\n },\n profile\n );\n }\n\n toJSON() {\n return Object.assign({}, this._profile);\n }\n\n toToken(privateKey: string): string {\n return signProfileToken(this.toJSON(), privateKey);\n }\n\n static validateSchema(profile: any, strict = false): any {\n schemaDefinition.strict = strict;\n return inspector.validate(schemaDefinition, profile);\n }\n\n static fromToken(token: string, publicKeyOrAddress: string \| null = null): Profile {\n const profile = extractProfile(token, publicKeyOrAddress);\n return new Profile(profile);\n }\n\n static makeZoneFile(domainName: string, tokenFileURL: string): string {\n return makeProfileZoneFile(domainName, tokenFileURL);\n }\n}\n\nconst personSchemaDefinition = {\n type: 'object',\n strict: false,\n properties: {\n '@context': { type: 'string', optional: true },\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n name: { type: 'string', optional: true },\n givenName: { type: 'string', optional: true },\n familyName: { type: 'string', optional: true },\n description: { type: 'string', optional: true },\n image: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n name: { type: 'string', optional: true },\n contentUrl: { type: 'string', optional: true },\n },\n },\n },\n website: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n url: { type: 'string', optional: true },\n },\n },\n },\n account: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n service: { type: 'string', optional: true },\n identifier: { type: 'string', optional: true },\n proofType: { type: 'string', optional: true },\n proofUrl: { type: 'string', optional: true },\n proofMessage: { type: 'string', optional: true },\n proofSignature: { type: 'string', optional: true },\n },\n },\n },\n worksFor: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n },\n },\n },\n knows: {\n type: 'array',\n optional: true,\n items: {\n type: 'object',\n properties: {\n '@type': { type: 'string' },\n '@id': { type: 'string', optional: true },\n },\n },\n },\n address: {\n type: 'object',\n optional: true,\n properties: {\n '@type': { type: 'string' },\n streetAddress: { type: 'string', optional: true },\n addressLocality: { type: 'string', optional: true },\n postalCode: { type: 'string', optional: true },\n addressCountry: { type: 'string', optional: true },\n },\n },\n birthDate: { type: 'string', optional: true },\n taxID: { type: 'string', optional: true },\n },\n};\n\n/\n @ignore\n /\nexport class Person extends Profile {\n constructor(profile: PublicPersonProfile = { '@type': 'Person' }) {\n super(profile);\n this._profile = Object.assign(\n {},\n {\n '@type': 'Person',\n },\n this._profile\n );\n }\n\n static validateSchema(profile: any, strict = false) {\n personSchemaDefinition.strict = strict;\n return inspector.validate(schemaDefinition, profile);\n }\n\n static fromToken(token: string, publicKeyOrAddress: string \| null = null): Person {\n const profile = extractProfile(token, publicKeyOrAddress) as PublicPersonProfile;\n return new Person(profile);\n }\n\n static fromLegacyFormat(legacyProfile: any) {\n const profile = getPersonFromLegacyFormat(legacyProfile);\n return new Person(profile);\n }\n\n toJSON() {\n return {\n profile: this.profile(),\n name: this.name(),\n givenName: this.givenName(),\n familyName: this.familyName(),\n description: this.description(),\n avatarUrl: this.avatarUrl(),\n verifiedAccounts: this.verifiedAccounts(),\n address: this.address(),\n birthDate: this.birthDate(),\n connections: this.connections(),\n organizations: this.organizations(),\n };\n }\n\n profile() {\n return Object.assign({}, this._profile);\n }\n\n name() {\n return getName(this.profile());\n }\n\n givenName() {\n return getGivenName(this.profile());\n }\n\n familyName() {\n return getFamilyName(this.profile());\n }\n\n description() {\n return getDescription(this.profile());\n }\n\n avatarUrl() {\n return getAvatarUrl(this.profile());\n }\n\n verifiedAccounts(verifications?: any[]) {\n return getVerifiedAccounts(this.profile(), verifications);\n }\n\n address() {\n return getAddress(this.profile());\n }\n\n birthDate() {\n return getBirthDate(this.profile());\n }\n\n connections() {\n return getConnections(this.profile());\n }\n\n organizations() {\n return getOrganizations(this.profile());\n }\n}\n\n/\n \n * @param origin\n * @param tokenFileUrl\n \n @ignore\n /\nexport function makeProfileZoneFile(origin: string, tokenFileUrl: string): string {\n if (!tokenFileUrl.includes('://')) {\n throw new Error('Invalid token file url');\n }\n\n const urlScheme = tokenFileUrl.split('://')[0];\n const urlParts = tokenFileUrl.split('://')[1].split('/');\n const domain = urlParts[0];\n const pathname = `/${urlParts.slice(1).join('/')}`;\n\n const zoneFile = {\n $origin: origin,\n $ttl: 3600,\n uri: [\n {\n name: '_http._tcp',\n priority: 10,\n weight: 1,\n target: `${urlScheme}://${domain}${pathname}`,\n },\n ],\n };\n\n const zoneFileTemplate = '{$origin}\\n{$ttl}\\n{uri}\\n';\n\n return makeZoneFile(zoneFile, zoneFileTemplate);\n}\n\n/\n \n * @param zoneFileJson\n \n @ignore\n /\nexport function getTokenFileUrl(zoneFileJson: any): string \| null {\n if (!zoneFileJson.hasOwnProperty('uri')) {\n return null;\n }\n if (!Array.isArray(zoneFileJson.uri)) {\n return null;\n }\n if (zoneFileJson.uri.length < 1) {\n return null;\n }\n\n const validRecords = zoneFileJson.uri.filter(\n (record: any) => record.hasOwnProperty('target') && record.name === '_http._tcp'\n );\n\n if (validRecords.length < 1) {\n return null;\n }\n\n const firstValidRecord = validRecords[0];\n\n if (!firstValidRecord.hasOwnProperty('target')) {\n return null;\n }\n let tokenFileUrl = firstValidRecord.target;\n\n if (tokenFileUrl.startsWith('https')) {\n // pass\n } else if (tokenFileUrl.startsWith('http')) {\n // pass\n } else {\n tokenFileUrl = `https://${tokenFileUrl}`;\n }\n\n return tokenFileUrl;\n}\n\n/\n \n * @param zoneFile\n * @param publicKeyOrAddress\n \n @ignore\n /\nexport function resolveZoneFileToProfile(\n opts: {\n zoneFile: any;\n publicKeyOrAddress: string;\n } & NetworkClientParam\n): Promise<Record<string, any>> {\n const network = networkFrom(opts.network ?? 'mainnet');\n const client = Object.assign({}, clientFromNetwork(network), opts.client);\n\n return new Promise((resolve, reject) => {\n let zoneFileJson = null;\n try {\n zoneFileJson = parseZoneFile(opts.zoneFile);\n if (!zoneFileJson.hasOwnProperty('$origin')) {\n zoneFileJson = null;\n }\n } catch (e) {\n reject(e);\n }\n\n let tokenFileUrl: string \| null = null;\n if (zoneFileJson && Object.keys(zoneFileJson).length > 0) {\n tokenFileUrl = getTokenFileUrl(zoneFileJson);\n } else {\n try {\n return resolve(Person.fromLegacyFormat(JSON.parse(opts.zoneFile)).profile());\n } catch (error) {\n return reject(error);\n }\n }\n\n if (tokenFileUrl) {\n client\n .fetch(tokenFileUrl)\n .then(response => response.text())\n .then(responseText => JSON.parse(responseText))\n .then(responseJson => {\n const tokenRecords = responseJson;\n const profile = extractProfile(tokenRecords[0].token, opts.publicKeyOrAddress);\n resolve(profile);\n })\n .catch(error => {\n Logger.error(\n `resolveZoneFileToProfile: error fetching token file ${tokenFileUrl}: ${error}`\n );\n reject(error);\n });\n } else {\n Logger.debug('Token file url not found. Resolving to blank profile.');\n resolve({});\n }\n });\n}\n","export function getName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let name = null;\n if (profile.name) {\n name = profile.name;\n } else if (profile.givenName \|\| profile.familyName) {\n name = '';\n if (profile.givenName) {\n name = profile.givenName;\n }\n if (profile.familyName) {\n name += ` ${profile.familyName}`;\n }\n }\n return name;\n}\n\n/\n \n * @ignore\n /\nexport function getGivenName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let givenName = null;\n if (profile.givenName) {\n givenName = profile.givenName;\n } else if (profile.name) {\n const nameParts = profile.name.split(' ');\n givenName = nameParts.slice(0, -1).join(' ');\n }\n return givenName;\n}\n\n/\n \n * @ignore\n /\nexport function getFamilyName(profile: any) {\n if (!profile) {\n return null;\n }\n\n let familyName = null;\n if (profile.familyName) {\n familyName = profile.familyName;\n } else if (profile.name) {\n const nameParts = profile.name.split(' ');\n familyName = nameParts.pop();\n }\n return familyName;\n}\n\n/\n \n * @ignore\n /\nexport function getDescription(profile: any) {\n if (!profile) {\n return null;\n }\n\n let description = null;\n if (profile.description) {\n description = profile.description;\n }\n return description;\n}\n\n/\n \n * @ignore\n /\nexport function getAvatarUrl(profile: any) {\n if (!profile) {\n return null;\n }\n\n let avatarContentUrl: string \| null = null;\n if (profile.image) {\n profile.image.map((image: any) => {\n if (image.name === 'avatar') {\n avatarContentUrl = image.contentUrl;\n return avatarContentUrl;\n } else {\n return null;\n }\n });\n }\n return avatarContentUrl;\n}\n\n/\n \n * @ignore\n /\nexport function getVerifiedAccounts(profile: any, verifications?: any[]) {\n if (!profile) {\n return null;\n }\n\n const filteredAccounts: any[] = [];\n if (profile.hasOwnProperty('account') && verifications) {\n profile.account.map((account: any) => {\n let accountIsValid = false;\n let proofUrl = null;\n\n verifications.map(verification => {\n if (verification.hasOwnProperty('proof_url')) {\n verification.proofUrl = verification.proof_url;\n }\n if (\n verification.valid &&\n verification.service === account.service &&\n verification.identifier === account.identifier &&\n verification.proofUrl\n ) {\n accountIsValid = true;\n proofUrl = verification.proofUrl;\n return true;\n } else {\n return false;\n }\n });\n\n if (accountIsValid) {\n account.proofUrl = proofUrl;\n filteredAccounts.push(account);\n return account;\n } else {\n return null;\n }\n });\n }\n return filteredAccounts;\n}\n\n/\n \n * @ignore\n /\nexport function getOrganizations(profile: any) {\n if (!profile) {\n return null;\n }\n\n const organizations: any[] = [];\n\n if (profile.hasOwnProperty('worksFor')) {\n return profile.worksFor;\n }\n\n return organizations;\n}\n\n/\n \n * @ignore\n /\nexport function getConnections(profile: any) {\n if (!profile) {\n return null;\n }\n\n let connections = [];\n\n if (profile.hasOwnProperty('knows')) {\n connections = profile.knows;\n }\n\n return connections;\n}\n\n/\n \n * @ignore\n /\nexport function getAddress(profile: any) {\n if (!profile) {\n return null;\n }\n\n let addressString = null;\n\n if (profile.hasOwnProperty('address')) {\n const addressParts = [];\n\n if (profile.address.hasOwnProperty('streetAddress')) {\n addressParts.push(profile.address.streetAddress);\n }\n if (profile.address.hasOwnProperty('addressLocality')) {\n addressParts.push(profile.address.addressLocality);\n }\n if (profile.address.hasOwnProperty('postalCode')) {\n addressParts.push(profile.address.postalCode);\n }\n if (profile.address.hasOwnProperty('addressCountry')) {\n addressParts.push(profile.address.addressCountry);\n }\n\n if (addressParts.length) {\n addressString = addressParts.join(', ');\n }\n }\n\n return addressString;\n}\n\n/\n \n * @ignore\n /\nexport function getBirthDate(profile: any) {\n if (!profile) {\n return null;\n }\n\n const monthNames = [\n 'January',\n 'February',\n 'March',\n 'April',\n 'May',\n 'June',\n 'July',\n 'August',\n 'September',\n 'October',\n 'November',\n 'December',\n ];\n\n let birthDateString = null;\n\n if (profile.hasOwnProperty('birthDate')) {\n const date = new Date(profile.birthDate);\n birthDateString = `${monthNames[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;\n }\n\n return birthDateString;\n}\n","import { createFetchFn, FetchFn } from '@stacks/common';\nimport { parseZoneFile } from 'zone-file';\n\nimport { getTokenFileUrl, Person } from '../profile';\nimport { extractProfile } from '../profileTokens';\n\n/\n \n * @param zoneFile\n * @param publicKeyOrAddress\n * @param callback\n \n @ignore\n */\nexport function resolveZoneFileToPerson(\n zoneFile: any,\n publicKeyOrAddress: string,\n callback: (profile: any) => void,\n fetchFn: FetchFn = createFetchFn()\n) {\n let zoneFileJson = null;\n try {\n zoneFileJson = parseZoneFile(zoneFile);\n if (!zoneFileJson.hasOwnProperty('$origin')) {\n zoneFileJson = null;\n throw new Error('zone file is missing an origin');\n }\n } catch (e) {\n console.error(e);\n }\n\n let tokenFileUrl = null;\n if (zoneFileJson && Object.keys(zoneFileJson).length > 0) {\n tokenFileUrl = getTokenFileUrl(zoneFileJson);\n } else {\n let profile = null;\n try {\n profile = JSON.parse(zoneFile);\n const person = Person.fromLegacyFormat(profile);\n profile = person.profile();\n } catch (error) {\n console.warn(error);\n }\n callback(profile);\n return;\n }\n\n if (tokenFileUrl) {\n fetchFn(tokenFileUrl)\n .then((response: any) => response.text())\n .then((responseText: any) => JSON.parse(responseText))\n .then((responseJson: any) => {\n const tokenRecords = responseJson;\n const token = tokenRecords[0].token;\n const profile = extractProfile(token, publicKeyOrAddress);\n\n callback(profile);\n })\n .catch((error: any) => {\n console.warn(error);\n });\n } else {\n console.warn('Token file url not found');\n callback({});\n }\n}\n"],"names":["root","factory","exports","module","define","amd","this","leafPrototypes","getProto","number","n","Number","isSafeInteger","Error","bool","b","bytes","lengths","Uint8Array","TypeError","length","includes","hash","create","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","output","out","min","Object","defineProperty","value","assert","SHA2","_assert_js_1","utils_js_1","Hash","constructor","padOffset","isLE","super","pos","buffer","view","createView","update","data","default","len","toBytes","take","Math","set","subarray","process","dataView","roundClean","digestInto","fill","i","byteOffset","setBigUint64","_32n","BigInt","_u32_max","wh","wl","h","l","setUint32","oview","outLen","state","get","digest","res","slice","destroy","_cloneInto","to","crypto","node","undefined","web","self","hmac","HMAC","_key","key","iHash","pad","oHash","buf","getPrototypeOf","message","sha224","sha256","_sha2_js_1","Maj","a","c","SHA256_K","Uint32Array","IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","offset","getUint32","W15","W2","s0","rotr","s1","T1","T2","SHA224","wrapConstructor","randomBytes","wrapConstructorWithOpts","checkOpts","concatBytes","utf8ToBytes","asyncLoop","nextTick","hexToBytes","bytesToHex","u32","u8","crypto_1","arr","byteLength","floor","DataView","word","shift","hexes","Array","from","v","toString","padStart","str","TextEncoder","encode","uint8a","hex","array","j","hexByte","byte","parseInt","isNaN","async","iters","tick","cb","ts","Date","now","diff","arrays","every","reduce","result","clone","defaults","opts","obj","prototype","call","assign","hashConstructor","hashC","tmp","hashCons","msg","bytesLength","getRandomValues","utils","schnorr","verify","signSync","sign","getSharedSecret","recoverPublicKey","getPublicKey","Signature","Point","CURVE","nodeCrypto","_0n","_1n","_2n","_3n","_8n","freeze","P","Gx","Gy","beta","divNearest","endo","splitScalar","k","a1","b1","a2","b2","POW_2_128","c1","c2","k1","mod","k2","k1neg","k2neg","fieldLen","groupLen","compressedLen","uncompressedLen","weierstrass","x","x2","x3","USE_ENDOMORPHISM","ShaError","assertJacPoint","other","JacobianPoint","y","z","fromAffine","p","equals","ZERO","toAffineBatch","points","toInv","nums","scratch","inverted","invert","acc","num","reduceRight","invertBatch","map","toAffine","normalizeZ","X1","Y1","Z1","X2","Y2","Z2","Z1Z1","Z2Z2","U1","U2","S1","S2","negate","double","x1b","X3","Y3","Z3","add","r","HH","HHH","V","subtract","multiplyUnsafe","scalar","P0","normalizeScalar","d","k1p","k2p","precomputeWindow","W","windows","base","window","push","wNAF","affinePoint","BASE","_WINDOW_SIZE","precomputes","pointPrecomputes","f","windowSize","mask","maxNumber","shiftBy","wbits","offset1","offset2","abs","cond1","cond2","constTimeNegate","multiply","point","fake","f1p","f2p","invZ","is0","iz1","iz2","iz3","ax","ay","zz","condition","item","neg","WeakMap","_setWindowSize","delete","hasEvenY","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","_6n","_11n","_22n","_23n","_44n","_88n","b3","b6","pow2","b9","b11","b22","b44","b88","b176","b220","b223","t1","t2","rt","sqrtMod","isYOdd","assertValidity","fromUncompressedHex","fromHex","ensureBytes","header","fromPrivateKey","privateKey","normalizePrivateKey","fromSignature","msgHash","signature","recovery","s","normalizeSignature","truncateHash","radj","rinv","u1","u2","prefix","R","numTo32bStr","Q","multiplyAndAddUnsafe","toRawBytes","isCompressed","toHex","toHexX","toRawX","left","aP","bQ","sum","sliceDER","parseDERInt","fromCompact","name","hexToNumber","fromDER","sBytes","rBytesLeft","parseDERSignature","isWithinCurveOrder","hasHighS","HALF","normalizeS","toDERRawBytes","toDERHex","sHex","numberToHexUnpadded","rHex","sHexL","rHexL","sLen","rLen","toCompactRawBytes","toCompactHex","POW_2_256","numTo32b","power","modulo","u","q","m","truncateOnly","delta","bits2int_2","_sha256Sync","_hmacSha256Sync","HmacDrbg","hashLen","qByteLen","counter","values","hmacSha256","hmacSync","checkSync","incr","reseed","seed","reseedSync","generate","sl","generateSync","kmdToSig","kBytes","lowS","kinv","sig","normalizePublicKey","publicKey","error","isProbPub","bits2int","bits2octets","z1","z2","int2octets","initSigArgs","extraEntropy","h1","seedArgs","e","finalizeSig","recSig","der","recovered","canonical","hashed","privateA","publicB","privKey","drbg","vopts","strict","schnorrChallengeFinalize","ch","sinv","SchnorrSignature","InternalSchnorrSignature","auxRand","getScalar","px","rand","priv","initNonce","t0h","finalizeNonce","k0h","k0","rx","calc","tag","taggedHash","t","TAGS","aux","nonce","challenge","schnorrVerify","calcSync","taggedHashSync","schnorrVerifySync","initSchnorrVerify","raw","finalizeSchnorrVerify","verifySync","TAGGED_HASH_PREFIXES","isValidPrivateKey","_bigintTo32Bytes","_normalizePrivateKey","hashToPrivateKey","minLen","randomPrivateKey","precompute","cached","messages","subtle","createHash","forEach","ckey","importKey","createHmac","sha256Sync","hmacSha256Sync","tagP","tagH","charCodeAt","_JacobianPoint","defineProperties","configurable","val","ALPHABET","BASE_MAP","charAt","xc","LEADER","FACTOR","log","iFACTOR","decodeUnsafe","source","psz","zeroes","size","b256","carry","it3","it4","vch","ArrayBuffer","isView","isArray","pbegin","pend","b58","it1","it2","repeat","decode","string","b64","lens","getLens","validLen","placeHoldersLen","toByteArray","Arr","_byteLength","curByte","revLookup","fromByteArray","uint8","extraBytes","parts","maxChunkLength","len2","encodeChunk","lookup","join","code","indexOf","start","end","c32ToB58","b58ToC32","c32addressDecode","c32address","versions","checksum_1","base58check","utils_1","mainnet","p2pkh","p2sh","testnet","ADDR_BITCOIN_TO_STACKS","ADDR_STACKS_TO_BITCOIN","version","hash160hex","match","c32checkEncode","c32addr","c32checkDecode","b58check","addrInfo","hash160String","addrVersion","stacksVersion","c32string","bitcoinVersion","sha256_1","basex","dataBytes","prefixBytes","checksum","check","index","encoding_1","c32checksum","dataHex","dataHash","toLowerCase","versionHex","checksumHex","c32str","c32encode","c32","c32data","c32normalize","c32decode","versionChar","substring","c32input","toUpperCase","replace","inputHex","minLength","currentCode","nextCode","nextBits","nextLowBits","curC32Digit","unshift","C32leadingZeros","zeroPrefix","TextDecoder","numLeadingZeroBytesInHex","count","numLeadingZeroBytes","carryBits","currentValue","currentHexDigit","hexLeadingZeros","hexStr","address_1","enumerable","unescape","escape","base64_js_1","base64","base64Url","cryptoClients","SECP256K1Client","secp256k1_1","ES256K","hmac_1","secp","ecdsaSigFormatter_1","errors_1","msgs","derivePublicKey","compressed","signHash","signingInputHash","format","MissingParametersError","derSignature","derToJose","loadSignature","joseSignature","joseToDer","verifyHash","derSignatureBytes","algorithmName","__awaiter","thisArg","_arguments","generator","Promise","resolve","reject","fulfilled","step","next","rejected","done","then","apply","hashSha256Async","hashSha256","input","console","decodeToken","base64url","token","tokenParts","split","JSON","parse","payload","allHeaders","headerValue","base64Url_1","getParamSize","keySize","paramBytesForAlg","ES256","ES384","ES512","getParamBytesForAlg","alg","paramBytes","MAX_OCTET","signatureAsBytes","countPadding","stop","padding","signatureBytes","maxEncodedParamLength","inputLength","TAG_SEQ","seqLength","TAG_INT","rLength","rOffset","sLength","sOffset","rPadding","sPadding","dst","max","o","rsBytes","shortLength","InvalidTokenError","__createBinding","desc","getOwnPropertyDescriptor","__esModule","writable","__exportStar","hasOwnProperty","TokenSigner","createUnsecuredToken","cryptoClients_1","createSigningInput","encodedHeader","stringify","encodedPayload","typ","signingAlgorithm","rawPrivateKey","tokenType","cryptoClient","defaultHeader","expanded","customHeader","signingInput","createWithSignedHash","signAsync","TokenVerifier","rawPublicKey","verifyCompact","verifyExpanded","verifyAsync","performVerify","verified","HASH_UNDEFINED","MAX_SAFE_INTEGER","argsTag","boolTag","dateTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reFlags","reIsHostCtor","reIsUint","cloneableTags","freeGlobal","g","freeSelf","Function","freeExports","nodeType","freeModule","moduleExports","addMapEntry","pair","addSetEntry","arrayReduce","iteratee","accumulator","initAccum","isHostObject","mapToArray","overArg","func","transform","arg","setToArray","uid","arrayProto","funcProto","objectProto","coreJsData","maskSrcKey","exec","keys","IE_PROTO","funcToString","objectToString","reIsNative","RegExp","Buffer","Symbol","getPrototype","objectCreate","propertyIsEnumerable","splice","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeKeys","getNative","Map","Set","nativeCreate","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","entries","clear","entry","ListCache","MapCache","Stack","__data__","assignValue","object","objValue","eq","assocIndexOf","baseClone","isDeep","isFull","customizer","stack","isObject","isArr","initCloneArray","copyArray","getTag","isFunc","copy","cloneBuffer","isPrototype","proto","initCloneObject","copyObject","getSymbols","copySymbols","baseAssign","cloneFunc","symbol","Ctor","cloneArrayBuffer","cloneDataView","typedArray","cloneTypedArray","cloneMap","regexp","lastIndex","cloneRegExp","cloneSet","initCloneByTag","stacked","props","keysFunc","symbolsFunc","arrayPush","baseGetAllKeys","getAllKeys","arrayEach","subValue","arrayBuffer","newValue","getMapData","type","getValue","isFunction","test","baseIsNative","has","pop","cache","pairs","LARGE_ARRAY_SIZE","isIndex","ctorString","isArrayLike","isLength","inherited","isObjectLike","isArrayLikeObject","isArguments","baseTimes","String","skipIndexes","arrayLikeKeys","baseKeys","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","setTimeout","clearTimeout","currentQueue","queue","draining","queueIndex","cleanUpNextTick","concat","drainQueue","timeout","run","marker","runClearTimeout","Item","noop","args","arguments","title","browser","env","argv","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","_extend","origin","_merge","ret","Customisable","custom","extend","reset","remove","fields","_typeIs","field","Inspection","schema","_stack","_schema","_custom","_getDepth","_dumpStack","_deeperObject","_deeperArray","_back","function","element","integer","NaN","boolean","null","date","any","_simpleType","candidate","getIndexes","indexes","_formats","void","url","coolDateTime","time","color","email","numeric","decimal","alpha","alphaNumeric","alphaDash","javascript","upperString","lowerString","v4uuid","_validationAttribut","optional","report","types","some","_realType","uniqueness","reported","pattern","regexs","matches","regex","validDate","getTime","maxLength","exactLength","lt","limit","lte","gt","gte","ne","someKeys","candidat","_keys","action","properties","intruder","filter","callback","asyncExec","asyncProperties","_validate","items","asyncItems","_asyncValidationAttribut","eachSeries","series","_asyncValidate","err","timesSeries","Validation","_error","_basicFields","_customFields","reason","newErr","userCode","userError","property","userAlias","valid","validate","alias","_forceType","post","def","parseFloat","joinWith","splitWith","_applyRules","upper","lower","txt","substr","capitalize","ucfirst","trim","_sanitizationAttribut","opt","rules","modified","rule","postTest","gap","_sanitize","_asyncSanitizationAttribut","execs","globing","_asyncSanitize","Sanitization","_reporting","newNot","reporting","sanitize","waterfall","inter","INT_MAX","_rand","int","random","float","char","fromCharCode","fromList","list","_formatSample","toISOString","toLocaleTimeString","hour12","_getLimits","_typeGenerator","prop","rk","randomKey","CandidateGenerator","_instance","SchemaInspector","newSanitization","newValidation","arrayLike","newLen","newArr","idx","fn","callArgs","initialParams","hasSetImmediate","setImmediate","hasNextTick","fallback","wrap","defer","setImmediate$1","asyncify","invokeCallback","rethrow","supportsSymbol","isAsync","toStringTag","wrapAsync","asyncFn","applyEach$1","eachfn","fns","go","that","Symbol$1","nativeObjectToString","symToStringTag$1","nativeObjectToString$1","nullTag","undefinedTag","symToStringTag","baseGetTag","isOwn","unmasked","getRawTag","asyncTag","proxyTag","breakLoop","callFn","iteratorSymbol","iterator","getIterator","coll","baseIsArguments","objectProto$3","hasOwnProperty$2","MAX_SAFE_INTEGER$1","typedArrayTags","freeExports$1","freeModule$1","freeProcess","nodeUtil","require","nodeIsTypedArray","isTypedArray","hasOwnProperty$1","isArg","isBuff","isType","objectProto$5","hasOwnProperty$3","createArrayIterator","okeys","createES2015Iterator","onlyOnce","_eachOfLimit","nextElem","running","looping","iterateeCallback","replenish","elem","eachOfLimit","doLimit","iterable","eachOfArrayLike","completed","iteratorCallback","eachOfGeneric","Infinity","eachOf","doParallel","_asyncMap","results","_iteratee","_","applyEach","doParallelLimit","mapLimit","mapSeries","applyEachSeries","fromRight","baseFor","baseForOwn","baseIsNaN","baseIndexOf","fromIndex","strictIndexOf","predicate","baseFindIndex","auto","tasks","concurrency","numTasks","runningTasks","hasError","readyTasks","readyToCheck","uncheckedDependencies","enqueueTask","task","taskCallback","safeResults","rkey","processQueue","taskFn","runTask","getDependents","taskName","dependencies","remainingDependencies","dependencyName","taskListeners","dependent","checkForDeadlocks","arrayMap","INFINITY","symbolToString","baseToString","isSymbol","castSlice","baseSlice","reHasUnicode","rsAstralRange$1","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","reUnicode","stringToArray","hasUnicode","unicodeToArray","asciiToArray","reTrim","chars","guard","strSymbols","chrSymbols","charsStartIndex","charsEndIndex","FN_ARGS","FN_ARG_SPLIT","FN_ARG","STRIP_COMMENTS","autoInject","newTasks","params","fnIsAsync","hasNoDeps","newTask","parseParams","taskCb","newArgs","DLL","head","tail","setInitial","dll","worker","_worker","numRunning","workersList","processingScheduled","_insert","insertAtFront","started","idle","drain","_tasks","_next","unsaturated","isProcessing","saturated","empty","paused","kill","testFn","pause","resume","cargo","removeLink","prev","insertAfter","newNode","insertBefore","toArray","curr","eachOfSeries","memo","seq","_functions","newargs","nextargs","compose","reverse","_concat","concatLimit","mapResults","concatSeries","constant","identity","_createTester","getResult","testResult","testPassed","_findGetResult","detect","detectLimit","detectSeries","consoleFunc","doDuring","_fn","_test","truth","doWhilst","doUntil","during","_withoutIndex","eachLimit","eachLimit$1","ensureAsync","sync","innerArgs","notId","everyLimit","everySeries","baseProperty","filterArray","truthValues","filterGeneric","sort","_filter","filterLimit","filterSeries","forever","errback","groupByLimit","groupBy","groupBySeries","mapValuesLimit","newObj","mapValues","mapValuesSeries","memoize","hasher","queues","memoized","unmemoized","_parallel","parallelLimit","parallelLimit$1","queue$1","priorityQueue","priority","nextNode","race","reflect","reflectCallback","cbArg","reflectAll","reject$1","rejectLimit","rejectSeries","constant$1","retry","options","times","intervalFunc","interval","errorFilter","parseTimes","_task","attempt","retryAttempt","retryable","Boolean","someLimit","someSeries","sortBy","comparator","right","criteria","milliseconds","info","timer","timedOut","nativeCeil","ceil","nativeMax","timeLimit","baseRange","tryEach","unmemoize","whilst","until","taskIndex","nextTask","each","parallel","timesLimit","all","allLimit","allSeries","anyLimit","anySeries","find","findLimit","findSeries","forEachSeries","forEachLimit","forEachOf","forEachOfSeries","forEachOfLimit","inject","foldl","foldr","select","selectLimit","selectSeries","wrapSync","bind","$origin","$ttl","ttl","soa","host","ns","ip","aaaa","cname","preference","mx","ptr","weight","port","target","srv","spf","round","uri","replacement","minimum","expire","refresh","serial","rname","mname","lastIndexOf","fullname","jsonZoneFile","toJSON","makeZoneFile","parseZoneFile","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","id","loaded","__webpack_modules__","mode","current","getOwnPropertyNames","definition","globalThis","nmd","paths","children","makeUUID4","performance","defaultFetchOpts","referrerPolicy","headers","fetchWrapper","init","fetchOpts","fetch","createFetchFn","fetchLib","middlewares","argsForCreateFetchFn","fetchParams","middleware","pre","response","ChainId","PeerNetworkId","AddressVersion","TransactionVersion","Mainnet","chainId","transactionVersion","peerNetworkId","magicBytes","bootAddress","addressVersion","singleSig","MainnetSingleSig","multiSig","MainnetMultiSig","client","baseUrl","STACKS_TESTNET","Testnet","TestnetSingleSig","TestnetMultiSig","STACKS_DEVNET","STACKS_MOCKNET","network","networkFromName","ClarityVersion","AnchorMode","PayloadType","PostConditionMode","PostConditionType","AuthType","FungibleConditionCode","NonFungibleConditionCode","PostConditionPrincipalId","AssetType","TenureChangeCause","AuthFieldType","TxRejectedReason","PubKeyEncoding","AddressHashMode","OnChainOnly","OffChainOnly","Any","Rho","Id","Pi","idxL","idxR","shifts","shiftsL","shiftsR","Kl","Kr","rotl","group","BUF","RIPEMD160","h0","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sr","tl","tr","ripemd160","U32_MASK64","fromBig","le","lst","Ah","Al","Bh","Bl","Cl","low","Ch","Dl","Dh","Eh","El","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","SHA512_224","SHA512_256","SHA384","StacksWireType","getAddressFromPublicKey","addrVer","hashMode","P2PKH","P2SH","P2SHNonSequential","P2WPKH","P2WSH","P2WSHNonSequential","addressHashModeToVersion","address","Address","hash160","signProfileToken","profile","subject","issuer","issuedAt","expiresAt","setFullYear","getFullYear","nextYear","tokenSigner","jti","iat","exp","claim","wrapProfileToken","decodedToken","verifyProfileToken","publicKeyOrAddress","issuerPublicKey","tokenVerifier","extractProfile","formatAccount","serviceName","proofUrl","proof","service","identifier","username","proofType","levels","levelToInt","intToLevel","level","shouldLog","logMessage","warn","debug","schemaDefinition","Profile","_profile","toToken","validateSchema","fromToken","domainName","tokenFileURL","makeProfileZoneFile","personSchemaDefinition","givenName","familyName","description","image","contentUrl","website","account","proofMessage","proofSignature","worksFor","knows","streetAddress","addressLocality","postalCode","addressCountry","birthDate","taxID","Person","fromLegacyFormat","legacyProfile","profileData","formatted","bio","location","images","avatar","cover","accounts","bitcoin","role","twitter","facebook","github","auth","publicKeychain","pgp","fingerprint","getPersonFromLegacyFormat","avatarUrl","verifiedAccounts","connections","organizations","getName","getGivenName","getFamilyName","getDescription","avatarContentUrl","getAvatarUrl","verifications","filteredAccounts","accountIsValid","verification","proof_url","getVerifiedAccounts","addressString","addressParts","getAddress","monthNames","birthDateString","getMonth","getDate","getBirthDate","getConnections","tokenFileUrl","urlScheme","urlParts","zoneFile","getTokenFileUrl","zoneFileJson","validRecords","record","firstValidRecord","startsWith","resolveZoneFileToProfile","clientFromNetwork","text","responseText","responseJson","catch","resolveZoneFileToPerson","fetchFn"],"sourceRoot":""}