npm - @dr.pogodin/react-utils - Versions diffs - 1.23.9 → 1.23.11 - Mend

@dr.pogodin/react-utils 1.23.9 → 1.23.11

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

package/build/production/web.bundle.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"web.bundle.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,EAAQG,QAAQ,kCAAmCA,QAAQ,4BAA6BA,QAAQ,SAAUA,QAAQ,SAAUA,QAAQ,UAAWA,QAAQ,cAAeA,QAAQ,MAAOA,QAAQ,SAAUA,QAAQ,aAAcA,QAAQ,oBAAqBA,QAAQ,gBAAiBA,QAAQ,qBACnR,mBAAXC,QAAyBA,OAAOC,IAC9CD,OAAO,CAAC,iCAAkC,2BAA4B,QAAS,QAAS,SAAU,aAAc,KAAM,QAAS,YAAa,mBAAoB,eAAgB,oBAAqBJ,GAC3K,iBAAZC,QACdA,QAAQ,2BAA6BD,EAAQG,QAAQ,kCAAmCA,QAAQ,4BAA6BA,QAAQ,SAAUA,QAAQ,SAAUA,QAAQ,UAAWA,QAAQ,cAAeA,QAAQ,MAAOA,QAAQ,SAAUA,QAAQ,aAAcA,QAAQ,oBAAqBA,QAAQ,gBAAiBA,QAAQ,qBAEhUJ,EAAK,2BAA6BC,EAAQD,EAAK,kCAAmCA,EAAK,4BAA6BA,EAAY,MAAGA,EAAY,MAAGA,EAAa,OAAGA,EAAK,cAAeA,EAAS,GAAGA,EAAY,MAAGA,EAAK,aAAcA,EAAK,oBAAqBA,EAAK,gBAAiBA,EAAK,oBAC1R,CATD,CASmB,oBAATO,KAAuBA,KAAOC,MAAM,SAASC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,gCAAiCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,kCAC5a,0ECRA,IAAIC,EADJC,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,IAEtD,SAAWH,GACPA,EAAe,QAAI,UACnBA,EAAgB,SAAI,WACpBA,EAAgB,SAAI,UACvB,CAJD,CAIGA,IAAUA,EAAQ,CAAC,IA6CtBnB,EAAA,QAtCA,cAAsBuB,QAClBC,YAAYC,GACR,IAAIC,EACAC,EACJC,OAAM,CAACC,EAASC,KACZJ,EAAcJ,IACVO,EAAQP,GACRhB,KAAKyB,QAAUZ,EAAMa,QAAQ,EAEjCL,EAAaM,IACTH,EAAOG,GACP3B,KAAKyB,QAAUZ,EAAMe,QAAQ,EAE7BT,GACAA,EAASC,EAAYC,EAAU,IAEvCrB,KAAKyB,QAAUZ,EAAMgB,QACrB7B,KAAK8B,UAAYV,EACjBpB,KAAK+B,SAAWV,CACpB,CACIE,cAAY,OAAOvB,KAAK8B,SAAW,CACnCN,aAAW,OAAOxB,KAAK+B,QAAU,CACjCC,eAAa,OAAOhC,KAAKyB,UAAYZ,EAAMa,QAAU,CACrDO,eAAa,OAAOjC,KAAKyB,UAAYZ,EAAMe,QAAU,CACrDM,cAAY,OAAOlC,KAAKyB,UAAYZ,EAAMgB,OAAS,CACvDM,MAAMC,GACF,OAAOd,MAAMa,MAAMC,EACvB,CACAC,QAAQC,GACJ,OAAOhB,MAAMe,QAAQC,EACzB,CACAC,KAAKC,EAAaJ,GACd,MAAMK,EAAMnB,MAAMiB,KAAKC,EAAaJ,GAGpC,OAFAK,EAAIX,UAAY9B,KAAKuB,QACrBkB,EAAIV,SAAW/B,KAAKwB,OACbiB,CACX,mCCjDJ3B,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,IA+CtDtB,EAAA,QA3CA,MACIwB,cACIlB,KAAK0C,YAAc,EACvB,CAKIC,mBACA,QAAS3C,KAAK0C,YAAYE,MAC9B,CACIC,gBAAc,OAAO7C,KAAK0C,WAAa,CAM3CI,YAAYC,GAIR,OAHK/C,KAAK0C,YAAYM,SAASD,IAC3B/C,KAAK0C,YAAYO,KAAKF,GAEnB,IAAM/C,KAAKkD,eAAeH,EACrC,CAKAI,QAAQC,GACJ,MAAQV,YAAaG,GAAc7C,KACnC,IAAK,IAAIqD,EAAI,EAAGA,EAAIR,EAAUD,SAAUS,EACpCR,EAAUQ,MAAMD,EAExB,CAKAF,eAAeH,GACX,MAAMO,EAAMtD,KAAK0C,YAAYa,QAAQR,GACjCO,GAAO,GACPtD,KAAK0C,YAAYc,OAAOF,EAAK,EACrC,qCC7CJ,IAAIG,EAAazD,MAAQA,KAAKyD,WAAc,SAAUC,EAASC,EAAYC,EAAGC,GAE1E,OAAO,IAAKD,IAAMA,EAAI3C,WAAU,SAAUM,EAASC,GAC/C,SAASsC,EAAU9C,GAAS,IAAM+C,EAAKF,EAAUG,KAAKhD,GAAS,CAAE,MAAOiD,GAAKzC,EAAOyC,EAAI,CAAE,CAC1F,SAAShC,EAASjB,GAAS,IAAM+C,EAAKF,EAAiB,MAAE7C,GAAS,CAAE,MAAOiD,GAAKzC,EAAOyC,EAAI,CAAE,CAC7F,SAASF,EAAKG,GAJlB,IAAelD,EAIakD,EAAOC,KAAO5C,EAAQ2C,EAAOlD,QAJ1CA,EAIyDkD,EAAOlD,MAJhDA,aAAiB4C,EAAI5C,EAAQ,IAAI4C,GAAE,SAAUrC,GAAWA,EAAQP,EAAQ,KAIjBuB,KAAKuB,EAAW7B,EAAW,CAC7G8B,GAAMF,EAAYA,EAAUO,MAAMV,EAASC,GAAc,KAAKK,OAClE,GACJ,EACIK,EAAmBrE,MAAQA,KAAKqE,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,EACxD,EACAxD,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,IACtD,MAAMwD,EAAYH,EAAgB,EAAQ,MA2E1C3E,EAAA,QAvEA,MACIwB,YAAYuD,GAAQ,GAGhBzE,KAAK0E,YAAa,EAOlB1E,KAAK2E,YAAc,KAGnB3E,KAAK4E,QAAU,GACf5E,KAAK6E,UAAYJ,CACrB,CACIA,YAAU,OAAOzE,KAAK6E,OAAS,CACnCC,SAASL,GACL,MAAMM,IAASN,EACXzE,KAAK6E,UAAYE,IACjB/E,KAAK6E,QAAUE,EACXA,IAAS/E,KAAK0E,YAAc1E,KAAK4E,QAAQhC,QACzC5C,KAAKgF,eAGjB,CAKAC,QACI,OAAOxB,EAAUzD,UAAM,OAAQ,GAAQ,YACnC,OAAOA,KAAKkF,WAAU,EAC1B,GACJ,CACAA,UAAUD,GAAQ,GACd,OAAOxB,EAAUzD,UAAM,OAAQ,GAAQ,YACnC,IAAKA,KAAK6E,SAAW7E,KAAK4E,QAAQhC,OAAQ,CACtC,MAAMuC,EAAU,IAAIX,EAAUY,QAC9BpF,KAAK4E,QAAQ3B,KAAKkC,SACZA,EACFF,IACAjF,KAAK6E,SAAU,GACnB7E,KAAK2E,YAAYpD,SACrB,MACS0D,IACLjF,KAAK6E,SAAU,EACvB,GACJ,CAQAG,eACI,OAAOvB,EAAUzD,UAAM,OAAQ,GAAQ,YAEnC,IADAA,KAAK0E,YAAa,EACX1E,KAAK6E,SAAW7E,KAAK4E,QAAQhC,QAChC5C,KAAK2E,YAAc,IAAIH,EAAUY,QACjCpF,KAAK4E,QAAQ,GAAGrD,gBACVvB,KAAK2E,YACX3E,KAAK4E,QAAQS,QAEjBrF,KAAK0E,YAAa,EAClB1E,KAAK2E,YAAc,IACvB,GACJ,qCCtFJ,IAAIW,EAAmBtF,MAAQA,KAAKsF,kBAAqBxE,OAAOyE,OAAS,SAAUC,EAAGC,EAAGC,EAAGC,QAC7EC,IAAPD,IAAkBA,EAAKD,GAC3B,IAAIG,EAAO/E,OAAOgF,yBAAyBL,EAAGC,GACzCG,KAAS,QAASA,GAAQJ,EAAElB,WAAasB,EAAKE,UAAYF,EAAKG,gBAClEH,EAAO,CAAEI,YAAY,EAAMC,IAAK,WAAa,OAAOT,EAAEC,EAAI,IAE5D5E,OAAOC,eAAeyE,EAAGG,EAAIE,EAChC,EAAI,SAAUL,EAAGC,EAAGC,EAAGC,QACTC,IAAPD,IAAkBA,EAAKD,GAC3BF,EAAEG,GAAMF,EAAEC,EACb,GACGS,EAAgBnG,MAAQA,KAAKmG,cAAiB,SAASV,EAAG/F,GAC1D,IAAK,IAAI0G,KAAKX,EAAa,YAANW,GAAoBtF,OAAOuF,UAAUC,eAAeC,KAAK7G,EAAS0G,IAAId,EAAgB5F,EAAS+F,EAAGW,EAC3H,EACI/B,EAAmBrE,MAAQA,KAAKqE,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,EACxD,EACAxD,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,IACtDtB,EAAQ8G,UAAY9G,EAAQ+G,QAAU/G,EAAQgH,aAAU,EACxD,IAAIlC,EAAY,EAAQ,KACxB1D,OAAOC,eAAerB,EAAS,UAAW,CAAEuG,YAAY,EAAMC,IAAK,WAAc,OAAO7B,EAAgBG,GAAWY,OAAS,IAC5H,IAAIuB,EAAY,EAAQ,KACxB7F,OAAOC,eAAerB,EAAS,UAAW,CAAEuG,YAAY,EAAMC,IAAK,WAAc,OAAO7B,EAAgBsC,GAAWvB,OAAS,IAC5H,IAAIwB,EAAc,EAAQ,KAC1B9F,OAAOC,eAAerB,EAAS,YAAa,CAAEuG,YAAY,EAAMC,IAAK,WAAc,OAAO7B,EAAgBuC,GAAaxB,OAAS,IAChIe,EAAa,EAAQ,KAAWzG,qCCzBhC,IAAI2E,EAAmBrE,MAAQA,KAAKqE,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,EACxD,EACAxD,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,IACtDtB,EAAQmH,MAAQnH,EAAQoH,MAAQpH,EAAQqH,QAAUrH,EAAQsH,OAAStH,EAAQuH,QAAUvH,EAAQwH,OAASxH,EAAQyH,YAAS,EACvH,MAAM3C,EAAYH,EAAgB,EAAQ,MAC1C3E,EAAQyH,OAAS,IACjBzH,EAAQwH,OAAS,GAAKxH,EAAQyH,OAC9BzH,EAAQuH,QAAU,GAAKvH,EAAQwH,OAC/BxH,EAAQsH,OAAS,GAAKtH,EAAQuH,QAC9BvH,EAAQqH,QAAU,IAAMrH,EAAQsH,OAIhC,MAAMF,UAActC,EAAUY,QACtBgC,YAAU,OAAOpH,KAAKqH,OAAS,CAC/BC,cAAY,OAAOtH,KAAKuH,SAAW,CAcvCrG,YAAYC,GACRG,MAAMH,GACNnB,KAAKqH,QAAU,MACnB,CACAG,KAAKF,GACD,QAAuB1B,IAAnB5F,KAAKuH,UACL,MAAME,MAAM,qCAGhB,GADAzH,KAAKuH,UAAYD,EACbA,EAAU,EAAG,CACb,MAAMI,EAAKC,WAAWrG,MAAMC,QAAQqG,KAAK5H,MAAOsH,GAChDtH,KAAKqH,QAAU,IAAMQ,aAAaH,EACtC,MAEIpG,MAAMC,UAEV,OAAOvB,IACX,CACAuC,KAAKC,EAAaJ,GACd,MAAMK,EAAMnB,MAAMiB,KAAKC,EAAaJ,GAGpC,YAFqBwD,IAAjB5F,KAAKsH,SACL7E,EAAI+E,KAAKxH,KAAKsH,SACX7E,CACX,EAEJ/C,EAAQoH,MAAQA,EAYhBpH,EAAQmH,MAJR,SAAeS,GAEX,OADU,IAAIR,GACLU,KAAKF,EAClB,ypBCrDA,IAAIQ,IAA0B,oBAAbC,UACZA,SAASC,cAAc,6BAE5B,GAAIF,IAAK,CACPA,IAAIG,SACJ,MAAM,IAAEC,MAAQC,EAAAA,+DAAAA,KAChBL,IAAMM,4DAAAA,KAAAA,SAAoBN,IAAIO,SAC9B,MAAMC,EAAIF,4DAAAA,OAAAA,eAA4B,UAAWF,KACjDI,EAAEC,MAAM,CAAEC,GAAIV,IAAIW,MAAM,EAAGP,IAAItF,UAC/B0F,EAAEI,OAAON,4DAAAA,KAAAA,aAAwBN,IAAIW,MAAMP,IAAItF,UAC/C0F,EAAEK,SACFb,IAAMM,4DAAAA,KAAAA,WAAsBE,EAAEM,OAAOC,MACrCf,IAAMgB,KAAM,IAAGhB,OACjB,MAIEA,IAAM,CAAC,EAGM,SAASiB,SACtB,OAAOjB,GACT,qHCrBe,SAASkB,EAAOC,GAA2B,IAAdC,EAAOC,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACrD,MAAMC,EAAYrB,SAASsB,eAAe,cACpCC,GACJC,EAAAA,EAAAA,KAACC,EAAAA,oBAAmB,CAACC,cAAcV,EAAAA,EAAAA,KAASW,OAAOC,UACjDJ,EAAAA,EAAAA,KAACK,EAAAA,cAAa,CAAAD,UACZJ,EAAAA,EAAAA,KAACN,EAAW,QAKdC,EAAQW,aACGC,EAAAA,EAAAA,YAAWV,GACnBW,OAAOT,IACPU,EAAAA,EAAAA,aAAYZ,EAAWE,EAChC,oCCzBA,IAAIW,EA2BG,SAAS9B,IACd,QAAkBvC,IAAdqE,EACF,MAAMxC,MAAM,6CAEd,OAAOwC,CACT,iCA1B0B,oBAAfC,aAA4BD,EAAYC,qGCL5C,MAAMC,EAAoC,iBAAZC,UAC/BA,QAAQC,WAAaD,QAAQC,SAASC,QACrCC,EAAAA,EAAOC,8BAKDC,GAAkBN,+RCIxB,SAASO,IACd,OAAOC,CACT,CAOO,SAASC,IACd,OAAOD,CACT,CAMO,SAASE,IACd,OAAO1C,EAAAA,EAAAA,KAAe2C,SACxB,iVC1BO,SAASC,YAAYC,WAAYC,UACtC,GAAId,wCAAAA,eAAgB,OAAO,KAE3B,IAEE,MAAM,QAAE5I,SAAYuH,KAAK,UAALA,CAAgB,QAC9BoC,KAAOD,SAAW1J,QAAQ0J,SAAUD,YAAcA,YAChD5F,QAAS+F,OAAQC,OAAUtC,KAAK,UAALA,CAAgBoC,MAGnD,OAAKC,KAELrK,OAAOuK,QAAQD,OAAOE,SAAQC,IAAkB,IAAhBrD,EAAKlH,GAAMuK,EACzC,GAAIJ,IAAIjD,GAAM,MAAMT,MAAM,8CAC1B0D,IAAIjD,GAAOlH,CAAK,IAEXmK,KANUC,KAOnB,CAAE,MACA,OAAO,IACT,CACF,CAUO,SAASI,YAAYR,GAC1B,OAAOA,CACT,kCC3BAtL,EAAQ+L,MAgCR,SAAeC,EAAKxC,GAClB,GAAmB,iBAARwC,EACT,MAAM,IAAIC,UAAU,iCAQtB,IALA,IAAIC,EAAM,CAAC,EAEPC,GADM3C,GAAW,CAAC,GACR4C,QAAUA,EAEpBC,EAAQ,EACLA,EAAQL,EAAI9I,QAAQ,CACzB,IAAIoJ,EAAQN,EAAInI,QAAQ,IAAKwI,GAG7B,IAAe,IAAXC,EACF,MAGF,IAAIC,EAASP,EAAInI,QAAQ,IAAKwI,GAE9B,IAAgB,IAAZE,EACFA,EAASP,EAAI9I,YACR,GAAIqJ,EAASD,EAAO,CAEzBD,EAAQL,EAAIQ,YAAY,IAAKF,EAAQ,GAAK,EAC1C,QACF,CAEA,IAAI9D,EAAMwD,EAAIjD,MAAMsD,EAAOC,GAAOG,OAGlC,QAAIvG,IAAcgG,EAAI1D,GAAM,CAC1B,IAAIkE,EAAMV,EAAIjD,MAAMuD,EAAQ,EAAGC,GAAQE,OAGb,KAAtBC,EAAIC,WAAW,KACjBD,EAAMA,EAAI3D,MAAM,GAAI,IAGtBmD,EAAI1D,GAAOoE,EAAUF,EAAKP,EAC5B,CAEAE,EAAQE,EAAS,CACnB,CAEA,OAAOL,CACT,EA7EAlM,EAAQ6M,UA+FR,SAAmBC,EAAMJ,EAAKlD,GAC5B,IAAIuD,EAAMvD,GAAW,CAAC,EAClBwD,EAAMD,EAAIE,QAAUA,EAExB,GAAmB,mBAARD,EACT,MAAM,IAAIf,UAAU,4BAGtB,IAAKiB,EAAmBC,KAAKL,GAC3B,MAAM,IAAIb,UAAU,4BAGtB,IAAI3K,EAAQ0L,EAAIN,GAEhB,GAAIpL,IAAU4L,EAAmBC,KAAK7L,GACpC,MAAM,IAAI2K,UAAU,2BAGtB,IAAID,EAAMc,EAAO,IAAMxL,EAEvB,GAAI,MAAQyL,EAAIK,OAAQ,CACtB,IAAIA,EAASL,EAAIK,OAAS,EAE1B,GAAIC,MAAMD,KAAYE,SAASF,GAC7B,MAAM,IAAInB,UAAU,4BAGtBD,GAAO,aAAeuB,KAAKC,MAAMJ,EACnC,CAEA,GAAIL,EAAIU,OAAQ,CACd,IAAKP,EAAmBC,KAAKJ,EAAIU,QAC/B,MAAM,IAAIxB,UAAU,4BAGtBD,GAAO,YAAce,EAAIU,MAC3B,CAEA,GAAIV,EAAIvB,KAAM,CACZ,IAAK0B,EAAmBC,KAAKJ,EAAIvB,MAC/B,MAAM,IAAIS,UAAU,0BAGtBD,GAAO,UAAYe,EAAIvB,IACzB,CAEA,GAAIuB,EAAIW,QAAS,CACf,IAAIA,EAAUX,EAAIW,QAElB,IA2FJ,SAAiBhB,GACf,MAAgC,kBAAzBiB,EAAW9G,KAAK6F,IACrBA,aAAekB,IACnB,CA9FSC,CAAOH,IAAYL,MAAMK,EAAQI,WACpC,MAAM,IAAI7B,UAAU,6BAGtBD,GAAO,aAAe0B,EAAQK,aAChC,CAUA,GARIhB,EAAIiB,WACNhC,GAAO,cAGLe,EAAIkB,SACNjC,GAAO,YAGLe,EAAImB,SAKN,OAJuC,iBAAjBnB,EAAImB,SACtBnB,EAAImB,SAASC,cACbpB,EAAImB,UAGN,IAAK,MACHlC,GAAO,iBACP,MACF,IAAK,SACHA,GAAO,oBACP,MACF,IAAK,OACHA,GAAO,kBACP,MACF,QACE,MAAM,IAAIC,UAAU,8BAI1B,GAAIc,EAAIqB,SAIN,OAHuC,iBAAjBrB,EAAIqB,SACtBrB,EAAIqB,SAASD,cAAgBpB,EAAIqB,UAGnC,KAAK,EACHpC,GAAO,oBACP,MACF,IAAK,MACHA,GAAO,iBACP,MACF,IAAK,SACHA,GAAO,oBACP,MACF,IAAK,OACHA,GAAO,kBACP,MACF,QACE,MAAM,IAAIC,UAAU,8BAI1B,OAAOD,CACT,EAnMA,IAAI2B,EAAavM,OAAOuF,UAAU0H,SAU9BnB,EAAqB,wCAkMzB,SAASd,EAAQJ,GACf,OAA6B,IAAtBA,EAAInI,QAAQ,KACfyK,mBAAmBtC,GACnBA,CACN,CASA,SAASiB,EAAQP,GACf,OAAO6B,mBAAmB7B,EAC5B,CAsBA,SAASE,EAAUZ,EAAKI,GACtB,IACE,OAAOA,EAAOJ,EAChB,CAAE,MAAOzH,GACP,OAAOyH,CACT,CACF,uBC5PA,IAAItD,EAAQ,EAAQ,KAmPpB,SAAS8F,EAAkB1B,EAAM2B,GAI/B/F,EAAMgG,OAAOF,kBAAkB1B,GAHjB,WACZ,OAAO,IAAIpE,EAAMiG,IAAIC,UAAU9B,EAAM2B,EACvC,GAEF,CAvPA,EAAQ,KACR,EAAQ,KACR,EAAQ,KAGRxO,EAAOD,QAAU0I,EAAMiG,IAAMjG,EAAMiG,KAAO,CAAC,EAqB3CjG,EAAMiG,IAAIE,gBAAkB,SAASrG,EAAKM,EAAII,EAAQuF,GACpD,IAAIC,EAASI,EAAc,CACzBtG,IAAKA,EACLU,OAAQA,EACR6F,SAAS,EACTN,KAAMA,IAGR,OADAC,EAAO7F,MAAMC,GACN4F,CACT,EAiBAhG,EAAMiG,IAAIK,uBAAyB,SAASxG,EAAKiG,GAC/C,OAAOK,EAAc,CACnBtG,IAAKA,EACLU,OAAQ,KACR6F,SAAS,EACTN,KAAMA,GAEV,EAqBA/F,EAAMiG,IAAIM,gBAAkB,SAASzG,EAAKM,EAAII,EAAQuF,GACpD,IAAIC,EAASI,EAAc,CACzBtG,IAAKA,EACLU,OAAQA,EACR6F,SAAS,EACTN,KAAMA,IAGR,OADAC,EAAO7F,MAAMC,GACN4F,CACT,EAiBAhG,EAAMiG,IAAIO,uBAAyB,SAAS1G,EAAKiG,GAC/C,OAAOK,EAAc,CACnBtG,IAAKA,EACLU,OAAQ,KACR6F,SAAS,EACTN,KAAMA,GAEV,EAUA/F,EAAMiG,IAAIC,UAAY,SAAS9B,EAAM2B,GAC/B3G,GACFqH,IAEF,IAAI9O,EAAOC,KACXD,EAAKyM,KAAOA,EACZzM,EAAKoO,KAAO,IAAIA,EAAK,CACnBW,UAAW,GACXV,OAAQ,CACNW,QAAS,SAASC,EAASC,GACzB,OAAOC,EAAanP,EAAKoP,GAAIH,EAASC,GAAU,EAClD,EACAR,QAAS,SAASO,EAASC,GACzB,OAAOC,EAAanP,EAAKoP,GAAIH,EAASC,GAAU,EAClD,KAGJlP,EAAKqP,OAAQ,CACf,EAUAhH,EAAMiG,IAAIC,UAAUjI,UAAUwI,WAAa,SAAS3F,GAClD,IAAGlJ,KAAKoP,MAAR,CAIA,IACIC,EADAnH,EAAMgB,EAAQhB,IAQlB,GAAkB,iBAARA,GACQ,KAAfA,EAAItF,QAAgC,KAAfsF,EAAItF,QAAgC,KAAfsF,EAAItF,QAG1C,GAAGwF,EAAMkH,KAAKC,QAAQrH,KACX,KAAfA,EAAItF,QAAgC,KAAfsF,EAAItF,QAAgC,KAAfsF,EAAItF,QAAgB,CAE/DyM,EAAMnH,EACNA,EAAME,EAAMkH,KAAKE,eACjB,IAAI,IAAInM,EAAI,EAAGA,EAAIgM,EAAIzM,SAAUS,EAC/B6E,EAAIuH,QAAQJ,EAAIhM,GAEpB,OATE6E,EAAME,EAAMkH,KAAKE,aAAatH,GAYhC,IAAIE,EAAMkH,KAAKC,QAAQrH,GAAM,CAC3BmH,EAAMnH,EACNA,EAAM,GAGN,IAAIwH,EAAML,EAAIzM,SACd,GAAW,KAAR8M,GAAsB,KAARA,GAAsB,KAARA,EAE7B,IADAA,KAAc,EACNrM,EAAI,EAAGA,EAAIqM,IAAOrM,EACxB6E,EAAIjF,KAAKoM,EAAIM,WAGnB,CAGA,IAAIvH,EAAMkH,KAAKC,QAAQrH,IACJ,IAAfA,EAAItF,QAA+B,IAAfsF,EAAItF,QAA+B,IAAfsF,EAAItF,OAC9C,MAAM,IAAI6E,MAAM,0BAIlB,IAAI0G,EAAOnO,KAAKmO,KAAK3B,KACjBoD,GAA6D,IAAhD,CAAC,MAAO,MAAO,MAAO,OAAOrM,QAAQ4K,GAGtDnO,KAAKmP,GAAKU,EAAW3H,EAAKgB,EAAQuF,UAAYmB,GAC9C5P,KAAKoP,OAAQ,CAnDb,CAoDF,EAUAhH,EAAMiG,IAAIwB,WAAa,SAAS3H,EAAKuG,GAInC,OAHIjH,GACFqH,IAEKgB,EAAW3H,EAAKuG,EACzB,EAUArG,EAAMiG,IAAIa,aAAeA,EAIzBhB,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAMC,KAChD7B,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAME,KAChD9B,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAMG,KAChD/B,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAMI,KAChDhC,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAMK,KAChDjC,EAAkB,UAAW9F,EAAMgG,OAAO0B,MAAMM,KAWhD,IAEIC,EACAC,EACAC,EACAC,EACAC,EANAjJ,GAAO,EACPkJ,EAAK,EA0KT,SAAS7B,IACPrH,GAAO,EAeP+I,EAAO,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IAIpE,IADA,IAAII,EAAQ,IAAIC,MAAM,KACdvN,EAAI,EAAGA,EAAI,MAAOA,EACxBsN,EAAMtN,GAAKA,GAAK,EAChBsN,EAAMtN,EAAI,KAAQA,EAAI,KAAQ,EAAI,IAQpC,IAJAgN,EAAO,IAAIO,MAAM,KACjBN,EAAQ,IAAIM,MAAM,KAClBJ,EAAM,IAAII,MAAM,GAChBH,EAAO,IAAIG,MAAM,GACTvN,EAAI,EAAGA,EAAI,IAAKA,EACtBmN,EAAInN,GAAK,IAAIuN,MAAM,KACnBH,EAAKpN,GAAK,IAAIuN,MAAM,KAEtB,IAAmBC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,EAAIC,EAAxClN,EAAI,EAAGmN,EAAK,EAChB,IAAQ/N,EAAI,EAAGA,EAAI,MAAOA,EAAG,CA8D3B2N,GADAA,EAAKI,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,IACzC,EAAW,IAALJ,EAAY,GAG9BX,EAAKpM,GAAK+M,EACVV,EAAMU,GAAM/M,EAoEZiN,GAJAD,EAAMN,EAAMK,KAKF,GACPA,GAAM,GACNA,GAAM,EACNA,EAAKC,EACRE,IARAN,EAAKF,EAAM1M,KACX6M,EAAKH,EAAME,KACXE,EAAKJ,EAAMG,MAOS,IACjB7M,EAAI8M,IAAO,IACX9M,EAAI6M,EAAKC,IAAO,EAChB9M,EAAI4M,EAAKE,EAEZ,IAAI,IAAIM,EAAI,EAAGA,EAAI,IAAKA,EACtBb,EAAIa,GAAGpN,GAAKiN,EACZT,EAAKY,GAAGL,GAAMG,EAGdD,EAAKA,GAAM,GAAKA,IAAO,EACvBC,EAAMA,GAAO,GAAKA,IAAQ,EAInB,IAANlN,EAEDA,EAAImN,EAAK,GAITnN,EAAI4M,EAAKF,EAAMA,EAAMA,EAAME,EAAKE,KAChCK,GAAMT,EAAMA,EAAMS,IAEtB,CACF,CA0BA,SAASvB,EAAW3H,EAAKuG,GAmBvB,IAjBA,IAaI6C,EAbAC,EAAIrJ,EAAIO,MAAM,GAaR+I,EAAM,EACZC,EAAKF,EAAE3O,OAEP8O,EAAMhB,GADAe,EAAK,EAAI,GAEXpO,EAAIoO,EAAIpO,EAAIqO,IAAOrO,EACzBiO,EAAOC,EAAElO,EAAI,GACVA,EAAIoO,GAAO,GAEZH,EACEjB,EAAKiB,IAAS,GAAK,MAAQ,GAC3BjB,EAAKiB,IAAS,EAAI,MAAQ,GAC1BjB,EAAY,IAAPiB,IAAe,EACpBjB,EAAKiB,IAAS,IAAOf,EAAKiB,IAAQ,GACpCA,KACQC,EAAK,GAAMpO,EAAIoO,GAAO,IAE9BH,EACEjB,EAAKiB,IAAS,KAAO,GACrBjB,EAAKiB,IAAS,GAAK,MAAQ,GAC3BjB,EAAKiB,IAAS,EAAI,MAAQ,EAC1BjB,EAAY,IAAPiB,IAETC,EAAElO,GAAKkO,EAAElO,EAAIoO,GAAMH,EAkDrB,GAAG7C,EAAS,CAQV,IAPA,IAAIY,EACAsC,EAAKlB,EAAK,GACVmB,EAAKnB,EAAK,GACVoB,EAAKpB,EAAK,GACVqB,EAAKrB,EAAK,GACVsB,EAAOR,EAAE9I,MAAM,GAEJuJ,GAAP3O,EAAI,GADZqO,EAAMH,EAAE3O,QACkB8N,GAAIrN,EAAIqO,EAAKrO,GAAKqN,EAAIsB,GAAMtB,EAIpD,GAAS,IAANrN,GAAWA,IAAOqO,EAAMhB,EACzBqB,EAAK1O,GAAKkO,EAAES,GACZD,EAAK1O,EAAI,GAAKkO,EAAES,EAAK,GACrBD,EAAK1O,EAAI,GAAKkO,EAAES,EAAK,GACrBD,EAAK1O,EAAI,GAAKkO,EAAES,EAAK,QAMrB,IAAI,IAAIX,EAAI,EAAGA,EAAIX,IAAMW,EACvBhC,EAAMkC,EAAES,EAAKX,GACbU,EAAK1O,GAAK,GAAGgO,IACXM,EAAGtB,EAAKhB,IAAQ,KAChBuC,EAAGvB,EAAKhB,IAAQ,GAAK,MACrBwC,EAAGxB,EAAKhB,IAAQ,EAAI,MACpByC,EAAGzB,EAAW,IAANhB,IAIhBkC,EAAIQ,CACN,CAEA,OAAOR,CACT,CAWA,SAASrC,EAAaqC,EAAGU,EAAOrJ,EAAQ6F,GAuCtC,IACIkD,EAAIC,EAAIC,EAAIC,EAAII,EAchBC,EAAGC,EAAGC,EAAG/J,EAAGgK,EAAIC,EAAIC,EAfpBC,EAAKlB,EAAE3O,OAAS,EAAI,EAErB6L,GACDkD,EAAKlB,EAAK,GACVmB,EAAKnB,EAAK,GACVoB,EAAKpB,EAAK,GACVqB,EAAKrB,EAAK,GACVyB,EAAM5B,IAENqB,EAAKnB,EAAI,GACToB,EAAKpB,EAAI,GACTqB,EAAKrB,EAAI,GACTsB,EAAKtB,EAAI,GACT0B,EAAM7B,GAGR8B,EAAIF,EAAM,GAAKV,EAAE,GACjBa,EAAIH,EAAMxD,EAAU,EAAI,GAAK8C,EAAE,GAC/Bc,EAAIJ,EAAM,GAAKV,EAAE,GACjBjJ,EAAI2J,EAAMxD,EAAU,EAAI,GAAK8C,EAAE,GAS/B,IARA,IAAIlO,EAAI,EAQAqP,EAAQ,EAAGA,EAAQD,IAAMC,EAoH/BJ,EACEX,EAAGQ,IAAM,IACTP,EAAGQ,IAAM,GAAK,KACdP,EAAGQ,IAAM,EAAI,KACbP,EAAO,IAAJxJ,GAAWiJ,IAAIlO,GACpBkP,EACEZ,EAAGS,IAAM,IACTR,EAAGS,IAAM,GAAK,KACdR,EAAGvJ,IAAM,EAAI,KACbwJ,EAAO,IAAJK,GAAWZ,IAAIlO,GACpBmP,EACEb,EAAGU,IAAM,IACTT,EAAGtJ,IAAM,GAAK,KACduJ,EAAGM,IAAM,EAAI,KACbL,EAAO,IAAJM,GAAWb,IAAIlO,GACpBiF,EACEqJ,EAAGrJ,IAAM,IACTsJ,EAAGO,IAAM,GAAK,KACdN,EAAGO,IAAM,EAAI,KACbN,EAAO,IAAJO,GAAWd,IAAIlO,GACpB8O,EAAIG,EACJF,EAAIG,EACJF,EAAIG,EAeN5J,EAAO,GACJsJ,EAAIC,IAAM,KAAO,GACjBD,EAAIE,IAAM,GAAK,MAAQ,GACvBF,EAAIG,IAAM,EAAI,MAAQ,EACtBH,EAAQ,IAAJ5J,GAAYiJ,IAAIlO,GACvBuF,EAAO6F,EAAU,EAAI,GAClByD,EAAIE,IAAM,KAAO,GACjBF,EAAIG,IAAM,GAAK,MAAQ,GACvBH,EAAI5J,IAAM,EAAI,MAAQ,EACtB4J,EAAQ,IAAJC,GAAYZ,IAAIlO,GACvBuF,EAAO,GACJsJ,EAAIG,IAAM,KAAO,GACjBH,EAAI5J,IAAM,GAAK,MAAQ,GACvB4J,EAAIC,IAAM,EAAI,MAAQ,EACtBD,EAAQ,IAAJE,GAAYb,IAAIlO,GACvBuF,EAAO6F,EAAU,EAAI,GAClByD,EAAI5J,IAAM,KAAO,GACjB4J,EAAIC,IAAM,GAAK,MAAQ,GACvBD,EAAIE,IAAM,EAAI,MAAQ,EACtBF,EAAQ,IAAJG,GAAYd,IAAIlO,EACzB,CAsBA,SAASmL,EAActF,GAErB,IAGIkF,EAFAuE,EAAY,SAFhBzJ,EAAUA,GAAW,CAAC,GACFiF,MAAQ,OAAOyE,cAW/BrK,GANF6F,EADClF,EAAQuF,QACArG,EAAMgG,OAAOyE,eAAeF,EAAWzJ,EAAQhB,KAE/CE,EAAMgG,OAAO0E,aAAaH,EAAWzJ,EAAQhB,MAIrCK,MAcnB,OAbA6F,EAAO7F,MAAQ,SAASC,EAAIU,GAE1B,IAAIN,EAAS,KACVM,aAAmBd,EAAMkH,KAAKyD,aAC/BnK,EAASM,EACTA,EAAU,CAAC,IAEbA,EAAUA,GAAW,CAAC,GACdN,OAASA,EACjBM,EAAQV,GAAKA,EACbD,EAAMhC,KAAK6H,EAAQlF,EACrB,EAEOkF,CACT,mBCpiCA,IAAI4E,EAAM,CAAC,EACXrT,EAAOD,QAAUsT,EAGjB,IAAIC,EAAoB,CAAC,EAWzBD,EAAIrG,OAAS,SAASsF,EAAOiB,EAAUC,GACrC,GAAuB,iBAAbD,EACR,MAAM,IAAIvH,UAAU,gCAEtB,QAAe/F,IAAZuN,GAA4C,iBAAZA,EACjC,MAAM,IAAIxH,UAAU,+BAGtB,IAAI/C,EAAS,GAEb,GAAKqJ,aAAiBmB,WAGf,CACL,IAAI/P,EAAI,EACJgQ,EAAOH,EAAStQ,OAChB0Q,EAAQJ,EAASK,OAAO,GACxBC,EAAS,CAAC,GACd,IAAInQ,EAAI,EAAGA,EAAI4O,EAAMrP,SAAUS,EAAG,CAChC,IAAI,IAAIoQ,EAAI,EAAGC,EAAQzB,EAAM5O,GAAIoQ,EAAID,EAAO5Q,SAAU6Q,EACpDC,GAASF,EAAOC,IAAM,EACtBD,EAAOC,GAAKC,EAAQL,EACpBK,EAASA,EAAQL,EAAQ,EAG3B,KAAMK,EAAQ,GACZF,EAAOvQ,KAAKyQ,EAAQL,GACpBK,EAASA,EAAQL,EAAQ,CAE7B,CAGA,IAAIhQ,EAAI,EAAgB,IAAb4O,EAAM5O,IAAYA,EAAI4O,EAAMrP,OAAS,IAAKS,EACnDuF,GAAU0K,EAGZ,IAAIjQ,EAAImQ,EAAO5Q,OAAS,EAAGS,GAAK,IAAKA,EACnCuF,GAAUsK,EAASM,EAAOnQ,GAE9B,MA3BEuF,EAkGJ,SAA+BqJ,EAAOiB,GACpC,IAAI7P,EAAI,EACJgQ,EAAOH,EAAStQ,OAChB0Q,EAAQJ,EAASK,OAAO,GACxBC,EAAS,CAAC,GACd,IAAInQ,EAAI,EAAGA,EAAI4O,EAAMrP,WAAYS,EAAG,CAClC,IAAI,IAAIoQ,EAAI,EAAGC,EAAQzB,EAAM0B,GAAGtQ,GAAIoQ,EAAID,EAAO5Q,SAAU6Q,EACvDC,GAASF,EAAOC,IAAM,EACtBD,EAAOC,GAAKC,EAAQL,EACpBK,EAASA,EAAQL,EAAQ,EAG3B,KAAMK,EAAQ,GACZF,EAAOvQ,KAAKyQ,EAAQL,GACpBK,EAASA,EAAQL,EAAQ,CAE7B,CAEA,IAAIzK,EAAS,GAGb,IAAIvF,EAAI,EAAmB,IAAhB4O,EAAM0B,GAAGtQ,IAAYA,EAAI4O,EAAMrP,SAAW,IAAKS,EACxDuF,GAAU0K,EAGZ,IAAIjQ,EAAImQ,EAAO5Q,OAAS,EAAGS,GAAK,IAAKA,EACnCuF,GAAUsK,EAASM,EAAOnQ,IAG5B,OAAOuF,CACT,CAhIagL,CAAsB3B,EAAOiB,GA6BxC,GAAGC,EAAS,CACV,IAAIU,EAAQ,IAAIC,OAAO,OAASX,EAAU,IAAK,KAC/CvK,EAASA,EAAOmL,MAAMF,GAAOG,KAAK,OACpC,CAEA,OAAOpL,CACT,EAUAoK,EAAIlH,OAAS,SAASmG,EAAOiB,GAC3B,GAAoB,iBAAVjB,EACR,MAAM,IAAItG,UAAU,6BAEtB,GAAuB,iBAAbuH,EACR,MAAM,IAAIvH,UAAU,gCAGtB,IAAIsI,EAAQhB,EAAkBC,GAC9B,IAAIe,EAAO,CAETA,EAAQhB,EAAkBC,GAAY,GACtC,IAAI,IAAI7P,EAAI,EAAGA,EAAI6P,EAAStQ,SAAUS,EACpC4Q,EAAMf,EAAS7G,WAAWhJ,IAAMA,CAEpC,CAGA4O,EAAQA,EAAMiC,QAAQ,MAAO,IAE7B,IAAIb,EAAOH,EAAStQ,OAChB0Q,EAAQJ,EAASK,OAAO,GACxBY,EAAQ,CAAC,GACb,IAAQ9Q,EAAI,EAAGA,EAAI4O,EAAMrP,OAAQS,IAAK,CACpC,IAAIrC,EAAQiT,EAAMhC,EAAM5F,WAAWhJ,IACnC,QAAauC,IAAV5E,EACD,OAGF,IAAI,IAAIyS,EAAI,EAAGC,EAAQ1S,EAAOyS,EAAIU,EAAMvR,SAAU6Q,EAChDC,GAASS,EAAMV,GAAKJ,EACpBc,EAAMV,GAAa,IAARC,EACXA,IAAU,EAGZ,KAAMA,EAAQ,GACZS,EAAMlR,KAAa,IAARyQ,GACXA,IAAU,CAEd,CAGA,IAAI,IAAIhO,EAAI,EAAGuM,EAAMvM,KAAO4N,GAAS5N,EAAIuM,EAAMrP,OAAS,IAAK8C,EAC3DyO,EAAMlR,KAAK,GAGb,MAAqB,oBAAXmR,OACDA,OAAOC,KAAKF,EAAMG,WAGpB,IAAIlB,WAAWe,EAAMG,UAC9B,uBClJA,IAAIlM,EAAQ,EAAQ,KACpB,EAAQ,KAERzI,EAAOD,QAAU0I,EAAMgG,OAAShG,EAAMgG,QAAU,CAAC,EAGjDhG,EAAMgG,OAAOmG,WAAanM,EAAMgG,OAAOmG,YAAc,CAAC,EAetDnM,EAAMgG,OAAO0E,aAAe,SAASH,EAAWzK,GAC9C,IAAI8K,EAAML,EAOV,GANkB,iBAARK,IACRA,EAAM5K,EAAMgG,OAAOoG,aAAaxB,MAE9BA,EAAMA,MAGNA,EACF,MAAM,IAAIvL,MAAM,0BAA4BkL,GAI9C,OAAO,IAAIvK,EAAMgG,OAAOqG,YAAY,CAClC9B,UAAWK,EACX9K,IAAKA,EACLuG,SAAS,GAEb,EAeArG,EAAMgG,OAAOyE,eAAiB,SAASF,EAAWzK,GAChD,IAAI8K,EAAML,EAOV,GANkB,iBAARK,IACRA,EAAM5K,EAAMgG,OAAOoG,aAAaxB,MAE9BA,EAAMA,MAGNA,EACF,MAAM,IAAIvL,MAAM,0BAA4BkL,GAI9C,OAAO,IAAIvK,EAAMgG,OAAOqG,YAAY,CAClC9B,UAAWK,EACX9K,IAAKA,EACLuG,SAAS,GAEb,EASArG,EAAMgG,OAAOF,kBAAoB,SAAS1B,EAAMmG,GAC9CnG,EAAOA,EAAKoG,cACZxK,EAAMgG,OAAOmG,WAAW/H,GAAQmG,CAClC,EASAvK,EAAMgG,OAAOoG,aAAe,SAAShI,GAEnC,OADAA,EAAOA,EAAKoG,iBACDxK,EAAMgG,OAAOmG,WACfnM,EAAMgG,OAAOmG,WAAW/H,GAE1B,IACT,EAEA,IAAIiI,EAAcrM,EAAMgG,OAAOqG,YAAc,SAASvL,GACpDlJ,KAAK2S,UAAYzJ,EAAQyJ,UACzB3S,KAAKmO,KAAOnO,KAAK2S,UAAUxE,KAC3BnO,KAAK8O,UAAY9O,KAAKmO,KAAKW,UAC3B9O,KAAK0U,SAAU,EACf1U,KAAK2U,OAAS,KACd3U,KAAK4I,OAAS,KACd5I,KAAK4U,IAAM1L,EAAQuF,QAAUzO,KAAKmO,KAAKM,QAAUzO,KAAKmO,KAAKY,QAC3D/O,KAAK6U,SAAW3L,EAAQuF,QACxBzO,KAAK2S,UAAU9D,WAAW3F,EAC5B,EA6BAuL,EAAYpO,UAAUkC,MAAQ,SAASW,GACrCA,EAAUA,GAAW,CAAC,EACtB,IAAI4L,EAAO,CAAC,EACZ,IAAI,IAAI5M,KAAOgB,EACb4L,EAAK5M,GAAOgB,EAAQhB,GAEtB4M,EAAKrG,QAAUzO,KAAK6U,SACpB7U,KAAK0U,SAAU,EACf1U,KAAK2U,OAASvM,EAAMkH,KAAKE,eACzBxP,KAAK4I,OAASM,EAAQN,QAAUR,EAAMkH,KAAKE,eAC3CxP,KAAKmO,KAAK5F,MAAMuM,EAClB,EAOAL,EAAYpO,UAAUqC,OAAS,SAASuJ,GAOtC,IANGA,GAEDjS,KAAK2U,OAAOI,UAAU9C,IAIjBjS,KAAK4U,IAAIrO,KAAKvG,KAAKmO,KAAMnO,KAAK2U,OAAQ3U,KAAK4I,OAAQ5I,KAAK0U,WAC5D1U,KAAK0U,UAGR1U,KAAK2U,OAAOK,SACd,EAUAP,EAAYpO,UAAUsC,OAAS,SAASsM,IAGnCA,GAA2B,QAAnBjV,KAAKmO,KAAK3B,MAAqC,QAAnBxM,KAAKmO,KAAK3B,OAC/CxM,KAAKmO,KAAK8G,IAAM,SAAShD,GACvB,OAAOgD,EAAIjV,KAAK8O,UAAWmD,GAAO,EACpC,EACAjS,KAAKmO,KAAK+G,MAAQ,SAAStM,GACzB,OAAOqM,EAAIjV,KAAK8O,UAAWlG,GAAQ,EACrC,GAIF,IAAIM,EAAU,CAAC,EAMf,OALAA,EAAQuF,QAAUzO,KAAK6U,SAGvB3L,EAAQiM,SAAWnV,KAAK2U,OAAO/R,SAAW5C,KAAK8O,aAE3C9O,KAAK6U,UAAY7U,KAAKmO,KAAK8G,MACzBjV,KAAKmO,KAAK8G,IAAIjV,KAAK2U,OAAQzL,KAMjClJ,KAAK0U,SAAU,EACf1U,KAAK0I,SAEF1I,KAAK6U,UAAY7U,KAAKmO,KAAK+G,QACxBlV,KAAKmO,KAAK+G,MAAMlV,KAAK4I,OAAQM,IAKhClJ,KAAKmO,KAAKiH,cACPpV,KAAKmO,KAAKiH,YAAYpV,KAAK4I,OAAQM,IAM3C,uBC9NA,IAAId,EAAQ,EAAQ,KACpB,EAAQ,KAERA,EAAMgG,OAAShG,EAAMgG,QAAU,CAAC,EAGhC,IAAI0B,EAAQnQ,EAAOD,QAAU0I,EAAMgG,OAAO0B,MAAQ1H,EAAMgG,OAAO0B,OAAS,CAAC,EA+6BzE,SAASuF,EAAY7M,EAAIsG,GAMvB,GALiB,iBAAPtG,IAERA,EAAKJ,EAAMkH,KAAKE,aAAahH,IAG5BJ,EAAMkH,KAAKC,QAAQ/G,IAAOA,EAAG5F,OAAS,EAAG,CAE1C,IAAIyM,EAAM7G,EACVA,EAAKJ,EAAMkH,KAAKE,eAChB,IAAI,IAAInM,EAAI,EAAGA,EAAIgM,EAAIzM,SAAUS,EAC/BmF,EAAGiH,QAAQJ,EAAIhM,GAEnB,CAEA,GAAGmF,EAAG5F,SAAWkM,EACf,MAAM,IAAIrH,MACR,0BAA4Be,EAAG5F,SAC/B,uBAAyBkM,EAAY,WAGzC,IAAI1G,EAAMkH,KAAKC,QAAQ/G,GAAK,CAE1B,IAAI8M,EAAO,GACPC,EAASzG,EAAY,EACzB,IAAQzL,EAAI,EAAGA,EAAIkS,IAAUlS,EAC3BiS,EAAKrS,KAAKuF,EAAGmH,YAEfnH,EAAK8M,CACP,CAEA,OAAO9M,CACT,CAEA,SAASgN,EAAMC,GAEbA,EAAMA,EAAM7S,OAAS,GAAM6S,EAAMA,EAAM7S,OAAS,GAAK,EAAK,UAC5D,CAEA,SAAS8S,EAAWC,GAElB,MAAO,CAAEA,EAAM,WAAe,EAAS,WAANA,EACnC,CAr9BA7F,EAAMC,IAAM,SAAS7G,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,IAAIjF,MAAM5Q,KAAK4V,OAC/B5V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,MAClC,EAEA9F,EAAMC,IAAI1J,UAAUkC,MAAQ,SAASW,GAAU,EAE/C4G,EAAMC,IAAI1J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,GAAGsJ,EAAMrP,SAAW5C,KAAK8O,aAAenG,GAAUsJ,EAAMrP,SAAW,GACjE,OAAO,EAIT,IAAI,IAAIS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAK4O,EAAMtC,WAO3B,IAHA3P,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGhCzS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAK8V,UAAUzS,GAEnC,EAEAyM,EAAMC,IAAI1J,UAAUoI,QAAU,SAASwD,EAAOrJ,EAAQD,GAEpD,GAAGsJ,EAAMrP,SAAW5C,KAAK8O,aAAenG,GAAUsJ,EAAMrP,SAAW,GACjE,OAAO,EAIT,IAAI,IAAIS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAK4O,EAAMtC,WAO3B,IAHA3P,KAAKoO,OAAOK,QAAQzO,KAAK6V,SAAU7V,KAAK8V,WAGhCzS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAK8V,UAAUzS,GAEnC,EAEAyM,EAAMC,IAAI1J,UAAU4O,IAAM,SAAShD,EAAO/I,GAGxC,IAAI8M,EAAW/D,EAAMrP,WAAa5C,KAAK8O,UACrC9O,KAAK8O,UAAa9O,KAAK8O,UAAYmD,EAAMrP,SAE3C,OADAqP,EAAMgE,aAAaD,EAASA,IACrB,CACT,EAEAlG,EAAMC,IAAI1J,UAAU6O,MAAQ,SAAStM,EAAQM,GAE3C,GAAGA,EAAQiM,SAAW,EACpB,OAAO,EAIT,IAAIzF,EAAM9G,EAAOhG,SACbsT,EAAQtN,EAAO+K,GAAGjE,EAAM,GAC5B,QAAGwG,EAASlW,KAAK8O,WAAa,IAK9BlG,EAAOuN,SAASD,GACT,GACT,EAIApG,EAAME,IAAM,SAAS9G,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,IAAIjF,MAAM5Q,KAAK4V,OAC/B5V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,MAClC,EAEA9F,EAAME,IAAI3J,UAAUkC,MAAQ,SAASW,GAGnC,GAAkB,OAAfA,EAAQV,GAAa,CAEtB,IAAIxI,KAAKoW,MACP,MAAM,IAAI3O,MAAM,yBAElBzH,KAAKqW,IAAMrW,KAAKoW,MAAM3N,MAAM,EAC9B,KAAO,MAAK,OAAQS,GAClB,MAAM,IAAIzB,MAAM,yBAGhBzH,KAAKqW,IAAMhB,EAAYnM,EAAQV,GAAIxI,KAAK8O,WACxC9O,KAAKoW,MAAQpW,KAAKqW,IAAI5N,MAAM,EAC9B,CACF,EAEAqH,EAAME,IAAI3J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,GAAGsJ,EAAMrP,SAAW5C,KAAK8O,aAAenG,GAAUsJ,EAAMrP,SAAW,GACjE,OAAO,EAKT,IAAI,IAAIS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAKrD,KAAKoW,MAAM/S,GAAK4O,EAAMtC,WAO3C,IAHA3P,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGhCzS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAK8V,UAAUzS,IAEjCrD,KAAKoW,MAAQpW,KAAK8V,SACpB,EAEAhG,EAAME,IAAI3J,UAAUoI,QAAU,SAASwD,EAAOrJ,EAAQD,GAEpD,GAAGsJ,EAAMrP,SAAW5C,KAAK8O,aAAenG,GAAUsJ,EAAMrP,SAAW,GACjE,OAAO,EAIT,IAAI,IAAIS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAK4O,EAAMtC,WAQ3B,IAJA3P,KAAKoO,OAAOK,QAAQzO,KAAK6V,SAAU7V,KAAK8V,WAIhCzS,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAKoW,MAAM/S,GAAKrD,KAAK8V,UAAUzS,IAEjDrD,KAAKoW,MAAQpW,KAAK6V,SAASpN,MAAM,EACnC,EAEAqH,EAAME,IAAI3J,UAAU4O,IAAM,SAAShD,EAAO/I,GAGxC,IAAI8M,EAAW/D,EAAMrP,WAAa5C,KAAK8O,UACrC9O,KAAK8O,UAAa9O,KAAK8O,UAAYmD,EAAMrP,SAE3C,OADAqP,EAAMgE,aAAaD,EAASA,IACrB,CACT,EAEAlG,EAAME,IAAI3J,UAAU6O,MAAQ,SAAStM,EAAQM,GAE3C,GAAGA,EAAQiM,SAAW,EACpB,OAAO,EAIT,IAAIzF,EAAM9G,EAAOhG,SACbsT,EAAQtN,EAAO+K,GAAGjE,EAAM,GAC5B,QAAGwG,EAASlW,KAAK8O,WAAa,IAK9BlG,EAAOuN,SAASD,GACT,GACT,EAIApG,EAAMG,IAAM,SAAS/G,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,KAChB7V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,OAChC5V,KAAKsW,cAAgB,IAAI1F,MAAM5Q,KAAK4V,OACpC5V,KAAKuW,eAAiBnO,EAAMkH,KAAKE,eACjCxP,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMG,IAAI5J,UAAUkC,MAAQ,SAASW,GACnC,KAAK,OAAQA,GACX,MAAM,IAAIzB,MAAM,yBAGlBzH,KAAKqW,IAAMhB,EAAYnM,EAAQV,GAAIxI,KAAK8O,WACxC9O,KAAK6V,SAAW7V,KAAKqW,IAAI5N,MAAM,GAC/BzI,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMG,IAAI5J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAmB,IAAhB6T,EACD,OAAO,EAOT,GAHAzW,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGd,IAAvB9V,KAAKwW,eAAuBC,GAAezW,KAAK8O,UAEjD,IAAI,IAAIzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAK4O,EAAMtC,WAAa3P,KAAK8V,UAAUzS,GACrDuF,EAAOmN,SAAS/V,KAAK6V,SAASxS,QAJlC,CAUA,IAAIqT,GAAgB1W,KAAK8O,UAAY2H,GAAezW,KAAK8O,UAOzD,IANG4H,EAAe,IAChBA,EAAe1W,KAAK8O,UAAY4H,GAIlC1W,KAAKuW,eAAeI,QACZtT,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKsW,cAAcjT,GAAK4O,EAAMtC,WAAa3P,KAAK8V,UAAUzS,GAC1DrD,KAAKuW,eAAeR,SAAS/V,KAAKsW,cAAcjT,IAGlD,GAAGqT,EAAe,EAEhBzE,EAAM2E,MAAQ5W,KAAK8O,eAGnB,IAAQzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAKrD,KAAKsW,cAAcjT,GAS1C,GAJGrD,KAAKwW,cAAgB,GACtBxW,KAAKuW,eAAeM,SAAS7W,KAAKwW,eAGjCE,EAAe,IAAM/N,EAItB,OAHAC,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCH,EAAe1W,KAAKwW,gBACtBxW,KAAKwW,cAAgBE,GACd,EAGT9N,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCJ,EAAczW,KAAKwW,gBACrBxW,KAAKwW,cAAgB,CAvCrB,CAwCF,EAEA1G,EAAMG,IAAI5J,UAAUoI,QAAU,SAASwD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAmB,IAAhB6T,EACD,OAAO,EAOT,GAHAzW,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGd,IAAvB9V,KAAKwW,eAAuBC,GAAezW,KAAK8O,UAEjD,IAAI,IAAIzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAK4O,EAAMtC,WACzB/G,EAAOmN,SAAS/V,KAAK6V,SAASxS,GAAKrD,KAAK8V,UAAUzS,QAJtD,CAUA,IAAIqT,GAAgB1W,KAAK8O,UAAY2H,GAAezW,KAAK8O,UAOzD,IANG4H,EAAe,IAChBA,EAAe1W,KAAK8O,UAAY4H,GAIlC1W,KAAKuW,eAAeI,QACZtT,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKsW,cAAcjT,GAAK4O,EAAMtC,WAC9B3P,KAAKuW,eAAeR,SAAS/V,KAAKsW,cAAcjT,GAAKrD,KAAK8V,UAAUzS,IAGtE,GAAGqT,EAAe,EAEhBzE,EAAM2E,MAAQ5W,KAAK8O,eAGnB,IAAQzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAKrD,KAAKsW,cAAcjT,GAS1C,GAJGrD,KAAKwW,cAAgB,GACtBxW,KAAKuW,eAAeM,SAAS7W,KAAKwW,eAGjCE,EAAe,IAAM/N,EAItB,OAHAC,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCH,EAAe1W,KAAKwW,gBACtBxW,KAAKwW,cAAgBE,GACd,EAGT9N,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCJ,EAAczW,KAAKwW,gBACrBxW,KAAKwW,cAAgB,CAvCrB,CAwCF,EAIA1G,EAAMI,IAAM,SAAShH,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,KAChB7V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,OAChC5V,KAAKuW,eAAiBnO,EAAMkH,KAAKE,eACjCxP,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMI,IAAI7J,UAAUkC,MAAQ,SAASW,GACnC,KAAK,OAAQA,GACX,MAAM,IAAIzB,MAAM,yBAGlBzH,KAAKqW,IAAMhB,EAAYnM,EAAQV,GAAIxI,KAAK8O,WACxC9O,KAAK6V,SAAW7V,KAAKqW,IAAI5N,MAAM,GAC/BzI,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMI,IAAI7J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAsB,IAAnBqP,EAAMrP,SACP,OAAO,EAOT,GAHA5C,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGd,IAAvB9V,KAAKwW,eAAuBC,GAAezW,KAAK8O,UAEjD,IAAI,IAAIzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS9D,EAAMtC,WAAa3P,KAAK8V,UAAUzS,IAClDrD,KAAK6V,SAASxS,GAAKrD,KAAK8V,UAAUzS,OAJtC,CAUA,IAAIqT,GAAgB1W,KAAK8O,UAAY2H,GAAezW,KAAK8O,UAOzD,IANG4H,EAAe,IAChBA,EAAe1W,KAAK8O,UAAY4H,GAIlC1W,KAAKuW,eAAeI,QACZtT,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKuW,eAAeR,SAAS9D,EAAMtC,WAAa3P,KAAK8V,UAAUzS,IAGjE,GAAGqT,EAAe,EAEhBzE,EAAM2E,MAAQ5W,KAAK8O,eAGnB,IAAQzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK6V,SAASxS,GAAKrD,KAAK8V,UAAUzS,GAStC,GAJGrD,KAAKwW,cAAgB,GACtBxW,KAAKuW,eAAeM,SAAS7W,KAAKwW,eAGjCE,EAAe,IAAM/N,EAItB,OAHAC,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCH,EAAe1W,KAAKwW,gBACtBxW,KAAKwW,cAAgBE,GACd,EAGT9N,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCJ,EAAczW,KAAKwW,gBACrBxW,KAAKwW,cAAgB,CAtCrB,CAuCF,EAEA1G,EAAMI,IAAI7J,UAAUoI,QAAUqB,EAAMI,IAAI7J,UAAU0I,QAIlDe,EAAMK,IAAM,SAASjH,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,KAChB7V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,OAChC5V,KAAKuW,eAAiBnO,EAAMkH,KAAKE,eACjCxP,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMK,IAAI9J,UAAUkC,MAAQ,SAASW,GACnC,KAAK,OAAQA,GACX,MAAM,IAAIzB,MAAM,yBAGlBzH,KAAKqW,IAAMhB,EAAYnM,EAAQV,GAAIxI,KAAK8O,WACxC9O,KAAK6V,SAAW7V,KAAKqW,IAAI5N,MAAM,GAC/BzI,KAAKwW,cAAgB,CACvB,EAEA1G,EAAMK,IAAI9J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAmB,IAAhB6T,EACD,OAAO,EAOT,GAHAzW,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGd,IAAvB9V,KAAKwW,eAAuBC,GAAezW,KAAK8O,UAEjD,IAAI,IAAIzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS9D,EAAMtC,WAAa3P,KAAK8V,UAAUzS,QAE/C,CAEL,IAAIqT,GAAgB1W,KAAK8O,UAAY2H,GAAezW,KAAK8O,UAOzD,IANG4H,EAAe,IAChBA,EAAe1W,KAAK8O,UAAY4H,GAIlC1W,KAAKuW,eAAeI,QACZtT,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKuW,eAAeR,SAAS9D,EAAMtC,WAAa3P,KAAK8V,UAAUzS,IAajE,GAVGqT,EAAe,IAEhBzE,EAAM2E,MAAQ5W,KAAK8O,WAIlB9O,KAAKwW,cAAgB,GACtBxW,KAAKuW,eAAeM,SAAS7W,KAAKwW,eAGjCE,EAAe,IAAM/N,EAItB,OAHAC,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCH,EAAe1W,KAAKwW,gBACtBxW,KAAKwW,cAAgBE,GACd,EAGT9N,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCJ,EAAczW,KAAKwW,gBACrBxW,KAAKwW,cAAgB,CACvB,CAGAhB,EAAMxV,KAAK6V,SACb,EAEA/F,EAAMK,IAAI9J,UAAUoI,QAAUqB,EAAMK,IAAI9J,UAAU0I,QAIlDe,EAAMM,IAAM,SAASlH,GACnBA,EAAUA,GAAW,CAAC,EACtBlJ,KAAKwM,KAAO,MACZxM,KAAKoO,OAASlF,EAAQkF,OACtBpO,KAAK8O,UAAY5F,EAAQ4F,WAAa,GACtC9O,KAAK4V,MAAQ5V,KAAK8O,UAAY,EAC9B9O,KAAK6V,SAAW,IAAIjF,MAAM5Q,KAAK4V,OAC/B5V,KAAK8V,UAAY,IAAIlF,MAAM5Q,KAAK4V,OAChC5V,KAAKuW,eAAiBnO,EAAMkH,KAAKE,eACjCxP,KAAKwW,cAAgB,EAKrBxW,KAAK+W,GAAK,UACZ,EAEAjH,EAAMM,IAAI/J,UAAUkC,MAAQ,SAASW,GACnC,KAAK,OAAQA,GACX,MAAM,IAAIzB,MAAM,yBAGlB,IAMIuP,EANAxO,EAAKJ,EAAMkH,KAAKE,aAAatG,EAAQV,IAsBzC,GAnBAxI,KAAKiX,cAAgB,EAKnBD,EADC,mBAAoB9N,EACJd,EAAMkH,KAAKE,aAAatG,EAAQ8N,gBAEhC5O,EAAMkH,KAAKE,eAK5BxP,KAAKkX,WADJ,cAAehO,EACEA,EAAQiO,UAER,IAIpBnX,KAAKoX,KAAO,KACTlO,EAAQuF,UAETzO,KAAKoX,KAAOhP,EAAMkH,KAAKE,aAAatG,EAAQmO,KAAKR,WAC9C7W,KAAKoX,KAAKxU,SAAY5C,KAAKkX,WAAa,GACzC,MAAM,IAAIzP,MAAM,iDAKpBzH,KAAKsX,WAAa,IAAI1G,MAAM5Q,KAAK4V,OAGjC5V,KAAKqX,IAAM,KAIXrX,KAAKuX,YAAc,IAAI3G,MAAM5Q,KAAK4V,OAClC5V,KAAKoO,OAAOW,QAAQ,CAAC,EAAG,EAAG,EAAG,GAAI/O,KAAKuX,aAMvCvX,KAAKwX,cAAgB,EACrBxX,KAAKyX,GAAKzX,KAAK0X,kBAAkB1X,KAAKuX,YAAavX,KAAKwX,eAKxD,IAAIG,EAAWnP,EAAG5F,SAClB,GAAgB,KAAb+U,EAED3X,KAAK4X,IAAM,CAACpP,EAAGmH,WAAYnH,EAAGmH,WAAYnH,EAAGmH,WAAY,OACpD,CAGL,IADA3P,KAAK4X,IAAM,CAAC,EAAG,EAAG,EAAG,GACfpP,EAAG5F,SAAW,GAClB5C,KAAK4X,IAAM5X,KAAK6X,MACd7X,KAAKuX,YAAavX,KAAK4X,IACvB,CAACpP,EAAGmH,WAAYnH,EAAGmH,WAAYnH,EAAGmH,WAAYnH,EAAGmH,aAErD3P,KAAK4X,IAAM5X,KAAK6X,MACd7X,KAAKuX,YAAavX,KAAK4X,IAAK,CAAC,EAAG,GAAGE,OAAOpC,EAAsB,EAAXiC,IACzD,CAGA3X,KAAK6V,SAAW7V,KAAK4X,IAAInP,MAAM,GAC/B+M,EAAMxV,KAAK6V,UACX7V,KAAKwW,cAAgB,EAGrBQ,EAAiB5O,EAAMkH,KAAKE,aAAawH,GAEzChX,KAAK+X,aAAerC,EAAqC,EAA1BsB,EAAepU,UAE9C,IAAIuS,EAAW6B,EAAepU,SAAW5C,KAAK8O,UAK9C,IAJGqG,GACD6B,EAAef,aAAa,EAAGjW,KAAK8O,UAAYqG,GAElDnV,KAAKgY,GAAK,CAAC,EAAG,EAAG,EAAG,GACdhB,EAAepU,SAAW,GAC9B5C,KAAKgY,GAAKhY,KAAK6X,MAAM7X,KAAKuX,YAAavX,KAAKgY,GAAI,CAC9ChB,EAAerH,WACfqH,EAAerH,WACfqH,EAAerH,WACfqH,EAAerH,YAGrB,EAEAG,EAAMM,IAAI/J,UAAU0I,QAAU,SAASkD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAmB,IAAhB6T,EACD,OAAO,EAOT,GAHAzW,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGd,IAAvB9V,KAAKwW,eAAuBC,GAAezW,KAAK8O,UAAW,CAE5D,IAAI,IAAIzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAK8V,UAAUzS,IAAM4O,EAAMtC,YAE7C3P,KAAKiX,eAAiBjX,KAAK8O,SAC7B,KAAO,CAEL,IAAI4H,GAAgB1W,KAAK8O,UAAY2H,GAAezW,KAAK8O,UAOzD,IANG4H,EAAe,IAChBA,EAAe1W,KAAK8O,UAAY4H,GAIlC1W,KAAKuW,eAAeI,QACZtT,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKuW,eAAeR,SAAS9D,EAAMtC,WAAa3P,KAAK8V,UAAUzS,IAGjE,GAAGqT,GAAgB,GAAK/N,EAAQ,CAE9B,GAAGA,EAAQ,CAET,IAAIwM,EAAWsB,EAAczW,KAAK8O,UAClC9O,KAAKiX,eAAiB9B,EAEtBnV,KAAKuW,eAAeJ,SAASnW,KAAK8O,UAAYqG,EAChD,MACEnV,KAAKiX,eAAiBjX,KAAK8O,UAI7B,IAAQzL,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAK8V,UAAUzS,GAAKrD,KAAKuW,eAAe5G,WAE1C3P,KAAKuW,eAAeK,MAAQ5W,KAAK8O,SACnC,CAOA,GAJG9O,KAAKwW,cAAgB,GACtBxW,KAAKuW,eAAeM,SAAS7W,KAAKwW,eAGjCE,EAAe,IAAM/N,EAOtB,OAJAsJ,EAAM2E,MAAQ5W,KAAK8O,UACnBlG,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCH,EAAe1W,KAAKwW,gBACtBxW,KAAKwW,cAAgBE,GACd,EAGT9N,EAAOkO,SAAS9W,KAAKuW,eAAeM,SAClCJ,EAAczW,KAAKwW,gBACrBxW,KAAKwW,cAAgB,CACvB,CAGAxW,KAAKgY,GAAKhY,KAAK6X,MAAM7X,KAAKuX,YAAavX,KAAKgY,GAAIhY,KAAK8V,WAGrDN,EAAMxV,KAAK6V,SACb,EAEA/F,EAAMM,IAAI/J,UAAUoI,QAAU,SAASwD,EAAOrJ,EAAQD,GAEpD,IAAI8N,EAAcxE,EAAMrP,SACxB,GAAG6T,EAAczW,KAAK8O,aAAenG,GAAU8N,EAAc,GAC3D,OAAO,EAITzW,KAAKoO,OAAOW,QAAQ/O,KAAK6V,SAAU7V,KAAK8V,WAGxCN,EAAMxV,KAAK6V,UAGX7V,KAAKsX,WAAW,GAAKrF,EAAMtC,WAC3B3P,KAAKsX,WAAW,GAAKrF,EAAMtC,WAC3B3P,KAAKsX,WAAW,GAAKrF,EAAMtC,WAC3B3P,KAAKsX,WAAW,GAAKrF,EAAMtC,WAC3B3P,KAAKgY,GAAKhY,KAAK6X,MAAM7X,KAAKuX,YAAavX,KAAKgY,GAAIhY,KAAKsX,YAGrD,IAAI,IAAIjU,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BuF,EAAOmN,SAAS/V,KAAK8V,UAAUzS,GAAKrD,KAAKsX,WAAWjU,IAInDoT,EAAczW,KAAK8O,UACpB9O,KAAKiX,eAAiBR,EAAczW,KAAK8O,UAEzC9O,KAAKiX,eAAiBjX,KAAK8O,SAE/B,EAEAgB,EAAMM,IAAI/J,UAAU+O,YAAc,SAASxM,EAAQM,GACjD,IAAI+O,GAAO,EAGR/O,EAAQuF,SAAWvF,EAAQiM,UAC5BvM,EAAOuN,SAASnW,KAAK8O,UAAY5F,EAAQiM,UAI3CnV,KAAKqX,IAAMjP,EAAMkH,KAAKE,eAGtB,IAAI0I,EAAUlY,KAAK+X,aAAaD,OAAOpC,EAAgC,EAArB1V,KAAKiX,gBAGvDjX,KAAKgY,GAAKhY,KAAK6X,MAAM7X,KAAKuX,YAAavX,KAAKgY,GAAIE,GAGhD,IAAIb,EAAM,GACVrX,KAAKoO,OAAOW,QAAQ/O,KAAK4X,IAAKP,GAC9B,IAAI,IAAIhU,EAAI,EAAGA,EAAIrD,KAAK4V,QAASvS,EAC/BrD,KAAKqX,IAAItB,SAAS/V,KAAKgY,GAAG3U,GAAKgU,EAAIhU,IAWrC,OAPArD,KAAKqX,IAAIlB,SAASnW,KAAKqX,IAAIzU,UAAY5C,KAAKkX,WAAa,IAGtDhO,EAAQuF,SAAWzO,KAAKqX,IAAIlD,UAAYnU,KAAKoX,OAC9Ca,GAAO,GAGFA,CACT,EA2BAnI,EAAMM,IAAI/J,UAAU8R,SAAW,SAASC,EAAGC,GAKzC,IAJA,IAAIC,EAAM,CAAC,EAAG,EAAG,EAAG,GAChBC,EAAMF,EAAE5P,MAAM,GAGVpF,EAAI,EAAGA,EAAI,MAAOA,EAId+U,EAAG/U,EAAI,GAAM,GAAM,GAAM,GAAKA,EAAI,KAE1CiV,EAAI,IAAMC,EAAI,GACdD,EAAI,IAAMC,EAAI,GACdD,EAAI,IAAMC,EAAI,GACdD,EAAI,IAAMC,EAAI,IAKhBvY,KAAKwY,IAAID,EAAKA,GAGhB,OAAOD,CACT,EAEAxI,EAAMM,IAAI/J,UAAUmS,IAAM,SAASJ,EAAGK,GASpC,IANA,IAAIC,EAAa,EAAPN,EAAE,GAMJ/U,EAAI,EAAGA,EAAI,IAAKA,EACtBoV,EAAIpV,GAAM+U,EAAE/U,KAAO,GAAkB,EAAX+U,EAAE/U,EAAI,KAAW,GAG7CoV,EAAI,GAAKL,EAAE,KAAO,EAKfM,IACDD,EAAI,IAAMzY,KAAK+W,GAEnB,EAEAjH,EAAMM,IAAI/J,UAAUsS,cAAgB,SAASP,GAG3C,IADA,IAAIQ,EAAI,CAAC,EAAG,EAAG,EAAG,GACVvV,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC1B,IACIwV,EAAOT,EADA/U,EAAI,EAAK,KACmB,GAAf,EAAKA,EAAI,GAAY,GACzCyV,EAAK9Y,KAAKyX,GAAGpU,GAAGwV,GACpBD,EAAE,IAAME,EAAG,GACXF,EAAE,IAAME,EAAG,GACXF,EAAE,IAAME,EAAG,GACXF,EAAE,IAAME,EAAG,EACb,CACA,OAAOF,CACT,EAaA9I,EAAMM,IAAI/J,UAAUwR,MAAQ,SAASkB,EAAGV,EAAGD,GAKzC,OAJAC,EAAE,IAAMD,EAAE,GACVC,EAAE,IAAMD,EAAE,GACVC,EAAE,IAAMD,EAAE,GACVC,EAAE,IAAMD,EAAE,GACHpY,KAAK2Y,cAAcN,EAE5B,EAiBAvI,EAAMM,IAAI/J,UAAUqR,kBAAoB,SAASqB,EAAGC,GAQlD,IAJA,IAAIC,EAAa,EAAID,EACjBE,EAAS,EAAID,EACbE,EAAO,GAAKF,EACZxT,EAAI,IAAImL,MAAMuI,GACV9V,EAAI,EAAGA,EAAI8V,IAAQ9V,EAAG,CAC5B,IAAIgM,EAAM,CAAC,EAAG,EAAG,EAAG,GAEhB+J,GAASF,EAAS,EAAK7V,EAAI6V,GAAWF,EAC1C3J,EAFWhM,EAAI6V,EAAU,GAEb,GAAMF,EAAO,GAAOI,EAChC3T,EAAEpC,GAAKrD,KAAKqZ,qBAAqBrZ,KAAKmY,SAAS9I,EAAK0J,GAAIC,EAC1D,CACA,OAAOvT,CACT,EASAqK,EAAMM,IAAI/J,UAAUgT,qBAAuB,SAASC,EAAKN,GAIvD,IAAIG,EAAO,GAAKH,EACZO,EAAOJ,IAAS,EAChB1T,EAAI,IAAImL,MAAMuI,GAClB1T,EAAE8T,GAAQD,EAAI7Q,MAAM,GAEpB,IADA,IAAIpF,EAAIkW,IAAS,EACXlW,EAAI,GAERrD,KAAKwY,IAAI/S,EAAE,EAAIpC,GAAIoC,EAAEpC,GAAK,IAC1BA,IAAM,EAGR,IADAA,EAAI,EACEA,EAAIkW,GAAM,CACd,IAAI,IAAI9F,EAAI,EAAGA,EAAIpQ,IAAKoQ,EAAG,CACzB,IAAI+F,EAAM/T,EAAEpC,GACRoW,EAAMhU,EAAEgO,GACZhO,EAAEpC,EAAIoQ,GAAK,CACT+F,EAAI,GAAKC,EAAI,GACbD,EAAI,GAAKC,EAAI,GACbD,EAAI,GAAKC,EAAI,GACbD,EAAI,GAAKC,EAAI,GAEjB,CACApW,GAAK,CACP,CAIA,IAHAoC,EAAE,GAAK,CAAC,EAAG,EAAG,EAAG,GAGbpC,EAAIkW,EAAO,EAAGlW,EAAI8V,IAAQ9V,EAAG,CAC/B,IAAIgP,EAAI5M,EAAEpC,EAAIkW,GACd9T,EAAEpC,GAAK,CAACiW,EAAI,GAAKjH,EAAE,GAAIiH,EAAI,GAAKjH,EAAE,GAAIiH,EAAI,GAAKjH,EAAE,GAAIiH,EAAI,GAAKjH,EAAE,GAClE,CACA,OAAO5M,CACT,mBCj7BA9F,EAAOD,QAAU,CAEfwJ,QAAS,CACPwQ,mBAAmB,yBCHvB,IAAItR,EAAQ,EAAQ,KAChBuR,EAAQ,EAAQ,KAGhBrK,EAAO3P,EAAOD,QAAU0I,EAAMkH,KAAOlH,EAAMkH,MAAQ,CAAC,EA0IxD,SAASsK,EAAgBvI,GACvB,GAAW,IAANA,GAAiB,KAANA,GAAkB,KAANA,GAAkB,KAANA,EACtC,MAAM,IAAI5J,MAAM,yCAA2C4J,EAE/D,CAaA,SAASwI,EAAiBzH,GAQxB,GAJApS,KAAK6I,KAAO,GAEZ7I,KAAK4W,KAAO,EAEI,iBAANxE,EACRpS,KAAK6I,KAAOuJ,OACP,GAAG9C,EAAKwK,cAAc1H,IAAM9C,EAAKyK,kBAAkB3H,GACxD,GAAqB,oBAAXgC,QAA0BhC,aAAagC,OAC/CpU,KAAK6I,KAAOuJ,EAAErE,SAAS,cAClB,CAGL,IAAIiM,EAAM,IAAI5G,WAAWhB,GACzB,IACEpS,KAAK6I,KAAOoR,OAAOC,aAAa9V,MAAM,KAAM4V,EAC9C,CAAE,MAAM/V,GACN,IAAI,IAAIZ,EAAI,EAAGA,EAAI2W,EAAIpX,SAAUS,EAC/BrD,KAAKyP,QAAQuK,EAAI3W,GAErB,CACF,MACQ+O,aAAayH,GACP,iBAANzH,GAAoC,iBAAXA,EAAEvJ,MACjB,iBAAXuJ,EAAEwE,QAET5W,KAAK6I,KAAOuJ,EAAEvJ,KACd7I,KAAK4W,KAAOxE,EAAEwE,MAIhB5W,KAAKma,yBAA2B,CAClC,EA3LA,WAIE,GAAsB,oBAAZ/P,SAA2BA,QAAQgQ,WAAahQ,QAAQiQ,QAShE,OARA/K,EAAK8K,SAAWhQ,QAAQgQ,cACG,mBAAjBE,aACRhL,EAAKgL,aAAeA,aAIpBhL,EAAKgL,aAAehL,EAAK8K,UAM7B,GAA2B,mBAAjBE,aAKR,OAJAhL,EAAKgL,aAAe,WAAa,OAAOA,aAAalW,WAAMwB,EAAWuD,UAAY,OAClFmG,EAAK8K,SAAW,SAASG,GACvB,OAAOD,aAAaC,EACtB,GAeF,GALAjL,EAAKgL,aAAe,SAASC,GAC3B5S,WAAW4S,EAAU,EACvB,EAGqB,oBAAXC,QACsB,mBAAvBA,OAAOC,YAA4B,CAC1C,IAAIC,EAAM,qBACNC,EAAY,GAChBrL,EAAKgL,aAAe,SAASC,GAC3BI,EAAU1X,KAAKsX,GAGS,IAArBI,EAAU/X,QACX4X,OAAOC,YAAYC,EAAK,IAE5B,EAWAF,OAAOI,iBAAiB,WAVxB,SAAiBC,GACf,GAAGA,EAAMC,SAAWN,QAAUK,EAAMhS,OAAS6R,EAAK,CAChDG,EAAME,kBACN,IAAIC,EAAOL,EAAUlS,QACrBkS,EAAU/X,OAAS,EACnBoY,EAAK1P,SAAQ,SAASiP,GACpBA,GACF,GACF,CACF,IAC4C,EAC9C,CAGA,GAA+B,oBAArBU,iBAAkC,CAE1C,IAAIC,EAAM5N,KAAK4N,MACXC,GAAO,EACPC,EAAMrT,SAASsT,cAAc,OAC7BV,EAAY,GAChB,IAAIM,kBAAiB,WACnB,IAAID,EAAOL,EAAUlS,QACrBkS,EAAU/X,OAAS,EACnBoY,EAAK1P,SAAQ,SAASiP,GACpBA,GACF,GACF,IAAGe,QAAQF,EAAK,CAACG,YAAY,IAC7B,IAAIC,EAAkBlM,EAAKgL,aAC3BhL,EAAKgL,aAAe,SAASC,GACxBjN,KAAK4N,MAAQA,EAAM,IACpBA,EAAM5N,KAAK4N,MACXM,EAAgBjB,KAEhBI,EAAU1X,KAAKsX,GAGS,IAArBI,EAAU/X,QACXwY,EAAIK,aAAa,IAAKN,GAAQA,GAGpC,CACF,CAEA7L,EAAK8K,SAAW9K,EAAKgL,YACtB,CA5FD,GA+FAhL,EAAKoM,SACgB,oBAAZtR,SAA2BA,QAAQC,UAAYD,QAAQC,SAASC,KAOzEgF,EAAKqM,YACArM,EAAKoM,SACC,EAAAE,EAGc,oBAAT7b,KAAuBya,OAASza,KAIhDuP,EAAKC,QAAUqB,MAAMrB,SAAW,SAAS6I,GACvC,MAA6C,mBAAtCtX,OAAOuF,UAAU0H,SAASxH,KAAK6R,EACxC,EAGA9I,EAAKwK,cAAgB,SAAS1B,GAC5B,MAA8B,oBAAhByD,aAA+BzD,aAAayD,WAC5D,EAGAvM,EAAKyK,kBAAoB,SAAS3B,GAChC,OAAOA,GAAK9I,EAAKwK,cAAc1B,EAAE0D,cAA4BlW,IAAjBwS,EAAE2D,UAChD,EAkBAzM,EAAKyD,WAAa8G,EA8ClBvK,EAAKuK,iBAAmBA,EAaxBvK,EAAKuK,iBAAiBxT,UAAU2V,2BAA6B,SAAS5D,GACpEpY,KAAKma,0BAA4B/B,EAC9BpY,KAAKma,yBAH2B,OAKjCna,KAAK6I,KAAKoT,OAAO,EAAG,GACpBjc,KAAKma,yBAA2B,EAEpC,EAOA7K,EAAKuK,iBAAiBxT,UAAUzD,OAAS,WACvC,OAAO5C,KAAK6I,KAAKjG,OAAS5C,KAAK4W,IACjC,EAOAtH,EAAKuK,iBAAiBxT,UAAU6V,QAAU,WACxC,OAAOlc,KAAK4C,UAAY,CAC1B,EASA0M,EAAKuK,iBAAiBxT,UAAUoJ,QAAU,SAAS2C,GACjD,OAAOpS,KAAK8W,SAASmD,OAAOC,aAAa9H,GAC3C,EAUA9C,EAAKuK,iBAAiBxT,UAAU4P,aAAe,SAAS7D,EAAGf,GACzDe,EAAI6H,OAAOC,aAAa9H,GAExB,IADA,IAAI9J,EAAItI,KAAK6I,KACPwI,EAAI,GACD,EAAJA,IACD/I,GAAK8J,IAEPf,KAAO,GACA,IACLe,GAAKA,GAKT,OAFApS,KAAK6I,KAAOP,EACZtI,KAAKgc,2BAA2B3K,GACzBrR,IACT,EASAsP,EAAKuK,iBAAiBxT,UAAUyQ,SAAW,SAAS3C,GAGlD,OAFAnU,KAAK6I,MAAQsL,EACbnU,KAAKgc,2BAA2B7H,EAAMvR,QAC/B5C,IACT,EASAsP,EAAKuK,iBAAiBxT,UAAU8V,UAAY,SAASzQ,GACnD,OAAO1L,KAAK8W,SAASxH,EAAK8M,WAAW1Q,GACvC,EASA4D,EAAKuK,iBAAiBxT,UAAUgW,SAAW,SAAShZ,GAClD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAiB,IAAJ7W,GACxB,EASAiM,EAAKuK,iBAAiBxT,UAAUiW,SAAW,SAASjZ,GAClD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAiB,IAAJ7W,GACxB,EASAiM,EAAKuK,iBAAiBxT,UAAU0P,SAAW,SAAS1S,GAClD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAiB,IAAJ7W,GACxB,EASAiM,EAAKuK,iBAAiBxT,UAAUkW,WAAa,SAASlZ,GACpD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAiB,IAAJ7W,GACpB4W,OAAOC,aAAa7W,GAAK,EAAI,KACjC,EASAiM,EAAKuK,iBAAiBxT,UAAUmW,WAAa,SAASnZ,GACpD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAiB,IAAJ7W,GACpB4W,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAa7W,GAAK,GAAK,KAClC,EASAiM,EAAKuK,iBAAiBxT,UAAUoW,WAAa,SAASpZ,GACpD,OAAOrD,KAAK8W,SACVmD,OAAOC,aAAiB,IAAJ7W,GACpB4W,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,GAAK,KAClC,EAUAiM,EAAKuK,iBAAiBxT,UAAUqW,OAAS,SAASrZ,EAAGgO,GACnDuI,EAAgBvI,GAChB,IAAI8C,EAAQ,GACZ,GACE9C,GAAK,EACL8C,GAAS8F,OAAOC,aAAc7W,GAAKgO,EAAK,WAClCA,EAAI,GACZ,OAAOrR,KAAK8W,SAAS3C,EACvB,EAWA7E,EAAKuK,iBAAiBxT,UAAUsW,aAAe,SAAStZ,EAAGgO,GAKzD,OAHGhO,EAAI,IACLA,GAAK,GAAMgO,EAAI,GAEVrR,KAAK0c,OAAOrZ,EAAGgO,EACxB,EASA/B,EAAKuK,iBAAiBxT,UAAU0O,UAAY,SAAS+G,GACnD,OAAO9b,KAAK8W,SAASgF,EAAOjF,WAC9B,EAOAvH,EAAKuK,iBAAiBxT,UAAUuW,QAAU,WACxC,OAAO5c,KAAK6I,KAAKwD,WAAWrM,KAAK4W,OACnC,EAQAtH,EAAKuK,iBAAiBxT,UAAUwW,SAAW,WACzC,IAAI5E,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,OAAS,EACnC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,GAEnC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKuK,iBAAiBxT,UAAUyW,SAAW,WACzC,IAAI7E,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,OAAS,GACnC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,EACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,GAEnC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKuK,iBAAiBxT,UAAUsJ,SAAW,WACzC,IAAIsI,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,OAAS,GACnC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,GACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,EACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,GAEnC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKuK,iBAAiBxT,UAAU0W,WAAa,WAC3C,IAAI9E,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,MAC1B5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,EAEzC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKuK,iBAAiBxT,UAAU2W,WAAa,WAC3C,IAAI/E,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,MAC1B5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,EACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,GAEzC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKuK,iBAAiBxT,UAAU4W,WAAa,WAC3C,IAAIhF,EACFjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,MAC1B5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,EACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,GACvC5W,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAO,IAAM,GAEzC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAUA3I,EAAKuK,iBAAiBxT,UAAU6W,OAAS,SAAS7L,GAChDuI,EAAgBvI,GAChB,IAAI4G,EAAO,EACX,GAEEA,GAAQA,GAAQ,GAAKjY,KAAK6I,KAAKwD,WAAWrM,KAAK4W,QAC/CvF,GAAK,QACCA,EAAI,GACZ,OAAO4G,CACT,EAUA3I,EAAKuK,iBAAiBxT,UAAU8W,aAAe,SAAS9L,GAEtD,IAAI+G,EAAIpY,KAAKkd,OAAO7L,GAChB+L,EAAM,GAAM/L,EAAI,EAIpB,OAHG+G,GAAKgF,IACNhF,GAAKgF,GAAO,GAEPhF,CACT,EAWA9I,EAAKuK,iBAAiBxT,UAAUwQ,SAAW,SAASX,GAClD,IAAI+B,EAaJ,OAZG/B,GAEDA,EAAQjJ,KAAKoQ,IAAIrd,KAAK4C,SAAUsT,GAChC+B,EAAOjY,KAAK6I,KAAKJ,MAAMzI,KAAK4W,KAAM5W,KAAK4W,KAAOV,GAC9ClW,KAAK4W,MAAQV,GACK,IAAVA,EACR+B,EAAO,IAGPA,EAAsB,IAAdjY,KAAK4W,KAAc5W,KAAK6I,KAAO7I,KAAK6I,KAAKJ,MAAMzI,KAAK4W,MAC5D5W,KAAK2W,SAEAsB,CACT,EAUA3I,EAAKuK,iBAAiBxT,UAAU8N,MAAQ,SAAS+B,GAC/C,YAA0B,IAAZ,EACZlW,KAAK6I,KAAKJ,MAAMzI,KAAK4W,MACrB5W,KAAK6I,KAAKJ,MAAMzI,KAAK4W,KAAM5W,KAAK4W,KAAOV,EAC3C,EASA5G,EAAKuK,iBAAiBxT,UAAUsN,GAAK,SAAStQ,GAC5C,OAAOrD,KAAK6I,KAAKwD,WAAWrM,KAAK4W,KAAOvT,EAC1C,EAUAiM,EAAKuK,iBAAiBxT,UAAUiX,MAAQ,SAASja,EAAG+O,GAIlD,OAHApS,KAAK6I,KAAO7I,KAAK6I,KAAKoT,OAAO,EAAGjc,KAAK4W,KAAOvT,GAC1C4W,OAAOC,aAAa9H,GACpBpS,KAAK6I,KAAKoT,OAAOjc,KAAK4W,KAAOvT,EAAI,GAC5BrD,IACT,EAOAsP,EAAKuK,iBAAiBxT,UAAUkX,KAAO,WACrC,OAAOvd,KAAK6I,KAAKwD,WAAWrM,KAAK6I,KAAKjG,OAAS,EACjD,EAOA0M,EAAKuK,iBAAiBxT,UAAU2U,KAAO,WACrC,IAAI3I,EAAI/C,EAAKE,aAAaxP,KAAK6I,MAE/B,OADAwJ,EAAEuE,KAAO5W,KAAK4W,KACPvE,CACT,EAOA/C,EAAKuK,iBAAiBxT,UAAU2O,QAAU,WAKxC,OAJGhV,KAAK4W,KAAO,IACb5W,KAAK6I,KAAO7I,KAAK6I,KAAKJ,MAAMzI,KAAK4W,MACjC5W,KAAK4W,KAAO,GAEP5W,IACT,EAOAsP,EAAKuK,iBAAiBxT,UAAUsQ,MAAQ,WAGtC,OAFA3W,KAAK6I,KAAO,GACZ7I,KAAK4W,KAAO,EACL5W,IACT,EASAsP,EAAKuK,iBAAiBxT,UAAU8P,SAAW,SAASD,GAClD,IAAIxG,EAAMzC,KAAKmQ,IAAI,EAAGpd,KAAK4C,SAAWsT,GAGtC,OAFAlW,KAAK6I,KAAO7I,KAAK6I,KAAKoT,OAAOjc,KAAK4W,KAAMlH,GACxC1P,KAAK4W,KAAO,EACL5W,IACT,EAOAsP,EAAKuK,iBAAiBxT,UAAUmX,MAAQ,WAEtC,IADA,IAAIvF,EAAO,GACH5U,EAAIrD,KAAK4W,KAAMvT,EAAIrD,KAAK6I,KAAKjG,SAAUS,EAAG,CAChD,IAAI+O,EAAIpS,KAAK6I,KAAKwD,WAAWhJ,GAC1B+O,EAAI,KACL6F,GAAQ,KAEVA,GAAQ7F,EAAErE,SAAS,GACrB,CACA,OAAOkK,CACT,EAOA3I,EAAKuK,iBAAiBxT,UAAU0H,SAAW,WACzC,OAAOuB,EAAKmO,WAAWzd,KAAKmU,QAC9B,EAuEA7E,EAAKoO,WArCL,SAAoBtL,EAAGlJ,GAErBA,EAAUA,GAAW,CAAC,EAGtBlJ,KAAK4W,KAAO1N,EAAQyU,YAAc,EAClC3d,KAAK4d,SAAW1U,EAAQ0U,UAAY,KAEpC,IAAI9D,EAAgBxK,EAAKwK,cAAc1H,GACnC2H,EAAoBzK,EAAKyK,kBAAkB3H,GAC/C,GAAG0H,GAAiBC,EAYlB,OATE/Z,KAAK6I,KADJiR,EACW,IAAI+D,SAASzL,GAKb,IAAIyL,SAASzL,EAAE0J,OAAQ1J,EAAE0L,WAAY1L,EAAE2J,iBAErD/b,KAAK+d,MAAS,gBAAiB7U,EAC7BA,EAAQ8U,YAAche,KAAK6I,KAAKkT,YAKpC/b,KAAK6I,KAAO,IAAIgV,SAAS,IAAIhC,YAAY,IACzC7b,KAAK+d,MAAQ,EAEV3L,SACDpS,KAAK8W,SAAS1E,GAGb,gBAAiBlJ,IAClBlJ,KAAK+d,MAAQ7U,EAAQ8U,YAEzB,EAQA1O,EAAKoO,WAAWrX,UAAUzD,OAAS,WACjC,OAAO5C,KAAK+d,MAAQ/d,KAAK4W,IAC3B,EAOAtH,EAAKoO,WAAWrX,UAAU6V,QAAU,WAClC,OAAOlc,KAAK4C,UAAY,CAC1B,EAaA0M,EAAKoO,WAAWrX,UAAU4X,YAAc,SAASC,EAAQN,GACvD,GAAG5d,KAAK4C,UAAYsb,EAClB,OAAOle,KAET4d,EAAW3Q,KAAKmQ,IAAIQ,GAAY5d,KAAK4d,SAAUM,GAG/C,IAAIC,EAAM,IAAI/K,WACZpT,KAAK6I,KAAKiT,OAAQ9b,KAAK6I,KAAKiV,WAAY9d,KAAK6I,KAAKkT,YAChDqC,EAAM,IAAIhL,WAAWpT,KAAK4C,SAAWgb,GAIzC,OAHAQ,EAAIC,IAAIF,GACRne,KAAK6I,KAAO,IAAIgV,SAASO,EAAItC,QAEtB9b,IACT,EASAsP,EAAKoO,WAAWrX,UAAUoJ,QAAU,SAAS2C,GAG3C,OAFApS,KAAKie,YAAY,GACjBje,KAAK6I,KAAKyV,SAASte,KAAK+d,QAAS3L,GAC1BpS,IACT,EAUAsP,EAAKoO,WAAWrX,UAAU4P,aAAe,SAAS7D,EAAGf,GACnDrR,KAAKie,YAAY5M,GACjB,IAAI,IAAIhO,EAAI,EAAGA,EAAIgO,IAAKhO,EACtBrD,KAAK6I,KAAKyV,SAASlM,GAErB,OAAOpS,IACT,EAYAsP,EAAKoO,WAAWrX,UAAUyQ,SAAW,SAAS3C,EAAOoK,GACnD,GAAGjP,EAAKyK,kBAAkB5F,GAAQ,CAChC,IACIzE,GADAyO,EAAM,IAAI/K,WAAWe,EAAM2H,OAAQ3H,EAAM2J,WAAY3J,EAAM4H,aACjDA,WAAaoC,EAAIL,WAK/B,OAJA9d,KAAKie,YAAYvO,GACP,IAAI0D,WAAWpT,KAAK6I,KAAKiT,OAAQ9b,KAAK+d,OAC5CM,IAAIF,GACRne,KAAK+d,OAASrO,EACP1P,IACT,CAEA,GAAGsP,EAAKwK,cAAc3F,GAAQ,CAC5B,IAAIgK,EAAM,IAAI/K,WAAWe,GAKzB,OAJAnU,KAAKie,YAAYE,EAAIpC,YACX,IAAI3I,WAAWpT,KAAK6I,KAAKiT,QAC/BuC,IAAIF,EAAKne,KAAK+d,OAClB/d,KAAK+d,OAASI,EAAIpC,WACX/b,IACT,CAGA,GAAGmU,aAAiB7E,EAAKoO,YACL,iBAAVvJ,GACc,iBAAfA,EAAMyC,MAA4C,iBAAhBzC,EAAM4J,OAC/CzO,EAAKyK,kBAAkB5F,EAAMtL,MAM7B,OALIsV,EAAM,IAAI/K,WAAWe,EAAMtL,KAAKkT,WAAY5H,EAAMyC,KAAMzC,EAAMvR,UAClE5C,KAAKie,YAAYE,EAAIpC,YACX,IAAI3I,WAAWe,EAAMtL,KAAKkT,WAAY/b,KAAK+d,OACjDM,IAAIF,GACRne,KAAK+d,OAASI,EAAIpC,WACX/b,KAWT,GARGmU,aAAiB7E,EAAKuK,mBAEvB1F,EAAQA,EAAMtL,KACd0V,EAAW,UAIbA,EAAWA,GAAY,SACH,iBAAVpK,EAAoB,CAC5B,IAAIqK,EAGJ,GAAgB,QAAbD,EAID,OAHAve,KAAKie,YAAYhR,KAAKwR,KAAKtK,EAAMvR,OAAS,IAC1C4b,EAAO,IAAIpL,WAAWpT,KAAK6I,KAAKiT,OAAQ9b,KAAK+d,OAC7C/d,KAAK+d,OAASzO,EAAKoP,OAAOC,IAAI7S,OAAOqI,EAAOqK,EAAMxe,KAAK+d,OAChD/d,KAET,GAAgB,WAAbue,EAID,OAHAve,KAAKie,YAA0C,EAA9BhR,KAAKwR,KAAKtK,EAAMvR,OAAS,IAC1C4b,EAAO,IAAIpL,WAAWpT,KAAK6I,KAAKiT,OAAQ9b,KAAK+d,OAC7C/d,KAAK+d,OAASzO,EAAKoP,OAAOE,OAAO9S,OAAOqI,EAAOqK,EAAMxe,KAAK+d,OACnD/d,KAWT,GAPgB,SAAbue,IAEDpK,EAAQ7E,EAAK8M,WAAWjI,GACxBoK,EAAW,UAIG,WAAbA,GAAsC,QAAbA,EAK1B,OAHAve,KAAKie,YAAY9J,EAAMvR,QACvB4b,EAAO,IAAIpL,WAAWpT,KAAK6I,KAAKiT,OAAQ9b,KAAK+d,OAC7C/d,KAAK+d,OAASzO,EAAKoP,OAAOG,IAAI/S,OAAO0S,GAC9Bxe,KAIT,GAAgB,UAAbue,EAKD,OAHAve,KAAKie,YAA2B,EAAf9J,EAAMvR,QACvB4b,EAAO,IAAIM,YAAY9e,KAAK6I,KAAKiT,OAAQ9b,KAAK+d,OAC9C/d,KAAK+d,OAASzO,EAAKyP,KAAKC,MAAMrS,OAAO6R,GAC9Bxe,KAGT,MAAM,IAAIyH,MAAM,qBAAuB8W,EACzC,CAEA,MAAM9W,MAAM,sBAAwB0M,EACtC,EASA7E,EAAKoO,WAAWrX,UAAU0O,UAAY,SAAS+G,GAG7C,OAFA9b,KAAK8W,SAASgF,GACdA,EAAOnF,QACA3W,IACT,EAUAsP,EAAKoO,WAAWrX,UAAU8V,UAAY,SAASzQ,GAC7C,OAAO1L,KAAK8W,SAASpL,EAAK,QAC5B,EASA4D,EAAKoO,WAAWrX,UAAUgW,SAAW,SAAShZ,GAI5C,OAHArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKoW,SAASjf,KAAK+d,MAAO1a,GAC/BrD,KAAK+d,OAAS,EACP/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAUiW,SAAW,SAASjZ,GAK5C,OAJArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKoW,SAASjf,KAAK+d,MAAO1a,GAAK,EAAI,OACxCrD,KAAK6I,KAAKqW,QAAQlf,KAAK+d,MAAO1a,GAAK,GAAK,KACxCrD,KAAK+d,OAAS,EACP/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAU0P,SAAW,SAAS1S,GAI5C,OAHArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKsW,SAASnf,KAAK+d,MAAO1a,GAC/BrD,KAAK+d,OAAS,EACP/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAUkW,WAAa,SAASlZ,GAI9C,OAHArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKoW,SAASjf,KAAK+d,MAAO1a,GAAG,GAClCrD,KAAK+d,OAAS,EACP/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAUmW,WAAa,SAASnZ,GAK9C,OAJArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKqW,QAAQlf,KAAK+d,MAAO1a,GAAK,GAAK,KACxCrD,KAAK6I,KAAKoW,SAASjf,KAAK+d,MAAO1a,GAAK,EAAI,OAAQ,GAChDrD,KAAK+d,OAAS,EACP/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAUoW,WAAa,SAASpZ,GAI9C,OAHArD,KAAKie,YAAY,GACjBje,KAAK6I,KAAKsW,SAASnf,KAAK+d,MAAO1a,GAAG,GAClCrD,KAAK+d,OAAS,EACP/d,IACT,EAUAsP,EAAKoO,WAAWrX,UAAUqW,OAAS,SAASrZ,EAAGgO,GAC7CuI,EAAgBvI,GAChBrR,KAAKie,YAAY5M,EAAI,GACrB,GACEA,GAAK,EACLrR,KAAK6I,KAAKqW,QAAQlf,KAAK+d,QAAU1a,GAAKgO,EAAK,WACrCA,EAAI,GACZ,OAAOrR,IACT,EAWAsP,EAAKoO,WAAWrX,UAAUsW,aAAe,SAAStZ,EAAGgO,GAMnD,OALAuI,EAAgBvI,GAChBrR,KAAKie,YAAY5M,EAAI,GAClBhO,EAAI,IACLA,GAAK,GAAMgO,EAAI,GAEVrR,KAAK0c,OAAOrZ,EAAGgO,EACxB,EAOA/B,EAAKoO,WAAWrX,UAAUuW,QAAU,WAClC,OAAO5c,KAAK6I,KAAKuW,QAAQpf,KAAK4W,OAChC,EAQAtH,EAAKoO,WAAWrX,UAAUwW,SAAW,WACnC,IAAI5E,EAAOjY,KAAK6I,KAAKgU,SAAS7c,KAAK4W,MAEnC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKoO,WAAWrX,UAAUyW,SAAW,WACnC,IAAI7E,EACFjY,KAAK6I,KAAKgU,SAAS7c,KAAK4W,OAAS,EACjC5W,KAAK6I,KAAKuW,QAAQpf,KAAK4W,KAAO,GAEhC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKoO,WAAWrX,UAAUsJ,SAAW,WACnC,IAAIsI,EAAOjY,KAAK6I,KAAK8G,SAAS3P,KAAK4W,MAEnC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKoO,WAAWrX,UAAU0W,WAAa,WACrC,IAAI9E,EAAOjY,KAAK6I,KAAKgU,SAAS7c,KAAK4W,MAAM,GAEzC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKoO,WAAWrX,UAAU2W,WAAa,WACrC,IAAI/E,EACFjY,KAAK6I,KAAKuW,QAAQpf,KAAK4W,MACvB5W,KAAK6I,KAAKgU,SAAS7c,KAAK4W,KAAO,GAAG,IAAS,EAE7C,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAQA3I,EAAKoO,WAAWrX,UAAU4W,WAAa,WACrC,IAAIhF,EAAOjY,KAAK6I,KAAK8G,SAAS3P,KAAK4W,MAAM,GAEzC,OADA5W,KAAK4W,MAAQ,EACNqB,CACT,EAUA3I,EAAKoO,WAAWrX,UAAU6W,OAAS,SAAS7L,GAC1CuI,EAAgBvI,GAChB,IAAI4G,EAAO,EACX,GAEEA,GAAQA,GAAQ,GAAKjY,KAAK6I,KAAKuW,QAAQpf,KAAK4W,QAC5CvF,GAAK,QACCA,EAAI,GACZ,OAAO4G,CACT,EAUA3I,EAAKoO,WAAWrX,UAAU8W,aAAe,SAAS9L,GAEhD,IAAI+G,EAAIpY,KAAKkd,OAAO7L,GAChB+L,EAAM,GAAM/L,EAAI,EAIpB,OAHG+G,GAAKgF,IACNhF,GAAKgF,GAAO,GAEPhF,CACT,EAUA9I,EAAKoO,WAAWrX,UAAUwQ,SAAW,SAASX,GAI5C,IAAI+B,EAaJ,OAZG/B,GAEDA,EAAQjJ,KAAKoQ,IAAIrd,KAAK4C,SAAUsT,GAChC+B,EAAOjY,KAAK6I,KAAKJ,MAAMzI,KAAK4W,KAAM5W,KAAK4W,KAAOV,GAC9ClW,KAAK4W,MAAQV,GACK,IAAVA,EACR+B,EAAO,IAGPA,EAAsB,IAAdjY,KAAK4W,KAAc5W,KAAK6I,KAAO7I,KAAK6I,KAAKJ,MAAMzI,KAAK4W,MAC5D5W,KAAK2W,SAEAsB,CACT,EAUA3I,EAAKoO,WAAWrX,UAAU8N,MAAQ,SAAS+B,GAEzC,YAA0B,IAAZ,EACZlW,KAAK6I,KAAKJ,MAAMzI,KAAK4W,MACrB5W,KAAK6I,KAAKJ,MAAMzI,KAAK4W,KAAM5W,KAAK4W,KAAOV,EAC3C,EASA5G,EAAKoO,WAAWrX,UAAUsN,GAAK,SAAStQ,GACtC,OAAOrD,KAAK6I,KAAKwW,SAASrf,KAAK4W,KAAOvT,EACxC,EAUAiM,EAAKoO,WAAWrX,UAAUiX,MAAQ,SAASja,EAAG+O,GAE5C,OADApS,KAAK6I,KAAKyV,SAASjb,EAAG+O,GACfpS,IACT,EAOAsP,EAAKoO,WAAWrX,UAAUkX,KAAO,WAC/B,OAAOvd,KAAK6I,KAAKwW,SAASrf,KAAK+d,MAAQ,EACzC,EAOAzO,EAAKoO,WAAWrX,UAAU2U,KAAO,WAC/B,OAAO,IAAI1L,EAAKoO,WAAW1d,KAC7B,EAOAsP,EAAKoO,WAAWrX,UAAU2O,QAAU,WAClC,GAAGhV,KAAK4W,KAAO,EAAG,CAChB,IAAIuH,EAAM,IAAI/K,WAAWpT,KAAK6I,KAAKiT,OAAQ9b,KAAK4W,MAC5CwH,EAAM,IAAIhL,WAAW+K,EAAIpC,YAC7BqC,EAAIC,IAAIF,GACRne,KAAK6I,KAAO,IAAIgV,SAASO,GACzBpe,KAAK+d,OAAS/d,KAAK4W,KACnB5W,KAAK4W,KAAO,CACd,CACA,OAAO5W,IACT,EAOAsP,EAAKoO,WAAWrX,UAAUsQ,MAAQ,WAGhC,OAFA3W,KAAK6I,KAAO,IAAIgV,SAAS,IAAIhC,YAAY,IACzC7b,KAAK4W,KAAO5W,KAAK+d,MAAQ,EAClB/d,IACT,EASAsP,EAAKoO,WAAWrX,UAAU8P,SAAW,SAASD,GAG5C,OAFAlW,KAAK+d,MAAQ9Q,KAAKmQ,IAAI,EAAGpd,KAAK4C,SAAWsT,GACzClW,KAAK4W,KAAO3J,KAAKoQ,IAAIrd,KAAK4W,KAAM5W,KAAK+d,OAC9B/d,IACT,EAOAsP,EAAKoO,WAAWrX,UAAUmX,MAAQ,WAEhC,IADA,IAAIvF,EAAO,GACH5U,EAAIrD,KAAK4W,KAAMvT,EAAIrD,KAAK6I,KAAKkT,aAAc1Y,EAAG,CACpD,IAAI+O,EAAIpS,KAAK6I,KAAKwW,SAAShc,GACxB+O,EAAI,KACL6F,GAAQ,KAEVA,GAAQ7F,EAAErE,SAAS,GACrB,CACA,OAAOkK,CACT,EAWA3I,EAAKoO,WAAWrX,UAAU0H,SAAW,SAASwQ,GAC5C,IAAIC,EAAO,IAAIpL,WAAWpT,KAAK6I,KAAM7I,KAAK4W,KAAM5W,KAAK4C,UAIrD,GAAgB,YAHhB2b,EAAWA,GAAY,SAGkB,QAAbA,EAC1B,OAAOjP,EAAKoP,OAAOG,IAAIlS,OAAO6R,GAEhC,GAAgB,QAAbD,EACD,OAAOjP,EAAKoP,OAAOC,IAAIhS,OAAO6R,GAEhC,GAAgB,WAAbD,EACD,OAAOjP,EAAKoP,OAAOE,OAAOjS,OAAO6R,GAInC,GAAgB,SAAbD,EACD,OAAOjP,EAAKyP,KAAKO,KAAKxT,OAAO0S,GAE/B,GAAgB,UAAbD,EACD,OAAOjP,EAAKyP,KAAKC,MAAMlT,OAAO0S,GAGhC,MAAM,IAAI/W,MAAM,qBAAuB8W,EACzC,EAcAjP,EAAKE,aAAe,SAASyC,EAAOsM,GAMlC,OAJAA,EAAWA,GAAY,WACV3Y,IAAVqM,GAAoC,SAAbsM,IACxBtM,EAAQ3C,EAAK8M,WAAWnK,IAEnB,IAAI3C,EAAKyD,WAAWd,EAC7B,EAYA3C,EAAKiQ,WAAa,SAASlN,EAAGhB,GAE5B,IADA,IAAImO,EAAI,GACFnO,EAAI,GACD,EAAJA,IACDmO,GAAKnN,IAEPhB,KAAO,GACA,IACLgB,GAAKA,GAGT,OAAOmN,CACT,EAYAlQ,EAAKmQ,SAAW,SAASC,EAAIC,EAAItO,GAM/B,IALA,IAAIuO,EAAK,GACLxN,EAAI,GACJyN,EAAI,GACJxc,EAAI,EACJgP,EAAI,EACFhB,EAAI,IAAKA,IAAKhO,EAClB+O,EAAIsN,EAAGrT,WAAWhJ,GAAKsc,EAAGtT,WAAWhJ,GAClCgP,GAAK,KACNuN,GAAMC,EACNA,EAAI,GACJxN,EAAI,GAENwN,GAAK5F,OAAOC,aAAa9H,KACvBC,EAGJ,OADAuN,EAAMC,CAER,EASAvQ,EAAKwQ,WAAa,SAASnB,GAEzB,IAAI1G,EAAO,GACP5U,EAAI,EAOR,KANgB,EAAbsb,EAAI/b,SAELS,EAAI,EACJ4U,GAAQgC,OAAOC,aAAa6F,SAASpB,EAAI,GAAI,MAGzCtb,EAAIsb,EAAI/b,OAAQS,GAAK,EACzB4U,GAAQgC,OAAOC,aAAa6F,SAASpB,EAAI1C,OAAO5Y,EAAG,GAAI,KAEzD,OAAO4U,CACT,EASA3I,EAAK0Q,WAAa,SAAS7L,GAEzB,OAAO7E,EAAKE,aAAa2E,GAAOqJ,OAClC,EASAlO,EAAK2Q,aAAe,SAAS5c,GAC3B,OACE4W,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,GAAK,KAC9B4W,OAAOC,aAAa7W,GAAK,EAAI,KAC7B4W,OAAOC,aAAiB,IAAJ7W,EACxB,EAGA,IAAI6c,EACF,oEACEC,EAAa,CAGd,IAAK,GAAI,GAAI,EAAG,GAGhB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGpC,GAAI,GAAI,EAAG,IAAK,GAAI,GAAI,EAIxB,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAG,GAAI,GAAI,GAG/C,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAIhD,GAAI,GAAI,GAAI,GAAI,GAAI,EAIpB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAGhD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAI/CC,EAAU,6DAWd9Q,EAAK+Q,SAAW,SAASpO,EAAOkB,GAM9B,IAJA,IAEImN,EAAMC,EAAMC,EAFZC,EAAO,GACP7X,EAAS,GAETvF,EAAI,EACFA,EAAI4O,EAAMrP,QACd0d,EAAOrO,EAAM5F,WAAWhJ,KACxBkd,EAAOtO,EAAM5F,WAAWhJ,KACxBmd,EAAOvO,EAAM5F,WAAWhJ,KAGxBod,GAAQP,EAAQ3M,OAAO+M,GAAQ,GAC/BG,GAAQP,EAAQ3M,QAAgB,EAAP+M,IAAa,EAAMC,GAAQ,GACjDxT,MAAMwT,GACPE,GAAQ,MAERA,GAAQP,EAAQ3M,QAAgB,GAAPgN,IAAc,EAAMC,GAAQ,GACrDC,GAAQ1T,MAAMyT,GAAQ,IAAMN,EAAQ3M,OAAc,GAAPiN,IAG1CrN,GAAWsN,EAAK7d,OAASuQ,IAC1BvK,GAAU6X,EAAKxE,OAAO,EAAG9I,GAAW,OACpCsN,EAAOA,EAAKxE,OAAO9I,IAIvB,OADAvK,EAAU6X,CAEZ,EASAnR,EAAKoR,SAAW,SAASzO,GAIvBA,EAAQA,EAAMiC,QAAQ,sBAAuB,IAM7C,IAJA,IACIyM,EAAMC,EAAMC,EAAMC,EADlBlY,EAAS,GAETvF,EAAI,EAEFA,EAAI4O,EAAMrP,QACd+d,EAAOR,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cud,EAAOT,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cwd,EAAOV,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cyd,EAAOX,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAE1CuF,GAAUqR,OAAOC,aAAcyG,GAAQ,EAAMC,GAAQ,GACzC,KAATC,IAEDjY,GAAUqR,OAAOC,cAAsB,GAAP0G,IAAc,EAAMC,GAAQ,GAChD,KAATC,IAEDlY,GAAUqR,OAAOC,cAAsB,EAAP2G,IAAa,EAAKC,KAKxD,OAAOlY,CACT,EAYA0G,EAAK8M,WAAa,SAAS1Q,GACzB,OAAOqV,SAAS9S,mBAAmBvC,GACrC,EAWA4D,EAAKmO,WAAa,SAAS/R,GACzB,OAAOsC,mBAAmBgT,OAAOtV,GACnC,EAIA4D,EAAKoP,OAAS,CACZG,IAAK,CAAC,EACNF,IAAK,CAAC,EACNC,OAAQ,CAAC,EACTqC,OAAQ,CAAC,EACTtH,MAAQ,CACNhN,OAAQgN,EAAMhN,OACdb,OAAQ6N,EAAM7N,SAYlBwD,EAAKoP,OAAOG,IAAIlS,OAAS,SAASwH,GAChC,OAAO8F,OAAOC,aAAa9V,MAAM,KAAM+P,EACzC,EAaA7E,EAAKoP,OAAOG,IAAI/S,OAAS,SAASJ,EAAK9C,EAAQsY,GAC7C,IAAIzI,EAAM7P,EACN6P,IACFA,EAAM,IAAIrF,WAAW1H,EAAI9I,SAI3B,IADA,IAAI6Q,EADJyN,EAASA,GAAU,EAEX7d,EAAI,EAAGA,EAAIqI,EAAI9I,SAAUS,EAC/BoV,EAAIhF,KAAO/H,EAAIW,WAAWhJ,GAE5B,OAAOuF,EAAU6K,EAAIyN,EAAUzI,CACjC,EAUAnJ,EAAKoP,OAAOC,IAAIhS,OAAS2C,EAAK0Q,WAY9B1Q,EAAKoP,OAAOC,IAAI7S,OAAS,SAAS6S,EAAK/V,EAAQsY,GAC7C,IAAIzI,EAAM7P,EACN6P,IACFA,EAAM,IAAIrF,WAAWnG,KAAKwR,KAAKE,EAAI/b,OAAS,KAG9C,IAAIS,EAAI,EAAGoQ,EADXyN,EAASA,GAAU,EAQnB,IANgB,EAAbvC,EAAI/b,SAELS,EAAI,EACJoV,EAAIhF,KAAOsM,SAASpB,EAAI,GAAI,KAGxBtb,EAAIsb,EAAI/b,OAAQS,GAAK,EACzBoV,EAAIhF,KAAOsM,SAASpB,EAAI1C,OAAO5Y,EAAG,GAAI,IAExC,OAAOuF,EAAU6K,EAAIyN,EAAUzI,CACjC,EAWAnJ,EAAKoP,OAAOE,OAAOjS,OAAS,SAASsF,EAAOkB,GAK1C,IAJA,IAEImN,EAAMC,EAAMC,EAFZC,EAAO,GACP7X,EAAS,GAETvF,EAAI,EACFA,EAAI4O,EAAM8J,YACduE,EAAOrO,EAAM5O,KACbkd,EAAOtO,EAAM5O,KACbmd,EAAOvO,EAAM5O,KAGbod,GAAQP,EAAQ3M,OAAO+M,GAAQ,GAC/BG,GAAQP,EAAQ3M,QAAgB,EAAP+M,IAAa,EAAMC,GAAQ,GACjDxT,MAAMwT,GACPE,GAAQ,MAERA,GAAQP,EAAQ3M,QAAgB,GAAPgN,IAAc,EAAMC,GAAQ,GACrDC,GAAQ1T,MAAMyT,GAAQ,IAAMN,EAAQ3M,OAAc,GAAPiN,IAG1CrN,GAAWsN,EAAK7d,OAASuQ,IAC1BvK,GAAU6X,EAAKxE,OAAO,EAAG9I,GAAW,OACpCsN,EAAOA,EAAKxE,OAAO9I,IAIvB,OADAvK,EAAU6X,CAEZ,EAYAnR,EAAKoP,OAAOE,OAAO9S,OAAS,SAASmG,EAAOrJ,EAAQsY,GAClD,IASIP,EAAMC,EAAMC,EAAMC,EATlBrI,EAAM7P,EACN6P,IACFA,EAAM,IAAIrF,WAAyC,EAA9BnG,KAAKwR,KAAKxM,EAAMrP,OAAS,KAIhDqP,EAAQA,EAAMiC,QAAQ,sBAAuB,IAM7C,IAFA,IAAI7Q,EAAI,EAAGoQ,EAFXyN,EAASA,GAAU,EAIb7d,EAAI4O,EAAMrP,QACd+d,EAAOR,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cud,EAAOT,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cwd,EAAOV,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAC1Cyd,EAAOX,EAAWlO,EAAM5F,WAAWhJ,KAAO,IAE1CoV,EAAIhF,KAAQkN,GAAQ,EAAMC,GAAQ,EACtB,KAATC,IAEDpI,EAAIhF,MAAgB,GAAPmN,IAAc,EAAMC,GAAQ,EAC7B,KAATC,IAEDrI,EAAIhF,MAAgB,EAAPoN,IAAa,EAAKC,IAMrC,OAAOlY,EAAU6K,EAAIyN,EAAUzI,EAAI0I,SAAS,EAAG1N,EACjD,EAGAnE,EAAKoP,OAAOuC,OAAOtU,OAAS,SAASsF,EAAOkB,GAC1C,OAAO7D,EAAKoP,OAAO/E,MAAMhN,OAAOsF,EAAOmO,EAASjN,EAClD,EACA7D,EAAKoP,OAAOuC,OAAOnV,OAAS,SAASmG,EAAOkB,GAC1C,OAAO7D,EAAKoP,OAAO/E,MAAM7N,OAAOmG,EAAOmO,EAASjN,EAClD,EAIA7D,EAAKyP,KAAO,CACVO,KAAM,CAAC,EACPN,MAAO,CAAC,GAaV1P,EAAKyP,KAAKO,KAAK3S,OAAS,SAASjB,EAAK9C,EAAQsY,GAC5CxV,EAAM4D,EAAK8M,WAAW1Q,GACtB,IAAI+M,EAAM7P,EACN6P,IACFA,EAAM,IAAIrF,WAAW1H,EAAI9I,SAI3B,IADA,IAAI6Q,EADJyN,EAASA,GAAU,EAEX7d,EAAI,EAAGA,EAAIqI,EAAI9I,SAAUS,EAC/BoV,EAAIhF,KAAO/H,EAAIW,WAAWhJ,GAE5B,OAAOuF,EAAU6K,EAAIyN,EAAUzI,CACjC,EASAnJ,EAAKyP,KAAKO,KAAKxT,OAAS,SAASqI,GAC/B,OAAO7E,EAAKmO,WAAWxD,OAAOC,aAAa9V,MAAM,KAAM+P,GACzD,EAYA7E,EAAKyP,KAAKC,MAAMrS,OAAS,SAASjB,EAAK9C,EAAQsY,GAC7C,IAAIzI,EAAM7P,EACN6P,IACFA,EAAM,IAAIrF,WAAwB,EAAb1H,EAAI9I,SAM3B,IAJA,IAAI4b,EAAO,IAAIM,YAAYrG,EAAIqD,QAE3BrI,EADJyN,EAASA,GAAU,EAEfxb,EAAIwb,EACA7d,EAAI,EAAGA,EAAIqI,EAAI9I,SAAUS,EAC/Bmb,EAAK9Y,KAAOgG,EAAIW,WAAWhJ,GAC3BoQ,GAAK,EAEP,OAAO7K,EAAU6K,EAAIyN,EAAUzI,CACjC,EASAnJ,EAAKyP,KAAKC,MAAMlT,OAAS,SAASqI,GAChC,OAAO8F,OAAOC,aAAa9V,MAAM,KAAM,IAAI0a,YAAY3K,EAAM2H,QAC/D,EAYAxM,EAAK8R,QAAU,SAASpO,EAAKmB,EAAO0K,GAIlC,GAHA1K,EAAQ7E,EAAKoR,SAAS1N,EAAIoO,QAAQ9R,EAAK+Q,SAASlM,IAAQ8D,MAGrD4G,EAAK,CAIN,IAAItW,EAAQ,EAEH,GADC4L,EAAM9H,WAAW,KAEzB9D,EAAQ,GAGV4L,EAAQA,EAAMkN,UAAU9Y,EAAO4L,EAAMvR,OAAS,EAChD,CAEA,OAAOuR,CACT,EAYA7E,EAAKgS,QAAU,SAAStO,EAAKmB,EAAO0K,GAElC,IAAI5G,EAAOjF,EAAIsO,QAAQhS,EAAK+Q,SAASlM,IAAQ8D,KAC7C,OAAiB,OAATA,EAAiB,KAAO3I,EAAKoR,SAASzI,EAChD,EASA,IAAIsJ,EAAoB,SAASvO,EAAKtL,EAAIkE,GACxC,IAAIoH,EACF,MAAM,IAAIvL,MAAM,6BAGlB,IAAIwQ,EAUJ,GATW,OAARrM,EACDqM,EAAOjF,EAAIwO,WAAW9Z,IAGtBkE,EAAM0D,EAAK+Q,SAASoB,KAAKC,UAAU9V,IACnCqM,EAAOjF,EAAI2O,QAAQja,EAAIkE,SAIL,IAAX,IAAwC,IAAdqM,EAAKA,KAAe,CACrD,IAAI2J,EAAQ,IAAIna,MAAMwQ,EAAK2J,MAAMC,SAGjC,MAFAD,EAAMla,GAAKuQ,EAAK2J,MAAMla,GACtBka,EAAMpV,KAAOyL,EAAK2J,MAAMpV,KAClBoV,CACR,CACF,EAUIE,EAAoB,SAAS9O,EAAKtL,GACpC,IAAIsL,EACF,MAAM,IAAIvL,MAAM,6BAIlB,IAAIwQ,EAAOjF,EAAI+O,QAAQra,GAQvB,GAAGsL,EAAIxL,KACL,GAAiB,OAAdyQ,EAAKA,KAAe,CACrB,GAAGA,EAAK2J,MAAO,CACb,IAAIA,EAAQ,IAAIna,MAAMwQ,EAAK2J,MAAMC,SAGjC,MAFAD,EAAMla,GAAKuQ,EAAK2J,MAAMla,GACtBka,EAAMpV,KAAOyL,EAAK2J,MAAMpV,KAClBoV,CACR,CAEA3J,EAAO,IACT,MACEA,EAAOA,EAAKA,KAUhB,OALY,OAATA,IAEDA,EAAOwJ,KAAKhW,MAAM6D,EAAKoR,SAASzI,KAG3BA,CACT,EAUI+J,EAAW,SAAShP,EAAKtL,EAAIQ,EAAKW,GAEpC,IAAI+C,EAAMkW,EAAkB9O,EAAKtL,GACtB,OAARkE,IAEDA,EAAM,CAAC,GAGTA,EAAI1D,GAAOW,EAGX0Y,EAAkBvO,EAAKtL,EAAIkE,EAC7B,EAWIqW,EAAW,SAASjP,EAAKtL,EAAIQ,GAE/B,IAAI+P,EAAO6J,EAAkB9O,EAAKtL,GAMlC,OALY,OAATuQ,IAEDA,EAAQ/P,KAAO+P,EAAQA,EAAK/P,GAAO,MAG9B+P,CACT,EASIiK,EAAc,SAASlP,EAAKtL,EAAIQ,GAElC,IAAI0D,EAAMkW,EAAkB9O,EAAKtL,GACjC,GAAW,OAARkE,GAAgB1D,KAAO0D,EAAK,QAEtBA,EAAI1D,GAGX,IAAIia,GAAQ,EACZ,IAAI,IAAIC,KAAQxW,EAAK,CACnBuW,GAAQ,EACR,KACF,CACGA,IAEDvW,EAAM,MAIR2V,EAAkBvO,EAAKtL,EAAIkE,EAC7B,CACF,EAQIyW,EAAc,SAASrP,EAAKtL,GAC9B6Z,EAAkBvO,EAAKtL,EAAI,KAC7B,EAWI4a,EAAuB,SAASC,EAAMnf,EAAMof,GAC9C,IAQIC,EARAxK,EAAO,UAGa,IAAf,IACPuK,EAAW,CAAC,MAAO,UAKrB,IAAIre,GAAO,EACPue,EAAY,KAChB,IAAI,IAAIpf,KAAOkf,EAAU,CACvBC,EAAOD,EAASlf,GAChB,IACE,GAAY,UAATmf,GAA6B,SAATA,EAAiB,CACtC,GAAe,OAAZrf,EAAK,GACN,MAAM,IAAIqE,MAAM,sCAElBwQ,EAAOsK,EAAKne,MAAMpE,KAAMoD,GACxBe,EAAiB,UAATse,CACV,CACY,QAATA,GAA2B,SAATA,IACnBrf,EAAK,GAAKuf,aACV1K,EAAOsK,EAAKne,MAAMpE,KAAMoD,GACxBe,GAAO,EAEX,CAAE,MAAMye,GACNF,EAAYE,CACd,CACA,GAAGze,EACD,KAEJ,CAEA,IAAIA,EACF,MAAMue,EAGR,OAAOzK,CACT,EA8BA3I,EAAKqS,QAAU,SAAS3O,EAAKtL,EAAIQ,EAAKW,EAAM2Z,GAC1CF,EAAqBN,EAAU7Y,UAAWqZ,EAC5C,EAcAlT,EAAKyS,QAAU,SAAS/O,EAAKtL,EAAIQ,EAAKsa,GACpC,OAAOF,EAAqBL,EAAU9Y,UAAWqZ,EACnD,EAYAlT,EAAKkS,WAAa,SAASxO,EAAKtL,EAAIQ,EAAKsa,GACvCF,EAAqBJ,EAAa/Y,UAAWqZ,EAC/C,EAWAlT,EAAKuT,WAAa,SAAS7P,EAAKtL,EAAI8a,GAClCF,EAAqBD,EAAalZ,UAAWqZ,EAC/C,EAUAlT,EAAK4M,QAAU,SAAStQ,GACtB,IAAI,IAAIwW,KAAQxW,EACd,GAAGA,EAAItF,eAAe8b,GACpB,OAAO,EAGX,OAAO,CACT,EAWA9S,EAAKwT,OAAS,SAASA,GAarB,IAZA,IAEI/O,EAEAgP,EAJAC,EAAK,MAMLC,EAAO,EAEPC,EAAQ,GAER3F,EAAO,EAEJxJ,EAAQiP,EAAGG,KAAKL,IAAU,EAC/BC,EAAOD,EAAOzB,UAAU9D,EAAMyF,EAAGI,UAAY,IAErCxgB,OAAS,GACfsgB,EAAMjgB,KAAK8f,GAEbxF,EAAOyF,EAAGI,UAEV,IAAIC,EAAOtP,EAAM,GAAG,GACpB,OAAOsP,GACP,IAAK,IACL,IAAK,IAEAJ,EAAO9Z,UAAUvG,OAClBsgB,EAAMjgB,KAAKkG,UAAmB,EAAT8Z,MAErBC,EAAMjgB,KAAK,OAEb,MAIF,IAAK,IACHigB,EAAMjgB,KAAK,KACX,MACF,QACEigB,EAAMjgB,KAAK,KAAOogB,EAAO,MAE7B,CAGA,OADAH,EAAMjgB,KAAK6f,EAAOzB,UAAU9D,IACrB2F,EAAMlP,KAAK,GACpB,EAOA1E,EAAKgU,aAAe,SAASC,EAAQC,EAAUC,EAAWC,GAWxD,IAAIrS,EAAIkS,EAAQlR,EAAItF,MAAMyW,EAAWvW,KAAK0W,IAAIH,IAAa,EAAIA,EAC3Dlb,OAAkB1C,IAAd6d,EAA0B,IAAMA,EACpC5D,OAAsBja,IAAlB8d,EACP,IAAMA,EAAelE,EAAInO,EAAI,EAAI,IAAM,GACpChO,EAAI0c,SAAU1O,EAAIpE,KAAK0W,KAAKtS,GAAK,GAAGuS,QAAQvR,GAAK,IAAM,GACvDoB,EAAKpQ,EAAET,OAAS,EAAKS,EAAET,OAAS,EAAI,EACxC,OAAO4c,GAAK/L,EAAIpQ,EAAE4Y,OAAO,EAAGxI,GAAKoM,EAAI,IACnCxc,EAAE4Y,OAAOxI,GAAGS,QAAQ,iBAAkB,KAAO2L,IAC5CxN,EAAI/J,EAAI2E,KAAK0W,IAAItS,EAAIhO,GAAGugB,QAAQvR,GAAG5J,MAAM,GAAK,GACnD,EAOA6G,EAAKuU,WAAa,SAAS1K,GAUzB,OATGA,GAAQ,WACF7J,EAAKgU,aAAanK,EAAO,WAAY,EAAG,IAAK,IAAM,OAClDA,GAAQ,QACT7J,EAAKgU,aAAanK,EAAO,QAAS,EAAG,IAAK,IAAM,OAC/CA,GAAQ,KACT7J,EAAKgU,aAAanK,EAAO,KAAM,GAAK,OAEpC7J,EAAKgU,aAAanK,EAAM,GAAK,QAGxC,EAUA7J,EAAKwU,YAAc,SAASC,GAC1B,OAAwB,IAArBA,EAAGxgB,QAAQ,KACL+L,EAAK0U,cAAcD,IAEJ,IAArBA,EAAGxgB,QAAQ,KACL+L,EAAK2U,cAAcF,GAErB,IACT,EASAzU,EAAK0U,cAAgB,SAASD,GAE5B,GAAiB,KADjBA,EAAKA,EAAGG,MAAM,MACRthB,OACJ,OAAO,KAGT,IADA,IAAIwP,EAAI9C,EAAKE,eACLnM,EAAI,EAAGA,EAAI0gB,EAAGnhB,SAAUS,EAAG,CACjC,IAAIsS,EAAMoK,SAASgE,EAAG1gB,GAAI,IAC1B,GAAG0J,MAAM4I,GACP,OAAO,KAETvD,EAAE3C,QAAQkG,EACZ,CACA,OAAOvD,EAAEyE,UACX,EASAvH,EAAK2U,cAAgB,SAASF,GAQ5B,IAPA,IAAII,EAAS,EAKTC,EAAmC,GAA1B,GAJbL,EAAKA,EAAGG,MAAM,KAAKG,QAAO,SAASpgB,GAEjC,OADgB,IAAbA,EAAErB,UAAgBuhB,GACd,CACT,KACoBvhB,OAASuhB,GACzB/R,EAAI9C,EAAKE,eACLnM,EAAI,EAAGA,EAAI,IAAKA,EACtB,GAAI0gB,EAAG1gB,IAAuB,IAAjB0gB,EAAG1gB,GAAGT,OAAnB,CAKA,IAAIuR,EAAQ7E,EAAKwQ,WAAWiE,EAAG1gB,IAC5B8Q,EAAMvR,OAAS,GAChBwP,EAAE3C,QAAQ,GAEZ2C,EAAE0E,SAAS3C,EALX,MAHE/B,EAAE6D,aAAa,EAAGmO,GAClBA,EAAQ,EASZ,OAAOhS,EAAEyE,UACX,EAWAvH,EAAKgV,UAAY,SAASnQ,GACxB,OAAoB,IAAjBA,EAAMvR,OACA0M,EAAKiV,YAAYpQ,GAEN,KAAjBA,EAAMvR,OACA0M,EAAKkV,YAAYrQ,GAEnB,IACT,EAUA7E,EAAKiV,YAAc,SAASpQ,GAC1B,GAAoB,IAAjBA,EAAMvR,OACP,OAAO,KAGT,IADA,IAAImhB,EAAK,GACD1gB,EAAI,EAAGA,EAAI8Q,EAAMvR,SAAUS,EACjC0gB,EAAG9gB,KAAKkR,EAAM9H,WAAWhJ,IAE3B,OAAO0gB,EAAG/P,KAAK,IACjB,EAUA1E,EAAKkV,YAAc,SAASrQ,GAC1B,GAAoB,KAAjBA,EAAMvR,OACP,OAAO,KAKT,IAHA,IAAImhB,EAAK,GACLU,EAAa,GACbC,EAAe,EACXrhB,EAAI,EAAGA,EAAI8Q,EAAMvR,OAAQS,GAAK,EAAG,CAGvC,IAFA,IAAIsb,EAAMrP,EAAK0Q,WAAW7L,EAAM9Q,GAAK8Q,EAAM9Q,EAAI,IAE9B,MAAXsb,EAAI,IAAsB,MAARA,GACtBA,EAAMA,EAAI1C,OAAO,GAEnB,GAAW,MAAR0C,EAAa,CACd,IAAIpB,EAAOkH,EAAWA,EAAW7hB,OAAS,GACtCU,EAAMygB,EAAGnhB,OACT2a,GAAQja,IAAQia,EAAK7L,IAAM,GAG7B6L,EAAK7L,IAAMpO,EACPia,EAAK7L,IAAM6L,EAAKhV,MACjBkc,EAAWC,GAAchT,IAAM+S,EAAWC,GAAcnc,QACzDmc,EAAeD,EAAW7hB,OAAS,IALrC6hB,EAAWxhB,KAAK,CAACsF,MAAOjF,EAAKoO,IAAKpO,GAQtC,CACAygB,EAAG9gB,KAAK0b,EACV,CACA,GAAG8F,EAAW7hB,OAAS,EAAG,CACxB,IAAI+hB,EAAQF,EAAWC,GAEpBC,EAAMjT,IAAMiT,EAAMpc,MAAQ,IAC3Bwb,EAAGvgB,OAAOmhB,EAAMpc,MAAOoc,EAAMjT,IAAMiT,EAAMpc,MAAQ,EAAG,IACjC,IAAhBoc,EAAMpc,OACPwb,EAAGa,QAAQ,IAEI,IAAdD,EAAMjT,KACPqS,EAAG9gB,KAAK,IAGd,CACA,OAAO8gB,EAAG/P,KAAK,IACjB,EAWA1E,EAAKuV,cAAgB,SAAS3b,EAASqR,GAMrC,GALsB,mBAAZrR,IACRqR,EAAWrR,EACXA,EAAU,CAAC,GAEbA,EAAUA,GAAW,CAAC,EACnB,UAAWoG,IAASpG,EAAQR,OAC7B,OAAO6R,EAAS,KAAMjL,EAAKwV,OAE7B,GAAwB,oBAAdC,WACR,wBAAyBA,WACzBA,UAAUC,oBAAsB,EAEhC,OADA1V,EAAKwV,MAAQC,UAAUC,oBAChBzK,EAAS,KAAMjL,EAAKwV,OAE7B,GAAqB,oBAAXG,OAGR,OADA3V,EAAKwV,MAAQ,EACNvK,EAAS,KAAMjL,EAAKwV,OAE7B,GAAmB,oBAATI,KAGR,OADA5V,EAAKwV,MAAQ,EACNvK,EAAS,KAAMjL,EAAKwV,OAI7B,IAAIK,EAAUC,IAAIC,gBAAgB,IAAIH,KAAK,CAAC,IAC1C,WACEnlB,KAAK6a,iBAAiB,WAAW,SAAS3W,GAIxC,IAFA,IAAIqhB,EAAKhY,KAAK4N,MACVqK,EAAKD,EAAK,EACRhY,KAAK4N,MAAQqK,IACnBxlB,KAAK0a,YAAY,CAAC6K,GAAIA,EAAIC,GAAIA,GAChC,GACF,EAAExX,WACJ,OAAQ,CAAC0U,KAAM,6BAKf,SAAS+C,EAAOpI,EAAKqI,EAASC,GAC5B,GAAe,IAAZD,EAAe,CAEhB,IAAIE,EAAM1Y,KAAKC,MAAMkQ,EAAIwI,QAAO,SAASD,EAAKvN,GAC5C,OAAOuN,EAAMvN,CACf,GAAG,GAAKgF,EAAIxa,QAGZ,OAFA0M,EAAKwV,MAAQ7X,KAAKmQ,IAAI,EAAGuI,GACzBP,IAAIS,gBAAgBV,GACb5K,EAAS,KAAMjL,EAAKwV,MAC7B,EAOF,SAAaY,EAAYnL,GAGvB,IAFA,IAAIuL,EAAU,GACVC,EAAU,GACN1iB,EAAI,EAAGA,EAAIqiB,IAAcriB,EAAG,CAClC,IAAI2iB,EAAS,IAAIf,OAAOE,GACxBa,EAAOpL,iBAAiB,WAAW,SAAS3W,GAE1C,GADA8hB,EAAQ9iB,KAAKgB,EAAE4E,MACZkd,EAAQnjB,SAAW8iB,EAAY,CAChC,IAAI,IAAIriB,EAAI,EAAGA,EAAIqiB,IAAcriB,EAC/ByiB,EAAQziB,GAAG4iB,YAEb1L,EAAS,EAAMwL,EACjB,CACF,IACAD,EAAQ7iB,KAAK+iB,EACf,CACA,IAAQ3iB,EAAI,EAAGA,EAAIqiB,IAAcriB,EAC/ByiB,EAAQziB,GAAGoX,YAAYpX,EAE3B,CAzBE6iB,CAAIR,GAAY,SAASS,EAAKJ,GAC5B3I,EAAIna,KA0BR,SAAgByiB,EAAYK,GAG1B,IADA,IAAIK,EAAW,GACP/U,EAAI,EAAGA,EAAIqU,IAAcrU,EAG/B,IAFA,IAAIgV,EAAKN,EAAQ1U,GACbiV,EAAUF,EAAS/U,GAAK,GACpBhO,EAAI,EAAGA,EAAIqiB,IAAcriB,EAC/B,GAAGgO,IAAMhO,EAAT,CAGA,IAAIkjB,EAAKR,EAAQ1iB,IACbgjB,EAAGf,GAAKiB,EAAGjB,IAAMe,EAAGf,GAAKiB,EAAGhB,IAC7BgB,EAAGjB,GAAKe,EAAGf,IAAMiB,EAAGjB,GAAKe,EAAGd,KAC7Be,EAAQrjB,KAAKI,EAJf,CAWJ,OAAO+iB,EAASR,QAAO,SAASxI,EAAKkJ,GACnC,OAAOrZ,KAAKmQ,IAAIA,EAAKkJ,EAAQ1jB,OAC/B,GAAG,EACL,CAjDagjB,CAAOF,EAAYK,IAC5BP,EAAOpI,EAAKqI,EAAU,EAAGC,EAC3B,GACF,CAhBAF,CAAO,GAAI,EAAG,GA+DhB,oCCllFa,IAAIgB,EAAE,EAAQ,KAAS9gB,EAAE+gB,OAAOC,IAAI,iBAAiBC,EAAEF,OAAOC,IAAI,kBAAkBjhB,EAAE3E,OAAOuF,UAAUC,eAAe+K,EAAEmV,EAAEI,mDAAmDC,kBAAkBzgB,EAAE,CAAC8B,KAAI,EAAG4e,KAAI,EAAGC,QAAO,EAAGC,UAAS,GAChP,SAASC,EAAE5U,EAAEF,EAAEyJ,GAAG,IAAIxJ,EAAE9J,EAAE,CAAC,EAAErE,EAAE,KAAK8U,EAAE,KAAiF,IAAI3G,UAAhF,IAASwJ,IAAI3X,EAAE,GAAG2X,QAAG,IAASzJ,EAAEjK,MAAMjE,EAAE,GAAGkO,EAAEjK,UAAK,IAASiK,EAAE2U,MAAM/N,EAAE5G,EAAE2U,KAAc3U,EAAE1M,EAAEc,KAAK4L,EAAEC,KAAKhM,EAAEE,eAAe8L,KAAK9J,EAAE8J,GAAGD,EAAEC,IAAI,GAAGC,GAAGA,EAAE6U,aAAa,IAAI9U,KAAKD,EAAEE,EAAE6U,kBAAe,IAAS5e,EAAE8J,KAAK9J,EAAE8J,GAAGD,EAAEC,IAAI,MAAM,CAAC+U,SAASzhB,EAAE+c,KAAKpQ,EAAEnK,IAAIjE,EAAE6iB,IAAI/N,EAAEqO,MAAM9e,EAAE+e,OAAOhW,EAAEiW,QAAQ,CAAC5nB,EAAQ6nB,SAASZ,EAAEjnB,EAAQ8nB,IAAIP,EAAEvnB,EAAQ+nB,KAAKR,oCCPxWtnB,EAAOD,QAAU,EAAjB,mCCHFC,EAAOD,QAAUO,+DCAjBN,EAAOD,QAAUQ,+DCAjBP,EAAOD,QAAUS,+DCAjBR,EAAOD,QAAUU,+DCAjBT,EAAOD,QAAUW,8DCAjBV,EAAOD,QAAUY,8DCAjBX,EAAOD,QAAUa,+DCAjBZ,EAAOD,QAAUc,+DCAjBb,EAAOD,QAAUe,+DCAjBd,EAAOD,QAAUgB,+DCAjBf,EAAOD,QAAUiB,+DCAjBhB,EAAOD,QAAUkB,mCCCb8mB,yBAA2B,CAAC,EAGhC,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeH,yBAAyBE,GAC5C,QAAqBhiB,IAAjBiiB,EACH,OAAOA,EAAanoB,QAGrB,IAAIC,EAAS+nB,yBAAyBE,GAAY,CAGjDloB,QAAS,CAAC,GAOX,OAHAooB,oBAAoBF,GAAUrhB,KAAK5G,EAAOD,QAASC,EAAQA,EAAOD,QAASioB,qBAGpEhoB,EAAOD,OACf,CCrBAioB,oBAAoBtW,EAAI,SAAS1R,GAChC,IAAIooB,EAASpoB,GAAUA,EAAO4E,WAC7B,WAAa,OAAO5E,EAAgB,OAAG,EACvC,WAAa,OAAOA,CAAQ,EAE7B,OADAgoB,oBAAoBrf,EAAEyf,EAAQ,CAAE5V,EAAG4V,IAC5BA,CACR,ECNAJ,oBAAoBrf,EAAI,SAAS5I,EAASsoB,GACzC,IAAI,IAAI9f,KAAO8f,EACXL,oBAAoBniB,EAAEwiB,EAAY9f,KAASyf,oBAAoBniB,EAAE9F,EAASwI,IAC5EpH,OAAOC,eAAerB,EAASwI,EAAK,CAAEjC,YAAY,EAAMC,IAAK8hB,EAAW9f,IAG3E,ECPAyf,oBAAoB/L,EAAI,WACvB,GAA0B,iBAAfqM,WAAyB,OAAOA,WAC3C,IACC,OAAOjoB,MAAQ,IAAIkoB,SAAS,cAAb,EAChB,CAAE,MAAOjkB,GACR,GAAsB,iBAAXuW,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBmN,oBAAoBniB,EAAI,SAASoG,EAAKwW,GAAQ,OAAOthB,OAAOuF,UAAUC,eAAeC,KAAKqF,EAAKwW,EAAO,ECCtGuF,oBAAoBQ,EAAI,SAASzoB,GACX,oBAAX+mB,QAA0BA,OAAO2B,aAC1CtnB,OAAOC,eAAerB,EAAS+mB,OAAO2B,YAAa,CAAEpnB,MAAO,WAE7DF,OAAOC,eAAerB,EAAS,aAAc,CAAEsB,OAAO,GACvD,0gDCDA,MAAMqnB,GACJle,EAAAA,EAEIvK,oBAAAA,KAAAA,IAAmC0oB,QACnCvd,EAAAA,EAAAA,aAAY,YACb,CAAC,EAKN,GAAIZ,EAAAA,GAAsC,oBAAbpC,SAA0B,CACrD,MAAMwgB,EAAS3oB,oBAAQ,KACvByoB,EAAOG,KAAOD,EAAO9c,MAAM1D,SAASwgB,QAAQE,SAC9C,CAEA,iOCgFAC,EAAAA,EAAAA,QAAOC,IAAO,CACZ3hB,OAAM,SACNC,QAAO,UACPC,OAAM,SACNC,OAAM,SACNJ,QAAO,UACPmU,IAAK5N,KAAK4N,IACVrU,MAAK,QACL+hB,WAtEK,WAIC,IAJmB,YACzBC,GAAc,EAAK,gBACnBC,EAAkB,cAAa,UAC/BC,EAAY,EAAIJ,IAAAA,QACjBxf,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACH,MAAO+R,EAAK8N,IAAUC,EAAAA,EAAAA,gBAAeH,EAAiBxb,KAAK4N,KAe3D,OAdAgO,EAAAA,EAAAA,YAAU,KACR,IAAIC,EACJ,MAAMzgB,EAASA,KACbsgB,GAAQI,IACN,MAAMC,EAAM/b,KAAK4N,MACjB,OAAOjO,KAAK0W,IAAI0F,EAAMD,GAAOL,EAAYM,EAAMD,CAAG,IAEhDP,IAAaM,EAAUxhB,WAAWe,EAAQqgB,GAAU,EAG1D,OADArgB,IACO,KACDygB,GAASthB,aAAashB,EAAQ,CACnC,GACA,CAACN,EAAaE,EAAWC,IACrB9N,CACT,EAkDEoO,kBA7BK,WAGC,IAH0B,WAChCC,EAAa,iBAAgB,gBAC7BT,EAAkB,kBACnB3f,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACH,MAAMqgB,GAAaC,EAAAA,EAAAA,gBAAc,IAC1BvI,EAAQwI,IAAaT,EAAAA,EAAAA,gBAAeH,GAAiB,KAC1D,MAAM9nB,EAAQuoB,GAAcC,GAAYG,KAAKC,UAAUL,GACvD,OAAOvoB,EAAQ+e,SAAS/e,EAAO,IAAM,CAAC,IAUxC,OARAkoB,EAAAA,EAAAA,YAAU,KACR,MACMloB,GADO,IAAIsM,MACEuc,oBACnBH,EAAU1oB,GACNuoB,IACFxhB,SAASwgB,OAASuB,EAAAA,UAAiBP,EAAYvoB,EAAO,CAAEkK,KAAM,MAChE,GACC,CAACqe,EAAYG,IACTxI,CACT,IAcA,MAAeyH,ICtGR,SAASoB,EAAW5oB,GACzB,OAAO,IAAIuF,EAAAA,QAAQvF,EACrB,qFCSA,IAAI6oB,EACAC,ECAAC,EDOW,SAASC,EAAS5e,GAM9B,IAN+B,SAChC5B,EAAQ,UACRygB,EAAS,aACTC,EAAY,YACZC,KACGlD,GACJ7b,EACC,MAAQ+b,QAASiD,IAASC,EAAAA,EAAAA,QAAO,CAC/BC,SAAS,EACTC,cAAe,MAEX,WAAEC,IAAexiB,EAAAA,EAAAA,gBAMjByiB,GAAgBC,EAAAA,EAAAA,OAAKC,UACzB,MAAMroB,QAAY4nB,IAElB,OADIE,EAAKG,cAAc9nB,cAAc3B,QAAQ8pB,IAAIR,EAAKG,eAC/CjoB,EAAI2C,QAAU3C,EAAM,CAAE2C,QAAS3C,EAAK,IAG7C,GAAIgI,EAAAA,eAAgB,CAClB,MAAM,OAAEugB,IAAWC,EAAAA,EAAAA,kBAAiBzB,WACpC,GAAIwB,EAAOhoB,SAASonB,GAClB,MAAM3iB,MAAO,yBAAwB2iB,MAChCY,EAAO/nB,KAAKmnB,EACrB,MAAYG,EAAKE,UACfF,EAAKE,SAAU,EAEfT,EAAYI,GAAW9e,SAAS4f,IAC9B,IAAKA,EAAMC,SAAS,QAAS,OAC7B,MAAMjgB,EAAQ,GAAEyf,KAAcO,IAC9B,IAAIE,EAAOrjB,SAASC,cAAe,cAAakD,OAChD,IAAKkgB,EAAM,CACTA,EAAOrjB,SAASsT,cAAc,QAC9B+P,EAAK3P,aAAa,OAAQvQ,GAC1BkgB,EAAK3P,aAAa,MAAO,cAEzB,MAAMtW,EAAU4kB,IAChBqB,EAAKC,OAASlmB,EAAQ5D,QAItB6pB,EAAKE,QAAUnmB,EAAQ5D,QAEvBgpB,EAAKG,cAAcznB,KAAKkC,GAEX4C,SAASC,cAAc,QAC/BujB,YAAYH,EACnB,CAEA,MAAMlV,EAAQ+T,EAAwB/e,IAAS,EAC/C+e,EAAwB/e,GAAQgL,EAAQ,CAAC,KAkB7C,OAbAgT,EAAAA,EAAAA,YAAU,IAAM,KACdqB,EAAKE,SAAU,EACfT,EAAYI,GAAW9e,SAASkgB,IAC9B,IAAKA,EAAKL,SAAS,QAAS,OAC5B,MAAMjgB,EAAQ,GAAEyf,KAAca,IAC9B,KAAMvB,EAAwB/e,IAAS,EAAG,CACxC,MAAMkgB,EAAOrjB,SAASC,cAAe,cAAakD,OACrCnD,SAASC,cAAc,QAC/ByjB,YAAYL,EACnB,IACA,GACD,CAAChB,EAAWG,EAAMI,KAGnBphB,EAAAA,EAAAA,KAACmiB,EAAAA,SAAQ,CAACC,SAAUrB,EAAY3gB,UAC9BJ,EAAAA,EAAAA,KAACqhB,EAAa,IAAKxD,EAAKzd,SACrBA,KAIT,CE3Fe,SAASiiB,EAAcrgB,GAInC,IAJoC,UACrC6e,EAAS,aACTC,EAAY,YACZC,GACD/e,EAEC,OAAO,eAAC,SAAE5B,KAAayd,GAAOje,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,CAAC,EAAC,OAAKkS,EAAAA,EAAAA,eACtC8O,EACA,IACK/C,EACHgD,YACAC,eACAC,eAEF3gB,EACD,CACH,CFVIQ,EAAAA,iBAEF6f,EAAcpqB,oBAAAA,KAAAA,IAAmCisB,cAAgB,CAAC,EAClE5B,EAA0B,CAAC,GAoF7BE,EAAU2B,UAAY,CACpBniB,SAAUoiB,IAAAA,KACV3B,UAAW2B,IAAAA,OAAAA,WACX1B,aAAc0B,IAAAA,KAAAA,WACdzB,YAAayB,IAAAA,MAGf5B,EAAUjD,aAAe,CACvBvd,cAAU/D,EACV0kB,iBAAa1kB,GCvGfomB,IAAAA,QAAiBC,EAAAA,QACjBD,IAAAA,SAAkBE,EAAAA,SAMlB,IACEhC,EAAkB9f,QAAQ+hB,IAAIjC,eAChC,CAAE,MAAkB,CAEpB,MACMkC,EAAa,gBADPlC,GAAmB9f,eACIiiB,EAAQthB,YAAY,cAqChD+f,eAAewB,EAAYC,GAAyC,IAAjCC,EAAUrjB,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,EAAGsjB,EAAQtjB,UAAAvG,OAAA,QAAAgD,IAAAuD,UAAA,GAAAA,UAAA,GAAG,IAEnE,IAAK,IAAIkI,EAAI,KAAOA,EAClB,IACE,aAAakb,GACf,CAAE,MAAO3K,GACP,KAAIvQ,EAAImb,GACH,MAAM5K,QADe8K,EAAK7lB,MAAM4lB,EAEvC,CAGJ,sFE7Be,SAASE,EAAWphB,GAahC,IAbiC,SAClC5B,EAAQ,UACRijB,EAAS,SACTC,EAAQ,SACRC,EAAQ,mBACRC,EAAkB,QAClBC,EAAO,YACPC,EAAW,WACXC,EAAU,QACVhZ,EAAO,eACPiZ,EAAc,GACdC,KACGC,GACJ9hB,EAMC,OAAIshB,GAAYC,GAAYI,GAAcE,EAAGrZ,MAAM,0BAE/CxK,EAAAA,EAAAA,KAAA,KACEqjB,WAAWA,EAAAA,EAAS,iBACpBC,SAAUA,EACVS,KAAMF,EACNJ,QAASH,EAAY5oB,GAAMA,EAAEspB,iBAAmBP,EAChDC,YAAaJ,EAAY5oB,GAAMA,EAAEspB,iBAAmBN,EACpDO,IAAI,sBAEJC,OAAQP,EAAa,SAAW,GAAGvjB,SAElCA,KAMA0R,EAAAA,EAAAA,eAAc8R,EAAgB,CACnCP,YACAC,WACAI,cACA/Y,UACAkZ,KACAJ,QAAU/oB,IAEJ+oB,GAASA,EAAQ/oB,GAGhB8oB,GAAoBvS,OAAOkT,OAAO,EAAG,EAAE,KAE3CL,GACF1jB,EACL,CCvFe,SAASgkB,EAAKvG,GAE3B,OAAO7d,EAAAA,EAAAA,KAACojB,EAAW,IAAKvF,EAAO+F,eAAgBS,EAAAA,MAEjD,CCNA,SAASC,EAAUtiB,GAWhB,IAXiB,OAClBuiB,EAAM,SACNnkB,EAAQ,SACRkjB,EAAQ,SACRC,EAAQ,QACRE,EAAO,YACPC,EAAW,WACXC,EAAU,QACVhZ,EAAO,MACP6Z,EAAK,GACLX,GACD7hB,EACKqhB,EAAYmB,EAAMC,OAEtB,OADIF,GAAUC,EAAMD,SAAQlB,GAAc,IAAGmB,EAAMD,UAC/CjB,GACEkB,EAAMlB,WAAUD,GAAc,IAAGmB,EAAMlB,aAEzCtjB,EAAAA,EAAAA,KAAA,OAAKqjB,UAAWA,EAAUjjB,SACvBA,KAIHyjB,GAEA7jB,EAAAA,EAAAA,KAACokB,EAAI,CACHf,UAAWA,EACXE,SAAUA,EACVE,QAASA,EACTC,YAAaA,EACbC,WAAYA,EACZhZ,QAASA,EACTkZ,GAAIA,EAAGzjB,SAENA,KAKLJ,EAAAA,EAAAA,KAAA,OACEqjB,UAAWA,EACXI,QAASA,EACTiB,UAAWjB,EACXC,YAAaA,EACbiB,KAAK,SACLC,SAAU,EAAExkB,SAEXA,GAGP,CF0CAgjB,EAAYzF,aAAe,CACzBvd,SAAU,KACVijB,UAAW,KACXC,UAAU,EACVC,UAAU,EACVC,oBAAoB,EACpBC,QAAS,KACTC,YAAa,KACbC,YAAY,EACZhZ,SAAS,EACTkZ,GAAI,IAGNT,EAAYb,UAAY,CACtBniB,SAAUoiB,IAAAA,KACVa,UAAWb,IAAAA,OACXc,SAAUd,IAAAA,KACVe,SAAUf,IAAAA,KACVgB,mBAAoBhB,IAAAA,KACpBiB,QAASjB,IAAAA,KACTkB,YAAalB,IAAAA,KACbmB,WAAYnB,IAAAA,KACZ7X,QAAS6X,IAAAA,KACToB,eAAgBpB,IAAAA,YAAAA,WAChBqB,GAAIrB,IAAAA,UAAa,CAACA,IAAAA,OAAWA,IAAAA,UEzD/B,MAAMqC,EAAepC,IAAO,SAAU,CACpC,SACA,SACA,YCtEF,CAAgB,OAAS,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,UAAU,OAAS,SAAS,SAAW,UDmE5FA,CAIJ6B,GA4BjBA,EAAW3G,aAAe,CACxB4G,QAAQ,EACRnkB,cAAU/D,EACVinB,UAAU,EACVC,UAAU,EACVE,aAASpnB,EACTqnB,iBAAarnB,EACbsnB,YAAY,EACZhZ,SAAS,EACTkZ,QAAIxnB,GAGNioB,EAAW/B,UAAY,CACrBgC,OAAQ/B,IAAAA,KACRpiB,SAAUoiB,IAAAA,KACVc,SAAUd,IAAAA,KACVe,SAAUf,IAAAA,KACViB,QAASjB,IAAAA,KACTkB,YAAalB,IAAAA,KACbmB,WAAYnB,IAAAA,KACZ7X,QAAS6X,IAAAA,KACTgC,MAAOK,EAAaC,UAAUC,WAC9BlB,GAAIrB,IAAAA,UAAa,CAACA,IAAAA,OAAWA,IAAAA,UAG/B,QEvHA,SAASwC,EAAQhjB,GAKd,IALe,QAChBijB,EAAO,MACPC,EAAK,SACLC,EAAQ,MACRX,GACDxiB,EACC,OACEojB,EAAAA,EAAAA,MAAA,OAAK/B,UAAWmB,EAAM3kB,UAAUO,SAAA,MAClB/D,IAAV6oB,EAAsB,MAAOllB,EAAAA,EAAAA,KAAA,KAAGqjB,UAAWmB,EAAMU,MAAM9kB,SAAE8kB,KAC3DllB,EAAAA,EAAAA,KAAA,SACEilB,QAASA,EACT5B,UAAWmB,EAAMa,SACjBF,SAAUA,EACVjM,KAAK,eAIb,CASA,MAAMoM,EAAiB7C,IAAO,WAAY,CACxC,WACA,YACA,SClCF,CAAgB,SAAW,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,SAAS,MAAQ,WD+B1FA,CAINuC,GAYjBA,EAASzC,UAAY,CACnB0C,QAASzC,IAAAA,KACT0C,MAAO1C,IAAAA,OACP2C,SAAU3C,IAAAA,KACVgC,MAAOc,EAAeR,UAAUC,YAGlCC,EAASrH,aAAe,CACtBsH,aAAS5oB,EACT6oB,WAAO7oB,EACP8oB,cAAU9oB,GAGZ,QEnCA,SAASkpB,EAAQvjB,GAOd,IAPe,OAChB8Y,EAAM,MACNoK,EAAK,SACLC,EAAQ,QACRxlB,EAAO,MACP6kB,EAAK,MACL/sB,GACDuK,EACC,MAAMwjB,EAAc,EAClBxlB,EAAAA,EAAAA,KAAA,UACEqjB,UAAWmB,EAAMiB,aAAarlB,SAE/B,KADK,6BAKR,IAAK,IAAItG,EAAI,EAAGA,EAAI6F,EAAQtG,SAAUS,EAAG,CACvC,IAAI4rB,EAAK/lB,EAAQ7F,GACZghB,IAAUA,EAAO4K,MAChBC,EAAAA,EAAAA,UAASD,KAAKA,EAAK,CAAEjuB,MAAOiuB,IAChCF,EAAY9rB,MACVsG,EAAAA,EAAAA,KAAA,UAAQqjB,UAAWmB,EAAMoB,OAAuBnuB,MAAOiuB,EAAGjuB,MAAM2I,cACjD/D,IAAZqpB,EAAGziB,KAAqByiB,EAAGjuB,MAAQiuB,EAAGziB,MADHyiB,EAAGjuB,QAK/C,CACA,OACE2tB,EAAAA,EAAAA,MAAA,OAAK/B,UAAWmB,EAAM3kB,UAAUO,SAAA,MAClB/D,IAAV6oB,EAAsB,MAAOllB,EAAAA,EAAAA,KAAA,KAAGqjB,UAAWmB,EAAMU,MAAM9kB,SAAE8kB,KAC3DllB,EAAAA,EAAAA,KAAA,UACEqjB,UAAWmB,EAAMqB,OACjBV,SAAUA,EACV1tB,MAAOA,EAAM2I,SAEZolB,KAEHxlB,EAAAA,EAAAA,KAAA,OAAKqjB,UAAWmB,EAAMsB,MAAM1lB,SAAC,QAGnC,CAEA,MAAM2lB,EAAiBtD,IAAO,WAAY,CACxC,QACA,YACA,eACA,QACA,SACA,UCzEF,CAAgB,MAAQ,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,UAAU,MAAQ,SAAS,aAAe,SAAS,OAAS,UDmElIA,CAON8C,GAEjBA,EAAShD,UAAY,CACnBzH,OAAQ0H,IAAAA,KACR0C,MAAO1C,IAAAA,OACP2C,SAAU3C,IAAAA,KACV7iB,QAAS6iB,IAAAA,QACPA,IAAAA,UAAa,CACXA,IAAAA,MAAS,CACPvf,KAAMuf,IAAAA,KACN/qB,MAAO+qB,IAAAA,OAAAA,aAETA,IAAAA,SACCuC,YAELP,MAAOuB,EAAejB,UAAUC,WAChCttB,MAAO+qB,IAAAA,QAGT+C,EAAS5H,aAAe,CACtB7C,YAAQze,EACR6oB,WAAO7oB,EACP8oB,cAAU9oB,EACVsD,QAAS,GACTlI,WAAO4E,GAGT,QEtFA,MAAM2pB,GAAQC,EAAAA,EAAAA,aAAW,CAAAjkB,EAItBub,KAAG,IAJoB,MACxB2H,EAAK,MACLV,KACGV,GACJ9hB,EAAA,OACCojB,EAAAA,EAAAA,MAAA,QAAM/B,UAAWmB,EAAM3kB,UAAUO,SAAA,MACnB/D,IAAV6oB,EAAsB,MAAOllB,EAAAA,EAAAA,KAAA,KAAGqjB,UAAWmB,EAAMU,MAAM9kB,SAAE8kB,KAC3DllB,EAAAA,EAAAA,KAAA,SACEqjB,UAAWmB,EAAM9b,MACjB6U,IAAKA,KACDuG,MAED,IAGHoC,EAAczD,IAAO,QAAS,CAClC,YACA,QACA,SCjCF,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,SAAS,MAAQ,SAAS,MAAQ,UD8B3FA,CAIHuD,GAEjBA,EAAMzD,UAAY,CAChB2C,MAAO1C,IAAAA,OACPgC,MAAO0B,EAAYpB,UAAUC,YAG/BiB,EAAMrI,aAAe,CACnBuH,WAAO7oB,GAGT,QEzBA,SAAS8pB,EAAUnkB,GAKhB,IALiB,SAClB5B,EAAQ,qBACRgmB,EAAoB,sBACpBC,EAAqB,MACrB7B,GACDxiB,EACC,OACEojB,EAAAA,EAAAA,MAAA,OAAK/B,UAAWmB,EAAM3kB,UAAUO,SAAA,EAC9BJ,EAAAA,EAAAA,KAAA,OAAKqjB,UAAW,CAACmB,EAAM8B,UAAW9B,EAAM+B,eAAe9b,KAAK,KAAKrK,SAC9DgmB,KAEHpmB,EAAAA,EAAAA,KAAA,OAAKqjB,UAAWmB,EAAMgC,UAAUpmB,SAC7BA,KAEHJ,EAAAA,EAAAA,KAAA,OAAKqjB,UAAW,CAACmB,EAAM8B,UAAW9B,EAAMiC,gBAAgBhc,KAAK,KAAKrK,SAC/DimB,MAIT,CAEA,MAAMK,EAAmBjE,IAAO,aAAc,CAC5C,YACA,gBACA,YACA,iBACA,aC9CF,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,SAAS,UAAY,UDyC7FA,CAMX0D,GAEdA,EAAW5D,UAAY,CACrBniB,SAAUoiB,IAAAA,KACV4D,qBAAsB5D,IAAAA,KACtB6D,sBAAuB7D,IAAAA,KACvBgC,MAAOkC,EAAiB5B,UAAUC,YAGpCoB,EAAWxI,aAAe,CACxBvd,SAAU,KACVgmB,qBAAsB,KACtBC,sBAAuB,MAGzB,mCE3DA,MAAMM,GAAUC,EAAAA,EAAAA,iBAuDD,SAASC,EAAQ7kB,GAS7B,IAT8B,SAC/B5B,EAAQ,YACR0mB,EAAW,MACXC,EAAK,SACLC,EAAQ,kBACRC,EAAiB,YACjBC,EAAW,MACXC,EAAK,IACLC,GACDplB,EACC,MAAMqlB,EAAWH,GAAeC,EAC1BG,EAAUL,GAAqBH,EAE/BS,GAAUC,EAAAA,EAAAA,UAAQ,KAAM,CAC5BV,cACAC,QACAC,WACAC,oBACAC,cACAC,QACAC,SACE,CACFN,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,IAGF,OACEhC,EAAAA,EAAAA,MAAAqC,EAAAA,SAAA,CAAArnB,SAAA,EACEglB,EAAAA,EAAAA,MAACsC,EAAAA,OAAM,CAAAtnB,SAAA,EAELJ,EAAAA,EAAAA,KAAA,SAAAI,SACG+mB,KAEHnnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,cAAcnE,QAASgoB,KAGlC9mB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,eAAenE,QAAQ,yBAClCkB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,gBAAgBnE,QAASuoB,KACpCrnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,sBAAsBnE,QAASwoB,IACxCP,GAAQ/mB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,gBAAgBnE,QAASioB,IAAY,KAExDC,GACEhnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,eAAenE,QAAU,IAAGkoB,MACrC,MAINhnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,WAAWnE,QAASuoB,IAC7BN,GAAQ/mB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,WAAWnE,QAASioB,IAAY,KACnDA,GAAQ/mB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,eAAenE,QAASuoB,IAAe,MAC5DrnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,iBAAiBnE,QAASwoB,IAEnCN,GAAYhnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,cAAcnE,QAASkoB,IAAgB,KAE9DI,GAAOpnB,EAAAA,EAAAA,KAAA,QAAMiD,KAAK,SAASnE,QAASsoB,IAAW,QAGjDhnB,GACEJ,EAAAA,EAAAA,KAAC2mB,EAAQgB,SAAQ,CAAClwB,MAAO8vB,EAAQnnB,SAC9BA,IAED,OAIZ,CAEAymB,EAASF,QAAUA,EAEnBE,EAASlJ,aAAe,CACtBvd,SAAU,KACV2mB,MAAO,KACPC,SAAU,KACVC,kBAAmB,KACnBC,YAAa,KACbE,IAAK,MAGPP,EAAStE,UAAY,CACnBniB,SAAUoiB,IAAAA,KACVsE,YAAatE,IAAAA,OAAAA,WACbuE,MAAOvE,IAAAA,OACPwE,SAAUxE,IAAAA,OACVyE,kBAAmBzE,IAAAA,OACnB0E,YAAa1E,IAAAA,OACb2E,MAAO3E,IAAAA,OAAAA,WACP4E,IAAK5E,IAAAA,kECzHP,SAASoF,EAAS5lB,GAIf,IAJgB,SACjB5B,EAAQ,SACRynB,EAAQ,MACRrD,GACDxiB,EACC,MAAM8lB,GAAe7G,EAAAA,EAAAA,UACf8G,GAAa9G,EAAAA,EAAAA,WACZ+G,EAAQC,IAAaC,EAAAA,EAAAA,aAE5BvI,EAAAA,EAAAA,YAAU,KACR,MAAM9iB,EAAI2B,SAASsT,cAAc,OAIjC,OAHAtT,SAAS2pB,KAAKC,UAAUC,IAAI,+BAC5B7pB,SAAS2pB,KAAKnG,YAAYnlB,GAC1BorB,EAAUprB,GACH,KACL2B,SAAS2pB,KAAKC,UAAU1pB,OAAO,+BAC/BF,SAAS2pB,KAAKjG,YAAYrlB,EAAE,CAC7B,GACA,IAEH,MAAMyrB,GAAYd,EAAAA,EAAAA,UAAQ,KACxBxnB,EAAAA,EAAAA,KAAA,OACEuoB,QAASA,KACP,MAAMC,EAAQV,EAAa/J,QAAQ0K,iBAAiB,KACpD,IAAK,IAAI3uB,EAAI0uB,EAAMnvB,OAAS,EAAGS,GAAK,IAAKA,EAEvC,GADA0uB,EAAM1uB,GAAG4uB,QACLlqB,SAASmqB,gBAAkBH,EAAM1uB,GAAI,OAE3CiuB,EAAWhK,QAAQ2K,OAAO,EAG5B9D,SAAS,OAGV,IAEH,OAAOoD,EAASY,IAAAA,cAEZxD,EAAAA,EAAAA,MAAAqC,EAAAA,SAAA,CAAArnB,SAAA,CACGkoB,GACDtoB,EAAAA,EAAAA,KAAA,OACE,aAAW,SACXqjB,UAAWmB,EAAMqE,QACjBpF,QAASA,IAAMoE,IACfnD,UAAYhqB,IACI,WAAVA,EAAEiE,KAAkBkpB,GAAU,EAEpCtK,IAAMxc,IACAA,GAAQA,IAASgnB,EAAWhK,UAC9BgK,EAAWhK,QAAUhd,EACrBA,EAAK2nB,QACP,EAEF/D,KAAK,SACLC,SAAS,OAEX5kB,EAAAA,EAAAA,KAAA,OACE,aAAW,OACXqjB,UAAWmB,EAAM3kB,UACjBipB,QAAUxX,GAAUA,EAAME,kBAC1B+L,IAAKuK,EACLnD,KAAK,SAAQvkB,SAEZA,KAEHJ,EAAAA,EAAAA,KAAA,OACEuoB,QAASA,KACPR,EAAWhK,QAAQ2K,OAAO,EAG5B9D,SAAS,MAGV0D,KAGLN,GACE,IACN,CAEA,MAAMe,EAActG,IAClB,QACA,CACE,YACA,WChHJ,CAAgB,QAAU,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,UD4G3EA,CAOlBmF,GAEFA,EAAUrF,UAAY,CACpBsF,SAAUrF,IAAAA,KACVpiB,SAAUoiB,IAAAA,KACVgC,MAAOuE,EAAYjE,UAAUC,YAG/B6C,EAAUjK,aAAe,CACvBkK,SAAUmB,EAAAA,KACV5oB,SAAU,MAGZ,QE7He,SAAS6oB,GAAQpL,GAE9B,OAAO7d,EAAAA,EAAAA,KAACojB,EAAW,IAAKvF,EAAO+F,eAAgBsF,EAAAA,SAEjD,CCMe,SAASC,GAAYnnB,GAAiC,IAAhC,SAAE5B,EAAQ,UAAEijB,EAAS,MAAE+F,GAAOpnB,EACjE,MAAMqnB,EAAMD,EAAMzO,MAAM,KAClB2O,EAAoB,IAAMD,EAAI,GAAMA,EAAI,GAAvB,IASjBE,GACJvpB,EAAAA,EAAAA,KAAA,OACEwpB,MAAO,CAAEF,iBACTjG,UAAU,SAAWjjB,UAErBJ,EAAAA,EAAAA,KAAA,OAAKqjB,UAAU,UAASjjB,SACrBA,MAIP,OAAOijB,GACLrjB,EAAAA,EAAAA,KAAA,OAAKqjB,UAAWA,EAAUjjB,SACvBmpB,IAEDA,CACN,CC1BA,SAASE,GAAQznB,GAEd,IAFe,MAChBwiB,GACDxiB,EACC,OACEojB,EAAAA,EAAAA,MAAA,QAAM/B,WAAWmB,EAAM3kB,UAAN2kB,EAAM3kB,UAAS,kBAACO,SAAA,EAC/BJ,EAAAA,EAAAA,KAAA,QAAMqjB,WAAWmB,EAAMkF,OAANlF,EAAMkF,OAAM,oBAC7B1pB,EAAAA,EAAAA,KAAA,QAAMqjB,WAAWmB,EAAMkF,OAANlF,EAAMkF,OAAM,oBAC7B1pB,EAAAA,EAAAA,KAAA,QAAMqjB,WAAWmB,EAAMkF,OAANlF,EAAMkF,OAAM,qBAGnC,CDkBAP,GAAaxL,aAAe,CAC1Bvd,SAAU,KACVijB,UAAW,KACX+F,MAAO,OAGTD,GAAa5G,UAAY,CACvBniB,SAAUoiB,IAAAA,KACVa,UAAWb,IAAAA,OACX4G,MAAO5G,IAAAA,QCzBTiH,GAAS9L,aAAe,CACtB6G,MAAO,CAAC,GAGViF,GAASlH,UAAY,CACnBiC,MAAOhC,IAAAA,MAAS,CACd3iB,UAAW2iB,IAAAA,OACXkH,OAAQlH,IAAAA,UAIZ,OAAeC,IAAO,WAAY,CAChC,SACA,aCtCF,CAAgB,UAAY,UAAU,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,OAAS,SAAS,SAAW,UDoCnH,CAGiBgH,IErBV,MAAME,GAAa,CACxBC,aAAc,eACdC,cAAe,gBACfC,aAAc,eACdC,cAAe,iBAGXC,GAAmB,CACvB,kCACA,gCACA,kCACAvf,KAAK,KAEDwf,GAAiB,CACrB,+BACA,gCACA,kCACAxf,KAAK,KA0MP,MAAMyf,IAAUjE,EAAAA,EAAAA,aAAW,CAAAjkB,EAAsBub,KAAQ,IAA7B,SAAEnd,EAAQ,MAAEokB,GAAOxiB,EAC7C,MAAOmoB,EAAYC,IAAiBlC,EAAAA,EAAAA,UAAS,MAEvCmC,EAAUA,CAACC,EAAOC,EAAOC,EAAWC,IAAYN,GAlDxD,SACEG,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EA9HR,SAA0BD,GACxB,MAAO,CACL5E,MAAO4E,EAAQ5E,MAAM8E,wBACrB/qB,UAAW6qB,EAAQ7qB,UAAU+qB,wBAEjC,CAyHuBC,CAAiBH,GAChCI,EAnHR,WACE,MAAM,YAAEC,EAAW,YAAEC,GAAgB/Z,QAC7Bga,iBAAiB,aAAEC,EAAY,YAAEC,IAAkB3sB,SAC3D,MAAO,CACL4sB,KAAML,EACNM,MAAON,EAAcI,EACrBG,IAAKN,EACLO,OAAQP,EAAcE,EAE1B,CA0GuBM,GAGfC,EA3FR,SAA6B5c,EAAGC,EAAG6b,GACjC,MAAM,MAAE7E,EAAK,UAAEjmB,GAAc8qB,EAC7B,MAAO,CACLe,OAAQ,IAAO7rB,EAAU8rB,MAAQ7F,EAAM6F,OACvCC,OAAQ/rB,EAAUgsB,OAClBC,WAAYjd,EAAIhP,EAAU8rB,MAAQ,EAClCI,WAAYjd,EAAIjP,EAAUgsB,OAAS/F,EAAM+F,OAAS,IAKlDG,eAAgBhC,GAEpB,CA8EciC,CAAoB3B,EAAOC,EAAOI,GAE9C,GAAIc,EAAIK,WAAahB,EAAaM,KAAO,EACvCK,EAAIK,WAAahB,EAAaM,KAAO,EACrCK,EAAIC,OAAShoB,KAAKmQ,IAChB,EACAyW,EAAQmB,EAAIK,WAAanB,EAAa7E,MAAM6F,MAAQ,OAEjD,CACL,MAAMO,EAAOpB,EAAaO,MAAQ,EAAIV,EAAa9qB,UAAU8rB,MACzDF,EAAIK,WAAaI,IACnBT,EAAIK,WAAaI,EACjBT,EAAIC,OAAShoB,KAAKoQ,IAChB6W,EAAa9qB,UAAU8rB,MAAQ,EAC/BrB,EAAQmB,EAAIK,WAAanB,EAAa7E,MAAM6F,MAAQ,GAG1D,CAGIF,EAAIM,WAAajB,EAAaQ,IAAM,IACtCG,EAAIM,YAAcpB,EAAa9qB,UAAUgsB,OACrC,EAAIlB,EAAa7E,MAAM+F,OAC3BJ,EAAIG,QAAUjB,EAAa9qB,UAAUgsB,OACjClB,EAAa7E,MAAM+F,OACvBJ,EAAIO,eAAiB/B,IAGvB,MAAMkC,EAAkB,QAAOV,EAAIK,oBAAoBL,EAAIM,eAC3DrB,EAAQ7qB,UAAUqS,aAAa,QAASia,GAExC,MAAMC,EAAc,GAAEX,EAAIO,uBAAuBP,EAAIC,gBAAgBD,EAAIG,WACzElB,EAAQ5E,MAAM5T,aAAa,QAASka,EACtC,CAOOC,CAAsB/B,EAAOC,EAAOC,EAAWC,EAASN,GAa7D,OAZAmC,EAAAA,EAAAA,qBAAoB/O,GAAK,KAAM,CAAG8M,eAGlC1K,EAAAA,EAAAA,YAAU,KACR,MAAM9Q,EAzMV,SAAiC2V,GAC/B,MAAMsB,EAAQtnB,SAASsT,cAAc,OACjC0S,EAAMsB,OAAOA,EAAM5T,aAAa,QAASsS,EAAMsB,OAEnD,MAAMhnB,EAAUN,SAASsT,cAAc,OACnC0S,EAAM1lB,SAASA,EAAQoT,aAAa,QAASsS,EAAM1lB,SAEvD,MAAMe,EAAYrB,SAASsT,cAAc,OAOzC,OANI0S,EAAM3kB,WAAWA,EAAUqS,aAAa,QAASsS,EAAM3kB,WAE3DA,EAAUmiB,YAAY8D,GACtBjmB,EAAUmiB,YAAYljB,GACtBN,SAAS2pB,KAAKnG,YAAYniB,GAEnB,CAAEA,YAAWimB,QAAOhnB,UAC7B,CA0LcytB,CAAwB/H,GAElC,OADA4F,EAAcvb,GACP,KACLrQ,SAAS2pB,KAAKjG,YAAYrT,EAAEhP,WAC5BuqB,EAAc,KAAK,CACpB,GACA,CAAC5F,IAEG2F,GAAaqC,EAAAA,EAAAA,cAAapsB,EAAU+pB,EAAWrrB,SAAW,IAAI,IAGvEorB,GAAQ3H,UAAY,CAClBniB,SAAUoiB,IAAAA,KACVgC,MAAOhC,IAAAA,QAAWuC,YAGpBmF,GAAQvM,aAAe,CACrBvd,SAAU,MAGZ,UCjPA,SAASqsB,GAAOzqB,GAKb,IALc,SACf5B,EAAQ,UACRoqB,EAAS,IACTkC,EAAG,MACHlI,GACDxiB,EACC,MAAM2qB,GAAa1L,EAAAA,EAAAA,UACb2L,GAAa3L,EAAAA,EAAAA,WACZ4L,EAAaC,IAAkB5E,EAAAA,EAAAA,WAAS,GAiC/C,OATAvI,EAAAA,EAAAA,YAAU,KACR,GAAIkN,GAAuB,OAARH,EAAc,CAC/B,MAAMlzB,EAAWA,IAAMszB,GAAe,GAEtC,OADA7b,OAAOI,iBAAiB,SAAU7X,GAC3B,IAAMyX,OAAO8b,oBAAoB,SAAUvzB,EACpD,CACgB,GACf,CAACqzB,EAAaH,KAGftH,EAAAA,EAAAA,MAAA,OACE/B,UAAWmB,EAAMwI,QACjBC,aAAcA,IAAMH,GAAe,GACnCI,YAAcxyB,GAnCWyyB,EAACC,EAASC,KACrC,GAAKR,EACA,CACH,MAAMS,EAAcV,EAAW7O,QAAQ6M,wBAErCwC,EAAUE,EAAYlC,MACnBgC,EAAUE,EAAYjC,OACtBgC,EAAUC,EAAYhC,KACtB+B,EAAUC,EAAY/B,OAEzBuB,GAAe,GACNH,EAAW5O,SACpB4O,EAAW5O,QAAQsM,QACjB+C,EAAUnc,OAAO8Z,YACjBsC,EAAUpc,OAAO+Z,YACjBR,EACAoC,EAAW7O,QAGjB,MAlBkB+O,GAAe,EAkBjC,EAgBsBK,CAAqBzyB,EAAE6yB,QAAS7yB,EAAE8yB,SACtDjQ,IAAKqP,EAAWxsB,SAAA,CAGdysB,GAAuB,OAARH,GACb1sB,EAAAA,EAAAA,KAACkqB,GAAO,CAAC3M,IAAKoP,EAAYnI,MAAOA,EAAMpkB,SAAEssB,IACvC,KAELtsB,IAGP,CAEA,MAAMqtB,GAAgBhL,IACpB,cACA,CACE,aACA,QACA,YACA,UACA,WC1FJ,CAAgB,MAAQ,SAAS,GAAK,UAAU,IAAM,SAAS,QAAU,SAAS,UAAY,SAAS,WAAa,SAAS,QAAU,WDmFjHA,CAUpBgK,IAEFgB,GAAc9D,WAAaA,GAE3B8C,GAAQlK,UAAY,CAClBniB,SAAUoiB,IAAAA,KACVgI,UAAWhI,IAAAA,MAASjrB,OAAOm2B,OAAO/D,KAClCnF,MAAOiJ,GAAc3I,UAAUC,WAC/B2H,IAAKlK,IAAAA,MAGPiK,GAAQ9O,aAAe,CACrBvd,SAAU,KACVoqB,UAAWb,GAAWC,aACtB8C,IAAK,MAGP,mEE9GA,IAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,WCuB7E,SAASiB,GAAY3rB,GAKlB,IALmB,SACpB4rB,EAAQ,IACRhZ,EAAG,MACH4P,EAAK,MACL2C,GACDnlB,GACMolB,EAAKyG,GAASjZ,EAAI+F,MAAM,KAC7BkT,EAAQA,EAAQC,KAAAA,MAASD,GAAS,CAAC,EAEnC,MAAME,EAAUF,EAAMG,GAAK5G,EAAI5c,MAAM,uBAAuB,GAU5D,OATA4c,EAAO,iCAAgC2G,WAEhCF,EAAMG,EACbH,EAAMD,SAAWA,EAAW,EAAI,EAChCxG,GAAQ,IAAG0G,KAAAA,UAAaD,MAMtBzI,EAAAA,EAAAA,MAAC+D,GAAY,CAAC9F,UAAWmB,EAAM3kB,UAAWupB,MAAM,OAAMhpB,SAAA,EACpDJ,EAAAA,EAAAA,KAACypB,GAAQ,CAACjF,MAAOyJ,MACjBjuB,EAAAA,EAAAA,KAAA,UACEkuB,MAAM,WACNC,iBAAe,EACf9K,UAAWmB,EAAM4J,MACjBxZ,IAAKwS,EACLD,MAAOA,MAIf,CAEA,MAAMkH,GAAqB5L,IACzB,eACA,CACE,YACA,SC5DJ,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,MAAQ,UDwDlEA,CAOzBkL,IAEFA,GAAapL,UAAY,CACvBqL,SAAUpL,IAAAA,KACV5N,IAAK4N,IAAAA,OAAAA,WACLgC,MAAO6J,GAAmBvJ,UAAUC,WACpCoC,MAAO3E,IAAAA,QAGTmL,GAAahQ,aAAe,CAC1BiQ,UAAU,EACVzG,MAAO,IAGT,UE1EA,MAAMmH,GAASxL,EAAQthB,YAAY,gBAE7B+sB,GAASD,QAASjyB,EAAYhG,oBAAAA,KAAAA","sources":["webpack://@dr.pogodin/react-utils/webpack/universalModuleDefinition","webpack://@dr.pogodin/react-utils/./node_modules/@dr.pogodin/js-utils/js/Barrier.js","webpack://@dr.pogodin/react-utils/./node_modules/@dr.pogodin/js-utils/js/Emitter.js","webpack://@dr.pogodin/react-utils/./node_modules/@dr.pogodin/js-utils/js/Semaphore.js","webpack://@dr.pogodin/react-utils/./node_modules/@dr.pogodin/js-utils/js/index.js","webpack://@dr.pogodin/react-utils/./node_modules/@dr.pogodin/js-utils/js/time.js","webpack://@dr.pogodin/react-utils/./src/client/getInj.js","webpack://@dr.pogodin/react-utils/./src/client/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/buildInfo.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/environment-check.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/index.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/webpack.js","webpack://@dr.pogodin/react-utils/./node_modules/cookie/index.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/aes.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/baseN.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/cipher.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/cipherModes.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/forge.js","webpack://@dr.pogodin/react-utils/./node_modules/node-forge/lib/util.js","webpack://@dr.pogodin/react-utils/./node_modules/react/cjs/react-jsx-runtime.production.min.js","webpack://@dr.pogodin/react-utils/./node_modules/react/jsx-runtime.js","webpack://@dr.pogodin/react-utils/external umd \"@dr.pogodin/react-global-state\"","webpack://@dr.pogodin/react-utils/external umd \"@dr.pogodin/react-themes\"","webpack://@dr.pogodin/react-utils/external umd \"axios\"","webpack://@dr.pogodin/react-utils/external umd \"dayjs\"","webpack://@dr.pogodin/react-utils/external umd \"lodash\"","webpack://@dr.pogodin/react-utils/external umd \"prop-types\"","webpack://@dr.pogodin/react-utils/external umd \"qs\"","webpack://@dr.pogodin/react-utils/external umd \"react\"","webpack://@dr.pogodin/react-utils/external umd \"react-dom\"","webpack://@dr.pogodin/react-utils/external umd \"react-dom/client\"","webpack://@dr.pogodin/react-utils/external umd \"react-helmet\"","webpack://@dr.pogodin/react-utils/external umd \"react-router-dom\"","webpack://@dr.pogodin/react-utils/webpack/bootstrap","webpack://@dr.pogodin/react-utils/webpack/runtime/compat get default export","webpack://@dr.pogodin/react-utils/webpack/runtime/define property getters","webpack://@dr.pogodin/react-utils/webpack/runtime/global","webpack://@dr.pogodin/react-utils/webpack/runtime/hasOwnProperty shorthand","webpack://@dr.pogodin/react-utils/webpack/runtime/make namespace object","webpack://@dr.pogodin/react-utils/./src/shared/utils/config.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/time.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/Barrier.js","webpack://@dr.pogodin/react-utils/./src/shared/components/CodeSplit/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/utils/index.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/splitComponent.js","webpack://@dr.pogodin/react-utils/./src/shared/components/GenericLink/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Link.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Button/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Button/style.scss?4fed","webpack://@dr.pogodin/react-utils/./src/shared/components/Checkbox/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Checkbox/theme.scss?e808","webpack://@dr.pogodin/react-utils/./src/shared/components/Dropdown/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Dropdown/theme.scss?9ee7","webpack://@dr.pogodin/react-utils/./src/shared/components/Input/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Input/theme.scss?43a4","webpack://@dr.pogodin/react-utils/./src/shared/components/PageLayout/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/PageLayout/base-theme.scss?229d","webpack://@dr.pogodin/react-utils/./src/shared/components/MetaTags.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Modal/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Modal/base-theme.scss?9858","webpack://@dr.pogodin/react-utils/./src/shared/components/NavLink.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/ScalableRect/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Throbber/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Throbber/theme.scss?1805","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/Tooltip.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/default-theme.scss?195d","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/throbber.scss?c5e3","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/base.scss?267e","webpack://@dr.pogodin/react-utils/./src/index.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"@dr.pogodin/react-global-state\"), require(\"@dr.pogodin/react-themes\"), require(\"axios\"), require(\"dayjs\"), require(\"lodash\"), require(\"prop-types\"), require(\"qs\"), require(\"react\"), require(\"react-dom\"), require(\"react-dom/client\"), require(\"react-helmet\"), require(\"react-router-dom\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"@dr.pogodin/react-global-state\", \"@dr.pogodin/react-themes\", \"axios\", \"dayjs\", \"lodash\", \"prop-types\", \"qs\", \"react\", \"react-dom\", \"react-dom/client\", \"react-helmet\", \"react-router-dom\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"@dr.pogodin/react-utils\"] = factory(require(\"@dr.pogodin/react-global-state\"), require(\"@dr.pogodin/react-themes\"), require(\"axios\"), require(\"dayjs\"), require(\"lodash\"), require(\"prop-types\"), require(\"qs\"), require(\"react\"), require(\"react-dom\"), require(\"react-dom/client\"), require(\"react-helmet\"), require(\"react-router-dom\"));\n\telse\n\t\troot[\"@dr.pogodin/react-utils\"] = factory(root[\"@dr.pogodin/react-global-state\"], root[\"@dr.pogodin/react-themes\"], root[\"axios\"], root[\"dayjs\"], root[\"lodash\"], root[\"prop-types\"], root[\"qs\"], root[\"react\"], root[\"react-dom\"], root[\"react-dom/client\"], root[\"react-helmet\"], root[\"react-router-dom\"]);\n})(typeof self !== 'undefined' ? self : this, function(__WEBPACK_EXTERNAL_MODULE__899__, __WEBPACK_EXTERNAL_MODULE__198__, __WEBPACK_EXTERNAL_MODULE__300__, __WEBPACK_EXTERNAL_MODULE__760__, __WEBPACK_EXTERNAL_MODULE__467__, __WEBPACK_EXTERNAL_MODULE__99__, __WEBPACK_EXTERNAL_MODULE__656__, __WEBPACK_EXTERNAL_MODULE__156__, __WEBPACK_EXTERNAL_MODULE__111__, __WEBPACK_EXTERNAL_MODULE__715__, __WEBPACK_EXTERNAL_MODULE__383__, __WEBPACK_EXTERNAL_MODULE__128__) {\nreturn ","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar STATE;\n(function (STATE) {\n STATE[\"PENDING\"] = \"PENDING\";\n STATE[\"REJECTED\"] = \"REJECTED\";\n STATE[\"RESOLVED\"] = \"RESOLVED\";\n})(STATE \|\| (STATE = {}));\n/*\n Barrier is just a Promise which has resolve and reject exposed as instance\n * methods.\n \n Docs: https://dr.pogodin.studio/docs/react-utils/docs/api/classes/Barrier\n /\nclass Barrier extends Promise {\n constructor(executor) {\n let resolveRef;\n let rejectRef;\n super((resolve, reject) => {\n resolveRef = (value) => {\n resolve(value);\n this.p_state = STATE.RESOLVED;\n };\n rejectRef = (reason) => {\n reject(reason);\n this.p_state = STATE.REJECTED;\n };\n if (executor)\n executor(resolveRef, rejectRef);\n });\n this.p_state = STATE.PENDING;\n this.p_resolve = resolveRef;\n this.p_reject = rejectRef;\n }\n get resolve() { return this.p_resolve; }\n get reject() { return this.p_reject; }\n get resolved() { return this.p_state === STATE.RESOLVED; }\n get rejected() { return this.p_state === STATE.REJECTED; }\n get settled() { return this.p_state !== STATE.PENDING; }\n catch(onRejected) {\n return super.catch(onRejected);\n }\n finally(onFinally) {\n return super.finally(onFinally);\n }\n then(onFulfilled, onRejected) {\n const res = super.then(onFulfilled, onRejected);\n res.p_resolve = this.resolve;\n res.p_reject = this.reject;\n return res;\n }\n}\nexports.default = Barrier;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/\n Simple listeneable data Emitter.\n /\nclass Emitter {\n constructor() {\n this.p_listeners = [];\n }\n /\n Returns \"true\" if any listener is connected; \"false\" otherwise.\n * @return {boolean}\n /\n get hasListeners() {\n return !!this.p_listeners.length;\n }\n get listeners() { return this.p_listeners; }\n /\n Adds `listener` if it is not already connected.\n * @param {function} listener\n * @return {function} Unsubscribe function.\n /\n addListener(listener) {\n if (!this.p_listeners.includes(listener)) {\n this.p_listeners.push(listener);\n }\n return () => this.removeListener(listener);\n }\n /\n Calls every connected listener with the given arguments.\n * @param {...any} args\n /\n emit(...args) {\n const { p_listeners: listeners } = this;\n for (let i = 0; i < listeners.length; ++i) {\n listeners[i](...args);\n }\n }\n /\n Removes specified `listener`, if connected.\n * @param {function} listener\n /\n removeListener(listener) {\n const idx = this.p_listeners.indexOf(listener);\n if (idx >= 0)\n this.p_listeners.splice(idx, 1);\n }\n}\nexports.default = Emitter;\n","\"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};\nvar __importDefault = (this && this.__importDefault) \|\| function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst Barrier_1 = __importDefault(require(\"./Barrier\"));\n/\n Implements a simple semaphore for async code logic.\n /\nclass Semaphore {\n constructor(ready = false) {\n // \"true\" when the drain queue process is running (and thus no need to start\n // a new one).\n this.p_draining = false;\n // Each time a Promise from drain queue is resolved this drainLock is set\n // to block further queue draining until the promise resolution handler\n // (.seize() or .waitReady()) unlocks it, thus confirming it is fine\n // to continue the draining. This is specifically important for .seize(),\n // which should have a chance to switch semaphore state to non-ready prior\n // to next Promise in the queue being unlocked.\n this.p_drainLock = null;\n // The array of barriers set for each async code flow awaiting for\n // the Semaphore to become ready.\n this.p_queue = [];\n this.p_ready = !!ready;\n }\n get ready() { return this.p_ready; }\n setReady(ready) {\n const bool = !!ready;\n if (this.p_ready !== bool) {\n this.p_ready = bool;\n if (bool && !this.p_draining && this.p_queue.length) {\n this.p_drainQueue();\n }\n }\n }\n /\n Waits until the semaphore is ready, and marks it as non-ready (seizes it).\n * @return {Promise}\n /\n seize() {\n return __awaiter(this, void 0, void 0, function () {\n return this.waitReady(true);\n });\n }\n waitReady(seize = false) {\n return __awaiter(this, void 0, void 0, function* () {\n if (!this.p_ready \|\| this.p_queue.length) {\n const barrier = new Barrier_1.default();\n this.p_queue.push(barrier);\n yield barrier;\n if (seize)\n this.p_ready = false;\n this.p_drainLock.resolve();\n }\n else if (seize)\n this.p_ready = false;\n });\n }\n // Private members below this point.\n /*\n If semaphore is ready, it releases the next barrier in the queue, if any,\n * and reschedules itself for a call in the next event loop iteration.\n * Otherwise, it breaks the queue draining loop, which will be restarted\n * the next time the semaphore is set ready.\n /\n p_drainQueue() {\n return __awaiter(this, void 0, void 0, function () {\n this.p_draining = true;\n while (this.p_ready && this.p_queue.length) {\n this.p_drainLock = new Barrier_1.default();\n this.p_queue[0].resolve();\n yield this.p_drainLock; // eslint-disable-line no-await-in-loop\n this.p_queue.shift();\n }\n this.p_draining = false;\n this.p_drainLock = null;\n });\n }\n}\nexports.default = Semaphore;\n","\"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};\nvar __importDefault = (this && this.__importDefault) \|\| function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Semaphore = exports.Emitter = exports.Barrier = void 0;\nvar Barrier_1 = require(\"./Barrier\");\nObject.defineProperty(exports, \"Barrier\", { enumerable: true, get: function () { return __importDefault(Barrier_1).default; } });\nvar Emitter_1 = require(\"./Emitter\");\nObject.defineProperty(exports, \"Emitter\", { enumerable: true, get: function () { return __importDefault(Emitter_1).default; } });\nvar Semaphore_1 = require(\"./Semaphore\");\nObject.defineProperty(exports, \"Semaphore\", { enumerable: true, get: function () { return __importDefault(Semaphore_1).default; } });\n__exportStar(require(\"./time\"), exports);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) \|\| function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.timer = exports.Timer = exports.YEAR_MS = exports.DAY_MS = exports.HOUR_MS = exports.MIN_MS = exports.SEC_MS = void 0;\nconst Barrier_1 = __importDefault(require(\"./Barrier\"));\nexports.SEC_MS = 1000;\nexports.MIN_MS = 60 * exports.SEC_MS;\nexports.HOUR_MS = 60 * exports.MIN_MS;\nexports.DAY_MS = 24 * exports.HOUR_MS;\nexports.YEAR_MS = 365 * exports.DAY_MS;\n// TODO: Ok, as we have ended up with a Timer class, mostly to achieve a good\n// TypeScript typing for timer() function, it makes sense to expose the class\n// from the library as well, and it should be documented later.\nclass Timer extends Barrier_1.default {\n get abort() { return this.p_abort; }\n get timeout() { return this.p_timeout; }\n /*\n Creates a new, non-initialized instance of Timer. Call .init() method\n * to actually initialize and launch the timer.\n \n NOTE: Although it might be tempting to accept `timeout` value as\n * a constructor's argument, it won't work well, because Timer is an\n * extension of Promise (via Barrier), and the way Promises works (in\n * particular their .then() method, which internally calls constructor()\n * with special executor) does not play along with initalization depending\n * on custom parameters done in constructor().\n \n @param executor\n /\n constructor(executor) {\n super(executor);\n this.p_abort = () => { };\n }\n init(timeout) {\n if (this.p_timeout !== undefined) {\n throw Error('This Timer is initialized already');\n }\n this.p_timeout = timeout;\n if (timeout > 0) {\n const id = setTimeout(super.resolve.bind(this), timeout);\n this.p_abort = () => clearTimeout(id);\n }\n else {\n super.resolve();\n }\n return this;\n }\n then(onFulfilled, onRejected) {\n const res = super.then(onFulfilled, onRejected);\n if (this.timeout !== undefined)\n res.init(this.timeout);\n return res;\n }\n}\nexports.Timer = Timer;\n/\n Creates a Promise, which resolves after the given timeout.\n * @param {number} timeout Timeout [ms].\n * @return {Barrier} Resolves after the timeout. It has additional\n * .abort() method attached, which cancels the pending timer resolution\n * (without resolving or rejecting the barrier).\n /\nfunction timer(timeout) {\n const t = new Timer();\n return t.init(timeout);\n}\nexports.timer = timer;\n","// Encapsulates retrieval of server-side data injection into HTML template.\n\n/ global document /\n\n// Note: this way, only required part of \"node-forge\": AES, and some utils,\n// is bundled into client-side code.\nimport forge from 'node-forge/lib/forge';\nimport 'node-forge/lib/aes';\n\nimport { getBuildInfo } from 'utils/isomorphy/buildInfo';\n\n// Safeguard is needed here, because the server-side version of Docusaurus docs\n// is compiled (at least now) with settings suggesting it is a client-side\n// environment, but there is no document.\nlet inj = typeof document !== 'undefined'\n && document.querySelector('meta[itemprop=\"drpruinj\"]');\n\nif (inj) {\n inj.remove();\n const { key } = getBuildInfo();\n inj = forge.util.decode64(inj.content);\n const d = forge.cipher.createDecipher('AES-CBC', key);\n d.start({ iv: inj.slice(0, key.length) });\n d.update(forge.util.createBuffer(inj.slice(key.length)));\n d.finish();\n inj = forge.util.decodeUtf8(d.output.data);\n inj = eval(`(${inj})`); // eslint-disable-line no-eval\n} else {\n // Otherwise, a bunch of dependent stuff will easily fail in non-standard\n // environments, where no client-side initialization is performed. Like tests,\n // Docusaurus examples, etc.\n inj = {};\n}\n\nexport default function getInj() {\n return inj;\n}\n","// Initialization of client-side code.\n/ global document /\n\nimport { GlobalStateProvider } from '@dr.pogodin/react-global-state';\n\nimport { createRoot, hydrateRoot } from 'react-dom/client';\nimport { BrowserRouter } from 'react-router-dom';\n\nimport getInj from './getInj';\n\n/\n Prepares and launches the app at client side.\n * @param {object} Application Root application component\n * @param {object} [options={}] Optional. Additional settings.\n /\nexport default function Launch(Application, options = {}) {\n const container = document.getElementById('react-view');\n const scene = (\n <GlobalStateProvider initialState={getInj().ISTATE}>\n <BrowserRouter>\n <Application />\n </BrowserRouter>\n </GlobalStateProvider>\n );\n\n if (options.dontHydrate) {\n const root = createRoot(container);\n root.render(scene);\n } else hydrateRoot(container, scene);\n}\n","// Encapsulates access to \"Build Info\" data.\n\n/ global BUILD_INFO /\n\nlet buildInfo;\n\n// On the client side \"BUILD_INFO\" should be injected by Webpack. Note, however,\n// that in test environment we may need situations were environment is mocked as\n// client-side, although no proper Webpack compilation is executed, thus no info\n// injected; because of this we don't do a hard environment check here.\nif (typeof BUILD_INFO !== 'undefined') buildInfo = BUILD_INFO;\n\n/\n In scenarious where \"BUILD_INFO\" is not injected by Webpack (server-side,\n * tests, etc.) we expect the host codebase to explicitly set it before it is\n * ever requested. As a precaution, this function throws if build info has been\n * set already, unless `force` flag is explicitly set.\n * @param {object} info\n * @param {boolean} [force=false]\n /\nexport function setBuildInfo(info, force = false) {\n if (buildInfo !== undefined && !force) {\n throw Error('\"Build Info\" is already initialized');\n }\n buildInfo = info;\n}\n\n/\n Returns \"Build Info\" object; throws if it has not been initialized yet.\n * @returns {object}\n /\nexport function getBuildInfo() {\n if (buildInfo === undefined) {\n throw Error('\"Build Info\" has not been initialized yet');\n }\n return buildInfo;\n}\n","// Checks for client- vs. server-side environment detection.\n\n/\n `true` within client-side environment (browser), `false` at server-side.\n /\nexport const IS_CLIENT_SIDE = typeof process !== 'object'\n \|\| !process.versions \|\| !process.versions.node\n \|\| !!global.REACT_UTILS_FORCE_CLIENT_SIDE;\n\n/\n `true` within the server-side environment (node), `false` at client-side.\n /\nexport const IS_SERVER_SIDE = !IS_CLIENT_SIDE;\n","import { getBuildInfo } from './buildInfo';\nimport { IS_CLIENT_SIDE, IS_SERVER_SIDE } from './environment-check';\n\n/\n @ignore\n * @return {string} Code mode: \"development\" or \"production\".\n /\nfunction getMode() {\n return process.env.NODE_ENV;\n}\n\n/\n Returns `true` if development version of the code is running;\n * `false` otherwise.\n * @return {boolean}\n /\nexport function isDevBuild() {\n return getMode() === 'development';\n}\n\n/\n Returns `true` if production build of the code is running;\n * `false` otherwise.\n * @return {boolean}\n /\nexport function isProdBuild() {\n return getMode() === 'production';\n}\n\n/\n Returns build timestamp of the front-end JS bundle.\n * @return {string} ISO date/time string.\n /\nexport function buildTimestamp() {\n return getBuildInfo().timestamp;\n}\n\nexport { IS_CLIENT_SIDE, IS_SERVER_SIDE, getBuildInfo };\n","import { IS_CLIENT_SIDE } from './isomorphy';\n\n/\n Requires the specified module without including it into the bundle during\n * Webpack build.\n * @param {string} modulePath\n * @param {string} [basePath]\n * @return {object} Required module.\n /\nexport function requireWeak(modulePath, basePath) {\n if (IS_CLIENT_SIDE) return null;\n\n try {\n / eslint-disable no-eval /\n const { resolve } = eval('require')('path');\n const path = basePath ? resolve(basePath, modulePath) : modulePath;\n const { default: def, ...named } = eval('require')(path);\n / eslint-enable no-eval /\n\n if (!def) return named;\n\n Object.entries(named).forEach(([key, value]) => {\n if (def[key]) throw Error('Conflict between default and named exports');\n def[key] = value;\n });\n return def;\n } catch {\n return null;\n }\n}\n\n/\n Resolves specified module path with help of Babel's module resolver.\n * Yes, the function itself just returns its argument to the caller, but Babel\n * is configured to resolve the first argument of resolveWeak(..) function, thus\n * the result will be the resolved path.\n * @param {string} modulePath\n * @return {string} Absolute or relative path to the module.\n /\nexport function resolveWeak(modulePath) {\n return modulePath;\n}\n","/!\n * cookie\n * Copyright(c) 2012-2014 Roman Shtylman\n * Copyright(c) 2015 Douglas Christopher Wilson\n * MIT Licensed\n /\n\n'use strict';\n\n/\n Module exports.\n * @public\n /\n\nexports.parse = parse;\nexports.serialize = serialize;\n\n/\n Module variables.\n * @private\n /\n\nvar __toString = Object.prototype.toString\n\n/\n RegExp to match field-content in RFC 7230 sec 3.2\n \n field-content = field-vchar [ 1( SP / HTAB ) field-vchar ]\n field-vchar = VCHAR / obs-text\n * obs-text = %x80-FF\n /\n\nvar fieldContentRegExp = /^[\\u0009\\u0020-\\u007e\\u0080-\\u00ff]+$/;\n\n/\n Parse a cookie header.\n \n Parse the given cookie header string into an object\n * The object has the various cookies as keys(names) => values\n \n @param {string} str\n * @param {object} [options]\n * @return {object}\n * @public\n /\n\nfunction parse(str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string');\n }\n\n var obj = {}\n var opt = options \|\| {};\n var dec = opt.decode \|\| decode;\n\n var index = 0\n while (index < str.length) {\n var eqIdx = str.indexOf('=', index)\n\n // no more cookie pairs\n if (eqIdx === -1) {\n break\n }\n\n var endIdx = str.indexOf(';', index)\n\n if (endIdx === -1) {\n endIdx = str.length\n } else if (endIdx < eqIdx) {\n // backtrack on prior semicolon\n index = str.lastIndexOf(';', eqIdx - 1) + 1\n continue\n }\n\n var key = str.slice(index, eqIdx).trim()\n\n // only assign once\n if (undefined === obj[key]) {\n var val = str.slice(eqIdx + 1, endIdx).trim()\n\n // quoted values\n if (val.charCodeAt(0) === 0x22) {\n val = val.slice(1, -1)\n }\n\n obj[key] = tryDecode(val, dec);\n }\n\n index = endIdx + 1\n }\n\n return obj;\n}\n\n/\n Serialize data into a cookie header.\n \n Serialize the a name value pair into a cookie string suitable for\n * http headers. An optional options object specified cookie parameters.\n \n serialize('foo', 'bar', { httpOnly: true })\n * => \"foo=bar; httpOnly\"\n \n @param {string} name\n * @param {string} val\n * @param {object} [options]\n * @return {string}\n * @public\n /\n\nfunction serialize(name, val, options) {\n var opt = options \|\| {};\n var enc = opt.encode \|\| encode;\n\n if (typeof enc !== 'function') {\n throw new TypeError('option encode is invalid');\n }\n\n if (!fieldContentRegExp.test(name)) {\n throw new TypeError('argument name is invalid');\n }\n\n var value = enc(val);\n\n if (value && !fieldContentRegExp.test(value)) {\n throw new TypeError('argument val is invalid');\n }\n\n var str = name + '=' + value;\n\n if (null != opt.maxAge) {\n var maxAge = opt.maxAge - 0;\n\n if (isNaN(maxAge) \|\| !isFinite(maxAge)) {\n throw new TypeError('option maxAge is invalid')\n }\n\n str += '; Max-Age=' + Math.floor(maxAge);\n }\n\n if (opt.domain) {\n if (!fieldContentRegExp.test(opt.domain)) {\n throw new TypeError('option domain is invalid');\n }\n\n str += '; Domain=' + opt.domain;\n }\n\n if (opt.path) {\n if (!fieldContentRegExp.test(opt.path)) {\n throw new TypeError('option path is invalid');\n }\n\n str += '; Path=' + opt.path;\n }\n\n if (opt.expires) {\n var expires = opt.expires\n\n if (!isDate(expires) \|\| isNaN(expires.valueOf())) {\n throw new TypeError('option expires is invalid');\n }\n\n str += '; Expires=' + expires.toUTCString()\n }\n\n if (opt.httpOnly) {\n str += '; HttpOnly';\n }\n\n if (opt.secure) {\n str += '; Secure';\n }\n\n if (opt.priority) {\n var priority = typeof opt.priority === 'string'\n ? opt.priority.toLowerCase()\n : opt.priority\n\n switch (priority) {\n case 'low':\n str += '; Priority=Low'\n break\n case 'medium':\n str += '; Priority=Medium'\n break\n case 'high':\n str += '; Priority=High'\n break\n default:\n throw new TypeError('option priority is invalid')\n }\n }\n\n if (opt.sameSite) {\n var sameSite = typeof opt.sameSite === 'string'\n ? opt.sameSite.toLowerCase() : opt.sameSite;\n\n switch (sameSite) {\n case true:\n str += '; SameSite=Strict';\n break;\n case 'lax':\n str += '; SameSite=Lax';\n break;\n case 'strict':\n str += '; SameSite=Strict';\n break;\n case 'none':\n str += '; SameSite=None';\n break;\n default:\n throw new TypeError('option sameSite is invalid');\n }\n }\n\n return str;\n}\n\n/\n URL-decode string value. Optimized to skip native call when no %.\n \n @param {string} str\n * @returns {string}\n /\n\nfunction decode (str) {\n return str.indexOf('%') !== -1\n ? decodeURIComponent(str)\n : str\n}\n\n/\n URL-encode value.\n \n @param {string} str\n * @returns {string}\n /\n\nfunction encode (val) {\n return encodeURIComponent(val)\n}\n\n/\n Determine if value is a Date.\n \n @param {} val\n @private\n /\n\nfunction isDate (val) {\n return __toString.call(val) === '[object Date]' \|\|\n val instanceof Date\n}\n\n/\n Try decoding a string using a decoding function.\n \n @param {string} str\n * @param {function} decode\n * @private\n /\n\nfunction tryDecode(str, decode) {\n try {\n return decode(str);\n } catch (e) {\n return str;\n }\n}\n","/\n Advanced Encryption Standard (AES) implementation.\n \n This implementation is based on the public domain library 'jscrypto' which\n * was written by:\n \n Emily Stark (estark@stanford.edu)\n * Mike Hamburg (mhamburg@stanford.edu)\n * Dan Boneh (dabo@cs.stanford.edu)\n \n Parts of this code are based on the OpenSSL implementation of AES:\n * http://www.openssl.org\n \n @author Dave Longley\n \n Copyright (c) 2010-2014 Digital Bazaar, Inc.\n /\nvar forge = require('./forge');\nrequire('./cipher');\nrequire('./cipherModes');\nrequire('./util');\n\n/ AES API /\nmodule.exports = forge.aes = forge.aes \|\| {};\n\n/\n Deprecated. Instead, use:\n \n var cipher = forge.cipher.createCipher('AES-<mode>', key);\n * cipher.start({iv: iv});\n \n Creates an AES cipher object to encrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n \n The key and iv may be given as a string of bytes, an array of bytes,\n * a byte buffer, or an array of 32-bit words.\n \n @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC').\n \n @return the cipher.\n /\nforge.aes.startEncrypting = function(key, iv, output, mode) {\n var cipher = _createCipher({\n key: key,\n output: output,\n decrypt: false,\n mode: mode\n });\n cipher.start(iv);\n return cipher;\n};\n\n/\n Deprecated. Instead, use:\n \n var cipher = forge.cipher.createCipher('AES-<mode>', key);\n \n Creates an AES cipher object to encrypt data using the given symmetric key.\n \n The key may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n \n @param key the symmetric key to use.\n * @param mode the cipher mode to use (default: 'CBC').\n \n @return the cipher.\n /\nforge.aes.createEncryptionCipher = function(key, mode) {\n return _createCipher({\n key: key,\n output: null,\n decrypt: false,\n mode: mode\n });\n};\n\n/\n Deprecated. Instead, use:\n \n var decipher = forge.cipher.createDecipher('AES-<mode>', key);\n * decipher.start({iv: iv});\n \n Creates an AES cipher object to decrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n \n The key and iv may be given as a string of bytes, an array of bytes,\n * a byte buffer, or an array of 32-bit words.\n \n @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC').\n \n @return the cipher.\n /\nforge.aes.startDecrypting = function(key, iv, output, mode) {\n var cipher = _createCipher({\n key: key,\n output: output,\n decrypt: true,\n mode: mode\n });\n cipher.start(iv);\n return cipher;\n};\n\n/\n Deprecated. Instead, use:\n \n var decipher = forge.cipher.createDecipher('AES-<mode>', key);\n \n Creates an AES cipher object to decrypt data using the given symmetric key.\n \n The key may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n \n @param key the symmetric key to use.\n * @param mode the cipher mode to use (default: 'CBC').\n \n @return the cipher.\n /\nforge.aes.createDecryptionCipher = function(key, mode) {\n return _createCipher({\n key: key,\n output: null,\n decrypt: true,\n mode: mode\n });\n};\n\n/\n Creates a new AES cipher algorithm object.\n \n @param name the name of the algorithm.\n * @param mode the mode factory function.\n \n @return the AES algorithm object.\n /\nforge.aes.Algorithm = function(name, mode) {\n if(!init) {\n initialize();\n }\n var self = this;\n self.name = name;\n self.mode = new mode({\n blockSize: 16,\n cipher: {\n encrypt: function(inBlock, outBlock) {\n return _updateBlock(self._w, inBlock, outBlock, false);\n },\n decrypt: function(inBlock, outBlock) {\n return _updateBlock(self._w, inBlock, outBlock, true);\n }\n }\n });\n self._init = false;\n};\n\n/\n Initializes this AES algorithm by expanding its key.\n \n @param options the options to use.\n * key the key to use with this algorithm.\n * decrypt true if the algorithm should be initialized for decryption,\n * false for encryption.\n /\nforge.aes.Algorithm.prototype.initialize = function(options) {\n if(this._init) {\n return;\n }\n\n var key = options.key;\n var tmp;\n\n / Note: The key may be a string of bytes, an array of bytes, a byte\n buffer, or an array of 32-bit integers. If the key is in bytes, then\n it must be 16, 24, or 32 bytes in length. If it is in 32-bit\n integers, it must be 4, 6, or 8 integers long. /\n\n if(typeof key === 'string' &&\n (key.length === 16 \|\| key.length === 24 \|\| key.length === 32)) {\n // convert key string into byte buffer\n key = forge.util.createBuffer(key);\n } else if(forge.util.isArray(key) &&\n (key.length === 16 \|\| key.length === 24 \|\| key.length === 32)) {\n // convert key integer array into byte buffer\n tmp = key;\n key = forge.util.createBuffer();\n for(var i = 0; i < tmp.length; ++i) {\n key.putByte(tmp[i]);\n }\n }\n\n // convert key byte buffer into 32-bit integer array\n if(!forge.util.isArray(key)) {\n tmp = key;\n key = [];\n\n // key lengths of 16, 24, 32 bytes allowed\n var len = tmp.length();\n if(len === 16 \|\| len === 24 \|\| len === 32) {\n len = len >>> 2;\n for(var i = 0; i < len; ++i) {\n key.push(tmp.getInt32());\n }\n }\n }\n\n // key must be an array of 32-bit integers by now\n if(!forge.util.isArray(key) \|\|\n !(key.length === 4 \|\| key.length === 6 \|\| key.length === 8)) {\n throw new Error('Invalid key parameter.');\n }\n\n // encryption operation is always used for these modes\n var mode = this.mode.name;\n var encryptOp = (['CFB', 'OFB', 'CTR', 'GCM'].indexOf(mode) !== -1);\n\n // do key expansion\n this._w = _expandKey(key, options.decrypt && !encryptOp);\n this._init = true;\n};\n\n/\n Expands a key. Typically only used for testing.\n \n @param key the symmetric key to expand, as an array of 32-bit words.\n * @param decrypt true to expand for decryption, false for encryption.\n \n @return the expanded key.\n /\nforge.aes._expandKey = function(key, decrypt) {\n if(!init) {\n initialize();\n }\n return _expandKey(key, decrypt);\n};\n\n/\n Updates a single block. Typically only used for testing.\n \n @param w the expanded key to use.\n * @param input an array of block-size 32-bit words.\n * @param output an array of block-size 32-bit words.\n * @param decrypt true to decrypt, false to encrypt.\n /\nforge.aes._updateBlock = _updateBlock;\n\n/* Register AES algorithms /\n\nregisterAlgorithm('AES-ECB', forge.cipher.modes.ecb);\nregisterAlgorithm('AES-CBC', forge.cipher.modes.cbc);\nregisterAlgorithm('AES-CFB', forge.cipher.modes.cfb);\nregisterAlgorithm('AES-OFB', forge.cipher.modes.ofb);\nregisterAlgorithm('AES-CTR', forge.cipher.modes.ctr);\nregisterAlgorithm('AES-GCM', forge.cipher.modes.gcm);\n\nfunction registerAlgorithm(name, mode) {\n var factory = function() {\n return new forge.aes.Algorithm(name, mode);\n };\n forge.cipher.registerAlgorithm(name, factory);\n}\n\n/ AES implementation /\n\nvar init = false; // not yet initialized\nvar Nb = 4; // number of words comprising the state (AES = 4)\nvar sbox; // non-linear substitution table used in key expansion\nvar isbox; // inversion of sbox\nvar rcon; // round constant word array\nvar mix; // mix-columns table\nvar imix; // inverse mix-columns table\n\n/\n * Performs initialization, ie: precomputes tables to optimize for speed.\n \n One way to understand how AES works is to imagine that 'addition' and\n * 'multiplication' are interfaces that require certain mathematical\n * properties to hold true (ie: they are associative) but they might have\n * different implementations and produce different kinds of results ...\n * provided that their mathematical properties remain true. AES defines\n * its own methods of addition and multiplication but keeps some important\n * properties the same, ie: associativity and distributivity. The\n * explanation below tries to shed some light on how AES defines addition\n * and multiplication of bytes and 32-bit words in order to perform its\n * encryption and decryption algorithms.\n \n The basics:\n \n The AES algorithm views bytes as binary representations of polynomials\n * that have either 1 or 0 as the coefficients. It defines the addition\n * or subtraction of two bytes as the XOR operation. It also defines the\n * multiplication of two bytes as a finite field referred to as GF(2^8)\n * (Note: 'GF' means \"Galois Field\" which is a field that contains a finite\n * number of elements so GF(2^8) has 256 elements).\n \n This means that any two bytes can be represented as binary polynomials;\n * when they multiplied together and modularly reduced by an irreducible\n * polynomial of the 8th degree, the results are the field GF(2^8). The\n * specific irreducible polynomial that AES uses in hexadecimal is 0x11b.\n * This multiplication is associative with 0x01 as the identity:\n \n (b * 0x01 = GF(b, 0x01) = b).\n \n The operation GF(b, 0x02) can be performed at the byte level by left\n * shifting b once and then XOR'ing it (to perform the modular reduction)\n * with 0x11b if b is >= 128. Repeated application of the multiplication\n * of 0x02 can be used to implement the multiplication of any two bytes.\n \n For instance, multiplying 0x57 and 0x13, denoted as GF(0x57, 0x13), can\n * be performed by factoring 0x13 into 0x01, 0x02, and 0x10. Then these\n * factors can each be multiplied by 0x57 and then added together. To do\n * the multiplication, values for 0x57 multiplied by each of these 3 factors\n * can be precomputed and stored in a table. To add them, the values from\n * the table are XOR'd together.\n \n AES also defines addition and multiplication of words, that is 4-byte\n * numbers represented as polynomials of 3 degrees where the coefficients\n * are the values of the bytes.\n \n The word [a0, a1, a2, a3] is a polynomial a3x^3 + a2x^2 + a1x + a0.\n \n Addition is performed by XOR'ing like powers of x. Multiplication\n * is performed in two steps, the first is an algebriac expansion as\n * you would do normally (where addition is XOR). But the result is\n * a polynomial larger than 3 degrees and thus it cannot fit in a word. So\n * next the result is modularly reduced by an AES-specific polynomial of\n * degree 4 which will always produce a polynomial of less than 4 degrees\n * such that it will fit in a word. In AES, this polynomial is x^4 + 1.\n \n The modular product of two polynomials 'a' and 'b' is thus:\n \n d(x) = d3x^3 + d2x^2 + d1x + d0\n * with\n * d0 = GF(a0, b0) ^ GF(a3, b1) ^ GF(a2, b2) ^ GF(a1, b3)\n * d1 = GF(a1, b0) ^ GF(a0, b1) ^ GF(a3, b2) ^ GF(a2, b3)\n * d2 = GF(a2, b0) ^ GF(a1, b1) ^ GF(a0, b2) ^ GF(a3, b3)\n * d3 = GF(a3, b0) ^ GF(a2, b1) ^ GF(a1, b2) ^ GF(a0, b3)\n \n As a matrix:\n \n [d0] = [a0 a3 a2 a1][b0]\n * [d1] [a1 a0 a3 a2][b1]\n * [d2] [a2 a1 a0 a3][b2]\n * [d3] [a3 a2 a1 a0][b3]\n \n Special polynomials defined by AES (0x02 == {02}):\n * a(x) = {03}x^3 + {01}x^2 + {01}x + {02}\n * a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}.\n \n These polynomials are used in the MixColumns() and InverseMixColumns()\n * operations, respectively, to cause each element in the state to affect\n * the output (referred to as diffusing).\n \n RotWord() uses: a0 = a1 = a2 = {00} and a3 = {01}, which is the\n * polynomial x3.\n \n The ShiftRows() method modifies the last 3 rows in the state (where\n * the state is 4 words with 4 bytes per word) by shifting bytes cyclically.\n * The 1st byte in the second row is moved to the end of the row. The 1st\n * and 2nd bytes in the third row are moved to the end of the row. The 1st,\n * 2nd, and 3rd bytes are moved in the fourth row.\n \n More details on how AES arithmetic works:\n \n In the polynomial representation of binary numbers, XOR performs addition\n * and subtraction and multiplication in GF(2^8) denoted as GF(a, b)\n * corresponds with the multiplication of polynomials modulo an irreducible\n * polynomial of degree 8. In other words, for AES, GF(a, b) will multiply\n * polynomial 'a' with polynomial 'b' and then do a modular reduction by\n * an AES-specific irreducible polynomial of degree 8.\n \n A polynomial is irreducible if its only divisors are one and itself. For\n * the AES algorithm, this irreducible polynomial is:\n \n m(x) = x^8 + x^4 + x^3 + x + 1,\n \n or {01}{1b} in hexadecimal notation, where each coefficient is a bit:\n * 100011011 = 283 = 0x11b.\n \n For example, GF(0x57, 0x83) = 0xc1 because\n \n 0x57 = 87 = 01010111 = x^6 + x^4 + x^2 + x + 1\n * 0x85 = 131 = 10000101 = x^7 + x + 1\n \n (x^6 + x^4 + x^2 + x + 1) * (x^7 + x + 1)\n * = x^13 + x^11 + x^9 + x^8 + x^7 +\n * x^7 + x^5 + x^3 + x^2 + x +\n * x^6 + x^4 + x^2 + x + 1\n * = x^13 + x^11 + x^9 + x^8 + x^6 + x^5 + x^4 + x^3 + 1 = y\n * y modulo (x^8 + x^4 + x^3 + x + 1)\n * = x^7 + x^6 + 1.\n \n The modular reduction by m(x) guarantees the result will be a binary\n * polynomial of less than degree 8, so that it can fit in a byte.\n \n The operation to multiply a binary polynomial b with x (the polynomial\n * x in binary representation is 00000010) is:\n \n b_7x^8 + b_6x^7 + b_5x^6 + b_4x^5 + b_3x^4 + b_2x^3 + b_1x^2 + b_0x^1\n \n To get GF(b, x) we must reduce that by m(x). If b_7 is 0 (that is the\n * most significant bit is 0 in b) then the result is already reduced. If\n * it is 1, then we can reduce it by subtracting m(x) via an XOR.\n \n It follows that multiplication by x (00000010 or 0x02) can be implemented\n * by performing a left shift followed by a conditional bitwise XOR with\n * 0x1b. This operation on bytes is denoted by xtime(). Multiplication by\n * higher powers of x can be implemented by repeated application of xtime().\n \n By adding intermediate results, multiplication by any constant can be\n * implemented. For instance:\n \n GF(0x57, 0x13) = 0xfe because:\n \n xtime(b) = (b & 128) ? (b << 1 ^ 0x11b) : (b << 1)\n \n Note: We XOR with 0x11b instead of 0x1b because in javascript our\n * datatype for b can be larger than 1 byte, so a left shift will not\n * automatically eliminate bits that overflow a byte ... by XOR'ing the\n * overflow bit with 1 (the extra one from 0x11b) we zero it out.\n \n GF(0x57, 0x02) = xtime(0x57) = 0xae\n * GF(0x57, 0x04) = xtime(0xae) = 0x47\n * GF(0x57, 0x08) = xtime(0x47) = 0x8e\n * GF(0x57, 0x10) = xtime(0x8e) = 0x07\n \n GF(0x57, 0x13) = GF(0x57, (0x01 ^ 0x02 ^ 0x10))\n \n And by the distributive property (since XOR is addition and GF() is\n * multiplication):\n \n = GF(0x57, 0x01) ^ GF(0x57, 0x02) ^ GF(0x57, 0x10)\n * = 0x57 ^ 0xae ^ 0x07\n * = 0xfe.\n /\nfunction initialize() {\n init = true;\n\n / Populate the Rcon table. These are the values given by\n [x^(i-1),{00},{00},{00}] where x^(i-1) are powers of x (and x = 0x02)\n in the field of GF(2^8), where i starts at 1.\n\n rcon[0] = [0x00, 0x00, 0x00, 0x00]\n rcon[1] = [0x01, 0x00, 0x00, 0x00] 2^(1-1) = 2^0 = 1\n rcon[2] = [0x02, 0x00, 0x00, 0x00] 2^(2-1) = 2^1 = 2\n ...\n rcon[9] = [0x1B, 0x00, 0x00, 0x00] 2^(9-1) = 2^8 = 0x1B\n rcon[10] = [0x36, 0x00, 0x00, 0x00] 2^(10-1) = 2^9 = 0x36\n\n We only store the first byte because it is the only one used.\n /\n rcon = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36];\n\n // compute xtime table which maps i onto GF(i, 0x02)\n var xtime = new Array(256);\n for(var i = 0; i < 128; ++i) {\n xtime[i] = i << 1;\n xtime[i + 128] = (i + 128) << 1 ^ 0x11B;\n }\n\n // compute all other tables\n sbox = new Array(256);\n isbox = new Array(256);\n mix = new Array(4);\n imix = new Array(4);\n for(var i = 0; i < 4; ++i) {\n mix[i] = new Array(256);\n imix[i] = new Array(256);\n }\n var e = 0, ei = 0, e2, e4, e8, sx, sx2, me, ime;\n for(var i = 0; i < 256; ++i) {\n / We need to generate the SubBytes() sbox and isbox tables so that\n we can perform byte substitutions. This requires us to traverse\n all of the elements in GF, find their multiplicative inverses,\n and apply to each the following affine transformation:\n\n bi' = bi ^ b(i + 4) mod 8 ^ b(i + 5) mod 8 ^ b(i + 6) mod 8 ^\n b(i + 7) mod 8 ^ ci\n for 0 <= i < 8, where bi is the ith bit of the byte, and ci is the\n ith bit of a byte c with the value {63} or {01100011}.\n\n It is possible to traverse every possible value in a Galois field\n using what is referred to as a 'generator'. There are many\n generators (128 out of 256): 3,5,6,9,11,82 to name a few. To fully\n traverse GF we iterate 255 times, multiplying by our generator\n each time.\n\n On each iteration we can determine the multiplicative inverse for\n the current element.\n\n Suppose there is an element in GF 'e'. For a given generator 'g',\n e = g^x. The multiplicative inverse of e is g^(255 - x). It turns\n out that if use the inverse of a generator as another generator\n it will produce all of the corresponding multiplicative inverses\n at the same time. For this reason, we choose 5 as our inverse\n generator because it only requires 2 multiplies and 1 add and its\n inverse, 82, requires relatively few operations as well.\n\n In order to apply the affine transformation, the multiplicative\n inverse 'ei' of 'e' can be repeatedly XOR'd (4 times) with a\n bit-cycling of 'ei'. To do this 'ei' is first stored in 's' and\n 'x'. Then 's' is left shifted and the high bit of 's' is made the\n low bit. The resulting value is stored in 's'. Then 'x' is XOR'd\n with 's' and stored in 'x'. On each subsequent iteration the same\n operation is performed. When 4 iterations are complete, 'x' is\n XOR'd with 'c' (0x63) and the transformed value is stored in 'x'.\n For example:\n\n s = 01000001\n x = 01000001\n\n iteration 1: s = 10000010, x ^= s\n iteration 2: s = 00000101, x ^= s\n iteration 3: s = 00001010, x ^= s\n iteration 4: s = 00010100, x ^= s\n x ^= 0x63\n\n This can be done with a loop where s = (s << 1) \| (s >> 7). However,\n it can also be done by using a single 16-bit (in this case 32-bit)\n number 'sx'. Since XOR is an associative operation, we can set 'sx'\n to 'ei' and then XOR it with 'sx' left-shifted 1,2,3, and 4 times.\n The most significant bits will flow into the high 8 bit positions\n and be correctly XOR'd with one another. All that remains will be\n to cycle the high 8 bits by XOR'ing them all with the lower 8 bits\n afterwards.\n\n At the same time we're populating sbox and isbox we can precompute\n the multiplication we'll need to do to do MixColumns() later.\n /\n\n // apply affine transformation\n sx = ei ^ (ei << 1) ^ (ei << 2) ^ (ei << 3) ^ (ei << 4);\n sx = (sx >> 8) ^ (sx & 255) ^ 0x63;\n\n // update tables\n sbox[e] = sx;\n isbox[sx] = e;\n\n / Mixing columns is done using matrix multiplication. The columns\n that are to be mixed are each a single word in the current state.\n The state has Nb columns (4 columns). Therefore each column is a\n 4 byte word. So to mix the columns in a single column 'c' where\n its rows are r0, r1, r2, and r3, we use the following matrix\n multiplication:\n\n [2 3 1 1][r0,c]=[r'0,c]\n [1 2 3 1] [r1,c] [r'1,c]\n [1 1 2 3] [r2,c] [r'2,c]\n [3 1 1 2] [r3,c] [r'3,c]\n\n r0, r1, r2, and r3 are each 1 byte of one of the words in the\n state (a column). To do matrix multiplication for each mixed\n column c' we multiply the corresponding row from the left matrix\n with the corresponding column from the right matrix. In total, we\n get 4 equations:\n\n r0,c' = 2r0,c + 3r1,c + 1r2,c + 1r3,c\n r1,c' = 1r0,c + 2r1,c + 3r2,c + 1r3,c\n r2,c' = 1r0,c + 1r1,c + 2r2,c + 3r3,c\n r3,c' = 3r0,c + 1r1,c + 1r2,c + 2r3,c\n\n As usual, the multiplication is as previously defined and the\n addition is XOR. In order to optimize mixing columns we can store\n the multiplication results in tables. If you think of the whole\n column as a word (it might help to visualize by mentally rotating\n the equations above by counterclockwise 90 degrees) then you can\n see that it would be useful to map the multiplications performed on\n each byte (r0, r1, r2, r3) onto a word as well. For instance, we\n could map 2r0,1r0,1r0,3r0 onto a word by storing 2r0 in the\n highest 8 bits and 3r0 in the lowest 8 bits (with the other two\n respectively in the middle). This means that a table can be\n constructed that uses r0 as an index to the word. We can do the\n same with r1, r2, and r3, creating a total of 4 tables.\n\n To construct a full c', we can just look up each byte of c in\n their respective tables and XOR the results together.\n\n Also, to build each table we only have to calculate the word\n for 2,1,1,3 for every byte ... which we can do on each iteration\n of this loop since we will iterate over every byte. After we have\n calculated 2,1,1,3 we can get the results for the other tables\n by cycling the byte at the end to the beginning. For instance\n we can take the result of table 2,1,1,3 and produce table 3,2,1,1\n by moving the right most byte to the left most position just like\n how you can imagine the 3 moved out of 2,1,1,3 and to the front\n to produce 3,2,1,1.\n\n There is another optimization in that the same multiples of\n the current element we need in order to advance our generator\n to the next iteration can be reused in performing the 2,1,1,3\n calculation. We also calculate the inverse mix column tables,\n with e,9,d,b being the inverse of 2,1,1,3.\n\n When we're done, and we need to actually mix columns, the first\n byte of each state word should be put through mix[0] (2,1,1,3),\n the second through mix[1] (3,2,1,1) and so forth. Then they should\n be XOR'd together to produce the fully mixed column.\n /\n\n // calculate mix and imix table values\n sx2 = xtime[sx];\n e2 = xtime[e];\n e4 = xtime[e2];\n e8 = xtime[e4];\n me =\n (sx2 << 24) ^ // 2\n (sx << 16) ^ // 1\n (sx << 8) ^ // 1\n (sx ^ sx2); // 3\n ime =\n (e2 ^ e4 ^ e8) << 24 ^ // E (14)\n (e ^ e8) << 16 ^ // 9\n (e ^ e4 ^ e8) << 8 ^ // D (13)\n (e ^ e2 ^ e8); // B (11)\n // produce each of the mix tables by rotating the 2,1,1,3 value\n for(var n = 0; n < 4; ++n) {\n mix[n][e] = me;\n imix[n][sx] = ime;\n // cycle the right most byte to the left most position\n // ie: 2,1,1,3 becomes 3,2,1,1\n me = me << 24 \| me >>> 8;\n ime = ime << 24 \| ime >>> 8;\n }\n\n // get next element and inverse\n if(e === 0) {\n // 1 is the inverse of 1\n e = ei = 1;\n } else {\n // e = 2e + 222(10e)) = multiply e by 82 (chosen generator)\n // ei = ei + 22ei = multiply ei by 5 (inverse generator)\n e = e2 ^ xtime[xtime[xtime[e2 ^ e8]]];\n ei ^= xtime[xtime[ei]];\n }\n }\n}\n\n/\n Generates a key schedule using the AES key expansion algorithm.\n \n The AES algorithm takes the Cipher Key, K, and performs a Key Expansion\n * routine to generate a key schedule. The Key Expansion generates a total\n * of Nb(Nr + 1) words: the algorithm requires an initial set of Nb words,\n and each of the Nr rounds requires Nb words of key data. The resulting\n * key schedule consists of a linear array of 4-byte words, denoted [wi ],\n * with i in the range 0 <= i < Nb(Nr + 1).\n \n KeyExpansion(byte key[4Nk], word w[Nb(Nr+1)], Nk)\n * AES-128 (Nb=4, Nk=4, Nr=10)\n * AES-192 (Nb=4, Nk=6, Nr=12)\n * AES-256 (Nb=4, Nk=8, Nr=14)\n * Note: Nr=Nk+6.\n \n Nb is the number of columns (32-bit words) comprising the State (or\n * number of bytes in a block). For AES, Nb=4.\n \n @param key the key to schedule (as an array of 32-bit words).\n * @param decrypt true to modify the key schedule to decrypt, false not to.\n \n @return the generated key schedule.\n /\nfunction _expandKey(key, decrypt) {\n // copy the key's words to initialize the key schedule\n var w = key.slice(0);\n\n / RotWord() will rotate a word, moving the first byte to the last\n byte's position (shifting the other bytes left).\n\n We will be getting the value of Rcon at i / Nk. 'i' will iterate\n from Nk to (Nb * Nr+1). Nk = 4 (4 byte key), Nb = 4 (4 words in\n a block), Nr = Nk + 6 (10). Therefore 'i' will iterate from\n 4 to 44 (exclusive). Each time we iterate 4 times, i / Nk will\n increase by 1. We use a counter iNk to keep track of this.\n /\n\n // go through the rounds expanding the key\n var temp, iNk = 1;\n var Nk = w.length;\n var Nr1 = Nk + 6 + 1;\n var end = Nb Nr1;\n for(var i = Nk; i < end; ++i) {\n temp = w[i - 1];\n if(i % Nk === 0) {\n // temp = SubWord(RotWord(temp)) ^ Rcon[i / Nk]\n temp =\n sbox[temp >>> 16 & 255] << 24 ^\n sbox[temp >>> 8 & 255] << 16 ^\n sbox[temp & 255] << 8 ^\n sbox[temp >>> 24] ^ (rcon[iNk] << 24);\n iNk++;\n } else if(Nk > 6 && (i % Nk === 4)) {\n // temp = SubWord(temp)\n temp =\n sbox[temp >>> 24] << 24 ^\n sbox[temp >>> 16 & 255] << 16 ^\n sbox[temp >>> 8 & 255] << 8 ^\n sbox[temp & 255];\n }\n w[i] = w[i - Nk] ^ temp;\n }\n\n /* When we are updating a cipher block we always use the code path for\n encryption whether we are decrypting or not (to shorten code and\n simplify the generation of look up tables). However, because there\n are differences in the decryption algorithm, other than just swapping\n in different look up tables, we must transform our key schedule to\n account for these changes:\n\n 1. The decryption algorithm gets its key rounds in reverse order.\n 2. The decryption algorithm adds the round key before mixing columns\n instead of afterwards.\n\n We don't need to modify our key schedule to handle the first case,\n we can just traverse the key schedule in reverse order when decrypting.\n\n The second case requires a little work.\n\n The tables we built for performing rounds will take an input and then\n perform SubBytes() and MixColumns() or, for the decrypt version,\n InvSubBytes() and InvMixColumns(). But the decrypt algorithm requires\n us to AddRoundKey() before InvMixColumns(). This means we'll need to\n apply some transformations to the round key to inverse-mix its columns\n so they'll be correct for moving AddRoundKey() to after the state has\n had its columns inverse-mixed.\n\n To inverse-mix the columns of the state when we're decrypting we use a\n lookup table that will apply InvSubBytes() and InvMixColumns() at the\n same time. However, the round key's bytes are not inverse-substituted\n in the decryption algorithm. To get around this problem, we can first\n substitute the bytes in the round key so that when we apply the\n transformation via the InvSubBytes()+InvMixColumns() table, it will\n undo our substitution leaving us with the original value that we\n want -- and then inverse-mix that value.\n\n This change will correctly alter our key schedule so that we can XOR\n each round key with our already transformed decryption state. This\n allows us to use the same code path as the encryption algorithm.\n\n We make one more change to the decryption key. Since the decryption\n algorithm runs in reverse from the encryption algorithm, we reverse\n the order of the round keys to avoid having to iterate over the key\n schedule backwards when running the encryption algorithm later in\n decryption mode. In addition to reversing the order of the round keys,\n we also swap each round key's 2nd and 4th rows. See the comments\n section where rounds are performed for more details about why this is\n done. These changes are done inline with the other substitution\n described above.\n /\n if(decrypt) {\n var tmp;\n var m0 = imix[0];\n var m1 = imix[1];\n var m2 = imix[2];\n var m3 = imix[3];\n var wnew = w.slice(0);\n end = w.length;\n for(var i = 0, wi = end - Nb; i < end; i += Nb, wi -= Nb) {\n // do not sub the first or last round key (round keys are Nb\n // words) as no column mixing is performed before they are added,\n // but do change the key order\n if(i === 0 \|\| i === (end - Nb)) {\n wnew[i] = w[wi];\n wnew[i + 1] = w[wi + 3];\n wnew[i + 2] = w[wi + 2];\n wnew[i + 3] = w[wi + 1];\n } else {\n // substitute each round key byte because the inverse-mix\n // table will inverse-substitute it (effectively cancel the\n // substitution because round key bytes aren't sub'd in\n // decryption mode) and swap indexes 3 and 1\n for(var n = 0; n < Nb; ++n) {\n tmp = w[wi + n];\n wnew[i + (3&-n)] =\n m0[sbox[tmp >>> 24]] ^\n m1[sbox[tmp >>> 16 & 255]] ^\n m2[sbox[tmp >>> 8 & 255]] ^\n m3[sbox[tmp & 255]];\n }\n }\n }\n w = wnew;\n }\n\n return w;\n}\n\n/\n Updates a single block (16 bytes) using AES. The update will either\n * encrypt or decrypt the block.\n \n @param w the key schedule.\n * @param input the input block (an array of 32-bit words).\n * @param output the updated output block.\n * @param decrypt true to decrypt the block, false to encrypt it.\n /\nfunction _updateBlock(w, input, output, decrypt) {\n /\n Cipher(byte in[4Nb], byte out[4Nb], word w[Nb(Nr+1)])\n begin\n byte state[4,Nb]\n state = in\n AddRoundKey(state, w[0, Nb-1])\n for round = 1 step 1 to Nr-1\n SubBytes(state)\n ShiftRows(state)\n MixColumns(state)\n AddRoundKey(state, w[roundNb, (round+1)Nb-1])\n end for\n SubBytes(state)\n ShiftRows(state)\n AddRoundKey(state, w[NrNb, (Nr+1)Nb-1])\n out = state\n end\n\n InvCipher(byte in[4Nb], byte out[4Nb], word w[Nb(Nr+1)])\n begin\n byte state[4,Nb]\n state = in\n AddRoundKey(state, w[NrNb, (Nr+1)Nb-1])\n for round = Nr-1 step -1 downto 1\n InvShiftRows(state)\n InvSubBytes(state)\n AddRoundKey(state, w[roundNb, (round+1)Nb-1])\n InvMixColumns(state)\n end for\n InvShiftRows(state)\n InvSubBytes(state)\n AddRoundKey(state, w[0, Nb-1])\n out = state\n end\n /\n\n // Encrypt: AddRoundKey(state, w[0, Nb-1])\n // Decrypt: AddRoundKey(state, w[NrNb, (Nr+1)Nb-1])\n var Nr = w.length / 4 - 1;\n var m0, m1, m2, m3, sub;\n if(decrypt) {\n m0 = imix[0];\n m1 = imix[1];\n m2 = imix[2];\n m3 = imix[3];\n sub = isbox;\n } else {\n m0 = mix[0];\n m1 = mix[1];\n m2 = mix[2];\n m3 = mix[3];\n sub = sbox;\n }\n var a, b, c, d, a2, b2, c2;\n a = input[0] ^ w[0];\n b = input[decrypt ? 3 : 1] ^ w[1];\n c = input[2] ^ w[2];\n d = input[decrypt ? 1 : 3] ^ w[3];\n var i = 3;\n\n / In order to share code we follow the encryption algorithm when both\n encrypting and decrypting. To account for the changes required in the\n decryption algorithm, we use different lookup tables when decrypting\n and use a modified key schedule to account for the difference in the\n order of transformations applied when performing rounds. We also get\n key rounds in reverse order (relative to encryption). /\n for(var round = 1; round < Nr; ++round) {\n / As described above, we'll be using table lookups to perform the\n column mixing. Each column is stored as a word in the state (the\n array 'input' has one column as a word at each index). In order to\n mix a column, we perform these transformations on each row in c,\n which is 1 byte in each word. The new column for c0 is c'0:\n\n m0 m1 m2 m3\n r0,c'0 = 2r0,c0 + 3r1,c0 + 1r2,c0 + 1r3,c0\n r1,c'0 = 1r0,c0 + 2r1,c0 + 3r2,c0 + 1r3,c0\n r2,c'0 = 1r0,c0 + 1r1,c0 + 2r2,c0 + 3r3,c0\n r3,c'0 = 3r0,c0 + 1r1,c0 + 1r2,c0 + 2r3,c0\n\n So using mix tables where c0 is a word with r0 being its upper\n 8 bits and r3 being its lower 8 bits:\n\n m0[c0 >> 24] will yield this word: [2r0,1r0,1r0,3r0]\n ...\n m3[c0 & 255] will yield this word: [1r3,1r3,3r3,2r3]\n\n Therefore to mix the columns in each word in the state we\n do the following (& 255 omitted for brevity):\n c'0,r0 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n c'0,r1 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n c'0,r2 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n c'0,r3 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n\n However, before mixing, the algorithm requires us to perform\n ShiftRows(). The ShiftRows() transformation cyclically shifts the\n last 3 rows of the state over different offsets. The first row\n (r = 0) is not shifted.\n\n s'_r,c = s_r,(c + shift(r, Nb) mod Nb\n for 0 < r < 4 and 0 <= c < Nb and\n shift(1, 4) = 1\n shift(2, 4) = 2\n shift(3, 4) = 3.\n\n This causes the first byte in r = 1 to be moved to the end of\n the row, the first 2 bytes in r = 2 to be moved to the end of\n the row, the first 3 bytes in r = 3 to be moved to the end of\n the row:\n\n r1: [c0 c1 c2 c3] => [c1 c2 c3 c0]\n r2: [c0 c1 c2 c3] [c2 c3 c0 c1]\n r3: [c0 c1 c2 c3] [c3 c0 c1 c2]\n\n We can make these substitutions inline with our column mixing to\n generate an updated set of equations to produce each word in the\n state (note the columns have changed positions):\n\n c0 c1 c2 c3 => c0 c1 c2 c3\n c0 c1 c2 c3 c1 c2 c3 c0 (cycled 1 byte)\n c0 c1 c2 c3 c2 c3 c0 c1 (cycled 2 bytes)\n c0 c1 c2 c3 c3 c0 c1 c2 (cycled 3 bytes)\n\n Therefore:\n\n c'0 = 2r0,c0 + 3r1,c1 + 1r2,c2 + 1r3,c3\n c'0 = 1r0,c0 + 2r1,c1 + 3r2,c2 + 1r3,c3\n c'0 = 1r0,c0 + 1r1,c1 + 2r2,c2 + 3r3,c3\n c'0 = 3r0,c0 + 1r1,c1 + 1r2,c2 + 2r3,c3\n\n c'1 = 2r0,c1 + 3r1,c2 + 1r2,c3 + 1r3,c0\n c'1 = 1r0,c1 + 2r1,c2 + 3r2,c3 + 1r3,c0\n c'1 = 1r0,c1 + 1r1,c2 + 2r2,c3 + 3r3,c0\n c'1 = 3r0,c1 + 1r1,c2 + 1r2,c3 + 2r3,c0\n\n ... and so forth for c'2 and c'3. The important distinction is\n that the columns are cycling, with c0 being used with the m0\n map when calculating c0, but c1 being used with the m0 map when\n calculating c1 ... and so forth.\n\n When performing the inverse we transform the mirror image and\n skip the bottom row, instead of the top one, and move upwards:\n\n c3 c2 c1 c0 => c0 c3 c2 c1 (cycled 3 bytes) same as encryption\n c3 c2 c1 c0 c1 c0 c3 c2 (cycled 2 bytes)\n c3 c2 c1 c0 c2 c1 c0 c3 (cycled 1 byte) same as encryption\n c3 c2 c1 c0 c3 c2 c1 c0\n\n If you compare the resulting matrices for ShiftRows()+MixColumns()\n and for InvShiftRows()+InvMixColumns() the 2nd and 4th columns are\n different (in encrypt mode vs. decrypt mode). So in order to use\n the same code to handle both encryption and decryption, we will\n need to do some mapping.\n\n If in encryption mode we let a=c0, b=c1, c=c2, d=c3, and r<N> be\n a row number in the state, then the resulting matrix in encryption\n mode for applying the above transformations would be:\n\n r1: a b c d\n r2: b c d a\n r3: c d a b\n r4: d a b c\n\n If we did the same in decryption mode we would get:\n\n r1: a d c b\n r2: b a d c\n r3: c b a d\n r4: d c b a\n\n If instead we swap d and b (set b=c3 and d=c1), then we get:\n\n r1: a b c d\n r2: d a b c\n r3: c d a b\n r4: b c d a\n\n Now the 1st and 3rd rows are the same as the encryption matrix. All\n we need to do then to make the mapping exactly the same is to swap\n the 2nd and 4th rows when in decryption mode. To do this without\n having to do it on each iteration, we swapped the 2nd and 4th rows\n in the decryption key schedule. We also have to do the swap above\n when we first pull in the input and when we set the final output. /\n a2 =\n m0[a >>> 24] ^\n m1[b >>> 16 & 255] ^\n m2[c >>> 8 & 255] ^\n m3[d & 255] ^ w[++i];\n b2 =\n m0[b >>> 24] ^\n m1[c >>> 16 & 255] ^\n m2[d >>> 8 & 255] ^\n m3[a & 255] ^ w[++i];\n c2 =\n m0[c >>> 24] ^\n m1[d >>> 16 & 255] ^\n m2[a >>> 8 & 255] ^\n m3[b & 255] ^ w[++i];\n d =\n m0[d >>> 24] ^\n m1[a >>> 16 & 255] ^\n m2[b >>> 8 & 255] ^\n m3[c & 255] ^ w[++i];\n a = a2;\n b = b2;\n c = c2;\n }\n\n /\n Encrypt:\n SubBytes(state)\n ShiftRows(state)\n AddRoundKey(state, w[NrNb, (Nr+1)Nb-1])\n\n Decrypt:\n InvShiftRows(state)\n InvSubBytes(state)\n AddRoundKey(state, w[0, Nb-1])\n /\n // Note: rows are shifted inline\n output[0] =\n (sub[a >>> 24] << 24) ^\n (sub[b >>> 16 & 255] << 16) ^\n (sub[c >>> 8 & 255] << 8) ^\n (sub[d & 255]) ^ w[++i];\n output[decrypt ? 3 : 1] =\n (sub[b >>> 24] << 24) ^\n (sub[c >>> 16 & 255] << 16) ^\n (sub[d >>> 8 & 255] << 8) ^\n (sub[a & 255]) ^ w[++i];\n output[2] =\n (sub[c >>> 24] << 24) ^\n (sub[d >>> 16 & 255] << 16) ^\n (sub[a >>> 8 & 255] << 8) ^\n (sub[b & 255]) ^ w[++i];\n output[decrypt ? 1 : 3] =\n (sub[d >>> 24] << 24) ^\n (sub[a >>> 16 & 255] << 16) ^\n (sub[b >>> 8 & 255] << 8) ^\n (sub[c & 255]) ^ w[++i];\n}\n\n/\n Deprecated. Instead, use:\n \n forge.cipher.createCipher('AES-<mode>', key);\n * forge.cipher.createDecipher('AES-<mode>', key);\n \n Creates a deprecated AES cipher object. This object's mode will default to\n * CBC (cipher-block-chaining).\n \n The key and iv may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n \n @param options the options to use.\n * key the symmetric key to use.\n * output the buffer to write to.\n * decrypt true for decryption, false for encryption.\n * mode the cipher mode to use (default: 'CBC').\n \n @return the cipher.\n /\nfunction _createCipher(options) {\n options = options \|\| {};\n var mode = (options.mode \|\| 'CBC').toUpperCase();\n var algorithm = 'AES-' + mode;\n\n var cipher;\n if(options.decrypt) {\n cipher = forge.cipher.createDecipher(algorithm, options.key);\n } else {\n cipher = forge.cipher.createCipher(algorithm, options.key);\n }\n\n // backwards compatible start API\n var start = cipher.start;\n cipher.start = function(iv, options) {\n // backwards compatibility: support second arg as output buffer\n var output = null;\n if(options instanceof forge.util.ByteBuffer) {\n output = options;\n options = {};\n }\n options = options \|\| {};\n options.output = output;\n options.iv = iv;\n start.call(cipher, options);\n };\n\n return cipher;\n}\n","/\n Base-N/Base-X encoding/decoding functions.\n \n Original implementation from base-x:\n * https://github.com/cryptocoinjs/base-x\n \n Which is MIT licensed:\n \n The MIT License (MIT)\n \n Copyright base-x contributors (c) 2016\n \n Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n \n The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n \n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n /\nvar api = {};\nmodule.exports = api;\n\n// baseN alphabet indexes\nvar _reverseAlphabets = {};\n\n/\n BaseN-encodes a Uint8Array using the given alphabet.\n \n @param input the Uint8Array to encode.\n * @param maxline the maximum number of encoded characters per line to use,\n * defaults to none.\n \n @return the baseN-encoded output string.\n /\napi.encode = function(input, alphabet, maxline) {\n if(typeof alphabet !== 'string') {\n throw new TypeError('\"alphabet\" must be a string.');\n }\n if(maxline !== undefined && typeof maxline !== 'number') {\n throw new TypeError('\"maxline\" must be a number.');\n }\n\n var output = '';\n\n if(!(input instanceof Uint8Array)) {\n // assume forge byte buffer\n output = _encodeWithByteBuffer(input, alphabet);\n } else {\n var i = 0;\n var base = alphabet.length;\n var first = alphabet.charAt(0);\n var digits = [0];\n for(i = 0; i < input.length; ++i) {\n for(var j = 0, carry = input[i]; j < digits.length; ++j) {\n carry += digits[j] << 8;\n digits[j] = carry % base;\n carry = (carry / base) \| 0;\n }\n\n while(carry > 0) {\n digits.push(carry % base);\n carry = (carry / base) \| 0;\n }\n }\n\n // deal with leading zeros\n for(i = 0; input[i] === 0 && i < input.length - 1; ++i) {\n output += first;\n }\n // convert digits to a string\n for(i = digits.length - 1; i >= 0; --i) {\n output += alphabet[digits[i]];\n }\n }\n\n if(maxline) {\n var regex = new RegExp('.{1,' + maxline + '}', 'g');\n output = output.match(regex).join('\\r\\n');\n }\n\n return output;\n};\n\n/\n Decodes a baseN-encoded (using the given alphabet) string to a\n * Uint8Array.\n \n @param input the baseN-encoded input string.\n \n @return the Uint8Array.\n /\napi.decode = function(input, alphabet) {\n if(typeof input !== 'string') {\n throw new TypeError('\"input\" must be a string.');\n }\n if(typeof alphabet !== 'string') {\n throw new TypeError('\"alphabet\" must be a string.');\n }\n\n var table = _reverseAlphabets[alphabet];\n if(!table) {\n // compute reverse alphabet\n table = _reverseAlphabets[alphabet] = [];\n for(var i = 0; i < alphabet.length; ++i) {\n table[alphabet.charCodeAt(i)] = i;\n }\n }\n\n // remove whitespace characters\n input = input.replace(/\\s/g, '');\n\n var base = alphabet.length;\n var first = alphabet.charAt(0);\n var bytes = [0];\n for(var i = 0; i < input.length; i++) {\n var value = table[input.charCodeAt(i)];\n if(value === undefined) {\n return;\n }\n\n for(var j = 0, carry = value; j < bytes.length; ++j) {\n carry += bytes[j] base;\n bytes[j] = carry & 0xff;\n carry >>= 8;\n }\n\n while(carry > 0) {\n bytes.push(carry & 0xff);\n carry >>= 8;\n }\n }\n\n // deal with leading zeros\n for(var k = 0; input[k] === first && k < input.length - 1; ++k) {\n bytes.push(0);\n }\n\n if(typeof Buffer !== 'undefined') {\n return Buffer.from(bytes.reverse());\n }\n\n return new Uint8Array(bytes.reverse());\n};\n\nfunction _encodeWithByteBuffer(input, alphabet) {\n var i = 0;\n var base = alphabet.length;\n var first = alphabet.charAt(0);\n var digits = [0];\n for(i = 0; i < input.length(); ++i) {\n for(var j = 0, carry = input.at(i); j < digits.length; ++j) {\n carry += digits[j] << 8;\n digits[j] = carry % base;\n carry = (carry / base) \| 0;\n }\n\n while(carry > 0) {\n digits.push(carry % base);\n carry = (carry / base) \| 0;\n }\n }\n\n var output = '';\n\n // deal with leading zeros\n for(i = 0; input.at(i) === 0 && i < input.length() - 1; ++i) {\n output += first;\n }\n // convert digits to a string\n for(i = digits.length - 1; i >= 0; --i) {\n output += alphabet[digits[i]];\n }\n\n return output;\n}\n","/*\n Cipher base API.\n \n @author Dave Longley\n \n Copyright (c) 2010-2014 Digital Bazaar, Inc.\n /\nvar forge = require('./forge');\nrequire('./util');\n\nmodule.exports = forge.cipher = forge.cipher \|\| {};\n\n// registered algorithms\nforge.cipher.algorithms = forge.cipher.algorithms \|\| {};\n\n/\n Creates a cipher object that can be used to encrypt data using the given\n * algorithm and key. The algorithm may be provided as a string value for a\n * previously registered algorithm or it may be given as a cipher algorithm\n * API object.\n \n @param algorithm the algorithm to use, either a string or an algorithm API\n * object.\n * @param key the key to use, as a binary-encoded string of bytes or a\n * byte buffer.\n \n @return the cipher.\n /\nforge.cipher.createCipher = function(algorithm, key) {\n var api = algorithm;\n if(typeof api === 'string') {\n api = forge.cipher.getAlgorithm(api);\n if(api) {\n api = api();\n }\n }\n if(!api) {\n throw new Error('Unsupported algorithm: ' + algorithm);\n }\n\n // assume block cipher\n return new forge.cipher.BlockCipher({\n algorithm: api,\n key: key,\n decrypt: false\n });\n};\n\n/\n Creates a decipher object that can be used to decrypt data using the given\n * algorithm and key. The algorithm may be provided as a string value for a\n * previously registered algorithm or it may be given as a cipher algorithm\n * API object.\n \n @param algorithm the algorithm to use, either a string or an algorithm API\n * object.\n * @param key the key to use, as a binary-encoded string of bytes or a\n * byte buffer.\n \n @return the cipher.\n /\nforge.cipher.createDecipher = function(algorithm, key) {\n var api = algorithm;\n if(typeof api === 'string') {\n api = forge.cipher.getAlgorithm(api);\n if(api) {\n api = api();\n }\n }\n if(!api) {\n throw new Error('Unsupported algorithm: ' + algorithm);\n }\n\n // assume block cipher\n return new forge.cipher.BlockCipher({\n algorithm: api,\n key: key,\n decrypt: true\n });\n};\n\n/\n Registers an algorithm by name. If the name was already registered, the\n * algorithm API object will be overwritten.\n \n @param name the name of the algorithm.\n * @param algorithm the algorithm API object.\n /\nforge.cipher.registerAlgorithm = function(name, algorithm) {\n name = name.toUpperCase();\n forge.cipher.algorithms[name] = algorithm;\n};\n\n/\n Gets a registered algorithm by name.\n \n @param name the name of the algorithm.\n \n @return the algorithm, if found, null if not.\n /\nforge.cipher.getAlgorithm = function(name) {\n name = name.toUpperCase();\n if(name in forge.cipher.algorithms) {\n return forge.cipher.algorithms[name];\n }\n return null;\n};\n\nvar BlockCipher = forge.cipher.BlockCipher = function(options) {\n this.algorithm = options.algorithm;\n this.mode = this.algorithm.mode;\n this.blockSize = this.mode.blockSize;\n this._finish = false;\n this._input = null;\n this.output = null;\n this._op = options.decrypt ? this.mode.decrypt : this.mode.encrypt;\n this._decrypt = options.decrypt;\n this.algorithm.initialize(options);\n};\n\n/\n Starts or restarts the encryption or decryption process, whichever\n * was previously configured.\n \n For non-GCM mode, the IV may be a binary-encoded string of bytes, an array\n * of bytes, a byte buffer, or an array of 32-bit integers. If the IV is in\n * bytes, then it must be Nb (16) bytes in length. If the IV is given in as\n * 32-bit integers, then it must be 4 integers long.\n \n Note: an IV is not required or used in ECB mode.\n \n For GCM-mode, the IV must be given as a binary-encoded string of bytes or\n * a byte buffer. The number of bytes should be 12 (96 bits) as recommended\n * by NIST SP-800-38D but another length may be given.\n \n @param options the options to use:\n * iv the initialization vector to use as a binary-encoded string of\n * bytes, null to reuse the last ciphered block from a previous\n * update() (this \"residue\" method is for legacy support only).\n * additionalData additional authentication data as a binary-encoded\n * string of bytes, for 'GCM' mode, (default: none).\n * tagLength desired length of authentication tag, in bits, for\n * 'GCM' mode (0-128, default: 128).\n * tag the authentication tag to check if decrypting, as a\n * binary-encoded string of bytes.\n * output the output the buffer to write to, null to create one.\n /\nBlockCipher.prototype.start = function(options) {\n options = options \|\| {};\n var opts = {};\n for(var key in options) {\n opts[key] = options[key];\n }\n opts.decrypt = this._decrypt;\n this._finish = false;\n this._input = forge.util.createBuffer();\n this.output = options.output \|\| forge.util.createBuffer();\n this.mode.start(opts);\n};\n\n/\n Updates the next block according to the cipher mode.\n \n @param input the buffer to read from.\n /\nBlockCipher.prototype.update = function(input) {\n if(input) {\n // input given, so empty it into the input buffer\n this._input.putBuffer(input);\n }\n\n // do cipher operation until it needs more input and not finished\n while(!this._op.call(this.mode, this._input, this.output, this._finish) &&\n !this._finish) {}\n\n // free consumed memory from input buffer\n this._input.compact();\n};\n\n/\n Finishes encrypting or decrypting.\n \n @param pad a padding function to use in CBC mode, null for default,\n * signature(blockSize, buffer, decrypt).\n \n @return true if successful, false on error.\n /\nBlockCipher.prototype.finish = function(pad) {\n // backwards-compatibility w/deprecated padding API\n // Note: will overwrite padding functions even after another start() call\n if(pad && (this.mode.name === 'ECB' \|\| this.mode.name === 'CBC')) {\n this.mode.pad = function(input) {\n return pad(this.blockSize, input, false);\n };\n this.mode.unpad = function(output) {\n return pad(this.blockSize, output, true);\n };\n }\n\n // build options for padding and afterFinish functions\n var options = {};\n options.decrypt = this._decrypt;\n\n // get # of bytes that won't fill a block\n options.overflow = this._input.length() % this.blockSize;\n\n if(!this._decrypt && this.mode.pad) {\n if(!this.mode.pad(this._input, options)) {\n return false;\n }\n }\n\n // do final update\n this._finish = true;\n this.update();\n\n if(this._decrypt && this.mode.unpad) {\n if(!this.mode.unpad(this.output, options)) {\n return false;\n }\n }\n\n if(this.mode.afterFinish) {\n if(!this.mode.afterFinish(this.output, options)) {\n return false;\n }\n }\n\n return true;\n};\n","/\n Supported cipher modes.\n \n @author Dave Longley\n \n Copyright (c) 2010-2014 Digital Bazaar, Inc.\n /\nvar forge = require('./forge');\nrequire('./util');\n\nforge.cipher = forge.cipher \|\| {};\n\n// supported cipher modes\nvar modes = module.exports = forge.cipher.modes = forge.cipher.modes \|\| {};\n\n/* Electronic codebook (ECB) (Don't use this; it's not secure) /\n\nmodes.ecb = function(options) {\n options = options \|\| {};\n this.name = 'ECB';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = new Array(this._ints);\n this._outBlock = new Array(this._ints);\n};\n\nmodes.ecb.prototype.start = function(options) {};\n\nmodes.ecb.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n return true;\n }\n\n // get next block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = input.getInt32();\n }\n\n // encrypt block\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // write output\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._outBlock[i]);\n }\n};\n\nmodes.ecb.prototype.decrypt = function(input, output, finish) {\n // not enough input to decrypt\n if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n return true;\n }\n\n // get next block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = input.getInt32();\n }\n\n // decrypt block\n this.cipher.decrypt(this._inBlock, this._outBlock);\n\n // write output\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._outBlock[i]);\n }\n};\n\nmodes.ecb.prototype.pad = function(input, options) {\n // add PKCS#7 padding to block (each pad byte is the\n // value of the number of pad bytes)\n var padding = (input.length() === this.blockSize ?\n this.blockSize : (this.blockSize - input.length()));\n input.fillWithByte(padding, padding);\n return true;\n};\n\nmodes.ecb.prototype.unpad = function(output, options) {\n // check for error: input data not a multiple of blockSize\n if(options.overflow > 0) {\n return false;\n }\n\n // ensure padding byte count is valid\n var len = output.length();\n var count = output.at(len - 1);\n if(count > (this.blockSize << 2)) {\n return false;\n }\n\n // trim off padding bytes\n output.truncate(count);\n return true;\n};\n\n/ Cipher-block Chaining (CBC) /\n\nmodes.cbc = function(options) {\n options = options \|\| {};\n this.name = 'CBC';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = new Array(this._ints);\n this._outBlock = new Array(this._ints);\n};\n\nmodes.cbc.prototype.start = function(options) {\n // Note: legacy support for using IV residue (has security flaws)\n // if IV is null, reuse block from previous processing\n if(options.iv === null) {\n // must have a previous block\n if(!this._prev) {\n throw new Error('Invalid IV parameter.');\n }\n this._iv = this._prev.slice(0);\n } else if(!('iv' in options)) {\n throw new Error('Invalid IV parameter.');\n } else {\n // save IV as \"previous\" block\n this._iv = transformIV(options.iv, this.blockSize);\n this._prev = this._iv.slice(0);\n }\n};\n\nmodes.cbc.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n return true;\n }\n\n // get next block\n // CBC XOR's IV (or previous block) with plaintext\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = this._prev[i] ^ input.getInt32();\n }\n\n // encrypt block\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // write output, save previous block\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._outBlock[i]);\n }\n this._prev = this._outBlock;\n};\n\nmodes.cbc.prototype.decrypt = function(input, output, finish) {\n // not enough input to decrypt\n if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n return true;\n }\n\n // get next block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = input.getInt32();\n }\n\n // decrypt block\n this.cipher.decrypt(this._inBlock, this._outBlock);\n\n // write output, save previous ciphered block\n // CBC XOR's IV (or previous block) with ciphertext\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._prev[i] ^ this._outBlock[i]);\n }\n this._prev = this._inBlock.slice(0);\n};\n\nmodes.cbc.prototype.pad = function(input, options) {\n // add PKCS#7 padding to block (each pad byte is the\n // value of the number of pad bytes)\n var padding = (input.length() === this.blockSize ?\n this.blockSize : (this.blockSize - input.length()));\n input.fillWithByte(padding, padding);\n return true;\n};\n\nmodes.cbc.prototype.unpad = function(output, options) {\n // check for error: input data not a multiple of blockSize\n if(options.overflow > 0) {\n return false;\n }\n\n // ensure padding byte count is valid\n var len = output.length();\n var count = output.at(len - 1);\n if(count > (this.blockSize << 2)) {\n return false;\n }\n\n // trim off padding bytes\n output.truncate(count);\n return true;\n};\n\n/ Cipher feedback (CFB) /\n\nmodes.cfb = function(options) {\n options = options \|\| {};\n this.name = 'CFB';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = null;\n this._outBlock = new Array(this._ints);\n this._partialBlock = new Array(this._ints);\n this._partialOutput = forge.util.createBuffer();\n this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.start = function(options) {\n if(!('iv' in options)) {\n throw new Error('Invalid IV parameter.');\n }\n // use IV as first input\n this._iv = transformIV(options.iv, this.blockSize);\n this._inBlock = this._iv.slice(0);\n this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n var inputLength = input.length();\n if(inputLength === 0) {\n return true;\n }\n\n // encrypt block\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // handle full block\n if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n // XOR input with output, write input as output\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = input.getInt32() ^ this._outBlock[i];\n output.putInt32(this._inBlock[i]);\n }\n return;\n }\n\n // handle partial block\n var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n if(partialBytes > 0) {\n partialBytes = this.blockSize - partialBytes;\n }\n\n // XOR input with output, write input as partial output\n this._partialOutput.clear();\n for(var i = 0; i < this._ints; ++i) {\n this._partialBlock[i] = input.getInt32() ^ this._outBlock[i];\n this._partialOutput.putInt32(this._partialBlock[i]);\n }\n\n if(partialBytes > 0) {\n // block still incomplete, restore input buffer\n input.read -= this.blockSize;\n } else {\n // block complete, update input block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = this._partialBlock[i];\n }\n }\n\n // skip any previous partial bytes\n if(this._partialBytes > 0) {\n this._partialOutput.getBytes(this._partialBytes);\n }\n\n if(partialBytes > 0 && !finish) {\n output.putBytes(this._partialOutput.getBytes(\n partialBytes - this._partialBytes));\n this._partialBytes = partialBytes;\n return true;\n }\n\n output.putBytes(this._partialOutput.getBytes(\n inputLength - this._partialBytes));\n this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.decrypt = function(input, output, finish) {\n // not enough input to decrypt\n var inputLength = input.length();\n if(inputLength === 0) {\n return true;\n }\n\n // encrypt block (CFB always uses encryption mode)\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // handle full block\n if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n // XOR input with output, write input as output\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = input.getInt32();\n output.putInt32(this._inBlock[i] ^ this._outBlock[i]);\n }\n return;\n }\n\n // handle partial block\n var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n if(partialBytes > 0) {\n partialBytes = this.blockSize - partialBytes;\n }\n\n // XOR input with output, write input as partial output\n this._partialOutput.clear();\n for(var i = 0; i < this._ints; ++i) {\n this._partialBlock[i] = input.getInt32();\n this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]);\n }\n\n if(partialBytes > 0) {\n // block still incomplete, restore input buffer\n input.read -= this.blockSize;\n } else {\n // block complete, update input block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = this._partialBlock[i];\n }\n }\n\n // skip any previous partial bytes\n if(this._partialBytes > 0) {\n this._partialOutput.getBytes(this._partialBytes);\n }\n\n if(partialBytes > 0 && !finish) {\n output.putBytes(this._partialOutput.getBytes(\n partialBytes - this._partialBytes));\n this._partialBytes = partialBytes;\n return true;\n }\n\n output.putBytes(this._partialOutput.getBytes(\n inputLength - this._partialBytes));\n this._partialBytes = 0;\n};\n\n/ Output feedback (OFB) /\n\nmodes.ofb = function(options) {\n options = options \|\| {};\n this.name = 'OFB';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = null;\n this._outBlock = new Array(this._ints);\n this._partialOutput = forge.util.createBuffer();\n this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.start = function(options) {\n if(!('iv' in options)) {\n throw new Error('Invalid IV parameter.');\n }\n // use IV as first input\n this._iv = transformIV(options.iv, this.blockSize);\n this._inBlock = this._iv.slice(0);\n this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n var inputLength = input.length();\n if(input.length() === 0) {\n return true;\n }\n\n // encrypt block (OFB always uses encryption mode)\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // handle full block\n if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n // XOR input with output and update next input\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(input.getInt32() ^ this._outBlock[i]);\n this._inBlock[i] = this._outBlock[i];\n }\n return;\n }\n\n // handle partial block\n var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n if(partialBytes > 0) {\n partialBytes = this.blockSize - partialBytes;\n }\n\n // XOR input with output\n this._partialOutput.clear();\n for(var i = 0; i < this._ints; ++i) {\n this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n }\n\n if(partialBytes > 0) {\n // block still incomplete, restore input buffer\n input.read -= this.blockSize;\n } else {\n // block complete, update input block\n for(var i = 0; i < this._ints; ++i) {\n this._inBlock[i] = this._outBlock[i];\n }\n }\n\n // skip any previous partial bytes\n if(this._partialBytes > 0) {\n this._partialOutput.getBytes(this._partialBytes);\n }\n\n if(partialBytes > 0 && !finish) {\n output.putBytes(this._partialOutput.getBytes(\n partialBytes - this._partialBytes));\n this._partialBytes = partialBytes;\n return true;\n }\n\n output.putBytes(this._partialOutput.getBytes(\n inputLength - this._partialBytes));\n this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt;\n\n/ Counter (CTR) /\n\nmodes.ctr = function(options) {\n options = options \|\| {};\n this.name = 'CTR';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = null;\n this._outBlock = new Array(this._ints);\n this._partialOutput = forge.util.createBuffer();\n this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.start = function(options) {\n if(!('iv' in options)) {\n throw new Error('Invalid IV parameter.');\n }\n // use IV as first input\n this._iv = transformIV(options.iv, this.blockSize);\n this._inBlock = this._iv.slice(0);\n this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n var inputLength = input.length();\n if(inputLength === 0) {\n return true;\n }\n\n // encrypt block (CTR always uses encryption mode)\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // handle full block\n if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n // XOR input with output\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(input.getInt32() ^ this._outBlock[i]);\n }\n } else {\n // handle partial block\n var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n if(partialBytes > 0) {\n partialBytes = this.blockSize - partialBytes;\n }\n\n // XOR input with output\n this._partialOutput.clear();\n for(var i = 0; i < this._ints; ++i) {\n this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n }\n\n if(partialBytes > 0) {\n // block still incomplete, restore input buffer\n input.read -= this.blockSize;\n }\n\n // skip any previous partial bytes\n if(this._partialBytes > 0) {\n this._partialOutput.getBytes(this._partialBytes);\n }\n\n if(partialBytes > 0 && !finish) {\n output.putBytes(this._partialOutput.getBytes(\n partialBytes - this._partialBytes));\n this._partialBytes = partialBytes;\n return true;\n }\n\n output.putBytes(this._partialOutput.getBytes(\n inputLength - this._partialBytes));\n this._partialBytes = 0;\n }\n\n // block complete, increment counter (input block)\n inc32(this._inBlock);\n};\n\nmodes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt;\n\n/ Galois/Counter Mode (GCM) */\n\nmodes.gcm = function(options) {\n options = options \|\| {};\n this.name = 'GCM';\n this.cipher = options.cipher;\n this.blockSize = options.blockSize \|\| 16;\n this._ints = this.blockSize / 4;\n this._inBlock = new Array(this._ints);\n this._outBlock = new Array(this._ints);\n this._partialOutput = forge.util.createBuffer();\n this._partialBytes = 0;\n\n // R is actually this value concatenated with 120 more zero bits, but\n // we only XOR against R so the other zeros have no effect -- we just\n // apply this value to the first integer in a block\n this._R = 0xE1000000;\n};\n\nmodes.gcm.prototype.start = function(options) {\n if(!('iv' in options)) {\n throw new Error('Invalid IV parameter.');\n }\n // ensure IV is a byte buffer\n var iv = forge.util.createBuffer(options.iv);\n\n // no ciphered data processed yet\n this._cipherLength = 0;\n\n // default additional data is none\n var additionalData;\n if('additionalData' in options) {\n additionalData = forge.util.createBuffer(options.additionalData);\n } else {\n additionalData = forge.util.createBuffer();\n }\n\n // default tag length is 128 bits\n if('tagLength' in options) {\n this._tagLength = options.tagLength;\n } else {\n this._tagLength = 128;\n }\n\n // if tag is given, ensure tag matches tag length\n this._tag = null;\n if(options.decrypt) {\n // save tag to check later\n this._tag = forge.util.createBuffer(options.tag).getBytes();\n if(this._tag.length !== (this._tagLength / 8)) {\n throw new Error('Authentication tag does not match tag length.');\n }\n }\n\n // create tmp storage for hash calculation\n this._hashBlock = new Array(this._ints);\n\n // no tag generated yet\n this.tag = null;\n\n // generate hash subkey\n // (apply block cipher to \"zero\" block)\n this._hashSubkey = new Array(this._ints);\n this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey);\n\n // generate table M\n // use 4-bit tables (32 component decomposition of a 16 byte value)\n // 8-bit tables take more space and are known to have security\n // vulnerabilities (in native implementations)\n this.componentBits = 4;\n this._m = this.generateHashTable(this._hashSubkey, this.componentBits);\n\n // Note: support IV length different from 96 bits? (only supporting\n // 96 bits is recommended by NIST SP-800-38D)\n // generate J_0\n var ivLength = iv.length();\n if(ivLength === 12) {\n // 96-bit IV\n this._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1];\n } else {\n // IV is NOT 96-bits\n this._j0 = [0, 0, 0, 0];\n while(iv.length() > 0) {\n this._j0 = this.ghash(\n this._hashSubkey, this._j0,\n [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]);\n }\n this._j0 = this.ghash(\n this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength 8)));\n }\n\n // generate ICB (initial counter block)\n this._inBlock = this._j0.slice(0);\n inc32(this._inBlock);\n this._partialBytes = 0;\n\n // consume authentication data\n additionalData = forge.util.createBuffer(additionalData);\n // save additional data length as a BE 64-bit number\n this._aDataLength = from64To32(additionalData.length() * 8);\n // pad additional data to 128 bit (16 byte) block size\n var overflow = additionalData.length() % this.blockSize;\n if(overflow) {\n additionalData.fillWithByte(0, this.blockSize - overflow);\n }\n this._s = [0, 0, 0, 0];\n while(additionalData.length() > 0) {\n this._s = this.ghash(this._hashSubkey, this._s, [\n additionalData.getInt32(),\n additionalData.getInt32(),\n additionalData.getInt32(),\n additionalData.getInt32()\n ]);\n }\n};\n\nmodes.gcm.prototype.encrypt = function(input, output, finish) {\n // not enough input to encrypt\n var inputLength = input.length();\n if(inputLength === 0) {\n return true;\n }\n\n // encrypt block\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // handle full block\n if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n // XOR input with output\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._outBlock[i] ^= input.getInt32());\n }\n this._cipherLength += this.blockSize;\n } else {\n // handle partial block\n var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n if(partialBytes > 0) {\n partialBytes = this.blockSize - partialBytes;\n }\n\n // XOR input with output\n this._partialOutput.clear();\n for(var i = 0; i < this._ints; ++i) {\n this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n }\n\n if(partialBytes <= 0 \|\| finish) {\n // handle overflow prior to hashing\n if(finish) {\n // get block overflow\n var overflow = inputLength % this.blockSize;\n this._cipherLength += overflow;\n // truncate for hash function\n this._partialOutput.truncate(this.blockSize - overflow);\n } else {\n this._cipherLength += this.blockSize;\n }\n\n // get output block for hashing\n for(var i = 0; i < this._ints; ++i) {\n this._outBlock[i] = this._partialOutput.getInt32();\n }\n this._partialOutput.read -= this.blockSize;\n }\n\n // skip any previous partial bytes\n if(this._partialBytes > 0) {\n this._partialOutput.getBytes(this._partialBytes);\n }\n\n if(partialBytes > 0 && !finish) {\n // block still incomplete, restore input buffer, get partial output,\n // and return early\n input.read -= this.blockSize;\n output.putBytes(this._partialOutput.getBytes(\n partialBytes - this._partialBytes));\n this._partialBytes = partialBytes;\n return true;\n }\n\n output.putBytes(this._partialOutput.getBytes(\n inputLength - this._partialBytes));\n this._partialBytes = 0;\n }\n\n // update hash block S\n this._s = this.ghash(this._hashSubkey, this._s, this._outBlock);\n\n // increment counter (input block)\n inc32(this._inBlock);\n};\n\nmodes.gcm.prototype.decrypt = function(input, output, finish) {\n // not enough input to decrypt\n var inputLength = input.length();\n if(inputLength < this.blockSize && !(finish && inputLength > 0)) {\n return true;\n }\n\n // encrypt block (GCM always uses encryption mode)\n this.cipher.encrypt(this._inBlock, this._outBlock);\n\n // increment counter (input block)\n inc32(this._inBlock);\n\n // update hash block S\n this._hashBlock[0] = input.getInt32();\n this._hashBlock[1] = input.getInt32();\n this._hashBlock[2] = input.getInt32();\n this._hashBlock[3] = input.getInt32();\n this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock);\n\n // XOR hash input with output\n for(var i = 0; i < this._ints; ++i) {\n output.putInt32(this._outBlock[i] ^ this._hashBlock[i]);\n }\n\n // increment cipher data length\n if(inputLength < this.blockSize) {\n this._cipherLength += inputLength % this.blockSize;\n } else {\n this._cipherLength += this.blockSize;\n }\n};\n\nmodes.gcm.prototype.afterFinish = function(output, options) {\n var rval = true;\n\n // handle overflow\n if(options.decrypt && options.overflow) {\n output.truncate(this.blockSize - options.overflow);\n }\n\n // handle authentication tag\n this.tag = forge.util.createBuffer();\n\n // concatenate additional data length with cipher length\n var lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8));\n\n // include lengths in hash\n this._s = this.ghash(this._hashSubkey, this._s, lengths);\n\n // do GCTR(J_0, S)\n var tag = [];\n this.cipher.encrypt(this._j0, tag);\n for(var i = 0; i < this._ints; ++i) {\n this.tag.putInt32(this._s[i] ^ tag[i]);\n }\n\n // trim tag to length\n this.tag.truncate(this.tag.length() % (this._tagLength / 8));\n\n // check authentication tag\n if(options.decrypt && this.tag.bytes() !== this._tag) {\n rval = false;\n }\n\n return rval;\n};\n\n/*\n See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois\n * field multiplication. The field, GF(2^128), is defined by the polynomial:\n \n x^128 + x^7 + x^2 + x + 1\n \n Which is represented in little-endian binary form as: 11100001 (0xe1). When\n * the value of a coefficient is 1, a bit is set. The value R, is the\n * concatenation of this value and 120 zero bits, yielding a 128-bit value\n * which matches the block size.\n \n This function will multiply two elements (vectors of bytes), X and Y, in\n * the field GF(2^128). The result is initialized to zero. For each bit of\n * X (out of 128), x_i, if x_i is set, then the result is multiplied (XOR'd)\n * by the current value of Y. For each bit, the value of Y will be raised by\n * a power of x (multiplied by the polynomial x). This can be achieved by\n * shifting Y once to the right. If the current value of Y, prior to being\n * multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial.\n * Otherwise, we must divide by R after shifting to find the remainder.\n \n @param x the first block to multiply by the second.\n * @param y the second block to multiply by the first.\n \n @return the block result of the multiplication.\n /\nmodes.gcm.prototype.multiply = function(x, y) {\n var z_i = [0, 0, 0, 0];\n var v_i = y.slice(0);\n\n // calculate Z_128 (block has 128 bits)\n for(var i = 0; i < 128; ++i) {\n // if x_i is 0, Z_{i+1} = Z_i (unchanged)\n // else Z_{i+1} = Z_i ^ V_i\n // get x_i by finding 32-bit int position, then left shift 1 by remainder\n var x_i = x[(i / 32) \| 0] & (1 << (31 - i % 32));\n if(x_i) {\n z_i[0] ^= v_i[0];\n z_i[1] ^= v_i[1];\n z_i[2] ^= v_i[2];\n z_i[3] ^= v_i[3];\n }\n\n // if LSB(V_i) is 1, V_i = V_i >> 1\n // else V_i = (V_i >> 1) ^ R\n this.pow(v_i, v_i);\n }\n\n return z_i;\n};\n\nmodes.gcm.prototype.pow = function(x, out) {\n // if LSB(x) is 1, x = x >>> 1\n // else x = (x >>> 1) ^ R\n var lsb = x[3] & 1;\n\n // always do x >>> 1:\n // starting with the rightmost integer, shift each integer to the right\n // one bit, pulling in the bit from the integer to the left as its top\n // most bit (do this for the last 3 integers)\n for(var i = 3; i > 0; --i) {\n out[i] = (x[i] >>> 1) \| ((x[i - 1] & 1) << 31);\n }\n // shift the first integer normally\n out[0] = x[0] >>> 1;\n\n // if lsb was not set, then polynomial had a degree of 127 and doesn't\n // need to divided; otherwise, XOR with R to find the remainder; we only\n // need to XOR the first integer since R technically ends w/120 zero bits\n if(lsb) {\n out[0] ^= this._R;\n }\n};\n\nmodes.gcm.prototype.tableMultiply = function(x) {\n // assumes 4-bit tables are used\n var z = [0, 0, 0, 0];\n for(var i = 0; i < 32; ++i) {\n var idx = (i / 8) \| 0;\n var x_i = (x[idx] >>> ((7 - (i % 8)) 4)) & 0xF;\n var ah = this._m[i][x_i];\n z[0] ^= ah[0];\n z[1] ^= ah[1];\n z[2] ^= ah[2];\n z[3] ^= ah[3];\n }\n return z;\n};\n\n/*\n A continuing version of the GHASH algorithm that operates on a single\n * block. The hash block, last hash value (Ym) and the new block to hash\n * are given.\n \n @param h the hash block.\n * @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash.\n * @param x the block to hash.\n \n @return the hashed value (Ym).\n /\nmodes.gcm.prototype.ghash = function(h, y, x) {\n y[0] ^= x[0];\n y[1] ^= x[1];\n y[2] ^= x[2];\n y[3] ^= x[3];\n return this.tableMultiply(y);\n //return this.multiply(y, h);\n};\n\n/\n Precomputes a table for multiplying against the hash subkey. This\n * mechanism provides a substantial speed increase over multiplication\n * performed without a table. The table-based multiplication this table is\n * for solves X * H by multiplying each component of X by H and then\n * composing the results together using XOR.\n \n This function can be used to generate tables with different bit sizes\n * for the components, however, this implementation assumes there are\n * 32 components of X (which is a 16 byte vector), therefore each component\n * takes 4-bits (so the table is constructed with bits=4).\n \n @param h the hash subkey.\n * @param bits the bit size for a component.\n /\nmodes.gcm.prototype.generateHashTable = function(h, bits) {\n // TODO: There are further optimizations that would use only the\n // first table M_0 (or some variant) along with a remainder table;\n // this can be explored in the future\n var multiplier = 8 / bits;\n var perInt = 4 multiplier;\n var size = 16 * multiplier;\n var m = new Array(size);\n for(var i = 0; i < size; ++i) {\n var tmp = [0, 0, 0, 0];\n var idx = (i / perInt) \| 0;\n var shft = ((perInt - 1 - (i % perInt)) * bits);\n tmp[idx] = (1 << (bits - 1)) << shft;\n m[i] = this.generateSubHashTable(this.multiply(tmp, h), bits);\n }\n return m;\n};\n\n/*\n Generates a table for multiplying against the hash subkey for one\n * particular component (out of all possible component values).\n \n @param mid the pre-multiplied value for the middle key of the table.\n * @param bits the bit size for a component.\n /\nmodes.gcm.prototype.generateSubHashTable = function(mid, bits) {\n // compute the table quickly by minimizing the number of\n // POW operations -- they only need to be performed for powers of 2,\n // all other entries can be composed from those powers using XOR\n var size = 1 << bits;\n var half = size >>> 1;\n var m = new Array(size);\n m[half] = mid.slice(0);\n var i = half >>> 1;\n while(i > 0) {\n // raise m0[2 i] and store in m0[i]\n this.pow(m[2 * i], m[i] = []);\n i >>= 1;\n }\n i = 2;\n while(i < half) {\n for(var j = 1; j < i; ++j) {\n var m_i = m[i];\n var m_j = m[j];\n m[i + j] = [\n m_i[0] ^ m_j[0],\n m_i[1] ^ m_j[1],\n m_i[2] ^ m_j[2],\n m_i[3] ^ m_j[3]\n ];\n }\n i = 2;\n }\n m[0] = [0, 0, 0, 0];\n / Note: We could avoid storing these by doing composition during multiply\n calculate top half using composition by speed is preferred. /\n for(i = half + 1; i < size; ++i) {\n var c = m[i ^ half];\n m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]];\n }\n return m;\n};\n\n/* Utility functions /\n\nfunction transformIV(iv, blockSize) {\n if(typeof iv === 'string') {\n // convert iv string into byte buffer\n iv = forge.util.createBuffer(iv);\n }\n\n if(forge.util.isArray(iv) && iv.length > 4) {\n // convert iv byte array into byte buffer\n var tmp = iv;\n iv = forge.util.createBuffer();\n for(var i = 0; i < tmp.length; ++i) {\n iv.putByte(tmp[i]);\n }\n }\n\n if(iv.length() < blockSize) {\n throw new Error(\n 'Invalid IV length; got ' + iv.length() +\n ' bytes and expected ' + blockSize + ' bytes.');\n }\n\n if(!forge.util.isArray(iv)) {\n // convert iv byte buffer into 32-bit integer array\n var ints = [];\n var blocks = blockSize / 4;\n for(var i = 0; i < blocks; ++i) {\n ints.push(iv.getInt32());\n }\n iv = ints;\n }\n\n return iv;\n}\n\nfunction inc32(block) {\n // increment last 32 bits of block only\n block[block.length - 1] = (block[block.length - 1] + 1) & 0xFFFFFFFF;\n}\n\nfunction from64To32(num) {\n // convert 64-bit number to two BE Int32s\n return [(num / 0x100000000) \| 0, num & 0xFFFFFFFF];\n}\n","/\n Node.js module for Forge.\n \n @author Dave Longley\n \n Copyright 2011-2016 Digital Bazaar, Inc.\n /\nmodule.exports = {\n // default options\n options: {\n usePureJavaScript: false\n }\n};\n","/\n Utility functions for web applications.\n \n @author Dave Longley\n \n Copyright (c) 2010-2018 Digital Bazaar, Inc.\n /\nvar forge = require('./forge');\nvar baseN = require('./baseN');\n\n/ Utilities API /\nvar util = module.exports = forge.util = forge.util \|\| {};\n\n// define setImmediate and nextTick\n(function() {\n // use native nextTick (unless we're in webpack)\n // webpack (or better node-libs-browser polyfill) sets process.browser.\n // this way we can detect webpack properly\n if(typeof process !== 'undefined' && process.nextTick && !process.browser) {\n util.nextTick = process.nextTick;\n if(typeof setImmediate === 'function') {\n util.setImmediate = setImmediate;\n } else {\n // polyfill setImmediate with nextTick, older versions of node\n // (those w/o setImmediate) won't totally starve IO\n util.setImmediate = util.nextTick;\n }\n return;\n }\n\n // polyfill nextTick with native setImmediate\n if(typeof setImmediate === 'function') {\n util.setImmediate = function() { return setImmediate.apply(undefined, arguments); };\n util.nextTick = function(callback) {\n return setImmediate(callback);\n };\n return;\n }\n\n / Note: A polyfill upgrade pattern is used here to allow combining\n polyfills. For example, MutationObserver is fast, but blocks UI updates,\n so it needs to allow UI updates periodically, so it falls back on\n postMessage or setTimeout. /\n\n // polyfill with setTimeout\n util.setImmediate = function(callback) {\n setTimeout(callback, 0);\n };\n\n // upgrade polyfill to use postMessage\n if(typeof window !== 'undefined' &&\n typeof window.postMessage === 'function') {\n var msg = 'forge.setImmediate';\n var callbacks = [];\n util.setImmediate = function(callback) {\n callbacks.push(callback);\n // only send message when one hasn't been sent in\n // the current turn of the event loop\n if(callbacks.length === 1) {\n window.postMessage(msg, '');\n }\n };\n function handler(event) {\n if(event.source === window && event.data === msg) {\n event.stopPropagation();\n var copy = callbacks.slice();\n callbacks.length = 0;\n copy.forEach(function(callback) {\n callback();\n });\n }\n }\n window.addEventListener('message', handler, true);\n }\n\n // upgrade polyfill to use MutationObserver\n if(typeof MutationObserver !== 'undefined') {\n // polyfill with MutationObserver\n var now = Date.now();\n var attr = true;\n var div = document.createElement('div');\n var callbacks = [];\n new MutationObserver(function() {\n var copy = callbacks.slice();\n callbacks.length = 0;\n copy.forEach(function(callback) {\n callback();\n });\n }).observe(div, {attributes: true});\n var oldSetImmediate = util.setImmediate;\n util.setImmediate = function(callback) {\n if(Date.now() - now > 15) {\n now = Date.now();\n oldSetImmediate(callback);\n } else {\n callbacks.push(callback);\n // only trigger observer when it hasn't been triggered in\n // the current turn of the event loop\n if(callbacks.length === 1) {\n div.setAttribute('a', attr = !attr);\n }\n }\n };\n }\n\n util.nextTick = util.setImmediate;\n})();\n\n// check if running under Node.js\nutil.isNodejs =\n typeof process !== 'undefined' && process.versions && process.versions.node;\n\n\n// 'self' will also work in Web Workers (instance of WorkerGlobalScope) while\n// it will point to `window` in the main thread.\n// To remain compatible with older browsers, we fall back to 'window' if 'self'\n// is not available.\nutil.globalScope = (function() {\n if(util.isNodejs) {\n return global;\n }\n\n return typeof self === 'undefined' ? window : self;\n})();\n\n// define isArray\nutil.isArray = Array.isArray \|\| function(x) {\n return Object.prototype.toString.call(x) === '[object Array]';\n};\n\n// define isArrayBuffer\nutil.isArrayBuffer = function(x) {\n return typeof ArrayBuffer !== 'undefined' && x instanceof ArrayBuffer;\n};\n\n// define isArrayBufferView\nutil.isArrayBufferView = function(x) {\n return x && util.isArrayBuffer(x.buffer) && x.byteLength !== undefined;\n};\n\n/*\n Ensure a bits param is 8, 16, 24, or 32. Used to validate input for\n * algorithms where bit manipulation, JavaScript limitations, and/or algorithm\n * design only allow for byte operations of a limited size.\n \n @param n number of bits.\n \n Throw Error if n invalid.\n /\nfunction _checkBitsParam(n) {\n if(!(n === 8 \|\| n === 16 \|\| n === 24 \|\| n === 32)) {\n throw new Error('Only 8, 16, 24, or 32 bits supported: ' + n);\n }\n}\n\n// TODO: set ByteBuffer to best available backing\nutil.ByteBuffer = ByteStringBuffer;\n\n/* Buffer w/BinaryString backing /\n\n/\n Constructor for a binary string backed byte buffer.\n \n @param [b] the bytes to wrap (either encoded as string, one byte per\n * character, or as an ArrayBuffer or Typed Array).\n /\nfunction ByteStringBuffer(b) {\n // TODO: update to match DataBuffer API\n\n // the data in this buffer\n this.data = '';\n // the pointer for reading from this buffer\n this.read = 0;\n\n if(typeof b === 'string') {\n this.data = b;\n } else if(util.isArrayBuffer(b) \|\| util.isArrayBufferView(b)) {\n if(typeof Buffer !== 'undefined' && b instanceof Buffer) {\n this.data = b.toString('binary');\n } else {\n // convert native buffer to forge buffer\n // FIXME: support native buffers internally instead\n var arr = new Uint8Array(b);\n try {\n this.data = String.fromCharCode.apply(null, arr);\n } catch(e) {\n for(var i = 0; i < arr.length; ++i) {\n this.putByte(arr[i]);\n }\n }\n }\n } else if(b instanceof ByteStringBuffer \|\|\n (typeof b === 'object' && typeof b.data === 'string' &&\n typeof b.read === 'number')) {\n // copy existing buffer\n this.data = b.data;\n this.read = b.read;\n }\n\n // used for v8 optimization\n this._constructedStringLength = 0;\n}\nutil.ByteStringBuffer = ByteStringBuffer;\n\n/ Note: This is an optimization for V8-based browsers. When V8 concatenates\n a string, the strings are only joined logically using a \"cons string\" or\n \"constructed/concatenated string\". These containers keep references to one\n another and can result in very large memory usage. For example, if a 2MB\n string is constructed by concatenating 4 bytes together at a time, the\n memory usage will be ~44MB; so ~22x increase. The strings are only joined\n together when an operation requiring their joining takes place, such as\n substr(). This function is called when adding data to this buffer to ensure\n these types of strings are periodically joined to reduce the memory\n footprint. /\nvar _MAX_CONSTRUCTED_STRING_LENGTH = 4096;\nutil.ByteStringBuffer.prototype._optimizeConstructedString = function(x) {\n this._constructedStringLength += x;\n if(this._constructedStringLength > _MAX_CONSTRUCTED_STRING_LENGTH) {\n // this substr() should cause the constructed string to join\n this.data.substr(0, 1);\n this._constructedStringLength = 0;\n }\n};\n\n/\n Gets the number of bytes in this buffer.\n \n @return the number of bytes in this buffer.\n /\nutil.ByteStringBuffer.prototype.length = function() {\n return this.data.length - this.read;\n};\n\n/\n Gets whether or not this buffer is empty.\n \n @return true if this buffer is empty, false if not.\n /\nutil.ByteStringBuffer.prototype.isEmpty = function() {\n return this.length() <= 0;\n};\n\n/\n Puts a byte in this buffer.\n \n @param b the byte to put.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putByte = function(b) {\n return this.putBytes(String.fromCharCode(b));\n};\n\n/\n Puts a byte in this buffer N times.\n \n @param b the byte to put.\n * @param n the number of bytes of value b to put.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.fillWithByte = function(b, n) {\n b = String.fromCharCode(b);\n var d = this.data;\n while(n > 0) {\n if(n & 1) {\n d += b;\n }\n n >>>= 1;\n if(n > 0) {\n b += b;\n }\n }\n this.data = d;\n this._optimizeConstructedString(n);\n return this;\n};\n\n/\n Puts bytes in this buffer.\n \n @param bytes the bytes (as a binary encoded string) to put.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putBytes = function(bytes) {\n this.data += bytes;\n this._optimizeConstructedString(bytes.length);\n return this;\n};\n\n/\n Puts a UTF-16 encoded string into this buffer.\n \n @param str the string to put.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putString = function(str) {\n return this.putBytes(util.encodeUtf8(str));\n};\n\n/\n Puts a 16-bit integer in this buffer in big-endian order.\n \n @param i the 16-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt16 = function(i) {\n return this.putBytes(\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i & 0xFF));\n};\n\n/\n Puts a 24-bit integer in this buffer in big-endian order.\n \n @param i the 24-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt24 = function(i) {\n return this.putBytes(\n String.fromCharCode(i >> 16 & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i & 0xFF));\n};\n\n/\n Puts a 32-bit integer in this buffer in big-endian order.\n \n @param i the 32-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt32 = function(i) {\n return this.putBytes(\n String.fromCharCode(i >> 24 & 0xFF) +\n String.fromCharCode(i >> 16 & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i & 0xFF));\n};\n\n/\n Puts a 16-bit integer in this buffer in little-endian order.\n \n @param i the 16-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt16Le = function(i) {\n return this.putBytes(\n String.fromCharCode(i & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF));\n};\n\n/\n Puts a 24-bit integer in this buffer in little-endian order.\n \n @param i the 24-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt24Le = function(i) {\n return this.putBytes(\n String.fromCharCode(i & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i >> 16 & 0xFF));\n};\n\n/\n Puts a 32-bit integer in this buffer in little-endian order.\n \n @param i the 32-bit integer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt32Le = function(i) {\n return this.putBytes(\n String.fromCharCode(i & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i >> 16 & 0xFF) +\n String.fromCharCode(i >> 24 & 0xFF));\n};\n\n/\n Puts an n-bit integer in this buffer in big-endian order.\n \n @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putInt = function(i, n) {\n _checkBitsParam(n);\n var bytes = '';\n do {\n n -= 8;\n bytes += String.fromCharCode((i >> n) & 0xFF);\n } while(n > 0);\n return this.putBytes(bytes);\n};\n\n/\n Puts a signed n-bit integer in this buffer in big-endian order. Two's\n * complement representation is used.\n \n @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putSignedInt = function(i, n) {\n // putInt checks n\n if(i < 0) {\n i += 2 << (n - 1);\n }\n return this.putInt(i, n);\n};\n\n/\n Puts the given buffer into this buffer.\n \n @param buffer the buffer to put into this one.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.putBuffer = function(buffer) {\n return this.putBytes(buffer.getBytes());\n};\n\n/\n Gets a byte from this buffer and advances the read pointer by 1.\n \n @return the byte.\n /\nutil.ByteStringBuffer.prototype.getByte = function() {\n return this.data.charCodeAt(this.read++);\n};\n\n/\n Gets a uint16 from this buffer in big-endian order and advances the read\n * pointer by 2.\n \n @return the uint16.\n /\nutil.ByteStringBuffer.prototype.getInt16 = function() {\n var rval = (\n this.data.charCodeAt(this.read) << 8 ^\n this.data.charCodeAt(this.read + 1));\n this.read += 2;\n return rval;\n};\n\n/\n Gets a uint24 from this buffer in big-endian order and advances the read\n * pointer by 3.\n \n @return the uint24.\n /\nutil.ByteStringBuffer.prototype.getInt24 = function() {\n var rval = (\n this.data.charCodeAt(this.read) << 16 ^\n this.data.charCodeAt(this.read + 1) << 8 ^\n this.data.charCodeAt(this.read + 2));\n this.read += 3;\n return rval;\n};\n\n/\n Gets a uint32 from this buffer in big-endian order and advances the read\n * pointer by 4.\n \n @return the word.\n /\nutil.ByteStringBuffer.prototype.getInt32 = function() {\n var rval = (\n this.data.charCodeAt(this.read) << 24 ^\n this.data.charCodeAt(this.read + 1) << 16 ^\n this.data.charCodeAt(this.read + 2) << 8 ^\n this.data.charCodeAt(this.read + 3));\n this.read += 4;\n return rval;\n};\n\n/\n Gets a uint16 from this buffer in little-endian order and advances the read\n * pointer by 2.\n \n @return the uint16.\n /\nutil.ByteStringBuffer.prototype.getInt16Le = function() {\n var rval = (\n this.data.charCodeAt(this.read) ^\n this.data.charCodeAt(this.read + 1) << 8);\n this.read += 2;\n return rval;\n};\n\n/\n Gets a uint24 from this buffer in little-endian order and advances the read\n * pointer by 3.\n \n @return the uint24.\n /\nutil.ByteStringBuffer.prototype.getInt24Le = function() {\n var rval = (\n this.data.charCodeAt(this.read) ^\n this.data.charCodeAt(this.read + 1) << 8 ^\n this.data.charCodeAt(this.read + 2) << 16);\n this.read += 3;\n return rval;\n};\n\n/\n Gets a uint32 from this buffer in little-endian order and advances the read\n * pointer by 4.\n \n @return the word.\n /\nutil.ByteStringBuffer.prototype.getInt32Le = function() {\n var rval = (\n this.data.charCodeAt(this.read) ^\n this.data.charCodeAt(this.read + 1) << 8 ^\n this.data.charCodeAt(this.read + 2) << 16 ^\n this.data.charCodeAt(this.read + 3) << 24);\n this.read += 4;\n return rval;\n};\n\n/\n Gets an n-bit integer from this buffer in big-endian order and advances the\n * read pointer by ceil(n/8).\n \n @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return the integer.\n /\nutil.ByteStringBuffer.prototype.getInt = function(n) {\n _checkBitsParam(n);\n var rval = 0;\n do {\n // TODO: Use (rval 0x100) if adding support for 33 to 53 bits.\n rval = (rval << 8) + this.data.charCodeAt(this.read++);\n n -= 8;\n } while(n > 0);\n return rval;\n};\n\n/*\n Gets a signed n-bit integer from this buffer in big-endian order, using\n * two's complement, and advances the read pointer by n/8.\n \n @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return the integer.\n /\nutil.ByteStringBuffer.prototype.getSignedInt = function(n) {\n // getInt checks n\n var x = this.getInt(n);\n var max = 2 << (n - 2);\n if(x >= max) {\n x -= max << 1;\n }\n return x;\n};\n\n/\n Reads bytes out as a binary encoded string and clears them from the\n * buffer. Note that the resulting string is binary encoded (in node.js this\n * encoding is referred to as `binary`, it is not `utf8`).\n \n @param count the number of bytes to read, undefined or null for all.\n \n @return a binary encoded string of bytes.\n /\nutil.ByteStringBuffer.prototype.getBytes = function(count) {\n var rval;\n if(count) {\n // read count bytes\n count = Math.min(this.length(), count);\n rval = this.data.slice(this.read, this.read + count);\n this.read += count;\n } else if(count === 0) {\n rval = '';\n } else {\n // read all bytes, optimize to only copy when needed\n rval = (this.read === 0) ? this.data : this.data.slice(this.read);\n this.clear();\n }\n return rval;\n};\n\n/\n Gets a binary encoded string of the bytes from this buffer without\n * modifying the read pointer.\n \n @param count the number of bytes to get, omit to get all.\n \n @return a string full of binary encoded characters.\n /\nutil.ByteStringBuffer.prototype.bytes = function(count) {\n return (typeof(count) === 'undefined' ?\n this.data.slice(this.read) :\n this.data.slice(this.read, this.read + count));\n};\n\n/\n Gets a byte at the given index without modifying the read pointer.\n \n @param i the byte index.\n \n @return the byte.\n /\nutil.ByteStringBuffer.prototype.at = function(i) {\n return this.data.charCodeAt(this.read + i);\n};\n\n/\n Puts a byte at the given index without modifying the read pointer.\n \n @param i the byte index.\n * @param b the byte to put.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.setAt = function(i, b) {\n this.data = this.data.substr(0, this.read + i) +\n String.fromCharCode(b) +\n this.data.substr(this.read + i + 1);\n return this;\n};\n\n/\n Gets the last byte without modifying the read pointer.\n \n @return the last byte.\n /\nutil.ByteStringBuffer.prototype.last = function() {\n return this.data.charCodeAt(this.data.length - 1);\n};\n\n/\n Creates a copy of this buffer.\n \n @return the copy.\n /\nutil.ByteStringBuffer.prototype.copy = function() {\n var c = util.createBuffer(this.data);\n c.read = this.read;\n return c;\n};\n\n/\n Compacts this buffer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.compact = function() {\n if(this.read > 0) {\n this.data = this.data.slice(this.read);\n this.read = 0;\n }\n return this;\n};\n\n/\n Clears this buffer.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.clear = function() {\n this.data = '';\n this.read = 0;\n return this;\n};\n\n/\n Shortens this buffer by triming bytes off of the end of this buffer.\n \n @param count the number of bytes to trim off.\n \n @return this buffer.\n /\nutil.ByteStringBuffer.prototype.truncate = function(count) {\n var len = Math.max(0, this.length() - count);\n this.data = this.data.substr(this.read, len);\n this.read = 0;\n return this;\n};\n\n/\n Converts this buffer to a hexadecimal string.\n \n @return a hexadecimal string.\n /\nutil.ByteStringBuffer.prototype.toHex = function() {\n var rval = '';\n for(var i = this.read; i < this.data.length; ++i) {\n var b = this.data.charCodeAt(i);\n if(b < 16) {\n rval += '0';\n }\n rval += b.toString(16);\n }\n return rval;\n};\n\n/\n Converts this buffer to a UTF-16 string (standard JavaScript string).\n \n @return a UTF-16 string.\n /\nutil.ByteStringBuffer.prototype.toString = function() {\n return util.decodeUtf8(this.bytes());\n};\n\n/* End Buffer w/BinaryString backing /\n\n/* Buffer w/UInt8Array backing /\n\n/\n FIXME: Experimental. Do not use yet.\n \n Constructor for an ArrayBuffer-backed byte buffer.\n \n The buffer may be constructed from a string, an ArrayBuffer, DataView, or a\n * TypedArray.\n \n If a string is given, its encoding should be provided as an option,\n * otherwise it will default to 'binary'. A 'binary' string is encoded such\n * that each character is one byte in length and size.\n \n If an ArrayBuffer, DataView, or TypedArray is given, it will be used\n * directly without any copying. Note that, if a write to the buffer requires\n * more space, the buffer will allocate a new backing ArrayBuffer to\n * accommodate. The starting read and write offsets for the buffer may be\n * given as options.\n \n @param [b] the initial bytes for this buffer.\n * @param options the options to use:\n * [readOffset] the starting read offset to use (default: 0).\n * [writeOffset] the starting write offset to use (default: the\n * length of the first parameter).\n * [growSize] the minimum amount, in bytes, to grow the buffer by to\n * accommodate writes (default: 1024).\n * [encoding] the encoding ('binary', 'utf8', 'utf16', 'hex') for the\n * first parameter, if it is a string (default: 'binary').\n /\nfunction DataBuffer(b, options) {\n // default options\n options = options \|\| {};\n\n // pointers for read from/write to buffer\n this.read = options.readOffset \|\| 0;\n this.growSize = options.growSize \|\| 1024;\n\n var isArrayBuffer = util.isArrayBuffer(b);\n var isArrayBufferView = util.isArrayBufferView(b);\n if(isArrayBuffer \|\| isArrayBufferView) {\n // use ArrayBuffer directly\n if(isArrayBuffer) {\n this.data = new DataView(b);\n } else {\n // TODO: adjust read/write offset based on the type of view\n // or specify that this must be done in the options ... that the\n // offsets are byte-based\n this.data = new DataView(b.buffer, b.byteOffset, b.byteLength);\n }\n this.write = ('writeOffset' in options ?\n options.writeOffset : this.data.byteLength);\n return;\n }\n\n // initialize to empty array buffer and add any given bytes using putBytes\n this.data = new DataView(new ArrayBuffer(0));\n this.write = 0;\n\n if(b !== null && b !== undefined) {\n this.putBytes(b);\n }\n\n if('writeOffset' in options) {\n this.write = options.writeOffset;\n }\n}\nutil.DataBuffer = DataBuffer;\n\n/\n Gets the number of bytes in this buffer.\n \n @return the number of bytes in this buffer.\n /\nutil.DataBuffer.prototype.length = function() {\n return this.write - this.read;\n};\n\n/\n Gets whether or not this buffer is empty.\n \n @return true if this buffer is empty, false if not.\n /\nutil.DataBuffer.prototype.isEmpty = function() {\n return this.length() <= 0;\n};\n\n/\n Ensures this buffer has enough empty space to accommodate the given number\n * of bytes. An optional parameter may be given that indicates a minimum\n * amount to grow the buffer if necessary. If the parameter is not given,\n * the buffer will be grown by some previously-specified default amount\n * or heuristic.\n \n @param amount the number of bytes to accommodate.\n * @param [growSize] the minimum amount, in bytes, to grow the buffer by if\n * necessary.\n /\nutil.DataBuffer.prototype.accommodate = function(amount, growSize) {\n if(this.length() >= amount) {\n return this;\n }\n growSize = Math.max(growSize \|\| this.growSize, amount);\n\n // grow buffer\n var src = new Uint8Array(\n this.data.buffer, this.data.byteOffset, this.data.byteLength);\n var dst = new Uint8Array(this.length() + growSize);\n dst.set(src);\n this.data = new DataView(dst.buffer);\n\n return this;\n};\n\n/\n Puts a byte in this buffer.\n \n @param b the byte to put.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putByte = function(b) {\n this.accommodate(1);\n this.data.setUint8(this.write++, b);\n return this;\n};\n\n/\n Puts a byte in this buffer N times.\n \n @param b the byte to put.\n * @param n the number of bytes of value b to put.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.fillWithByte = function(b, n) {\n this.accommodate(n);\n for(var i = 0; i < n; ++i) {\n this.data.setUint8(b);\n }\n return this;\n};\n\n/\n Puts bytes in this buffer. The bytes may be given as a string, an\n * ArrayBuffer, a DataView, or a TypedArray.\n \n @param bytes the bytes to put.\n * @param [encoding] the encoding for the first parameter ('binary', 'utf8',\n * 'utf16', 'hex'), if it is a string (default: 'binary').\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putBytes = function(bytes, encoding) {\n if(util.isArrayBufferView(bytes)) {\n var src = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n var len = src.byteLength - src.byteOffset;\n this.accommodate(len);\n var dst = new Uint8Array(this.data.buffer, this.write);\n dst.set(src);\n this.write += len;\n return this;\n }\n\n if(util.isArrayBuffer(bytes)) {\n var src = new Uint8Array(bytes);\n this.accommodate(src.byteLength);\n var dst = new Uint8Array(this.data.buffer);\n dst.set(src, this.write);\n this.write += src.byteLength;\n return this;\n }\n\n // bytes is a util.DataBuffer or equivalent\n if(bytes instanceof util.DataBuffer \|\|\n (typeof bytes === 'object' &&\n typeof bytes.read === 'number' && typeof bytes.write === 'number' &&\n util.isArrayBufferView(bytes.data))) {\n var src = new Uint8Array(bytes.data.byteLength, bytes.read, bytes.length());\n this.accommodate(src.byteLength);\n var dst = new Uint8Array(bytes.data.byteLength, this.write);\n dst.set(src);\n this.write += src.byteLength;\n return this;\n }\n\n if(bytes instanceof util.ByteStringBuffer) {\n // copy binary string and process as the same as a string parameter below\n bytes = bytes.data;\n encoding = 'binary';\n }\n\n // string conversion\n encoding = encoding \|\| 'binary';\n if(typeof bytes === 'string') {\n var view;\n\n // decode from string\n if(encoding === 'hex') {\n this.accommodate(Math.ceil(bytes.length / 2));\n view = new Uint8Array(this.data.buffer, this.write);\n this.write += util.binary.hex.decode(bytes, view, this.write);\n return this;\n }\n if(encoding === 'base64') {\n this.accommodate(Math.ceil(bytes.length / 4) 3);\n view = new Uint8Array(this.data.buffer, this.write);\n this.write += util.binary.base64.decode(bytes, view, this.write);\n return this;\n }\n\n // encode text as UTF-8 bytes\n if(encoding === 'utf8') {\n // encode as UTF-8 then decode string as raw binary\n bytes = util.encodeUtf8(bytes);\n encoding = 'binary';\n }\n\n // decode string as raw binary\n if(encoding === 'binary' \|\| encoding === 'raw') {\n // one byte per character\n this.accommodate(bytes.length);\n view = new Uint8Array(this.data.buffer, this.write);\n this.write += util.binary.raw.decode(view);\n return this;\n }\n\n // encode text as UTF-16 bytes\n if(encoding === 'utf16') {\n // two bytes per character\n this.accommodate(bytes.length * 2);\n view = new Uint16Array(this.data.buffer, this.write);\n this.write += util.text.utf16.encode(view);\n return this;\n }\n\n throw new Error('Invalid encoding: ' + encoding);\n }\n\n throw Error('Invalid parameter: ' + bytes);\n};\n\n/*\n Puts the given buffer into this buffer.\n \n @param buffer the buffer to put into this one.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putBuffer = function(buffer) {\n this.putBytes(buffer);\n buffer.clear();\n return this;\n};\n\n/\n Puts a string into this buffer.\n \n @param str the string to put.\n * @param [encoding] the encoding for the string (default: 'utf16').\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putString = function(str) {\n return this.putBytes(str, 'utf16');\n};\n\n/\n Puts a 16-bit integer in this buffer in big-endian order.\n \n @param i the 16-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt16 = function(i) {\n this.accommodate(2);\n this.data.setInt16(this.write, i);\n this.write += 2;\n return this;\n};\n\n/\n Puts a 24-bit integer in this buffer in big-endian order.\n \n @param i the 24-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt24 = function(i) {\n this.accommodate(3);\n this.data.setInt16(this.write, i >> 8 & 0xFFFF);\n this.data.setInt8(this.write, i >> 16 & 0xFF);\n this.write += 3;\n return this;\n};\n\n/\n Puts a 32-bit integer in this buffer in big-endian order.\n \n @param i the 32-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt32 = function(i) {\n this.accommodate(4);\n this.data.setInt32(this.write, i);\n this.write += 4;\n return this;\n};\n\n/\n Puts a 16-bit integer in this buffer in little-endian order.\n \n @param i the 16-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt16Le = function(i) {\n this.accommodate(2);\n this.data.setInt16(this.write, i, true);\n this.write += 2;\n return this;\n};\n\n/\n Puts a 24-bit integer in this buffer in little-endian order.\n \n @param i the 24-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt24Le = function(i) {\n this.accommodate(3);\n this.data.setInt8(this.write, i >> 16 & 0xFF);\n this.data.setInt16(this.write, i >> 8 & 0xFFFF, true);\n this.write += 3;\n return this;\n};\n\n/\n Puts a 32-bit integer in this buffer in little-endian order.\n \n @param i the 32-bit integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt32Le = function(i) {\n this.accommodate(4);\n this.data.setInt32(this.write, i, true);\n this.write += 4;\n return this;\n};\n\n/\n Puts an n-bit integer in this buffer in big-endian order.\n \n @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putInt = function(i, n) {\n _checkBitsParam(n);\n this.accommodate(n / 8);\n do {\n n -= 8;\n this.data.setInt8(this.write++, (i >> n) & 0xFF);\n } while(n > 0);\n return this;\n};\n\n/\n Puts a signed n-bit integer in this buffer in big-endian order. Two's\n * complement representation is used.\n \n @param i the n-bit integer.\n * @param n the number of bits in the integer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.putSignedInt = function(i, n) {\n _checkBitsParam(n);\n this.accommodate(n / 8);\n if(i < 0) {\n i += 2 << (n - 1);\n }\n return this.putInt(i, n);\n};\n\n/\n Gets a byte from this buffer and advances the read pointer by 1.\n \n @return the byte.\n /\nutil.DataBuffer.prototype.getByte = function() {\n return this.data.getInt8(this.read++);\n};\n\n/\n Gets a uint16 from this buffer in big-endian order and advances the read\n * pointer by 2.\n \n @return the uint16.\n /\nutil.DataBuffer.prototype.getInt16 = function() {\n var rval = this.data.getInt16(this.read);\n this.read += 2;\n return rval;\n};\n\n/\n Gets a uint24 from this buffer in big-endian order and advances the read\n * pointer by 3.\n \n @return the uint24.\n /\nutil.DataBuffer.prototype.getInt24 = function() {\n var rval = (\n this.data.getInt16(this.read) << 8 ^\n this.data.getInt8(this.read + 2));\n this.read += 3;\n return rval;\n};\n\n/\n Gets a uint32 from this buffer in big-endian order and advances the read\n * pointer by 4.\n \n @return the word.\n /\nutil.DataBuffer.prototype.getInt32 = function() {\n var rval = this.data.getInt32(this.read);\n this.read += 4;\n return rval;\n};\n\n/\n Gets a uint16 from this buffer in little-endian order and advances the read\n * pointer by 2.\n \n @return the uint16.\n /\nutil.DataBuffer.prototype.getInt16Le = function() {\n var rval = this.data.getInt16(this.read, true);\n this.read += 2;\n return rval;\n};\n\n/\n Gets a uint24 from this buffer in little-endian order and advances the read\n * pointer by 3.\n \n @return the uint24.\n /\nutil.DataBuffer.prototype.getInt24Le = function() {\n var rval = (\n this.data.getInt8(this.read) ^\n this.data.getInt16(this.read + 1, true) << 8);\n this.read += 3;\n return rval;\n};\n\n/\n Gets a uint32 from this buffer in little-endian order and advances the read\n * pointer by 4.\n \n @return the word.\n /\nutil.DataBuffer.prototype.getInt32Le = function() {\n var rval = this.data.getInt32(this.read, true);\n this.read += 4;\n return rval;\n};\n\n/\n Gets an n-bit integer from this buffer in big-endian order and advances the\n * read pointer by n/8.\n \n @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return the integer.\n /\nutil.DataBuffer.prototype.getInt = function(n) {\n _checkBitsParam(n);\n var rval = 0;\n do {\n // TODO: Use (rval 0x100) if adding support for 33 to 53 bits.\n rval = (rval << 8) + this.data.getInt8(this.read++);\n n -= 8;\n } while(n > 0);\n return rval;\n};\n\n/*\n Gets a signed n-bit integer from this buffer in big-endian order, using\n * two's complement, and advances the read pointer by n/8.\n \n @param n the number of bits in the integer (8, 16, 24, or 32).\n \n @return the integer.\n /\nutil.DataBuffer.prototype.getSignedInt = function(n) {\n // getInt checks n\n var x = this.getInt(n);\n var max = 2 << (n - 2);\n if(x >= max) {\n x -= max << 1;\n }\n return x;\n};\n\n/\n Reads bytes out as a binary encoded string and clears them from the\n * buffer.\n \n @param count the number of bytes to read, undefined or null for all.\n \n @return a binary encoded string of bytes.\n /\nutil.DataBuffer.prototype.getBytes = function(count) {\n // TODO: deprecate this method, it is poorly named and\n // this.toString('binary') replaces it\n // add a toTypedArray()/toArrayBuffer() function\n var rval;\n if(count) {\n // read count bytes\n count = Math.min(this.length(), count);\n rval = this.data.slice(this.read, this.read + count);\n this.read += count;\n } else if(count === 0) {\n rval = '';\n } else {\n // read all bytes, optimize to only copy when needed\n rval = (this.read === 0) ? this.data : this.data.slice(this.read);\n this.clear();\n }\n return rval;\n};\n\n/\n Gets a binary encoded string of the bytes from this buffer without\n * modifying the read pointer.\n \n @param count the number of bytes to get, omit to get all.\n \n @return a string full of binary encoded characters.\n /\nutil.DataBuffer.prototype.bytes = function(count) {\n // TODO: deprecate this method, it is poorly named, add \"getString()\"\n return (typeof(count) === 'undefined' ?\n this.data.slice(this.read) :\n this.data.slice(this.read, this.read + count));\n};\n\n/\n Gets a byte at the given index without modifying the read pointer.\n \n @param i the byte index.\n \n @return the byte.\n /\nutil.DataBuffer.prototype.at = function(i) {\n return this.data.getUint8(this.read + i);\n};\n\n/\n Puts a byte at the given index without modifying the read pointer.\n \n @param i the byte index.\n * @param b the byte to put.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.setAt = function(i, b) {\n this.data.setUint8(i, b);\n return this;\n};\n\n/\n Gets the last byte without modifying the read pointer.\n \n @return the last byte.\n /\nutil.DataBuffer.prototype.last = function() {\n return this.data.getUint8(this.write - 1);\n};\n\n/\n Creates a copy of this buffer.\n \n @return the copy.\n /\nutil.DataBuffer.prototype.copy = function() {\n return new util.DataBuffer(this);\n};\n\n/\n Compacts this buffer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.compact = function() {\n if(this.read > 0) {\n var src = new Uint8Array(this.data.buffer, this.read);\n var dst = new Uint8Array(src.byteLength);\n dst.set(src);\n this.data = new DataView(dst);\n this.write -= this.read;\n this.read = 0;\n }\n return this;\n};\n\n/\n Clears this buffer.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.clear = function() {\n this.data = new DataView(new ArrayBuffer(0));\n this.read = this.write = 0;\n return this;\n};\n\n/\n Shortens this buffer by triming bytes off of the end of this buffer.\n \n @param count the number of bytes to trim off.\n \n @return this buffer.\n /\nutil.DataBuffer.prototype.truncate = function(count) {\n this.write = Math.max(0, this.length() - count);\n this.read = Math.min(this.read, this.write);\n return this;\n};\n\n/\n Converts this buffer to a hexadecimal string.\n \n @return a hexadecimal string.\n /\nutil.DataBuffer.prototype.toHex = function() {\n var rval = '';\n for(var i = this.read; i < this.data.byteLength; ++i) {\n var b = this.data.getUint8(i);\n if(b < 16) {\n rval += '0';\n }\n rval += b.toString(16);\n }\n return rval;\n};\n\n/\n Converts this buffer to a string, using the given encoding. If no\n * encoding is given, 'utf8' (UTF-8) is used.\n \n @param [encoding] the encoding to use: 'binary', 'utf8', 'utf16', 'hex',\n * 'base64' (default: 'utf8').\n \n @return a string representation of the bytes in this buffer.\n /\nutil.DataBuffer.prototype.toString = function(encoding) {\n var view = new Uint8Array(this.data, this.read, this.length());\n encoding = encoding \|\| 'utf8';\n\n // encode to string\n if(encoding === 'binary' \|\| encoding === 'raw') {\n return util.binary.raw.encode(view);\n }\n if(encoding === 'hex') {\n return util.binary.hex.encode(view);\n }\n if(encoding === 'base64') {\n return util.binary.base64.encode(view);\n }\n\n // decode to text\n if(encoding === 'utf8') {\n return util.text.utf8.decode(view);\n }\n if(encoding === 'utf16') {\n return util.text.utf16.decode(view);\n }\n\n throw new Error('Invalid encoding: ' + encoding);\n};\n\n/* End Buffer w/UInt8Array backing /\n\n/\n Creates a buffer that stores bytes. A value may be given to populate the\n * buffer with data. This value can either be string of encoded bytes or a\n * regular string of characters. When passing a string of binary encoded\n * bytes, the encoding `raw` should be given. This is also the default. When\n * passing a string of characters, the encoding `utf8` should be given.\n \n @param [input] a string with encoded bytes to store in the buffer.\n * @param [encoding] (default: 'raw', other: 'utf8').\n /\nutil.createBuffer = function(input, encoding) {\n // TODO: deprecate, use new ByteBuffer() instead\n encoding = encoding \|\| 'raw';\n if(input !== undefined && encoding === 'utf8') {\n input = util.encodeUtf8(input);\n }\n return new util.ByteBuffer(input);\n};\n\n/\n Fills a string with a particular value. If you want the string to be a byte\n * string, pass in String.fromCharCode(theByte).\n \n @param c the character to fill the string with, use String.fromCharCode\n * to fill the string with a byte value.\n * @param n the number of characters of value c to fill with.\n \n @return the filled string.\n /\nutil.fillString = function(c, n) {\n var s = '';\n while(n > 0) {\n if(n & 1) {\n s += c;\n }\n n >>>= 1;\n if(n > 0) {\n c += c;\n }\n }\n return s;\n};\n\n/\n Performs a per byte XOR between two byte strings and returns the result as a\n * string of bytes.\n \n @param s1 first string of bytes.\n * @param s2 second string of bytes.\n * @param n the number of bytes to XOR.\n \n @return the XOR'd result.\n /\nutil.xorBytes = function(s1, s2, n) {\n var s3 = '';\n var b = '';\n var t = '';\n var i = 0;\n var c = 0;\n for(; n > 0; --n, ++i) {\n b = s1.charCodeAt(i) ^ s2.charCodeAt(i);\n if(c >= 10) {\n s3 += t;\n t = '';\n c = 0;\n }\n t += String.fromCharCode(b);\n ++c;\n }\n s3 += t;\n return s3;\n};\n\n/\n Converts a hex string into a 'binary' encoded string of bytes.\n \n @param hex the hexadecimal string to convert.\n \n @return the binary-encoded string of bytes.\n /\nutil.hexToBytes = function(hex) {\n // TODO: deprecate: \"Deprecated. Use util.binary.hex.decode instead.\"\n var rval = '';\n var i = 0;\n if(hex.length & 1 == 1) {\n // odd number of characters, convert first character alone\n i = 1;\n rval += String.fromCharCode(parseInt(hex[0], 16));\n }\n // convert 2 characters (1 byte) at a time\n for(; i < hex.length; i += 2) {\n rval += String.fromCharCode(parseInt(hex.substr(i, 2), 16));\n }\n return rval;\n};\n\n/\n Converts a 'binary' encoded string of bytes to hex.\n \n @param bytes the byte string to convert.\n \n @return the string of hexadecimal characters.\n /\nutil.bytesToHex = function(bytes) {\n // TODO: deprecate: \"Deprecated. Use util.binary.hex.encode instead.\"\n return util.createBuffer(bytes).toHex();\n};\n\n/\n Converts an 32-bit integer to 4-big-endian byte string.\n \n @param i the integer.\n \n @return the byte string.\n /\nutil.int32ToBytes = function(i) {\n return (\n String.fromCharCode(i >> 24 & 0xFF) +\n String.fromCharCode(i >> 16 & 0xFF) +\n String.fromCharCode(i >> 8 & 0xFF) +\n String.fromCharCode(i & 0xFF));\n};\n\n// base64 characters, reverse mapping\nvar _base64 =\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';\nvar _base64Idx = [\n/43 -43 = 0/\n/'+', 1, 2, 3,'/' /\n 62, -1, -1, -1, 63,\n\n/'0','1','2','3','4','5','6','7','8','9' /\n 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,\n\n/15, 16, 17,'=', 19, 20, 21 /\n -1, -1, -1, 64, -1, -1, -1,\n\n/65 - 43 = 22/\n/'A','B','C','D','E','F','G','H','I','J','K','L','M', /\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,\n\n/'N','O','P','Q','R','S','T','U','V','W','X','Y','Z' /\n 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\n\n/91 - 43 = 48 /\n/48, 49, 50, 51, 52, 53 /\n -1, -1, -1, -1, -1, -1,\n\n/97 - 43 = 54/\n/'a','b','c','d','e','f','g','h','i','j','k','l','m' /\n 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38,\n\n/'n','o','p','q','r','s','t','u','v','w','x','y','z' /\n 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51\n];\n\n// base58 characters (Bitcoin alphabet)\nvar _base58 = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n\n/\n Base64 encodes a 'binary' encoded string of bytes.\n \n @param input the binary encoded string of bytes to base64-encode.\n * @param maxline the maximum number of encoded characters per line to use,\n * defaults to none.\n \n @return the base64-encoded output.\n /\nutil.encode64 = function(input, maxline) {\n // TODO: deprecate: \"Deprecated. Use util.binary.base64.encode instead.\"\n var line = '';\n var output = '';\n var chr1, chr2, chr3;\n var i = 0;\n while(i < input.length) {\n chr1 = input.charCodeAt(i++);\n chr2 = input.charCodeAt(i++);\n chr3 = input.charCodeAt(i++);\n\n // encode 4 character group\n line += _base64.charAt(chr1 >> 2);\n line += _base64.charAt(((chr1 & 3) << 4) \| (chr2 >> 4));\n if(isNaN(chr2)) {\n line += '==';\n } else {\n line += _base64.charAt(((chr2 & 15) << 2) \| (chr3 >> 6));\n line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);\n }\n\n if(maxline && line.length > maxline) {\n output += line.substr(0, maxline) + '\\r\\n';\n line = line.substr(maxline);\n }\n }\n output += line;\n return output;\n};\n\n/\n Base64 decodes a string into a 'binary' encoded string of bytes.\n \n @param input the base64-encoded input.\n \n @return the binary encoded string.\n /\nutil.decode64 = function(input) {\n // TODO: deprecate: \"Deprecated. Use util.binary.base64.decode instead.\"\n\n // remove all non-base64 characters\n input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, '');\n\n var output = '';\n var enc1, enc2, enc3, enc4;\n var i = 0;\n\n while(i < input.length) {\n enc1 = _base64Idx[input.charCodeAt(i++) - 43];\n enc2 = _base64Idx[input.charCodeAt(i++) - 43];\n enc3 = _base64Idx[input.charCodeAt(i++) - 43];\n enc4 = _base64Idx[input.charCodeAt(i++) - 43];\n\n output += String.fromCharCode((enc1 << 2) \| (enc2 >> 4));\n if(enc3 !== 64) {\n // decoded at least 2 bytes\n output += String.fromCharCode(((enc2 & 15) << 4) \| (enc3 >> 2));\n if(enc4 !== 64) {\n // decoded 3 bytes\n output += String.fromCharCode(((enc3 & 3) << 6) \| enc4);\n }\n }\n }\n\n return output;\n};\n\n/\n Encodes the given string of characters (a standard JavaScript\n * string) as a binary encoded string where the bytes represent\n * a UTF-8 encoded string of characters. Non-ASCII characters will be\n * encoded as multiple bytes according to UTF-8.\n \n @param str a standard string of characters to encode.\n \n @return the binary encoded string.\n /\nutil.encodeUtf8 = function(str) {\n return unescape(encodeURIComponent(str));\n};\n\n/\n Decodes a binary encoded string that contains bytes that\n * represent a UTF-8 encoded string of characters -- into a\n * string of characters (a standard JavaScript string).\n \n @param str the binary encoded string to decode.\n \n @return the resulting standard string of characters.\n /\nutil.decodeUtf8 = function(str) {\n return decodeURIComponent(escape(str));\n};\n\n// binary encoding/decoding tools\n// FIXME: Experimental. Do not use yet.\nutil.binary = {\n raw: {},\n hex: {},\n base64: {},\n base58: {},\n baseN : {\n encode: baseN.encode,\n decode: baseN.decode\n }\n};\n\n/\n Encodes a Uint8Array as a binary-encoded string. This encoding uses\n * a value between 0 and 255 for each character.\n \n @param bytes the Uint8Array to encode.\n \n @return the binary-encoded string.\n /\nutil.binary.raw.encode = function(bytes) {\n return String.fromCharCode.apply(null, bytes);\n};\n\n/\n Decodes a binary-encoded string to a Uint8Array. This encoding uses\n * a value between 0 and 255 for each character.\n \n @param str the binary-encoded string to decode.\n * @param [output] an optional Uint8Array to write the output to; if it\n * is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n \n @return the Uint8Array or the number of bytes written if output was given.\n /\nutil.binary.raw.decode = function(str, output, offset) {\n var out = output;\n if(!out) {\n out = new Uint8Array(str.length);\n }\n offset = offset \|\| 0;\n var j = offset;\n for(var i = 0; i < str.length; ++i) {\n out[j++] = str.charCodeAt(i);\n }\n return output ? (j - offset) : out;\n};\n\n/\n Encodes a 'binary' string, ArrayBuffer, DataView, TypedArray, or\n * ByteBuffer as a string of hexadecimal characters.\n \n @param bytes the bytes to convert.\n \n @return the string of hexadecimal characters.\n /\nutil.binary.hex.encode = util.bytesToHex;\n\n/\n Decodes a hex-encoded string to a Uint8Array.\n \n @param hex the hexadecimal string to convert.\n * @param [output] an optional Uint8Array to write the output to; if it\n * is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n \n @return the Uint8Array or the number of bytes written if output was given.\n /\nutil.binary.hex.decode = function(hex, output, offset) {\n var out = output;\n if(!out) {\n out = new Uint8Array(Math.ceil(hex.length / 2));\n }\n offset = offset \|\| 0;\n var i = 0, j = offset;\n if(hex.length & 1) {\n // odd number of characters, convert first character alone\n i = 1;\n out[j++] = parseInt(hex[0], 16);\n }\n // convert 2 characters (1 byte) at a time\n for(; i < hex.length; i += 2) {\n out[j++] = parseInt(hex.substr(i, 2), 16);\n }\n return output ? (j - offset) : out;\n};\n\n/\n Base64-encodes a Uint8Array.\n \n @param input the Uint8Array to encode.\n * @param maxline the maximum number of encoded characters per line to use,\n * defaults to none.\n \n @return the base64-encoded output string.\n /\nutil.binary.base64.encode = function(input, maxline) {\n var line = '';\n var output = '';\n var chr1, chr2, chr3;\n var i = 0;\n while(i < input.byteLength) {\n chr1 = input[i++];\n chr2 = input[i++];\n chr3 = input[i++];\n\n // encode 4 character group\n line += _base64.charAt(chr1 >> 2);\n line += _base64.charAt(((chr1 & 3) << 4) \| (chr2 >> 4));\n if(isNaN(chr2)) {\n line += '==';\n } else {\n line += _base64.charAt(((chr2 & 15) << 2) \| (chr3 >> 6));\n line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);\n }\n\n if(maxline && line.length > maxline) {\n output += line.substr(0, maxline) + '\\r\\n';\n line = line.substr(maxline);\n }\n }\n output += line;\n return output;\n};\n\n/\n Decodes a base64-encoded string to a Uint8Array.\n \n @param input the base64-encoded input string.\n * @param [output] an optional Uint8Array to write the output to; if it\n * is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n \n @return the Uint8Array or the number of bytes written if output was given.\n /\nutil.binary.base64.decode = function(input, output, offset) {\n var out = output;\n if(!out) {\n out = new Uint8Array(Math.ceil(input.length / 4) 3);\n }\n\n // remove all non-base64 characters\n input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, '');\n\n offset = offset \|\| 0;\n var enc1, enc2, enc3, enc4;\n var i = 0, j = offset;\n\n while(i < input.length) {\n enc1 = _base64Idx[input.charCodeAt(i++) - 43];\n enc2 = _base64Idx[input.charCodeAt(i++) - 43];\n enc3 = _base64Idx[input.charCodeAt(i++) - 43];\n enc4 = _base64Idx[input.charCodeAt(i++) - 43];\n\n out[j++] = (enc1 << 2) \| (enc2 >> 4);\n if(enc3 !== 64) {\n // decoded at least 2 bytes\n out[j++] = ((enc2 & 15) << 4) \| (enc3 >> 2);\n if(enc4 !== 64) {\n // decoded 3 bytes\n out[j++] = ((enc3 & 3) << 6) \| enc4;\n }\n }\n }\n\n // make sure result is the exact decoded length\n return output ? (j - offset) : out.subarray(0, j);\n};\n\n// add support for base58 encoding/decoding with Bitcoin alphabet\nutil.binary.base58.encode = function(input, maxline) {\n return util.binary.baseN.encode(input, _base58, maxline);\n};\nutil.binary.base58.decode = function(input, maxline) {\n return util.binary.baseN.decode(input, _base58, maxline);\n};\n\n// text encoding/decoding tools\n// FIXME: Experimental. Do not use yet.\nutil.text = {\n utf8: {},\n utf16: {}\n};\n\n/*\n Encodes the given string as UTF-8 in a Uint8Array.\n \n @param str the string to encode.\n * @param [output] an optional Uint8Array to write the output to; if it\n * is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n \n @return the Uint8Array or the number of bytes written if output was given.\n /\nutil.text.utf8.encode = function(str, output, offset) {\n str = util.encodeUtf8(str);\n var out = output;\n if(!out) {\n out = new Uint8Array(str.length);\n }\n offset = offset \|\| 0;\n var j = offset;\n for(var i = 0; i < str.length; ++i) {\n out[j++] = str.charCodeAt(i);\n }\n return output ? (j - offset) : out;\n};\n\n/\n Decodes the UTF-8 contents from a Uint8Array.\n \n @param bytes the Uint8Array to decode.\n \n @return the resulting string.\n /\nutil.text.utf8.decode = function(bytes) {\n return util.decodeUtf8(String.fromCharCode.apply(null, bytes));\n};\n\n/\n Encodes the given string as UTF-16 in a Uint8Array.\n \n @param str the string to encode.\n * @param [output] an optional Uint8Array to write the output to; if it\n * is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n \n @return the Uint8Array or the number of bytes written if output was given.\n /\nutil.text.utf16.encode = function(str, output, offset) {\n var out = output;\n if(!out) {\n out = new Uint8Array(str.length 2);\n }\n var view = new Uint16Array(out.buffer);\n offset = offset \|\| 0;\n var j = offset;\n var k = offset;\n for(var i = 0; i < str.length; ++i) {\n view[k++] = str.charCodeAt(i);\n j += 2;\n }\n return output ? (j - offset) : out;\n};\n\n/*\n Decodes the UTF-16 contents from a Uint8Array.\n \n @param bytes the Uint8Array to decode.\n \n @return the resulting string.\n /\nutil.text.utf16.decode = function(bytes) {\n return String.fromCharCode.apply(null, new Uint16Array(bytes.buffer));\n};\n\n/\n Deflates the given data using a flash interface.\n \n @param api the flash interface.\n * @param bytes the data.\n * @param raw true to return only raw deflate data, false to include zlib\n * header and trailer.\n \n @return the deflated data as a string.\n /\nutil.deflate = function(api, bytes, raw) {\n bytes = util.decode64(api.deflate(util.encode64(bytes)).rval);\n\n // strip zlib header and trailer if necessary\n if(raw) {\n // zlib header is 2 bytes (CMF,FLG) where FLG indicates that\n // there is a 4-byte DICT (alder-32) block before the data if\n // its 5th bit is set\n var start = 2;\n var flg = bytes.charCodeAt(1);\n if(flg & 0x20) {\n start = 6;\n }\n // zlib trailer is 4 bytes of adler-32\n bytes = bytes.substring(start, bytes.length - 4);\n }\n\n return bytes;\n};\n\n/\n Inflates the given data using a flash interface.\n \n @param api the flash interface.\n * @param bytes the data.\n * @param raw true if the incoming data has no zlib header or trailer and is\n * raw DEFLATE data.\n \n @return the inflated data as a string, null on error.\n /\nutil.inflate = function(api, bytes, raw) {\n // TODO: add zlib header and trailer if necessary/possible\n var rval = api.inflate(util.encode64(bytes)).rval;\n return (rval === null) ? null : util.decode64(rval);\n};\n\n/\n Sets a storage object.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n * @param obj the storage object, null to remove.\n /\nvar _setStorageObject = function(api, id, obj) {\n if(!api) {\n throw new Error('WebStorage not available.');\n }\n\n var rval;\n if(obj === null) {\n rval = api.removeItem(id);\n } else {\n // json-encode and base64-encode object\n obj = util.encode64(JSON.stringify(obj));\n rval = api.setItem(id, obj);\n }\n\n // handle potential flash error\n if(typeof(rval) !== 'undefined' && rval.rval !== true) {\n var error = new Error(rval.error.message);\n error.id = rval.error.id;\n error.name = rval.error.name;\n throw error;\n }\n};\n\n/\n Gets a storage object.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n \n @return the storage object entry or null if none exists.\n /\nvar _getStorageObject = function(api, id) {\n if(!api) {\n throw new Error('WebStorage not available.');\n }\n\n // get the existing entry\n var rval = api.getItem(id);\n\n / Note: We check api.init because we can't do (api == localStorage)\n on IE because of \"Class doesn't support Automation\" exception. Only\n the flash api has an init method so this works too, but we need a\n better solution in the future. /\n\n // flash returns item wrapped in an object, handle special case\n if(api.init) {\n if(rval.rval === null) {\n if(rval.error) {\n var error = new Error(rval.error.message);\n error.id = rval.error.id;\n error.name = rval.error.name;\n throw error;\n }\n // no error, but also no item\n rval = null;\n } else {\n rval = rval.rval;\n }\n }\n\n // handle decoding\n if(rval !== null) {\n // base64-decode and json-decode data\n rval = JSON.parse(util.decode64(rval));\n }\n\n return rval;\n};\n\n/\n Stores an item in local storage.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param data the data for the item (any javascript object/primitive).\n /\nvar _setItem = function(api, id, key, data) {\n // get storage object\n var obj = _getStorageObject(api, id);\n if(obj === null) {\n // create a new storage object\n obj = {};\n }\n // update key\n obj[key] = data;\n\n // set storage object\n _setStorageObject(api, id, obj);\n};\n\n/\n Gets an item from local storage.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n \n @return the item.\n /\nvar _getItem = function(api, id, key) {\n // get storage object\n var rval = _getStorageObject(api, id);\n if(rval !== null) {\n // return data at key\n rval = (key in rval) ? rval[key] : null;\n }\n\n return rval;\n};\n\n/\n Removes an item from local storage.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n /\nvar _removeItem = function(api, id, key) {\n // get storage object\n var obj = _getStorageObject(api, id);\n if(obj !== null && key in obj) {\n // remove key\n delete obj[key];\n\n // see if entry has no keys remaining\n var empty = true;\n for(var prop in obj) {\n empty = false;\n break;\n }\n if(empty) {\n // remove entry entirely if no keys are left\n obj = null;\n }\n\n // set storage object\n _setStorageObject(api, id, obj);\n }\n};\n\n/\n Clears the local disk storage identified by the given ID.\n \n @param api the storage interface.\n * @param id the storage ID to use.\n /\nvar _clearItems = function(api, id) {\n _setStorageObject(api, id, null);\n};\n\n/\n Calls a storage function.\n \n @param func the function to call.\n * @param args the arguments for the function.\n * @param location the location argument.\n \n @return the return value from the function.\n /\nvar _callStorageFunction = function(func, args, location) {\n var rval = null;\n\n // default storage types\n if(typeof(location) === 'undefined') {\n location = ['web', 'flash'];\n }\n\n // apply storage types in order of preference\n var type;\n var done = false;\n var exception = null;\n for(var idx in location) {\n type = location[idx];\n try {\n if(type === 'flash' \|\| type === 'both') {\n if(args[0] === null) {\n throw new Error('Flash local storage not available.');\n }\n rval = func.apply(this, args);\n done = (type === 'flash');\n }\n if(type === 'web' \|\| type === 'both') {\n args[0] = localStorage;\n rval = func.apply(this, args);\n done = true;\n }\n } catch(ex) {\n exception = ex;\n }\n if(done) {\n break;\n }\n }\n\n if(!done) {\n throw exception;\n }\n\n return rval;\n};\n\n/\n Stores an item on local disk.\n \n The available types of local storage include 'flash', 'web', and 'both'.\n \n The type 'flash' refers to flash local storage (SharedObject). In order\n * to use flash local storage, the 'api' parameter must be valid. The type\n * 'web' refers to WebStorage, if supported by the browser. The type 'both'\n * refers to storing using both 'flash' and 'web', not just one or the\n * other.\n \n The location array should list the storage types to use in order of\n * preference:\n \n ['flash']: flash only storage\n * ['web']: web only storage\n * ['both']: try to store in both\n * ['flash','web']: store in flash first, but if not available, 'web'\n * ['web','flash']: store in web first, but if not available, 'flash'\n \n The location array defaults to: ['web', 'flash']\n \n @param api the flash interface, null to use only WebStorage.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param data the data for the item (any javascript object/primitive).\n * @param location an array with the preferred types of storage to use.\n /\nutil.setItem = function(api, id, key, data, location) {\n _callStorageFunction(_setItem, arguments, location);\n};\n\n/\n Gets an item on local disk.\n \n Set setItem() for details on storage types.\n \n @param api the flash interface, null to use only WebStorage.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param location an array with the preferred types of storage to use.\n \n @return the item.\n /\nutil.getItem = function(api, id, key, location) {\n return _callStorageFunction(_getItem, arguments, location);\n};\n\n/\n Removes an item on local disk.\n \n Set setItem() for details on storage types.\n \n @param api the flash interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param location an array with the preferred types of storage to use.\n /\nutil.removeItem = function(api, id, key, location) {\n _callStorageFunction(_removeItem, arguments, location);\n};\n\n/\n Clears the local disk storage identified by the given ID.\n \n Set setItem() for details on storage types.\n \n @param api the flash interface if flash is available.\n * @param id the storage ID to use.\n * @param location an array with the preferred types of storage to use.\n /\nutil.clearItems = function(api, id, location) {\n _callStorageFunction(_clearItems, arguments, location);\n};\n\n/\n Check if an object is empty.\n \n Taken from:\n * http://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object-from-json/679937#679937\n \n @param object the object to check.\n /\nutil.isEmpty = function(obj) {\n for(var prop in obj) {\n if(obj.hasOwnProperty(prop)) {\n return false;\n }\n }\n return true;\n};\n\n/\n Format with simple printf-style interpolation.\n \n %%: literal '%'\n * %s,%o: convert next argument into a string.\n \n @param format the string to format.\n * @param ... arguments to interpolate into the format string.\n /\nutil.format = function(format) {\n var re = /%./g;\n // current match\n var match;\n // current part\n var part;\n // current arg index\n var argi = 0;\n // collected parts to recombine later\n var parts = [];\n // last index found\n var last = 0;\n // loop while matches remain\n while((match = re.exec(format))) {\n part = format.substring(last, re.lastIndex - 2);\n // don't add empty strings (ie, parts between %s%s)\n if(part.length > 0) {\n parts.push(part);\n }\n last = re.lastIndex;\n // switch on % code\n var code = match[0][1];\n switch(code) {\n case 's':\n case 'o':\n // check if enough arguments were given\n if(argi < arguments.length) {\n parts.push(arguments[argi++ + 1]);\n } else {\n parts.push('<?>');\n }\n break;\n // FIXME: do proper formating for numbers, etc\n //case 'f':\n //case 'd':\n case '%':\n parts.push('%');\n break;\n default:\n parts.push('<%' + code + '?>');\n }\n }\n // add trailing part of format string\n parts.push(format.substring(last));\n return parts.join('');\n};\n\n/\n Formats a number.\n \n http://snipplr.com/view/5945/javascript-numberformat--ported-from-php/\n /\nutil.formatNumber = function(number, decimals, dec_point, thousands_sep) {\n // http://kevin.vanzonneveld.net\n // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n // + bugfix by: Michael White (http://crestidg.com)\n // + bugfix by: Benjamin Lupton\n // + bugfix by: Allan Jensen (http://www.winternet.no)\n // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n // example 1: number_format(1234.5678, 2, '.', '');\n // * returns 1: 1234.57\n\n var n = number, c = isNaN(decimals = Math.abs(decimals)) ? 2 : decimals;\n var d = dec_point === undefined ? ',' : dec_point;\n var t = thousands_sep === undefined ?\n '.' : thousands_sep, s = n < 0 ? '-' : '';\n var i = parseInt((n = Math.abs(+n \|\| 0).toFixed(c)), 10) + '';\n var j = (i.length > 3) ? i.length % 3 : 0;\n return s + (j ? i.substr(0, j) + t : '') +\n i.substr(j).replace(/(\\d{3})(?=\\d)/g, '$1' + t) +\n (c ? d + Math.abs(n - i).toFixed(c).slice(2) : '');\n};\n\n/*\n Formats a byte size.\n \n http://snipplr.com/view/5949/format-humanize-file-byte-size-presentation-in-javascript/\n /\nutil.formatSize = function(size) {\n if(size >= 1073741824) {\n size = util.formatNumber(size / 1073741824, 2, '.', '') + ' GiB';\n } else if(size >= 1048576) {\n size = util.formatNumber(size / 1048576, 2, '.', '') + ' MiB';\n } else if(size >= 1024) {\n size = util.formatNumber(size / 1024, 0) + ' KiB';\n } else {\n size = util.formatNumber(size, 0) + ' bytes';\n }\n return size;\n};\n\n/\n Converts an IPv4 or IPv6 string representation into bytes (in network order).\n \n @param ip the IPv4 or IPv6 address to convert.\n \n @return the 4-byte IPv6 or 16-byte IPv6 address or null if the address can't\n * be parsed.\n /\nutil.bytesFromIP = function(ip) {\n if(ip.indexOf('.') !== -1) {\n return util.bytesFromIPv4(ip);\n }\n if(ip.indexOf(':') !== -1) {\n return util.bytesFromIPv6(ip);\n }\n return null;\n};\n\n/\n Converts an IPv4 string representation into bytes (in network order).\n \n @param ip the IPv4 address to convert.\n \n @return the 4-byte address or null if the address can't be parsed.\n /\nutil.bytesFromIPv4 = function(ip) {\n ip = ip.split('.');\n if(ip.length !== 4) {\n return null;\n }\n var b = util.createBuffer();\n for(var i = 0; i < ip.length; ++i) {\n var num = parseInt(ip[i], 10);\n if(isNaN(num)) {\n return null;\n }\n b.putByte(num);\n }\n return b.getBytes();\n};\n\n/\n Converts an IPv6 string representation into bytes (in network order).\n \n @param ip the IPv6 address to convert.\n \n @return the 16-byte address or null if the address can't be parsed.\n /\nutil.bytesFromIPv6 = function(ip) {\n var blanks = 0;\n ip = ip.split(':').filter(function(e) {\n if(e.length === 0) ++blanks;\n return true;\n });\n var zeros = (8 - ip.length + blanks) 2;\n var b = util.createBuffer();\n for(var i = 0; i < 8; ++i) {\n if(!ip[i] \|\| ip[i].length === 0) {\n b.fillWithByte(0, zeros);\n zeros = 0;\n continue;\n }\n var bytes = util.hexToBytes(ip[i]);\n if(bytes.length < 2) {\n b.putByte(0);\n }\n b.putBytes(bytes);\n }\n return b.getBytes();\n};\n\n/*\n Converts 4-bytes into an IPv4 string representation or 16-bytes into\n * an IPv6 string representation. The bytes must be in network order.\n \n @param bytes the bytes to convert.\n \n @return the IPv4 or IPv6 string representation if 4 or 16 bytes,\n * respectively, are given, otherwise null.\n /\nutil.bytesToIP = function(bytes) {\n if(bytes.length === 4) {\n return util.bytesToIPv4(bytes);\n }\n if(bytes.length === 16) {\n return util.bytesToIPv6(bytes);\n }\n return null;\n};\n\n/\n Converts 4-bytes into an IPv4 string representation. The bytes must be\n * in network order.\n \n @param bytes the bytes to convert.\n \n @return the IPv4 string representation or null for an invalid # of bytes.\n /\nutil.bytesToIPv4 = function(bytes) {\n if(bytes.length !== 4) {\n return null;\n }\n var ip = [];\n for(var i = 0; i < bytes.length; ++i) {\n ip.push(bytes.charCodeAt(i));\n }\n return ip.join('.');\n};\n\n/\n Converts 16-bytes into an IPv16 string representation. The bytes must be\n * in network order.\n \n @param bytes the bytes to convert.\n \n @return the IPv16 string representation or null for an invalid # of bytes.\n /\nutil.bytesToIPv6 = function(bytes) {\n if(bytes.length !== 16) {\n return null;\n }\n var ip = [];\n var zeroGroups = [];\n var zeroMaxGroup = 0;\n for(var i = 0; i < bytes.length; i += 2) {\n var hex = util.bytesToHex(bytes[i] + bytes[i + 1]);\n // canonicalize zero representation\n while(hex[0] === '0' && hex !== '0') {\n hex = hex.substr(1);\n }\n if(hex === '0') {\n var last = zeroGroups[zeroGroups.length - 1];\n var idx = ip.length;\n if(!last \|\| idx !== last.end + 1) {\n zeroGroups.push({start: idx, end: idx});\n } else {\n last.end = idx;\n if((last.end - last.start) >\n (zeroGroups[zeroMaxGroup].end - zeroGroups[zeroMaxGroup].start)) {\n zeroMaxGroup = zeroGroups.length - 1;\n }\n }\n }\n ip.push(hex);\n }\n if(zeroGroups.length > 0) {\n var group = zeroGroups[zeroMaxGroup];\n // only shorten group of length > 0\n if(group.end - group.start > 0) {\n ip.splice(group.start, group.end - group.start + 1, '');\n if(group.start === 0) {\n ip.unshift('');\n }\n if(group.end === 7) {\n ip.push('');\n }\n }\n }\n return ip.join(':');\n};\n\n/\n Estimates the number of processes that can be run concurrently. If\n * creating Web Workers, keep in mind that the main JavaScript process needs\n * its own core.\n \n @param options the options to use:\n * update true to force an update (not use the cached value).\n * @param callback(err, max) called once the operation completes.\n /\nutil.estimateCores = function(options, callback) {\n if(typeof options === 'function') {\n callback = options;\n options = {};\n }\n options = options \|\| {};\n if('cores' in util && !options.update) {\n return callback(null, util.cores);\n }\n if(typeof navigator !== 'undefined' &&\n 'hardwareConcurrency' in navigator &&\n navigator.hardwareConcurrency > 0) {\n util.cores = navigator.hardwareConcurrency;\n return callback(null, util.cores);\n }\n if(typeof Worker === 'undefined') {\n // workers not available\n util.cores = 1;\n return callback(null, util.cores);\n }\n if(typeof Blob === 'undefined') {\n // can't estimate, default to 2\n util.cores = 2;\n return callback(null, util.cores);\n }\n\n // create worker concurrency estimation code as blob\n var blobUrl = URL.createObjectURL(new Blob(['(',\n function() {\n self.addEventListener('message', function(e) {\n // run worker for 4 ms\n var st = Date.now();\n var et = st + 4;\n while(Date.now() < et);\n self.postMessage({st: st, et: et});\n });\n }.toString(),\n ')()'], {type: 'application/javascript'}));\n\n // take 5 samples using 16 workers\n sample([], 5, 16);\n\n function sample(max, samples, numWorkers) {\n if(samples === 0) {\n // get overlap average\n var avg = Math.floor(max.reduce(function(avg, x) {\n return avg + x;\n }, 0) / max.length);\n util.cores = Math.max(1, avg);\n URL.revokeObjectURL(blobUrl);\n return callback(null, util.cores);\n }\n map(numWorkers, function(err, results) {\n max.push(reduce(numWorkers, results));\n sample(max, samples - 1, numWorkers);\n });\n }\n\n function map(numWorkers, callback) {\n var workers = [];\n var results = [];\n for(var i = 0; i < numWorkers; ++i) {\n var worker = new Worker(blobUrl);\n worker.addEventListener('message', function(e) {\n results.push(e.data);\n if(results.length === numWorkers) {\n for(var i = 0; i < numWorkers; ++i) {\n workers[i].terminate();\n }\n callback(null, results);\n }\n });\n workers.push(worker);\n }\n for(var i = 0; i < numWorkers; ++i) {\n workers[i].postMessage(i);\n }\n }\n\n function reduce(numWorkers, results) {\n // find overlapping time windows\n var overlaps = [];\n for(var n = 0; n < numWorkers; ++n) {\n var r1 = results[n];\n var overlap = overlaps[n] = [];\n for(var i = 0; i < numWorkers; ++i) {\n if(n === i) {\n continue;\n }\n var r2 = results[i];\n if((r1.st > r2.st && r1.st < r2.et) \|\|\n (r2.st > r1.st && r2.st < r1.et)) {\n overlap.push(i);\n }\n }\n }\n // get maximum overlaps ... don't include overlapping worker itself\n // as the main JS process was also being scheduled during the work and\n // would have to be subtracted from the estimate anyway\n return overlaps.reduce(function(max, overlap) {\n return Math.max(max, overlap.length);\n }, 0);\n }\n};\n","/\n @license React\n * react-jsx-runtime.production.min.js\n \n Copyright (c) Facebook, Inc. and its affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n'use strict';var f=require(\"react\"),k=Symbol.for(\"react.element\"),l=Symbol.for(\"react.fragment\"),m=Object.prototype.hasOwnProperty,n=f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,p={key:!0,ref:!0,__self:!0,__source:!0};\nfunction q(c,a,g){var b,d={},e=null,h=null;void 0!==g&&(e=\"\"+g);void 0!==a.key&&(e=\"\"+a.key);void 0!==a.ref&&(h=a.ref);for(b in a)m.call(a,b)&&!p.hasOwnProperty(b)&&(d[b]=a[b]);if(c&&c.defaultProps)for(b in a=c.defaultProps,a)void 0===d[b]&&(d[b]=a[b]);return{$$typeof:k,type:c,key:e,ref:h,props:d,_owner:n.current}}exports.Fragment=l;exports.jsx=q;exports.jsxs=q;\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/react-jsx-runtime.production.min.js');\n} else {\n module.exports = require('./cjs/react-jsx-runtime.development.js');\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__899__;","module.exports = __WEBPACK_EXTERNAL_MODULE__198__;","module.exports = __WEBPACK_EXTERNAL_MODULE__300__;","module.exports = __WEBPACK_EXTERNAL_MODULE__760__;","module.exports = __WEBPACK_EXTERNAL_MODULE__467__;","module.exports = __WEBPACK_EXTERNAL_MODULE__99__;","module.exports = __WEBPACK_EXTERNAL_MODULE__656__;","module.exports = __WEBPACK_EXTERNAL_MODULE__156__;","module.exports = __WEBPACK_EXTERNAL_MODULE__111__;","module.exports = __WEBPACK_EXTERNAL_MODULE__715__;","module.exports = __WEBPACK_EXTERNAL_MODULE__383__;","module.exports = __WEBPACK_EXTERNAL_MODULE__128__;","// 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\t// no module.id needed\n\t\t// no module.loaded needed\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// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = function(module) {\n\tvar getter = module && module.__esModule ?\n\t\tfunction() { return module['default']; } :\n\t\tfunction() { return module; };\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = function(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 = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(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};","/ global document /\n\nimport { IS_CLIENT_SIDE } from './isomorphy/environment-check';\nimport { requireWeak } from './webpack';\n\nconst config = (\n IS_CLIENT_SIDE\n // eslint-disable-next-line global-require\n ? require('client/getInj').default().CONFIG\n : requireWeak('config')\n) \|\| {};\n\n// The safeguard for \"document\" is necessary because in non-Node environments,\n// like React Native, IS_CLIENT_SIDE is \"true\", however \"document\" and a bunch\n// of other browser-world features are not available.\nif (IS_CLIENT_SIDE && typeof document !== 'undefined') {\n const cookie = require('cookie'); // eslint-disable-line global-require\n config.CSRF = cookie.parse(document.cookie).csrfToken;\n}\n\nexport default config;\n","/ global document /\n\nimport Cookie from 'cookie';\nimport dayjs from 'dayjs';\nimport { assign } from 'lodash';\nimport { useEffect } from 'react';\n\nimport {\n DAY_MS,\n HOUR_MS,\n MIN_MS,\n SEC_MS,\n YEAR_MS,\n timer,\n} from '@dr.pogodin/js-utils';\n\nimport { getSsrContext, useGlobalState } from '@dr.pogodin/react-global-state';\n\n/\n This react hook wraps Date.now() function in a SSR friendly way,\n * ensuring that all calls to useCurrent() within the same render return\n * exactly the same time (which is retrieved from Date.now() first, and\n * then stored in the global state to be reused in all other calls), which\n * is also passed and used in the first client side render, and then updated\n * with a finite precision to avoid infinite re-rendering loops.\n * @param {object} [options] Optional settings.\n * @param {string} [options.globalStatePath=\"currentTime\"] Global state path\n * to keep the current time value.\n * @param {number} [options.precision= 5 * time.SEC_MS] Current time precision.\n * The hook won't update the current time stored in the global state unless it\n * is different from Date.now() result by this number (in milliseconds).\n * Default to 5 seconds.\n * @param {boolean} [options.autorefresh=false] Set `true` to automatically\n * refresh time stored in the global state with the given `precision` (and\n * thus automatically re-rendering components dependent on this hook, or\n * the global state with the period equal to the `precision`.\n * @return {number} Unix timestamp in milliseconds.\n /\nexport function useCurrent({\n autorefresh = false,\n globalStatePath = 'currentTime',\n precision = 5 dayjs.SEC_MS,\n} = {}) {\n const [now, setter] = useGlobalState(globalStatePath, Date.now);\n useEffect(() => {\n let timerId;\n const update = () => {\n setter((old) => {\n const neu = Date.now();\n return Math.abs(neu - old) > precision ? neu : old;\n });\n if (autorefresh) timerId = setTimeout(update, precision);\n };\n update();\n return () => {\n if (timerId) clearTimeout(timerId);\n };\n }, [autorefresh, precision, setter]);\n return now;\n}\n\n/*\n Wraps the standard Date.getTimezoneOffset() method in a SSR-friendly way.\n * This hook retrieves the offset value at the client side and uses a cookie\n * to pass it to the server in subsequent requests from that user. At the server\n * side the value from cookie is used in renders and passed back to the client\n * via the global state. Prior to the value being known (in the very first\n * request from the user, when the cookie is still missing), zero value is used\n * as the default value.\n \n @param {object} [options] Optional settings.\n * @param {string} [options.cookieName=\"timezoneOffset\"] Optional. The name of\n * cookie to use to store the timezone offset. Defaults \"timezoneOffset\". Set\n * to a falsy value to forbid using cookies altogether (in that case the hook\n * will always return zero value at the server-side, and in the first render\n * at the client-side).\n * @param {string} [options.timezoneOffset=\"timezoneOffset\"] Optional.\n * The global state path to store the offset. Defaults \"timezoneOffset\".\n * @return {number} Timezone offset.\n /\nexport function useTimezoneOffset({\n cookieName = 'timezoneOffset',\n globalStatePath = 'timezoneOffset',\n} = {}) {\n const ssrContext = getSsrContext(false);\n const [offset, setOffset] = useGlobalState(globalStatePath, () => {\n const value = cookieName && ssrContext?.req?.cookies?.[cookieName];\n return value ? parseInt(value, 10) : 0;\n });\n useEffect(() => {\n const date = new Date();\n const value = date.getTimezoneOffset();\n setOffset(value);\n if (cookieName) {\n document.cookie = Cookie.serialize(cookieName, value, { path: '/' });\n }\n }, [cookieName, setOffset]);\n return offset;\n}\n\nassign(dayjs, {\n DAY_MS,\n HOUR_MS,\n MIN_MS,\n SEC_MS,\n YEAR_MS,\n now: Date.now,\n timer,\n useCurrent,\n useTimezoneOffset,\n});\n\nexport default dayjs;\n","import { Barrier } from '@dr.pogodin/js-utils';\n\nexport { Barrier };\n\n/\n Creates a new Barrier.\n * @deprecated Prefer using `Barrier` class construction directly,\n * i.e. `new Barrier(executor)` instead of `newBarrier(executor)`.\n * @returns {Barrier}\n /\nexport function newBarrier(executor) {\n return new Barrier(executor);\n}\n","/ eslint-disable react/jsx-props-no-spreading /\n/ global document /\n\nimport PT from 'prop-types';\n\nimport {\n lazy,\n Suspense,\n useEffect,\n useRef,\n} from 'react';\n\nimport { getGlobalState } from '@dr.pogodin/react-global-state';\nimport { newBarrier } from 'utils/Barrier';\n\nimport {\n IS_CLIENT_SIDE,\n IS_SERVER_SIDE,\n getBuildInfo,\n} from 'utils/isomorphy';\n\nlet chunkGroups;\nlet styleSheetUsageCounters;\nif (IS_CLIENT_SIDE) {\n // eslint-disable-next-line global-require\n chunkGroups = require('client/getInj').default().CHUNK_GROUPS \|\| {};\n styleSheetUsageCounters = {};\n}\n\nexport default function CodeSplit({\n children,\n chunkName,\n getComponent,\n placeholder,\n ...props\n}) {\n const { current: heap } = useRef({\n mounted: false,\n pendingStyles: [],\n });\n const { publicPath } = getBuildInfo();\n\n // TODO: Not sure whether it is fine for the inner React.lazy() mechanics\n // if we dynamically create the lazy component inside a render of another\n // component, or does it expect we only create it once on outside of any\n // component.\n const LazyComponent = lazy(async () => {\n const res = await getComponent();\n if (heap.pendingStyles.length) await Promise.all(heap.pendingStyles);\n return res.default ? res : { default: res };\n });\n\n if (IS_SERVER_SIDE) {\n const { chunks } = getGlobalState().ssrContext;\n if (chunks.includes(chunkName)) {\n throw Error(`Chunk name clash for \"${chunkName}\"`);\n } else chunks.push(chunkName);\n } else if (!heap.mounted) {\n heap.mounted = true;\n\n chunkGroups[chunkName].forEach((asset) => {\n if (!asset.endsWith('.css')) return;\n const path = `${publicPath}/${asset}`;\n let link = document.querySelector(`link[href=\"${path}\"]`);\n if (!link) {\n link = document.createElement('link');\n link.setAttribute('href', path);\n link.setAttribute('rel', 'stylesheet');\n\n const barrier = newBarrier();\n link.onload = barrier.resolve;\n\n // Even if the style load failed, still allow to mount the component,\n // abeit with broken styling.\n link.onerror = barrier.resolve;\n\n heap.pendingStyles.push(barrier);\n\n const head = document.querySelector('head');\n head.appendChild(link);\n }\n\n const count = styleSheetUsageCounters[path] \|\| 0;\n styleSheetUsageCounters[path] = count + 1;\n });\n }\n\n // This effectively fires only once, just before the component unmounts.\n useEffect(() => () => {\n heap.mounted = false;\n chunkGroups[chunkName].forEach((item) => {\n if (!item.endsWith('.css')) return;\n const path = `${publicPath}/${item}`;\n if (--styleSheetUsageCounters[path] <= 0) {\n const link = document.querySelector(`link[href=\"${path}\"]`);\n const head = document.querySelector('head');\n head.removeChild(link);\n }\n });\n }, [chunkName, heap, publicPath]);\n\n return (\n <Suspense fallback={placeholder}>\n <LazyComponent {...props}>\n {children}\n </LazyComponent>\n </Suspense>\n );\n}\n\nCodeSplit.propTypes = {\n children: PT.node,\n chunkName: PT.string.isRequired,\n getComponent: PT.func.isRequired,\n placeholder: PT.node,\n};\n\nCodeSplit.defaultProps = {\n children: undefined,\n placeholder: undefined,\n};\n","import themed, {\n COMPOSE,\n PRIORITY,\n ThemeProvider,\n} from '@dr.pogodin/react-themes';\n\nimport config from './config';\nimport as isomorphy from './isomorphy';\nimport time from './time';\nimport * as webpack from './webpack';\n\nexport { Emitter, Semaphore } from '@dr.pogodin/js-utils';\n\nexport * from './Barrier';\nexport { default as splitComponent } from './splitComponent';\n\nthemed.COMPOSE = COMPOSE;\nthemed.PRIORITY = PRIORITY;\n\n// Note: it should be done this way, as in some environments\n// \"process\" might not exist, and process.env.NODE_CONFIG_ENV\n// not injected by Webpack.\nlet NODE_CONFIG_ENV;\ntry {\n NODE_CONFIG_ENV = process.env.NODE_CONFIG_ENV;\n} catch { /* noop / }\n\nconst env = NODE_CONFIG_ENV \|\| process.env.NODE_ENV;\nconst JU = env !== 'production' && webpack.requireWeak('./jest', __dirname);\n\n/\n @category Utilities\n * @global\n * @func withRetries\n * @desc\n * ```js\n * import { withRetries } from '@dr.pogodin/react-utils';\n * ```\n * Attempts to perform given asynchronous `action` up to `maxRetries` times,\n * with the given `interval` between attempts. If any attempt is successful,\n * the result is returned immediately, with no further attempts done;\n * otherwise, if all attempts fail, the result Promise rejects after the last\n * attempt.\n * @param {function} action\n * @param {number} [maxRetries=5] Optional. Maximum number of retries. Defaults\n * to 5 attempts.\n * @param {number} [interval=1000] Optional. Interval between retries [ms].\n * Defaults to 1 second.\n * @return {Promise} Resolves to the result of successful operation, or\n * rejects with the error from the latst failed attempt.\n * @example\n * import { withRetries } from '@dr.pogodin/react-utils';\n \n let firstCall = true;\n \n function sampleAction() {\n * if (!firstCall) return 'success';\n * firstCall = false;\n * throw Error('The first call to this method fails');\n * }\n \n withRetries(sampleAction).then(console.log);\n * // It will print 'success' after one second, once the second attempt\n * // is performed.\n /\nexport async function withRetries(action, maxRetries = 5, interval = 1000) {\n / eslint-disable no-await-in-loop /\n for (let n = 1; ; ++n) {\n try {\n return await action();\n } catch (error) {\n if (n < maxRetries) await time.timer(interval);\n else throw error;\n }\n }\n / eslint-enable no-await-in-loop /\n}\n\nexport {\n config,\n isomorphy,\n JU,\n themed,\n ThemeProvider,\n time,\n webpack,\n};\n","/ eslint-disable react/jsx-props-no-spreading /\n\nimport { createElement } from 'react';\n\nimport CodeSplit from 'components/CodeSplit';\n\n/\n Wraps a regular React component into a \"code splitting\" component,\n * i.e. all code used exclusively by that component and its sub-tree\n * will go into a separate, asynchronously loaded, code chunk for\n * the client-side.\n * @param {object} options\n * @param {string} options.chunkName\n * @param {function} options.getComponent\n * @param {React.Element} [options.placeholder]\n * @return {React.ElementType}\n /\nexport default function splitComponent({\n chunkName,\n getComponent,\n placeholder,\n}) {\n // eslint-disable-next-line react/prop-types\n return ({ children, ...props } = {}) => createElement(\n CodeSplit,\n {\n ...props,\n chunkName,\n getComponent,\n placeholder,\n },\n children,\n );\n}\n","/ global window /\n\nimport PT from 'prop-types';\nimport { createElement } from 'react';\n\nimport './style.scss';\n\n/\n The `<Link>` component, and almost identical `<NavLink>` component, are\n * auxiliary wrappers around\n * [React Router](https://github.com/ReactTraining/react-router)'s\n * `<Link>` and `<NavLink>` components; they help to handle external and\n * internal links in uniform manner.\n \n @param {object} [props] Component properties.\n * @param {string} [props.className] CSS classes to apply to the link.\n * @param {boolean} [props.disabled] Disables the link.\n * @param {boolean} [props.enforceA] `true` enforces rendering of the link as\n * a simple `<a>` element.\n * @param {boolean} [props.keepScrollPosition] If `true`, and the link is\n * rendered as a React Router's component, it won't reset the viewport scrolling\n * position to the origin when clicked.\n * @param {function} [props.onClick] Event handler to trigger upon click.\n * @param {function} [props.onMouseDown] Event handler to trigger on MouseDown\n * event.\n * @param {boolean} [props.openNewTab] If `true` the link opens in a new tab.\n * @param {boolean} [props.replace] When `true`, the link will replace current\n * entry in the history stack instead of adding a new one.\n * @param {string} [props.to] Link URL.\n * @param {string} [props.activeClassName] `<NavLink>` only: CSS class(es)\n * to apply to rendered link when it is active.\n * @param {string} [props.activeStyle] `<NavLink>` only: CSS styles\n * to apply to the rendered link when it is active.\n * @param {boolean} [props.exact] `<NavLink>` only: if `true`, the active\n * class/style will only be applied if the location is matched exactly.\n * @param {function} [props.isActive] `<NavLink>` only: Add extra\n * logic for determining whether the link is active. This should be used if you\n * want to do more than verify that the link’s pathname matches the current URL\n * pathname.\n * @param {object} [props.location] `<NavLink>` only: `isActive` compares\n * current history location (usually the current browser URL). To compare to\n * a different location, a custom `location` can be passed.\n * @param {boolean} [props.strict] `<NavLink>` only: . When `true`, trailing\n * slash on a location’s pathname will be taken into consideration when\n * determining if the location matches the current URL. See the `<Route strict>`\n * documentation for more information.\n /\nexport default function GenericLink({\n children,\n className,\n disabled,\n enforceA,\n keepScrollPosition,\n onClick,\n onMouseDown,\n openNewTab,\n replace,\n routerLinkType,\n to,\n ...rest\n}) {\n / Renders Link as <a> element if:\n * - It is opted explicitely by `enforceA` prop;\n * - It should be opened in a new tab;\n * - It is an absolte URL (starts with http:// or https://);\n * - It is anchor link (starts with #). /\n if (disabled \|\| enforceA \|\| openNewTab \|\| to.match(/^(#\|(https?\|mailto):)/)) {\n return (\n <a\n className={className}\n disabled={disabled}\n href={to}\n onClick={disabled ? (e) => e.preventDefault() : onClick}\n onMouseDown={disabled ? (e) => e.preventDefault() : onMouseDown}\n rel=\"noopener noreferrer\"\n styleName=\"link\"\n target={openNewTab ? '_blank' : ''}\n >\n {children}\n </a>\n );\n }\n\n / Otherwise we render the link as React Router's Link or NavLink element. /\n return createElement(routerLinkType, {\n className,\n disabled,\n onMouseDown,\n replace,\n to,\n onClick: (e) => {\n // Executes the user-provided event handler, if any.\n if (onClick) onClick(e);\n\n // By default, clicking the link scrolls the page to beginning.\n if (!keepScrollPosition) window.scroll(0, 0);\n },\n ...rest,\n }, children);\n}\n\nGenericLink.defaultProps = {\n children: null,\n className: null,\n disabled: false,\n enforceA: false,\n keepScrollPosition: false,\n onClick: null,\n onMouseDown: null,\n openNewTab: false,\n replace: false,\n to: '',\n};\n\nGenericLink.propTypes = {\n children: PT.node,\n className: PT.string,\n disabled: PT.bool,\n enforceA: PT.bool,\n keepScrollPosition: PT.bool,\n onClick: PT.func,\n onMouseDown: PT.func,\n openNewTab: PT.bool,\n replace: PT.bool,\n routerLinkType: PT.elementType.isRequired,\n to: PT.oneOfType([PT.object, PT.string]),\n};\n","/\n The Link wraps around React Router's Link component, to automatically replace\n * it by the regular <a> element when:\n * - The target reference points to another domain;\n * - User opts to open the reference in a new tab;\n * - User explicitely opts to use <a>.\n /\n\nimport { Link as RrLink } from 'react-router-dom';\n\nimport GenericLink from './GenericLink';\n\nexport default function Link(props) {\n / eslint-disable react/jsx-props-no-spreading /\n return <GenericLink {...props} routerLinkType={RrLink} />;\n / eslint-enable react/jsx-props-no-spreading /\n}\n","// The <Button> component implements a standard button / button-like link.\n\nimport PT from 'prop-types';\n\nimport Link from 'components/Link';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './style.scss';\n\nfunction BaseButton({\n active,\n children,\n disabled,\n enforceA,\n onClick,\n onMouseDown,\n openNewTab,\n replace,\n theme,\n to,\n}) {\n let className = theme.button;\n if (active && theme.active) className += ` ${theme.active}`;\n if (disabled) {\n if (theme.disabled) className += ` ${theme.disabled}`;\n return (\n <div className={className}>\n {children}\n </div>\n );\n }\n if (to) {\n return (\n <Link\n className={className}\n enforceA={enforceA}\n onClick={onClick}\n onMouseDown={onMouseDown}\n openNewTab={openNewTab}\n replace={replace}\n to={to}\n >\n {children}\n </Link>\n );\n }\n return (\n <div\n className={className}\n onClick={onClick}\n onKeyDown={onClick}\n onMouseDown={onMouseDown}\n role=\"button\"\n tabIndex={0}\n >\n {children}\n </div>\n );\n}\n\n/\n Button component theme: a map of CSS\n * class names to append to button elements:\n * @prop {string} [active] to the root element of active button.\n * @prop {string} [button] to the root element of any button.\n * @prop {string} [disabled] to the root element of disabled button.\n /\nconst ThemedButton = themed('Button', [\n 'active',\n 'button',\n 'disabled',\n], defaultTheme)(BaseButton);\n\n/\n Implements themeable buttons, and button-line links (elements which look\n * like buttons, but behave as links) in the same uniform manner.\n * @param {object} [props] Component props.\n * @param {boolean} [props.active] Set `true` to render the button as\n * active, even if it is not active otherwise.\n * @param {boolean} [props.disabled] Set `true` to disable the button.\n * @param {boolean} [props.enforceA] When the button is rendered as `<Link>`\n * component, this prop enforces it to be rendered as a simple `<a>` element\n * (external link), rather than the React router's internal link.\n * See `<Link>` documentation to learn when links are rendered as `<a>`\n * by default.\n * @param {function} [props.onClick] Click event handler.\n * @param {function} [props.onMouseDown] Mouse down event handler.\n * @param {boolean} [props.openNewTab] Set `true` to open link in the new tab.\n * @param {boolean} [props.replace] When the button is rendered as\n * `<Link>`, and the target URL is internal, this property tells that\n * the new route should replace the last record in the browser's history,\n * rather than to be pushed as a new entry into the history stack.\n * @param {ButtonTheme} [props.theme] _Ad hoc_ button theme.\n * @param {object\|string} [props.to] If specified, the button will be rendered\n * as `<Link>` (if not disabled), and it will point to the specified location\n * or URL.\n * @param {...any} [props....]\n * [Other properties of themeable components](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nBaseButton.defaultProps = {\n active: false,\n children: undefined,\n disabled: false,\n enforceA: false,\n onClick: undefined,\n onMouseDown: undefined,\n openNewTab: false,\n replace: false,\n to: undefined,\n};\n\nBaseButton.propTypes = {\n active: PT.bool,\n children: PT.node,\n disabled: PT.bool,\n enforceA: PT.bool,\n onClick: PT.func,\n onMouseDown: PT.func,\n openNewTab: PT.bool,\n replace: PT.bool,\n theme: ThemedButton.themeType.isRequired,\n to: PT.oneOfType([PT.object, PT.string]),\n};\n\nexport default ThemedButton;\n","// extracted by mini-css-extract-plugin\nexport default {\"button\":\"E1FNQT\",\"context\":\"KM0v4f\",\"ad\":\"_3jm1-Q\",\"hoc\":\"_0plpDL\",\"active\":\"MAe9O6\",\"disabled\":\"Br9IWV\"};","import PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\nfunction Checkbox({\n checked,\n label,\n onChange,\n theme,\n}) {\n return (\n <div className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <input\n checked={checked}\n className={theme.checkbox}\n onChange={onChange}\n type=\"checkbox\"\n />\n </div>\n );\n}\n\n/\n Checkbox component theme: a map of\n * CSS classes to append to its elements:\n * @prop {string} [checkbox] to the underlying checkbox `<input>` element.\n * @prop {string} [container] to the root checkbox element.\n * @prop {string} [label] to the checkbox label element.\n /\nconst ThemedCheckbox = themed('Checkbox', [\n 'checkbox',\n 'container',\n 'label',\n], defaultTheme)(Checkbox);\n\n/\n The `<Checkbox>` component implements themeable checkboxes.\n * @param {object} [props] Component properties.\n * @param {boolean} [props.checked] Checkbox value.\n * @param {string} [props.label] Checkbox label.\n * @param {function} [props.onChange] State change handler.\n * @param {CheckboxTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other properties of themeable components](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties).\n /\nCheckbox.propTypes = {\n checked: PT.bool,\n label: PT.string,\n onChange: PT.func,\n theme: ThemedCheckbox.themeType.isRequired,\n};\n\nCheckbox.defaultProps = {\n checked: undefined,\n label: undefined,\n onChange: undefined,\n};\n\nexport default ThemedCheckbox;\n","// extracted by mini-css-extract-plugin\nexport default {\"checkbox\":\"A-f8qJ\",\"context\":\"dNQcC6\",\"ad\":\"earXxa\",\"hoc\":\"qAPfQ6\",\"container\":\"Kr0g3M\",\"label\":\"_3dML-O\"};","import { isString } from 'lodash';\nimport PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\n/\n Implements a themeable dropdown list. Internally it is rendered with help of\n * the standard HTML `<select>` element, thus the styling support is somewhat\n * limited.\n * @param {object} [props] Component properties.\n * @param {function} [props.filter] Options filter function. If provided, only\n * those elements of `options` list will be used by the dropdown, for which this\n * filter returns `true`.\n * @param {string} [props.label] Dropdown label.\n * @param {string} [props.onChange] Selection event handler.\n * @param {DropdownOption[]\|string[]} [props.options=[]] Array of dropdown\n * options. For string elements the option value and name will be the same.\n * It is allowed to mix DropdownOption and string elements in the same option\n * list.\n * @param {DropdownTheme} [props.theme] _Ad hoc_ theme.\n * @param {string} [props.value] Currently selected value.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction Dropdown({\n filter,\n label,\n onChange,\n options,\n theme,\n value,\n}) {\n const optionArray = [(\n <option\n className={theme.hiddenOption}\n key=\"__reactUtilsHiddenOption\"\n >\n &zwnj;\n </option>\n )];\n for (let i = 0; i < options.length; ++i) {\n let op = options[i];\n if (!filter \|\| filter(op)) {\n if (isString(op)) op = { value: op };\n optionArray.push((\n <option className={theme.option} key={op.value} value={op.value}>\n {op.name === undefined ? op.value : op.name }\n </option>\n ));\n }\n }\n return (\n <div className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <select\n className={theme.select}\n onChange={onChange}\n value={value}\n >\n {optionArray}\n </select>\n <div className={theme.arrow}>▼</div>\n </div>\n );\n}\n\nconst ThemedDropdown = themed('Dropdown', [\n 'arrow',\n 'container',\n 'hiddenOption',\n 'label',\n 'option',\n 'select',\n], defaultTheme)(Dropdown);\n\nDropdown.propTypes = {\n filter: PT.func,\n label: PT.string,\n onChange: PT.func,\n options: PT.arrayOf(\n PT.oneOfType([\n PT.shape({\n name: PT.node,\n value: PT.string.isRequired,\n }),\n PT.string,\n ]).isRequired,\n ),\n theme: ThemedDropdown.themeType.isRequired,\n value: PT.string,\n};\n\nDropdown.defaultProps = {\n filter: undefined,\n label: undefined,\n onChange: undefined,\n options: [],\n value: undefined,\n};\n\nexport default ThemedDropdown;\n","// extracted by mini-css-extract-plugin\nexport default {\"arrow\":\"-zPK7Y\",\"context\":\"haRIry\",\"ad\":\"D4XHG2\",\"hoc\":\"N3nd34\",\"container\":\"_9CQpeA\",\"label\":\"Gv0kyu\",\"hiddenOption\":\"RdW3yR\",\"select\":\"JXK1uw\"};","import PT from 'prop-types';\nimport { forwardRef } from 'react';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\n/\n Themeable input field, based on the standard HTML `<input>` element.\n * @param {object} [props]\n * @param {string} [props.label] Input label.\n * @param {InputTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props...] [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n * @param {...any} [props...] Any other properties are passed to the underlying\n * `<input>` element.\n /\nconst Input = forwardRef(({\n label,\n theme,\n ...rest\n}, ref) => (\n <span className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <input\n className={theme.input}\n ref={ref}\n {...rest} // eslint-disable-line react/jsx-props-no-spreading\n />\n </span>\n));\n\nconst ThemedInput = themed('Input', [\n 'container',\n 'input',\n 'label',\n], defaultTheme)(Input);\n\nInput.propTypes = {\n label: PT.string,\n theme: ThemedInput.themeType.isRequired,\n};\n\nInput.defaultProps = {\n label: undefined,\n};\n\nexport default ThemedInput;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"Cxx397\",\"context\":\"X5WszA\",\"ad\":\"_8s7GCr\",\"hoc\":\"TVlBYc\",\"input\":\"M07d4s\",\"label\":\"gfbdq-\"};","import PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport baseTheme from './base-theme.scss';\n\n/\n Simple and themeable page layout. It keeps the main content centered in\n * a column of limited width, which fills entire viewport on small screens\n * (under `$screen-md = 1024px` size). At larger screens the column keeps\n * `$screen-md` size, and it is centered at the page, surrounded by side\n * panels, where additional content can be displayed.\n \n Children: Component children are rendered as the content of main panel.\n * @param {object} [props] Component properties.\n * @param {Node} [props.leftSidePanelContent] The content for left side panel.\n * @param {Node} [props.rightSidePanelContent] The content for right side panel.\n * @param {PageLayoutTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction PageLayout({\n children,\n leftSidePanelContent,\n rightSidePanelContent,\n theme,\n}) {\n return (\n <div className={theme.container}>\n <div className={[theme.sidePanel, theme.leftSidePanel].join(' ')}>\n {leftSidePanelContent}\n </div>\n <div className={theme.mainPanel}>\n {children}\n </div>\n <div className={[theme.sidePanel, theme.rightSidePanel].join(' ')}>\n {rightSidePanelContent}\n </div>\n </div>\n );\n}\n\nconst ThemedPageLayout = themed('PageLayout', [\n 'container',\n 'leftSidePanel',\n 'mainPanel',\n 'rightSidePanel',\n 'sidePanel',\n], baseTheme)(PageLayout);\n\nPageLayout.propTypes = {\n children: PT.node,\n leftSidePanelContent: PT.node,\n rightSidePanelContent: PT.node,\n theme: ThemedPageLayout.themeType.isRequired,\n};\n\nPageLayout.defaultProps = {\n children: null,\n leftSidePanelContent: null,\n rightSidePanelContent: null,\n};\n\nexport default ThemedPageLayout;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"T3cuHB\",\"context\":\"m4mL-M\",\"ad\":\"m3-mdC\",\"hoc\":\"J15Z4H\",\"mainPanel\":\"pPlQO2\",\"sidePanel\":\"lqNh4h\"};","import PT from 'prop-types';\nimport { createContext, useMemo } from 'react';\nimport { Helmet } from 'react-helmet';\n\nconst Context = createContext();\n\n/\n The `<MetaTags>` component is an auxiliary wrapper around `react-helmet`,\n * which helps to inject meta tags (page title, a brief content description,\n * and social media thumbnails) into generated pages.\n \n When `<MetaTags>` are nested within the app's component tree, meta tags\n * content injected by components encountered down the tree overrides tags\n * injected by previously encountered `<MetaTags>` components.\n \n Children: `<MetaTags>` children, if any, are rendered at the component's\n * location. The context passes down all meta tag properties of parent\n * `<MetaTag>` instances. These properties can fetched within children\n * hierarchy in the following way, thus facilitating tags modification by\n * children:\n * ```jsx\n * import { useContext } from 'react';\n * import { MetaTags } from '@dr.pogodin/react-utils';\n * export default function SampleComponent() {\n * const { title, description, ...rest } = useContext(MetaTags.Context);\n * // Do something with these props here, e.g. prefix the page title with\n * // the component name:\n * return (\n * <MetaTags title={`Sample component - ${title}`} />\n * );\n * }\n * ```\n * @param {object} [props]\n * @param {string} [props.description] Page description to use in\n * the `description` meta tag, and as a default description of Open Graph Tags.\n * @param {string} [props.image] The absolute URL of thumbnail image to use\n * in Open Graph Tags (`twitter:image`, and `og:image`). By default these tags\n * are not injected.\n \n BEWARE: It must be a complete, absolute URL, including the correct\n * website domain and HTTP schema.\n \n @param {string} [props.siteName]: The site name to use in `twitter:site`,\n * and `og:sitename` tags. By default these tags are not injected.\n \n @param {string} [props.socialDescription] The site description to use in\n * `twitter:description` and `og:description` meta tags. By default the value of\n * `description` prop is used.\n * @param {string} [props.socialTitle] The page title to use in\n * `twitter:title`, `og:title`, and `og:image:alt` tags. By default the value of\n * `title` prop is used. Also the `og:image:alt` tag is only injected if `image`\n * prop is present.\n \n @param {string} props.title: The page name to use in the `<title>` tag.\n * It is also used as the default value of `socialTitle` prop.\n \n @param {string} [props.url] The page URL to use in `og:url` tag.\n * By default the tag is not injected.\n /\nexport default function MetaTags({\n children,\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n}) {\n const socTitle = socialTitle \|\| title;\n const socDesc = socialDescription \|\| description;\n\n const context = useMemo(() => ({\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n }), [\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n ]);\n\n return (\n <>\n <Helmet>\n {/ General tags. /}\n <title>\n {title}\n </title>\n <meta name=\"description\" content={description} />\n\n {/ Twitter cards. /}\n <meta name=\"twitter:card\" content=\"summary_large_image\" />\n <meta name=\"twitter:title\" content={socTitle} />\n <meta name=\"twitter:description\" content={socDesc} />\n { image ? <meta name=\"twitter:image\" content={image} /> : null }\n {\n siteName ? (\n <meta name=\"twitter:site\" content={`@${siteName}`} />\n ) : null\n }\n\n {/ Open Graph data. /}\n <meta name=\"og:title\" content={socTitle} />\n { image ? <meta name=\"og:image\" content={image} /> : null }\n { image ? <meta name=\"og:image:alt\" content={socTitle} /> : null }\n <meta name=\"og:description\" content={socDesc} />\n {\n siteName ? (<meta name=\"og:sitename\" content={siteName} />) : null\n }\n { url ? (<meta name=\"og:url\" content={url} />) : null }\n </Helmet>\n {\n children ? (\n <Context.Provider value={context}>\n {children}\n </Context.Provider>\n ) : null\n }\n </>\n );\n}\n\nMetaTags.Context = Context;\n\nMetaTags.defaultProps = {\n children: null,\n image: null,\n siteName: null,\n socialDescription: null,\n socialTitle: null,\n url: null,\n};\n\nMetaTags.propTypes = {\n children: PT.node,\n description: PT.string.isRequired,\n image: PT.string,\n siteName: PT.string,\n socialDescription: PT.string,\n socialTitle: PT.string,\n title: PT.string.isRequired,\n url: PT.string,\n};\n","/ global document /\n\nimport { noop } from 'lodash';\n\nimport {\n useEffect,\n useMemo,\n useRef,\n useState,\n} from 'react';\n\nimport ReactDom from 'react-dom';\nimport PT from 'prop-types';\nimport themed from '@dr.pogodin/react-themes';\n\nimport baseTheme from './base-theme.scss';\nimport './styles.scss';\n\n/\n The `<Modal>` component implements a simple themeable modal window, wrapped\n * into the default theme. `<BaseModal>` exposes the base non-themed component.\n * Children: Component children are rendered as the modal content.\n * @param {object} props Component properties. Beside props documented below,\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties) are supported as well.\n * @param {function} [props.onCancel] The callback to trigger when user\n * clicks outside the modal, or presses Escape. It is expected to hide the\n * modal.\n * @param {ModalTheme} [props.theme] _Ad hoc_ theme.\n /\nfunction BaseModal({\n children,\n onCancel,\n theme,\n}) {\n const containerRef = useRef();\n const overlayRef = useRef();\n const [portal, setPortal] = useState();\n\n useEffect(() => {\n const p = document.createElement('div');\n document.body.classList.add('scrolling-disabled-by-modal');\n document.body.appendChild(p);\n setPortal(p);\n return () => {\n document.body.classList.remove('scrolling-disabled-by-modal');\n document.body.removeChild(p);\n };\n }, []);\n\n const focusLast = useMemo(() => (\n <div\n onFocus={() => {\n const elems = containerRef.current.querySelectorAll('');\n for (let i = elems.length - 1; i >= 0; --i) {\n elems[i].focus();\n if (document.activeElement === elems[i]) return;\n }\n overlayRef.current.focus();\n }}\n /* eslint-disable jsx-a11y/no-noninteractive-tabindex /\n tabIndex=\"0\"\n / eslint-enable jsx-a11y/no-noninteractive-tabindex /\n />\n ), []);\n\n return portal ? ReactDom.createPortal(\n (\n <>\n {focusLast}\n <div\n aria-label=\"Cancel\"\n className={theme.overlay}\n onClick={() => onCancel()}\n onKeyDown={(e) => {\n if (e.key === 'Escape') onCancel();\n }}\n ref={(node) => {\n if (node && node !== overlayRef.current) {\n overlayRef.current = node;\n node.focus();\n }\n }}\n role=\"button\"\n tabIndex=\"0\"\n />\n <div\n aria-modal=\"true\"\n className={theme.container}\n onWheel={(event) => event.stopPropagation()}\n ref={containerRef}\n role=\"dialog\"\n >\n {children}\n </div>\n <div\n onFocus={() => {\n overlayRef.current.focus();\n }}\n / eslint-disable jsx-a11y/no-noninteractive-tabindex /\n tabIndex=\"0\"\n / eslint-enable jsx-a11y/no-noninteractive-tabindex /\n />\n {focusLast}\n </>\n ),\n portal,\n ) : null;\n}\n\nconst ThemedModal = themed(\n 'Modal',\n [\n 'container',\n 'overlay',\n ],\n baseTheme,\n)(BaseModal);\n\nBaseModal.propTypes = {\n onCancel: PT.func,\n children: PT.node,\n theme: ThemedModal.themeType.isRequired,\n};\n\nBaseModal.defaultProps = {\n onCancel: noop,\n children: null,\n};\n\nexport default ThemedModal;\n\n/ Non-themed version of the Modal. /\nexport { BaseModal };\n","// extracted by mini-css-extract-plugin\nexport default {\"overlay\":\"ye2BZo\",\"context\":\"Szmbbz\",\"ad\":\"Ah-Nsc\",\"hoc\":\"Wki41G\",\"container\":\"gyZ4rc\"};","import { NavLink as RrNavLink } from 'react-router-dom';\n\nimport GenericLink from './GenericLink';\n\nexport default function NavLink(props) {\n / eslint-disable react/jsx-props-no-spreading /\n return <GenericLink {...props} routerLinkType={RrNavLink} />;\n / eslint-enable react/jsx-props-no-spreading /\n}\n","import PT from 'prop-types';\n\nimport './style.scss';\n\n/\n The `<ScalableRect>` component implements container keeping given aspect\n * ratio, while its width is altered.\n \n Children: Component children are rendered as the component's content.\n * @param {object} props\n * @param {string} [props.className] CSS class for component container.\n * @param {string} [props.ratio=1:1] Ratio of the rendered rectangle sides,\n * in `W:H` form.\n /\nexport default function ScalableRect({ children, className, ratio }) {\n const aux = ratio.split(':');\n const paddingBottom = `${(100 aux[1]) / aux[0]}%`;\n\n /* NOTE: In case the following code looks strange to you, mind that we want to\n * allow the user to set custom styles on this component. If user passes in a\n * \"className\" prop (possibly \"styleName\", but that one is converted to\n * \"className\" by Babel just before being passed into this component), it\n * should not interfere with the sizing behavior, thus we need an extra <div>\n * level in this component; however, if user does not need a custom styling,\n * we can save one level of HTML code, so we do it. /\n const rect = (\n <div\n style={{ paddingBottom }}\n styleName=\"container\"\n >\n <div styleName=\"wrapper\">\n {children}\n </div>\n </div>\n );\n return className ? (\n <div className={className}>\n {rect}\n </div>\n ) : rect;\n}\n\nScalableRect.defaultProps = {\n children: null,\n className: null,\n ratio: '1:1',\n};\n\nScalableRect.propTypes = {\n children: PT.node,\n className: PT.string,\n ratio: PT.string,\n};\n","import PT from 'prop-types';\nimport themed from '@dr.pogodin/react-themes';\n\nimport defaultTheme from './theme.scss';\n\n/\n Throbber is an \"action in progress\" indicator, which renders\n * three bouncing circles as a simple pending activity indicator,\n * and can be further themed to a certain degree.\n * @param {object} [props] Component properties.\n * @param {ThrobberTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction Throbber({\n theme,\n}) {\n return (\n <span className={theme.container} styleName=\"container\">\n <span className={theme.circle} styleName=\"circle\" />\n <span className={theme.circle} styleName=\"circle\" />\n <span className={theme.circle} styleName=\"circle\" />\n </span>\n );\n}\n\nThrobber.defaultProps = {\n theme: {},\n};\n\nThrobber.propTypes = {\n theme: PT.shape({\n container: PT.string,\n circle: PT.string,\n }),\n};\n\nexport default themed('Throbber', [\n 'circle',\n 'container',\n], defaultTheme)(Throbber);\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"_7zdld4\",\"context\":\"uIObt7\",\"ad\":\"XIxe9o\",\"hoc\":\"YOyORH\",\"circle\":\"dBrB4g\",\"bouncing\":\"TJe-6j\"};","/\n The actual tooltip component. It is rendered outside the regular document\n * hierarchy, and with sub-components managed without React to achieve the best\n * performance during animation.\n /\n/ global document, window /\n\nimport {\n forwardRef,\n useEffect,\n useImperativeHandle,\n useState,\n} from 'react';\nimport { createPortal } from 'react-dom';\n\nimport PT from 'prop-types';\n\n/ Valid placements of the rendered tooltip. They will be overriden when\n * necessary to fit the tooltip within the viewport. /\nexport const PLACEMENTS = {\n ABOVE_CURSOR: 'ABOVE_CURSOR',\n ABOVE_ELEMENT: 'ABOVE_ELEMENT',\n BELOW_CURSOR: 'BELOW_CURSOR',\n BELOW_ELEMENT: 'BELOW_ELEMENT',\n};\n\nconst ARROW_STYLE_DOWN = [\n 'border-bottom-color:transparent',\n 'border-left-color:transparent',\n 'border-right-color:transparent',\n].join(';');\n\nconst ARROW_STYLE_UP = [\n 'border-top-color:transparent',\n 'border-left-color:transparent',\n 'border-right-color:transparent',\n].join(';');\n\n/\n Creates tooltip components.\n * @ignore\n * @param {object} theme Themes to use for tooltip container, arrow,\n * and content.\n * @return {object} Object with DOM references to the container components:\n * container, arrow, content.\n /\nfunction createTooltipComponents(theme) {\n const arrow = document.createElement('div');\n if (theme.arrow) arrow.setAttribute('class', theme.arrow);\n\n const content = document.createElement('div');\n if (theme.content) content.setAttribute('class', theme.content);\n\n const container = document.createElement('div');\n if (theme.container) container.setAttribute('class', theme.container);\n\n container.appendChild(arrow);\n container.appendChild(content);\n document.body.appendChild(container);\n\n return { container, arrow, content };\n}\n\n/\n Generates bounding client rectangles for tooltip components.\n * @ignore\n * @param {object} tooltip DOM references to the tooltip components.\n * @param {object} tooltip.arrow\n * @param {object} tooltip.container\n * @return {{ arrow: object, container}} Object holding tooltip rectangles in\n * two fields.\n /\nfunction calcTooltipRects(tooltip) {\n return {\n arrow: tooltip.arrow.getBoundingClientRect(),\n container: tooltip.container.getBoundingClientRect(),\n };\n}\n\n/\n Calculates the document viewport size.\n * @ignore\n * @return {{x, y, width, height}}\n /\nfunction calcViewportRect() {\n const { pageXOffset, pageYOffset } = window;\n const { documentElement: { clientHeight, clientWidth } } = document;\n return {\n left: pageXOffset,\n right: pageXOffset + clientWidth,\n top: pageYOffset,\n bottom: pageYOffset + clientHeight,\n };\n}\n\n/\n Calculates tooltip and arrow positions for the placement just above\n * the cursor.\n * @ignore\n * @param {number} x Cursor page-x position.\n * @param {number} y Cursor page-y position.\n * @param {object} tooltipRects Bounding client rectangles of tooltip parts.\n * @param {object} tooltipRects.arrow\n * @param {object} tooltipRects.container\n * @return {object} Contains the following fields:\n * - {number} arrowX\n * - {number} arrowY\n * - {number} containerX\n * - {number} containerY\n * - {string} baseArrowStyle\n /\nfunction calcPositionAboveXY(x, y, tooltipRects) {\n const { arrow, container } = tooltipRects;\n return {\n arrowX: 0.5 (container.width - arrow.width),\n arrowY: container.height,\n containerX: x - container.width / 2,\n containerY: y - container.height - arrow.height / 1.5,\n\n // TODO: Instead of already setting the base style here, we should\n // introduce a set of constants for arrow directions, which will help\n // to do checks dependant on the arrow direction.\n baseArrowStyle: ARROW_STYLE_DOWN,\n };\n}\n\n/\nconst HIT = {\n NONE: false,\n LEFT: 'LEFT',\n RIGHT: 'RIGHT',\n TOP: 'TOP',\n BOTTOM: 'BOTTOM',\n};\n/\n\n/*\n Checks whether\n * @param {object} pos\n * @param {object} tooltipRects\n * @param {object} viewportRect\n * @return {HIT}\n /\n/\nfunction checkViewportFit(pos, tooltipRects, viewportRect) {\n const { containerX, containerY } = pos;\n if (containerX < viewportRect.left + 6) return HIT.LEFT;\n if (containerX > viewportRect.right - 6) return HIT.RIGHT;\n return HIT.NONE;\n}\n/\n\n/\n Shifts tooltip horizontally to fit into the viewport, while keeping\n * the arrow pointed to the XY point.\n * @param {number} x\n * @param {number} y\n * @param {object} pos\n * @param {number} pageXOffset\n * @param {number} pageXWidth\n /\n/\nfunction xPageFitCorrection(x, y, pos, pageXOffset, pageXWidth) {\n if (pos.containerX < pageXOffset + 6) {\n pos.containerX = pageXOffset + 6;\n pos.arrowX = Math.max(6, pageX - containerX - arrowRect.width / 2);\n } else {\n const maxX = pageXOffset + docRect.width - containerRect.width - 6;\n if (containerX > maxX) {\n containerX = maxX;\n arrowX = Math.min(\n containerRect.width - 6,\n pageX - containerX - arrowRect.width / 2,\n );\n }\n }\n}\n/\n\n/\n Sets positions of tooltip components to point the tooltip to the specified\n * page point.\n * @ignore\n * @param {number} pageX\n * @param {number} pageY\n * @param {PLACEMENTS} placement\n * @param {object} element DOM reference to the element wrapped by the tooltip.\n * @param {object} tooltip\n * @param {object} tooltip.arrow DOM reference to the tooltip arrow.\n * @param {object} tooltip.container DOM reference to the tooltip container.\n /\nfunction setComponentPositions(\n pageX,\n pageY,\n placement,\n element,\n tooltip,\n) {\n const tooltipRects = calcTooltipRects(tooltip);\n const viewportRect = calcViewportRect();\n\n / Default container coords: tooltip at the top. /\n const pos = calcPositionAboveXY(pageX, pageY, tooltipRects);\n\n if (pos.containerX < viewportRect.left + 6) {\n pos.containerX = viewportRect.left + 6;\n pos.arrowX = Math.max(\n 6,\n pageX - pos.containerX - tooltipRects.arrow.width / 2,\n );\n } else {\n const maxX = viewportRect.right - 6 - tooltipRects.container.width;\n if (pos.containerX > maxX) {\n pos.containerX = maxX;\n pos.arrowX = Math.min(\n tooltipRects.container.width - 6,\n pageX - pos.containerX - tooltipRects.arrow.width / 2,\n );\n }\n }\n\n / If tooltip has not enough space on top - make it bottom tooltip. /\n if (pos.containerY < viewportRect.top + 6) {\n pos.containerY += tooltipRects.container.height\n + 2 tooltipRects.arrow.height;\n pos.arrowY -= tooltipRects.container.height\n + tooltipRects.arrow.height;\n pos.baseArrowStyle = ARROW_STYLE_UP;\n }\n\n const containerStyle = `left:${pos.containerX}px;top:${pos.containerY}px`;\n tooltip.container.setAttribute('style', containerStyle);\n\n const arrowStyle = `${pos.baseArrowStyle};left:${pos.arrowX}px;top:${pos.arrowY}px`;\n tooltip.arrow.setAttribute('style', arrowStyle);\n}\n\n/* The Tooltip component itself. /\nconst Tooltip = forwardRef(({ children, theme }, ref) => {\n const [components, setComponents] = useState(null);\n\n const pointTo = (pageX, pageY, placement, element) => components\n && setComponentPositions(pageX, pageY, placement, element, components);\n useImperativeHandle(ref, () => ({ pointTo }));\n\n / Inits and destroys tooltip components. /\n useEffect(() => {\n const x = createTooltipComponents(theme);\n setComponents(x);\n return () => {\n document.body.removeChild(x.container);\n setComponents(null);\n };\n }, [theme]);\n\n return components ? createPortal(children, components.content) : null;\n});\n\nTooltip.propTypes = {\n children: PT.node,\n theme: PT.shape().isRequired,\n};\n\nTooltip.defaultProps = {\n children: null,\n};\n\nexport default Tooltip;\n","/ global window /\n\nimport PT from 'prop-types';\nimport { useEffect, useRef, useState } from 'react';\n\nimport { themed } from 'utils';\n\nimport Tooltip, { PLACEMENTS } from './Tooltip';\n\nimport defaultTheme from './default-theme.scss';\n\n/\n Implements a simple to use and themeable tooltip component, _e.g._\n * ```js\n * <WithTooltip tip=\"This is example tooltip.\">\n * <p>Hover to see the tooltip.</p>\n * </WithTooltip>\n * ```\n * Children: Children are rendered in the place of `<WithTooltip>`,\n * and when hovered the tooltip is shown. By default the wrapper itself is\n * `<div>` block with `display: inline-block`.\n * @param {object} props Component properties.\n * @param {React.node} props.tip – Anything React is able to render,\n * _e.g._ a tooltip text. This will be the tooltip content.\n * @param {WithTooltipTheme} props.theme _Ad hoc_ theme.\n /\nfunction Wrapper({\n children,\n placement,\n tip,\n theme,\n}) {\n const tooltipRef = useRef();\n const wrapperRef = useRef();\n const [showTooltip, setShowTooltip] = useState(false);\n\n const updatePortalPosition = (cursorX, cursorY) => {\n if (!showTooltip) setShowTooltip(true);\n else {\n const wrapperRect = wrapperRef.current.getBoundingClientRect();\n if (\n cursorX < wrapperRect.left\n \|\| cursorX > wrapperRect.right\n \|\| cursorY < wrapperRect.top\n \|\| cursorY > wrapperRect.bottom\n ) {\n setShowTooltip(false);\n } else if (tooltipRef.current) {\n tooltipRef.current.pointTo(\n cursorX + window.pageXOffset,\n cursorY + window.pageYOffset,\n placement,\n wrapperRef.current,\n );\n }\n }\n };\n\n useEffect(() => {\n if (showTooltip && tip !== null) {\n const listener = () => setShowTooltip(false);\n window.addEventListener('scroll', listener);\n return () => window.removeEventListener('scroll', listener);\n }\n return undefined;\n }, [showTooltip, tip]);\n\n return (\n <div\n className={theme.wrapper}\n onMouseLeave={() => setShowTooltip(false)}\n onMouseMove={(e) => updatePortalPosition(e.clientX, e.clientY)}\n ref={wrapperRef}\n >\n {\n showTooltip && tip !== null ? (\n <Tooltip ref={tooltipRef} theme={theme}>{tip}</Tooltip>\n ) : null\n }\n {children}\n </div>\n );\n}\n\nconst ThemedWrapper = themed(\n 'WithTooltip',\n [\n 'appearance',\n 'arrow',\n 'container',\n 'content',\n 'wrapper',\n ],\n defaultTheme,\n)(Wrapper);\n\nThemedWrapper.PLACEMENTS = PLACEMENTS;\n\nWrapper.propTypes = {\n children: PT.node,\n placement: PT.oneOf(Object.values(PLACEMENTS)),\n theme: ThemedWrapper.themeType.isRequired,\n tip: PT.node,\n};\n\nWrapper.defaultProps = {\n children: null,\n placement: PLACEMENTS.ABOVE_CURSOR,\n tip: null,\n};\n\nexport default ThemedWrapper;\n","// extracted by mini-css-extract-plugin\nexport default {\"arrow\":\"M9gywF\",\"ad\":\"_4xT7zE\",\"hoc\":\"zd-vnH\",\"context\":\"GdZucr\",\"container\":\"f9gY8K\",\"appearance\":\"L4ubm-\",\"wrapper\":\"_4qDBRM\"};","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"jTxmOX\",\"context\":\"dzIcLh\",\"ad\":\"_5a9XX1\",\"hoc\":\"_7sH52O\"};","import PT from 'prop-types';\nimport qs from 'qs';\nimport ScalableRect from 'components/ScalableRect';\nimport themed from '@dr.pogodin/react-themes';\nimport Throbber from 'components/Throbber';\n\nimport baseTheme from './base.scss';\nimport throbberTheme from './throbber.scss';\n\n/\n A component for embeding a YouTube video.\n * @param {object} [props] Component properties.\n * @param {boolean} [props.autoplay] If `true` the video will start to play\n * automatically once loaded.\n * @param {string} [props.src] URL of the video to play. Can be in any of\n * the following formats, and keeps any additional query parameters understood\n * by the YouTube IFrame player:\n * - `https://www.youtube.com/watch?v=NdF6Rmt6Ado`\n * - `https://youtu.be/NdF6Rmt6Ado`\n * - `https://www.youtube.com/embed/NdF6Rmt6Ado`\n * @param {YouTubeVideoTheme} [props.theme] _Ad hoc_ theme.\n * @param {string} [props.title] The `title` attribute to add to the player\n * IFrame.\n /\nfunction YouTubeVideo({\n autoplay,\n src,\n theme,\n title,\n}) {\n let [url, query] = src.split('?');\n query = query ? qs.parse(query) : {};\n\n const videoId = query.v \|\| url.match(/\\/([a-zA-Z0-9-_])$/)[1];\n url = `https://www.youtube.com/embed/${videoId}`;\n\n delete query.v;\n query.autoplay = autoplay ? 1 : 0;\n url += `?${qs.stringify(query)}`;\n\n // TODO: https://developers.google.com/youtube/player_parameters\n // More query parameters can be exposed via the component props.\n\n return (\n <ScalableRect className={theme.container} ratio=\"16:9\">\n <Throbber theme={throbberTheme} />\n <iframe\n allow=\"autoplay\"\n allowFullScreen\n className={theme.video}\n src={url}\n title={title}\n />\n </ScalableRect>\n );\n}\n\nconst ThemedYouTubeVideo = themed(\n 'YouTubeVideo',\n [\n 'container',\n 'video',\n ],\n baseTheme,\n)(YouTubeVideo);\n\nYouTubeVideo.propTypes = {\n autoplay: PT.bool,\n src: PT.string.isRequired,\n theme: ThemedYouTubeVideo.themeType.isRequired,\n title: PT.string,\n};\n\nYouTubeVideo.defaultProps = {\n autoplay: false,\n title: '',\n};\n\nexport default ThemedYouTubeVideo;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"sXHM81\",\"context\":\"veKyYi\",\"ad\":\"r3ABzd\",\"hoc\":\"YKcPnR\",\"video\":\"SlV2zw\"};","import 'styles/global.scss';\n\nimport { webpack } from 'utils';\n\nconst server = webpack.requireWeak('./server', __dirname);\n\nconst client = server ? undefined : require('./client').default;\n\nexport { default as api } from 'axios';\nexport * as PT from 'prop-types';\n\nexport {\n getGlobalState,\n getSsrContext,\n GlobalStateProvider,\n useAsyncCollection,\n useAsyncData,\n useGlobalState,\n} from '@dr.pogodin/react-global-state';\n\nexport * from 'components';\nexport * from 'utils';\n\nexport { client, server };\n"],"names":["root","factory","exports","module","require","define","amd","self","this","__WEBPACK_EXTERNAL_MODULE__899__","__WEBPACK_EXTERNAL_MODULE__198__","__WEBPACK_EXTERNAL_MODULE__300__","__WEBPACK_EXTERNAL_MODULE__760__","__WEBPACK_EXTERNAL_MODULE__467__","__WEBPACK_EXTERNAL_MODULE__99__","__WEBPACK_EXTERNAL_MODULE__656__","__WEBPACK_EXTERNAL_MODULE__156__","__WEBPACK_EXTERNAL_MODULE__111__","__WEBPACK_EXTERNAL_MODULE__715__","__WEBPACK_EXTERNAL_MODULE__383__","__WEBPACK_EXTERNAL_MODULE__128__","STATE","Object","defineProperty","value","Promise","constructor","executor","resolveRef","rejectRef","super","resolve","reject","p_state","RESOLVED","reason","REJECTED","PENDING","p_resolve","p_reject","resolved","rejected","settled","catch","onRejected","finally","onFinally","then","onFulfilled","res","p_listeners","hasListeners","length","listeners","addListener","listener","includes","push","removeListener","emit","args","i","idx","indexOf","splice","__awaiter","thisArg","_arguments","P","generator","fulfilled","step","next","e","result","done","apply","__importDefault","mod","__esModule","Barrier_1","ready","p_draining","p_drainLock","p_queue","p_ready","setReady","bool","p_drainQueue","seize","waitReady","barrier","default","shift","__createBinding","create","o","m","k","k2","undefined","desc","getOwnPropertyDescriptor","writable","configurable","enumerable","get","__exportStar","p","prototype","hasOwnProperty","call","Semaphore","Emitter","Barrier","Emitter_1","Semaphore_1","timer","Timer","YEAR_MS","DAY_MS","HOUR_MS","MIN_MS","SEC_MS","abort","p_abort","timeout","p_timeout","init","Error","id","setTimeout","bind","clearTimeout","inj","document","querySelector","remove","key","getBuildInfo","forge","content","d","start","iv","slice","update","finish","output","data","eval","getInj","Launch","Application","options","arguments","container","getElementById","scene","_jsx","GlobalStateProvider","initialState","ISTATE","children","BrowserRouter","dontHydrate","createRoot","render","hydrateRoot","buildInfo","BUILD_INFO","IS_CLIENT_SIDE","process","versions","node","global","REACT_UTILS_FORCE_CLIENT_SIDE","IS_SERVER_SIDE","isDevBuild","getMode","isProdBuild","buildTimestamp","timestamp","requireWeak","modulePath","basePath","path","def","named","entries","forEach","_ref","resolveWeak","parse","str","TypeError","obj","dec","decode","index","eqIdx","endIdx","lastIndexOf","trim","val","charCodeAt","tryDecode","serialize","name","opt","enc","encode","fieldContentRegExp","test","maxAge","isNaN","isFinite","Math","floor","domain","expires","__toString","Date","isDate","valueOf","toUTCString","httpOnly","secure","priority","toLowerCase","sameSite","toString","decodeURIComponent","encodeURIComponent","registerAlgorithm","mode","cipher","aes","Algorithm","startEncrypting","_createCipher","decrypt","createEncryptionCipher","startDecrypting","createDecryptionCipher","initialize","blockSize","encrypt","inBlock","outBlock","_updateBlock","_w","_init","tmp","util","isArray","createBuffer","putByte","len","getInt32","encryptOp","_expandKey","modes","ecb","cbc","cfb","ofb","ctr","gcm","sbox","isbox","rcon","mix","imix","Nb","xtime","Array","e2","e4","e8","sx","sx2","me","ime","ei","n","temp","w","iNk","Nk","end","m0","m1","m2","m3","wnew","wi","input","sub","a","b","c","a2","b2","c2","Nr","round","algorithm","toUpperCase","createDecipher","createCipher","ByteBuffer","api","_reverseAlphabets","alphabet","maxline","Uint8Array","base","first","charAt","digits","j","carry","at","_encodeWithByteBuffer","regex","RegExp","match","join","table","replace","bytes","Buffer","from","reverse","algorithms","getAlgorithm","BlockCipher","_finish","_input","_op","_decrypt","opts","putBuffer","compact","pad","unpad","overflow","afterFinish","transformIV","ints","blocks","inc32","block","from64To32","num","_ints","_inBlock","_outBlock","putInt32","padding","fillWithByte","count","truncate","_prev","_iv","_partialBlock","_partialOutput","_partialBytes","inputLength","partialBytes","clear","read","getBytes","putBytes","_R","additionalData","_cipherLength","_tagLength","tagLength","_tag","tag","_hashBlock","_hashSubkey","componentBits","_m","generateHashTable","ivLength","_j0","ghash","concat","_aDataLength","_s","rval","lengths","multiply","x","y","z_i","v_i","pow","out","lsb","tableMultiply","z","x_i","ah","h","bits","multiplier","perInt","size","shft","generateSubHashTable","mid","half","m_i","m_j","usePureJavaScript","baseN","_checkBitsParam","ByteStringBuffer","isArrayBuffer","isArrayBufferView","arr","String","fromCharCode","_constructedStringLength","nextTick","browser","setImmediate","callback","window","postMessage","msg","callbacks","addEventListener","event","source","stopPropagation","copy","MutationObserver","now","attr","div","createElement","observe","attributes","oldSetImmediate","setAttribute","isNodejs","globalScope","g","ArrayBuffer","buffer","byteLength","_optimizeConstructedString","substr","isEmpty","putString","encodeUtf8","putInt16","putInt24","putInt16Le","putInt24Le","putInt32Le","putInt","putSignedInt","getByte","getInt16","getInt24","getInt16Le","getInt24Le","getInt32Le","getInt","getSignedInt","max","min","setAt","last","toHex","decodeUtf8","DataBuffer","readOffset","growSize","DataView","byteOffset","write","writeOffset","accommodate","amount","src","dst","set","setUint8","encoding","view","ceil","binary","hex","base64","raw","Uint16Array","text","utf16","setInt16","setInt8","setInt32","getInt8","getUint8","utf8","fillString","s","xorBytes","s1","s2","s3","t","hexToBytes","parseInt","bytesToHex","int32ToBytes","_base64","_base64Idx","_base58","encode64","chr1","chr2","chr3","line","decode64","enc1","enc2","enc3","enc4","unescape","escape","base58","offset","subarray","deflate","substring","inflate","_setStorageObject","removeItem","JSON","stringify","setItem","error","message","_getStorageObject","getItem","_setItem","_getItem","_removeItem","empty","prop","_clearItems","_callStorageFunction","func","location","type","exception","localStorage","ex","clearItems","format","part","re","argi","parts","exec","lastIndex","code","formatNumber","number","decimals","dec_point","thousands_sep","abs","toFixed","formatSize","bytesFromIP","ip","bytesFromIPv4","bytesFromIPv6","split","blanks","zeros","filter","bytesToIP","bytesToIPv4","bytesToIPv6","zeroGroups","zeroMaxGroup","group","unshift","estimateCores","cores","navigator","hardwareConcurrency","Worker","Blob","blobUrl","URL","createObjectURL","st","et","sample","samples","numWorkers","avg","reduce","revokeObjectURL","workers","results","worker","terminate","map","err","overlaps","r1","overlap","r2","f","Symbol","for","l","__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED","ReactCurrentOwner","ref","__self","__source","q","defaultProps","$$typeof","props","_owner","current","Fragment","jsx","jsxs","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","getter","definition","globalThis","Function","r","toStringTag","config","CONFIG","cookie","CSRF","csrfToken","assign","dayjs","useCurrent","autorefresh","globalStatePath","precision","setter","useGlobalState","useEffect","timerId","old","neu","useTimezoneOffset","cookieName","ssrContext","getSsrContext","setOffset","req","cookies","getTimezoneOffset","Cookie","newBarrier","chunkGroups","styleSheetUsageCounters","NODE_CONFIG_ENV","CodeSplit","chunkName","getComponent","placeholder","heap","useRef","mounted","pendingStyles","publicPath","LazyComponent","lazy","async","all","chunks","getGlobalState","asset","endsWith","link","onload","onerror","appendChild","item","removeChild","Suspense","fallback","splitComponent","CHUNK_GROUPS","propTypes","PT","themed","COMPOSE","PRIORITY","env","JU","webpack","withRetries","action","maxRetries","interval","time","GenericLink","className","disabled","enforceA","keepScrollPosition","onClick","onMouseDown","openNewTab","routerLinkType","to","rest","href","preventDefault","rel","target","scroll","Link","RrLink","BaseButton","active","theme","button","onKeyDown","role","tabIndex","ThemedButton","themeType","isRequired","Checkbox","checked","label","onChange","_jsxs","checkbox","ThemedCheckbox","Dropdown","optionArray","hiddenOption","op","isString","option","select","arrow","ThemedDropdown","Input","forwardRef","ThemedInput","PageLayout","leftSidePanelContent","rightSidePanelContent","sidePanel","leftSidePanel","mainPanel","rightSidePanel","ThemedPageLayout","Context","createContext","MetaTags","description","image","siteName","socialDescription","socialTitle","title","url","socTitle","socDesc","context","useMemo","_Fragment","Helmet","Provider","BaseModal","onCancel","containerRef","overlayRef","portal","setPortal","useState","body","classList","add","focusLast","onFocus","elems","querySelectorAll","focus","activeElement","ReactDom","overlay","onWheel","ThemedModal","noop","NavLink","RrNavLink","ScalableRect","ratio","aux","paddingBottom","rect","style","Throbber","circle","PLACEMENTS","ABOVE_CURSOR","ABOVE_ELEMENT","BELOW_CURSOR","BELOW_ELEMENT","ARROW_STYLE_DOWN","ARROW_STYLE_UP","Tooltip","components","setComponents","pointTo","pageX","pageY","placement","element","tooltip","tooltipRects","getBoundingClientRect","calcTooltipRects","viewportRect","pageXOffset","pageYOffset","documentElement","clientHeight","clientWidth","left","right","top","bottom","calcViewportRect","pos","arrowX","width","arrowY","height","containerX","containerY","baseArrowStyle","calcPositionAboveXY","maxX","containerStyle","arrowStyle","setComponentPositions","useImperativeHandle","createTooltipComponents","createPortal","Wrapper","tip","tooltipRef","wrapperRef","showTooltip","setShowTooltip","removeEventListener","wrapper","onMouseLeave","onMouseMove","updatePortalPosition","cursorX","cursorY","wrapperRect","clientX","clientY","ThemedWrapper","values","YouTubeVideo","autoplay","query","qs","videoId","v","throbberTheme","allow","allowFullScreen","video","ThemedYouTubeVideo","server","client"],"sourceRoot":""}
1	+ {"version":3,"file":"web.bundle.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,EAAQG,QAAQ,wBAAyBA,QAAQ,kCAAmCA,QAAQ,4BAA6BA,QAAQ,SAAUA,QAAQ,SAAUA,QAAQ,UAAWA,QAAQ,sBAAuBA,QAAQ,wBAAyBA,QAAQ,cAAeA,QAAQ,MAAOA,QAAQ,SAAUA,QAAQ,aAAcA,QAAQ,oBAAqBA,QAAQ,gBAAiBA,QAAQ,qBACpX,mBAAXC,QAAyBA,OAAOC,IAC9CD,OAAO,CAAC,uBAAwB,iCAAkC,2BAA4B,QAAS,QAAS,SAAU,qBAAsB,uBAAwB,aAAc,KAAM,QAAS,YAAa,mBAAoB,eAAgB,oBAAqBJ,GACjP,iBAAZC,QACdA,QAAQ,2BAA6BD,EAAQG,QAAQ,wBAAyBA,QAAQ,kCAAmCA,QAAQ,4BAA6BA,QAAQ,SAAUA,QAAQ,SAAUA,QAAQ,UAAWA,QAAQ,sBAAuBA,QAAQ,wBAAyBA,QAAQ,cAAeA,QAAQ,MAAOA,QAAQ,SAAUA,QAAQ,aAAcA,QAAQ,oBAAqBA,QAAQ,gBAAiBA,QAAQ,qBAEjaJ,EAAK,2BAA6BC,EAAQD,EAAK,wBAAyBA,EAAK,kCAAmCA,EAAK,4BAA6BA,EAAY,MAAGA,EAAY,MAAGA,EAAa,OAAGA,EAAK,sBAAuBA,EAAK,wBAAyBA,EAAK,cAAeA,EAAS,GAAGA,EAAY,MAAGA,EAAK,aAAcA,EAAK,oBAAqBA,EAAK,gBAAiBA,EAAK,oBAClX,CATD,CASmB,oBAATO,KAAuBA,KAAOC,MAAM,SAASC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,+BAAgCC,iCAAkCC,gCAAiCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,iCAAkCC,kCAChhB,+rBCIA,IAAIC,IAA0B,oBAAbC,UACZA,SAASC,cAAc,6BAE5B,GAAIF,IAAK,CACPA,IAAIG,SACJ,MAAM,IAAEC,MAAQC,EAAAA,+DAAAA,KAChBL,IAAMM,4DAAAA,KAAAA,SAAoBN,IAAIO,SAC9B,MAAMC,EAAIF,4DAAAA,OAAAA,eAA4B,UAAWF,KACjDI,EAAEC,MAAM,CAAEC,GAAIV,IAAIW,MAAM,EAAGP,IAAIQ,UAC/BJ,EAAEK,OAAOP,4DAAAA,KAAAA,aAAwBN,IAAIW,MAAMP,IAAIQ,UAC/CJ,EAAEM,SACFd,IAAMM,4DAAAA,KAAAA,WAAsBE,EAAEO,OAAOC,MACrChB,IAAMiB,KAAM,IAAGjB,OACjB,MAIEA,IAAM,CAAC,EAGM,SAASkB,SACtB,OAAOlB,GACT,wGCrBe,SAASmB,EAAOC,GAA2B,IAAdC,EAAOC,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACrD,MAAME,EAAYvB,SAASwB,eAAe,cACpCC,GACJC,EAAAA,EAAAA,KAACC,EAAAA,oBAAmB,CAACC,cAAcX,EAAAA,EAAAA,KAASY,OAAOC,UACjDJ,EAAAA,EAAAA,KAACK,EAAAA,cAAa,CAAAD,UACZJ,EAAAA,EAAAA,KAACP,EAAW,QAKdC,EAAQY,aACGC,EAAAA,EAAAA,YAAWV,GACnBW,OAAOT,IACPU,EAAAA,EAAAA,aAAYZ,EAAWE,EAChC,uBCzBA,IAAIW,EA2BG,SAAShC,IACd,QAAkBkB,IAAdc,EACF,MAAMC,MAAM,6CAEd,OAAOD,CACT,iCA1B0B,oBAAfE,aAA4BF,EAAYE,wFCL5C,MAAMC,EAAoC,iBAAZC,UAC/BA,QAAQC,WAAaD,QAAQC,SAASC,QACrCC,EAAAA,EAAOC,8BAKDC,GAAkBN,kRCIxB,SAASO,IACd,OAAOC,CACT,CAOO,SAASC,IACd,OAAOD,CACT,CAMO,SAASE,IACd,OAAO7C,EAAAA,EAAAA,KAAe8C,SACxB,oUC1BO,SAASC,YAAYC,WAAYC,UACtC,GAAId,wCAAAA,eAAgB,OAAO,KAE3B,IAEE,MAAM,QAAEe,SAAYtC,KAAK,UAALA,CAAgB,QAC9BuC,KAAOF,SAAWC,QAAQD,SAAUD,YAAcA,YAChDI,QAASC,OAAQC,OAAU1C,KAAK,UAALA,CAAgBuC,MAGnD,OAAKE,KAELE,OAAOC,QAAQF,OAAOG,SAAQC,IAAkB,IAAhB3D,EAAK4D,GAAMD,EACzC,GAAIL,IAAItD,GAAM,MAAMkC,MAAM,8CAC1BoB,IAAItD,GAAO4D,CAAK,IAEXN,KANUC,KAOnB,CAAE,MACA,OAAO,IACT,CACF,CAUO,SAASM,YAAYZ,GAC1B,OAAOA,CACT,qBC3BA3E,EAAQwF,MAgCR,SAAeC,EAAK9C,GAClB,GAAmB,iBAAR8C,EACT,MAAM,IAAIC,UAAU,iCAQtB,IALA,IAAIC,EAAM,CAAC,EAEPC,GADMjD,GAAW,CAAC,GACRkD,QAAUA,EAEpBC,EAAQ,EACLA,EAAQL,EAAIvD,QAAQ,CACzB,IAAI6D,EAAQN,EAAIO,QAAQ,IAAKF,GAG7B,IAAe,IAAXC,EACF,MAGF,IAAIE,EAASR,EAAIO,QAAQ,IAAKF,GAE9B,IAAgB,IAAZG,EACFA,EAASR,EAAIvD,YACR,GAAI+D,EAASF,EAAO,CAEzBD,EAAQL,EAAIS,YAAY,IAAKH,EAAQ,GAAK,EAC1C,QACF,CAEA,IAAIrE,EAAM+D,EAAIxD,MAAM6D,EAAOC,GAAOI,OAGlC,QAAItD,IAAc8C,EAAIjE,GAAM,CAC1B,IAAI0E,EAAMX,EAAIxD,MAAM8D,EAAQ,EAAGE,GAAQE,OAGb,KAAtBC,EAAIC,WAAW,KACjBD,EAAMA,EAAInE,MAAM,GAAI,IAGtB0D,EAAIjE,GAAO4E,EAAUF,EAAKR,EAC5B,CAEAE,EAAQG,EAAS,CACnB,CAEA,OAAON,CACT,EA7EA3F,EAAQuG,UA+FR,SAAmBC,EAAMJ,EAAKzD,GAC5B,IAAI8D,EAAM9D,GAAW,CAAC,EAClB+D,EAAMD,EAAIE,QAAUA,EAExB,GAAmB,mBAARD,EACT,MAAM,IAAIhB,UAAU,4BAGtB,IAAKkB,EAAmBC,KAAKL,GAC3B,MAAM,IAAId,UAAU,4BAGtB,IAAIJ,EAAQoB,EAAIN,GAEhB,GAAId,IAAUsB,EAAmBC,KAAKvB,GACpC,MAAM,IAAII,UAAU,2BAGtB,IAAID,EAAMe,EAAO,IAAMlB,EAEvB,GAAI,MAAQmB,EAAIK,OAAQ,CACtB,IAAIA,EAASL,EAAIK,OAAS,EAE1B,GAAIC,MAAMD,KAAYE,SAASF,GAC7B,MAAM,IAAIpB,UAAU,4BAGtBD,GAAO,aAAewB,KAAKC,MAAMJ,EACnC,CAEA,GAAIL,EAAIU,OAAQ,CACd,IAAKP,EAAmBC,KAAKJ,EAAIU,QAC/B,MAAM,IAAIzB,UAAU,4BAGtBD,GAAO,YAAcgB,EAAIU,MAC3B,CAEA,GAAIV,EAAI3B,KAAM,CACZ,IAAK8B,EAAmBC,KAAKJ,EAAI3B,MAC/B,MAAM,IAAIY,UAAU,0BAGtBD,GAAO,UAAYgB,EAAI3B,IACzB,CAEA,GAAI2B,EAAIW,QAAS,CACf,IAAIA,EAAUX,EAAIW,QAElB,IA2FJ,SAAiBhB,GACf,MAAgC,kBAAzBiB,EAAWC,KAAKlB,IACrBA,aAAemB,IACnB,CA9FSC,CAAOJ,IAAYL,MAAMK,EAAQK,WACpC,MAAM,IAAI/B,UAAU,6BAGtBD,GAAO,aAAe2B,EAAQM,aAChC,CAUA,GARIjB,EAAIkB,WACNlC,GAAO,cAGLgB,EAAImB,SACNnC,GAAO,YAGLgB,EAAIoB,SAKN,OAJuC,iBAAjBpB,EAAIoB,SACtBpB,EAAIoB,SAASC,cACbrB,EAAIoB,UAGN,IAAK,MACHpC,GAAO,iBACP,MACF,IAAK,SACHA,GAAO,oBACP,MACF,IAAK,OACHA,GAAO,kBACP,MACF,QACE,MAAM,IAAIC,UAAU,8BAI1B,GAAIe,EAAIsB,SAIN,OAHuC,iBAAjBtB,EAAIsB,SACtBtB,EAAIsB,SAASD,cAAgBrB,EAAIsB,UAGnC,KAAK,EACHtC,GAAO,oBACP,MACF,IAAK,MACHA,GAAO,iBACP,MACF,IAAK,SACHA,GAAO,oBACP,MACF,IAAK,OACHA,GAAO,kBACP,MACF,QACE,MAAM,IAAIC,UAAU,8BAI1B,OAAOD,CACT,EAnMA,IAAI4B,EAAanC,OAAO8C,UAAUC,SAU9BrB,EAAqB,wCAkMzB,SAASf,EAAQJ,GACf,OAA6B,IAAtBA,EAAIO,QAAQ,KACfkC,mBAAmBzC,GACnBA,CACN,CASA,SAASkB,EAAQP,GACf,OAAO+B,mBAAmB/B,EAC5B,CAsBA,SAASE,EAAUb,EAAKI,GACtB,IACE,OAAOA,EAAOJ,EAChB,CAAE,MAAO2C,GACP,OAAO3C,CACT,CACF,uBCpQa,IAAI4C,EAAE,EAAQ,KAASC,EAAEC,OAAOC,IAAI,iBAAiBC,EAAEF,OAAOC,IAAI,kBAAkBE,EAAExD,OAAO8C,UAAUW,eAAeC,EAAEP,EAAEQ,mDAAmDC,kBAAkBC,EAAE,CAACrH,KAAI,EAAGsH,KAAI,EAAGC,QAAO,EAAGC,UAAS,GAChP,SAASC,EAAEC,EAAEC,EAAEC,GAAG,IAAIC,EAAEzH,EAAE,CAAC,EAAEsG,EAAE,KAAKoB,EAAE,KAAiF,IAAID,UAAhF,IAASD,IAAIlB,EAAE,GAAGkB,QAAG,IAASD,EAAE3H,MAAM0G,EAAE,GAAGiB,EAAE3H,UAAK,IAAS2H,EAAEL,MAAMQ,EAAEH,EAAEL,KAAcK,EAAEX,EAAEpB,KAAK+B,EAAEE,KAAKR,EAAEJ,eAAeY,KAAKzH,EAAEyH,GAAGF,EAAEE,IAAI,GAAGH,GAAGA,EAAEK,aAAa,IAAIF,KAAKF,EAAED,EAAEK,kBAAe,IAAS3H,EAAEyH,KAAKzH,EAAEyH,GAAGF,EAAEE,IAAI,MAAM,CAACG,SAASpB,EAAEqB,KAAKP,EAAE1H,IAAI0G,EAAEY,IAAIQ,EAAEI,MAAM9H,EAAE+H,OAAOjB,EAAEkB,QAAQ,CAAC9J,EAAQ+J,SAAStB,EAAEzI,EAAQgK,IAAIb,EAAEnJ,EAAQiK,KAAKd,uBCPxWlJ,EAAOD,QAAU,EAAjB,sBCHFC,EAAOD,QAAUO,kDCAjBN,EAAOD,QAAUQ,kDCAjBP,EAAOD,QAAUS,kDCAjBR,EAAOD,QAAUU,kDCAjBT,EAAOD,QAAUW,kDCAjBV,EAAOD,QAAUY,gDCAjBX,EAAOD,QAAUa,gDCAjBZ,EAAOD,QAAUc,iDCAjBb,EAAOD,QAAUe,iDCAjBd,EAAOD,QAAUgB,kDCAjBf,EAAOD,QAAUiB,kDCAjBhB,EAAOD,QAAUkB,kDCAjBjB,EAAOD,QAAUmB,kDCAjBlB,EAAOD,QAAUoB,kDCAjBnB,EAAOD,QAAUqB,mCCCb6I,yBAA2B,CAAC,EAGhC,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeH,yBAAyBE,GAC5C,QAAqBvH,IAAjBwH,EACH,OAAOA,EAAarK,QAGrB,IAAIC,EAASiK,yBAAyBE,GAAY,CAGjDpK,QAAS,CAAC,GAOX,OAHAsK,oBAAoBF,GAAUnK,EAAQA,EAAOD,QAASmK,qBAG/ClK,EAAOD,OACf,CCrBAmK,oBAAoBvB,EAAI,SAAS3I,GAChC,IAAIsK,EAAStK,GAAUA,EAAOuK,WAC7B,WAAa,OAAOvK,EAAgB,OAAG,EACvC,WAAa,OAAOA,CAAQ,EAE7B,OADAkK,oBAAoBrI,EAAEyI,EAAQ,CAAElB,EAAGkB,IAC5BA,CACR,ECNAJ,oBAAoBrI,EAAI,SAAS9B,EAASyK,GACzC,IAAI,IAAI/I,KAAO+I,EACXN,oBAAoBO,EAAED,EAAY/I,KAASyI,oBAAoBO,EAAE1K,EAAS0B,IAC5EwD,OAAOyF,eAAe3K,EAAS0B,EAAK,CAAEkJ,YAAY,EAAMC,IAAKJ,EAAW/I,IAG3E,ECPAyI,oBAAoBb,EAAI,WACvB,GAA0B,iBAAfwB,WAAyB,OAAOA,WAC3C,IACC,OAAOxK,MAAQ,IAAIyK,SAAS,cAAb,EAChB,CAAE,MAAO3C,GACR,GAAsB,iBAAX4C,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBb,oBAAoBO,EAAI,SAAS/E,EAAKsF,GAAQ,OAAO/F,OAAO8C,UAAUW,eAAerB,KAAK3B,EAAKsF,EAAO,ECCtGd,oBAAoBe,EAAI,SAASlL,GACX,oBAAXuI,QAA0BA,OAAO4C,aAC1CjG,OAAOyF,eAAe3K,EAASuI,OAAO4C,YAAa,CAAE7F,MAAO,WAE7DJ,OAAOyF,eAAe3K,EAAS,aAAc,CAAEsF,OAAO,GACvD,6/CCDA,MAAM8F,GACJtH,EAAAA,EAEI5D,oBAAAA,KAAAA,IAAmCmL,QACnC3G,EAAAA,EAAAA,aAAY,YACb,CAAC,EAKN,GAAIZ,EAAAA,GAAsC,oBAAbvC,SAA0B,CACrD,MAAM+J,EAASpL,oBAAQ,KACvBkL,EAAOG,KAAOD,EAAO9F,MAAMjE,SAAS+J,QAAQE,SAC9C,CAEA,iOCgFAC,EAAAA,EAAAA,QAAOC,IAAO,CACZC,OAAM,SACNC,QAAO,UACPC,OAAM,SACNC,OAAM,SACNC,QAAO,UACPC,IAAKzE,KAAKyE,IACVC,MAAK,QACLC,WAtEK,WAIC,IAJmB,YACzBC,GAAc,EAAK,gBACnBC,EAAkB,cAAa,UAC/BC,EAAY,EAAIX,IAAAA,QACjB9I,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACH,MAAOoJ,EAAKM,IAAUC,EAAAA,EAAAA,gBAAeH,EAAiB7E,KAAKyE,KAe3D,OAdAQ,EAAAA,EAAAA,YAAU,KACR,IAAIC,EACJ,MAAMtK,EAASA,KACbmK,GAAQI,IACN,MAAMC,EAAMpF,KAAKyE,MACjB,OAAO/E,KAAK2F,IAAID,EAAMD,GAAOL,EAAYM,EAAMD,CAAG,IAEhDP,IAAaM,EAAUI,WAAW1K,EAAQkK,GAAU,EAG1D,OADAlK,IACO,KACDsK,GAASK,aAAaL,EAAQ,CACnC,GACA,CAACN,EAAaE,EAAWC,IACrBN,CACT,EAkDEe,kBA7BK,WAGC,IAH0B,WAChCC,EAAa,iBAAgB,gBAC7BZ,EAAkB,kBACnBxJ,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,CAAC,EACH,MAAMqK,GAAaC,EAAAA,EAAAA,gBAAc,IAC1BC,EAAQC,IAAab,EAAAA,EAAAA,gBAAeH,GAAiB,KAC1D,MAAM9G,EAAQ0H,GAAcC,GAAYI,KAAKC,UAAUN,GACvD,OAAO1H,EAAQiI,SAASjI,EAAO,IAAM,CAAC,IAUxC,OARAkH,EAAAA,EAAAA,YAAU,KACR,MACMlH,GADO,IAAIiC,MACEiG,oBACnBJ,EAAU9H,GACN0H,IACFzL,SAAS+J,OAASmC,EAAAA,UAAiBT,EAAY1H,EAAO,CAAER,KAAM,MAChE,GACC,CAACkI,EAAYI,IACTD,CACT,IAcA,MAAezB,ICtGR,SAASgC,EAAWC,GACzB,OAAO,IAAIC,EAAAA,QAAQD,EACrB,qFCSA,IAAIE,EACAC,ECAAC,EDOW,SAASC,EAAS3I,GAM9B,IAN+B,SAChChC,EAAQ,UACR4K,EAAS,aACTC,EAAY,YACZC,KACGvE,GACJvE,EACC,MAAQyE,QAASsE,IAASC,EAAAA,EAAAA,QAAO,CAC/BC,SAAS,EACTC,cAAe,MAEX,WAAEC,IAAe7M,EAAAA,EAAAA,gBAMjB8M,GAAgBC,EAAAA,EAAAA,OAAKC,UACzB,MAAMC,QAAYV,IAElB,OADIE,EAAKG,cAAcrM,cAAc2M,QAAQC,IAAIV,EAAKG,eAC/CK,EAAI7J,QAAU6J,EAAM,CAAE7J,QAAS6J,EAAK,IAG7C,GAAIxK,EAAAA,eAAgB,CAClB,MAAM,OAAE2K,IAAWC,EAAAA,EAAAA,kBAAiB/B,WACpC,GAAI8B,EAAOE,SAAShB,GAClB,MAAMrK,MAAO,yBAAwBqK,MAChCc,EAAOG,KAAKjB,EACrB,MAAYG,EAAKE,UACfF,EAAKE,SAAU,EAEfT,EAAYI,GAAW7I,SAAS+J,IAC9B,IAAKA,EAAMC,SAAS,QAAS,OAC7B,MAAMtK,EAAQ,GAAE0J,KAAcW,IAC9B,IAAIE,EAAO9N,SAASC,cAAe,cAAasD,OAChD,IAAKuK,EAAM,CACTA,EAAO9N,SAAS+N,cAAc,QAC9BD,EAAKE,aAAa,OAAQzK,GAC1BuK,EAAKE,aAAa,MAAO,cAEzB,MAAMC,EAAU9B,IAChB2B,EAAKI,OAASD,EAAQ3K,QAItBwK,EAAKK,QAAUF,EAAQ3K,QAEvBuJ,EAAKG,cAAcW,KAAKM,GAEXjO,SAASC,cAAc,QAC/BmO,YAAYN,EACnB,CAEA,MAAMO,EAAQ9B,EAAwBhJ,IAAS,EAC/CgJ,EAAwBhJ,GAAQ8K,EAAQ,CAAC,KAkB7C,OAbApD,EAAAA,EAAAA,YAAU,IAAM,KACd4B,EAAKE,SAAU,EACfT,EAAYI,GAAW7I,SAASyK,IAC9B,IAAKA,EAAKT,SAAS,QAAS,OAC5B,MAAMtK,EAAQ,GAAE0J,KAAcqB,IAC9B,KAAM/B,EAAwBhJ,IAAS,EAAG,CACxC,MAAMuK,EAAO9N,SAASC,cAAe,cAAasD,OACrCvD,SAASC,cAAc,QAC/BsO,YAAYT,EACnB,IACA,GACD,CAACpB,EAAWG,EAAMI,KAGnBvL,EAAAA,EAAAA,KAAC8M,EAAAA,SAAQ,CAACC,SAAU7B,EAAY9K,UAC9BJ,EAAAA,EAAAA,KAACwL,EAAa,IAAK7E,EAAKvG,SACrBA,KAIT,CE3Fe,SAAS4M,EAAc5K,GAInC,IAJoC,UACrC4I,EAAS,aACTC,EAAY,YACZC,GACD9I,EAEC,OAAO,eAAC,SAAEhC,KAAauG,GAAOhH,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,CAAC,EAAC,OAAK0M,EAAAA,EAAAA,eACtCtB,EACA,IACKpE,EACHqE,YACAC,eACAC,eAEF9K,EACD,CACH,CFVIS,EAAAA,iBAEF+J,EAAc3N,oBAAAA,KAAAA,IAAmCgQ,cAAgB,CAAC,EAClEpC,EAA0B,CAAC,GAoF7BE,EAAUmC,UAAY,CACpB9M,SAAU+M,IAAAA,KACVnC,UAAWmC,IAAAA,OAAAA,WACXlC,aAAckC,IAAAA,KAAAA,WACdjC,YAAaiC,IAAAA,MAGfpC,EAAUvE,aAAe,CACvBpG,cAAUR,EACVsL,iBAAatL,GCvGfwN,IAAAA,QAAiBC,EAAAA,QACjBD,IAAAA,SAAkBE,EAAAA,SAMlB,IACExC,EAAkBhK,QAAQyM,IAAIzC,eAChC,CAAE,MAAkB,CAEpB,MACM0C,EAAa,gBADP1C,GAAmBhK,eACI2M,EAAQhM,YAAY,cAqChDiK,eAAegC,EAAYC,GAAyC,IAAjCC,EAAUjO,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,EAAGkO,EAAQlO,UAAAV,OAAA,QAAAW,IAAAD,UAAA,GAAAA,UAAA,GAAG,IAEnE,IAAK,IAAIgG,EAAI,KAAOA,EAClB,IACE,aAAagI,GACf,CAAE,MAAOG,GACP,KAAInI,EAAIiI,GACH,MAAME,QADeC,EAAK/E,MAAM6E,EAEvC,CAGJ,sFE7Be,SAASG,EAAW5L,GAahC,IAbiC,SAClChC,EAAQ,UACR6N,EAAS,SACTC,EAAQ,SACRC,EAAQ,mBACRC,EAAkB,QAClBC,EAAO,YACPC,EAAW,WACXC,EAAU,QACVC,EAAO,eACPC,EAAc,GACdC,KACGC,GACJvM,EAMC,OAAI8L,GAAYC,GAAYI,GAAcG,EAAGE,MAAM,0BAE/C5O,EAAAA,EAAAA,KAAA,KACEiO,WAAWA,EAAAA,EAAS,iBACpBC,SAAUA,EACVW,KAAMH,EACNL,QAASH,EAAY/I,GAAMA,EAAE2J,iBAAmBT,EAChDC,YAAaJ,EAAY/I,GAAMA,EAAE2J,iBAAmBR,EACpDS,IAAI,sBAEJC,OAAQT,EAAa,SAAW,GAAGnO,SAElCA,KAMAiM,EAAAA,EAAAA,eAAcoC,EAAgB,CACnCR,YACAC,WACAI,cACAE,UACAE,KACAL,QAAUlJ,IAEJkJ,GAASA,EAAQlJ,GAGhBiJ,GAAoBrG,OAAOkH,OAAO,EAAG,EAAE,KAE3CN,GACFvO,EACL,CCvFe,SAAS8O,EAAKvI,GAE3B,OAAO3G,EAAAA,EAAAA,KAACgO,EAAW,IAAKrH,EAAO8H,eAAgBU,EAAAA,MAEjD,CCNA,SAASC,EAAUhN,GAWhB,IAXiB,OAClBiN,EAAM,SACNjP,EAAQ,SACR8N,EAAQ,SACRC,EAAQ,QACRE,EAAO,YACPC,EAAW,WACXC,EAAU,QACVC,EAAO,MACPc,EAAK,GACLZ,GACDtM,EACK6L,EAAYqB,EAAMC,OAEtB,OADIF,GAAUC,EAAMD,SAAQpB,GAAc,IAAGqB,EAAMD,UAC/CnB,GACEoB,EAAMpB,WAAUD,GAAc,IAAGqB,EAAMpB,aAEzClO,EAAAA,EAAAA,KAAA,OAAKiO,UAAWA,EAAU7N,SACvBA,KAIHsO,GAEA1O,EAAAA,EAAAA,KAACkP,EAAI,CACHjB,UAAWA,EACXE,SAAUA,EACVE,QAASA,EACTC,YAAaA,EACbC,WAAYA,EACZC,QAASA,EACTE,GAAIA,EAAGtO,SAENA,KAKLJ,EAAAA,EAAAA,KAAA,OACEiO,UAAWA,EACXI,QAASA,EACTmB,UAAWnB,EACXC,YAAaA,EACbmB,KAAK,SACLC,SAAU,EAAEtP,SAEXA,GAGP,CF0CA4N,EAAYxH,aAAe,CACzBpG,SAAU,KACV6N,UAAW,KACXC,UAAU,EACVC,UAAU,EACVC,oBAAoB,EACpBC,QAAS,KACTC,YAAa,KACbC,YAAY,EACZC,SAAS,EACTE,GAAI,IAGNV,EAAYd,UAAY,CACtB9M,SAAU+M,IAAAA,KACVc,UAAWd,IAAAA,OACXe,SAAUf,IAAAA,KACVgB,SAAUhB,IAAAA,KACViB,mBAAoBjB,IAAAA,KACpBkB,QAASlB,IAAAA,KACTmB,YAAanB,IAAAA,KACboB,WAAYpB,IAAAA,KACZqB,QAASrB,IAAAA,KACTsB,eAAgBtB,IAAAA,YAAAA,WAChBuB,GAAIvB,IAAAA,UAAa,CAACA,IAAAA,OAAWA,IAAAA,UEzD/B,MAAMwC,EAAevC,IAAO,SAAU,CACpC,SACA,SACA,YCtEF,CAAgB,OAAS,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,UAAU,OAAS,SAAS,SAAW,UDmE5FA,CAIJgC,GA4BjBA,EAAW5I,aAAe,CACxB6I,QAAQ,EACRjP,cAAUR,EACVsO,UAAU,EACVC,UAAU,EACVE,aAASzO,EACT0O,iBAAa1O,EACb2O,YAAY,EACZC,SAAS,EACTE,QAAI9O,GAGNwP,EAAWlC,UAAY,CACrBmC,OAAQlC,IAAAA,KACR/M,SAAU+M,IAAAA,KACVe,SAAUf,IAAAA,KACVgB,SAAUhB,IAAAA,KACVkB,QAASlB,IAAAA,KACTmB,YAAanB,IAAAA,KACboB,WAAYpB,IAAAA,KACZqB,QAASrB,IAAAA,KACTmC,MAAOK,EAAaC,UAAUC,WAC9BnB,GAAIvB,IAAAA,UAAa,CAACA,IAAAA,OAAWA,IAAAA,UAG/B,QEvHA,SAAS2C,EAAQ1N,GAKd,IALe,QAChB2N,EAAO,MACPC,EAAK,SACLC,EAAQ,MACRX,GACDlN,EACC,OACE8N,EAAAA,EAAAA,MAAA,OAAKjC,UAAWqB,EAAMzP,UAAUO,SAAA,MAClBR,IAAVoQ,EAAsB,MAAOhQ,EAAAA,EAAAA,KAAA,KAAGiO,UAAWqB,EAAMU,MAAM5P,SAAE4P,KAC3DhQ,EAAAA,EAAAA,KAAA,SACE+P,QAASA,EACT9B,UAAWqB,EAAMa,SACjBF,SAAUA,EACVvJ,KAAK,eAIb,CASA,MAAM0J,EAAiBhD,IAAO,WAAY,CACxC,WACA,YACA,SClCF,CAAgB,SAAW,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,SAAS,MAAQ,WD+B1FA,CAIN0C,GAYjBA,EAAS5C,UAAY,CACnB6C,QAAS5C,IAAAA,KACT6C,MAAO7C,IAAAA,OACP8C,SAAU9C,IAAAA,KACVmC,MAAOc,EAAeR,UAAUC,YAGlCC,EAAStJ,aAAe,CACtBuJ,aAASnQ,EACToQ,WAAOpQ,EACPqQ,cAAUrQ,GAGZ,QEnCA,SAASyQ,EAAQjO,GAOd,IAPe,OAChBkO,EAAM,MACNN,EAAK,SACLC,EAAQ,QACRvQ,EAAO,MACP4P,EAAK,MACLjN,GACDD,EACC,MAAMmO,EAAc,EAClBvQ,EAAAA,EAAAA,KAAA,UACEiO,UAAWqB,EAAMkB,aAAapQ,SAE/B,KADK,6BAKR,IAAK,IAAIqQ,EAAI,EAAGA,EAAI/Q,EAAQT,SAAUwR,EAAG,CACvC,IAAIC,EAAKhR,EAAQ+Q,GACZH,IAAUA,EAAOI,MAChBC,EAAAA,EAAAA,UAASD,KAAKA,EAAK,CAAErO,MAAOqO,IAChCH,EAAYtE,MACVjM,EAAAA,EAAAA,KAAA,UAAQiO,UAAWqB,EAAMsB,OAAuBvO,MAAOqO,EAAGrO,MAAMjC,cACjDR,IAAZ8Q,EAAGnN,KAAqBmN,EAAGrO,MAAQqO,EAAGnN,MADHmN,EAAGrO,QAK/C,CACA,OACE6N,EAAAA,EAAAA,MAAA,OAAKjC,UAAWqB,EAAMzP,UAAUO,SAAA,MAClBR,IAAVoQ,EAAsB,MAAOhQ,EAAAA,EAAAA,KAAA,KAAGiO,UAAWqB,EAAMU,MAAM5P,SAAE4P,KAC3DhQ,EAAAA,EAAAA,KAAA,UACEiO,UAAWqB,EAAMuB,OACjBZ,SAAUA,EACV5N,MAAOA,EAAMjC,SAEZmQ,KAEHvQ,EAAAA,EAAAA,KAAA,OAAKiO,UAAWqB,EAAMwB,MAAM1Q,SAAC,QAGnC,CAEA,MAAM2Q,EAAiB3D,IAAO,WAAY,CACxC,QACA,YACA,eACA,QACA,SACA,UCzEF,CAAgB,MAAQ,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,UAAU,MAAQ,SAAS,aAAe,SAAS,OAAS,UDmElIA,CAONiD,GAEjBA,EAASnD,UAAY,CACnBoD,OAAQnD,IAAAA,KACR6C,MAAO7C,IAAAA,OACP8C,SAAU9C,IAAAA,KACVzN,QAASyN,IAAAA,QACPA,IAAAA,UAAa,CACXA,IAAAA,MAAS,CACP5J,KAAM4J,IAAAA,KACN9K,MAAO8K,IAAAA,OAAAA,aAETA,IAAAA,SACC0C,YAELP,MAAOyB,EAAenB,UAAUC,WAChCxN,MAAO8K,IAAAA,QAGTkD,EAAS7J,aAAe,CACtB8J,YAAQ1Q,EACRoQ,WAAOpQ,EACPqQ,cAAUrQ,EACVF,QAAS,GACT2C,WAAOzC,GAGT,QEtFA,MAAMoR,GAAQC,EAAAA,EAAAA,aAAW,CAAA7O,EAItB2D,KAAG,IAJoB,MACxBiK,EAAK,MACLV,KACGX,GACJvM,EAAA,OACC8N,EAAAA,EAAAA,MAAA,QAAMjC,UAAWqB,EAAMzP,UAAUO,SAAA,MACnBR,IAAVoQ,EAAsB,MAAOhQ,EAAAA,EAAAA,KAAA,KAAGiO,UAAWqB,EAAMU,MAAM5P,SAAE4P,KAC3DhQ,EAAAA,EAAAA,KAAA,SACEiO,UAAWqB,EAAM4B,MACjBnL,IAAKA,KACD4I,MAED,IAGHwC,EAAc/D,IAAO,QAAS,CAClC,YACA,QACA,SCjCF,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,SAAS,MAAQ,SAAS,MAAQ,UD8B3FA,CAIH4D,GAEjBA,EAAM9D,UAAY,CAChB8C,MAAO7C,IAAAA,OACPmC,MAAO6B,EAAYvB,UAAUC,YAG/BmB,EAAMxK,aAAe,CACnBwJ,WAAOpQ,GAGT,QEzBA,SAASwR,EAAUhP,GAKhB,IALiB,SAClBhC,EAAQ,qBACRiR,EAAoB,sBACpBC,EAAqB,MACrBhC,GACDlN,EACC,OACE8N,EAAAA,EAAAA,MAAA,OAAKjC,UAAWqB,EAAMzP,UAAUO,SAAA,EAC9BJ,EAAAA,EAAAA,KAAA,OAAKiO,UAAW,CAACqB,EAAMiC,UAAWjC,EAAMkC,eAAeC,KAAK,KAAKrR,SAC9DiR,KAEHrR,EAAAA,EAAAA,KAAA,OAAKiO,UAAWqB,EAAMoC,UAAUtR,SAC7BA,KAEHJ,EAAAA,EAAAA,KAAA,OAAKiO,UAAW,CAACqB,EAAMiC,UAAWjC,EAAMqC,gBAAgBF,KAAK,KAAKrR,SAC/DkR,MAIT,CAEA,MAAMM,EAAmBxE,IAAO,aAAc,CAC5C,YACA,gBACA,YACA,iBACA,aC9CF,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,SAAS,UAAY,UDyC7FA,CAMXgE,GAEdA,EAAWlE,UAAY,CACrB9M,SAAU+M,IAAAA,KACVkE,qBAAsBlE,IAAAA,KACtBmE,sBAAuBnE,IAAAA,KACvBmC,MAAOsC,EAAiBhC,UAAUC,YAGpCuB,EAAW5K,aAAe,CACxBpG,SAAU,KACViR,qBAAsB,KACtBC,sBAAuB,MAGzB,mCE3DA,MAAMO,GAAUC,EAAAA,EAAAA,iBAuDD,SAASC,EAAQ3P,GAS7B,IAT8B,SAC/BhC,EAAQ,YACR4R,EAAW,MACXC,EAAK,SACLC,EAAQ,kBACRC,EAAiB,YACjBC,EAAW,MACXC,EAAK,IACLC,GACDlQ,EACC,MAAMmQ,EAAWH,GAAeC,EAC1BG,EAAUL,GAAqBH,EAE/BS,GAAUC,EAAAA,EAAAA,UAAQ,KAAM,CAC5BV,cACAC,QACAC,WACAC,oBACAC,cACAC,QACAC,SACE,CACFN,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,IAGF,OACEpC,EAAAA,EAAAA,MAAAyC,EAAAA,SAAA,CAAAvS,SAAA,EACE8P,EAAAA,EAAAA,MAAC0C,EAAAA,OAAM,CAAAxS,SAAA,EAELJ,EAAAA,EAAAA,KAAA,SAAAI,SACGiS,KAEHrS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,cAAc3E,QAASoT,KAGlChS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,eAAe3E,QAAQ,yBAClCoB,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,gBAAgB3E,QAAS2T,KACpCvS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,sBAAsB3E,QAAS4T,IACxCP,GAAQjS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,gBAAgB3E,QAASqT,IAAY,KAExDC,GACElS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,eAAe3E,QAAU,IAAGsT,MACrC,MAINlS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,WAAW3E,QAAS2T,IAC7BN,GAAQjS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,WAAW3E,QAASqT,IAAY,KACnDA,GAAQjS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,eAAe3E,QAAS2T,IAAe,MAC5DvS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,iBAAiB3E,QAAS4T,IAEnCN,GAAYlS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,cAAc3E,QAASsT,IAAgB,KAE9DI,GAAOtS,EAAAA,EAAAA,KAAA,QAAMuD,KAAK,SAAS3E,QAAS0T,IAAW,QAGjDlS,GACEJ,EAAAA,EAAAA,KAAC6R,EAAQgB,SAAQ,CAACxQ,MAAOoQ,EAAQrS,SAC9BA,IAED,OAIZ,CAEA2R,EAASF,QAAUA,EAEnBE,EAASvL,aAAe,CACtBpG,SAAU,KACV6R,MAAO,KACPC,SAAU,KACVC,kBAAmB,KACnBC,YAAa,KACbE,IAAK,MAGPP,EAAS7E,UAAY,CACnB9M,SAAU+M,IAAAA,KACV6E,YAAa7E,IAAAA,OAAAA,WACb8E,MAAO9E,IAAAA,OACP+E,SAAU/E,IAAAA,OACVgF,kBAAmBhF,IAAAA,OACnBiF,YAAajF,IAAAA,OACbkF,MAAOlF,IAAAA,OAAAA,WACPmF,IAAKnF,IAAAA,kECzHP,SAAS2F,EAAS1Q,GAIf,IAJgB,SACjBhC,EAAQ,SACR2S,EAAQ,MACRzD,GACDlN,EACC,MAAM4Q,GAAe5H,EAAAA,EAAAA,UACf6H,GAAa7H,EAAAA,EAAAA,WACZ8H,EAAQC,IAAaC,EAAAA,EAAAA,aAE5B7J,EAAAA,EAAAA,YAAU,KACR,MAAMzD,EAAIxH,SAAS+N,cAAc,OAIjC,OAHA/N,SAAS+U,KAAKC,UAAUC,IAAI,+BAC5BjV,SAAS+U,KAAK3G,YAAY5G,GAC1BqN,EAAUrN,GACH,KACLxH,SAAS+U,KAAKC,UAAU9U,OAAO,+BAC/BF,SAAS+U,KAAKxG,YAAY/G,EAAE,CAC7B,GACA,IAEH,MAAM0N,GAAYd,EAAAA,EAAAA,UAAQ,KACxB1S,EAAAA,EAAAA,KAAA,OACEyT,QAASA,KACP,MAAMC,EAAQV,EAAanM,QAAQ8M,iBAAiB,KACpD,IAAK,IAAIlD,EAAIiD,EAAMzU,OAAS,EAAGwR,GAAK,IAAKA,EAEvC,GADAiD,EAAMjD,GAAGmD,QACLtV,SAASuV,gBAAkBH,EAAMjD,GAAI,OAE3CwC,EAAWpM,QAAQ+M,OAAO,EAG5BlE,SAAS,OAGV,IAEH,OAAOwD,EAASY,IAAAA,cAEZ5D,EAAAA,EAAAA,MAAAyC,EAAAA,SAAA,CAAAvS,SAAA,CACGoT,GACDxT,EAAAA,EAAAA,KAAA,OACE,aAAW,SACXiO,UAAWqB,EAAMyE,QACjB1F,QAASA,IAAM0E,IACfvD,UAAYrK,IACI,WAAVA,EAAE1G,KAAkBsU,GAAU,EAEpChN,IAAM/E,IACAA,GAAQA,IAASiS,EAAWpM,UAC9BoM,EAAWpM,QAAU7F,EACrBA,EAAK4S,QACP,EAEFnE,KAAK,SACLC,SAAS,OAEX1P,EAAAA,EAAAA,KAAA,OACE,aAAW,OACXiO,UAAWqB,EAAMzP,UACjBmU,QAAUC,GAAUA,EAAMC,kBAC1BnO,IAAKiN,EACLvD,KAAK,SAAQrP,SAEZA,KAEHJ,EAAAA,EAAAA,KAAA,OACEyT,QAASA,KACPR,EAAWpM,QAAQ+M,OAAO,EAG5BlE,SAAS,MAGV8D,KAGLN,GACE,IACN,CAEA,MAAMiB,EAAc/G,IAClB,QACA,CACE,YACA,WChHJ,CAAgB,QAAU,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,UAAY,UD4G3EA,CAOlB0F,GAEFA,EAAU5F,UAAY,CACpB6F,SAAU5F,IAAAA,KACV/M,SAAU+M,IAAAA,KACVmC,MAAO6E,EAAYvE,UAAUC,YAG/BiD,EAAUtM,aAAe,CACvBuM,SAAUqB,EAAAA,KACVhU,SAAU,MAGZ,QE7He,SAASiU,GAAQ1N,GAE9B,OAAO3G,EAAAA,EAAAA,KAACgO,EAAW,IAAKrH,EAAO8H,eAAgB6F,EAAAA,SAEjD,CCMe,SAASC,GAAYnS,GAAiC,IAAhC,SAAEhC,EAAQ,UAAE6N,EAAS,MAAEuG,GAAOpS,EACjE,MAAMqS,EAAMD,EAAME,MAAM,KAClBC,EAAoB,IAAMF,EAAI,GAAMA,EAAI,GAAvB,IASjBG,GACJ5U,EAAAA,EAAAA,KAAA,OACE6U,MAAO,CAAEF,iBACT1G,UAAU,SAAW7N,UAErBJ,EAAAA,EAAAA,KAAA,OAAKiO,UAAU,UAAS7N,SACrBA,MAIP,OAAO6N,GACLjO,EAAAA,EAAAA,KAAA,OAAKiO,UAAWA,EAAU7N,SACvBwU,IAEDA,CACN,CC1BA,SAASE,GAAQ1S,GAEd,IAFe,MAChBkN,GACDlN,EACC,OACE8N,EAAAA,EAAAA,MAAA,QAAMjC,WAAWqB,EAAMzP,UAANyP,EAAMzP,UAAS,kBAACO,SAAA,EAC/BJ,EAAAA,EAAAA,KAAA,QAAMiO,WAAWqB,EAAMyF,OAANzF,EAAMyF,OAAM,oBAC7B/U,EAAAA,EAAAA,KAAA,QAAMiO,WAAWqB,EAAMyF,OAANzF,EAAMyF,OAAM,oBAC7B/U,EAAAA,EAAAA,KAAA,QAAMiO,WAAWqB,EAAMyF,OAANzF,EAAMyF,OAAM,qBAGnC,CDkBAR,GAAa/N,aAAe,CAC1BpG,SAAU,KACV6N,UAAW,KACXuG,MAAO,OAGTD,GAAarH,UAAY,CACvB9M,SAAU+M,IAAAA,KACVc,UAAWd,IAAAA,OACXqH,MAAOrH,IAAAA,QCzBT2H,GAAStO,aAAe,CACtB8I,MAAO,CAAC,GAGVwF,GAAS5H,UAAY,CACnBoC,MAAOnC,IAAAA,MAAS,CACdtN,UAAWsN,IAAAA,OACX4H,OAAQ5H,IAAAA,UAIZ,OAAeC,IAAO,WAAY,CAChC,SACA,aCtCF,CAAgB,UAAY,UAAU,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,OAAS,SAAS,SAAW,UDoCnH,CAGiB0H,IErBV,MAAME,GAAa,CACxBC,aAAc,eACdC,cAAe,gBACfC,aAAc,eACdC,cAAe,iBAGXC,GAAmB,CACvB,kCACA,gCACA,kCACA5D,KAAK,KAED6D,GAAiB,CACrB,+BACA,gCACA,kCACA7D,KAAK,KA0MP,MAAM8D,IAAUtE,EAAAA,EAAAA,aAAW,CAAA7O,EAAsB2D,KAAQ,IAA7B,SAAE3F,EAAQ,MAAEkP,GAAOlN,EAC7C,MAAOoT,EAAYC,IAAiBrC,EAAAA,EAAAA,UAAS,MAEvCsC,EAAUA,CAACC,EAAOC,EAAOC,EAAWC,IAAYN,GAlDxD,SACEG,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EA9HR,SAA0BD,GACxB,MAAO,CACLjF,MAAOiF,EAAQjF,MAAMmF,wBACrBpW,UAAWkW,EAAQlW,UAAUoW,wBAEjC,CAyHuBC,CAAiBH,GAChCI,EAnHR,WACE,MAAM,YAAEC,EAAW,YAAEC,GAAgBtO,QAC7BuO,iBAAiB,aAAEC,EAAY,YAAEC,IAAkBlY,SAC3D,MAAO,CACLmY,KAAML,EACNM,MAAON,EAAcI,EACrBG,IAAKN,EACLO,OAAQP,EAAcE,EAE1B,CA0GuBM,GAGfC,EA3FR,SAA6BC,EAAGC,EAAGhB,GACjC,MAAM,MAAElF,EAAK,UAAEjR,GAAcmW,EAC7B,MAAO,CACLiB,OAAQ,IAAOpX,EAAUqX,MAAQpG,EAAMoG,OACvCC,OAAQtX,EAAUuX,OAClBC,WAAYN,EAAIlX,EAAUqX,MAAQ,EAClCI,WAAYN,EAAInX,EAAUuX,OAAStG,EAAMsG,OAAS,IAKlDG,eAAgBlC,GAEpB,CA8EcmC,CAAoB7B,EAAOC,EAAOI,GAE9C,GAAIc,EAAIO,WAAalB,EAAaM,KAAO,EACvCK,EAAIO,WAAalB,EAAaM,KAAO,EACrCK,EAAIG,OAASjT,KAAKyT,IAChB,EACA9B,EAAQmB,EAAIO,WAAarB,EAAalF,MAAMoG,MAAQ,OAEjD,CACL,MAAMQ,EAAOvB,EAAaO,MAAQ,EAAIV,EAAanW,UAAUqX,MACzDJ,EAAIO,WAAaK,IACnBZ,EAAIO,WAAaK,EACjBZ,EAAIG,OAASjT,KAAK2T,IAChB3B,EAAanW,UAAUqX,MAAQ,EAC/BvB,EAAQmB,EAAIO,WAAarB,EAAalF,MAAMoG,MAAQ,GAG1D,CAGIJ,EAAIQ,WAAanB,EAAaQ,IAAM,IACtCG,EAAIQ,YAActB,EAAanW,UAAUuX,OACrC,EAAIpB,EAAalF,MAAMsG,OAC3BN,EAAIK,QAAUnB,EAAanW,UAAUuX,OACjCpB,EAAalF,MAAMsG,OACvBN,EAAIS,eAAiBjC,IAGvB,MAAMsC,EAAkB,QAAOd,EAAIO,oBAAoBP,EAAIQ,eAC3DvB,EAAQlW,UAAUyM,aAAa,QAASsL,GAExC,MAAMC,EAAc,GAAEf,EAAIS,uBAAuBT,EAAIG,gBAAgBH,EAAIK,WACzEpB,EAAQjF,MAAMxE,aAAa,QAASuL,EACtC,CAOOC,CAAsBnC,EAAOC,EAAOC,EAAWC,EAASN,GAa7D,OAZAuC,EAAAA,EAAAA,qBAAoBhS,GAAK,KAAM,CAAG2P,eAGlCnM,EAAAA,EAAAA,YAAU,KACR,MAAMwN,EAzMV,SAAiCzH,GAC/B,MAAMwB,EAAQxS,SAAS+N,cAAc,OACjCiD,EAAMwB,OAAOA,EAAMxE,aAAa,QAASgD,EAAMwB,OAEnD,MAAMlS,EAAUN,SAAS+N,cAAc,OACnCiD,EAAM1Q,SAASA,EAAQ0N,aAAa,QAASgD,EAAM1Q,SAEvD,MAAMiB,EAAYvB,SAAS+N,cAAc,OAOzC,OANIiD,EAAMzP,WAAWA,EAAUyM,aAAa,QAASgD,EAAMzP,WAE3DA,EAAU6M,YAAYoE,GACtBjR,EAAU6M,YAAY9N,GACtBN,SAAS+U,KAAK3G,YAAY7M,GAEnB,CAAEA,YAAWiR,QAAOlS,UAC7B,CA0LcoZ,CAAwB1I,GAElC,OADAmG,EAAcsB,GACP,KACLzY,SAAS+U,KAAKxG,YAAYkK,EAAElX,WAC5B4V,EAAc,KAAK,CACpB,GACA,CAACnG,IAEGkG,GAAayC,EAAAA,EAAAA,cAAa7X,EAAUoV,EAAW5W,SAAW,IAAI,IAGvE2W,GAAQrI,UAAY,CAClB9M,SAAU+M,IAAAA,KACVmC,MAAOnC,IAAAA,QAAW0C,YAGpB0F,GAAQ/O,aAAe,CACrBpG,SAAU,MAGZ,UCjPA,SAAS8X,GAAO9V,GAKb,IALc,SACfhC,EAAQ,UACRyV,EAAS,IACTsC,EAAG,MACH7I,GACDlN,EACC,MAAMgW,GAAahN,EAAAA,EAAAA,UACbiN,GAAajN,EAAAA,EAAAA,WACZkN,EAAaC,IAAkBnF,EAAAA,EAAAA,WAAS,GAiC/C,OATA7J,EAAAA,EAAAA,YAAU,KACR,GAAI+O,GAAuB,OAARH,EAAc,CAC/B,MAAMK,EAAWA,IAAMD,GAAe,GAEtC,OADAxQ,OAAO0Q,iBAAiB,SAAUD,GAC3B,IAAMzQ,OAAO2Q,oBAAoB,SAAUF,EACpD,CACgB,GACf,CAACF,EAAaH,KAGfjI,EAAAA,EAAAA,MAAA,OACEjC,UAAWqB,EAAMqJ,QACjBC,aAAcA,IAAML,GAAe,GACnCM,YAAc1T,GAnCW2T,EAACC,EAASC,KACrC,GAAKV,EACA,CACH,MAAMW,EAAcZ,EAAWxR,QAAQoP,wBAErC8C,EAAUE,EAAYxC,MACnBsC,EAAUE,EAAYvC,OACtBsC,EAAUC,EAAYtC,KACtBqC,EAAUC,EAAYrC,OAEzB2B,GAAe,GACNH,EAAWvR,SACpBuR,EAAWvR,QAAQ6O,QACjBqD,EAAUhR,OAAOqO,YACjB4C,EAAUjR,OAAOsO,YACjBR,EACAwC,EAAWxR,QAGjB,MAlBkB0R,GAAe,EAkBjC,EAgBsBO,CAAqB3T,EAAE+T,QAAS/T,EAAEgU,SACtDpT,IAAKsS,EAAWjY,SAAA,CAGdkY,GAAuB,OAARH,GACbnY,EAAAA,EAAAA,KAACuV,GAAO,CAACxP,IAAKqS,EAAY9I,MAAOA,EAAMlP,SAAE+X,IACvC,KAEL/X,IAGP,CAEA,MAAMgZ,GAAgBhM,IACpB,cACA,CACE,aACA,QACA,YACA,UACA,WC1FJ,CAAgB,MAAQ,SAAS,GAAK,UAAU,IAAM,SAAS,QAAU,SAAS,UAAY,SAAS,WAAa,SAAS,QAAU,WDmFjHA,CAUpB8K,IAEFkB,GAAcpE,WAAaA,GAE3BkD,GAAQhL,UAAY,CAClB9M,SAAU+M,IAAAA,KACV0I,UAAW1I,IAAAA,MAASlL,OAAOoX,OAAOrE,KAClC1F,MAAO8J,GAAcxJ,UAAUC,WAC/BsI,IAAKhL,IAAAA,MAGP+K,GAAQ1R,aAAe,CACrBpG,SAAU,KACVyV,UAAWb,GAAWC,aACtBkD,IAAK,MAGP,mEE9GA,IAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,UAAU,IAAM,WCuB7E,SAASmB,GAAYlX,GAKlB,IALmB,SACpBmX,EAAQ,IACRC,EAAG,MACHlK,EAAK,MACL+C,GACDjQ,GACMkQ,EAAKmH,GAASD,EAAI9E,MAAM,KAC7B+E,EAAQA,EAAQC,KAAAA,MAASD,GAAS,CAAC,EAEnC,MAAME,EAAUF,EAAMG,GAAKtH,EAAI1D,MAAM,uBAAuB,GAU5D,OATA0D,EAAO,iCAAgCqH,WAEhCF,EAAMG,EACbH,EAAMF,SAAWA,EAAW,EAAI,EAChCjH,GAAQ,IAAGoH,KAAAA,UAAaD,MAMtBvJ,EAAAA,EAAAA,MAACqE,GAAY,CAACtG,UAAWqB,EAAMzP,UAAW2U,MAAM,OAAMpU,SAAA,EACpDJ,EAAAA,EAAAA,KAAC8U,GAAQ,CAACxF,MAAOuK,MACjB7Z,EAAAA,EAAAA,KAAA,UACE8Z,MAAM,WACNC,iBAAe,EACf9L,UAAWqB,EAAM0K,MACjBR,IAAKlH,EACLD,MAAOA,MAIf,CAEA,MAAM4H,GAAqB7M,IACzB,eACA,CACE,YACA,SC5DJ,CAAgB,UAAY,SAAS,QAAU,SAAS,GAAK,SAAS,IAAM,SAAS,MAAQ,UDwDlEA,CAOzBkM,IAEFA,GAAapM,UAAY,CACvBqM,SAAUpM,IAAAA,KACVqM,IAAKrM,IAAAA,OAAAA,WACLmC,MAAO2K,GAAmBrK,UAAUC,WACpCwC,MAAOlF,IAAAA,QAGTmM,GAAa9S,aAAe,CAC1B+S,UAAU,EACVlH,MAAO,IAGT,UE1EA,MAAM6H,GAASzM,EAAQhM,YAAY,gBAE7B0Y,GAASD,QAASta,EAAY3C,oBAAAA,KAAAA","sources":["webpack://@dr.pogodin/react-utils/webpack/universalModuleDefinition","webpack://@dr.pogodin/react-utils/./src/client/getInj.js","webpack://@dr.pogodin/react-utils/./src/client/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/buildInfo.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/environment-check.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/isomorphy/index.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/webpack.js","webpack://@dr.pogodin/react-utils/./node_modules/cookie/index.js","webpack://@dr.pogodin/react-utils/./node_modules/react/cjs/react-jsx-runtime.production.min.js","webpack://@dr.pogodin/react-utils/./node_modules/react/jsx-runtime.js","webpack://@dr.pogodin/react-utils/external umd \"@dr.pogodin/js-utils\"","webpack://@dr.pogodin/react-utils/external umd \"@dr.pogodin/react-global-state\"","webpack://@dr.pogodin/react-utils/external umd \"@dr.pogodin/react-themes\"","webpack://@dr.pogodin/react-utils/external umd \"axios\"","webpack://@dr.pogodin/react-utils/external umd \"dayjs\"","webpack://@dr.pogodin/react-utils/external umd \"lodash\"","webpack://@dr.pogodin/react-utils/external umd \"node-forge/lib/aes\"","webpack://@dr.pogodin/react-utils/external umd \"node-forge/lib/forge\"","webpack://@dr.pogodin/react-utils/external umd \"prop-types\"","webpack://@dr.pogodin/react-utils/external umd \"qs\"","webpack://@dr.pogodin/react-utils/external umd \"react\"","webpack://@dr.pogodin/react-utils/external umd \"react-dom\"","webpack://@dr.pogodin/react-utils/external umd \"react-dom/client\"","webpack://@dr.pogodin/react-utils/external umd \"react-helmet\"","webpack://@dr.pogodin/react-utils/external umd \"react-router-dom\"","webpack://@dr.pogodin/react-utils/webpack/bootstrap","webpack://@dr.pogodin/react-utils/webpack/runtime/compat get default export","webpack://@dr.pogodin/react-utils/webpack/runtime/define property getters","webpack://@dr.pogodin/react-utils/webpack/runtime/global","webpack://@dr.pogodin/react-utils/webpack/runtime/hasOwnProperty shorthand","webpack://@dr.pogodin/react-utils/webpack/runtime/make namespace object","webpack://@dr.pogodin/react-utils/./src/shared/utils/config.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/time.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/Barrier.js","webpack://@dr.pogodin/react-utils/./src/shared/components/CodeSplit/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/utils/index.js","webpack://@dr.pogodin/react-utils/./src/shared/utils/splitComponent.js","webpack://@dr.pogodin/react-utils/./src/shared/components/GenericLink/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Link.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Button/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Button/style.scss?4fed","webpack://@dr.pogodin/react-utils/./src/shared/components/Checkbox/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Checkbox/theme.scss?e808","webpack://@dr.pogodin/react-utils/./src/shared/components/Dropdown/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Dropdown/theme.scss?9ee7","webpack://@dr.pogodin/react-utils/./src/shared/components/Input/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Input/theme.scss?43a4","webpack://@dr.pogodin/react-utils/./src/shared/components/PageLayout/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/PageLayout/base-theme.scss?229d","webpack://@dr.pogodin/react-utils/./src/shared/components/MetaTags.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Modal/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Modal/base-theme.scss?9858","webpack://@dr.pogodin/react-utils/./src/shared/components/NavLink.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/ScalableRect/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Throbber/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/Throbber/theme.scss?1805","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/Tooltip.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/WithTooltip/default-theme.scss?195d","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/throbber.scss?c5e3","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/index.jsx","webpack://@dr.pogodin/react-utils/./src/shared/components/YouTubeVideo/base.scss?267e","webpack://@dr.pogodin/react-utils/./src/index.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"@dr.pogodin/js-utils\"), require(\"@dr.pogodin/react-global-state\"), require(\"@dr.pogodin/react-themes\"), require(\"axios\"), require(\"dayjs\"), require(\"lodash\"), require(\"node-forge/lib/aes\"), require(\"node-forge/lib/forge\"), require(\"prop-types\"), require(\"qs\"), require(\"react\"), require(\"react-dom\"), require(\"react-dom/client\"), require(\"react-helmet\"), require(\"react-router-dom\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"@dr.pogodin/js-utils\", \"@dr.pogodin/react-global-state\", \"@dr.pogodin/react-themes\", \"axios\", \"dayjs\", \"lodash\", \"node-forge/lib/aes\", \"node-forge/lib/forge\", \"prop-types\", \"qs\", \"react\", \"react-dom\", \"react-dom/client\", \"react-helmet\", \"react-router-dom\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"@dr.pogodin/react-utils\"] = factory(require(\"@dr.pogodin/js-utils\"), require(\"@dr.pogodin/react-global-state\"), require(\"@dr.pogodin/react-themes\"), require(\"axios\"), require(\"dayjs\"), require(\"lodash\"), require(\"node-forge/lib/aes\"), require(\"node-forge/lib/forge\"), require(\"prop-types\"), require(\"qs\"), require(\"react\"), require(\"react-dom\"), require(\"react-dom/client\"), require(\"react-helmet\"), require(\"react-router-dom\"));\n\telse\n\t\troot[\"@dr.pogodin/react-utils\"] = factory(root[\"@dr.pogodin/js-utils\"], root[\"@dr.pogodin/react-global-state\"], root[\"@dr.pogodin/react-themes\"], root[\"axios\"], root[\"dayjs\"], root[\"lodash\"], root[\"node-forge/lib/aes\"], root[\"node-forge/lib/forge\"], root[\"prop-types\"], root[\"qs\"], root[\"react\"], root[\"react-dom\"], root[\"react-dom/client\"], root[\"react-helmet\"], root[\"react-router-dom\"]);\n})(typeof self !== 'undefined' ? self : this, function(__WEBPACK_EXTERNAL_MODULE__269__, __WEBPACK_EXTERNAL_MODULE__899__, __WEBPACK_EXTERNAL_MODULE__198__, __WEBPACK_EXTERNAL_MODULE__300__, __WEBPACK_EXTERNAL_MODULE__760__, __WEBPACK_EXTERNAL_MODULE__467__, __WEBPACK_EXTERNAL_MODULE__0__, __WEBPACK_EXTERNAL_MODULE__654__, __WEBPACK_EXTERNAL_MODULE__99__, __WEBPACK_EXTERNAL_MODULE__656__, __WEBPACK_EXTERNAL_MODULE__156__, __WEBPACK_EXTERNAL_MODULE__111__, __WEBPACK_EXTERNAL_MODULE__715__, __WEBPACK_EXTERNAL_MODULE__383__, __WEBPACK_EXTERNAL_MODULE__128__) {\nreturn ","// Encapsulates retrieval of server-side data injection into HTML template.\n\n/* global document /\n\n// Note: this way, only required part of \"node-forge\": AES, and some utils,\n// is bundled into client-side code.\nimport forge from 'node-forge/lib/forge';\nimport 'node-forge/lib/aes';\n\nimport { getBuildInfo } from 'utils/isomorphy/buildInfo';\n\n// Safeguard is needed here, because the server-side version of Docusaurus docs\n// is compiled (at least now) with settings suggesting it is a client-side\n// environment, but there is no document.\nlet inj = typeof document !== 'undefined'\n && document.querySelector('meta[itemprop=\"drpruinj\"]');\n\nif (inj) {\n inj.remove();\n const { key } = getBuildInfo();\n inj = forge.util.decode64(inj.content);\n const d = forge.cipher.createDecipher('AES-CBC', key);\n d.start({ iv: inj.slice(0, key.length) });\n d.update(forge.util.createBuffer(inj.slice(key.length)));\n d.finish();\n inj = forge.util.decodeUtf8(d.output.data);\n inj = eval(`(${inj})`); // eslint-disable-line no-eval\n} else {\n // Otherwise, a bunch of dependent stuff will easily fail in non-standard\n // environments, where no client-side initialization is performed. Like tests,\n // Docusaurus examples, etc.\n inj = {};\n}\n\nexport default function getInj() {\n return inj;\n}\n","// Initialization of client-side code.\n/ global document /\n\nimport { GlobalStateProvider } from '@dr.pogodin/react-global-state';\n\nimport { createRoot, hydrateRoot } from 'react-dom/client';\nimport { BrowserRouter } from 'react-router-dom';\n\nimport getInj from './getInj';\n\n/\n Prepares and launches the app at client side.\n * @param {object} Application Root application component\n * @param {object} [options={}] Optional. Additional settings.\n /\nexport default function Launch(Application, options = {}) {\n const container = document.getElementById('react-view');\n const scene = (\n <GlobalStateProvider initialState={getInj().ISTATE}>\n <BrowserRouter>\n <Application />\n </BrowserRouter>\n </GlobalStateProvider>\n );\n\n if (options.dontHydrate) {\n const root = createRoot(container);\n root.render(scene);\n } else hydrateRoot(container, scene);\n}\n","// Encapsulates access to \"Build Info\" data.\n\n/ global BUILD_INFO /\n\nlet buildInfo;\n\n// On the client side \"BUILD_INFO\" should be injected by Webpack. Note, however,\n// that in test environment we may need situations were environment is mocked as\n// client-side, although no proper Webpack compilation is executed, thus no info\n// injected; because of this we don't do a hard environment check here.\nif (typeof BUILD_INFO !== 'undefined') buildInfo = BUILD_INFO;\n\n/\n In scenarious where \"BUILD_INFO\" is not injected by Webpack (server-side,\n * tests, etc.) we expect the host codebase to explicitly set it before it is\n * ever requested. As a precaution, this function throws if build info has been\n * set already, unless `force` flag is explicitly set.\n * @param {object} info\n * @param {boolean} [force=false]\n /\nexport function setBuildInfo(info, force = false) {\n if (buildInfo !== undefined && !force) {\n throw Error('\"Build Info\" is already initialized');\n }\n buildInfo = info;\n}\n\n/\n Returns \"Build Info\" object; throws if it has not been initialized yet.\n * @returns {object}\n /\nexport function getBuildInfo() {\n if (buildInfo === undefined) {\n throw Error('\"Build Info\" has not been initialized yet');\n }\n return buildInfo;\n}\n","// Checks for client- vs. server-side environment detection.\n\n/\n `true` within client-side environment (browser), `false` at server-side.\n /\nexport const IS_CLIENT_SIDE = typeof process !== 'object'\n \|\| !process.versions \|\| !process.versions.node\n \|\| !!global.REACT_UTILS_FORCE_CLIENT_SIDE;\n\n/\n `true` within the server-side environment (node), `false` at client-side.\n /\nexport const IS_SERVER_SIDE = !IS_CLIENT_SIDE;\n","import { getBuildInfo } from './buildInfo';\nimport { IS_CLIENT_SIDE, IS_SERVER_SIDE } from './environment-check';\n\n/\n @ignore\n * @return {string} Code mode: \"development\" or \"production\".\n /\nfunction getMode() {\n return process.env.NODE_ENV;\n}\n\n/\n Returns `true` if development version of the code is running;\n * `false` otherwise.\n * @return {boolean}\n /\nexport function isDevBuild() {\n return getMode() === 'development';\n}\n\n/\n Returns `true` if production build of the code is running;\n * `false` otherwise.\n * @return {boolean}\n /\nexport function isProdBuild() {\n return getMode() === 'production';\n}\n\n/\n Returns build timestamp of the front-end JS bundle.\n * @return {string} ISO date/time string.\n /\nexport function buildTimestamp() {\n return getBuildInfo().timestamp;\n}\n\nexport { IS_CLIENT_SIDE, IS_SERVER_SIDE, getBuildInfo };\n","import { IS_CLIENT_SIDE } from './isomorphy';\n\n/\n Requires the specified module without including it into the bundle during\n * Webpack build.\n * @param {string} modulePath\n * @param {string} [basePath]\n * @return {object} Required module.\n /\nexport function requireWeak(modulePath, basePath) {\n if (IS_CLIENT_SIDE) return null;\n\n try {\n / eslint-disable no-eval /\n const { resolve } = eval('require')('path');\n const path = basePath ? resolve(basePath, modulePath) : modulePath;\n const { default: def, ...named } = eval('require')(path);\n / eslint-enable no-eval /\n\n if (!def) return named;\n\n Object.entries(named).forEach(([key, value]) => {\n if (def[key]) throw Error('Conflict between default and named exports');\n def[key] = value;\n });\n return def;\n } catch {\n return null;\n }\n}\n\n/\n Resolves specified module path with help of Babel's module resolver.\n * Yes, the function itself just returns its argument to the caller, but Babel\n * is configured to resolve the first argument of resolveWeak(..) function, thus\n * the result will be the resolved path.\n * @param {string} modulePath\n * @return {string} Absolute or relative path to the module.\n /\nexport function resolveWeak(modulePath) {\n return modulePath;\n}\n","/!\n * cookie\n * Copyright(c) 2012-2014 Roman Shtylman\n * Copyright(c) 2015 Douglas Christopher Wilson\n * MIT Licensed\n /\n\n'use strict';\n\n/\n Module exports.\n * @public\n /\n\nexports.parse = parse;\nexports.serialize = serialize;\n\n/\n Module variables.\n * @private\n /\n\nvar __toString = Object.prototype.toString\n\n/\n RegExp to match field-content in RFC 7230 sec 3.2\n \n field-content = field-vchar [ 1( SP / HTAB ) field-vchar ]\n field-vchar = VCHAR / obs-text\n * obs-text = %x80-FF\n /\n\nvar fieldContentRegExp = /^[\\u0009\\u0020-\\u007e\\u0080-\\u00ff]+$/;\n\n/\n Parse a cookie header.\n \n Parse the given cookie header string into an object\n * The object has the various cookies as keys(names) => values\n \n @param {string} str\n * @param {object} [options]\n * @return {object}\n * @public\n /\n\nfunction parse(str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string');\n }\n\n var obj = {}\n var opt = options \|\| {};\n var dec = opt.decode \|\| decode;\n\n var index = 0\n while (index < str.length) {\n var eqIdx = str.indexOf('=', index)\n\n // no more cookie pairs\n if (eqIdx === -1) {\n break\n }\n\n var endIdx = str.indexOf(';', index)\n\n if (endIdx === -1) {\n endIdx = str.length\n } else if (endIdx < eqIdx) {\n // backtrack on prior semicolon\n index = str.lastIndexOf(';', eqIdx - 1) + 1\n continue\n }\n\n var key = str.slice(index, eqIdx).trim()\n\n // only assign once\n if (undefined === obj[key]) {\n var val = str.slice(eqIdx + 1, endIdx).trim()\n\n // quoted values\n if (val.charCodeAt(0) === 0x22) {\n val = val.slice(1, -1)\n }\n\n obj[key] = tryDecode(val, dec);\n }\n\n index = endIdx + 1\n }\n\n return obj;\n}\n\n/\n Serialize data into a cookie header.\n \n Serialize the a name value pair into a cookie string suitable for\n * http headers. An optional options object specified cookie parameters.\n \n serialize('foo', 'bar', { httpOnly: true })\n * => \"foo=bar; httpOnly\"\n \n @param {string} name\n * @param {string} val\n * @param {object} [options]\n * @return {string}\n * @public\n /\n\nfunction serialize(name, val, options) {\n var opt = options \|\| {};\n var enc = opt.encode \|\| encode;\n\n if (typeof enc !== 'function') {\n throw new TypeError('option encode is invalid');\n }\n\n if (!fieldContentRegExp.test(name)) {\n throw new TypeError('argument name is invalid');\n }\n\n var value = enc(val);\n\n if (value && !fieldContentRegExp.test(value)) {\n throw new TypeError('argument val is invalid');\n }\n\n var str = name + '=' + value;\n\n if (null != opt.maxAge) {\n var maxAge = opt.maxAge - 0;\n\n if (isNaN(maxAge) \|\| !isFinite(maxAge)) {\n throw new TypeError('option maxAge is invalid')\n }\n\n str += '; Max-Age=' + Math.floor(maxAge);\n }\n\n if (opt.domain) {\n if (!fieldContentRegExp.test(opt.domain)) {\n throw new TypeError('option domain is invalid');\n }\n\n str += '; Domain=' + opt.domain;\n }\n\n if (opt.path) {\n if (!fieldContentRegExp.test(opt.path)) {\n throw new TypeError('option path is invalid');\n }\n\n str += '; Path=' + opt.path;\n }\n\n if (opt.expires) {\n var expires = opt.expires\n\n if (!isDate(expires) \|\| isNaN(expires.valueOf())) {\n throw new TypeError('option expires is invalid');\n }\n\n str += '; Expires=' + expires.toUTCString()\n }\n\n if (opt.httpOnly) {\n str += '; HttpOnly';\n }\n\n if (opt.secure) {\n str += '; Secure';\n }\n\n if (opt.priority) {\n var priority = typeof opt.priority === 'string'\n ? opt.priority.toLowerCase()\n : opt.priority\n\n switch (priority) {\n case 'low':\n str += '; Priority=Low'\n break\n case 'medium':\n str += '; Priority=Medium'\n break\n case 'high':\n str += '; Priority=High'\n break\n default:\n throw new TypeError('option priority is invalid')\n }\n }\n\n if (opt.sameSite) {\n var sameSite = typeof opt.sameSite === 'string'\n ? opt.sameSite.toLowerCase() : opt.sameSite;\n\n switch (sameSite) {\n case true:\n str += '; SameSite=Strict';\n break;\n case 'lax':\n str += '; SameSite=Lax';\n break;\n case 'strict':\n str += '; SameSite=Strict';\n break;\n case 'none':\n str += '; SameSite=None';\n break;\n default:\n throw new TypeError('option sameSite is invalid');\n }\n }\n\n return str;\n}\n\n/\n URL-decode string value. Optimized to skip native call when no %.\n \n @param {string} str\n * @returns {string}\n /\n\nfunction decode (str) {\n return str.indexOf('%') !== -1\n ? decodeURIComponent(str)\n : str\n}\n\n/\n URL-encode value.\n \n @param {string} str\n * @returns {string}\n /\n\nfunction encode (val) {\n return encodeURIComponent(val)\n}\n\n/\n Determine if value is a Date.\n \n @param {} val\n @private\n /\n\nfunction isDate (val) {\n return __toString.call(val) === '[object Date]' \|\|\n val instanceof Date\n}\n\n/\n Try decoding a string using a decoding function.\n \n @param {string} str\n * @param {function} decode\n * @private\n /\n\nfunction tryDecode(str, decode) {\n try {\n return decode(str);\n } catch (e) {\n return str;\n }\n}\n","/\n @license React\n * react-jsx-runtime.production.min.js\n \n Copyright (c) Facebook, Inc. and its affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n'use strict';var f=require(\"react\"),k=Symbol.for(\"react.element\"),l=Symbol.for(\"react.fragment\"),m=Object.prototype.hasOwnProperty,n=f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,p={key:!0,ref:!0,__self:!0,__source:!0};\nfunction q(c,a,g){var b,d={},e=null,h=null;void 0!==g&&(e=\"\"+g);void 0!==a.key&&(e=\"\"+a.key);void 0!==a.ref&&(h=a.ref);for(b in a)m.call(a,b)&&!p.hasOwnProperty(b)&&(d[b]=a[b]);if(c&&c.defaultProps)for(b in a=c.defaultProps,a)void 0===d[b]&&(d[b]=a[b]);return{$$typeof:k,type:c,key:e,ref:h,props:d,_owner:n.current}}exports.Fragment=l;exports.jsx=q;exports.jsxs=q;\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/react-jsx-runtime.production.min.js');\n} else {\n module.exports = require('./cjs/react-jsx-runtime.development.js');\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__269__;","module.exports = __WEBPACK_EXTERNAL_MODULE__899__;","module.exports = __WEBPACK_EXTERNAL_MODULE__198__;","module.exports = __WEBPACK_EXTERNAL_MODULE__300__;","module.exports = __WEBPACK_EXTERNAL_MODULE__760__;","module.exports = __WEBPACK_EXTERNAL_MODULE__467__;","module.exports = __WEBPACK_EXTERNAL_MODULE__0__;","module.exports = __WEBPACK_EXTERNAL_MODULE__654__;","module.exports = __WEBPACK_EXTERNAL_MODULE__99__;","module.exports = __WEBPACK_EXTERNAL_MODULE__656__;","module.exports = __WEBPACK_EXTERNAL_MODULE__156__;","module.exports = __WEBPACK_EXTERNAL_MODULE__111__;","module.exports = __WEBPACK_EXTERNAL_MODULE__715__;","module.exports = __WEBPACK_EXTERNAL_MODULE__383__;","module.exports = __WEBPACK_EXTERNAL_MODULE__128__;","// 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\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = function(module) {\n\tvar getter = module && module.__esModule ?\n\t\tfunction() { return module['default']; } :\n\t\tfunction() { return module; };\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = function(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 = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(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};","/ global document /\n\nimport { IS_CLIENT_SIDE } from './isomorphy/environment-check';\nimport { requireWeak } from './webpack';\n\nconst config = (\n IS_CLIENT_SIDE\n // eslint-disable-next-line global-require\n ? require('client/getInj').default().CONFIG\n : requireWeak('config')\n) \|\| {};\n\n// The safeguard for \"document\" is necessary because in non-Node environments,\n// like React Native, IS_CLIENT_SIDE is \"true\", however \"document\" and a bunch\n// of other browser-world features are not available.\nif (IS_CLIENT_SIDE && typeof document !== 'undefined') {\n const cookie = require('cookie'); // eslint-disable-line global-require\n config.CSRF = cookie.parse(document.cookie).csrfToken;\n}\n\nexport default config;\n","/ global document /\n\nimport Cookie from 'cookie';\nimport dayjs from 'dayjs';\nimport { assign } from 'lodash';\nimport { useEffect } from 'react';\n\nimport {\n DAY_MS,\n HOUR_MS,\n MIN_MS,\n SEC_MS,\n YEAR_MS,\n timer,\n} from '@dr.pogodin/js-utils';\n\nimport { getSsrContext, useGlobalState } from '@dr.pogodin/react-global-state';\n\n/\n This react hook wraps Date.now() function in a SSR friendly way,\n * ensuring that all calls to useCurrent() within the same render return\n * exactly the same time (which is retrieved from Date.now() first, and\n * then stored in the global state to be reused in all other calls), which\n * is also passed and used in the first client side render, and then updated\n * with a finite precision to avoid infinite re-rendering loops.\n * @param {object} [options] Optional settings.\n * @param {string} [options.globalStatePath=\"currentTime\"] Global state path\n * to keep the current time value.\n * @param {number} [options.precision= 5 * time.SEC_MS] Current time precision.\n * The hook won't update the current time stored in the global state unless it\n * is different from Date.now() result by this number (in milliseconds).\n * Default to 5 seconds.\n * @param {boolean} [options.autorefresh=false] Set `true` to automatically\n * refresh time stored in the global state with the given `precision` (and\n * thus automatically re-rendering components dependent on this hook, or\n * the global state with the period equal to the `precision`.\n * @return {number} Unix timestamp in milliseconds.\n /\nexport function useCurrent({\n autorefresh = false,\n globalStatePath = 'currentTime',\n precision = 5 dayjs.SEC_MS,\n} = {}) {\n const [now, setter] = useGlobalState(globalStatePath, Date.now);\n useEffect(() => {\n let timerId;\n const update = () => {\n setter((old) => {\n const neu = Date.now();\n return Math.abs(neu - old) > precision ? neu : old;\n });\n if (autorefresh) timerId = setTimeout(update, precision);\n };\n update();\n return () => {\n if (timerId) clearTimeout(timerId);\n };\n }, [autorefresh, precision, setter]);\n return now;\n}\n\n/*\n Wraps the standard Date.getTimezoneOffset() method in a SSR-friendly way.\n * This hook retrieves the offset value at the client side and uses a cookie\n * to pass it to the server in subsequent requests from that user. At the server\n * side the value from cookie is used in renders and passed back to the client\n * via the global state. Prior to the value being known (in the very first\n * request from the user, when the cookie is still missing), zero value is used\n * as the default value.\n \n @param {object} [options] Optional settings.\n * @param {string} [options.cookieName=\"timezoneOffset\"] Optional. The name of\n * cookie to use to store the timezone offset. Defaults \"timezoneOffset\". Set\n * to a falsy value to forbid using cookies altogether (in that case the hook\n * will always return zero value at the server-side, and in the first render\n * at the client-side).\n * @param {string} [options.timezoneOffset=\"timezoneOffset\"] Optional.\n * The global state path to store the offset. Defaults \"timezoneOffset\".\n * @return {number} Timezone offset.\n /\nexport function useTimezoneOffset({\n cookieName = 'timezoneOffset',\n globalStatePath = 'timezoneOffset',\n} = {}) {\n const ssrContext = getSsrContext(false);\n const [offset, setOffset] = useGlobalState(globalStatePath, () => {\n const value = cookieName && ssrContext?.req?.cookies?.[cookieName];\n return value ? parseInt(value, 10) : 0;\n });\n useEffect(() => {\n const date = new Date();\n const value = date.getTimezoneOffset();\n setOffset(value);\n if (cookieName) {\n document.cookie = Cookie.serialize(cookieName, value, { path: '/' });\n }\n }, [cookieName, setOffset]);\n return offset;\n}\n\nassign(dayjs, {\n DAY_MS,\n HOUR_MS,\n MIN_MS,\n SEC_MS,\n YEAR_MS,\n now: Date.now,\n timer,\n useCurrent,\n useTimezoneOffset,\n});\n\nexport default dayjs;\n","import { Barrier } from '@dr.pogodin/js-utils';\n\nexport { Barrier };\n\n/\n Creates a new Barrier.\n * @deprecated Prefer using `Barrier` class construction directly,\n * i.e. `new Barrier(executor)` instead of `newBarrier(executor)`.\n * @returns {Barrier}\n /\nexport function newBarrier(executor) {\n return new Barrier(executor);\n}\n","/ eslint-disable react/jsx-props-no-spreading /\n/ global document /\n\nimport PT from 'prop-types';\n\nimport {\n lazy,\n Suspense,\n useEffect,\n useRef,\n} from 'react';\n\nimport { getGlobalState } from '@dr.pogodin/react-global-state';\nimport { newBarrier } from 'utils/Barrier';\n\nimport {\n IS_CLIENT_SIDE,\n IS_SERVER_SIDE,\n getBuildInfo,\n} from 'utils/isomorphy';\n\nlet chunkGroups;\nlet styleSheetUsageCounters;\nif (IS_CLIENT_SIDE) {\n // eslint-disable-next-line global-require\n chunkGroups = require('client/getInj').default().CHUNK_GROUPS \|\| {};\n styleSheetUsageCounters = {};\n}\n\nexport default function CodeSplit({\n children,\n chunkName,\n getComponent,\n placeholder,\n ...props\n}) {\n const { current: heap } = useRef({\n mounted: false,\n pendingStyles: [],\n });\n const { publicPath } = getBuildInfo();\n\n // TODO: Not sure whether it is fine for the inner React.lazy() mechanics\n // if we dynamically create the lazy component inside a render of another\n // component, or does it expect we only create it once on outside of any\n // component.\n const LazyComponent = lazy(async () => {\n const res = await getComponent();\n if (heap.pendingStyles.length) await Promise.all(heap.pendingStyles);\n return res.default ? res : { default: res };\n });\n\n if (IS_SERVER_SIDE) {\n const { chunks } = getGlobalState().ssrContext;\n if (chunks.includes(chunkName)) {\n throw Error(`Chunk name clash for \"${chunkName}\"`);\n } else chunks.push(chunkName);\n } else if (!heap.mounted) {\n heap.mounted = true;\n\n chunkGroups[chunkName].forEach((asset) => {\n if (!asset.endsWith('.css')) return;\n const path = `${publicPath}/${asset}`;\n let link = document.querySelector(`link[href=\"${path}\"]`);\n if (!link) {\n link = document.createElement('link');\n link.setAttribute('href', path);\n link.setAttribute('rel', 'stylesheet');\n\n const barrier = newBarrier();\n link.onload = barrier.resolve;\n\n // Even if the style load failed, still allow to mount the component,\n // abeit with broken styling.\n link.onerror = barrier.resolve;\n\n heap.pendingStyles.push(barrier);\n\n const head = document.querySelector('head');\n head.appendChild(link);\n }\n\n const count = styleSheetUsageCounters[path] \|\| 0;\n styleSheetUsageCounters[path] = count + 1;\n });\n }\n\n // This effectively fires only once, just before the component unmounts.\n useEffect(() => () => {\n heap.mounted = false;\n chunkGroups[chunkName].forEach((item) => {\n if (!item.endsWith('.css')) return;\n const path = `${publicPath}/${item}`;\n if (--styleSheetUsageCounters[path] <= 0) {\n const link = document.querySelector(`link[href=\"${path}\"]`);\n const head = document.querySelector('head');\n head.removeChild(link);\n }\n });\n }, [chunkName, heap, publicPath]);\n\n return (\n <Suspense fallback={placeholder}>\n <LazyComponent {...props}>\n {children}\n </LazyComponent>\n </Suspense>\n );\n}\n\nCodeSplit.propTypes = {\n children: PT.node,\n chunkName: PT.string.isRequired,\n getComponent: PT.func.isRequired,\n placeholder: PT.node,\n};\n\nCodeSplit.defaultProps = {\n children: undefined,\n placeholder: undefined,\n};\n","import themed, {\n COMPOSE,\n PRIORITY,\n ThemeProvider,\n} from '@dr.pogodin/react-themes';\n\nimport config from './config';\nimport as isomorphy from './isomorphy';\nimport time from './time';\nimport * as webpack from './webpack';\n\nexport { Emitter, Semaphore } from '@dr.pogodin/js-utils';\n\nexport * from './Barrier';\nexport { default as splitComponent } from './splitComponent';\n\nthemed.COMPOSE = COMPOSE;\nthemed.PRIORITY = PRIORITY;\n\n// Note: it should be done this way, as in some environments\n// \"process\" might not exist, and process.env.NODE_CONFIG_ENV\n// not injected by Webpack.\nlet NODE_CONFIG_ENV;\ntry {\n NODE_CONFIG_ENV = process.env.NODE_CONFIG_ENV;\n} catch { /* noop / }\n\nconst env = NODE_CONFIG_ENV \|\| process.env.NODE_ENV;\nconst JU = env !== 'production' && webpack.requireWeak('./jest', __dirname);\n\n/\n @category Utilities\n * @global\n * @func withRetries\n * @desc\n * ```js\n * import { withRetries } from '@dr.pogodin/react-utils';\n * ```\n * Attempts to perform given asynchronous `action` up to `maxRetries` times,\n * with the given `interval` between attempts. If any attempt is successful,\n * the result is returned immediately, with no further attempts done;\n * otherwise, if all attempts fail, the result Promise rejects after the last\n * attempt.\n * @param {function} action\n * @param {number} [maxRetries=5] Optional. Maximum number of retries. Defaults\n * to 5 attempts.\n * @param {number} [interval=1000] Optional. Interval between retries [ms].\n * Defaults to 1 second.\n * @return {Promise} Resolves to the result of successful operation, or\n * rejects with the error from the latst failed attempt.\n * @example\n * import { withRetries } from '@dr.pogodin/react-utils';\n \n let firstCall = true;\n \n function sampleAction() {\n * if (!firstCall) return 'success';\n * firstCall = false;\n * throw Error('The first call to this method fails');\n * }\n \n withRetries(sampleAction).then(console.log);\n * // It will print 'success' after one second, once the second attempt\n * // is performed.\n /\nexport async function withRetries(action, maxRetries = 5, interval = 1000) {\n / eslint-disable no-await-in-loop /\n for (let n = 1; ; ++n) {\n try {\n return await action();\n } catch (error) {\n if (n < maxRetries) await time.timer(interval);\n else throw error;\n }\n }\n / eslint-enable no-await-in-loop /\n}\n\nexport {\n config,\n isomorphy,\n JU,\n themed,\n ThemeProvider,\n time,\n webpack,\n};\n","/ eslint-disable react/jsx-props-no-spreading /\n\nimport { createElement } from 'react';\n\nimport CodeSplit from 'components/CodeSplit';\n\n/\n Wraps a regular React component into a \"code splitting\" component,\n * i.e. all code used exclusively by that component and its sub-tree\n * will go into a separate, asynchronously loaded, code chunk for\n * the client-side.\n * @param {object} options\n * @param {string} options.chunkName\n * @param {function} options.getComponent\n * @param {React.Element} [options.placeholder]\n * @return {React.ElementType}\n /\nexport default function splitComponent({\n chunkName,\n getComponent,\n placeholder,\n}) {\n // eslint-disable-next-line react/prop-types\n return ({ children, ...props } = {}) => createElement(\n CodeSplit,\n {\n ...props,\n chunkName,\n getComponent,\n placeholder,\n },\n children,\n );\n}\n","/ global window /\n\nimport PT from 'prop-types';\nimport { createElement } from 'react';\n\nimport './style.scss';\n\n/\n The `<Link>` component, and almost identical `<NavLink>` component, are\n * auxiliary wrappers around\n * [React Router](https://github.com/ReactTraining/react-router)'s\n * `<Link>` and `<NavLink>` components; they help to handle external and\n * internal links in uniform manner.\n \n @param {object} [props] Component properties.\n * @param {string} [props.className] CSS classes to apply to the link.\n * @param {boolean} [props.disabled] Disables the link.\n * @param {boolean} [props.enforceA] `true` enforces rendering of the link as\n * a simple `<a>` element.\n * @param {boolean} [props.keepScrollPosition] If `true`, and the link is\n * rendered as a React Router's component, it won't reset the viewport scrolling\n * position to the origin when clicked.\n * @param {function} [props.onClick] Event handler to trigger upon click.\n * @param {function} [props.onMouseDown] Event handler to trigger on MouseDown\n * event.\n * @param {boolean} [props.openNewTab] If `true` the link opens in a new tab.\n * @param {boolean} [props.replace] When `true`, the link will replace current\n * entry in the history stack instead of adding a new one.\n * @param {string} [props.to] Link URL.\n * @param {string} [props.activeClassName] `<NavLink>` only: CSS class(es)\n * to apply to rendered link when it is active.\n * @param {string} [props.activeStyle] `<NavLink>` only: CSS styles\n * to apply to the rendered link when it is active.\n * @param {boolean} [props.exact] `<NavLink>` only: if `true`, the active\n * class/style will only be applied if the location is matched exactly.\n * @param {function} [props.isActive] `<NavLink>` only: Add extra\n * logic for determining whether the link is active. This should be used if you\n * want to do more than verify that the link’s pathname matches the current URL\n * pathname.\n * @param {object} [props.location] `<NavLink>` only: `isActive` compares\n * current history location (usually the current browser URL). To compare to\n * a different location, a custom `location` can be passed.\n * @param {boolean} [props.strict] `<NavLink>` only: . When `true`, trailing\n * slash on a location’s pathname will be taken into consideration when\n * determining if the location matches the current URL. See the `<Route strict>`\n * documentation for more information.\n /\nexport default function GenericLink({\n children,\n className,\n disabled,\n enforceA,\n keepScrollPosition,\n onClick,\n onMouseDown,\n openNewTab,\n replace,\n routerLinkType,\n to,\n ...rest\n}) {\n / Renders Link as <a> element if:\n * - It is opted explicitely by `enforceA` prop;\n * - It should be opened in a new tab;\n * - It is an absolte URL (starts with http:// or https://);\n * - It is anchor link (starts with #). /\n if (disabled \|\| enforceA \|\| openNewTab \|\| to.match(/^(#\|(https?\|mailto):)/)) {\n return (\n <a\n className={className}\n disabled={disabled}\n href={to}\n onClick={disabled ? (e) => e.preventDefault() : onClick}\n onMouseDown={disabled ? (e) => e.preventDefault() : onMouseDown}\n rel=\"noopener noreferrer\"\n styleName=\"link\"\n target={openNewTab ? '_blank' : ''}\n >\n {children}\n </a>\n );\n }\n\n / Otherwise we render the link as React Router's Link or NavLink element. /\n return createElement(routerLinkType, {\n className,\n disabled,\n onMouseDown,\n replace,\n to,\n onClick: (e) => {\n // Executes the user-provided event handler, if any.\n if (onClick) onClick(e);\n\n // By default, clicking the link scrolls the page to beginning.\n if (!keepScrollPosition) window.scroll(0, 0);\n },\n ...rest,\n }, children);\n}\n\nGenericLink.defaultProps = {\n children: null,\n className: null,\n disabled: false,\n enforceA: false,\n keepScrollPosition: false,\n onClick: null,\n onMouseDown: null,\n openNewTab: false,\n replace: false,\n to: '',\n};\n\nGenericLink.propTypes = {\n children: PT.node,\n className: PT.string,\n disabled: PT.bool,\n enforceA: PT.bool,\n keepScrollPosition: PT.bool,\n onClick: PT.func,\n onMouseDown: PT.func,\n openNewTab: PT.bool,\n replace: PT.bool,\n routerLinkType: PT.elementType.isRequired,\n to: PT.oneOfType([PT.object, PT.string]),\n};\n","/\n The Link wraps around React Router's Link component, to automatically replace\n * it by the regular <a> element when:\n * - The target reference points to another domain;\n * - User opts to open the reference in a new tab;\n * - User explicitely opts to use <a>.\n /\n\nimport { Link as RrLink } from 'react-router-dom';\n\nimport GenericLink from './GenericLink';\n\nexport default function Link(props) {\n / eslint-disable react/jsx-props-no-spreading /\n return <GenericLink {...props} routerLinkType={RrLink} />;\n / eslint-enable react/jsx-props-no-spreading /\n}\n","// The <Button> component implements a standard button / button-like link.\n\nimport PT from 'prop-types';\n\nimport Link from 'components/Link';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './style.scss';\n\nfunction BaseButton({\n active,\n children,\n disabled,\n enforceA,\n onClick,\n onMouseDown,\n openNewTab,\n replace,\n theme,\n to,\n}) {\n let className = theme.button;\n if (active && theme.active) className += ` ${theme.active}`;\n if (disabled) {\n if (theme.disabled) className += ` ${theme.disabled}`;\n return (\n <div className={className}>\n {children}\n </div>\n );\n }\n if (to) {\n return (\n <Link\n className={className}\n enforceA={enforceA}\n onClick={onClick}\n onMouseDown={onMouseDown}\n openNewTab={openNewTab}\n replace={replace}\n to={to}\n >\n {children}\n </Link>\n );\n }\n return (\n <div\n className={className}\n onClick={onClick}\n onKeyDown={onClick}\n onMouseDown={onMouseDown}\n role=\"button\"\n tabIndex={0}\n >\n {children}\n </div>\n );\n}\n\n/\n Button component theme: a map of CSS\n * class names to append to button elements:\n * @prop {string} [active] to the root element of active button.\n * @prop {string} [button] to the root element of any button.\n * @prop {string} [disabled] to the root element of disabled button.\n /\nconst ThemedButton = themed('Button', [\n 'active',\n 'button',\n 'disabled',\n], defaultTheme)(BaseButton);\n\n/\n Implements themeable buttons, and button-line links (elements which look\n * like buttons, but behave as links) in the same uniform manner.\n * @param {object} [props] Component props.\n * @param {boolean} [props.active] Set `true` to render the button as\n * active, even if it is not active otherwise.\n * @param {boolean} [props.disabled] Set `true` to disable the button.\n * @param {boolean} [props.enforceA] When the button is rendered as `<Link>`\n * component, this prop enforces it to be rendered as a simple `<a>` element\n * (external link), rather than the React router's internal link.\n * See `<Link>` documentation to learn when links are rendered as `<a>`\n * by default.\n * @param {function} [props.onClick] Click event handler.\n * @param {function} [props.onMouseDown] Mouse down event handler.\n * @param {boolean} [props.openNewTab] Set `true` to open link in the new tab.\n * @param {boolean} [props.replace] When the button is rendered as\n * `<Link>`, and the target URL is internal, this property tells that\n * the new route should replace the last record in the browser's history,\n * rather than to be pushed as a new entry into the history stack.\n * @param {ButtonTheme} [props.theme] _Ad hoc_ button theme.\n * @param {object\|string} [props.to] If specified, the button will be rendered\n * as `<Link>` (if not disabled), and it will point to the specified location\n * or URL.\n * @param {...any} [props....]\n * [Other properties of themeable components](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nBaseButton.defaultProps = {\n active: false,\n children: undefined,\n disabled: false,\n enforceA: false,\n onClick: undefined,\n onMouseDown: undefined,\n openNewTab: false,\n replace: false,\n to: undefined,\n};\n\nBaseButton.propTypes = {\n active: PT.bool,\n children: PT.node,\n disabled: PT.bool,\n enforceA: PT.bool,\n onClick: PT.func,\n onMouseDown: PT.func,\n openNewTab: PT.bool,\n replace: PT.bool,\n theme: ThemedButton.themeType.isRequired,\n to: PT.oneOfType([PT.object, PT.string]),\n};\n\nexport default ThemedButton;\n","// extracted by mini-css-extract-plugin\nexport default {\"button\":\"E1FNQT\",\"context\":\"KM0v4f\",\"ad\":\"_3jm1-Q\",\"hoc\":\"_0plpDL\",\"active\":\"MAe9O6\",\"disabled\":\"Br9IWV\"};","import PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\nfunction Checkbox({\n checked,\n label,\n onChange,\n theme,\n}) {\n return (\n <div className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <input\n checked={checked}\n className={theme.checkbox}\n onChange={onChange}\n type=\"checkbox\"\n />\n </div>\n );\n}\n\n/\n Checkbox component theme: a map of\n * CSS classes to append to its elements:\n * @prop {string} [checkbox] to the underlying checkbox `<input>` element.\n * @prop {string} [container] to the root checkbox element.\n * @prop {string} [label] to the checkbox label element.\n /\nconst ThemedCheckbox = themed('Checkbox', [\n 'checkbox',\n 'container',\n 'label',\n], defaultTheme)(Checkbox);\n\n/\n The `<Checkbox>` component implements themeable checkboxes.\n * @param {object} [props] Component properties.\n * @param {boolean} [props.checked] Checkbox value.\n * @param {string} [props.label] Checkbox label.\n * @param {function} [props.onChange] State change handler.\n * @param {CheckboxTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other properties of themeable components](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties).\n /\nCheckbox.propTypes = {\n checked: PT.bool,\n label: PT.string,\n onChange: PT.func,\n theme: ThemedCheckbox.themeType.isRequired,\n};\n\nCheckbox.defaultProps = {\n checked: undefined,\n label: undefined,\n onChange: undefined,\n};\n\nexport default ThemedCheckbox;\n","// extracted by mini-css-extract-plugin\nexport default {\"checkbox\":\"A-f8qJ\",\"context\":\"dNQcC6\",\"ad\":\"earXxa\",\"hoc\":\"qAPfQ6\",\"container\":\"Kr0g3M\",\"label\":\"_3dML-O\"};","import { isString } from 'lodash';\nimport PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\n/\n Implements a themeable dropdown list. Internally it is rendered with help of\n * the standard HTML `<select>` element, thus the styling support is somewhat\n * limited.\n * @param {object} [props] Component properties.\n * @param {function} [props.filter] Options filter function. If provided, only\n * those elements of `options` list will be used by the dropdown, for which this\n * filter returns `true`.\n * @param {string} [props.label] Dropdown label.\n * @param {string} [props.onChange] Selection event handler.\n * @param {DropdownOption[]\|string[]} [props.options=[]] Array of dropdown\n * options. For string elements the option value and name will be the same.\n * It is allowed to mix DropdownOption and string elements in the same option\n * list.\n * @param {DropdownTheme} [props.theme] _Ad hoc_ theme.\n * @param {string} [props.value] Currently selected value.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction Dropdown({\n filter,\n label,\n onChange,\n options,\n theme,\n value,\n}) {\n const optionArray = [(\n <option\n className={theme.hiddenOption}\n key=\"__reactUtilsHiddenOption\"\n >\n &zwnj;\n </option>\n )];\n for (let i = 0; i < options.length; ++i) {\n let op = options[i];\n if (!filter \|\| filter(op)) {\n if (isString(op)) op = { value: op };\n optionArray.push((\n <option className={theme.option} key={op.value} value={op.value}>\n {op.name === undefined ? op.value : op.name }\n </option>\n ));\n }\n }\n return (\n <div className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <select\n className={theme.select}\n onChange={onChange}\n value={value}\n >\n {optionArray}\n </select>\n <div className={theme.arrow}>▼</div>\n </div>\n );\n}\n\nconst ThemedDropdown = themed('Dropdown', [\n 'arrow',\n 'container',\n 'hiddenOption',\n 'label',\n 'option',\n 'select',\n], defaultTheme)(Dropdown);\n\nDropdown.propTypes = {\n filter: PT.func,\n label: PT.string,\n onChange: PT.func,\n options: PT.arrayOf(\n PT.oneOfType([\n PT.shape({\n name: PT.node,\n value: PT.string.isRequired,\n }),\n PT.string,\n ]).isRequired,\n ),\n theme: ThemedDropdown.themeType.isRequired,\n value: PT.string,\n};\n\nDropdown.defaultProps = {\n filter: undefined,\n label: undefined,\n onChange: undefined,\n options: [],\n value: undefined,\n};\n\nexport default ThemedDropdown;\n","// extracted by mini-css-extract-plugin\nexport default {\"arrow\":\"-zPK7Y\",\"context\":\"haRIry\",\"ad\":\"D4XHG2\",\"hoc\":\"N3nd34\",\"container\":\"_9CQpeA\",\"label\":\"Gv0kyu\",\"hiddenOption\":\"RdW3yR\",\"select\":\"JXK1uw\"};","import PT from 'prop-types';\nimport { forwardRef } from 'react';\n\nimport { themed } from 'utils';\n\nimport defaultTheme from './theme.scss';\n\n/\n Themeable input field, based on the standard HTML `<input>` element.\n * @param {object} [props]\n * @param {string} [props.label] Input label.\n * @param {InputTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props...] [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n * @param {...any} [props...] Any other properties are passed to the underlying\n * `<input>` element.\n /\nconst Input = forwardRef(({\n label,\n theme,\n ...rest\n}, ref) => (\n <span className={theme.container}>\n { label === undefined ? null : <p className={theme.label}>{label}</p> }\n <input\n className={theme.input}\n ref={ref}\n {...rest} // eslint-disable-line react/jsx-props-no-spreading\n />\n </span>\n));\n\nconst ThemedInput = themed('Input', [\n 'container',\n 'input',\n 'label',\n], defaultTheme)(Input);\n\nInput.propTypes = {\n label: PT.string,\n theme: ThemedInput.themeType.isRequired,\n};\n\nInput.defaultProps = {\n label: undefined,\n};\n\nexport default ThemedInput;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"Cxx397\",\"context\":\"X5WszA\",\"ad\":\"_8s7GCr\",\"hoc\":\"TVlBYc\",\"input\":\"M07d4s\",\"label\":\"gfbdq-\"};","import PT from 'prop-types';\n\nimport { themed } from 'utils';\n\nimport baseTheme from './base-theme.scss';\n\n/\n Simple and themeable page layout. It keeps the main content centered in\n * a column of limited width, which fills entire viewport on small screens\n * (under `$screen-md = 1024px` size). At larger screens the column keeps\n * `$screen-md` size, and it is centered at the page, surrounded by side\n * panels, where additional content can be displayed.\n \n Children: Component children are rendered as the content of main panel.\n * @param {object} [props] Component properties.\n * @param {Node} [props.leftSidePanelContent] The content for left side panel.\n * @param {Node} [props.rightSidePanelContent] The content for right side panel.\n * @param {PageLayoutTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction PageLayout({\n children,\n leftSidePanelContent,\n rightSidePanelContent,\n theme,\n}) {\n return (\n <div className={theme.container}>\n <div className={[theme.sidePanel, theme.leftSidePanel].join(' ')}>\n {leftSidePanelContent}\n </div>\n <div className={theme.mainPanel}>\n {children}\n </div>\n <div className={[theme.sidePanel, theme.rightSidePanel].join(' ')}>\n {rightSidePanelContent}\n </div>\n </div>\n );\n}\n\nconst ThemedPageLayout = themed('PageLayout', [\n 'container',\n 'leftSidePanel',\n 'mainPanel',\n 'rightSidePanel',\n 'sidePanel',\n], baseTheme)(PageLayout);\n\nPageLayout.propTypes = {\n children: PT.node,\n leftSidePanelContent: PT.node,\n rightSidePanelContent: PT.node,\n theme: ThemedPageLayout.themeType.isRequired,\n};\n\nPageLayout.defaultProps = {\n children: null,\n leftSidePanelContent: null,\n rightSidePanelContent: null,\n};\n\nexport default ThemedPageLayout;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"T3cuHB\",\"context\":\"m4mL-M\",\"ad\":\"m3-mdC\",\"hoc\":\"J15Z4H\",\"mainPanel\":\"pPlQO2\",\"sidePanel\":\"lqNh4h\"};","import PT from 'prop-types';\nimport { createContext, useMemo } from 'react';\nimport { Helmet } from 'react-helmet';\n\nconst Context = createContext();\n\n/\n The `<MetaTags>` component is an auxiliary wrapper around `react-helmet`,\n * which helps to inject meta tags (page title, a brief content description,\n * and social media thumbnails) into generated pages.\n \n When `<MetaTags>` are nested within the app's component tree, meta tags\n * content injected by components encountered down the tree overrides tags\n * injected by previously encountered `<MetaTags>` components.\n \n Children: `<MetaTags>` children, if any, are rendered at the component's\n * location. The context passes down all meta tag properties of parent\n * `<MetaTag>` instances. These properties can fetched within children\n * hierarchy in the following way, thus facilitating tags modification by\n * children:\n * ```jsx\n * import { useContext } from 'react';\n * import { MetaTags } from '@dr.pogodin/react-utils';\n * export default function SampleComponent() {\n * const { title, description, ...rest } = useContext(MetaTags.Context);\n * // Do something with these props here, e.g. prefix the page title with\n * // the component name:\n * return (\n * <MetaTags title={`Sample component - ${title}`} />\n * );\n * }\n * ```\n * @param {object} [props]\n * @param {string} [props.description] Page description to use in\n * the `description` meta tag, and as a default description of Open Graph Tags.\n * @param {string} [props.image] The absolute URL of thumbnail image to use\n * in Open Graph Tags (`twitter:image`, and `og:image`). By default these tags\n * are not injected.\n \n BEWARE: It must be a complete, absolute URL, including the correct\n * website domain and HTTP schema.\n \n @param {string} [props.siteName]: The site name to use in `twitter:site`,\n * and `og:sitename` tags. By default these tags are not injected.\n \n @param {string} [props.socialDescription] The site description to use in\n * `twitter:description` and `og:description` meta tags. By default the value of\n * `description` prop is used.\n * @param {string} [props.socialTitle] The page title to use in\n * `twitter:title`, `og:title`, and `og:image:alt` tags. By default the value of\n * `title` prop is used. Also the `og:image:alt` tag is only injected if `image`\n * prop is present.\n \n @param {string} props.title: The page name to use in the `<title>` tag.\n * It is also used as the default value of `socialTitle` prop.\n \n @param {string} [props.url] The page URL to use in `og:url` tag.\n * By default the tag is not injected.\n /\nexport default function MetaTags({\n children,\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n}) {\n const socTitle = socialTitle \|\| title;\n const socDesc = socialDescription \|\| description;\n\n const context = useMemo(() => ({\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n }), [\n description,\n image,\n siteName,\n socialDescription,\n socialTitle,\n title,\n url,\n ]);\n\n return (\n <>\n <Helmet>\n {/ General tags. /}\n <title>\n {title}\n </title>\n <meta name=\"description\" content={description} />\n\n {/ Twitter cards. /}\n <meta name=\"twitter:card\" content=\"summary_large_image\" />\n <meta name=\"twitter:title\" content={socTitle} />\n <meta name=\"twitter:description\" content={socDesc} />\n { image ? <meta name=\"twitter:image\" content={image} /> : null }\n {\n siteName ? (\n <meta name=\"twitter:site\" content={`@${siteName}`} />\n ) : null\n }\n\n {/ Open Graph data. /}\n <meta name=\"og:title\" content={socTitle} />\n { image ? <meta name=\"og:image\" content={image} /> : null }\n { image ? <meta name=\"og:image:alt\" content={socTitle} /> : null }\n <meta name=\"og:description\" content={socDesc} />\n {\n siteName ? (<meta name=\"og:sitename\" content={siteName} />) : null\n }\n { url ? (<meta name=\"og:url\" content={url} />) : null }\n </Helmet>\n {\n children ? (\n <Context.Provider value={context}>\n {children}\n </Context.Provider>\n ) : null\n }\n </>\n );\n}\n\nMetaTags.Context = Context;\n\nMetaTags.defaultProps = {\n children: null,\n image: null,\n siteName: null,\n socialDescription: null,\n socialTitle: null,\n url: null,\n};\n\nMetaTags.propTypes = {\n children: PT.node,\n description: PT.string.isRequired,\n image: PT.string,\n siteName: PT.string,\n socialDescription: PT.string,\n socialTitle: PT.string,\n title: PT.string.isRequired,\n url: PT.string,\n};\n","/ global document /\n\nimport { noop } from 'lodash';\n\nimport {\n useEffect,\n useMemo,\n useRef,\n useState,\n} from 'react';\n\nimport ReactDom from 'react-dom';\nimport PT from 'prop-types';\nimport themed from '@dr.pogodin/react-themes';\n\nimport baseTheme from './base-theme.scss';\nimport './styles.scss';\n\n/\n The `<Modal>` component implements a simple themeable modal window, wrapped\n * into the default theme. `<BaseModal>` exposes the base non-themed component.\n * Children: Component children are rendered as the modal content.\n * @param {object} props Component properties. Beside props documented below,\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties) are supported as well.\n * @param {function} [props.onCancel] The callback to trigger when user\n * clicks outside the modal, or presses Escape. It is expected to hide the\n * modal.\n * @param {ModalTheme} [props.theme] _Ad hoc_ theme.\n /\nfunction BaseModal({\n children,\n onCancel,\n theme,\n}) {\n const containerRef = useRef();\n const overlayRef = useRef();\n const [portal, setPortal] = useState();\n\n useEffect(() => {\n const p = document.createElement('div');\n document.body.classList.add('scrolling-disabled-by-modal');\n document.body.appendChild(p);\n setPortal(p);\n return () => {\n document.body.classList.remove('scrolling-disabled-by-modal');\n document.body.removeChild(p);\n };\n }, []);\n\n const focusLast = useMemo(() => (\n <div\n onFocus={() => {\n const elems = containerRef.current.querySelectorAll('');\n for (let i = elems.length - 1; i >= 0; --i) {\n elems[i].focus();\n if (document.activeElement === elems[i]) return;\n }\n overlayRef.current.focus();\n }}\n /* eslint-disable jsx-a11y/no-noninteractive-tabindex /\n tabIndex=\"0\"\n / eslint-enable jsx-a11y/no-noninteractive-tabindex /\n />\n ), []);\n\n return portal ? ReactDom.createPortal(\n (\n <>\n {focusLast}\n <div\n aria-label=\"Cancel\"\n className={theme.overlay}\n onClick={() => onCancel()}\n onKeyDown={(e) => {\n if (e.key === 'Escape') onCancel();\n }}\n ref={(node) => {\n if (node && node !== overlayRef.current) {\n overlayRef.current = node;\n node.focus();\n }\n }}\n role=\"button\"\n tabIndex=\"0\"\n />\n <div\n aria-modal=\"true\"\n className={theme.container}\n onWheel={(event) => event.stopPropagation()}\n ref={containerRef}\n role=\"dialog\"\n >\n {children}\n </div>\n <div\n onFocus={() => {\n overlayRef.current.focus();\n }}\n / eslint-disable jsx-a11y/no-noninteractive-tabindex /\n tabIndex=\"0\"\n / eslint-enable jsx-a11y/no-noninteractive-tabindex /\n />\n {focusLast}\n </>\n ),\n portal,\n ) : null;\n}\n\nconst ThemedModal = themed(\n 'Modal',\n [\n 'container',\n 'overlay',\n ],\n baseTheme,\n)(BaseModal);\n\nBaseModal.propTypes = {\n onCancel: PT.func,\n children: PT.node,\n theme: ThemedModal.themeType.isRequired,\n};\n\nBaseModal.defaultProps = {\n onCancel: noop,\n children: null,\n};\n\nexport default ThemedModal;\n\n/ Non-themed version of the Modal. /\nexport { BaseModal };\n","// extracted by mini-css-extract-plugin\nexport default {\"overlay\":\"ye2BZo\",\"context\":\"Szmbbz\",\"ad\":\"Ah-Nsc\",\"hoc\":\"Wki41G\",\"container\":\"gyZ4rc\"};","import { NavLink as RrNavLink } from 'react-router-dom';\n\nimport GenericLink from './GenericLink';\n\nexport default function NavLink(props) {\n / eslint-disable react/jsx-props-no-spreading /\n return <GenericLink {...props} routerLinkType={RrNavLink} />;\n / eslint-enable react/jsx-props-no-spreading /\n}\n","import PT from 'prop-types';\n\nimport './style.scss';\n\n/\n The `<ScalableRect>` component implements container keeping given aspect\n * ratio, while its width is altered.\n \n Children: Component children are rendered as the component's content.\n * @param {object} props\n * @param {string} [props.className] CSS class for component container.\n * @param {string} [props.ratio=1:1] Ratio of the rendered rectangle sides,\n * in `W:H` form.\n /\nexport default function ScalableRect({ children, className, ratio }) {\n const aux = ratio.split(':');\n const paddingBottom = `${(100 aux[1]) / aux[0]}%`;\n\n /* NOTE: In case the following code looks strange to you, mind that we want to\n * allow the user to set custom styles on this component. If user passes in a\n * \"className\" prop (possibly \"styleName\", but that one is converted to\n * \"className\" by Babel just before being passed into this component), it\n * should not interfere with the sizing behavior, thus we need an extra <div>\n * level in this component; however, if user does not need a custom styling,\n * we can save one level of HTML code, so we do it. /\n const rect = (\n <div\n style={{ paddingBottom }}\n styleName=\"container\"\n >\n <div styleName=\"wrapper\">\n {children}\n </div>\n </div>\n );\n return className ? (\n <div className={className}>\n {rect}\n </div>\n ) : rect;\n}\n\nScalableRect.defaultProps = {\n children: null,\n className: null,\n ratio: '1:1',\n};\n\nScalableRect.propTypes = {\n children: PT.node,\n className: PT.string,\n ratio: PT.string,\n};\n","import PT from 'prop-types';\nimport themed from '@dr.pogodin/react-themes';\n\nimport defaultTheme from './theme.scss';\n\n/\n Throbber is an \"action in progress\" indicator, which renders\n * three bouncing circles as a simple pending activity indicator,\n * and can be further themed to a certain degree.\n * @param {object} [props] Component properties.\n * @param {ThrobberTheme} [props.theme] _Ad hoc_ theme.\n * @param {...any} [props....]\n * [Other theming properties](https://www.npmjs.com/package/@dr.pogodin/react-themes#themed-component-properties)\n /\nfunction Throbber({\n theme,\n}) {\n return (\n <span className={theme.container} styleName=\"container\">\n <span className={theme.circle} styleName=\"circle\" />\n <span className={theme.circle} styleName=\"circle\" />\n <span className={theme.circle} styleName=\"circle\" />\n </span>\n );\n}\n\nThrobber.defaultProps = {\n theme: {},\n};\n\nThrobber.propTypes = {\n theme: PT.shape({\n container: PT.string,\n circle: PT.string,\n }),\n};\n\nexport default themed('Throbber', [\n 'circle',\n 'container',\n], defaultTheme)(Throbber);\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"_7zdld4\",\"context\":\"uIObt7\",\"ad\":\"XIxe9o\",\"hoc\":\"YOyORH\",\"circle\":\"dBrB4g\",\"bouncing\":\"TJe-6j\"};","/\n The actual tooltip component. It is rendered outside the regular document\n * hierarchy, and with sub-components managed without React to achieve the best\n * performance during animation.\n /\n/ global document, window /\n\nimport {\n forwardRef,\n useEffect,\n useImperativeHandle,\n useState,\n} from 'react';\nimport { createPortal } from 'react-dom';\n\nimport PT from 'prop-types';\n\n/ Valid placements of the rendered tooltip. They will be overriden when\n * necessary to fit the tooltip within the viewport. /\nexport const PLACEMENTS = {\n ABOVE_CURSOR: 'ABOVE_CURSOR',\n ABOVE_ELEMENT: 'ABOVE_ELEMENT',\n BELOW_CURSOR: 'BELOW_CURSOR',\n BELOW_ELEMENT: 'BELOW_ELEMENT',\n};\n\nconst ARROW_STYLE_DOWN = [\n 'border-bottom-color:transparent',\n 'border-left-color:transparent',\n 'border-right-color:transparent',\n].join(';');\n\nconst ARROW_STYLE_UP = [\n 'border-top-color:transparent',\n 'border-left-color:transparent',\n 'border-right-color:transparent',\n].join(';');\n\n/\n Creates tooltip components.\n * @ignore\n * @param {object} theme Themes to use for tooltip container, arrow,\n * and content.\n * @return {object} Object with DOM references to the container components:\n * container, arrow, content.\n /\nfunction createTooltipComponents(theme) {\n const arrow = document.createElement('div');\n if (theme.arrow) arrow.setAttribute('class', theme.arrow);\n\n const content = document.createElement('div');\n if (theme.content) content.setAttribute('class', theme.content);\n\n const container = document.createElement('div');\n if (theme.container) container.setAttribute('class', theme.container);\n\n container.appendChild(arrow);\n container.appendChild(content);\n document.body.appendChild(container);\n\n return { container, arrow, content };\n}\n\n/\n Generates bounding client rectangles for tooltip components.\n * @ignore\n * @param {object} tooltip DOM references to the tooltip components.\n * @param {object} tooltip.arrow\n * @param {object} tooltip.container\n * @return {{ arrow: object, container}} Object holding tooltip rectangles in\n * two fields.\n /\nfunction calcTooltipRects(tooltip) {\n return {\n arrow: tooltip.arrow.getBoundingClientRect(),\n container: tooltip.container.getBoundingClientRect(),\n };\n}\n\n/\n Calculates the document viewport size.\n * @ignore\n * @return {{x, y, width, height}}\n /\nfunction calcViewportRect() {\n const { pageXOffset, pageYOffset } = window;\n const { documentElement: { clientHeight, clientWidth } } = document;\n return {\n left: pageXOffset,\n right: pageXOffset + clientWidth,\n top: pageYOffset,\n bottom: pageYOffset + clientHeight,\n };\n}\n\n/\n Calculates tooltip and arrow positions for the placement just above\n * the cursor.\n * @ignore\n * @param {number} x Cursor page-x position.\n * @param {number} y Cursor page-y position.\n * @param {object} tooltipRects Bounding client rectangles of tooltip parts.\n * @param {object} tooltipRects.arrow\n * @param {object} tooltipRects.container\n * @return {object} Contains the following fields:\n * - {number} arrowX\n * - {number} arrowY\n * - {number} containerX\n * - {number} containerY\n * - {string} baseArrowStyle\n /\nfunction calcPositionAboveXY(x, y, tooltipRects) {\n const { arrow, container } = tooltipRects;\n return {\n arrowX: 0.5 (container.width - arrow.width),\n arrowY: container.height,\n containerX: x - container.width / 2,\n containerY: y - container.height - arrow.height / 1.5,\n\n // TODO: Instead of already setting the base style here, we should\n // introduce a set of constants for arrow directions, which will help\n // to do checks dependant on the arrow direction.\n baseArrowStyle: ARROW_STYLE_DOWN,\n };\n}\n\n/\nconst HIT = {\n NONE: false,\n LEFT: 'LEFT',\n RIGHT: 'RIGHT',\n TOP: 'TOP',\n BOTTOM: 'BOTTOM',\n};\n/\n\n/*\n Checks whether\n * @param {object} pos\n * @param {object} tooltipRects\n * @param {object} viewportRect\n * @return {HIT}\n /\n/\nfunction checkViewportFit(pos, tooltipRects, viewportRect) {\n const { containerX, containerY } = pos;\n if (containerX < viewportRect.left + 6) return HIT.LEFT;\n if (containerX > viewportRect.right - 6) return HIT.RIGHT;\n return HIT.NONE;\n}\n/\n\n/\n Shifts tooltip horizontally to fit into the viewport, while keeping\n * the arrow pointed to the XY point.\n * @param {number} x\n * @param {number} y\n * @param {object} pos\n * @param {number} pageXOffset\n * @param {number} pageXWidth\n /\n/\nfunction xPageFitCorrection(x, y, pos, pageXOffset, pageXWidth) {\n if (pos.containerX < pageXOffset + 6) {\n pos.containerX = pageXOffset + 6;\n pos.arrowX = Math.max(6, pageX - containerX - arrowRect.width / 2);\n } else {\n const maxX = pageXOffset + docRect.width - containerRect.width - 6;\n if (containerX > maxX) {\n containerX = maxX;\n arrowX = Math.min(\n containerRect.width - 6,\n pageX - containerX - arrowRect.width / 2,\n );\n }\n }\n}\n/\n\n/\n Sets positions of tooltip components to point the tooltip to the specified\n * page point.\n * @ignore\n * @param {number} pageX\n * @param {number} pageY\n * @param {PLACEMENTS} placement\n * @param {object} element DOM reference to the element wrapped by the tooltip.\n * @param {object} tooltip\n * @param {object} tooltip.arrow DOM reference to the tooltip arrow.\n * @param {object} tooltip.container DOM reference to the tooltip container.\n /\nfunction setComponentPositions(\n pageX,\n pageY,\n placement,\n element,\n tooltip,\n) {\n const tooltipRects = calcTooltipRects(tooltip);\n const viewportRect = calcViewportRect();\n\n / Default container coords: tooltip at the top. /\n const pos = calcPositionAboveXY(pageX, pageY, tooltipRects);\n\n if (pos.containerX < viewportRect.left + 6) {\n pos.containerX = viewportRect.left + 6;\n pos.arrowX = Math.max(\n 6,\n pageX - pos.containerX - tooltipRects.arrow.width / 2,\n );\n } else {\n const maxX = viewportRect.right - 6 - tooltipRects.container.width;\n if (pos.containerX > maxX) {\n pos.containerX = maxX;\n pos.arrowX = Math.min(\n tooltipRects.container.width - 6,\n pageX - pos.containerX - tooltipRects.arrow.width / 2,\n );\n }\n }\n\n / If tooltip has not enough space on top - make it bottom tooltip. /\n if (pos.containerY < viewportRect.top + 6) {\n pos.containerY += tooltipRects.container.height\n + 2 tooltipRects.arrow.height;\n pos.arrowY -= tooltipRects.container.height\n + tooltipRects.arrow.height;\n pos.baseArrowStyle = ARROW_STYLE_UP;\n }\n\n const containerStyle = `left:${pos.containerX}px;top:${pos.containerY}px`;\n tooltip.container.setAttribute('style', containerStyle);\n\n const arrowStyle = `${pos.baseArrowStyle};left:${pos.arrowX}px;top:${pos.arrowY}px`;\n tooltip.arrow.setAttribute('style', arrowStyle);\n}\n\n/* The Tooltip component itself. /\nconst Tooltip = forwardRef(({ children, theme }, ref) => {\n const [components, setComponents] = useState(null);\n\n const pointTo = (pageX, pageY, placement, element) => components\n && setComponentPositions(pageX, pageY, placement, element, components);\n useImperativeHandle(ref, () => ({ pointTo }));\n\n / Inits and destroys tooltip components. /\n useEffect(() => {\n const x = createTooltipComponents(theme);\n setComponents(x);\n return () => {\n document.body.removeChild(x.container);\n setComponents(null);\n };\n }, [theme]);\n\n return components ? createPortal(children, components.content) : null;\n});\n\nTooltip.propTypes = {\n children: PT.node,\n theme: PT.shape().isRequired,\n};\n\nTooltip.defaultProps = {\n children: null,\n};\n\nexport default Tooltip;\n","/ global window /\n\nimport PT from 'prop-types';\nimport { useEffect, useRef, useState } from 'react';\n\nimport { themed } from 'utils';\n\nimport Tooltip, { PLACEMENTS } from './Tooltip';\n\nimport defaultTheme from './default-theme.scss';\n\n/\n Implements a simple to use and themeable tooltip component, _e.g._\n * ```js\n * <WithTooltip tip=\"This is example tooltip.\">\n * <p>Hover to see the tooltip.</p>\n * </WithTooltip>\n * ```\n * Children: Children are rendered in the place of `<WithTooltip>`,\n * and when hovered the tooltip is shown. By default the wrapper itself is\n * `<div>` block with `display: inline-block`.\n * @param {object} props Component properties.\n * @param {React.node} props.tip – Anything React is able to render,\n * _e.g._ a tooltip text. This will be the tooltip content.\n * @param {WithTooltipTheme} props.theme _Ad hoc_ theme.\n /\nfunction Wrapper({\n children,\n placement,\n tip,\n theme,\n}) {\n const tooltipRef = useRef();\n const wrapperRef = useRef();\n const [showTooltip, setShowTooltip] = useState(false);\n\n const updatePortalPosition = (cursorX, cursorY) => {\n if (!showTooltip) setShowTooltip(true);\n else {\n const wrapperRect = wrapperRef.current.getBoundingClientRect();\n if (\n cursorX < wrapperRect.left\n \|\| cursorX > wrapperRect.right\n \|\| cursorY < wrapperRect.top\n \|\| cursorY > wrapperRect.bottom\n ) {\n setShowTooltip(false);\n } else if (tooltipRef.current) {\n tooltipRef.current.pointTo(\n cursorX + window.pageXOffset,\n cursorY + window.pageYOffset,\n placement,\n wrapperRef.current,\n );\n }\n }\n };\n\n useEffect(() => {\n if (showTooltip && tip !== null) {\n const listener = () => setShowTooltip(false);\n window.addEventListener('scroll', listener);\n return () => window.removeEventListener('scroll', listener);\n }\n return undefined;\n }, [showTooltip, tip]);\n\n return (\n <div\n className={theme.wrapper}\n onMouseLeave={() => setShowTooltip(false)}\n onMouseMove={(e) => updatePortalPosition(e.clientX, e.clientY)}\n ref={wrapperRef}\n >\n {\n showTooltip && tip !== null ? (\n <Tooltip ref={tooltipRef} theme={theme}>{tip}</Tooltip>\n ) : null\n }\n {children}\n </div>\n );\n}\n\nconst ThemedWrapper = themed(\n 'WithTooltip',\n [\n 'appearance',\n 'arrow',\n 'container',\n 'content',\n 'wrapper',\n ],\n defaultTheme,\n)(Wrapper);\n\nThemedWrapper.PLACEMENTS = PLACEMENTS;\n\nWrapper.propTypes = {\n children: PT.node,\n placement: PT.oneOf(Object.values(PLACEMENTS)),\n theme: ThemedWrapper.themeType.isRequired,\n tip: PT.node,\n};\n\nWrapper.defaultProps = {\n children: null,\n placement: PLACEMENTS.ABOVE_CURSOR,\n tip: null,\n};\n\nexport default ThemedWrapper;\n","// extracted by mini-css-extract-plugin\nexport default {\"arrow\":\"M9gywF\",\"ad\":\"_4xT7zE\",\"hoc\":\"zd-vnH\",\"context\":\"GdZucr\",\"container\":\"f9gY8K\",\"appearance\":\"L4ubm-\",\"wrapper\":\"_4qDBRM\"};","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"jTxmOX\",\"context\":\"dzIcLh\",\"ad\":\"_5a9XX1\",\"hoc\":\"_7sH52O\"};","import PT from 'prop-types';\nimport qs from 'qs';\nimport ScalableRect from 'components/ScalableRect';\nimport themed from '@dr.pogodin/react-themes';\nimport Throbber from 'components/Throbber';\n\nimport baseTheme from './base.scss';\nimport throbberTheme from './throbber.scss';\n\n/\n A component for embeding a YouTube video.\n * @param {object} [props] Component properties.\n * @param {boolean} [props.autoplay] If `true` the video will start to play\n * automatically once loaded.\n * @param {string} [props.src] URL of the video to play. Can be in any of\n * the following formats, and keeps any additional query parameters understood\n * by the YouTube IFrame player:\n * - `https://www.youtube.com/watch?v=NdF6Rmt6Ado`\n * - `https://youtu.be/NdF6Rmt6Ado`\n * - `https://www.youtube.com/embed/NdF6Rmt6Ado`\n * @param {YouTubeVideoTheme} [props.theme] _Ad hoc_ theme.\n * @param {string} [props.title] The `title` attribute to add to the player\n * IFrame.\n /\nfunction YouTubeVideo({\n autoplay,\n src,\n theme,\n title,\n}) {\n let [url, query] = src.split('?');\n query = query ? qs.parse(query) : {};\n\n const videoId = query.v \|\| url.match(/\\/([a-zA-Z0-9-_])$/)[1];\n url = `https://www.youtube.com/embed/${videoId}`;\n\n delete query.v;\n query.autoplay = autoplay ? 1 : 0;\n url += `?${qs.stringify(query)}`;\n\n // TODO: https://developers.google.com/youtube/player_parameters\n // More query parameters can be exposed via the component props.\n\n return (\n <ScalableRect className={theme.container} ratio=\"16:9\">\n <Throbber theme={throbberTheme} />\n <iframe\n allow=\"autoplay\"\n allowFullScreen\n className={theme.video}\n src={url}\n title={title}\n />\n </ScalableRect>\n );\n}\n\nconst ThemedYouTubeVideo = themed(\n 'YouTubeVideo',\n [\n 'container',\n 'video',\n ],\n baseTheme,\n)(YouTubeVideo);\n\nYouTubeVideo.propTypes = {\n autoplay: PT.bool,\n src: PT.string.isRequired,\n theme: ThemedYouTubeVideo.themeType.isRequired,\n title: PT.string,\n};\n\nYouTubeVideo.defaultProps = {\n autoplay: false,\n title: '',\n};\n\nexport default ThemedYouTubeVideo;\n","// extracted by mini-css-extract-plugin\nexport default {\"container\":\"sXHM81\",\"context\":\"veKyYi\",\"ad\":\"r3ABzd\",\"hoc\":\"YKcPnR\",\"video\":\"SlV2zw\"};","import 'styles/global.scss';\n\nimport { webpack } from 'utils';\n\nconst server = webpack.requireWeak('./server', __dirname);\n\nconst client = server ? undefined : require('./client').default;\n\nexport { default as api } from 'axios';\nexport * as PT from 'prop-types';\n\nexport {\n getGlobalState,\n getSsrContext,\n GlobalStateProvider,\n useAsyncCollection,\n useAsyncData,\n useGlobalState,\n} from '@dr.pogodin/react-global-state';\n\nexport * from 'components';\nexport * from 'utils';\n\nexport { client, server };\n"],"names":["root","factory","exports","module","require","define","amd","self","this","__WEBPACK_EXTERNAL_MODULE__269__","__WEBPACK_EXTERNAL_MODULE__899__","__WEBPACK_EXTERNAL_MODULE__198__","__WEBPACK_EXTERNAL_MODULE__300__","__WEBPACK_EXTERNAL_MODULE__760__","__WEBPACK_EXTERNAL_MODULE__467__","__WEBPACK_EXTERNAL_MODULE__0__","__WEBPACK_EXTERNAL_MODULE__654__","__WEBPACK_EXTERNAL_MODULE__99__","__WEBPACK_EXTERNAL_MODULE__656__","__WEBPACK_EXTERNAL_MODULE__156__","__WEBPACK_EXTERNAL_MODULE__111__","__WEBPACK_EXTERNAL_MODULE__715__","__WEBPACK_EXTERNAL_MODULE__383__","__WEBPACK_EXTERNAL_MODULE__128__","inj","document","querySelector","remove","key","getBuildInfo","forge","content","d","start","iv","slice","length","update","finish","output","data","eval","getInj","Launch","Application","options","arguments","undefined","container","getElementById","scene","_jsx","GlobalStateProvider","initialState","ISTATE","children","BrowserRouter","dontHydrate","createRoot","render","hydrateRoot","buildInfo","Error","BUILD_INFO","IS_CLIENT_SIDE","process","versions","node","global","REACT_UTILS_FORCE_CLIENT_SIDE","IS_SERVER_SIDE","isDevBuild","getMode","isProdBuild","buildTimestamp","timestamp","requireWeak","modulePath","basePath","resolve","path","default","def","named","Object","entries","forEach","_ref","value","resolveWeak","parse","str","TypeError","obj","dec","decode","index","eqIdx","indexOf","endIdx","lastIndexOf","trim","val","charCodeAt","tryDecode","serialize","name","opt","enc","encode","fieldContentRegExp","test","maxAge","isNaN","isFinite","Math","floor","domain","expires","__toString","call","Date","isDate","valueOf","toUTCString","httpOnly","secure","priority","toLowerCase","sameSite","prototype","toString","decodeURIComponent","encodeURIComponent","e","f","k","Symbol","for","l","m","hasOwnProperty","n","__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED","ReactCurrentOwner","p","ref","__self","__source","q","c","a","g","b","h","defaultProps","$$typeof","type","props","_owner","current","Fragment","jsx","jsxs","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","getter","__esModule","definition","o","defineProperty","enumerable","get","globalThis","Function","window","prop","r","toStringTag","config","CONFIG","cookie","CSRF","csrfToken","assign","dayjs","DAY_MS","HOUR_MS","MIN_MS","SEC_MS","YEAR_MS","now","timer","useCurrent","autorefresh","globalStatePath","precision","setter","useGlobalState","useEffect","timerId","old","neu","abs","setTimeout","clearTimeout","useTimezoneOffset","cookieName","ssrContext","getSsrContext","offset","setOffset","req","cookies","parseInt","getTimezoneOffset","Cookie","newBarrier","executor","Barrier","chunkGroups","styleSheetUsageCounters","NODE_CONFIG_ENV","CodeSplit","chunkName","getComponent","placeholder","heap","useRef","mounted","pendingStyles","publicPath","LazyComponent","lazy","async","res","Promise","all","chunks","getGlobalState","includes","push","asset","endsWith","link","createElement","setAttribute","barrier","onload","onerror","appendChild","count","item","removeChild","Suspense","fallback","splitComponent","CHUNK_GROUPS","propTypes","PT","themed","COMPOSE","PRIORITY","env","JU","webpack","withRetries","action","maxRetries","interval","error","time","GenericLink","className","disabled","enforceA","keepScrollPosition","onClick","onMouseDown","openNewTab","replace","routerLinkType","to","rest","match","href","preventDefault","rel","target","scroll","Link","RrLink","BaseButton","active","theme","button","onKeyDown","role","tabIndex","ThemedButton","themeType","isRequired","Checkbox","checked","label","onChange","_jsxs","checkbox","ThemedCheckbox","Dropdown","filter","optionArray","hiddenOption","i","op","isString","option","select","arrow","ThemedDropdown","Input","forwardRef","input","ThemedInput","PageLayout","leftSidePanelContent","rightSidePanelContent","sidePanel","leftSidePanel","join","mainPanel","rightSidePanel","ThemedPageLayout","Context","createContext","MetaTags","description","image","siteName","socialDescription","socialTitle","title","url","socTitle","socDesc","context","useMemo","_Fragment","Helmet","Provider","BaseModal","onCancel","containerRef","overlayRef","portal","setPortal","useState","body","classList","add","focusLast","onFocus","elems","querySelectorAll","focus","activeElement","ReactDom","overlay","onWheel","event","stopPropagation","ThemedModal","noop","NavLink","RrNavLink","ScalableRect","ratio","aux","split","paddingBottom","rect","style","Throbber","circle","PLACEMENTS","ABOVE_CURSOR","ABOVE_ELEMENT","BELOW_CURSOR","BELOW_ELEMENT","ARROW_STYLE_DOWN","ARROW_STYLE_UP","Tooltip","components","setComponents","pointTo","pageX","pageY","placement","element","tooltip","tooltipRects","getBoundingClientRect","calcTooltipRects","viewportRect","pageXOffset","pageYOffset","documentElement","clientHeight","clientWidth","left","right","top","bottom","calcViewportRect","pos","x","y","arrowX","width","arrowY","height","containerX","containerY","baseArrowStyle","calcPositionAboveXY","max","maxX","min","containerStyle","arrowStyle","setComponentPositions","useImperativeHandle","createTooltipComponents","createPortal","Wrapper","tip","tooltipRef","wrapperRef","showTooltip","setShowTooltip","listener","addEventListener","removeEventListener","wrapper","onMouseLeave","onMouseMove","updatePortalPosition","cursorX","cursorY","wrapperRect","clientX","clientY","ThemedWrapper","values","YouTubeVideo","autoplay","src","query","qs","videoId","v","throbberTheme","allow","allowFullScreen","video","ThemedYouTubeVideo","server","client"],"sourceRoot":""}