{"version":3,"file":"js/chunk-vendors.6b53f98e.js","mappings":";;;;;;;;;;;;;;;;;AAqBa,MAAAA,EAAY,CAIvBC,aAAa,EAIbC,YAAY,EAKZC,YAAa,qBCZFC,EAAS,SAAUC,EAAoBC,GAClD,IAAKD,EACH,MAAME,EAAeD,EAEzB,EAKaC,EAAiB,SAAUD,GACtC,OAAO,IAAIE,MACT,sBACER,EAAUG,YACV,6BACAG,EAEN,ECrBMG,EAAoB,SAAUC,GAElC,MAAMC,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,IAAIE,EAAIL,EAAIM,WAAWH,GACnBE,EAAI,IACNJ,EAAIC,KAAOG,EACFA,EAAI,MACbJ,EAAIC,KAAQG,GAAK,EAAK,IACtBJ,EAAIC,KAAY,GAAJG,EAAU,KAEL,SAAZ,MAAJA,IACDF,EAAI,EAAIH,EAAII,QACyB,SAAZ,MAAxBJ,EAAIM,WAAWH,EAAI,KAGpBE,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBL,EAAIM,aAAaH,IACvDF,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,GAAM,GAAM,IAC9BJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,MAEtBJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,IAEzB,CACD,OAAOJ,CACT,EAQMM,EAAoB,SAAUC,GAElC,MAAMP,EAAgB,GACtB,IAAIQ,EAAM,EACRJ,EAAI,EACN,MAAOI,EAAMD,EAAMJ,OAAQ,CACzB,MAAMM,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACPT,EAAII,KAAOM,OAAOC,aAAaF,QAC1B,GAAIA,EAAK,KAAOA,EAAK,IAAK,CAC/B,MAAMG,EAAKL,EAAMC,KACjBR,EAAII,KAAOM,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,EACpD,MAAM,GAAIH,EAAK,KAAOA,EAAK,IAAK,CAE/B,MAAMG,EAAKL,EAAMC,KACXK,EAAKN,EAAMC,KACXM,EAAKP,EAAMC,KACXO,IACI,EAALN,IAAW,IAAa,GAALG,IAAY,IAAa,GAALC,IAAY,EAAW,GAALC,GAC5D,MACFd,EAAII,KAAOM,OAAOC,aAAa,OAAUI,GAAK,KAC9Cf,EAAII,KAAOM,OAAOC,aAAa,OAAc,KAAJI,GAC1C,KAAM,CACL,MAAMH,EAAKL,EAAMC,KACXK,EAAKN,EAAMC,KACjBR,EAAII,KAAOM,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALC,EAE3C,CACF,CACD,OAAOb,EAAIgB,KAAK,GAClB,EAqBaC,EAAiB,CAI5BC,eAAgB,KAKhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBACE,iEAKF,gBAAIC,GACF,OAAOC,KAAKF,kBAAoB,K,EAMlC,wBAAIG,GACF,OAAOD,KAAKF,kBAAoB,K,EAUlCI,mBAAoC,oBAATC,KAW3BC,eAAAA,CAAgBC,EAA8BC,GAC5C,IAAKC,MAAMC,QAAQH,GACjB,MAAMhC,MAAM,iDAGd2B,KAAKS,QAEL,MAAMC,EAAgBJ,EAClBN,KAAKJ,sBACLI,KAAKN,eAEHiB,EAAS,GAEf,IAAK,IAAIjC,EAAI,EAAGA,EAAI2B,EAAM1B,OAAQD,GAAK,EAAG,CACxC,MAAMkC,EAAQP,EAAM3B,GACdmC,EAAYnC,EAAI,EAAI2B,EAAM1B,OAC1BmC,EAAQD,EAAYR,EAAM3B,EAAI,GAAK,EACnCqC,EAAYrC,EAAI,EAAI2B,EAAM1B,OAC1BqC,EAAQD,EAAYV,EAAM3B,EAAI,GAAK,EAEnCuC,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EACnD,IAAIK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,EAEVD,IACHK,EAAW,GAENP,IACHM,EAAW,KAIfR,EAAOU,KACLX,EAAcO,GACdP,EAAcQ,GACdR,EAAcS,GACdT,EAAcU,GAEjB,CAED,OAAOT,EAAOnB,KAAK,G,EAWrB8B,YAAAA,CAAajB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBiB,KAAKlB,GAEPL,KAAKI,gBAAgB9B,EAAkB+B,GAAQC,E,EAWxDkB,YAAAA,CAAanB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBH,KAAKE,GAEPvB,EAAkBkB,KAAKyB,wBAAwBpB,EAAOC,G,EAkB/DmB,uBAAAA,CAAwBpB,EAAeC,GACrCN,KAAKS,QAEL,MAAMiB,EAAgBpB,EAClBN,KAAKH,sBACLG,KAAKL,eAEHgB,EAAmB,GAEzB,IAAK,IAAIjC,EAAI,EAAGA,EAAI2B,EAAM1B,QAAU,CAClC,MAAMiC,EAAQc,EAAcrB,EAAMsB,OAAOjD,MAEnCmC,EAAYnC,EAAI2B,EAAM1B,OACtBmC,EAAQD,EAAYa,EAAcrB,EAAMsB,OAAOjD,IAAM,IACzDA,EAEF,MAAMqC,EAAYrC,EAAI2B,EAAM1B,OACtBqC,EAAQD,EAAYW,EAAcrB,EAAMsB,OAAOjD,IAAM,KACzDA,EAEF,MAAMkD,EAAYlD,EAAI2B,EAAM1B,OACtBkD,EAAQD,EAAYF,EAAcrB,EAAMsB,OAAOjD,IAAM,GAG3D,KAFEA,EAEW,MAATkC,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATa,EACrD,MAAM,IAAIC,EAGZ,MAAMb,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAOU,KAAKJ,GAEE,KAAVD,EAAc,CAChB,MAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAOU,KAAKH,GAEE,KAAVW,EAAc,CAChB,MAAMV,EAAaH,GAAS,EAAK,IAAQa,EACzClB,EAAOU,KAAKF,EACb,CACF,CACF,CAED,OAAOR,C,EAQTF,KAAAA,GACE,IAAKT,KAAKN,eAAgB,CACxBM,KAAKN,eAAiB,CAAC,EACvBM,KAAKL,eAAiB,CAAC,EACvBK,KAAKJ,sBAAwB,CAAC,EAC9BI,KAAKH,sBAAwB,CAAC,EAG9B,IAAK,IAAInB,EAAI,EAAGA,EAAIsB,KAAKD,aAAapB,OAAQD,IAC5CsB,KAAKN,eAAehB,GAAKsB,KAAKD,aAAa4B,OAAOjD,GAClDsB,KAAKL,eAAeK,KAAKN,eAAehB,IAAMA,EAC9CsB,KAAKJ,sBAAsBlB,GAAKsB,KAAKC,qBAAqB0B,OAAOjD,GACjEsB,KAAKH,sBAAsBG,KAAKJ,sBAAsBlB,IAAMA,EAGxDA,GAAKsB,KAAKF,kBAAkBnB,SAC9BqB,KAAKL,eAAeK,KAAKC,qBAAqB0B,OAAOjD,IAAMA,EAC3DsB,KAAKH,sBAAsBG,KAAKD,aAAa4B,OAAOjD,IAAMA,EAG/D,C;;;;;;;;;;;;;;;;GAOC,MAAOoD,UAAgCzD,MAA7C0D,WAAAA,G,oBACW,KAAIC,KAAG,yB,EAMX,MAAMC,EAAe,SAAU1D,GACpC,MAAM2D,EAAY5D,EAAkBC,GACpC,OAAOkB,EAAOW,gBAAgB8B,GAAW,EAC3C,EAMaC,EAAgC,SAAU5D,GAErD,OAAO0D,EAAa1D,GAAK6D,QAAQ,MAAO,GAC1C,EAWaC,EAAe,SAAU9D,GACpC,IACE,OAAOkB,EAAO+B,aAAajD,GAAK,EACjC,CAAC,MAAO+D,GACPC,QAAQC,MAAM,wBAAyBF,EACxC,CACD,OAAO,IACT;;;;;;;;;;;;;;;;;ACnWM,SAAUG,EAAYC,GAC1B,OAAOC,OAAWC,EAAWF,EAC/B,CAgBgB,SAAAC,EAAWE,EAAiBC,GAC1C,KAAMA,aAAkBC,QACtB,OAAOD,EAGT,OAAQA,EAAOf,aACb,KAAKiB,KAGH,MAAMC,EAAYH,EAClB,OAAO,IAAIE,KAAKC,EAAUC,WAE5B,KAAKH,YACYH,IAAXC,IACFA,EAAS,CAAC,GAEZ,MACF,KAAKtC,MAEHsC,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,MAAMK,KAAQL,EAEZA,EAAOM,eAAeD,IAAUE,EAAWF,KAG/CN,EAAmCM,GAAQR,EACzCE,EAAmCM,GACnCL,EAAmCK,KAIxC,OAAON,CACT,CAEA,SAASQ,EAAWC,GAClB,MAAe,cAARA,CACT;;;;;;;;;;;;;;;;YC3DgBC,IACd,GAAoB,qBAATC,KACT,OAAOA,KAET,GAAsB,qBAAXC,OACT,OAAOA,OAET,GAAsB,qBAAXC,EAAAA,EACT,OAAOA,EAAAA,EAET,MAAM,IAAIrF,MAAM,kCAClB;;;;;;;;;;;;;;;;GCsBA,MAAMsF,EAAwBA,IAC5BJ,IAAYK,sBAURC,EAA6BA,KACjC,GAAuB,qBAAZC,QACT,OAEF,MAAMC,EAAqBD,CAAAA,SAAAA,aAAAA,SAAAA,KAAYF,sBACvC,OAAIG,EACKC,KAAKC,MAAMF,QADpB,CAEC,EAGGG,EAAwBA,KAC5B,GAAwB,qBAAbC,SACT,OAEF,IAAIC,EACJ,IACEA,EAAQD,SAASE,OAAOD,MAAM,gCAC/B,CAAC,MAAO9B,GAGP,MACD,CACD,MAAMgC,EAAUF,GAAS/B,EAAa+B,EAAM,IAC5C,OAAOE,GAAWN,KAAKC,MAAMK,EAAQ,EAU1BC,EAAcA,KACzB,IACE,OACEZ,KACAE,KACAK,GAEH,CAAC,MAAO5B,GAQP,YADAC,QAAQiC,KAAK,+CAA+ClC,IAE7D,GASUmC,EACXC,IACuB,IAAAC,EAAAC,EAAA,OAA4B,QAA5BA,EAAe,QAAfD,EAAAJ,WAAe,IAAAI,OAAA,EAAAA,EAAAE,qBAAa,IAAAD,OAAA,EAAAA,EAAGF,EAAY,EAQvDI,EACXJ,IAEA,MAAMK,EAAON,EAAuBC,GACpC,IAAKK,EACH,OAEF,MAAMC,EAAiBD,EAAKE,YAAY,KACxC,GAAID,GAAkB,GAAKA,EAAiB,IAAMD,EAAKpG,OACrD,MAAM,IAAIN,MAAM,gBAAgB0G,yCAGlC,MAAMG,EAAOC,SAASJ,EAAKK,UAAUJ,EAAiB,GAAI,IAC1D,MAAgB,MAAZD,EAAK,GAEA,CAACA,EAAKK,UAAU,EAAGJ,EAAiB,GAAIE,GAExC,CAACH,EAAKK,UAAU,EAAGJ,GAAiBE,EAC5C,EAOUG,EAAsBA,KAAyC,IAAAV,EAC1E,OAAa,QAAbA,EAAAJ,WAAa,IAAAI,OAAA,EAAAA,EAAEW,MAAM;;;;;;;;;;;;;;;;;MC/IVC,EAIXxD,WAAAA,GAFA,KAAAyD,OAAoC,OACpC,KAAAC,QAAqC,OAEnCzF,KAAK0F,QAAU,IAAIC,SAAQ,CAACF,EAASD,KACnCxF,KAAKyF,QAAUA,EACfzF,KAAKwF,OAASA,CAAmC,G,CASrDI,YAAAA,CACEC,GAEA,MAAO,CAACrD,EAAOE,KACTF,EACFxC,KAAKwF,OAAOhD,GAEZxC,KAAKyF,QAAQ/C,GAES,oBAAbmD,IAGT7F,KAAK0F,QAAQI,OAAM,SAIK,IAApBD,EAASlH,OACXkH,EAASrD,GAETqD,EAASrD,EAAOE,GAEnB,C;;;;;;;;;;;;;;;;GCwCS,SAAAqD,EACdC,EACAC,GAEA,GAAID,EAAME,IACR,MAAM,IAAI7H,MACR,gHAIJ,MAAM8H,EAAS,CACbC,IAAK,OACLC,KAAM,OAGFC,EAAUL,GAAa,eACvBM,EAAMP,EAAMO,KAAO,EACnBC,EAAMR,EAAMQ,KAAOR,EAAMS,QAC/B,IAAKD,EACH,MAAM,IAAInI,MAAM,wDAGlB,MAAMqI,EAAO3D,OAAA4D,OAAA,CAEXC,IAAK,kCAAkCN,IACvCO,IAAKP,EACLC,MACAO,IAAKP,EAAM,KACXQ,UAAWR,EACXC,MACAC,QAASD,EACTQ,SAAU,CACRC,iBAAkB,SAClBC,WAAY,CAAC,IAIZlB,GAICmB,EAAY,GAClB,MAAO,CACLhF,EAA8B6B,KAAKoD,UAAUjB,IAC7ChE,EAA8B6B,KAAKoD,UAAUV,IAC7CS,GACA3H,KAAK,IACT;;;;;;;;;;;;;;;;YChHgB6H,IACd,MACuB,qBAAdC,WAC2B,kBAA3BA,UAAU,aAEVA,UAAU,aAEV,EAEX,C,SASgBC,IACd,MACoB,qBAAX9D,WAGJA,OAAO,YAAcA,OAAO,aAAeA,OAAO,cACrD,oDAAoD+D,KAAKH,IAE7D,C,SA+EgBI,IACd,MACuB,kBAAdH,WAAmD,gBAAzBA,UAAU,UAE/C,C,SAuBgBI,IACd,OAAiC,IAA1B7J,EAAUC,cAAiD,IAAzBD,EAAUE,UACrD,C,SAgBgB4J,IACd,IACE,MAA4B,kBAAdC,SACf,CAAC,MAAOtF,GACP,OAAO,CACR,CACH,C,SASgBuF,IACd,OAAO,IAAIlC,SAAQ,CAACF,EAASD,KAC3B,IACE,IAAIsC,GAAoB,EACxB,MAAMC,EACJ,0DACIC,EAAUxE,KAAKoE,UAAUK,KAAKF,GACpCC,EAAQE,UAAY,KAClBF,EAAQG,OAAOC,QAEVN,GACHtE,KAAKoE,UAAUS,eAAeN,GAEhCtC,GAAQ,EAAK,EAEfuC,EAAQM,gBAAkB,KACxBR,GAAW,CAAK,EAGlBE,EAAQO,QAAU,K,MAChB/C,GAAoB,QAAbb,EAAAqD,EAAQxF,aAAK,IAAAmC,OAAA,EAAAA,EAAExG,UAAW,GAAG,CAEvC,CAAC,MAAOqE,GACPgD,EAAOhD,EACR,IAEL;;;;;;;;;;;;;;;;;AC/JA,MAAMgG,EAAa,gBAYb,MAAOC,UAAsBpK,MAIjC0D,WAAAA,CAEW2G,EACTvK,EAEOwK,GAEPC,MAAMzK,GALG,KAAIuK,KAAJA,EAGF,KAAUC,WAAVA,EAPA,KAAI3G,KAAWwG,EAatBzF,OAAO8F,eAAe7I,KAAMyI,EAAcK,WAItCzK,MAAM0K,mBACR1K,MAAM0K,kBAAkB/I,KAAMgJ,EAAaF,UAAUG,O,QAK9CD,EAIXjH,WAAAA,CACmBmH,EACAC,EACAC,GAFA,KAAOF,QAAPA,EACA,KAAWC,YAAXA,EACA,KAAMC,OAANA,C,CAGnBH,MAAAA,CACEP,KACGW,GAEH,MAAMV,EAAcU,EAAK,IAAoB,CAAC,EACxCC,EAAc,GAAAtJ,KAAKkJ,WAAWR,IAC9Ba,EAAWvJ,KAAKoJ,OAAOV,GAEvBvK,EAAUoL,EAAWC,EAAgBD,EAAUZ,GAAc,QAE7Dc,EAAc,GAAGzJ,KAAKmJ,gBAAgBhL,MAAYmL,MAElD9G,EAAQ,IAAIiG,EAAca,EAAUG,EAAad,GAEvD,OAAOnG,C,EAIX,SAASgH,EAAgBD,EAAkBF,GACzC,OAAOE,EAASnH,QAAQsH,GAAS,CAACC,EAAGrG,KACnC,MAAMZ,EAAQ2G,EAAK/F,GACnB,OAAgB,MAATZ,EAAgBxD,OAAOwD,GAAa,IAAAY,KAAO,GAEtD,CAEA,MAAMoG,EAAU;;;;;;;;;;;;;;;;GC9GV,SAAUE,EAASrL,GACvB,OAAOyF,KAAKC,MAAM1F,EACpB,CAOM,SAAU6I,EAAUiC,GACxB,OAAOrF,KAAKoD,UAAUiC,EACxB;;;;;;;;;;;;;;;;GCIO,MAAMQ,EAAS,SAAU7D,GAC9B,IAAIG,EAAS,CAAC,EACZ2D,EAAiB,CAAC,EAClBT,EAAO,CAAC,EACRlC,EAAY,GAEd,IACE,MAAM4C,EAAQ/D,EAAMgE,MAAM,KAC1B7D,EAASyD,EAASvH,EAAa0H,EAAM,KAAO,IAC5CD,EAASF,EAASvH,EAAa0H,EAAM,KAAO,IAC5C5C,EAAY4C,EAAM,GAClBV,EAAOS,EAAO,MAAQ,CAAC,SAChBA,EAAO,IACf,CAAC,MAAOxH,GAAI,CAEb,MAAO,CACL6D,SACA2D,SACAT,OACAlC,YAEJ,EAqEa8C,EAAgB,SAAUjE,GACrC,MAAM1B,EAAUuF,EAAO7D,GACrB8D,EAASxF,EAAQwF,OAEnB,QAASA,GAA4B,kBAAXA,GAAuBA,EAAO1G,eAAe,MACzE,EASa8G,EAAU,SAAUlE,GAC/B,MAAM8D,EAAiBD,EAAO7D,GAAO8D,OACrC,MAAyB,kBAAXA,IAA2C,IAApBA,EAAO,QAC9C;;;;;;;;;;;;;;;;;AChIgB,SAAAK,EAA2BC,EAAQ9G,GACjD,OAAOP,OAAO+F,UAAU1F,eAAeiH,KAAKD,EAAK9G,EACnD,CAEgB,SAAAgH,EACdF,EACA9G,GAEA,OAAIP,OAAO+F,UAAU1F,eAAeiH,KAAKD,EAAK9G,GACrC8G,EAAI9G,QAEX,CAEJ,CAEM,SAAUiH,EAAQH,GACtB,IAAK,MAAM9G,KAAO8G,EAChB,GAAIrH,OAAO+F,UAAU1F,eAAeiH,KAAKD,EAAK9G,GAC5C,OAAO,EAGX,OAAO,CACT,C,SAEgBkH,EACdJ,EACAK,EACAC,GAEA,MAAMC,EAAkC,CAAC,EACzC,IAAK,MAAMrH,KAAO8G,EACZrH,OAAO+F,UAAU1F,eAAeiH,KAAKD,EAAK9G,KAC5CqH,EAAIrH,GAAOmH,EAAGJ,KAAKK,EAAYN,EAAI9G,GAAMA,EAAK8G,IAGlD,OAAOO,CACT,CAKgB,SAAAC,EAAUC,EAAWC,GACnC,GAAID,IAAMC,EACR,OAAO,EAGT,MAAMC,EAAQhI,OAAOiI,KAAKH,GACpBI,EAAQlI,OAAOiI,KAAKF,GAC1B,IAAK,MAAMI,KAAKH,EAAO,CACrB,IAAKE,EAAME,SAASD,GAClB,OAAO,EAGT,MAAME,EAASP,EAA8BK,GACvCG,EAASP,EAA8BI,GAC7C,GAAII,EAASF,IAAUE,EAASD,IAC9B,IAAKT,EAAUQ,EAAOC,GACpB,OAAO,OAEJ,GAAID,IAAUC,EACnB,OAAO,CAEV,CAED,IAAK,MAAMH,KAAKD,EACd,IAAKF,EAAMI,SAASD,GAClB,OAAO,EAGX,OAAO,CACT,CAEA,SAASI,EAASC,GAChB,OAAiB,OAAVA,GAAmC,kBAAVA,CAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrEM,SAAUC,EAAYC,GAG1B,MAAMC,EAAS,GACf,IAAK,MAAOpI,EAAKZ,KAAUK,OAAO4I,QAAQF,GACpClL,MAAMC,QAAQkC,GAChBA,EAAMkJ,SAAQC,IACZH,EAAOrK,KACLyK,mBAAmBxI,GAAO,IAAMwI,mBAAmBD,GACpD,IAGHH,EAAOrK,KAAKyK,mBAAmBxI,GAAO,IAAMwI,mBAAmBpJ,IAGnE,OAAOgJ,EAAO/M,OAAS,IAAM+M,EAAOlM,KAAK,KAAO,EAClD;;;;;;;;;;;;;;;;;MCGauM,EAuCXhK,WAAAA,GAjCQ,KAAMiK,OAAa,GAMnB,KAAIC,KAAa,GAOjB,KAAEC,GAAa,GAMf,KAAIC,KAAa,GAKjB,KAAMC,OAAW,EAKjB,KAAMC,OAAW,EAKvBrM,KAAKsM,UAAY,GAEjBtM,KAAKmM,KAAK,GAAK,IACf,IAAK,IAAIzN,EAAI,EAAGA,EAAIsB,KAAKsM,YAAa5N,EACpCsB,KAAKmM,KAAKzN,GAAK,EAGjBsB,KAAKuM,O,CAGPA,KAAAA,GACEvM,KAAKgM,OAAO,GAAK,WACjBhM,KAAKgM,OAAO,GAAK,WACjBhM,KAAKgM,OAAO,GAAK,WACjBhM,KAAKgM,OAAO,GAAK,UACjBhM,KAAKgM,OAAO,GAAK,WAEjBhM,KAAKoM,OAAS,EACdpM,KAAKqM,OAAS,C,CAShBG,SAAAA,CAAUC,EAAqCC,GACxCA,IACHA,EAAS,GAGX,MAAMC,EAAI3M,KAAKkM,GAGf,GAAmB,kBAARO,EACT,IAAK,IAAI/N,EAAI,EAAGA,EAAI,GAAIA,IAStBiO,EAAEjO,GACC+N,EAAI5N,WAAW6N,IAAW,GAC1BD,EAAI5N,WAAW6N,EAAS,IAAM,GAC9BD,EAAI5N,WAAW6N,EAAS,IAAM,EAC/BD,EAAI5N,WAAW6N,EAAS,GAC1BA,GAAU,OAGZ,IAAK,IAAIhO,EAAI,EAAGA,EAAI,GAAIA,IACtBiO,EAAEjO,GACC+N,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAK,IAAIhO,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,MAAMkO,EAAID,EAAEjO,EAAI,GAAKiO,EAAEjO,EAAI,GAAKiO,EAAEjO,EAAI,IAAMiO,EAAEjO,EAAI,IAClDiO,EAAEjO,GAA+B,YAAxBkO,GAAK,EAAMA,IAAM,GAC3B,CAED,IAKIC,EAAG3B,EALHL,EAAI7K,KAAKgM,OAAO,GAChBlB,EAAI9K,KAAKgM,OAAO,GAChBpN,EAAIoB,KAAKgM,OAAO,GAChBc,EAAI9M,KAAKgM,OAAO,GAChB1J,EAAItC,KAAKgM,OAAO,GAIpB,IAAK,IAAItN,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvBA,EAAI,GACFA,EAAI,IACNmO,EAAIC,EAAKhC,GAAKlM,EAAIkO,GAClB5B,EAAI,aAEJ2B,EAAI/B,EAAIlM,EAAIkO,EACZ5B,EAAI,YAGFxM,EAAI,IACNmO,EAAK/B,EAAIlM,EAAMkO,GAAKhC,EAAIlM,GACxBsM,EAAI,aAEJ2B,EAAI/B,EAAIlM,EAAIkO,EACZ5B,EAAI,YAIR,MAAM0B,GAAO/B,GAAK,EAAMA,IAAM,IAAOgC,EAAIvK,EAAI4I,EAAIyB,EAAEjO,GAAM,WACzD4D,EAAIwK,EACJA,EAAIlO,EACJA,EAA8B,YAAxBkM,GAAK,GAAOA,IAAM,GACxBA,EAAID,EACJA,EAAI+B,CACL,CAED5M,KAAKgM,OAAO,GAAMhM,KAAKgM,OAAO,GAAKnB,EAAK,WACxC7K,KAAKgM,OAAO,GAAMhM,KAAKgM,OAAO,GAAKlB,EAAK,WACxC9K,KAAKgM,OAAO,GAAMhM,KAAKgM,OAAO,GAAKpN,EAAK,WACxCoB,KAAKgM,OAAO,GAAMhM,KAAKgM,OAAO,GAAKc,EAAK,WACxC9M,KAAKgM,OAAO,GAAMhM,KAAKgM,OAAO,GAAK1J,EAAK,U,CAG1CyK,MAAAA,CAAOhO,EAAwCJ,GAE7C,GAAa,MAATI,EACF,YAGa6D,IAAXjE,IACFA,EAASI,EAAMJ,QAGjB,MAAMqO,EAAmBrO,EAASqB,KAAKsM,UACvC,IAAIW,EAAI,EAER,MAAMR,EAAMzM,KAAKiM,KACjB,IAAIiB,EAAQlN,KAAKoM,OAGjB,MAAOa,EAAItO,EAAQ,CAKjB,GAAc,IAAVuO,EACF,MAAOD,GAAKD,EACVhN,KAAKwM,UAAUzN,EAAOkO,GACtBA,GAAKjN,KAAKsM,UAId,GAAqB,kBAAVvN,GACT,MAAOkO,EAAItO,EAIT,GAHA8N,EAAIS,GAASnO,EAAMF,WAAWoO,KAC5BC,IACAD,EACEC,IAAUlN,KAAKsM,UAAW,CAC5BtM,KAAKwM,UAAUC,GACfS,EAAQ,EAER,KACD,OAGH,MAAOD,EAAItO,EAIT,GAHA8N,EAAIS,GAASnO,EAAMkO,KACjBC,IACAD,EACEC,IAAUlN,KAAKsM,UAAW,CAC5BtM,KAAKwM,UAAUC,GACfS,EAAQ,EAER,KACD,CAGN,CAEDlN,KAAKoM,OAASc,EACdlN,KAAKqM,QAAU1N,C,CAIjBwO,MAAAA,GACE,MAAMA,EAAmB,GACzB,IAAIC,EAA0B,EAAdpN,KAAKqM,OAGjBrM,KAAKoM,OAAS,GAChBpM,KAAK+M,OAAO/M,KAAKmM,KAAM,GAAKnM,KAAKoM,QAEjCpM,KAAK+M,OAAO/M,KAAKmM,KAAMnM,KAAKsM,WAAatM,KAAKoM,OAAS,KAIzD,IAAK,IAAI1N,EAAIsB,KAAKsM,UAAY,EAAG5N,GAAK,GAAIA,IACxCsB,KAAKiM,KAAKvN,GAAiB,IAAZ0O,EACfA,GAAa,IAGfpN,KAAKwM,UAAUxM,KAAKiM,MAEpB,IAAIgB,EAAI,EACR,IAAK,IAAIvO,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAI2O,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BF,EAAOF,GAAMjN,KAAKgM,OAAOtN,IAAM2O,EAAK,MAClCJ,EAGN,OAAOE,C,EC7NK,SAAAG,EAAYC,EAAgBC,GAC1C,MAAU,GAAAD,aAAkBC,aAC9B;;;;;;;;;;;;;;;;;AC1BO,MAAMC,EAAoB,SAAUlP,GACzC,MAAMC,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,IAAIE,EAAIL,EAAIM,WAAWH,GAGvB,GAAIE,GAAK,OAAUA,GAAK,MAAQ,CAC9B,MAAM8O,EAAO9O,EAAI,MACjBF,IACAT,EAAOS,EAAIH,EAAII,OAAQ,2CACvB,MAAMgP,EAAMpP,EAAIM,WAAWH,GAAK,MAChCE,EAAI,OAAW8O,GAAQ,IAAMC,CAC9B,CAEG/O,EAAI,IACNJ,EAAIC,KAAOG,EACFA,EAAI,MACbJ,EAAIC,KAAQG,GAAK,EAAK,IACtBJ,EAAIC,KAAY,GAAJG,EAAU,KACbA,EAAI,OACbJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,MAEtBJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,GAAM,GAAM,IAC9BJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,IAEzB,CACD,OAAOJ,CACT,EAOaoP,EAAe,SAAUrP,GACpC,IAAIE,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,MAAME,EAAIL,EAAIM,WAAWH,GACrBE,EAAI,IACNH,IACSG,EAAI,KACbH,GAAK,EACIG,GAAK,OAAUA,GAAK,OAE7BH,GAAK,EACLC,KAEAD,GAAK,CAER,CACD,OAAOA,CACT;;;;;;;;;;;;;;;;;ACrEM,SAAUoP,EACd3E,GAEA,OAAIA,GAAYA,EAA+B4E,UACrC5E,EAA+B4E,UAEhC5E,CAEX,C,miBClBA,IAAI6E,EAoGAC,EAnGJ,MAAMC,EACJlM,WAAAA,CAAYmM,GAAW,GACrBlO,KAAKkO,SAAWA,EAIhBlO,KAAKmO,SAAU,EAIfnO,KAAKoO,QAAU,GAIfpO,KAAKqO,SAAW,GAChBrO,KAAKsO,OAASP,GACTG,GAAYH,IACf/N,KAAKuO,OAASR,EAAkBS,SAAWT,EAAkBS,OAAS,KAAKnN,KACzErB,MACE,EAER,CACA,UAAIyO,GACF,OAAOzO,KAAKmO,OACd,CACAO,GAAAA,CAAIjE,GACF,GAAIzK,KAAKmO,QAAS,CAChB,MAAMQ,EAAqBZ,EAC3B,IAEE,OADAA,EAAoB/N,KACbyK,GACT,CAAE,QACAsD,EAAoBY,CACtB,CACF,MAAW,CAGb,CAKAC,EAAAA,GACEb,EAAoB/N,IACtB,CAKA6O,GAAAA,GACEd,EAAoB/N,KAAKsO,MAC3B,CACAQ,IAAAA,CAAKC,GACH,GAAI/O,KAAKmO,QAAS,CAChB,IAAIzP,EAAGsQ,EACP,IAAKtQ,EAAI,EAAGsQ,EAAIhP,KAAKoO,QAAQzP,OAAQD,EAAIsQ,EAAGtQ,IAC1CsB,KAAKoO,QAAQ1P,GAAGoQ,OAElB,IAAKpQ,EAAI,EAAGsQ,EAAIhP,KAAKqO,SAAS1P,OAAQD,EAAIsQ,EAAGtQ,IAC3CsB,KAAKqO,SAAS3P,KAEhB,GAAIsB,KAAKwO,OACP,IAAK9P,EAAI,EAAGsQ,EAAIhP,KAAKwO,OAAO7P,OAAQD,EAAIsQ,EAAGtQ,IACzCsB,KAAKwO,OAAO9P,GAAGoQ,MAAK,GAGxB,IAAK9O,KAAKkO,UAAYlO,KAAKsO,SAAWS,EAAY,CAChD,MAAME,EAAOjP,KAAKsO,OAAOE,OAAOU,MAC5BD,GAAQA,IAASjP,OACnBA,KAAKsO,OAAOE,OAAOxO,KAAKuO,OAASU,EACjCA,EAAKV,MAAQvO,KAAKuO,MAEtB,CACAvO,KAAKsO,YAAS,EACdtO,KAAKmO,SAAU,CACjB,CACF,EAKF,SAASgB,EAAkBC,EAAQC,EAAQtB,GACrCsB,GAASA,EAAMZ,QACjBY,EAAMjB,QAAQ/M,KAAK+N,EAEvB,CACA,SAASE,IACP,OAAOvB,CACT,CAYA,MAAMwB,EACJxN,WAAAA,CAAY0I,EAAI+E,EAASC,EAAWJ,GAClCrP,KAAKyK,GAAKA,EACVzK,KAAKwP,QAAUA,EACfxP,KAAKyP,UAAYA,EACjBzP,KAAKyO,QAAS,EACdzO,KAAK0P,KAAO,GAIZ1P,KAAK2P,YAAc,EAInB3P,KAAK4P,SAAW,EAIhB5P,KAAK6P,UAAY,EAIjB7P,KAAK8P,iBAAkB,EAIvB9P,KAAK+P,YAAc,EACnBZ,EAAkBnP,KAAMqP,EAC1B,CACA,SAAIW,GACF,GAAyB,IAArBhQ,KAAK2P,YAAmB,CAC1BM,IACA,IAAK,IAAIvR,EAAI,EAAGA,EAAIsB,KAAK+P,YAAarR,IAAK,CACzC,MAAMwR,EAAMlQ,KAAK0P,KAAKhR,GACtB,GAAIwR,EAAIC,WACNC,EAAgBF,EAAIC,UAChBnQ,KAAK2P,aAAe,GACtB,KAGN,CACI3P,KAAK2P,YAAc,IACrB3P,KAAK2P,YAAc,GAErBU,GACF,CACA,OAAOrQ,KAAK2P,aAAe,CAC7B,CACA,SAAIK,CAAMM,GACRtQ,KAAK2P,YAAcW,EAAI,EAAI,CAC7B,CACA5B,GAAAA,GAEE,GADA1O,KAAK2P,YAAc,GACd3P,KAAKyO,OACR,OAAOzO,KAAKyK,KAEd,IAAI8F,EAAkBC,EAClBC,EAAazC,EACjB,IAKE,OAJAwC,GAAc,EACdxC,EAAehO,KACfA,KAAK6P,YACLa,EAAiB1Q,MACVA,KAAKyK,IACd,CAAE,QACAkG,EAAkB3Q,MAClBA,KAAK6P,YACL7B,EAAeyC,EACfD,EAAcD,CAChB,CACF,CACAzB,IAAAA,GACE,IAAInK,EACA3E,KAAKyO,SACPiC,EAAiB1Q,MACjB2Q,EAAkB3Q,MACI,OAArB2E,EAAK3E,KAAK4Q,SAA2BjM,EAAG0F,KAAKrK,MAC9CA,KAAKyO,QAAS,EAElB,EAEF,SAAS2B,EAAgBD,GACvB,OAAOA,EAASzN,KAClB,CACA,SAASgO,EAAiBG,GACxBA,EAAQjB,WACRiB,EAAQd,YAAc,CACxB,CACA,SAASY,EAAkBE,GACzB,GAAIA,EAAQnB,MAAQmB,EAAQnB,KAAK/Q,OAASkS,EAAQd,YAAa,CAC7D,IAAK,IAAIrR,EAAImS,EAAQd,YAAarR,EAAImS,EAAQnB,KAAK/Q,OAAQD,IACzDoS,EAAiBD,EAAQnB,KAAKhR,GAAImS,GAEpCA,EAAQnB,KAAK/Q,OAASkS,EAAQd,WAChC,CACF,CACA,SAASe,EAAiBZ,EAAKW,GAC7B,MAAME,EAAUb,EAAIc,IAAIH,QACR,IAAZE,GAAsBF,EAAQjB,WAAamB,IAC7Cb,EAAIe,OAAOJ,GACM,IAAbX,EAAIgB,MACNhB,EAAIiB,UAGV,CAyBA,IAAIX,GAAc,EACdY,EAAqB,EACzB,MAAMC,EAAa,GACnB,SAASpB,IACPoB,EAAWhQ,KAAKmP,GAChBA,GAAc,CAChB,CAKA,SAASH,IACP,MAAMpB,EAAOoC,EAAWnC,MACxBsB,OAAuB,IAATvB,GAAyBA,CACzC,CACA,SAASqC,IACPF,GACF,CACA,SAASG,IACPH,IACA,OAAQA,GAAsBI,EAAsB7S,OAClD6S,EAAsBC,OAAtBD,EAEJ,CACA,SAASE,EAAYb,EAASX,EAAKyB,GAEjC,GAAIzB,EAAIc,IAAIH,KAAaA,EAAQjB,SAAU,CACzCM,EAAI0B,IAAIf,EAASA,EAAQjB,UACzB,MAAMiC,EAAShB,EAAQnB,KAAKmB,EAAQd,aAChC8B,IAAW3B,GACT2B,GACFf,EAAiBe,EAAQhB,GAE3BA,EAAQnB,KAAKmB,EAAQd,eAAiBG,GAEtCW,EAAQd,aAKZ,CACF,CACA,MAAMyB,EAAwB,GAC9B,SAASM,EAAe5B,EAAK6B,EAAYJ,GAEvCL,IACA,IAAK,MAAMT,KAAWX,EAAIlF,OACxB,GAAI6F,EAAQlB,YAAcoC,GAAc7B,EAAIc,IAAIH,KAAaA,EAAQjB,SAAU,CAC7E,MAAMoC,EAAiBnB,EAAQlB,YAC/BkB,EAAQlB,YAAcoC,EACC,IAAnBC,IACFnB,EAAQf,iBAAkB,EAI1Be,EAAQrB,UAEZ,CAEFyC,EAAgB/B,GAChBqB,GACF,CACA,SAASU,EAAgB/B,GACvB,IAAK,MAAMW,KAAWX,EAAIlF,OACpB6F,EAAQpB,WAAaoB,EAAQf,mBAAqBe,EAAQhB,WAAagB,EAAQqB,eAAiBhC,EAAIc,IAAIH,KAAaA,EAAQjB,WAC/HiB,EAAQf,iBAAkB,EAC1B0B,EAAsBnQ,KAAKwP,EAAQpB,WAGzC,CAEA,MAAM0C,EAAYA,CAAChB,EAAShB,KAC1B,MAAMD,EAAsB,IAAIkC,IAGhC,OAFAlC,EAAIiB,QAAUA,EACdjB,EAAIC,SAAWA,EACRD,CAAG,EAGNmC,EAA4B,IAAIC,QAChCC,EAAcC,OAA+D,IAC7EC,EAAsBD,OAAuE,IACnG,SAASE,EAAM7P,EAAQwD,EAAM/C,GAC3B,GAAIkN,GAAexC,EAAc,CAC/B,IAAI2E,EAAUN,EAAUrB,IAAInO,GACvB8P,GACHN,EAAUT,IAAI/O,EAAQ8P,EAA0B,IAAIP,KAEtD,IAAIlC,EAAMyC,EAAQ3B,IAAI1N,GACjB4M,GACHyC,EAAQf,IAAItO,EAAK4M,EAAMiC,GAAU,IAAMQ,EAAQ1B,OAAO3N,MAExDoO,EACE1D,EACAkC,OAKI,EAER,CACF,CACA,SAASV,EAAQ3M,EAAQwD,EAAM/C,EAAKsP,EAAUC,EAAUC,GACtD,MAAMH,EAAUN,EAAUrB,IAAInO,GAC9B,IAAK8P,EACH,OAEF,IAAIjD,EAAO,GACX,GAAa,UAATrJ,EACFqJ,EAAO,IAAIiD,EAAQI,eACd,GAAY,WAARzP,IAAoB9C,EAAAA,EAAAA,IAAQqC,GAAS,CAC9C,MAAMmQ,EAAYC,OAAOL,GACzBD,EAAQ/G,SAAQ,CAACsE,EAAKgD,MACP,WAATA,KAAsBC,EAAAA,EAAAA,IAASD,IAASA,GAAQF,IAClDtD,EAAKrO,KAAK6O,EACZ,GAEJ,MAIE,YAHY,IAAR5M,GACFoM,EAAKrO,KAAKsR,EAAQ3B,IAAI1N,IAEhB+C,GACN,IAAK,OACE7F,EAAAA,EAAAA,IAAQqC,IAKFuQ,EAAAA,EAAAA,IAAa9P,IACtBoM,EAAKrO,KAAKsR,EAAQ3B,IAAI,YALtBtB,EAAKrO,KAAKsR,EAAQ3B,IAAIuB,KAClBc,EAAAA,EAAAA,IAAMxQ,IACR6M,EAAKrO,KAAKsR,EAAQ3B,IAAIyB,KAK1B,MACF,IAAK,UACEjS,EAAAA,EAAAA,IAAQqC,KACX6M,EAAKrO,KAAKsR,EAAQ3B,IAAIuB,KAClBc,EAAAA,EAAAA,IAAMxQ,IACR6M,EAAKrO,KAAKsR,EAAQ3B,IAAIyB,KAG1B,MACF,IAAK,OACCY,EAAAA,EAAAA,IAAMxQ,IACR6M,EAAKrO,KAAKsR,EAAQ3B,IAAIuB,IAExB,MAGNjB,IACA,IAAK,MAAMpB,KAAOR,EACZQ,GACF4B,EACE5B,EACA,OAQI,GAIVqB,GACF,CAMA,MAAM+B,GAAqCC,EAAAA,EAAAA,IAAS,+BAC9CC,EAAiB,IAAIC,IACT1Q,OAAO2Q,oBAAoBlB,QAAQmB,QAAQrQ,GAAgB,cAARA,GAA+B,WAARA,IAAkBkH,KAAKlH,GAAQkP,OAAOlP,KAAMqQ,OAAOR,EAAAA,KAEzIS,EAAwCC,IAC9C,SAASA,IACP,MAAMC,EAAmB,CAAC,EAyB1B,MAxBA,CAAC,WAAY,UAAW,eAAelI,SAAStI,IAC9CwQ,EAAiBxQ,GAAO,YAAYyQ,GAClC,MAAMC,EAAMC,GAAMjU,MAClB,IAAK,IAAItB,EAAI,EAAGsQ,EAAIhP,KAAKrB,OAAQD,EAAIsQ,EAAGtQ,IACtCgU,EAAMsB,EAAK,MAAOtV,EAAI,IAExB,MAAMiM,EAAMqJ,EAAI1Q,MAAQyQ,GACxB,OAAa,IAATpJ,IAAsB,IAARA,EACTqJ,EAAI1Q,MAAQyQ,EAAKvJ,IAAIyJ,KAErBtJ,CAEX,CAAC,IAEH,CAAC,OAAQ,MAAO,QAAS,UAAW,UAAUiB,SAAStI,IACrDwQ,EAAiBxQ,GAAO,YAAYyQ,GAClC9D,IACAqB,IACA,MAAM3G,EAAMsJ,GAAMjU,MAAMsD,GAAK4Q,MAAMlU,KAAM+T,GAGzC,OAFAxC,IACAlB,IACO1F,CACT,CAAC,IAEImJ,CACT,CACA,SAAS1Q,EAAeE,GACtB,MAAM8G,EAAM6J,GAAMjU,MAElB,OADA0S,EAAMtI,EAAK,MAAO9G,GACX8G,EAAIhH,eAAeE,EAC5B,CACA,MAAM6Q,EACJpS,WAAAA,CAAYqS,GAAc,EAAOC,GAAW,GAC1CrU,KAAKoU,YAAcA,EACnBpU,KAAKqU,SAAWA,CAClB,CACArD,GAAAA,CAAInO,EAAQS,EAAKgR,GACf,MAAMC,EAAcvU,KAAKoU,YAAaI,EAAUxU,KAAKqU,SACrD,GAAY,mBAAR/Q,EACF,OAAQiR,EACH,GAAY,mBAARjR,EACT,OAAOiR,EACF,GAAY,kBAARjR,EACT,OAAOkR,EACF,GAAY,YAARlR,EACT,OAAIgR,KAAcC,EAAcC,EAAUC,GAAqBC,GAAcF,EAAUG,GAAqBC,IAAa5D,IAAInO,IAE7HE,OAAO8R,eAAehS,KAAYE,OAAO8R,eAAeP,GAC/CzR,OAET,EAEF,MAAMiS,GAAgBtU,EAAAA,EAAAA,IAAQqC,GAC9B,IAAK0R,EAAa,CAChB,GAAIO,IAAiBC,EAAAA,EAAAA,IAAOnB,EAAuBtQ,GACjD,OAAO0R,QAAQhE,IAAI4C,EAAuBtQ,EAAKgR,GAEjD,GAAY,mBAARhR,EACF,OAAOF,CAEX,CACA,MAAMuH,EAAMqK,QAAQhE,IAAInO,EAAQS,EAAKgR,GACrC,QAAInB,EAAAA,EAAAA,IAAS7P,GAAOkQ,EAAeyB,IAAI3R,GAAOgQ,EAAmBhQ,IACxDqH,GAEJ4J,GACH7B,EAAM7P,EAAQ,MAAOS,GAEnBkR,EACK7J,EAELuK,GAAMvK,GACDmK,IAAiB1B,EAAAA,EAAAA,IAAa9P,GAAOqH,EAAMA,EAAIjI,OAEpD4I,EAAAA,EAAAA,IAASX,GACJ4J,EAAcY,GAASxK,GAAOyK,GAASzK,GAEzCA,EACT,EAEF,MAAM0K,UAA+BlB,EACnCpS,WAAAA,CAAYyS,GAAU,GACpB5L,OAAM,EAAO4L,EACf,CACA5C,GAAAA,CAAI/O,EAAQS,EAAKZ,EAAO4R,GACtB,IAAIzB,EAAWhQ,EAAOS,GACtB,IAAKtD,KAAKqU,SAAU,CAClB,MAAMiB,EAAqBC,GAAW1C,GAKtC,GAJK2C,GAAU9S,IAAW6S,GAAW7S,KACnCmQ,EAAWoB,GAAMpB,GACjBnQ,EAAQuR,GAAMvR,MAEXlC,EAAAA,EAAAA,IAAQqC,IAAWqS,GAAMrC,KAAcqC,GAAMxS,GAChD,OAAI4S,IAGFzC,EAASnQ,MAAQA,GACV,EAGb,CACA,MAAM+S,GAASjV,EAAAA,EAAAA,IAAQqC,KAAWuQ,EAAAA,EAAAA,IAAa9P,GAAO2P,OAAO3P,GAAOT,EAAOlE,QAASoW,EAAAA,EAAAA,IAAOlS,EAAQS,GAC7F6E,EAAS6M,QAAQpD,IAAI/O,EAAQS,EAAKZ,EAAO4R,GAQ/C,OAPIzR,IAAWoR,GAAMK,KACdmB,GAEMC,EAAAA,EAAAA,IAAWhT,EAAOmQ,IAC3BrD,EAAQ3M,EAAQ,MAAOS,EAAKZ,EAAOmQ,GAFnCrD,EAAQ3M,EAAQ,MAAOS,EAAKZ,IAKzByF,CACT,CACAwN,cAAAA,CAAe9S,EAAQS,GACrB,MAAMmS,GAASV,EAAAA,EAAAA,IAAOlS,EAAQS,GACxBuP,EAAWhQ,EAAOS,GAClB6E,EAAS6M,QAAQW,eAAe9S,EAAQS,GAI9C,OAHI6E,GAAUsN,GACZjG,EAAQ3M,EAAQ,SAAUS,OAAK,EAAQuP,GAElC1K,CACT,CACA8M,GAAAA,CAAIpS,EAAQS,GACV,MAAM6E,EAAS6M,QAAQC,IAAIpS,EAAQS,GAInC,OAHK6P,EAAAA,EAAAA,IAAS7P,IAASkQ,EAAeyB,IAAI3R,IACxCoP,EAAM7P,EAAQ,MAAOS,GAEhB6E,CACT,CACAyN,OAAAA,CAAQ/S,GAMN,OALA6P,EACE7P,EACA,WACArC,EAAAA,EAAAA,IAAQqC,GAAU,SAAW0P,GAExByC,QAAQY,QAAQ/S,EACzB,EAEF,MAAMgT,UAAgC1B,EACpCpS,WAAAA,CAAYyS,GAAU,GACpB5L,OAAM,EAAM4L,EACd,CACA5C,GAAAA,CAAI/O,EAAQS,GAOV,OAAO,CACT,CACAqS,cAAAA,CAAe9S,EAAQS,GAOrB,OAAO,CACT,EAEF,MAAMwS,EAAkC,IAAIT,EACtCU,EAAmC,IAAIF,EACvCG,EAA0C,IAAIX,GAClD,GAIIY,EAAavT,GAAUA,EACvBwT,EAAY5F,GAAM0E,QAAQH,eAAevE,GAC/C,SAASU,EAAInO,EAAQS,EAAKiS,GAAa,EAAOC,GAAY,GACxD3S,EAASA,EAAO,WAChB,MAAMsT,EAAYlC,GAAMpR,GAClBuT,EAASnC,GAAM3Q,GAChBiS,KACCG,EAAAA,EAAAA,IAAWpS,EAAK8S,IAClB1D,EAAMyD,EAAW,MAAO7S,GAE1BoP,EAAMyD,EAAW,MAAOC,IAE1B,MAAQnB,IAAKoB,GAASH,EAASC,GACzBG,EAAOd,EAAYS,EAAYV,EAAagB,GAAaC,GAC/D,OAAIH,EAAKhM,KAAK8L,EAAW7S,GAChBgT,EAAKzT,EAAOmO,IAAI1N,IACd+S,EAAKhM,KAAK8L,EAAWC,GACvBE,EAAKzT,EAAOmO,IAAIoF,SACdvT,IAAWsT,GACpBtT,EAAOmO,IAAI1N,GAEf,CACA,SAAS2R,EAAI3R,EAAKiS,GAAa,GAC7B,MAAM1S,EAAS7C,KAAK,WACdmW,EAAYlC,GAAMpR,GAClBuT,EAASnC,GAAM3Q,GAOrB,OANKiS,KACCG,EAAAA,EAAAA,IAAWpS,EAAK8S,IAClB1D,EAAMyD,EAAW,MAAO7S,GAE1BoP,EAAMyD,EAAW,MAAOC,IAEnB9S,IAAQ8S,EAASvT,EAAOoS,IAAI3R,GAAOT,EAAOoS,IAAI3R,IAAQT,EAAOoS,IAAImB,EAC1E,CACA,SAASlF,EAAKrO,EAAQ0S,GAAa,GAGjC,OAFA1S,EAASA,EAAO,YACf0S,GAAc7C,EAAMuB,GAAMpR,GAAS,UAAW0P,GACxCyC,QAAQhE,IAAInO,EAAQ,OAAQA,EACrC,CACA,SAAS4T,EAAI/T,GACXA,EAAQuR,GAAMvR,GACd,MAAMG,EAASoR,GAAMjU,MACf0W,EAAQR,EAASrT,GACjB4S,EAASiB,EAAMzB,IAAI5K,KAAKxH,EAAQH,GAKtC,OAJK+S,IACH5S,EAAO4T,IAAI/T,GACX8M,EAAQ3M,EAAQ,MAAOH,EAAOA,IAEzB1C,IACT,CACA,SAAS4R,EAAItO,EAAKZ,GAChBA,EAAQuR,GAAMvR,GACd,MAAMG,EAASoR,GAAMjU,OACbiV,IAAKoB,EAAMrF,IAAK2F,GAAST,EAASrT,GAC1C,IAAI4S,EAASY,EAAKhM,KAAKxH,EAAQS,GAC1BmS,IACHnS,EAAM2Q,GAAM3Q,GACZmS,EAASY,EAAKhM,KAAKxH,EAAQS,IAI7B,MAAMuP,EAAW8D,EAAKtM,KAAKxH,EAAQS,GAOnC,OANAT,EAAO+O,IAAItO,EAAKZ,GACX+S,GAEMC,EAAAA,EAAAA,IAAWhT,EAAOmQ,IAC3BrD,EAAQ3M,EAAQ,MAAOS,EAAKZ,EAAOmQ,GAFnCrD,EAAQ3M,EAAQ,MAAOS,EAAKZ,GAIvB1C,IACT,CACA,SAAS4W,EAAYtT,GACnB,MAAMT,EAASoR,GAAMjU,OACbiV,IAAKoB,EAAMrF,IAAK2F,GAAST,EAASrT,GAC1C,IAAI4S,EAASY,EAAKhM,KAAKxH,EAAQS,GAC1BmS,IACHnS,EAAM2Q,GAAM3Q,GACZmS,EAASY,EAAKhM,KAAKxH,EAAQS,IAI7B,MAAMuP,EAAW8D,EAAOA,EAAKtM,KAAKxH,EAAQS,QAAO,EAC3C6E,EAAStF,EAAOoO,OAAO3N,GAI7B,OAHImS,GACFjG,EAAQ3M,EAAQ,SAAUS,OAAK,EAAQuP,GAElC1K,CACT,CACA,SAAS0O,IACP,MAAMhU,EAASoR,GAAMjU,MACf8W,EAA2B,IAAhBjU,EAAOqO,KAClB4B,OAA4G,EAC5G3K,EAAStF,EAAOgU,QAItB,OAHIC,GACFtH,EAAQ3M,EAAQ,aAAS,OAAQ,EAAQiQ,GAEpC3K,CACT,CACA,SAAS4O,EAAcxB,EAAYC,GACjC,OAAO,SAAiB3P,EAAUmR,GAChC,MAAMC,EAAWjX,KACX6C,EAASoU,EAAS,WAClBd,EAAYlC,GAAMpR,GAClByT,EAAOd,EAAYS,EAAYV,EAAagB,GAAaC,GAE/D,OADCjB,GAAc7C,EAAMyD,EAAW,UAAW5D,GACpC1P,EAAO+I,SAAQ,CAAClJ,EAAOY,IACrBuC,EAASwE,KAAK2M,EAASV,EAAK5T,GAAQ4T,EAAKhT,GAAM2T,IAE1D,CACF,CACA,SAASC,EAAqBC,EAAQ5B,EAAYC,GAChD,OAAO,YAAYzB,GACjB,MAAMlR,EAAS7C,KAAK,WACdmW,EAAYlC,GAAMpR,GAClBuU,GAAc/D,EAAAA,EAAAA,IAAM8C,GACpBkB,EAAoB,YAAXF,GAAwBA,IAAW3E,OAAO8E,UAAYF,EAC/DG,EAAuB,SAAXJ,GAAqBC,EACjCI,EAAgB3U,EAAOsU,MAAWpD,GAClCuC,EAAOd,EAAYS,EAAYV,EAAagB,GAAaC,GAM/D,OALCjB,GAAc7C,EACbyD,EACA,UACAoB,EAAY9E,EAAsBF,GAE7B,CAELkF,IAAAA,GACE,MAAM,MAAE/U,EAAK,KAAEgV,GAASF,EAAcC,OACtC,OAAOC,EAAO,CAAEhV,QAAOgV,QAAS,CAC9BhV,MAAO2U,EAAS,CAACf,EAAK5T,EAAM,IAAK4T,EAAK5T,EAAM,KAAO4T,EAAK5T,GACxDgV,OAEJ,EAEA,CAAClF,OAAO8E,YACN,OAAOtX,IACT,EAEJ,CACF,CACA,SAAS2X,EAAqBtR,GAC5B,OAAO,YAAY0N,GAQjB,MAAgB,WAAT1N,IAAqC,UAATA,OAAmB,EAASrG,KACjE,CACF,CACA,SAAS4X,KACP,MAAMC,EAA2B,CAC/B7G,GAAAA,CAAI1N,GACF,OAAO0N,EAAIhR,KAAMsD,EACnB,EACA,QAAI4N,GACF,OAAOA,EAAKlR,KACd,EACAiV,MACAwB,MACA7E,MACAX,OAAQ2F,EACRC,QACAjL,QAASmL,GAAc,GAAO,IAE1Be,EAA2B,CAC/B9G,GAAAA,CAAI1N,GACF,OAAO0N,EAAIhR,KAAMsD,GAAK,GAAO,EAC/B,EACA,QAAI4N,GACF,OAAOA,EAAKlR,KACd,EACAiV,MACAwB,MACA7E,MACAX,OAAQ2F,EACRC,QACAjL,QAASmL,GAAc,GAAO,IAE1BgB,EAA4B,CAChC/G,GAAAA,CAAI1N,GACF,OAAO0N,EAAIhR,KAAMsD,GAAK,EACxB,EACA,QAAI4N,GACF,OAAOA,EAAKlR,MAAM,EACpB,EACAiV,GAAAA,CAAI3R,GACF,OAAO2R,EAAI5K,KAAKrK,KAAMsD,GAAK,EAC7B,EACAmT,IAAKkB,EAAqB,OAC1B/F,IAAK+F,EAAqB,OAC1B1G,OAAQ0G,EAAqB,UAC7Bd,MAAOc,EAAqB,SAC5B/L,QAASmL,GAAc,GAAM,IAEzBiB,EAAmC,CACvChH,GAAAA,CAAI1N,GACF,OAAO0N,EAAIhR,KAAMsD,GAAK,GAAM,EAC9B,EACA,QAAI4N,GACF,OAAOA,EAAKlR,MAAM,EACpB,EACAiV,GAAAA,CAAI3R,GACF,OAAO2R,EAAI5K,KAAKrK,KAAMsD,GAAK,EAC7B,EACAmT,IAAKkB,EAAqB,OAC1B/F,IAAK+F,EAAqB,OAC1B1G,OAAQ0G,EAAqB,UAC7Bd,MAAOc,EAAqB,SAC5B/L,QAASmL,GAAc,GAAM,IAEzBkB,EAAkB,CAAC,OAAQ,SAAU,UAAWzF,OAAO8E,UAuB7D,OAtBAW,EAAgBrM,SAASuL,IACvBU,EAAyBV,GAAUD,EACjCC,GACA,GACA,GAEFY,EAA0BZ,GAAUD,EAClCC,GACA,GACA,GAEFW,EAAyBX,GAAUD,EACjCC,GACA,GACA,GAEFa,EAAiCb,GAAUD,EACzCC,GACA,GACA,EACD,IAEI,CACLU,EACAE,EACAD,EACAE,EAEJ,CACA,MACEE,GACAC,GACAC,GACAC,IACkBT,KACpB,SAASU,GAA4B/C,EAAYf,GAC/C,MAAMV,EAAmBU,EAAUe,EAAa8C,GAAkCD,GAA0B7C,EAAa4C,GAA2BD,GACpJ,MAAO,CAACrV,EAAQS,EAAKgR,IACP,mBAARhR,GACMiS,EACS,mBAARjS,EACFiS,EACU,YAARjS,EACFT,EAEFmS,QAAQhE,KACb+D,EAAAA,EAAAA,IAAOjB,EAAkBxQ,IAAQA,KAAOT,EAASiR,EAAmBjR,EACpES,EACAgR,EAGN,CACA,MAAMiE,GAA4B,CAChCvH,IAAqBsH,IAA4B,GAAO,IAEpDE,GAA4B,CAChCxH,IAAqBsH,IAA4B,GAAO,IAEpDG,GAA6B,CACjCzH,IAAqBsH,IAA4B,GAAM,IAezD,MAAM1D,GAA8B,IAAItC,QAClCqC,GAAqC,IAAIrC,QACzCoC,GAA8B,IAAIpC,QAClCmC,GAAqC,IAAInC,QAC/C,SAASoG,GAAcC,GACrB,OAAQA,GACN,IAAK,SACL,IAAK,QACH,OAAO,EACT,IAAK,MACL,IAAK,MACL,IAAK,UACL,IAAK,UACH,OAAO,EACT,QACE,OAAO,EAEb,CACA,SAASC,GAAclW,GACrB,OAAOA,EAAM,cAAgBK,OAAO8V,aAAanW,GAAS,EAAkBgW,IAAcI,EAAAA,EAAAA,IAAUpW,GACtG,CACA,SAAS0S,GAASvS,GAChB,OAAI0S,GAAW1S,GACNA,EAEFkW,GACLlW,GACA,EACAiT,EACAyC,GACA3D,GAEJ,CACA,SAASoE,GAAgBnW,GACvB,OAAOkW,GACLlW,GACA,EACAmT,EACAwC,GACA7D,GAEJ,CACA,SAASQ,GAAStS,GAChB,OAAOkW,GACLlW,GACA,EACAkT,EACA0C,GACA/D,GAEJ,CAUA,SAASqE,GAAqBlW,EAAQ0R,EAAa0E,EAAcC,EAAoBC,GACnF,KAAK7N,EAAAA,EAAAA,IAASzI,GAIZ,OAAOA,EAET,GAAIA,EAAO,cAAgB0R,IAAe1R,EAAO,mBAC/C,OAAOA,EAET,MAAMuW,EAAgBD,EAASnI,IAAInO,GACnC,GAAIuW,EACF,OAAOA,EAET,MAAMC,EAAaT,GAAc/V,GACjC,GAAmB,IAAfwW,EACF,OAAOxW,EAET,MAAMyW,EAAQ,IAAIC,MAChB1W,EACe,IAAfwW,EAAoCH,EAAqBD,GAG3D,OADAE,EAASvH,IAAI/O,EAAQyW,GACdA,CACT,CACA,SAASE,GAAW9W,GAClB,OAAI6S,GAAW7S,GACN8W,GAAW9W,EAAM,eAEhBA,IAASA,EAAM,kBAC3B,CACA,SAAS6S,GAAW7S,GAClB,SAAUA,IAASA,EAAM,kBAC3B,CACA,SAAS8S,GAAU9S,GACjB,SAAUA,IAASA,EAAM,iBAC3B,CACA,SAAS+W,GAAQ/W,GACf,OAAO8W,GAAW9W,IAAU6S,GAAW7S,EACzC,CACA,SAASuR,GAAMgD,GACb,MAAMyC,EAAMzC,GAAYA,EAAS,WACjC,OAAOyC,EAAMzF,GAAMyF,GAAOzC,CAC5B,CACA,SAAS0C,GAAQjX,GAEf,OADAkX,EAAAA,EAAAA,IAAIlX,EAAO,YAAY,GAChBA,CACT,CACA,MAAM8T,GAAc9T,IAAU4I,EAAAA,EAAAA,IAAS5I,GAAS0S,GAAS1S,GAASA,EAC5D6T,GAAc7T,IAAU4I,EAAAA,EAAAA,IAAS5I,GAASyS,GAASzS,GAASA,EAElE,MAAMmX,GACJ9X,WAAAA,CAAY+X,EAAQC,EAASxE,EAAYyE,GACvCha,KAAK+Z,QAAUA,EACf/Z,KAAKkQ,SAAM,EACXlQ,KAAKia,WAAY,EACjBja,KAAK,mBAAoB,EACzBA,KAAKoP,OAAS,IAAIG,GAChB,IAAMuK,EAAO9Z,KAAKka,UAClB,IAAMC,GAAgBna,KAAM,KAC5B,IAAMA,KAAKkQ,KAAO+B,EAAgBjS,KAAKkQ,OAEzClQ,KAAKoP,OAAOe,SAAWnQ,KACvBA,KAAKoP,OAAOX,OAASzO,KAAKoa,YAAcJ,EACxCha,KAAK,kBAAoBuV,CAC3B,CACA,SAAI7S,GACF,MAAMc,EAAOyQ,GAAMjU,MAUnB,OATKwD,EAAK4W,aAAc5W,EAAK4L,OAAOY,QAC9B0F,EAAAA,EAAAA,IAAWlS,EAAK0W,OAAQ1W,EAAK0W,OAAS1W,EAAK4L,OAAOV,QACpDyL,GAAgB3W,EAAM,GAG1B6W,GAAc7W,GACVA,EAAK4L,OAAOO,aAAe,GAC7BwK,GAAgB3W,EAAM,GAEjBA,EAAK0W,MACd,CACA,SAAIxX,CAAMkQ,GACR5S,KAAK+Z,QAAQnH,EACf,CAEA,UAAI0H,GACF,OAAOta,KAAKoP,OAAOY,KACrB,CACA,UAAIsK,CAAOhK,GACTtQ,KAAKoP,OAAOY,MAAQM,CACtB,EAGF,SAASH,GAASoK,EAAiBC,EAAcR,GAAQ,GACvD,IAAIF,EACAW,EACJ,MAAMC,GAAaC,EAAAA,EAAAA,IAAWJ,GAC1BG,GACFZ,EAASS,EACTE,EAEIG,EAAAA,KAEJd,EAASS,EAAgBvJ,IACzByJ,EAASF,EAAgB3I,KAE3B,MAAMiJ,EAAO,IAAIhB,GAAgBC,EAAQW,EAAQC,IAAeD,EAAQT,GAKxE,OAAOa,CACT,CAEA,SAASR,GAAcS,GACjBtK,GAAexC,IACjB8M,EAAO7G,GAAM6G,GACbpJ,EACE1D,EACA8M,EAAK5K,MAAQ4K,EAAK5K,IAAMiC,GACtB,IAAM2I,EAAK5K,SAAM,GACjB4K,aAAgBjB,GAAkBiB,OAAO,SAMvC,GAGV,CACA,SAASX,GAAgBW,EAAM/I,EAAa,EAAGgJ,GAC7CD,EAAO7G,GAAM6G,GACb,MAAM5K,EAAM4K,EAAK5K,IACbA,GACF4B,EACE5B,EACA6B,OAMI,EAGV,CACA,SAASmD,GAAM8F,GACb,SAAUA,IAAqB,IAAhBA,EAAEf,UACnB,CACA,SAASgB,GAAIvY,GACX,OAAOwY,GAAUxY,GAAO,EAC1B,CACA,SAASyY,GAAWzY,GAClB,OAAOwY,GAAUxY,GAAO,EAC1B,CACA,SAASwY,GAAUE,EAAU5G,GAC3B,OAAIU,GAAMkG,GACDA,EAEF,IAAIC,GAAQD,EAAU5G,EAC/B,CACA,MAAM6G,GACJtZ,WAAAA,CAAYW,EAAO4Y,GACjBtb,KAAKsb,cAAgBA,EACrBtb,KAAKkQ,SAAM,EACXlQ,KAAKia,WAAY,EACjBja,KAAKub,UAAYD,EAAgB5Y,EAAQuR,GAAMvR,GAC/C1C,KAAKka,OAASoB,EAAgB5Y,EAAQ8T,GAAW9T,EACnD,CACA,SAAIA,GAEF,OADA2X,GAAcra,MACPA,KAAKka,MACd,CACA,SAAIxX,CAAMqY,GACR,MAAMS,EAAiBxb,KAAKsb,eAAiB9F,GAAUuF,IAAWxF,GAAWwF,GAC7EA,EAASS,EAAiBT,EAAS9G,GAAM8G,IACrCrF,EAAAA,EAAAA,IAAWqF,EAAQ/a,KAAKub,aAC1Bvb,KAAKub,UAAYR,EACjB/a,KAAKka,OAASsB,EAAiBT,EAASvE,GAAWuE,GACnDZ,GAAgBna,KAAM,EAAG+a,GAE7B,EAKF,SAASU,GAAMX,GACb,OAAO5F,GAAM4F,GAAQA,EAAKpY,MAAQoY,CACpC,CAIA,MAAMY,GAAwB,CAC5B1K,IAAKA,CAACnO,EAAQS,EAAKgR,IAAamH,GAAMzG,QAAQhE,IAAInO,EAAQS,EAAKgR,IAC/D1C,IAAKA,CAAC/O,EAAQS,EAAKZ,EAAO4R,KACxB,MAAMzB,EAAWhQ,EAAOS,GACxB,OAAI4R,GAAMrC,KAAcqC,GAAMxS,IAC5BmQ,EAASnQ,MAAQA,GACV,GAEAsS,QAAQpD,IAAI/O,EAAQS,EAAKZ,EAAO4R,EACzC,GAGJ,SAASqH,GAAUC,GACjB,OAAOpC,GAAWoC,GAAkBA,EAAiB,IAAIrC,MAAMqC,EAAgBF,GACjF,C,8wBCr7BA,SAASG,EAAsBpR,EAAIqR,EAAUzV,EAAM0N,GACjD,IAAIpJ,EACJ,IACEA,EAAMoJ,EAAOtJ,KAAMsJ,GAAQtJ,GAC7B,CAAE,MAAOsR,GACPC,EAAYD,EAAKD,EAAUzV,EAC7B,CACA,OAAOsE,CACT,CACA,SAASsR,EAA2BxR,EAAIqR,EAAUzV,EAAM0N,GACtD,IAAI4G,EAAAA,EAAAA,IAAWlQ,GAAK,CAClB,MAAME,EAAMkR,EAAsBpR,EAAIqR,EAAUzV,EAAM0N,GAMtD,OALIpJ,IAAOuR,EAAAA,EAAAA,IAAUvR,IACnBA,EAAI7E,OAAOiW,IACTC,EAAYD,EAAKD,EAAUzV,EAAK,IAG7BsE,CACT,CACA,MAAMoI,EAAS,GACf,IAAK,IAAIrU,EAAI,EAAGA,EAAI+L,EAAG9L,OAAQD,IAC7BqU,EAAO1R,KAAK4a,EAA2BxR,EAAG/L,GAAIod,EAAUzV,EAAM0N,IAEhE,OAAOhB,CACT,CACA,SAASiJ,EAAYD,EAAKD,EAAUzV,EAAM8V,GAAa,GACrD,MAAMC,EAAeN,EAAWA,EAASO,MAAQ,KACjD,GAAIP,EAAU,CACZ,IAAIQ,EAAMR,EAASxN,OACnB,MAAMiO,EAAkBT,EAASxC,MAC3BkD,EAAoF,8CAA6CnW,IACvI,MAAOiW,EAAK,CACV,MAAMG,EAAqBH,EAAII,GAC/B,GAAID,EACF,IAAK,IAAI/d,EAAI,EAAGA,EAAI+d,EAAmB9d,OAAQD,IAC7C,IAA+D,IAA3D+d,EAAmB/d,GAAGqd,EAAKQ,EAAiBC,GAC9C,OAINF,EAAMA,EAAIhO,MACZ,CACA,MAAMqO,EAAkBb,EAASc,WAAWtX,OAAOuX,aACnD,GAAIF,EAOF,YANAd,EACEc,EACA,KACA,GACA,CAACZ,EAAKQ,EAAiBC,GAI7B,CACAM,EAASf,EAAK1V,EAAM+V,EAAcD,EACpC,CACA,SAASW,EAASf,EAAK1V,EAAM+V,EAAcD,GAAa,GAgBpD5Z,QAAQC,MAAMuZ,EAElB,CAEA,IAAIgB,GAAa,EACbC,GAAiB,EACrB,MAAMC,EAAQ,GACd,IAAIC,EAAa,EACjB,MAAMC,EAAsB,GAC5B,IAAIC,EAAqB,KACrBC,EAAiB,EACrB,MAAMC,EAAkC3X,QAAQF,UAChD,IAAI8X,EAAsB,KAE1B,SAASC,EAAS/S,GAChB,MAAMhM,EAAI8e,GAAuBD,EACjC,OAAO7S,EAAKhM,EAAEgf,KAAKzd,KAAOyK,EAAGiT,KAAK1d,MAAQyK,GAAMhM,CAClD,CACA,SAASkf,EAAmBC,GAC1B,IAAIC,EAAQX,EAAa,EACrBY,EAAMb,EAAMte,OAChB,MAAOkf,EAAQC,EAAK,CAClB,MAAMC,EAASF,EAAQC,IAAQ,EACzBE,EAAYf,EAAMc,GAClBE,EAAcC,EAAMF,GACtBC,EAAcL,GAAMK,IAAgBL,GAAMI,EAAUG,IACtDN,EAAQE,EAAS,EAEjBD,EAAMC,CAEV,CACA,OAAOF,CACT,CACA,SAASO,EAASC,GACXpB,EAAMte,QAAWse,EAAM9R,SAC1BkT,EACAtB,GAAcsB,EAAInM,aAAegL,EAAa,EAAIA,KAEpC,MAAVmB,EAAIT,GACNX,EAAM5b,KAAKgd,GAEXpB,EAAMqB,OAAOX,EAAmBU,EAAIT,IAAK,EAAGS,GAE9CE,IAEJ,CACA,SAASA,IACFxB,GAAeC,IAClBA,GAAiB,EACjBO,EAAsBD,EAAgBG,KAAKe,GAE/C,CACA,SAASC,EAAcJ,GACrB,MAAM3f,EAAIue,EAAMyB,QAAQL,GACpB3f,EAAIwe,GACND,EAAMqB,OAAO5f,EAAG,EAEpB,CACA,SAASigB,EAAiBC,IACnBpe,EAAAA,EAAAA,IAAQoe,GAQXzB,EAAoB9b,QAAQud,GAPvBxB,GAAuBA,EAAmBjS,SAC7CyT,EACAA,EAAG1M,aAAemL,EAAiB,EAAIA,IAEvCF,EAAoB9b,KAAKud,GAK7BL,GACF,CACA,SAASM,EAAiB/C,EAAUgD,EAAMpgB,GAAIqe,EAAaG,EAAa,EAAI,IAI1E,IAHI,EAGGxe,EAAIue,EAAMte,OAAQD,IAAK,CAC5B,MAAMkgB,EAAK3B,EAAMve,GACjB,GAAIkgB,GAAMA,EAAGT,IAAK,CAChB,GAAIrC,GAAY8C,EAAGhB,KAAO9B,EAAS5V,IACjC,SAEE,EAGJ+W,EAAMqB,OAAO5f,EAAG,GAChBA,IACAkgB,GACF,CACF,CACF,CACA,SAASG,EAAkBD,GACzB,GAAI3B,EAAoBxe,OAAQ,CAC9B,MAAMqgB,EAAU,IAAI,IAAIvL,IAAI0J,IAAsB8B,MAChD,CAACpU,EAAGC,IAAMoT,EAAMrT,GAAKqT,EAAMpT,KAG7B,GADAqS,EAAoBxe,OAAS,EACzBye,EAEF,YADAA,EAAmB/b,QAAQ2d,GAO7B,IAJA5B,EAAqB4B,EAIhB3B,EAAiB,EAAGA,EAAiBD,EAAmBze,OAAQ0e,IAInED,EAAmBC,KAErBD,EAAqB,KACrBC,EAAiB,CACnB,CACF,CACA,MAAMa,EAASG,GAAkB,MAAVA,EAAIT,GAAasB,IAAWb,EAAIT,GACjDuB,EAAaA,CAACtU,EAAGC,KACrB,MAAMsU,EAAOlB,EAAMrT,GAAKqT,EAAMpT,GAC9B,GAAa,IAATsU,EAAY,CACd,GAAIvU,EAAEsT,MAAQrT,EAAEqT,IACd,OAAQ,EACV,GAAIrT,EAAEqT,MAAQtT,EAAEsT,IACd,OAAO,CACX,CACA,OAAOiB,CAAI,EAEb,SAASZ,EAAUM,GACjB9B,GAAiB,EACjBD,GAAa,EAIbE,EAAMgC,KAAKE,GAC2FvE,EAAAA,GACtG,IACE,IAAKsC,EAAa,EAAGA,EAAaD,EAAMte,OAAQue,IAAc,CAC5D,MAAMmB,EAAMpB,EAAMC,GACdmB,IAAsB,IAAfA,EAAI5P,QAIboN,EAAsBwC,EAAK,KAAM,GAErC,CACF,CAAE,QACAnB,EAAa,EACbD,EAAMte,OAAS,EACfogB,EAAkBD,GAClB/B,GAAa,EACbQ,EAAsB,MAClBN,EAAMte,QAAUwe,EAAoBxe,SACtC6f,EAAUM,EAEd,CACF,CA2OA,SAASO,EAAKvD,EAAUwD,KAAUC,GAChC,GAAIzD,EAAS0D,YACX,OACF,MAAMC,EAAQ3D,EAASO,MAAMoD,OAASC,EAAAA,GA0BtC,IAAI3L,EAAOwL,EACX,MAAMI,EAAkBL,EAAMM,WAAW,WACnCC,EAAWF,GAAmBL,EAAMQ,MAAM,GAChD,GAAID,GAAYA,KAAYJ,EAAO,CACjC,MAAMM,EAAgB,GAAe,eAAbF,EAA4B,QAAUA,cACxD,OAAEG,EAAM,KAAEC,GAASR,EAAMM,IAAiBL,EAAAA,GAC5CO,IACFlM,EAAOwL,EAAQ/U,KAAKK,IAAMqV,EAAAA,EAAAA,IAASrV,GAAKA,EAAEoV,OAASpV,KAEjDmV,IACFjM,EAAOwL,EAAQ/U,IAAI2V,EAAAA,IAEvB,CAiBA,IAAIC,EACJ,IAAIC,EAAUZ,EAAMW,GAAcE,EAAAA,EAAAA,IAAahB,KAC/CG,EAAMW,GAAcE,EAAAA,EAAAA,KAAaC,EAAAA,EAAAA,IAASjB,MACrCe,GAAWV,IACdU,EAAUZ,EAAMW,GAAcE,EAAAA,EAAAA,KAAaE,EAAAA,EAAAA,IAAUlB,MAEnDe,GACFpE,EACEoE,EACAvE,EACA,EACA/H,GAGJ,MAAM0M,EAAchB,EAAMW,EAAe,QACzC,GAAIK,EAAa,CACf,GAAK3E,EAAS4E,SAEP,GAAI5E,EAAS4E,QAAQN,GAC1B,YAFAtE,EAAS4E,QAAU,CAAC,EAItB5E,EAAS4E,QAAQN,IAAe,EAChCnE,EACEwE,EACA3E,EACA,EACA/H,EAEJ,CACF,CACA,SAAS4M,EAAsBC,EAAMhE,EAAYiE,GAAU,GACzD,MAAMC,EAAQlE,EAAWmE,WACnBC,EAASF,EAAM9P,IAAI4P,GACzB,QAAe,IAAXI,EACF,OAAOA,EAET,MAAMtH,EAAMkH,EAAKK,MACjB,IAAIC,EAAa,CAAC,EACdC,GAAa,EACjB,KAA4BxG,EAAAA,EAAAA,IAAWiG,GAAO,CAC5C,MAAMQ,EAAeC,IACnB,MAAMC,EAAuBX,EAAsBU,EAAMzE,GAAY,GACjE0E,IACFH,GAAa,GACbI,EAAAA,EAAAA,IAAOL,EAAYI,GACrB,GAEGT,GAAWjE,EAAW4E,OAAO7iB,QAChCie,EAAW4E,OAAO5V,QAAQwV,GAExBR,EAAKa,SACPL,EAAYR,EAAKa,SAEfb,EAAKY,QACPZ,EAAKY,OAAO5V,QAAQwV,EAExB,CACA,OAAK1H,GAAQyH,IAMT3gB,EAAAA,EAAAA,IAAQkZ,GACVA,EAAI9N,SAAStI,GAAQ4d,EAAW5d,GAAO,QAEvCie,EAAAA,EAAAA,IAAOL,EAAYxH,IAEjBpO,EAAAA,EAAAA,IAASsV,IACXE,EAAMlP,IAAIgP,EAAMM,GAEXA,KAbD5V,EAAAA,EAAAA,IAASsV,IACXE,EAAMlP,IAAIgP,EAAM,MAEX,KAWX,CACA,SAASc,EAAeC,EAASre,GAC/B,SAAKqe,KAAYC,EAAAA,EAAAA,IAAKte,MAGtBA,EAAMA,EAAIwc,MAAM,GAAG1d,QAAQ,QAAS,KAC7B2S,EAAAA,EAAAA,IAAO4M,EAASre,EAAI,GAAGue,cAAgBve,EAAIwc,MAAM,MAAO/K,EAAAA,EAAAA,IAAO4M,GAASnB,EAAAA,EAAAA,IAAUld,MAASyR,EAAAA,EAAAA,IAAO4M,EAASre,GACpH,CAEA,IAAIwe,EAA2B,KAC3BC,EAAiB,KACrB,SAASC,EAA4BlG,GACnC,MAAMmG,EAAOH,EAGb,OAFAA,EAA2BhG,EAC3BiG,EAAiBjG,GAAYA,EAASzV,KAAK6b,WAAa,KACjDD,CACT,CACA,SAASE,EAAYvE,GACnBmE,EAAiBnE,CACnB,CACA,SAASwE,IACPL,EAAiB,IACnB,CAEA,SAASM,EAAQ5X,EAAI6X,EAAMR,EAA0BS,GACnD,IAAKD,EACH,OAAO7X,EACT,GAAIA,EAAG+X,GACL,OAAO/X,EAET,MAAMgY,EAAsBA,IAAI1O,KAC1B0O,EAAoBC,IACtBC,IAAkB,GAEpB,MAAMC,EAAeZ,EAA4BM,GACjD,IAAI3X,EACJ,IACEA,EAAMF,KAAMsJ,EACd,CAAE,QACAiO,EAA4BY,GACxBH,EAAoBC,IACtBC,GAAiB,EAErB,CAIA,OAAOhY,CAAG,EAKZ,OAHA8X,EAAoBD,IAAK,EACzBC,EAAoBI,IAAK,EACzBJ,EAAoBC,IAAK,EAClBD,CACT,CAMA,SAASK,EAAoBhH,GAC3B,MACEzV,KAAM0c,EAAS,MACf1G,EAAK,MACL/C,EAAK,UACL0J,EAAS,MACTvD,EACAwD,cAAeA,GAAa,MAC5BC,EAAK,MACLC,EAAK,KACL9D,EAAI,OACJ+D,EAAM,YACNC,EAAW,KACXha,EAAI,WACJia,EAAU,IACVhB,EAAG,aACHiB,GACEzH,EACJ,IAAI3T,EACAqb,EACJ,MAAMvB,EAAOD,EAA4BlG,GAIzC,IACE,GAAsB,EAAlBO,EAAMoH,UAAe,CACvB,MAAMC,EAAaV,GAAa1J,EAC1BqK,EASDD,EACLvb,EAASyb,GACPR,EAAO/Y,KACLsZ,EACAD,EACAL,EACA5D,EACA6D,EACAja,EACAiZ,IAGJkB,EAAmBL,CACrB,KAAO,CACL,MAAMU,EAAUd,EACZ,EAGJ5a,EAASyb,GACPC,EAAQllB,OAAS,EAAIklB,EACnBpE,EAQI,CAAE0D,QAAOD,QAAO7D,SAClBwE,EACFpE,EACA,OAIJ+D,EAAmBT,EAAUtD,MAAQ0D,EAAQW,EAAyBX,EACxE,CACF,CAAE,MAAOpH,GACPgI,GAAWplB,OAAS,EACpBqd,EAAYD,EAAKD,EAAU,GAC3B3T,EAAS6b,GAAYC,GACvB,CACA,IAAIC,EAAO/b,EAKX,GAAIqb,IAAqC,IAAjBD,EAAwB,CAC9C,MAAMvY,EAAOjI,OAAOiI,KAAKwY,IACnB,UAAEC,GAAcS,EAClBlZ,EAAKrM,QACS,EAAZ8kB,IACER,GAAgBjY,EAAKmZ,KAAKxE,EAAAA,MAC5B6D,EAAmBY,EACjBZ,EACAP,IAGJiB,EAAOG,GAAWH,EAAMV,GA2B9B,CAwBA,OAvBInH,EAAMiI,OAMRJ,EAAOG,GAAWH,GAClBA,EAAKI,KAAOJ,EAAKI,KAAOJ,EAAKI,KAAKC,OAAOlI,EAAMiI,MAAQjI,EAAMiI,MAE3DjI,EAAMmI,aAMRN,EAAKM,WAAanI,EAAMmI,YAKxBrc,EAAS+b,EAEXlC,EAA4BC,GACrB9Z,CACT,CA6CA,MAAM2b,EAA4BX,IAChC,IAAIxY,EACJ,IAAK,MAAMrH,KAAO6f,GACJ,UAAR7f,GAA2B,UAARA,IAAmBse,EAAAA,EAAAA,IAAKte,OAC5CqH,IAAQA,EAAM,CAAC,IAAIrH,GAAO6f,EAAM7f,IAGrC,OAAOqH,CAAG,EAENyZ,EAAuBA,CAACjB,EAAO1D,KACnC,MAAM9U,EAAM,CAAC,EACb,IAAK,MAAMrH,KAAO6f,GACXxD,EAAAA,EAAAA,IAAgBrc,IAAUA,EAAIwc,MAAM,KAAML,IAC7C9U,EAAIrH,GAAO6f,EAAM7f,IAGrB,OAAOqH,CAAG,EAKZ,SAAS8Z,EAAsBC,EAAWC,EAAWC,GACnD,MAAQnF,MAAOoF,EAAWC,SAAUC,EAAY,UAAEC,GAAcN,GACxDjF,MAAOwF,EAAWH,SAAUI,EAAY,UAAEC,GAAcR,EAC1D1D,EAAQ+D,EAAUI,aAIxB,GAAIT,EAAUL,MAAQK,EAAUH,WAC9B,OAAO,EAET,KAAII,GAAaO,GAAa,GAmB5B,SAAIJ,IAAgBG,GACbA,GAAiBA,EAAaG,UAIjCR,IAAcI,IAGbJ,GAGAI,GAGEK,EAAgBT,EAAWI,EAAWhE,KALlCgE,GA3BX,GAAgB,KAAZE,EACF,OAAO,EAET,GAAgB,GAAZA,EACF,OAAKN,EAGES,EAAgBT,EAAWI,EAAWhE,KAFlCgE,EAGN,GAAgB,EAAZE,EAAe,CACxB,MAAMI,EAAeZ,EAAUY,aAC/B,IAAK,IAAI7mB,EAAI,EAAGA,EAAI6mB,EAAa5mB,OAAQD,IAAK,CAC5C,MAAM4E,EAAMiiB,EAAa7mB,GACzB,GAAIumB,EAAU3hB,KAASuhB,EAAUvhB,KAASoe,EAAeT,EAAO3d,GAC9D,OAAO,CAEX,CACF,CAkBF,OAAO,CACT,CACA,SAASgiB,EAAgBT,EAAWI,EAAWG,GAC7C,MAAMI,EAAWziB,OAAOiI,KAAKia,GAC7B,GAAIO,EAAS7mB,SAAWoE,OAAOiI,KAAK6Z,GAAWlmB,OAC7C,OAAO,EAET,IAAK,IAAID,EAAI,EAAGA,EAAI8mB,EAAS7mB,OAAQD,IAAK,CACxC,MAAM4E,EAAMkiB,EAAS9mB,GACrB,GAAIumB,EAAU3hB,KAASuhB,EAAUvhB,KAASoe,EAAe0D,EAAc9hB,GACrE,OAAO,CAEX,CACA,OAAO,CACT,CACA,SAASmiB,GAAgB,MAAEpJ,EAAK,OAAE/N,GAAUoX,GAC1C,MAAOpX,EAAQ,CACb,MAAM4V,EAAO5V,EAAOqX,QAIpB,GAHIzB,EAAK0B,UAAY1B,EAAK0B,SAASC,eAAiBxJ,IAClD6H,EAAKwB,GAAKrJ,EAAMqJ,IAEdxB,IAAS7H,EAIX,OAHCA,EAAQ/N,EAAO+N,OAAOqJ,GAAKA,EAC5BpX,EAASA,EAAOA,MAIpB,CACF,CAEA,MAAMwX,EAAa,aAEnB,SAASC,EAAiB/jB,EAAMgkB,GAC9B,OAAOC,EAAaH,EAAY9jB,GAAM,EAAMgkB,IAAuBhkB,CACrE,CACA,MAAMkkB,EAAyB1T,OAAO2T,IAAI,SAW1C,SAASF,EAAa5f,EAAMrE,EAAMokB,GAAc,EAAMJ,GAAqB,GACzE,MAAMlK,EAAWgG,GAA4BuE,GAC7C,GAAIvK,EAAU,CACZ,MAAMiH,EAAYjH,EAASzV,KAC3B,GAAIA,IAASyf,EAAY,CACvB,MAAMQ,EAAWC,GACfxD,GACA,GAEF,GAAIuD,IAAaA,IAAatkB,GAAQskB,KAAa/F,EAAAA,EAAAA,IAASve,IAASskB,KAAaE,EAAAA,EAAAA,KAAWjG,EAAAA,EAAAA,IAASve,KACpG,OAAO+gB,CAEX,CACA,MAAMpY,EAGJlF,EAAQqW,EAASzV,IAAS0c,EAAU1c,GAAOrE,IAC3CyD,EAAQqW,EAASc,WAAWvW,GAAOrE,GAErC,OAAK2I,GAAOqb,EACHjD,EAOFpY,CACT,CAKF,CACA,SAASlF,EAAQghB,EAAUzkB,GACzB,OAAOykB,IAAaA,EAASzkB,IAASykB,GAASlG,EAAAA,EAAAA,IAASve,KAAUykB,GAASD,EAAAA,EAAAA,KAAWjG,EAAAA,EAAAA,IAASve,KACjG,CAEA,MAAM0kB,EAAcrgB,GAASA,EAAKsgB,aAkjBlC,SAASC,EAAwBnc,EAAImb,GAC/BA,GAAYA,EAASiB,eACnBrmB,EAAAA,EAAAA,IAAQiK,GACVmb,EAASxX,QAAQ/M,QAAQoJ,GAEzBmb,EAASxX,QAAQ/M,KAAKoJ,GAGxBkU,EAAiBlU,EAErB,CAoBA,MAAMqc,EAAgBtU,OAAO2T,IAAI,SAC3BY,EAAgBA,KACpB,CACE,MAAMzE,EAAM0E,GAAOF,GAMnB,OAAOxE,CACT,GAoBF,MAAM2E,EAAwB,CAAC,EAC/B,SAASC,GAAMpkB,EAAQ8b,EAAI+C,GAMzB,OAAOwF,GAAQrkB,EAAQ8b,EAAI+C,EAC7B,CACA,SAASwF,GAAQrkB,EAAQ8b,GAAI,UAC3BwI,EAAS,KACTC,EAAI,MACJC,EAAK,KACLC,EAAI,QACJC,EAAO,UACPC,GACE/H,EAAAA,IACF,GAAId,GAAM2I,EAAM,CACd,MAAMG,EAAM9I,EACZA,EAAKA,IAAI7K,KACP2T,KAAO3T,GACP4T,GAAS,CAEb,CAuBA,MAOM7L,EAAWuK,GACXuB,EAAkBC,IAAqB,IAATR,EAAgBQ,EAElDC,GAASD,GAAkB,IAATR,EAAiB,OAAI,GAEzC,IAAIvN,EA+CA3I,EA9CA4W,GAAe,EACfC,GAAgB,EAyCpB,IAxCI9S,EAAAA,EAAAA,IAAMpS,IACRgX,EAASA,IAAMhX,EAAOJ,MACtBqlB,GAAeE,EAAAA,EAAAA,IAAYnlB,KAClB0W,EAAAA,EAAAA,IAAW1W,IACpBgX,EAASA,IAAM8N,EAAe9kB,GAC9BilB,GAAe,IACNvnB,EAAAA,EAAAA,IAAQsC,IACjBklB,GAAgB,EAChBD,EAAejlB,EAAOqhB,MAAM+D,IAAM1O,EAAAA,EAAAA,IAAW0O,KAAMD,EAAAA,EAAAA,IAAYC,KAC/DpO,EAASA,IAAMhX,EAAO0H,KAAK0d,IACrBhT,EAAAA,EAAAA,IAAMgT,GACDA,EAAExlB,OACA8W,EAAAA,EAAAA,IAAW0O,GACbN,EAAeM,IACbvN,EAAAA,EAAAA,IAAWuN,GACbrM,EAAsBqM,EAAGpM,EAAU,QADrC,KAQPhC,GAFOa,EAAAA,EAAAA,IAAW7X,GAChB8b,EACO9E,IAAM+B,EAAsB/Y,EAAQgZ,EAAU,GAE9ChC,KACH3I,GACFA,IAEK8K,EACLnZ,EACAgZ,EACA,EACA,CAACqM,KAKEvN,EAAAA,GAGPgE,GAAMyI,EAAM,CACd,MAAMe,EAAatO,EACnBA,EAASA,IAAMgO,GAASM,IAC1B,CAEA,IAMIC,EANAF,EAAa1d,IACf0G,EAAU/B,EAAOwB,OAAS,KACxBiL,EAAsBpR,EAAIqR,EAAU,GACpC3K,EAAU/B,EAAOwB,YAAS,CAAM,CACjC,EAGH,GAAI0X,GAAuB,CAWzB,GAVAH,EAAYvN,EAAAA,GACPgE,EAEMwI,GACTnL,EAA2B2C,EAAI9C,EAAU,EAAG,CAC1ChC,IACAkO,EAAgB,QAAK,EACrBG,IALFrO,IAQY,SAAVwN,EAIF,OAAO1M,EAAAA,GAJa,CACpB,MAAM0H,EAAMyE,IACZsB,EAAa/F,EAAIiG,mBAAqBjG,EAAIiG,iBAAmB,GAC/D,CAGF,CACA,IAAI1V,EAAWmV,EAAgB,IAAIznB,MAAMuC,EAAOnE,QAAQ6pB,KAAKvB,GAAyBA,EACtF,MAAM5I,EAAMA,KACV,GAAKjP,EAAOX,QAAWW,EAAOY,MAG9B,GAAI4O,EAAI,CACN,MAAMhM,EAAWxD,EAAOV,OACpB2Y,GAAQU,IAAiBC,EAAgBpV,EAASuR,MAAK,CAAC7T,EAAG5R,KAAMgX,EAAAA,EAAAA,IAAWpF,EAAGuC,EAASnU,OAAOgX,EAAAA,EAAAA,IAAW9C,EAAUC,OAClH1B,GACFA,IAEF8K,EAA2B2C,EAAI9C,EAAU,EAAG,CAC1ClJ,EAEAC,IAAaoU,OAAwB,EAASe,GAAiBnV,EAAS,KAAOoU,EAAwB,GAAKpU,EAC5GsV,IAEFtV,EAAWD,EAEf,MACExD,EAAOV,KACT,EAGF,IAAIe,EADJ4O,EAAInM,eAAiB0M,EAEP,SAAV0I,EACF7X,EAAY4O,EACO,SAAViJ,EACT7X,EAAYA,IAAMgZ,GAAsBpK,EAAKvC,GAAYA,EAAS8J,WAElEvH,EAAIF,KAAM,EACNrC,IACFuC,EAAIT,GAAK9B,EAAS5V,KACpBuJ,EAAYA,IAAM2O,EAASC,IAE7B,MAAMjP,EAAS,IAAIG,EAAAA,GAAeuK,EAAQc,EAAAA,GAAMnL,GAC1CJ,GAAQC,EAAAA,EAAAA,MACRqY,EAAUA,KACdvY,EAAON,OACHO,IACFqZ,EAAAA,EAAAA,IAAOrZ,EAAMjB,QAASgB,EACxB,EAsBF,OAhBIwP,EACEwI,EACF/I,IAEAxL,EAAWzD,EAAOV,MAED,SAAV4Y,EACTmB,GACErZ,EAAOV,IAAIgP,KAAKtO,GAChB0M,GAAYA,EAAS8J,UAGvBxW,EAAOV,MAEL2Z,GACFA,EAAWhnB,KAAKsmB,GACXA,CACT,CACA,SAASgB,GAAc7lB,EAAQJ,EAAOif,GACpC,MAAMiH,EAAa5oB,KAAKsZ,MAClBQ,GAASoG,EAAAA,EAAAA,IAASpd,GAAUA,EAAOqI,SAAS,KAAO0d,GAAiBD,EAAY9lB,GAAU,IAAM8lB,EAAW9lB,GAAUA,EAAO4a,KAAKkL,EAAYA,GACnJ,IAAIhK,GACAjE,EAAAA,EAAAA,IAAWjY,GACbkc,EAAKlc,GAELkc,EAAKlc,EAAM2d,QACXsB,EAAUjf,GAEZ,MAAM6J,EAAQuc,GAAmB9oB,MAC3B2K,EAAMwc,GAAQrN,EAAQ8E,EAAGlB,KAAKkL,GAAajH,GAEjD,OADApV,IACO5B,CACT,CACA,SAASke,GAAiBvG,EAAKyG,GAC7B,MAAMC,EAAWD,EAAK/e,MAAM,KAC5B,MAAO,KACL,IAAIsS,EAAMgG,EACV,IAAK,IAAI5jB,EAAI,EAAGA,EAAIsqB,EAASrqB,QAAU2d,EAAK5d,IAC1C4d,EAAMA,EAAI0M,EAAStqB,IAErB,OAAO4d,CAAG,CAEd,CACA,SAASwL,GAASplB,EAAOumB,EAAOC,EAAe,EAAGpK,GAChD,KAAKxT,EAAAA,EAAAA,IAAS5I,IAAUA,EAAM,YAC5B,OAAOA,EAET,GAAIumB,GAASA,EAAQ,EAAG,CACtB,GAAIC,GAAgBD,EAClB,OAAOvmB,EAETwmB,GACF,CAEA,GADApK,EAAOA,GAAwB,IAAIrL,IAC/BqL,EAAK7J,IAAIvS,GACX,OAAOA,EAGT,GADAoc,EAAKrI,IAAI/T,IACLwS,EAAAA,EAAAA,IAAMxS,GACRolB,GAASplB,EAAMA,MAAOumB,EAAOC,EAAcpK,QACtC,IAAIte,EAAAA,EAAAA,IAAQkC,GACjB,IAAK,IAAIhE,EAAI,EAAGA,EAAIgE,EAAM/D,OAAQD,IAChCopB,GAASplB,EAAMhE,GAAIuqB,EAAOC,EAAcpK,QAErC,IAAIqK,EAAAA,EAAAA,IAAMzmB,KAAU2Q,EAAAA,EAAAA,IAAM3Q,GAC/BA,EAAMkJ,SAAS0E,IACbwX,GAASxX,EAAG2Y,EAAOC,EAAcpK,EAAK,SAEnC,IAAIsK,EAAAA,EAAAA,IAAc1mB,GACvB,IAAK,MAAMY,KAAOZ,EAChBolB,GAASplB,EAAMY,GAAM2lB,EAAOC,EAAcpK,GAG9C,OAAOpc,CACT,CAOA,SAAS2mB,GAAehN,EAAOiN,GAC7B,GAAiC,OAA7BxH,EAEF,OAAOzF,EAET,MAAMP,EAAWyN,GAAezH,IAA6BA,EAAyBxI,MAChFkQ,EAAWnN,EAAMiI,OAASjI,EAAMiI,KAAO,IAC7C,IAAK,IAAI5lB,EAAI,EAAGA,EAAI4qB,EAAW3qB,OAAQD,IAAK,CAC1C,IAAK+qB,EAAK/mB,EAAOgnB,EAAKC,EAAYjK,EAAAA,IAAa4J,EAAW5qB,GACtD+qB,KACE9O,EAAAA,EAAAA,IAAW8O,KACbA,EAAM,CACJG,QAASH,EACTI,QAASJ,IAGTA,EAAIpC,MACNS,GAASplB,GAEX8mB,EAASnoB,KAAK,CACZooB,MACA3N,WACApZ,QACAmQ,cAAU,EACV6W,MACAC,cAGN,CACA,OAAOtN,CACT,CACA,SAASyN,GAAoBzN,EAAOqI,EAAW5I,EAAU9Z,GACvD,MAAMwnB,EAAWnN,EAAMiI,KACjByF,EAAcrF,GAAaA,EAAUJ,KAC3C,IAAK,IAAI5lB,EAAI,EAAGA,EAAI8qB,EAAS7qB,OAAQD,IAAK,CACxC,MAAMsrB,EAAUR,EAAS9qB,GACrBqrB,IACFC,EAAQnX,SAAWkX,EAAYrrB,GAAGgE,OAEpC,IAAIunB,EAAOD,EAAQP,IAAIznB,GACnBioB,KACFha,EAAAA,EAAAA,MACAgM,EAA2BgO,EAAMnO,EAAU,EAAG,CAC5CO,EAAMqJ,GACNsE,EACA3N,EACAqI,KAEFrU,EAAAA,EAAAA,MAEJ,CACF,CAEA,MAAM6Z,GAAa1X,OAAO,YACpB2X,GAAa3X,OAAO,YAC1B,SAAS4X,KACP,MAAMC,EAAQ,CACZC,WAAW,EACXC,WAAW,EACXC,cAAc,EACdC,cAA+B,IAAIrY,KAQrC,OANAsY,IAAU,KACRL,EAAMC,WAAY,CAAI,IAExBK,IAAgB,KACdN,EAAMG,cAAe,CAAI,IAEpBH,CACT,CACA,MAAMO,GAA0B,CAACC,SAAUtqB,OACrCuqB,GAAgC,CACpCC,KAAM7rB,OACN8rB,OAAQC,QACRC,UAAWD,QAEXE,cAAeP,GACfQ,QAASR,GACTS,aAAcT,GACdU,iBAAkBV,GAElBW,cAAeX,GACfY,QAASZ,GACTa,aAAcb,GACdc,iBAAkBd,GAElBe,eAAgBf,GAChBgB,SAAUhB,GACViB,cAAejB,GACfkB,kBAAmBlB,IAEfmB,GAAqB,CACzB/pB,KAAO,iBACPyd,MAAOqL,GACPkB,KAAAA,CAAMvM,GAAO,MAAEyD,IACb,MAAMpH,EAAWmQ,KACX5B,EAAQD,KACd,IAAI8B,EACJ,MAAO,KACL,MAAMpH,EAAW5B,EAAMiJ,SAAWC,GAAyBlJ,EAAMiJ,WAAW,GAC5E,IAAKrH,IAAaA,EAASnmB,OACzB,OAEF,IAAI0tB,EAAQvH,EAAS,GACrB,GAAIA,EAASnmB,OAAS,EAAG,CACvB,IAAI2tB,GAAW,EACf,IAAK,MAAM1tB,KAAKkmB,EACd,GAAIlmB,EAAEyH,OAAS4d,GAAS,CAClB,EAMJoI,EAAQztB,EACR0tB,GAAW,EAET,KACJ,CAEJ,CACA,MAAMC,GAAWtY,EAAAA,EAAAA,IAAMwL,IACjB,KAAEsL,GAASwB,EAIjB,GAAIlC,EAAME,UACR,OAAOiC,GAAiBH,GAE1B,MAAMI,EAAaC,GAAkBL,GACrC,IAAKI,EACH,OAAOD,GAAiBH,GAE1B,MAAMM,EAAaC,GACjBH,EACAF,EACAlC,EACAvO,GAEF+Q,GAAmBJ,EAAYE,GAC/B,MAAMG,EAAWhR,EAAS6J,QACpBoH,EAAgBD,GAAYJ,GAAkBI,GACpD,IAAIE,GAAuB,EAC3B,MAAM,iBAAEC,GAAqBR,EAAWpmB,KACxC,GAAI4mB,EAAkB,CACpB,MAAM3pB,EAAM2pB,SACc,IAAtBf,EACFA,EAAoB5oB,EACXA,IAAQ4oB,IACjBA,EAAoB5oB,EACpB0pB,GAAuB,EAE3B,CACA,GAAID,GAAiBA,EAAc1mB,OAAS4d,MAAaiJ,GAAgBT,EAAYM,IAAkBC,GAAuB,CAC5H,MAAMG,EAAeP,GACnBG,EACAR,EACAlC,EACAvO,GAGF,GADA+Q,GAAmBE,EAAeI,GACrB,WAATpC,EASF,OARAV,EAAME,WAAY,EAClB4C,EAAaC,WAAa,KACxB/C,EAAME,WAAY,GACa,IAA3BzO,EAAS/O,OAAO0B,SAClBqN,EAAS1M,OAAOY,OAAQ,EACxB8L,EAAS/O,SACX,EAEKyf,GAAiBH,GACN,WAATtB,GAAqB0B,EAAWpmB,OAAS4d,KAClDkJ,EAAaE,WAAa,CAAC3H,EAAI4H,EAAaC,KAC1C,MAAMC,EAAqBC,GACzBpD,EACA0C,GAEFS,EAAmBtuB,OAAO6tB,EAAczpB,MAAQypB,EAChDrH,EAAGwE,IAAc,KACfoD,IACA5H,EAAGwE,SAAc,SACVyC,EAAWY,YAAY,EAEhCZ,EAAWY,aAAeA,CAAY,EAG5C,CACA,OAAOlB,CAAK,CAEhB,GAEIqB,GAAiB3B,GACvB,SAAS0B,GAAuBpD,EAAOhO,GACrC,MAAM,cAAEoO,GAAkBJ,EAC1B,IAAImD,EAAqB/C,EAAczZ,IAAIqL,EAAMhW,MAKjD,OAJKmnB,IACHA,EAAqCzqB,OAAOkG,OAAO,MACnDwhB,EAAc7Y,IAAIyK,EAAMhW,KAAMmnB,IAEzBA,CACT,CACA,SAASZ,GAAuBvQ,EAAOoD,EAAO4K,EAAOvO,GACnD,MAAM,OACJkP,EAAM,KACND,EAAI,UACJG,GAAY,EAAK,cACjBC,EAAa,QACbC,EAAO,aACPC,EAAY,iBACZC,EAAgB,cAChBC,EAAa,QACbC,EAAO,aACPC,EAAY,iBACZC,EAAgB,eAChBC,EAAc,SACdC,EAAQ,cACRC,EAAa,kBACbC,GACErM,EACEnc,EAAMpE,OAAOmd,EAAM/Y,KACnBkqB,EAAqBC,GAAuBpD,EAAOhO,GACnDsR,EAAWA,CAAC1D,EAAMlW,KACtBkW,GAAQhO,EACNgO,EACAnO,EACA,EACA/H,EACD,EAEG6Z,EAAgBA,CAAC3D,EAAMlW,KAC3B,MAAM2D,EAAO3D,EAAK,GAClB4Z,EAAS1D,EAAMlW,IACXvT,EAAAA,EAAAA,IAAQypB,GACNA,EAAK4D,OAAOC,GAAUA,EAAMnvB,QAAU,KACxC+Y,IACOuS,EAAKtrB,QAAU,GACxB+Y,GACF,EAEIqW,EAAQ,CACZhD,OACAG,YACA8C,WAAAA,CAAYtI,GACV,IAAIuE,EAAOkB,EACX,IAAKd,EAAMC,UAAW,CACpB,IAAIU,EAGF,OAFAf,EAAO0B,GAAkBR,CAI7B,CACIzF,EAAGwE,KACLxE,EAAGwE,KACD,GAIJ,MAAM+D,EAAeT,EAAmBlqB,GACpC2qB,GAAgBf,GAAgB7Q,EAAO4R,IAAiBA,EAAavI,GAAGwE,KAC1E+D,EAAavI,GAAGwE,MAElByD,EAAS1D,EAAM,CAACvE,GAClB,EACAwI,KAAAA,CAAMxI,GACJ,IAAIuE,EAAOmB,EACP+C,EAAY9C,EACZ+C,EAAa9C,EACjB,IAAKjB,EAAMC,UAAW,CACpB,IAAIU,EAKF,OAJAf,EAAO2B,GAAYR,EACnB+C,EAAYtC,GAAiBR,EAC7B+C,EAAatC,GAAqBR,CAItC,CACA,IAAI+C,GAAS,EACb,MAAM3W,EAAOgO,EAAGyE,IAAemE,IACzBD,IAEJA,GAAS,EAEPV,EADEW,EACOF,EAEAD,EAFY,CAACzI,IAIpBqI,EAAMR,cACRQ,EAAMR,eAER7H,EAAGyE,SAAc,EAAM,EAErBF,EACF2D,EAAc3D,EAAM,CAACvE,EAAIhO,IAEzBA,GAEJ,EACA6W,KAAAA,CAAM7I,EAAIgD,GACR,MAAMxV,EAAOhU,OAAOmd,EAAM/Y,KAO1B,GANIoiB,EAAGyE,KACLzE,EAAGyE,KACD,GAIAE,EAAMG,aACR,OAAO9B,IAETiF,EAASpC,EAAe,CAAC7F,IACzB,IAAI2I,GAAS,EACb,MAAM3W,EAAOgO,EAAGwE,IAAeoE,IACzBD,IAEJA,GAAS,EACT3F,IAEEiF,EADEW,EACO5C,EAEAD,EAFkB,CAAC/F,IAI9BA,EAAGwE,SAAc,EACbsD,EAAmBta,KAAUmJ,UACxBmR,EAAmBta,GAC5B,EAEFsa,EAAmBta,GAAQmJ,EACvBmP,EACFoC,EAAcpC,EAAS,CAAC9F,EAAIhO,IAE5BA,GAEJ,EACA8W,KAAAA,CAAMC,GACJ,OAAO7B,GAAuB6B,EAAQhP,EAAO4K,EAAOvO,EACtD,GAEF,OAAOiS,CACT,CACA,SAASvB,GAAiBnQ,GACxB,GAAIqS,GAAYrS,GAGd,OAFAA,EAAQgI,GAAWhI,GACnBA,EAAMyI,SAAW,KACVzI,CAEX,CACA,SAASqQ,GAAkBrQ,GACzB,OAAOqS,GAAYrS,GAGwEA,EAAMyI,SAAWzI,EAAMyI,SAAS,QAAK,EAC5HzI,CACN,CACA,SAASwQ,GAAmBxQ,EAAO0R,GACX,EAAlB1R,EAAMoH,WAAiBpH,EAAM2I,UAC/B6H,GAAmBxQ,EAAM2I,UAAUW,QAASoI,GACjB,IAAlB1R,EAAMoH,WACfpH,EAAMsS,UAAUnK,WAAauJ,EAAMS,MAAMnS,EAAMsS,WAC/CtS,EAAMuS,WAAWpK,WAAauJ,EAAMS,MAAMnS,EAAMuS,aAEhDvS,EAAMmI,WAAauJ,CAEvB,CACA,SAAS3B,GAAyBtH,EAAU+J,GAAc,EAAOC,GAC/D,IAAIC,EAAM,GACNC,EAAqB,EACzB,IAAK,IAAItwB,EAAI,EAAGA,EAAIomB,EAASnmB,OAAQD,IAAK,CACxC,IAAI2tB,EAAQvH,EAASpmB,GACrB,MAAM4E,EAAmB,MAAbwrB,EAAoBzC,EAAM/oB,IAAMpE,OAAO4vB,GAAa5vB,OAAoB,MAAbmtB,EAAM/oB,IAAc+oB,EAAM/oB,IAAM5E,GACnG2tB,EAAMhmB,OAAS4oB,IACK,IAAlB5C,EAAMlH,WACR6J,IACFD,EAAMA,EAAIxK,OACR6H,GAAyBC,EAAMvH,SAAU+J,EAAavrB,MAE/CurB,GAAexC,EAAMhmB,OAAS4d,KACvC8K,EAAI1tB,KAAY,MAAPiC,EAAc+gB,GAAWgI,EAAO,CAAE/oB,QAAS+oB,EAExD,CACA,GAAI2C,EAAqB,EACvB,IAAK,IAAItwB,EAAI,EAAGA,EAAIqwB,EAAIpwB,OAAQD,IAC9BqwB,EAAIrwB,GAAGymB,WAAa,EAGxB,OAAO4J,CACT;2BAIA,SAASG,GAAgBvN,EAASwN,GAChC,OAAOxU,EAAAA,EAAAA,IAAWgH,GAGA,MAAOJ,EAAAA,EAAAA,IAAO,CAAEvf,KAAM2f,EAAQ3f,MAAQmtB,EAAc,CAAEnD,MAAOrK,IAA7D,GACdA,CACN,CAEA,MAAMyN,GAAkB1wB,KAAQA,EAAE2H,KAAKgpB;4BA2IvC,MAAMX,GAAerS,GAAUA,EAAMhW,KAAKipB,cAQpBC,OACAA,OAuLtB,SAASC,GAAQC,EAASztB,GACxB,OAAIxB,EAAAA,EAAAA,IAAQivB,GACHA,EAAQtL,MAAM1lB,GAAM+wB,GAAQ/wB,EAAGuD,MAC7Bke,EAAAA,EAAAA,IAASuP,GACXA,EAAQzlB,MAAM,KAAKmB,SAASnJ,MAC1B0tB,EAAAA,EAAAA,IAASD,IACXA,EAAQjoB,KAAKxF,EAGxB,CACA,SAAS2tB,GAAY1F,EAAMpnB,GACzB+sB,GAAsB3F,EAAM,IAAKpnB,EACnC,CACA,SAASgtB,GAAc5F,EAAMpnB,GAC3B+sB,GAAsB3F,EAAM,KAAMpnB,EACpC,CACA,SAAS+sB,GAAsB3F,EAAM5jB,EAAMxD,EAASwjB,IAClD,MAAMyJ,EAAc7F,EAAK8F,QAAU9F,EAAK8F,MAAQ,KAC9C,IAAIC,EAAUntB,EACd,MAAOmtB,EAAS,CACd,GAAIA,EAAQC,cACV,OAEFD,EAAUA,EAAQ1hB,MACpB,CACA,OAAO2b,GAAM,GAGf,GADAiG,GAAW7pB,EAAMypB,EAAajtB,GAC1BA,EAAQ,CACV,IAAImtB,EAAUntB,EAAOyL,OACrB,MAAO0hB,GAAWA,EAAQ1hB,OACpBogB,GAAYsB,EAAQ1hB,OAAO+N,QAC7B8T,GAAsBL,EAAazpB,EAAMxD,EAAQmtB,GAEnDA,EAAUA,EAAQ1hB,MAEtB,CACF,CACA,SAAS6hB,GAAsBlG,EAAM5jB,EAAMxD,EAAQutB,GACjD,MAAMC,EAAWH,GACf7pB,EACA4jB,EACAmG,GACA,GAGFE,IAAY,MACV5H,EAAAA,EAAAA,IAAO0H,EAAc/pB,GAAOgqB,EAAS,GACpCxtB,EACL,CACA,SAAS0tB,GAAelU,GACtBA,EAAMoH,YAAa,IACnBpH,EAAMoH,YAAa,GACrB,CACA,SAAS+M,GAAcnU,GACrB,OAAyB,IAAlBA,EAAMoH,UAAkBpH,EAAMsS,UAAYtS,CACnD,CAEA,SAAS6T,GAAW7pB,EAAM4jB,EAAMpnB,EAASwjB,GAAiBoK,GAAU,GAClE,GAAI5tB,EAAQ,CACV,MAAMkrB,EAAQlrB,EAAOwD,KAAUxD,EAAOwD,GAAQ,IACxCypB,EAAc7F,EAAKyG,QAAUzG,EAAKyG,MAAQ,IAAI3c,KAClD,GAAIlR,EAAO2c,YACT,QAEFvP,EAAAA,EAAAA,MACA,MAAM1D,EAAQuc,GAAmBjmB,GAC3B8H,EAAMsR,EAA2BgO,EAAMpnB,EAAQwD,EAAM0N,GAG3D,OAFAxH,KACA8D,EAAAA,EAAAA,MACO1F,CAAG,GAOZ,OALI8lB,EACF1C,EAAM4C,QAAQb,GAEd/B,EAAM1sB,KAAKyuB,GAENA,CACT,CAMF,CACA,MAAMc,GAAcC,GAAc,CAAC5G,EAAMpnB,EAASwjB,OAE9CiC,IAAuC,OAAduI,IAAuBX,GAAWW,GAAW,IAAI9c,IAASkW,KAAQlW,IAAOlR,GAEhGiuB,GAAgBF,GAAW,MAC3BlG,GAAYkG,GAAW,KACvBG,GAAiBH,GAAW,MAC5BI,GAAYJ,GAAW,KACvBjG,GAAkBiG,GAAW,OAC7BN,GAAcM,GAAW,MACzBK,GAAmBL,GAAW,MAC9BM,GAAoBN,GACxB,OAEIO,GAAkBP,GACtB,OAEF,SAASQ,GAAgBnH,EAAMpnB,EAASwjB,IACtC6J,GAAW,KAAMjG,EAAMpnB,EACzB,CAEA,SAASwuB,GAAWvuB,EAAQwuB,EAAYxQ,EAAOvS,GAC7C,IAAIwgB,EACJ,MAAM/N,EAASF,GAASA,EAAMvS,GAC9B,IAAI/N,EAAAA,EAAAA,IAAQsC,KAAWod,EAAAA,EAAAA,IAASpd,GAAS,CACvCisB,EAAM,IAAIxuB,MAAMuC,EAAOnE,QACvB,IAAK,IAAID,EAAI,EAAGsQ,EAAIlM,EAAOnE,OAAQD,EAAIsQ,EAAGtQ,IACxCqwB,EAAIrwB,GAAK4yB,EAAWxuB,EAAOpE,GAAIA,OAAG,EAAQsiB,GAAUA,EAAOtiB,GAE/D,MAAO,GAAsB,kBAAXoE,EAAqB,CACjC,EAGJisB,EAAM,IAAIxuB,MAAMuC,GAChB,IAAK,IAAIpE,EAAI,EAAGA,EAAIoE,EAAQpE,IAC1BqwB,EAAIrwB,GAAK4yB,EAAW5yB,EAAI,EAAGA,OAAG,EAAQsiB,GAAUA,EAAOtiB,GAE3D,MAAO,IAAI4M,EAAAA,EAAAA,IAASxI,GAClB,GAAIA,EAAO0P,OAAO8E,UAChByX,EAAMxuB,MAAMgxB,KACVzuB,GACA,CAAC0uB,EAAM9yB,IAAM4yB,EAAWE,EAAM9yB,OAAG,EAAQsiB,GAAUA,EAAOtiB,UAEvD,CACL,MAAMsM,EAAOjI,OAAOiI,KAAKlI,GACzBisB,EAAM,IAAIxuB,MAAMyK,EAAKrM,QACrB,IAAK,IAAID,EAAI,EAAGsQ,EAAIhE,EAAKrM,OAAQD,EAAIsQ,EAAGtQ,IAAK,CAC3C,MAAM4E,EAAM0H,EAAKtM,GACjBqwB,EAAIrwB,GAAK4yB,EAAWxuB,EAAOQ,GAAMA,EAAK5E,EAAGsiB,GAAUA,EAAOtiB,GAC5D,CACF,MAEAqwB,EAAM,GAKR,OAHIjO,IACFA,EAAMvS,GAASwgB,GAEVA,CACT,CAiFA,MAAM0C,GAAqB/yB,GACpBA,EAEDgzB,GAAoBhzB,GACf6qB,GAAe7qB,IAAMA,EAAE4a,MACzBmY,GAAkB/yB,EAAE4P,QAHlB,KAKLqjB,IAGYpQ,EAAAA,EAAAA,IAAuBxe,OAAOkG,OAAO,MAAO,CAC1D2oB,EAAIlzB,GAAMA,EACVmzB,IAAMnzB,GAAMA,EAAE2d,MAAMqJ,GACpBoM,MAAQpzB,GAAMA,EAAE2K,KAChB0oB,OAASrzB,GAA6EA,EAAE+gB,MACxFuS,OAAStzB,GAA6EA,EAAEykB,MACxF8O,OAASvzB,GAA6EA,EAAEwkB,MACxFgP,MAAQxzB,GAA4EA,EAAEyzB,KACtFC,QAAU1zB,GAAM+yB,GAAkB/yB,EAAE4P,QACpC+jB,MAAQ3zB,GAAM+yB,GAAkB/yB,EAAEwlB,MAClCoO,MAAQ5zB,GAAMA,EAAE2gB,KAChBkT,SAAW7zB,GAA4B8zB,GAAqB9zB,GAC5D+zB,aAAe/zB,GAAMA,EAAEmO,IAAMnO,EAAEmO,EAAI,KACjCnO,EAAE0Q,OAAOY,OAAQ,EACjBoO,EAAS1f,EAAEqO,OAAO,GAEpB2lB,UAAYh0B,GAAMA,EAAEuO,IAAMvO,EAAEuO,EAAIuQ,EAASE,KAAKhf,EAAE4a,QAChDqZ,OAASj0B,GAA4BiqB,GAAcjL,KAAKhf,KAItDk0B,GAAkBA,CAACvI,EAAO/mB,IAAQ+mB,IAAU3K,EAAAA,KAAc2K,EAAMwI,kBAAmB9d,EAAAA,EAAAA,IAAOsV,EAAO/mB,GACjGwvB,GAA8B,CAClC9hB,GAAAA,EAAMrH,EAAGmS,GAAYxY,GACnB,MAAM,IAAEgf,EAAG,WAAEgB,EAAU,KAAEja,EAAI,MAAEoW,EAAK,YAAEsT,EAAW,KAAE1sB,EAAI,WAAEuW,GAAed,EAIxE,IAAIkX,EACJ,GAAe,MAAX1vB,EAAI,GAAY,CAClB,MAAM2J,EAAI8lB,EAAYzvB,GACtB,QAAU,IAAN2J,EACF,OAAQA,GACN,KAAK,EACH,OAAOqW,EAAWhgB,GACpB,KAAK,EACH,OAAO+F,EAAK/F,GACd,KAAK,EACH,OAAOgf,EAAIhf,GACb,KAAK,EACH,OAAOmc,EAAMnc,OAEZ,IAAIsvB,GAAgBtP,EAAYhgB,GAErC,OADAyvB,EAAYzvB,GAAO,EACZggB,EAAWhgB,GACb,GAAI+F,IAASqW,EAAAA,KAAa3K,EAAAA,EAAAA,IAAO1L,EAAM/F,GAE5C,OADAyvB,EAAYzvB,GAAO,EACZ+F,EAAK/F,GACP,IAGJ0vB,EAAkBlX,EAASmH,aAAa,MAAOlO,EAAAA,EAAAA,IAAOie,EAAiB1vB,GAGxE,OADAyvB,EAAYzvB,GAAO,EACZmc,EAAMnc,GACR,GAAIgf,IAAQ5C,EAAAA,KAAa3K,EAAAA,EAAAA,IAAOuN,EAAKhf,GAE1C,OADAyvB,EAAYzvB,GAAO,EACZgf,EAAIhf,GACsB2vB,KACjCF,EAAYzvB,GAAO,EACrB,CACF,CACA,MAAM4vB,EAAevB,GAAoBruB,GACzC,IAAI6vB,EAAWC,EACf,OAAIF,GACU,WAAR5vB,IACFoP,EAAAA,EAAAA,IAAMoJ,EAAU,MAAOxY,GAKlB4vB,EAAapX,KAGnBqX,EAAY9sB,EAAKgtB,gBAAkBF,EAAYA,EAAU7vB,IAEnD6vB,EACE7Q,IAAQ5C,EAAAA,KAAa3K,EAAAA,EAAAA,IAAOuN,EAAKhf,IAC1CyvB,EAAYzvB,GAAO,EACZgf,EAAIhf,KAGX8vB,EAAmBxW,EAAWtX,OAAO8tB,kBAAkBre,EAAAA,EAAAA,IAAOqe,EAAkB9vB,GAGvE8vB,EAAiB9vB,QALrB,EAsBT,EACAsO,GAAAA,EAAMjI,EAAGmS,GAAYxY,EAAKZ,GACxB,MAAM,KAAE2G,EAAI,WAAEia,EAAU,IAAEhB,GAAQxG,EAClC,OAAI8W,GAAgBtP,EAAYhgB,IAC9BggB,EAAWhgB,GAAOZ,GACX,GAIE2G,IAASqW,EAAAA,KAAa3K,EAAAA,EAAAA,IAAO1L,EAAM/F,IAC5C+F,EAAK/F,GAAOZ,GACL,KACEqS,EAAAA,EAAAA,IAAO+G,EAAS2D,MAAOnc,MAInB,MAAXA,EAAI,MAAcA,EAAIwc,MAAM,KAAMhE,MAalCwG,EAAIhf,GAAOZ,GAGR,GACT,EACAuS,GAAAA,EACEtL,GAAG,KAAEN,EAAI,WAAEia,EAAU,YAAEyP,EAAW,IAAEzQ,EAAG,WAAE1F,EAAU,aAAEqG,IACpD3f,GACD,IAAI0vB,EACJ,QAASD,EAAYzvB,IAAQ+F,IAASqW,EAAAA,KAAa3K,EAAAA,EAAAA,IAAO1L,EAAM/F,IAAQsvB,GAAgBtP,EAAYhgB,KAAS0vB,EAAkB/P,EAAa,MAAOlO,EAAAA,EAAAA,IAAOie,EAAiB1vB,KAAQyR,EAAAA,EAAAA,IAAOuN,EAAKhf,KAAQyR,EAAAA,EAAAA,IAAO4c,GAAqBruB,KAAQyR,EAAAA,EAAAA,IAAO6H,EAAWtX,OAAO8tB,iBAAkB9vB,EACxR,EACAgwB,cAAAA,CAAezwB,EAAQS,EAAKiwB,GAM1B,OALsB,MAAlBA,EAAWviB,IACbnO,EAAO8G,EAAEopB,YAAYzvB,GAAO,GACnByR,EAAAA,EAAAA,IAAOwe,EAAY,UAC5BvzB,KAAK4R,IAAI/O,EAAQS,EAAKiwB,EAAW7wB,MAAO,MAEnCsS,QAAQse,eAAezwB,EAAQS,EAAKiwB,EAC7C,GAiJF,SAASC,GAAsB/T,GAC7B,OAAOjf,EAAAA,EAAAA,IAAQif,GAASA,EAAMgU,QAC5B,CAACvS,EAAYziB,KAAOyiB,EAAWziB,GAAK,KAAMyiB,IAC1C,CAAC,GACCzB,CACN,CAuEA,IAAIwT,IAAoB,EACxB,SAASS,GAAa5X,GACpB,MAAM6F,EAAU6Q,GAAqB1W,GAC/B8M,EAAa9M,EAASxC,MACtBgJ,EAAMxG,EAASwG,IACrB2Q,IAAoB,EAChBtR,EAAQgS,cACVhG,GAAShM,EAAQgS,aAAc7X,EAAU,MAE3C,MAEEzS,KAAMuqB,EACNzjB,SAAU0jB,EAAe,QACzBC,EACA5M,MAAO6M,EACPC,QAASC,EACTjN,OAAQkN,EAAa,QAErBC,EAAO,YACPC,EAAW,QACXxK,EAAO,aACPyK,EAAY,QACZxK,EAAO,UACPyK,EAAS,YACTC,EAAW,cACXC,EAAa,cACbC,EAAa,UACbC,EAAS,UACTC,EAAS,OACTvR,EAAM,cACNwR,EAAa,gBACbC,EAAe,cACfC,EAAa,eACbC,EAAc,OAEdC,EAAM,aACNzR,EAAY,WAEZ0R,EAAU,WACV3L,EAAU,QACV4L,GACEvT,EACEwT,EAAkG,KAYxG,GAHIjB,GACFkB,GAAkBlB,EAAe5R,EAAK6S,GAEpCrB,EACF,IAAK,MAAMxwB,KAAOwwB,EAAS,CACzB,MAAMuB,EAAgBvB,EAAQxwB,IAC1BqX,EAAAA,EAAAA,IAAW0a,KASX/S,EAAIhf,GAAO+xB,EAAc3X,KAAKkL,GAUpC,CAEF,GAAIgL,EAAa,CACX,EAKJ,MAAMvqB,EAAOuqB,EAAYvpB,KAAKue,EAAYA,GACtC,GAKCtd,EAAAA,EAAAA,IAASjC,KAGZyS,EAASzS,MAAO+L,EAAAA,EAAAA,IAAS/L,GAe7B,CAEA,GADA4pB,IAAoB,EAChBY,EACF,IAAK,MAAMvwB,KAAOuwB,EAAiB,CACjC,MAAMyB,EAAMzB,EAAgBvwB,GACtB0N,GAAM2J,EAAAA,EAAAA,IAAW2a,GAAOA,EAAI5X,KAAKkL,EAAYA,IAAcjO,EAAAA,EAAAA,IAAW2a,EAAItkB,KAAOskB,EAAItkB,IAAI0M,KAAKkL,EAAYA,GAAchO,EAAAA,GAC1H,EAGJ,MAAMhJ,IAAO+I,EAAAA,EAAAA,IAAW2a,KAAQ3a,EAAAA,EAAAA,IAAW2a,EAAI1jB,KAAO0jB,EAAI1jB,IAAI8L,KAAKkL,GAI/DhO,EAAAA,GACEhc,EAAIuR,GAAS,CACjBa,MACAY,QAEF7O,OAAOuwB,eAAehR,EAAKhf,EAAK,CAC9BiyB,YAAY,EACZC,cAAc,EACdxkB,IAAKA,IAAMpS,EAAE8D,MACbkP,IAAMtB,GAAM1R,EAAE8D,MAAQ4N,GAK1B,CAEF,GAAIyjB,EACF,IAAK,MAAMzwB,KAAOywB,EAChB0B,GAAc1B,EAAazwB,GAAMgf,EAAKsG,EAAYtlB,GAGtD,GAAI2wB,EAAgB,CAClB,MAAMyB,GAAW/a,EAAAA,EAAAA,IAAWsZ,GAAkBA,EAAe5pB,KAAKue,GAAcqL,EAChFjf,QAAQY,QAAQ8f,GAAU9pB,SAAStI,IACjC0wB,GAAQ1wB,EAAKoyB,EAASpyB,GAAK,GAE/B,CAIA,SAASqyB,EAAsBC,EAAU3L,IACnCzpB,EAAAA,EAAAA,IAAQypB,GACVA,EAAKre,SAASiqB,GAAUD,EAASC,EAAMnY,KAAKkL,MACnCqB,GACT2L,EAAS3L,EAAKvM,KAAKkL,GAEvB,CAaA,GAtBIuL,GACFxG,GAASwG,EAASrY,EAAU,KAS9B6Z,EAAsB7E,GAAesD,GACrCuB,EAAsBjL,GAAWd,GACjC+L,EAAsB5E,GAAgBsD,GACtCsB,EAAsB3E,GAAWnH,GACjC8L,EAAsBhG,GAAa2E,GACnCqB,EAAsB9F,GAAe0E,GACrCoB,EAAsBvE,GAAiB0D,GACvCa,EAAsBxE,GAAiByD,GACvCe,EAAsBzE,GAAmB2D,GACzCc,EAAsBhL,GAAiB8J,GACvCkB,EAAsBrF,GAAaqE,GACnCgB,EAAsB1E,GAAkB8D,IACpCv0B,EAAAA,EAAAA,IAAQw0B,GACV,GAAIA,EAAOr2B,OAAQ,CACjB,MAAMm3B,EAAUha,EAASga,UAAYha,EAASga,QAAU,CAAC,GACzDd,EAAOppB,SAAStI,IACdP,OAAOuwB,eAAewC,EAASxyB,EAAK,CAClC0N,IAAKA,IAAM4X,EAAWtlB,GACtBsO,IAAMmkB,GAAQnN,EAAWtlB,GAAOyyB,GAChC,GAEN,MAAYja,EAASga,UACnBha,EAASga,QAAU,CAAC,GAGpB1S,GAAUtH,EAASsH,SAAWxI,EAAAA,KAChCkB,EAASsH,OAASA,GAEA,MAAhBG,IACFzH,EAASyH,aAAeA,GAEtB0R,IACFnZ,EAASmZ,WAAaA,GACpB3L,IACFxN,EAASwN,WAAaA,EAC1B,CACA,SAAS8L,GAAkBlB,EAAe5R,EAAK6S,EAA2Bva,EAAAA,KACpEpa,EAAAA,EAAAA,IAAQ0zB,KACVA,EAAgB8B,GAAgB9B,IAElC,IAAK,MAAM5wB,KAAO4wB,EAAe,CAC/B,MAAMoB,EAAMpB,EAAc5wB,GAC1B,IAAI+sB,EAGAA,GAFA/kB,EAAAA,EAAAA,IAASgqB,GACP,YAAaA,EACJtO,GACTsO,EAAI/D,MAAQjuB,EACZgyB,EAAInJ,SACJ,GAGSnF,GAAOsO,EAAI/D,MAAQjuB,GAGrB0jB,GAAOsO,IAEhBpgB,EAAAA,EAAAA,IAAMmb,GACRttB,OAAOuwB,eAAehR,EAAKhf,EAAK,CAC9BiyB,YAAY,EACZC,cAAc,EACdxkB,IAAKA,IAAMqf,EAAS3tB,MACpBkP,IAAMtB,GAAM+f,EAAS3tB,MAAQ4N,IAG/BgS,EAAIhf,GAAO+sB,CAKf,CACF,CACA,SAAS1C,GAAS1D,EAAMnO,EAAUzV,GAChC4V,GACEzb,EAAAA,EAAAA,IAAQypB,GAAQA,EAAKzf,KAAKyrB,GAAMA,EAAEvY,KAAK5B,EAASxC,SAAU2Q,EAAKvM,KAAK5B,EAASxC,OAC7EwC,EACAzV,EAEJ,CACA,SAASovB,GAAc/b,EAAK4I,EAAKsG,EAAYtlB,GAC3C,MAAMwW,EAASxW,EAAI6H,SAAS,KAAO0d,GAAiBD,EAAYtlB,GAAO,IAAMslB,EAAWtlB,GACxF,IAAI4c,EAAAA,EAAAA,IAASxG,GAAM,CACjB,MAAM2G,EAAUiC,EAAI5I,IAChBiB,EAAAA,EAAAA,IAAW0F,IACb6G,GAAMpN,EAAQuG,EAIlB,MAAO,IAAI1F,EAAAA,EAAAA,IAAWjB,GACpBwN,GAAMpN,EAAQJ,EAAIgE,KAAKkL,SAClB,IAAItd,EAAAA,EAAAA,IAASoO,GAClB,IAAIlZ,EAAAA,EAAAA,IAAQkZ,GACVA,EAAI9N,SAASoP,GAAMya,GAAcza,EAAGsH,EAAKsG,EAAYtlB,SAChD,CACL,MAAM+c,GAAU1F,EAAAA,EAAAA,IAAWjB,EAAI2G,SAAW3G,EAAI2G,QAAQ3C,KAAKkL,GAActG,EAAI5I,EAAI2G,UAC7E1F,EAAAA,EAAAA,IAAW0F,IACb6G,GAAMpN,EAAQuG,EAAS3G,EAI3B,MACS,CAGb,CACA,SAAS8Y,GAAqB1W,GAC5B,MAAMoa,EAAOpa,EAASzV,MAChB,OAAEmb,EAAQC,QAAS0U,GAAmBD,GAE1C1U,OAAQ4U,EACRC,aAAcvV,EACdxb,QAAQ,sBAAEgxB,IACRxa,EAASc,WACPoE,EAASF,EAAM9P,IAAIklB,GACzB,IAAIK,EAmBJ,OAlBIvV,EACFuV,EAAWvV,EACDoV,EAAaz3B,QAAW6iB,GAAW2U,GAK7CI,EAAW,CAAC,EACRH,EAAaz3B,QACfy3B,EAAaxqB,SACV4qB,GAAMC,GAAaF,EAAUC,EAAGF,GAAuB,KAG5DG,GAAaF,EAAUL,EAAMI,IAT3BC,EAAWL,GAWX5qB,EAAAA,EAAAA,IAAS4qB,IACXpV,EAAMlP,IAAIskB,EAAMK,GAEXA,CACT,CACA,SAASE,GAAaC,EAAInF,EAAMoF,EAAQ9V,GAAU,GAChD,MAAM,OAAEW,EAAQC,QAAS0U,GAAmB5E,EACxC4E,GACFM,GAAaC,EAAIP,EAAgBQ,GAAQ,GAEvCnV,GACFA,EAAO5V,SACJ4qB,GAAMC,GAAaC,EAAIF,EAAGG,GAAQ,KAGvC,IAAK,MAAMrzB,KAAOiuB,EAChB,GAAI1Q,GAAmB,WAARvd,OAIR,CACL,MAAMszB,EAAQC,GAA0BvzB,IAAQqzB,GAAUA,EAAOrzB,GACjEozB,EAAGpzB,GAAOszB,EAAQA,EAAMF,EAAGpzB,GAAMiuB,EAAKjuB,IAAQiuB,EAAKjuB,EACrD,CAEF,OAAOozB,CACT,CACA,MAAMG,GAA4B,CAChCxtB,KAAMytB,GACNrX,MAAOsX,GACP9V,MAAO8V,GAEPjD,QAASkD,GACT7mB,SAAU6mB,GAEVrD,aAAcsD,GACd9C,QAAS8C,GACT7C,YAAa6C,GACbrN,QAASqN,GACT5C,aAAc4C,GACdpN,QAASoN,GACTzC,cAAeyC,GACfxC,cAAewC,GACfvC,UAAWuC,GACXtC,UAAWsC,GACX3C,UAAW2C,GACX1C,YAAa0C,GACbnC,cAAemC,GACflC,eAAgBkC,GAEhBhC,WAAY+B,GACZ1N,WAAY0N,GAEZ9P,MAAOgQ,GAEPlD,QAAS8C,GACT9P,OAAQmQ,IAEV,SAASL,GAAYJ,EAAInF,GACvB,OAAKA,EAGAmF,EAGE,WACL,OAAQnV,EAAAA,EAAAA,KACN5G,EAAAA,EAAAA,IAAW+b,GAAMA,EAAGrsB,KAAKrK,KAAMA,MAAQ02B,GACvC/b,EAAAA,EAAAA,IAAW4W,GAAQA,EAAKlnB,KAAKrK,KAAMA,MAAQuxB,EAE/C,EAPSA,EAHAmF,CAWX,CACA,SAASS,GAAYT,EAAInF,GACvB,OAAOyF,GAAmBhB,GAAgBU,GAAKV,GAAgBzE,GACjE,CACA,SAASyE,GAAgBtc,GACvB,IAAIlZ,EAAAA,EAAAA,IAAQkZ,GAAM,CAChB,MAAM/O,EAAM,CAAC,EACb,IAAK,IAAIjM,EAAI,EAAGA,EAAIgb,EAAI/a,OAAQD,IAC9BiM,EAAI+O,EAAIhb,IAAMgb,EAAIhb,GAEpB,OAAOiM,CACT,CACA,OAAO+O,CACT,CACA,SAASud,GAAaP,EAAInF,GACxB,OAAOmF,EAAK,IAAI,IAAIjjB,IAAI,GAAG8Q,OAAOmS,EAAInF,KAAUA,CAClD,CACA,SAASyF,GAAmBN,EAAInF,GAC9B,OAAOmF,GAAKnV,EAAAA,EAAAA,IAAuBxe,OAAOkG,OAAO,MAAOytB,EAAInF,GAAQA,CACtE,CACA,SAASwF,GAAyBL,EAAInF,GACpC,OAAImF,GACEl2B,EAAAA,EAAAA,IAAQk2B,KAAOl2B,EAAAA,EAAAA,IAAQ+wB,GAClB,IAAoB,IAAI9d,IAAI,IAAIijB,KAAOnF,MAEzChQ,EAAAA,EAAAA,IACWxe,OAAOkG,OAAO,MAC9BuqB,GAAsBkD,GACtBlD,GAA8B,MAARjC,EAAeA,EAAO,CAAC,IAGxCA,CAEX,CACA,SAAS2F,GAAkBR,EAAInF,GAC7B,IAAKmF,EACH,OAAOnF,EACT,IAAKA,EACH,OAAOmF,EACT,MAAMU,GAAS7V,EAAAA,EAAAA,IAAuBxe,OAAOkG,OAAO,MAAOytB,GAC3D,IAAK,MAAMpzB,KAAOiuB,EAChB6F,EAAO9zB,GAAO2zB,GAAaP,EAAGpzB,GAAMiuB,EAAKjuB,IAE3C,OAAO8zB,CACT,CAEA,SAASC,KACP,MAAO,CACLC,IAAK,KACLhyB,OAAQ,CACNiyB,YAAaC,EAAAA,GACbC,aAAa,EACbrE,iBAAkB,CAAC,EACnBkD,sBAAuB,CAAC,EACxBzZ,kBAAc,EACd6a,iBAAa,EACbC,gBAAiB,CAAC,GAEpBnW,OAAQ,GACRyT,WAAY,CAAC,EACb3L,WAAY,CAAC,EACboM,SAA0B3yB,OAAOkG,OAAO,MACxCotB,aAA8B,IAAI/jB,QAClCslB,WAA4B,IAAItlB,QAChCyO,WAA4B,IAAIzO,QAEpC,CACA,IAAIulB,GAAQ,EACZ,SAASC,GAAa1U,EAAQ2U,GAC5B,OAAO,SAAmBC,EAAeC,EAAY,OAC9Ctd,EAAAA,EAAAA,IAAWqd,KACdA,GAAgBzW,EAAAA,EAAAA,IAAO,CAAC,EAAGyW,IAEZ,MAAbC,IAAsB3sB,EAAAA,EAAAA,IAAS2sB,KAEjCA,EAAY,MAEd,MAAMC,EAAUb,KACVc,EAAmC,IAAIC,QAC7C,IAAI9N,GAAY,EAChB,MAAMgN,EAAMY,EAAQZ,IAAM,CACxBe,KAAMR,KACNS,WAAYN,EACZO,OAAQN,EACRO,WAAY,KACZC,SAAUP,EACVQ,UAAW,KACXC,WACA,UAAIrzB,GACF,OAAO4yB,EAAQ5yB,MACjB,EACA,UAAIA,CAAOgL,GACL,CAKN,EACAsoB,GAAAA,CAAIC,KAAWlX,GAcb,OAbIwW,EAAiBljB,IAAI4jB,KAEdA,IAAUle,EAAAA,EAAAA,IAAWke,EAAOC,UACrCX,EAAiB1hB,IAAIoiB,GACrBA,EAAOC,QAAQxB,KAAQ3V,KACdhH,EAAAA,EAAAA,IAAWke,KACpBV,EAAiB1hB,IAAIoiB,GACrBA,EAAOvB,KAAQ3V,KAMV2V,CACT,EACAyB,KAAAA,CAAMA,GAYJ,OAVOb,EAAQ1W,OAAOrW,SAAS4tB,IAC3Bb,EAAQ1W,OAAOngB,KAAK03B,GASjBzB,CACT,EACAtS,SAAAA,CAAUhjB,EAAMgjB,GAId,OAAKA,GAMLkT,EAAQjD,WAAWjzB,GAAQgjB,EACpBsS,GANEY,EAAQjD,WAAWjzB,EAO9B,EACAg3B,SAAAA,CAAUh3B,EAAMg3B,GAId,OAAKA,GAMLd,EAAQ5O,WAAWtnB,GAAQg3B,EACpB1B,GANEY,EAAQ5O,WAAWtnB,EAO9B,EACAi3B,KAAAA,CAAMC,EAAeC,EAAWC,GAC9B,IAAK9O,EAAW,CACV,EAMJ,MAAMjO,EAAQ2H,GAAYgU,EAAeC,GA4BzC,OA3BA5b,EAAMO,WAAasb,GACD,IAAdkB,EACFA,EAAY,OACW,IAAdA,IACTA,OAAY,GAWVD,GAAapB,EACfA,EAAQ1b,EAAO6c,GAEf9V,EAAO/G,EAAO6c,EAAeE,GAE/B9O,GAAY,EACZgN,EAAIkB,WAAaU,EACjBA,EAAcG,YAAc/B,EAKrB/N,GAAelN,EAAM2I,YAAc3I,EAAM2I,UAAU1L,KAC5D,CAMF,EACAggB,OAAAA,GACMhP,IACFlH,EAAO,KAAMkU,EAAIkB,mBAKVlB,EAAIkB,WAAWa,YAI1B,EACArF,OAAAA,CAAQ1wB,EAAKZ,GAOX,OADAw1B,EAAQxC,SAASpyB,GAAOZ,EACjB40B,CACT,EACAiC,cAAAA,CAAe9uB,GACb+uB,GAAalC,EACb,IACE,OAAO7sB,GACT,CAAE,QACA+uB,GAAa,IACf,CACF,GAEF,OAAOlC,CACT,CACF,CACA,IAAIkC,GAAa,KAEjB,SAASxF,GAAQ1wB,EAAKZ,GACpB,GAAK2jB,GAIE,CACL,IAAIqP,EAAWrP,GAAgBqP,SAC/B,MAAM+D,EAAiBpT,GAAgB/X,QAAU+X,GAAgB/X,OAAOonB,SACpE+D,IAAmB/D,IACrBA,EAAWrP,GAAgBqP,SAAW3yB,OAAOkG,OAAOwwB,IAEtD/D,EAASpyB,GAAOZ,CAClB,MAVM,CAWR,CACA,SAASskB,GAAO1jB,EAAKo2B,EAAcC,GAAwB,GACzD,MAAM7d,EAAWuK,IAAmBvE,EACpC,GAAIhG,GAAY0d,GAAY,CAC1B,MAAM9D,EAAW5Z,EAA8B,MAAnBA,EAASxN,OAAiBwN,EAASO,MAAMO,YAAcd,EAASO,MAAMO,WAAW8Y,SAAW5Z,EAASxN,OAAOonB,SAAW8D,GAAWf,SAAS/C,SACvK,GAAIA,GAAYpyB,KAAOoyB,EACrB,OAAOA,EAASpyB,GACX,GAAIs2B,UAAUj7B,OAAS,EAC5B,OAAOg7B,IAAyBhf,EAAAA,EAAAA,IAAW+e,GAAgBA,EAAarvB,KAAKyR,GAAYA,EAASxC,OAASogB,CAI/G,MAAW,CAGb,CAKA,SAASG,GAAU/d,EAAUyQ,EAAUuN,EAAY9f,GAAQ,GACzD,MAAMyF,EAAQ,CAAC,EACT0D,EAAQ,CAAC,GACfvJ,EAAAA,EAAAA,IAAIuJ,EAAO4W,GAAmB,GAC9Bje,EAASke,cAAgCj3B,OAAOkG,OAAO,MACvDgxB,GAAane,EAAUyQ,EAAU9M,EAAO0D,GACxC,IAAK,MAAM7f,KAAOwY,EAASmH,aAAa,GAChC3f,KAAOmc,IACXA,EAAMnc,QAAO,GAMbw2B,EACFhe,EAAS2D,MAAQzF,EAAQyF,GAAQzG,EAAAA,EAAAA,IAAgByG,GAE5C3D,EAASzV,KAAKoZ,MAGjB3D,EAAS2D,MAAQA,EAFjB3D,EAAS2D,MAAQ0D,EAKrBrH,EAASqH,MAAQA,CACnB,CAQA,SAAS+W,GAAYpe,EAAUyQ,EAAU4N,EAAcvV,GACrD,MAAM,MACJnF,EAAK,MACL0D,EACA9G,OAAO,UAAE8I,IACPrJ,EACEse,GAAkBnmB,EAAAA,EAAAA,IAAMwL,IACvBkC,GAAW7F,EAASmH,aAC3B,IAAIoX,GAAkB,EACtB,KAI+EzV,GAAaO,EAAY,IAAoB,GAAZA,EAmCzG,CAIL,IAAImV,EAHAL,GAAane,EAAUyQ,EAAU9M,EAAO0D,KAC1CkX,GAAkB,GAGpB,IAAK,MAAM/2B,KAAO82B,EACX7N,KACJxX,EAAAA,EAAAA,IAAOwX,EAAUjpB,KAEhBg3B,GAAW9Z,EAAAA,EAAAA,IAAUld,MAAUA,IAAQyR,EAAAA,EAAAA,IAAOwX,EAAU+N,MACpD3Y,GACEwY,QACmB,IAAtBA,EAAa72B,SACa,IAA3B62B,EAAaG,KACX7a,EAAMnc,GAAOi3B,GACX5Y,EACAyY,EACA92B,OACA,EACAwY,GACA,WAIG2D,EAAMnc,IAInB,GAAI6f,IAAUiX,EACZ,IAAK,MAAM92B,KAAO6f,EACXoJ,IAAaxX,EAAAA,EAAAA,IAAOwX,EAAUjpB,YAC1B6f,EAAM7f,GACb+2B,GAAkB,EAI1B,MArEE,GAAgB,EAAZlV,EAAe,CACjB,MAAMqV,EAAgB1e,EAASO,MAAMkJ,aACrC,IAAK,IAAI7mB,EAAI,EAAGA,EAAI87B,EAAc77B,OAAQD,IAAK,CAC7C,IAAI4E,EAAMk3B,EAAc97B,GACxB,GAAIgjB,EAAe5F,EAASsJ,aAAc9hB,GACxC,SAEF,MAAMZ,EAAQ6pB,EAASjpB,GACvB,GAAIqe,EACF,IAAI5M,EAAAA,EAAAA,IAAOoO,EAAO7f,GACZZ,IAAUygB,EAAM7f,KAClB6f,EAAM7f,GAAOZ,EACb23B,GAAkB,OAEf,CACL,MAAMI,GAAela,EAAAA,EAAAA,IAASjd,GAC9Bmc,EAAMgb,GAAgBF,GACpB5Y,EACAyY,EACAK,EACA/3B,EACAoZ,GACA,EAEJ,MAEIpZ,IAAUygB,EAAM7f,KAClB6f,EAAM7f,GAAOZ,EACb23B,GAAkB,EAGxB,CACF,CAsCEA,IACF7qB,EAAAA,EAAAA,IAAQsM,EAAU,MAAO,SAK7B,CACA,SAASme,GAAane,EAAUyQ,EAAU9M,EAAO0D,GAC/C,MAAOxB,EAAS+Y,GAAgB5e,EAASmH,aACzC,IACI0X,EADAN,GAAkB,EAEtB,GAAI9N,EACF,IAAK,IAAIjpB,KAAOipB,EAAU,CACxB,IAAIqO,EAAAA,EAAAA,IAAet3B,GACjB,SAEF,MAAMZ,EAAQ6pB,EAASjpB,GACvB,IAAIu3B,EACAlZ,IAAW5M,EAAAA,EAAAA,IAAO4M,EAASkZ,GAAWta,EAAAA,EAAAA,IAASjd,IAC5Co3B,GAAiBA,EAAavvB,SAAS0vB,IAGzCF,IAAkBA,EAAgB,CAAC,IAAIE,GAAYn4B,EAFpD+c,EAAMob,GAAYn4B,EAIVgf,EAAe5F,EAASsJ,aAAc9hB,IAC1CA,KAAO6f,GAAUzgB,IAAUygB,EAAM7f,KACrC6f,EAAM7f,GAAOZ,EACb23B,GAAkB,EAGxB,CAEF,GAAIK,EAAc,CAChB,MAAMN,GAAkBnmB,EAAAA,EAAAA,IAAMwL,GACxBqb,EAAaH,GAAiBjb,EAAAA,GACpC,IAAK,IAAIhhB,EAAI,EAAGA,EAAIg8B,EAAa/7B,OAAQD,IAAK,CAC5C,MAAM4E,EAAMo3B,EAAah8B,GACzB+gB,EAAMnc,GAAOi3B,GACX5Y,EACAyY,EACA92B,EACAw3B,EAAWx3B,GACXwY,IACC/G,EAAAA,EAAAA,IAAO+lB,EAAYx3B,GAExB,CACF,CACA,OAAO+2B,CACT,CACA,SAASE,GAAiB5Y,EAASlC,EAAOnc,EAAKZ,EAAOoZ,EAAUif,GAC9D,MAAMzF,EAAM3T,EAAQre,GACpB,GAAW,MAAPgyB,EAAa,CACf,MAAM0F,GAAajmB,EAAAA,EAAAA,IAAOugB,EAAK,WAC/B,GAAI0F,QAAwB,IAAVt4B,EAAkB,CAClC,MAAMg3B,EAAepE,EAAInJ,QACzB,GAAImJ,EAAIjvB,OAASwkB,WAAayK,EAAI2F,cAAetgB,EAAAA,EAAAA,IAAW+e,GAAe,CACzE,MAAM,cAAEM,GAAkBle,EAC1B,GAAIxY,KAAO02B,EACTt3B,EAAQs3B,EAAc12B,OACjB,CACL,MAAMiJ,EAAQuc,GAAmBhN,GACjCpZ,EAAQs3B,EAAc12B,GAAOo2B,EAAarvB,KACxC,KACAoV,GAEFlT,GACF,CACF,MACE7J,EAAQg3B,CAEZ,CACIpE,EAAI,KACFyF,IAAaC,EACft4B,GAAQ,GACC4yB,EAAI,IAAsC,KAAV5yB,GAAgBA,KAAU8d,EAAAA,EAAAA,IAAUld,KAC7EZ,GAAQ,GAGd,CACA,OAAOA,CACT,CACA,SAASw4B,GAAsBta,EAAMhE,EAAYiE,GAAU,GACzD,MAAMC,EAAQlE,EAAWgb,WACnB5W,EAASF,EAAM9P,IAAI4P,GACzB,GAAII,EACF,OAAOA,EAET,MAAMtH,EAAMkH,EAAKnB,MACXyB,EAAa,CAAC,EACdwZ,EAAe,GACrB,IAAIvZ,GAAa,EACjB,KAA4BxG,EAAAA,EAAAA,IAAWiG,GAAO,CAC5C,MAAMua,EAAe9Z,IACnBF,GAAa,EACb,MAAO1B,EAAOzU,GAAQkwB,GAAsB7Z,EAAMzE,GAAY,IAC9D2E,EAAAA,EAAAA,IAAOL,EAAYzB,GACfzU,GACF0vB,EAAar5B,QAAQ2J,EAAK,GAEzB6V,GAAWjE,EAAW4E,OAAO7iB,QAChCie,EAAW4E,OAAO5V,QAAQuvB,GAExBva,EAAKa,SACP0Z,EAAYva,EAAKa,SAEfb,EAAKY,QACPZ,EAAKY,OAAO5V,QAAQuvB,EAExB,CACA,IAAKzhB,IAAQyH,EAIX,OAHI7V,EAAAA,EAAAA,IAASsV,IACXE,EAAMlP,IAAIgP,EAAMwa,EAAAA,IAEXA,EAAAA,GAET,IAAI56B,EAAAA,EAAAA,IAAQkZ,GACV,IAAK,IAAIhb,EAAI,EAAGA,EAAIgb,EAAI/a,OAAQD,IAAK,CAC/B,EAGJ,MAAM28B,GAAgB9a,EAAAA,EAAAA,IAAS7G,EAAIhb,IAC/B48B,GAAiBD,KACnBna,EAAWma,GAAiB3b,EAAAA,GAEhC,MACK,GAAIhG,EAAK,CACV,EAGJ,IAAK,MAAMpW,KAAOoW,EAAK,CACrB,MAAM2hB,GAAgB9a,EAAAA,EAAAA,IAASjd,GAC/B,GAAIg4B,GAAiBD,GAAgB,CACnC,MAAM/F,EAAM5b,EAAIpW,GACVH,EAAO+d,EAAWma,IAAiB76B,EAAAA,EAAAA,IAAQ80B,KAAQ3a,EAAAA,EAAAA,IAAW2a,GAAO,CAAEjvB,KAAMivB,IAAQ/T,EAAAA,EAAAA,IAAO,CAAC,EAAG+T,GACtG,GAAInyB,EAAM,CACR,MAAMo4B,EAAeC,GAAavQ,QAAS9nB,EAAKkD,MAC1Co1B,EAAcD,GAAat8B,OAAQiE,EAAKkD,MAC9ClD,EAAK,GAAsBo4B,GAAgB,EAC3Cp4B,EAAK,GAA0Bs4B,EAAc,GAAKF,EAAeE,GAC7DF,GAAgB,IAAKxmB,EAAAA,EAAAA,IAAO5R,EAAM,aACpCu3B,EAAar5B,KAAKg6B,EAEtB,CACF,CACF,CACF,CACA,MAAM1wB,EAAM,CAACuW,EAAYwZ,GAIzB,OAHIpvB,EAAAA,EAAAA,IAASsV,IACXE,EAAMlP,IAAIgP,EAAMjW,GAEXA,CACT,CACA,SAAS2wB,GAAiBh4B,GACxB,MAAe,MAAXA,EAAI,EAMV,CACA,SAASo4B,GAAQC,GACf,MAAMv3B,EAAQu3B,GAAQA,EAAKC,WAAWx3B,MAAM,8BAC5C,OAAOA,EAAQA,EAAM,GAAc,OAATu3B,EAAgB,OAAS,EACrD,CACA,SAASE,GAAWhxB,EAAGC,GACrB,OAAO4wB,GAAQ7wB,KAAO6wB,GAAQ5wB,EAChC,CACA,SAAS0wB,GAAan1B,EAAMy1B,GAC1B,OAAIt7B,EAAAA,EAAAA,IAAQs7B,GACHA,EAAcC,WAAWnvB,GAAMivB,GAAWjvB,EAAGvG,MAC3CsU,EAAAA,EAAAA,IAAWmhB,IACbD,GAAWC,EAAez1B,GAAQ,GAEnC,CACV,CAyGA,MAAM21B,GAAiB14B,GAAmB,MAAXA,EAAI,IAAsB,YAARA,EAC3C24B,GAAsBv5B,IAAUlC,EAAAA,EAAAA,IAAQkC,GAASA,EAAM8H,IAAIoZ,IAAkB,CAACA,GAAelhB,IAC7Fw5B,GAAgBA,CAAC54B,EAAK64B,EAAS7Z,KACnC,GAAI6Z,EAAQ3Z,GACV,OAAO2Z,EAET,MAAMjb,EAAamB,GAAQ,IAAItO,IAMtBkoB,GAAmBE,KAAWpoB,KACpCuO,GAEH,OADApB,EAAW2B,IAAK,EACT3B,CAAU,EAEbkb,GAAuBA,CAACC,EAAUnZ,EAAOpH,KAC7C,MAAMwG,EAAM+Z,EAASC,KACrB,IAAK,MAAMh5B,KAAO+4B,EAAU,CAC1B,GAAIL,GAAc14B,GAChB,SACF,MAAMZ,EAAQ25B,EAAS/4B,GACvB,IAAIqX,EAAAA,EAAAA,IAAWjY,GACbwgB,EAAM5f,GAAO44B,GAAc54B,EAAKZ,EAAO4f,QAClC,GAAa,MAAT5f,EAAe,CACpB,EAKJ,MAAMwe,EAAa+a,GAAmBv5B,GACtCwgB,EAAM5f,GAAO,IAAM4d,CACrB,CACF,GAEIqb,GAAsBA,CAACzgB,EAAUgJ,KAMrC,MAAM5D,EAAa+a,GAAmBnX,GACtChJ,EAASoH,MAAMiJ,QAAU,IAAMjL,CAAU,EAErCsb,GAAYA,CAAC1gB,EAAUgJ,KAC3B,GAA+B,GAA3BhJ,EAASO,MAAMoH,UAAgB,CACjC,MAAMpd,EAAOye,EAASnb,EAClBtD,GACFyV,EAASoH,OAAQjP,EAAAA,EAAAA,IAAM6Q,IACvBlL,EAAAA,EAAAA,IAAIkL,EAAU,IAAKze,IAEnB+1B,GACEtX,EACAhJ,EAASoH,MAAQ,CAAC,EAExB,MACEpH,EAASoH,MAAQ,CAAC,EACd4B,GACFyX,GAAoBzgB,EAAUgJ,IAGlClL,EAAAA,EAAAA,IAAIkC,EAASoH,MAAO6W,GAAmB,EAAE,EAErC0C,GAAcA,CAAC3gB,EAAUgJ,EAAUF,KACvC,MAAM,MAAEvI,EAAK,MAAE6G,GAAUpH,EACzB,IAAI4gB,GAAoB,EACpBC,EAA2Bjd,EAAAA,GAC/B,GAAsB,GAAlBrD,EAAMoH,UAAgB,CACxB,MAAMpd,EAAOye,EAASnb,EAClBtD,EAISue,GAAsB,IAATve,EACtBq2B,GAAoB,IAEpBnb,EAAAA,EAAAA,IAAO2B,EAAO4B,GACTF,GAAsB,IAATve,UACT6c,EAAMvZ,IAIjB+yB,GAAqB5X,EAASO,QAC9B+W,GAAqBtX,EAAU5B,IAEjCyZ,EAA2B7X,CAC7B,MAAWA,IACTyX,GAAoBzgB,EAAUgJ,GAC9B6X,EAA2B,CAAExQ,QAAS,IAExC,GAAIuQ,EACF,IAAK,MAAMp5B,KAAO4f,EACX8Y,GAAc14B,IAAyC,MAAjCq5B,EAAyBr5B,WAC3C4f,EAAM5f,EAGnB,EAGF,SAASs5B,GAAOC,EAAQC,EAAWC,EAAgB1gB,EAAO2gB,GAAY,GACpE,IAAIx8B,EAAAA,EAAAA,IAAQq8B,GAUV,YATAA,EAAOjxB,SACL,CAACoP,EAAGtc,IAAMk+B,GACR5hB,EACA8hB,KAAct8B,EAAAA,EAAAA,IAAQs8B,GAAaA,EAAUp+B,GAAKo+B,GAClDC,EACA1gB,EACA2gB,KAKN,GAAI5N,GAAe/S,KAAW2gB,EAC5B,OAEF,MAAMC,EAA6B,EAAlB5gB,EAAMoH,UAAgB8F,GAAelN,EAAM2I,YAAc3I,EAAM2I,UAAU1L,MAAQ+C,EAAMqJ,GAClGhjB,EAAQs6B,EAAY,KAAOC,GACzBv+B,EAAGw+B,EAAOliB,EAAGC,GAAQ4hB,EAO7B,MAAMM,EAASL,GAAaA,EAAU9hB,EAChCmX,EAAO+K,EAAM/K,OAASzS,EAAAA,GAAYwd,EAAM/K,KAAO,CAAC,EAAI+K,EAAM/K,KAC1D7O,EAAa4Z,EAAM5Z,WAWzB,GAVc,MAAV6Z,GAAkBA,IAAWliB,KAC3BiF,EAAAA,EAAAA,IAASid,IACXhL,EAAKgL,GAAU,MACXpoB,EAAAA,EAAAA,IAAOuO,EAAY6Z,KACrB7Z,EAAW6Z,GAAU,QAEdjoB,EAAAA,EAAAA,IAAMioB,KACfA,EAAOz6B,MAAQ,QAGfiY,EAAAA,EAAAA,IAAWM,GACbY,EAAsBZ,EAAKiiB,EAAO,GAAI,CAACx6B,EAAOyvB,QACzC,CACL,MAAMiL,GAAYld,EAAAA,EAAAA,IAASjF,GACrBoiB,GAASnoB,EAAAA,EAAAA,IAAM+F,GACfqiB,EAAST,EAAOhwB,EACtB,GAAIuwB,GAAaC,EAAQ,CACvB,MAAME,EAAQA,KACZ,GAAID,EAAQ,CACV,MAAME,EAAWJ,GAAYroB,EAAAA,EAAAA,IAAOuO,EAAYrI,GAAOqI,EAAWrI,GAAOkX,EAAKlX,GAAOA,EAAIvY,MACrFs6B,GACFx8B,EAAAA,EAAAA,IAAQg9B,KAAa9U,EAAAA,EAAAA,IAAO8U,EAAUP,IAEjCz8B,EAAAA,EAAAA,IAAQg9B,GAWDA,EAASryB,SAAS8xB,IAC5BO,EAASn8B,KAAK47B,GAXVG,GACFjL,EAAKlX,GAAO,CAACgiB,IACTloB,EAAAA,EAAAA,IAAOuO,EAAYrI,KACrBqI,EAAWrI,GAAOkX,EAAKlX,MAGzBA,EAAIvY,MAAQ,CAACu6B,GACTJ,EAAO3xB,IACTinB,EAAK0K,EAAO3xB,GAAK+P,EAAIvY,OAM/B,MAAW06B,GACTjL,EAAKlX,GAAOvY,GACRqS,EAAAA,EAAAA,IAAOuO,EAAYrI,KACrBqI,EAAWrI,GAAOvY,IAEX26B,IACTpiB,EAAIvY,MAAQA,EACRm6B,EAAO3xB,IACTinB,EAAK0K,EAAO3xB,GAAKxI,GACkC,EAIrDs6B,GAAaM,EACfC,KAEAA,EAAM3f,IAAM,EACZ6K,GAAsB8U,EAAOR,GAEjC,MAAW,CAGb,CACF,CA2mBA,SAASU,KAUgD,mBAA5CC,2CAETC,EAAAA,EAAAA,MAAgBD,yCAA0C,EAU9D,CAEA,MAAMjV,GAAwB7B,EAC9B,SAASgX,GAAejc,GACtB,OAAOkc,GAAmBlc,EAC5B,CAIA,SAASkc,GAAmBlc,EAASmc,GAEjCL,KAEF,MAAM56B,GAAS86B,EAAAA,EAAAA,MACf96B,EAAOk7B,SAAU,EAIjB,MACEC,OAAQC,EACRvV,OAAQwV,EACRC,UAAWC,EACXC,cAAeC,EACfC,WAAYC,EACZC,cAAeC,EACfC,QAASC,EACTC,eAAgBC,EAChBC,WAAYC,EACZC,YAAaC,EACbC,WAAYC,EAAiBxkB,EAAAA,GAC7BykB,oBAAqBC,GACnB3d,EACE4d,EAAQA,CAACC,EAAIC,EAAIC,EAAWC,EAAS,KAAMC,EAAkB,KAAM7C,EAAiB,KAAM3D,OAAY,EAAQyG,EAAe,KAAMjb,IAAmF6a,EAAGK,mBAC7N,GAAIN,IAAOC,EACT,OAEED,IAAOtS,GAAgBsS,EAAIC,KAC7BE,EAASI,EAAgBP,GACzBlG,EAAQkG,EAAII,EAAiB7C,GAAgB,GAC7CyC,EAAK,OAEe,IAAlBC,EAAGta,YACLP,GAAY,EACZ6a,EAAGK,gBAAkB,MAEvB,MAAM,KAAEz5B,EAAI,IAAE4U,EAAG,UAAEwI,GAAcgc,EACjC,OAAQp5B,GACN,KAAK25B,GACHC,EAAYT,EAAIC,EAAIC,EAAWC,GAC/B,MACF,KAAK1b,GACHic,EAAmBV,EAAIC,EAAIC,EAAWC,GACtC,MACF,KAAKQ,GACO,MAANX,GACFY,EAAgBX,EAAIC,EAAWC,EAAQvG,GAIzC,MACF,KAAKnK,GACHoR,EACEb,EACAC,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAEF,MACF,QACkB,EAAZnB,EACF6c,EACEd,EACAC,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAEmB,EAAZnB,EACT8c,EACEf,EACAC,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,IAEmB,GAAZnB,GAaY,IAAZA,IAZTpd,EAAKvC,QACH07B,EACAC,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,EACA4b,IAmBG,MAAPvlB,GAAe2kB,GACjBhD,GAAO3hB,EAAKukB,GAAMA,EAAGvkB,IAAK8hB,EAAgB0C,GAAMD,GAAKC,EACvD,EAEIQ,EAAcA,CAACT,EAAIC,EAAIC,EAAWC,KACtC,GAAU,MAANH,EACFvB,EACEwB,EAAG/Z,GAAK8Y,EAAeiB,EAAG3a,UAC1B4a,EACAC,OAEG,CACL,MAAMja,EAAK+Z,EAAG/Z,GAAK8Z,EAAG9Z,GAClB+Z,EAAG3a,WAAa0a,EAAG1a,UACrB8Z,EAAYlZ,EAAI+Z,EAAG3a,SAEvB,GAEIob,EAAqBA,CAACV,EAAIC,EAAIC,EAAWC,KACnC,MAANH,EACFvB,EACEwB,EAAG/Z,GAAKgZ,EAAkBe,EAAG3a,UAAY,IACzC4a,EACAC,GAGFF,EAAG/Z,GAAK8Z,EAAG9Z,EACb,EAEI0a,EAAkBA,CAACX,EAAIC,EAAWC,EAAQvG,MAC7CqG,EAAG/Z,GAAI+Z,EAAGE,QAAUL,EACnBG,EAAG3a,SACH4a,EACAC,EACAvG,EACAqG,EAAG/Z,GACH+Z,EAAGE,OACJ,EAiBGc,EAAiBA,EAAG/a,KAAIia,UAAUD,EAAWT,KACjD,IAAIxnB,EACJ,MAAOiO,GAAMA,IAAOia,EAClBloB,EAAOynB,EAAgBxZ,GACvBuY,EAAWvY,EAAIga,EAAWT,GAC1BvZ,EAAKjO,EAEPwmB,EAAW0B,EAAQD,EAAWT,EAAY,EAEtCyB,EAAmBA,EAAGhb,KAAIia,aAC9B,IAAIloB,EACJ,MAAOiO,GAAMA,IAAOia,EAClBloB,EAAOynB,EAAgBxZ,GACvBwY,EAAWxY,GACXA,EAAKjO,EAEPymB,EAAWyB,EAAO,EAEdW,EAAiBA,CAACd,EAAIC,EAAIC,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KAC3F,QAAZ6a,EAAGp5B,KACL+yB,EAAY,MACS,SAAZqG,EAAGp5B,OACZ+yB,EAAY,UAEJ,MAANoG,EACFmB,EACElB,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAGFgc,EACEpB,EACAC,EACAG,EACA7C,EACA3D,EACAyG,EACAjb,EAEJ,EAEI+b,EAAeA,CAACtkB,EAAOqjB,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KACxG,IAAIc,EACAmb,EACJ,MAAM,MAAEphB,EAAK,UAAEgE,EAAS,WAAEe,EAAU,KAAEF,GAASjI,EAyB/C,GAxBAqJ,EAAKrJ,EAAMqJ,GAAK4Y,EACdjiB,EAAMhW,KACN+yB,EACA3Z,GAASA,EAAMqhB,GACfrhB,GAEc,EAAZgE,EACFqb,EAAmBpZ,EAAIrJ,EAAMyI,UACR,GAAZrB,GACTsd,EACE1kB,EAAMyI,SACNY,EACA,KACAka,EACA7C,EACAiE,GAAyB3kB,EAAO+c,GAChCyG,EACAjb,GAGAN,GACFwF,GAAoBzN,EAAO,KAAMujB,EAAiB,WAEpDT,EAAWzZ,EAAIrJ,EAAOA,EAAM4kB,QAASpB,EAAcD,GAC/CngB,EAAO,CACT,IAAK,MAAMnc,KAAOmc,EACJ,UAARnc,IAAoBs3B,EAAAA,EAAAA,IAAet3B,IACrC86B,EACE1Y,EACApiB,EACA,KACAmc,EAAMnc,GACN81B,EACA/c,EAAMyI,SACN8a,EACA7C,EACAmE,GAIF,UAAWzhB,GACb2e,EAAc1Y,EAAI,QAAS,KAAMjG,EAAM/c,MAAO02B,IAE5CyH,EAAYphB,EAAM0hB,qBACpBC,GAAgBP,EAAWjB,EAAiBvjB,EAEhD,CAWIiI,GACFwF,GAAoBzN,EAAO,KAAMujB,EAAiB,eAEpD,MAAMyB,EAA0BC,GAAevE,EAAgBvY,GAC3D6c,GACF7c,EAAWwJ,YAAYtI,GAEzBuY,EAAWvY,EAAIga,EAAWC,KACrBkB,EAAYphB,GAASA,EAAM8hB,iBAAmBF,GAA2B/c,IAC5EmE,IAAsB,KACpBoY,GAAaO,GAAgBP,EAAWjB,EAAiBvjB,GACzDglB,GAA2B7c,EAAW0J,MAAMxI,GAC5CpB,GAAQwF,GAAoBzN,EAAO,KAAMujB,EAAiB,UAAU,GACnE7C,EACL,EAEIoC,EAAaA,CAACzZ,EAAIrJ,EAAO4kB,EAASpB,EAAcD,KAIpD,GAHIqB,GACF7B,EAAe1Z,EAAIub,GAEjBpB,EACF,IAAK,IAAInhC,EAAI,EAAGA,EAAImhC,EAAalhC,OAAQD,IACvC0gC,EAAe1Z,EAAIma,EAAanhC,IAGpC,GAAIkhC,EAAiB,CACnB,IAAIja,EAAUia,EAAgBja,QAI9B,GAAItJ,IAAUsJ,EAAS,CACrB,MAAM6b,EAAc5B,EAAgBvjB,MACpC8iB,EACEzZ,EACA8b,EACAA,EAAYP,QACZO,EAAY3B,aACZD,EAAgBtxB,OAEpB,CACF,GAEIyyB,EAAgBA,CAACjc,EAAU4a,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,EAAW/G,EAAQ,KAC/H,IAAK,IAAInf,EAAImf,EAAOnf,EAAIomB,EAASnmB,OAAQD,IAAK,CAC5C,MAAM2tB,EAAQvH,EAASpmB,GAAKkmB,EAAY6c,GAAe3c,EAASpmB,IAAMklB,GAAekB,EAASpmB,IAC9F6gC,EACE,KACAlT,EACAqT,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,EAEJ,GAEIgc,EAAeA,CAACpB,EAAIC,EAAIG,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KACtF,MAAMc,EAAK+Z,EAAG/Z,GAAK8Z,EAAG9Z,GACtB,IAAI,UAAEP,EAAS,gBAAE2a,EAAe,KAAExb,GAASmb,EAC3Cta,GAA4B,GAAfqa,EAAGra,UAChB,MAAMuc,EAAWlC,EAAG/f,OAASC,EAAAA,GACvBiiB,EAAWlC,EAAGhgB,OAASC,EAAAA,GAC7B,IAAImhB,EAwCJ,GAvCAjB,GAAmBgC,GAAchC,GAAiB,IAC9CiB,EAAYc,EAASE,sBACvBT,GAAgBP,EAAWjB,EAAiBH,EAAID,GAE9Clb,GACFwF,GAAoB2V,EAAID,EAAII,EAAiB,gBAE/CA,GAAmBgC,GAAchC,GAAiB,GAM9CE,EACFgC,EACEtC,EAAGM,gBACHA,EACApa,EACAka,EACA7C,EACAiE,GAAyBvB,EAAIrG,GAC7ByG,GAKQjb,GACVmd,EACEvC,EACAC,EACA/Z,EACA,KACAka,EACA7C,EACAiE,GAAyBvB,EAAIrG,GAC7ByG,GACA,GAGA1a,EAAY,EAAG,CACjB,GAAgB,GAAZA,EACF6c,EACEtc,EACA+Z,EACAiC,EACAC,EACA/B,EACA7C,EACA3D,QAWF,GARgB,EAAZjU,GACEuc,EAASO,QAAUN,EAASM,OAC9B7D,EAAc1Y,EAAI,QAAS,KAAMic,EAASM,MAAO7I,GAGrC,EAAZjU,GACFiZ,EAAc1Y,EAAI,QAASgc,EAASQ,MAAOP,EAASO,MAAO9I,GAE7C,EAAZjU,EAAe,CACjB,MAAMqV,EAAgBiF,EAAGla,aACzB,IAAK,IAAI7mB,EAAI,EAAGA,EAAI87B,EAAc77B,OAAQD,IAAK,CAC7C,MAAM4E,EAAMk3B,EAAc97B,GACpBujB,EAAOyf,EAASp+B,GAChBmU,EAAOkqB,EAASr+B,GAClBmU,IAASwK,GAAgB,UAAR3e,GACnB86B,EACE1Y,EACApiB,EACA2e,EACAxK,EACA2hB,EACAoG,EAAG1a,SACH8a,EACA7C,EACAmE,EAGN,CACF,CAEc,EAAZ/b,GACEqa,EAAG1a,WAAa2a,EAAG3a,UACrBga,EAAmBpZ,EAAI+Z,EAAG3a,SAGhC,MAAYF,GAAgC,MAAnBkb,GACvBkC,EACEtc,EACA+Z,EACAiC,EACAC,EACA/B,EACA7C,EACA3D,KAGCyH,EAAYc,EAASQ,iBAAmB7d,IAC3CmE,IAAsB,KACpBoY,GAAaO,GAAgBP,EAAWjB,EAAiBH,EAAID,GAC7Dlb,GAAQwF,GAAoB2V,EAAID,EAAII,EAAiB,UAAU,GAC9D7C,EACL,EAEI+E,EAAqBA,CAACM,EAAaC,EAAaC,EAAmB1C,EAAiB7C,EAAgB3D,EAAWyG,KACnH,IAAK,IAAInhC,EAAI,EAAGA,EAAI2jC,EAAY1jC,OAAQD,IAAK,CAC3C,MAAM6jC,EAAWH,EAAY1jC,GACvB8jC,EAAWH,EAAY3jC,GACvBghC,EAGJ6C,EAAS7c,KAER6c,EAASl8B,OAAS4oB,KAElB/B,GAAgBqV,EAAUC,IACN,GAArBD,EAAS9e,WAAwBub,EAAeuD,EAAS7c,IAGvD4c,EAGJ/C,EACEgD,EACAC,EACA9C,EACA,KACAE,EACA7C,EACA3D,EACAyG,GACA,EAEJ,GAEImC,EAAaA,CAACtc,EAAIrJ,EAAOqlB,EAAUC,EAAU/B,EAAiB7C,EAAgB3D,KAClF,GAAIsI,IAAaC,EAAU,CACzB,GAAID,IAAahiB,EAAAA,GACf,IAAK,MAAMpc,KAAOo+B,GACX9G,EAAAA,EAAAA,IAAet3B,IAAUA,KAAOq+B,GACnCvD,EACE1Y,EACApiB,EACAo+B,EAASp+B,GACT,KACA81B,EACA/c,EAAMyI,SACN8a,EACA7C,EACAmE,GAKR,IAAK,MAAM59B,KAAOq+B,EAAU,CAC1B,IAAI/G,EAAAA,EAAAA,IAAet3B,GACjB,SACF,MAAMmU,EAAOkqB,EAASr+B,GAChB2e,EAAOyf,EAASp+B,GAClBmU,IAASwK,GAAgB,UAAR3e,GACnB86B,EACE1Y,EACApiB,EACA2e,EACAxK,EACA2hB,EACA/c,EAAMyI,SACN8a,EACA7C,EACAmE,EAGN,CACI,UAAWS,GACbvD,EAAc1Y,EAAI,QAASgc,EAASh/B,MAAOi/B,EAASj/B,MAAO02B,EAE/D,GAEIiH,EAAkBA,CAACb,EAAIC,EAAIC,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KAC5G,MAAM6d,EAAsBhD,EAAG/Z,GAAK8Z,EAAKA,EAAG9Z,GAAK8Y,EAAe,IAC1DkE,EAAoBjD,EAAGE,OAASH,EAAKA,EAAGG,OAASnB,EAAe,IACtE,IAAI,UAAErZ,EAAS,gBAAE2a,EAAiBD,aAAc8C,GAAyBlD,EAOrEkD,IACF9C,EAAeA,EAAeA,EAAatb,OAAOoe,GAAwBA,GAElE,MAANnD,GACFvB,EAAWwE,EAAqB/C,EAAWC,GAC3C1B,EAAWyE,EAAmBhD,EAAWC,GACzCoB,EAKEtB,EAAG3a,UAAY,GACf4a,EACAgD,EACA9C,EACA7C,EACA3D,EACAyG,EACAjb,IAGEO,EAAY,GAAiB,GAAZA,GAAkB2a,GAEvCN,EAAGM,iBACDgC,EACEtC,EAAGM,gBACHA,EACAJ,EACAE,EACA7C,EACA3D,EACAyG,IASU,MAAVJ,EAAGn8B,KAAes8B,GAAmBH,IAAOG,EAAgBja,UAE5Did,GACEpD,EACAC,GACA,IAKJsC,EACEvC,EACAC,EACAC,EACAgD,EACA9C,EACA7C,EACA3D,EACAyG,EACAjb,EAGN,EAEI2b,EAAmBA,CAACf,EAAIC,EAAIC,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KAC7G6a,EAAGI,aAAeA,EACR,MAANL,EACiB,IAAfC,EAAGhc,UACLmc,EAAgBtd,IAAIugB,SAClBpD,EACAC,EACAC,EACAvG,EACAxU,GAGFke,EACErD,EACAC,EACAC,EACAC,EACA7C,EACA3D,EACAxU,GAIJme,EAAgBvD,EAAIC,EAAI7a,EAC1B,EAEIke,EAAiBA,CAACE,EAActD,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWxU,KACnG,MAAM9I,EAAYknB,EAAahe,UAAYie,GACzCD,EACApD,EACA7C,GAqBF,GAZIrO,GAAYsU,KACdlnB,EAASwG,IAAI4gB,SAAW1C,IAMxB2C,GAAernB,GAKbA,EAASsnB,UAEX,GADArG,GAAkBA,EAAesG,YAAYvnB,EAAUwnB,IAClDN,EAAatd,GAAI,CACpB,MAAM6d,EAAcznB,EAAS6J,QAAU3B,GAAYC,IACnDic,EAAmB,KAAMqD,EAAa7D,EAAWC,EACnD,OAEA2D,EACExnB,EACAknB,EACAtD,EACAC,EACA5C,EACA3D,EACAxU,EAG4C,EAK5Cme,EAAkBA,CAACvD,EAAIC,EAAI7a,KAC/B,MAAM9I,EAAW2jB,EAAGza,UAAYwa,EAAGxa,UACnC,GAAIP,EAAsB+a,EAAIC,EAAI7a,GAAY,CAC5C,GAAI9I,EAASsnB,WAAatnB,EAAS0nB,cAQjC,YAJAC,EAAyB3nB,EAAU2jB,EAAI7a,GAMvC9I,EAASrE,KAAOgoB,EAChBhhB,EAAc3C,EAAS/O,QACvB+O,EAAS1M,OAAOY,OAAQ,EACxB8L,EAAS/O,QAEb,MACE0yB,EAAG/Z,GAAK8Z,EAAG9Z,GACX5J,EAASO,MAAQojB,CACnB,EAEI6D,EAAoBA,CAACxnB,EAAUknB,EAActD,EAAWC,EAAQ5C,EAAgB3D,EAAWxU,KAC/F,MAAM8e,EAAoBA,KACxB,GAAK5nB,EAASwO,UA0FP,CACL,IAAI,KAAE7S,EAAI,GAAEksB,EAAE,EAAEpkC,EAAC,OAAE+O,EAAM,MAAE+N,GAAUP,EACrC,CACE,MAAM8nB,EAAuBC,GAA2B/nB,GACxD,GAAI8nB,EAUF,OATInsB,IACFA,EAAKiO,GAAKrJ,EAAMqJ,GAChB+d,EAAyB3nB,EAAUrE,EAAMmN,SAE3Cgf,EAAqBR,SAAS3lB,MAAK,KAC5B3B,EAAS0D,aACZkkB,GACF,GAIN,CACA,IACI7C,EADAiD,EAAarsB,EAEb,EAGJmqB,GAAc9lB,GAAU,GACpBrE,GACFA,EAAKiO,GAAKrJ,EAAMqJ,GAChB+d,EAAyB3nB,EAAUrE,EAAMmN,IAEzCnN,EAAO4E,EAELsnB,IACFI,EAAAA,EAAAA,IAAeJ,IAEb9C,EAAYppB,EAAKgI,OAAShI,EAAKgI,MAAMoiB,sBACvCT,GAAgBP,EAAWvyB,EAAQmJ,EAAM4E,GAE3CulB,GAAc9lB,GAAU,GAIxB,MAAMkoB,EAAWlhB,EAAoBhH,GACjC,EAGJ,MAAMmoB,EAAWnoB,EAAS6J,QAC1B7J,EAAS6J,QAAUqe,EAInBzE,EACE0E,EACAD,EAEAhF,EAAeiF,EAASve,IAExBqa,EAAgBkE,GAChBnoB,EACAihB,EACA3D,GAKF3hB,EAAKiO,GAAKse,EAASte,GACA,OAAfoe,GACFre,EAAgB3J,EAAUkoB,EAASte,IAEjCnmB,GACFkpB,GAAsBlpB,EAAGw9B,IAEvB8D,EAAYppB,EAAKgI,OAAShI,EAAKgI,MAAM0iB,iBACvC1Z,IACE,IAAM2Y,GAAgBP,EAAWvyB,EAAQmJ,EAAM4E,IAC/C0gB,EASN,KA3KyB,CACvB,IAAI8D,EACJ,MAAM,GAAEnb,EAAE,MAAEjG,GAAUujB,GAChB,GAAEkB,EAAE,EAAE1N,EAAC,OAAEloB,GAAWwN,EACpBqoB,EAAsB/U,GAAe4T,GAS3C,GARApB,GAAc9lB,GAAU,GACpBooB,IACFH,EAAAA,EAAAA,IAAeG,IAEZC,IAAwBtD,EAAYphB,GAASA,EAAM0hB,qBACtDC,GAAgBP,EAAWvyB,EAAQ00B,GAErCpB,GAAc9lB,GAAU,GACpB4J,GAAM0e,GAAa,CACrB,MAAMC,EAAiBA,KAIrBvoB,EAAS6J,QAAU7C,EAAoBhH,GAOvCsoB,GACE1e,EACA5J,EAAS6J,QACT7J,EACAihB,EACA,KAE8C,EAI9CoH,EACFnB,EAAa38B,KAAKgpB,gBAAgB5R,MAKhC,KAAO3B,EAAS0D,aAAe6kB,MAGjCA,GAEJ,KAAO,CACD,EAGJ,MAAM1e,EAAU7J,EAAS6J,QAAU7C,EAAoBhH,GACnD,EAMJyjB,EACE,KACA5Z,EACA+Z,EACAC,EACA7jB,EACAihB,EACA3D,GAKF4J,EAAatd,GAAKC,EAAQD,EAC5B,CAIA,GAHI8Q,GACF/N,GAAsB+N,EAAGuG,IAEtBoH,IAAwBtD,EAAYphB,GAASA,EAAM8hB,gBAAiB,CACvE,MAAM+C,EAAqBtB,EAC3Bva,IACE,IAAM2Y,GAAgBP,EAAWvyB,EAAQg2B,IACzCvH,EAEJ,EAC6B,IAAzBiG,EAAavf,WAAmBnV,GAAU8gB,GAAe9gB,EAAO+N,QAAmC,IAAzB/N,EAAO+N,MAAMoH,YACzF3H,EAASjR,GAAK4d,GAAsB3M,EAASjR,EAAGkyB,GAElDjhB,EAASwO,WAAY,EAIrB0Y,EAAetD,EAAYC,EAAS,IACtC,CAiFA,EAEIvwB,EAAS0M,EAAS1M,OAAS,IAAIG,EAAAA,GACnCm0B,EACA9oB,EAAAA,IACA,IAAMwD,EAASrR,IACf+O,EAASzM,OAGLtC,EAAS+O,EAAS/O,OAAS,KAC3BqC,EAAOY,OACTZ,EAAOV,KACT,EAEF3B,EAAO6Q,GAAK9B,EAAS5V,IACrB07B,GAAc9lB,GAAU,GAMxB/O,GAAQ,EAEJ02B,EAA2BA,CAAC3nB,EAAU6I,EAAWC,KACrDD,EAAUK,UAAYlJ,EACtB,MAAM+I,EAAY/I,EAASO,MAAMoD,MACjC3D,EAASO,MAAQsI,EACjB7I,EAASrE,KAAO,KAChByiB,GAAYpe,EAAU6I,EAAUlF,MAAOoF,EAAWD,GAClD6X,GAAY3gB,EAAU6I,EAAUG,SAAUF,IAC1C3U,EAAAA,EAAAA,MACA4O,EAAiB/C,IACjBzL,EAAAA,EAAAA,KAAe,EAEX0xB,EAAgBA,CAACvC,EAAIC,EAAIC,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,GAAY,KACtH,MAAM3lB,EAAKugC,GAAMA,EAAG1a,SACdyf,EAAgB/E,EAAKA,EAAG/b,UAAY,EACpCrkB,EAAKqgC,EAAG3a,UACR,UAAEK,EAAS,UAAE1B,GAAcgc,EACjC,GAAIta,EAAY,EAAG,CACjB,GAAgB,IAAZA,EAYF,YAXAqf,EACEvlC,EACAG,EACAsgC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAGG,GAAgB,IAAZO,EAYT,YAXAsf,EACExlC,EACAG,EACAsgC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,EAIN,CACgB,EAAZnB,GACkB,GAAhB8gB,GACFrD,EAAgBjiC,EAAI2gC,EAAiB7C,GAEnC39B,IAAOH,GACT6/B,EAAmBY,EAAWtgC,IAGZ,GAAhBmlC,EACc,GAAZ9gB,EACF+gB,EACEvlC,EACAG,EACAsgC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAGFsc,EAAgBjiC,EAAI2gC,EAAiB7C,GAAgB,IAGnC,EAAhBwH,GACFzF,EAAmBY,EAAW,IAEhB,GAAZjc,GACFsd,EACE3hC,EACAsgC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAIR,EAEI6f,EAAuBA,CAACxlC,EAAIG,EAAIsgC,EAAWC,EAAQC,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KACjH3lB,EAAKA,GAAMm8B,EAAAA,GACXh8B,EAAKA,GAAMg8B,EAAAA,GACX,MAAMsJ,EAAYzlC,EAAGN,OACfqU,EAAY5T,EAAGT,OACfgmC,EAAeC,KAAKC,IAAIH,EAAW1xB,GACzC,IAAItU,EACJ,IAAKA,EAAI,EAAGA,EAAIimC,EAAcjmC,IAAK,CACjC,MAAMomC,EAAY1lC,EAAGV,GAAKkmB,EAAY6c,GAAeriC,EAAGV,IAAMklB,GAAexkB,EAAGV,IAChF6gC,EACEtgC,EAAGP,GACHomC,EACApF,EACA,KACAE,EACA7C,EACA3D,EACAyG,EACAjb,EAEJ,CACI8f,EAAY1xB,EACdkuB,EACEjiC,EACA2gC,EACA7C,GACA,GACA,EACA4H,GAGF5D,EACE3hC,EACAsgC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,EACA+f,EAEJ,EAEIH,EAAqBA,CAACvlC,EAAIG,EAAIsgC,EAAWqF,EAAcnF,EAAiB7C,EAAgB3D,EAAWyG,EAAcjb,KACrH,IAAIlmB,EAAI,EACR,MAAMsmC,EAAK5lC,EAAGT,OACd,IAAIsmC,EAAKhmC,EAAGN,OAAS,EACjBumC,EAAKF,EAAK,EACd,MAAOtmC,GAAKumC,GAAMvmC,GAAKwmC,EAAI,CACzB,MAAM1F,EAAKvgC,EAAGP,GACR+gC,EAAKrgC,EAAGV,GAAKkmB,EAAY6c,GAAeriC,EAAGV,IAAMklB,GAAexkB,EAAGV,IACzE,IAAIwuB,GAAgBsS,EAAIC,GAatB,MAZAF,EACEC,EACAC,EACAC,EACA,KACAE,EACA7C,EACA3D,EACAyG,EACAjb,GAKJlmB,GACF,CACA,MAAOA,GAAKumC,GAAMvmC,GAAKwmC,EAAI,CACzB,MAAM1F,EAAKvgC,EAAGgmC,GACRxF,EAAKrgC,EAAG8lC,GAAMtgB,EAAY6c,GAAeriC,EAAG8lC,IAAOthB,GAAexkB,EAAG8lC,IAC3E,IAAIhY,GAAgBsS,EAAIC,GAatB,MAZAF,EACEC,EACAC,EACAC,EACA,KACAE,EACA7C,EACA3D,EACAyG,EACAjb,GAKJqgB,IACAC,GACF,CACA,GAAIxmC,EAAIumC,GACN,GAAIvmC,GAAKwmC,EAAI,CACX,MAAMC,EAAUD,EAAK,EACfvF,EAASwF,EAAUH,EAAK5lC,EAAG+lC,GAASzf,GAAKqf,EAC/C,MAAOrmC,GAAKwmC,EACV3F,EACE,KACAngC,EAAGV,GAAKkmB,EAAY6c,GAAeriC,EAAGV,IAAMklB,GAAexkB,EAAGV,IAC9DghC,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAEFlmB,GAEJ,OACK,GAAIA,EAAIwmC,EACb,MAAOxmC,GAAKumC,EACV3L,EAAQr6B,EAAGP,GAAIkhC,EAAiB7C,GAAgB,GAChDr+B,QAEG,CACL,MAAM0mC,EAAK1mC,EACL2mC,EAAK3mC,EACL4mC,EAAmC,IAAIlzB,IAC7C,IAAK1T,EAAI2mC,EAAI3mC,GAAKwmC,EAAIxmC,IAAK,CACzB,MAAMomC,EAAY1lC,EAAGV,GAAKkmB,EAAY6c,GAAeriC,EAAGV,IAAMklB,GAAexkB,EAAGV,IAC3D,MAAjBomC,EAAUxhC,KAQZgiC,EAAiB1zB,IAAIkzB,EAAUxhC,IAAK5E,EAExC,CACA,IAAI2O,EACAk4B,EAAU,EACd,MAAMC,EAAcN,EAAKG,EAAK,EAC9B,IAAII,GAAQ,EACRC,EAAmB,EACvB,MAAMC,EAAwB,IAAIplC,MAAMilC,GACxC,IAAK9mC,EAAI,EAAGA,EAAI8mC,EAAa9mC,IAC3BinC,EAAsBjnC,GAAK,EAC7B,IAAKA,EAAI0mC,EAAI1mC,GAAKumC,EAAIvmC,IAAK,CACzB,MAAMknC,EAAY3mC,EAAGP,GACrB,GAAI6mC,GAAWC,EAAa,CAC1BlM,EAAQsM,EAAWhG,EAAiB7C,GAAgB,GACpD,QACF,CACA,IAAI8I,EACJ,GAAqB,MAAjBD,EAAUtiC,IACZuiC,EAAWP,EAAiBt0B,IAAI40B,EAAUtiC,UAE1C,IAAK+J,EAAIg4B,EAAIh4B,GAAK63B,EAAI73B,IACpB,GAAsC,IAAlCs4B,EAAsBt4B,EAAIg4B,IAAanY,GAAgB0Y,EAAWxmC,EAAGiO,IAAK,CAC5Ew4B,EAAWx4B,EACX,KACF,MAGa,IAAbw4B,EACFvM,EAAQsM,EAAWhG,EAAiB7C,GAAgB,IAEpD4I,EAAsBE,EAAWR,GAAM3mC,EAAI,EACvCmnC,GAAYH,EACdA,EAAmBG,EAEnBJ,GAAQ,EAEVlG,EACEqG,EACAxmC,EAAGymC,GACHnG,EACA,KACAE,EACA7C,EACA3D,EACAyG,EACAjb,GAEF2gB,IAEJ,CACA,MAAMO,EAA6BL,EAAQM,GAAYJ,GAAyBvK,EAAAA,GAEhF,IADA/tB,EAAIy4B,EAA2BnnC,OAAS,EACnCD,EAAI8mC,EAAc,EAAG9mC,GAAK,EAAGA,IAAK,CACrC,MAAMsnC,EAAYX,EAAK3mC,EACjBomC,EAAY1lC,EAAG4mC,GACfrG,EAASqG,EAAY,EAAIhB,EAAK5lC,EAAG4mC,EAAY,GAAGtgB,GAAKqf,EAC1B,IAA7BY,EAAsBjnC,GACxB6gC,EACE,KACAuF,EACApF,EACAC,EACAC,EACA7C,EACA3D,EACAyG,EACAjb,GAEO6gB,IACLp4B,EAAI,GAAK3O,IAAMonC,EAA2Bz4B,GAC5C44B,EAAKnB,EAAWpF,EAAWC,EAAQ,GAEnCtyB,IAGN,CACF,GAEI44B,EAAOA,CAAC5pB,EAAOqjB,EAAWC,EAAQuG,EAAUnJ,EAAiB,QACjE,MAAM,GAAErX,EAAE,KAAErf,EAAI,WAAEme,EAAU,SAAEM,EAAQ,UAAErB,GAAcpH,EACtD,GAAgB,EAAZoH,EAEF,YADAwiB,EAAK5pB,EAAM2I,UAAUW,QAAS+Z,EAAWC,EAAQuG,GAGnD,GAAgB,IAAZziB,EAEF,YADApH,EAAMuJ,SAASqgB,KAAKvG,EAAWC,EAAQuG,GAGzC,GAAgB,GAAZziB,EAEF,YADApd,EAAK4/B,KAAK5pB,EAAOqjB,EAAWC,EAAQa,IAGtC,GAAIn6B,IAAS4oB,GAAU,CACrBgP,EAAWvY,EAAIga,EAAWC,GAC1B,IAAK,IAAIjhC,EAAI,EAAGA,EAAIomB,EAASnmB,OAAQD,IACnCunC,EAAKnhB,EAASpmB,GAAIghC,EAAWC,EAAQuG,GAGvC,YADAjI,EAAW5hB,EAAMsjB,OAAQD,EAAWC,EAEtC,CACA,GAAIt5B,IAAS85B,GAEX,YADAM,EAAepkB,EAAOqjB,EAAWC,GAGnC,MAAMwG,EAA+B,IAAbD,GAA8B,EAAZziB,GAAiBe,EAC3D,GAAI2hB,EACF,GAAiB,IAAbD,EACF1hB,EAAWwJ,YAAYtI,GACvBuY,EAAWvY,EAAIga,EAAWC,GAC1BlX,IAAsB,IAAMjE,EAAW0J,MAAMxI,IAAKqX,OAC7C,CACL,MAAM,MAAExO,EAAK,WAAElB,EAAU,WAAED,GAAe5I,EACpC4hB,EAAUA,IAAMnI,EAAWvY,EAAIga,EAAWC,GAC1C0G,EAAeA,KACnB9X,EAAM7I,GAAI,KACR0gB,IACAhZ,GAAcA,GAAY,GAC1B,EAEAC,EACFA,EAAW3H,EAAI0gB,EAASC,GAExBA,GAEJ,MAEApI,EAAWvY,EAAIga,EAAWC,EAC5B,EAEIrG,EAAUA,CAACjd,EAAOujB,EAAiB7C,EAAgBuJ,GAAW,EAAO1hB,GAAY,KACrF,MAAM,KACJve,EAAI,MACJoZ,EAAK,IACLxE,EAAG,SACH6J,EAAQ,gBACRgb,EAAe,UACfrc,EAAS,UACT0B,EAAS,KACTb,GACEjI,EAIJ,GAHW,MAAPpB,GACF2hB,GAAO3hB,EAAK,KAAM8hB,EAAgB1gB,GAAO,GAE3B,IAAZoH,EAEF,YADAmc,EAAgBtd,IAAIikB,WAAWlqB,GAGjC,MAAMmqB,EAA+B,EAAZ/iB,GAAiBa,EACpCmiB,GAAyBrX,GAAe/S,GAC9C,IAAIwkB,EAIJ,GAHI4F,IAA0B5F,EAAYphB,GAASA,EAAMinB,uBACvDtF,GAAgBP,EAAWjB,EAAiBvjB,GAE9B,EAAZoH,EACFkjB,EAAiBtqB,EAAM2I,UAAW+X,EAAgBuJ,OAC7C,CACL,GAAgB,IAAZ7iB,EAEF,YADApH,EAAMuJ,SAAS0T,QAAQyD,EAAgBuJ,GAGrCE,GACF1c,GAAoBzN,EAAO,KAAMujB,EAAiB,iBAEpC,GAAZnc,EACFpH,EAAMhW,KAAKqiB,OACTrM,EACAujB,EACA7C,EACAnY,EACA4b,GACA8F,GAEOxG,IACVz5B,IAAS4oB,IAAY9J,EAAY,GAAiB,GAAZA,GACrC+b,EACEpB,EACAF,EACA7C,GACA,GACA,IAEO12B,IAAS4oB,IAAwB,IAAZ9J,IAA4BP,GAAyB,GAAZnB,IACvEyd,EAAgBpc,EAAU8a,EAAiB7C,GAEzCuJ,GACF5d,EAAOrM,EAEX,EACIoqB,IAA0B5F,EAAYphB,GAASA,EAAMmnB,mBAAqBJ,IAC5E/d,IAAsB,KACpBoY,GAAaO,GAAgBP,EAAWjB,EAAiBvjB,GACzDmqB,GAAoB1c,GAAoBzN,EAAO,KAAMujB,EAAiB,YAAY,GACjF7C,EACL,EAEIrU,EAAUrM,IACd,MAAM,KAAEhW,EAAI,GAAEqf,EAAE,OAAEia,EAAM,WAAEnb,GAAenI,EACzC,GAAIhW,IAAS4oB,GAYX,YAFE4X,EAAenhB,EAAIia,GAIvB,GAAIt5B,IAAS85B,GAEX,YADAO,EAAiBrkB,GAGnB,MAAMyqB,EAAgBA,KACpB5I,EAAWxY,GACPlB,IAAeA,EAAW0G,WAAa1G,EAAW4I,YACpD5I,EAAW4I,YACb,EAEF,GAAsB,EAAlB/Q,EAAMoH,WAAiBe,IAAeA,EAAW0G,UAAW,CAC9D,MAAM,MAAEqD,EAAK,WAAElB,GAAe7I,EACxB6hB,EAAeA,IAAM9X,EAAM7I,EAAIohB,GACjCzZ,EACFA,EAAWhR,EAAMqJ,GAAIohB,EAAeT,GAEpCA,GAEJ,MACES,GACF,EAEID,EAAiBA,CAACvqB,EAAKwB,KAC3B,IAAIrG,EACJ,MAAO6E,IAAQwB,EACbrG,EAAOynB,EAAgB5iB,GACvB4hB,EAAW5hB,GACXA,EAAM7E,EAERymB,EAAWpgB,EAAI,EAEX6oB,EAAmBA,CAAC7qB,EAAUihB,EAAgBuJ,KAIlD,MAAM,IAAES,EAAG,MAAE13B,EAAK,OAAEtC,EAAM,QAAE4Y,EAAO,GAAEqhB,GAAOlrB,EACxCirB,IACFhD,EAAAA,EAAAA,IAAegD,GAEjB13B,EAAMP,OACF/B,IACFA,EAAO0B,QAAS,EAChB6qB,EAAQ3T,EAAS7J,EAAUihB,EAAgBuJ,IAEzCU,GACFve,GAAsBue,EAAIjK,GAE5BtU,IAAsB,KACpB3M,EAAS0D,aAAc,CAAI,GAC1Bud,GACCA,GAAkBA,EAAelW,gBAAkBkW,EAAevd,aAAe1D,EAASsnB,WAAatnB,EAAS0nB,eAAiB1nB,EAASmrB,aAAelK,EAAemK,YAC1KnK,EAAertB,OACa,IAAxBqtB,EAAertB,MACjBqtB,EAAet3B,UAGsD,EAIrEy7B,EAAkBA,CAACpc,EAAU8a,EAAiB7C,EAAgBuJ,GAAW,EAAO1hB,GAAY,EAAO/G,EAAQ,KAC/G,IAAK,IAAInf,EAAImf,EAAOnf,EAAIomB,EAASnmB,OAAQD,IACvC46B,EAAQxU,EAASpmB,GAAIkhC,EAAiB7C,EAAgBuJ,EAAU1hB,EAClE,EAEImb,EAAmB1jB,GACD,EAAlBA,EAAMoH,UACDsc,EAAgB1jB,EAAM2I,UAAUW,SAEnB,IAAlBtJ,EAAMoH,UACDpH,EAAMuJ,SAASnO,OAEjBynB,EAAgB7iB,EAAMsjB,QAAUtjB,EAAMqJ,IAE/C,IAAI3I,GAAa,EACjB,MAAMqG,GAASA,CAAC/G,EAAOqjB,EAAWtG,KACnB,MAAT/c,EACEqjB,EAAUyH,QACZ7N,EAAQoG,EAAUyH,OAAQ,KAAM,MAAM,GAGxC5H,EACEG,EAAUyH,QAAU,KACpB9qB,EACAqjB,EACA,KACA,KACA,KACAtG,GAGCrc,IACHA,GAAa,EACb8B,IACAE,IACAhC,GAAa,GAEf2iB,EAAUyH,OAAS9qB,CAAK,EAEpBmkB,GAAY,CAChB/hC,EAAG8gC,EACHyH,GAAI1N,EACJ9C,EAAGyP,EACHjrB,EAAG0N,EACH0e,GAAItE,EACJuE,GAAItG,EACJuG,GAAIvF,EACJwF,IAAKzF,EACL70B,EAAG8yB,EACHyH,EAAG7lB,GAEL,IAAIoW,GACAqM,GAMJ,OALItG,KACD/F,GAASqM,IAAetG,EACvB0C,KAGG,CACLpd,UACA2U,WACA0P,UAAW3P,GAAa1U,GAAQ2U,IAEpC,CACA,SAASiJ,IAAyB,KAAE36B,EAAI,MAAEoZ,GAASioB,GACjD,MAA4B,QAArBA,GAAuC,kBAATrhC,GAAiD,WAArBqhC,GAA0C,mBAATrhC,GAA6BoZ,GAASA,EAAMkoB,UAAYloB,EAAMkoB,SAASx8B,SAAS,aAAU,EAASu8B,CACvM,CACA,SAAS9F,IAAc,OAAExyB,EAAM,OAAErC,GAAU66B,GACzCx4B,EAAO8C,aAAenF,EAAOmF,aAAe01B,CAC9C,CACA,SAAStG,GAAevE,EAAgBvY,GACtC,QAASuY,GAAkBA,IAAmBA,EAAelW,gBAAkBrC,IAAeA,EAAW0G,SAC3G,CACA,SAAS0X,GAAuBpD,EAAIC,EAAIjrB,GAAU,GAChD,MAAMqzB,EAAMrI,EAAG1a,SACTgjB,EAAMrI,EAAG3a,SACf,IAAItkB,EAAAA,EAAAA,IAAQqnC,KAAQrnC,EAAAA,EAAAA,IAAQsnC,GAC1B,IAAK,IAAIppC,EAAI,EAAGA,EAAImpC,EAAIlpC,OAAQD,IAAK,CACnC,MAAMO,EAAK4oC,EAAInpC,GACf,IAAIU,EAAK0oC,EAAIppC,GACM,EAAfU,EAAGqkB,YAAkBrkB,EAAG0gC,mBACtB1gC,EAAG+lB,WAAa,GAAsB,KAAjB/lB,EAAG+lB,aAC1B/lB,EAAK0oC,EAAIppC,GAAK+iC,GAAeqG,EAAIppC,IACjCU,EAAGsmB,GAAKzmB,EAAGymB,IAERlR,GACHouB,GAAuB3jC,EAAIG,IAE3BA,EAAGiH,OAAS25B,KACd5gC,EAAGsmB,GAAKzmB,EAAGymB,GAKf,CAEJ,CACA,SAASqgB,GAAY/xB,GACnB,MAAMvV,EAAIuV,EAAI8L,QACR3X,EAAS,CAAC,GAChB,IAAIzJ,EAAG2O,EAAG9N,EAAG+Q,EAAG1R,EAChB,MAAMmpC,EAAM/zB,EAAIrV,OAChB,IAAKD,EAAI,EAAGA,EAAIqpC,EAAKrpC,IAAK,CACxB,MAAMspC,EAAOh0B,EAAItV,GACjB,GAAa,IAATspC,EAAY,CAEd,GADA36B,EAAIlF,EAAOA,EAAOxJ,OAAS,GACvBqV,EAAI3G,GAAK26B,EAAM,CACjBvpC,EAAEC,GAAK2O,EACPlF,EAAO9G,KAAK3C,GACZ,QACF,CACAa,EAAI,EACJ+Q,EAAInI,EAAOxJ,OAAS,EACpB,MAAOY,EAAI+Q,EACT1R,EAAIW,EAAI+Q,GAAK,EACT0D,EAAI7L,EAAOvJ,IAAMopC,EACnBzoC,EAAIX,EAAI,EAER0R,EAAI1R,EAGJopC,EAAOh0B,EAAI7L,EAAO5I,MAChBA,EAAI,IACNd,EAAEC,GAAKyJ,EAAO5I,EAAI,IAEpB4I,EAAO5I,GAAKb,EAEhB,CACF,CACAa,EAAI4I,EAAOxJ,OACX2R,EAAInI,EAAO5I,EAAI,GACf,MAAOA,KAAM,EACX4I,EAAO5I,GAAK+Q,EACZA,EAAI7R,EAAE6R,GAER,OAAOnI,CACT,CACA,SAAS07B,GAA2B/nB,GAClC,MAAMmsB,EAAensB,EAAS6J,QAAQX,UACtC,GAAIijB,EACF,OAAIA,EAAa7E,WAAa6E,EAAazE,cAClCyE,EAEApE,GAA2BoE,EAGxC,CAEA,MAAMC,GAAc7hC,GAASA,EAAK8hC,aAkRlC,MAAMlZ,GAAWzc,OAAO2T,IAAI,SACtB6Z,GAAOxtB,OAAO2T,IAAI,SAClBlC,GAAUzR,OAAO2T,IAAI,SACrBga,GAAS3tB,OAAO2T,IAAI,SACpBpC,GAAa,GACnB,IAAIqkB,GAAe,KACnB,SAASC,GAAUC,GAAkB,GACnCvkB,GAAW1iB,KAAK+mC,GAAeE,EAAkB,KAAO,GAC1D,CACA,SAASC,KACPxkB,GAAW7U,MACXk5B,GAAerkB,GAAWA,GAAWplB,OAAS,IAAM,IACtD,CACA,IAAI6pC,GAAqB,EACzB,SAAS7lB,GAAiBjgB,GACxB8lC,IAAsB9lC,CACxB,CACA,SAAS+lC,GAAWpsB,GAMlB,OALAA,EAAMyjB,gBAAkB0I,GAAqB,EAAIJ,IAAgBhN,EAAAA,GAAY,KAC7EmN,KACIC,GAAqB,GAAKJ,IAC5BA,GAAa/mC,KAAKgb,GAEbA,CACT,CACA,SAASqsB,GAAmBriC,EAAMoZ,EAAOqF,EAAUK,EAAWI,EAAc9B,GAC1E,OAAOglB,GACLE,GACEtiC,EACAoZ,EACAqF,EACAK,EACAI,EACA9B,GACA,GAGN,CAaA,SAASmlB,GAAQlmC,GACf,QAAOA,IAA8B,IAAtBA,EAAMmmC,WACvB,CACA,SAAS3b,GAAgBsS,EAAIC,GAM3B,OAAOD,EAAGn5B,OAASo5B,EAAGp5B,MAAQm5B,EAAGl8B,MAAQm8B,EAAGn8B,GAC9C,CAKA,MAKMy2B,GAAqB,cACrB+O,GAAeA,EAAGxlC,SAAiB,MAAPA,EAAcA,EAAM,KAChDylC,GAAeA,EACnB9tB,MACA+tB,UACAC,cAEmB,kBAARhuB,IACTA,EAAM,GAAKA,GAEC,MAAPA,GAAciF,EAAAA,EAAAA,IAASjF,KAAQ/F,EAAAA,EAAAA,IAAM+F,KAAQN,EAAAA,EAAAA,IAAWM,GAAO,CAAEvc,EAAGojB,EAA0B9G,EAAGC,EAAK/P,EAAG89B,EAASn8B,IAAKo8B,GAAYhuB,EAAM,MAElJ,SAAS0tB,GAAgBtiC,EAAMoZ,EAAQ,KAAMqF,EAAW,KAAMK,EAAY,EAAGI,EAAe,KAAM9B,GAAYpd,IAAS4oB,GAAW,EAAI,GAAGia,GAAc,EAAOC,GAAgC,GAC5L,MAAM9sB,EAAQ,CACZwsB,aAAa,EACbO,UAAU,EACV/iC,OACAoZ,QACAnc,IAAKmc,GAASqpB,GAAarpB,GAC3BxE,IAAKwE,GAASspB,GAAatpB,GAC3BwhB,QAASlf,EACT8d,aAAc,KACd/a,WACAE,UAAW,KACXY,SAAU,KACV+I,UAAW,KACXC,WAAY,KACZtK,KAAM,KACNE,WAAY,KACZkB,GAAI,KACJia,OAAQ,KACR98B,OAAQ,KACRwmC,aAAc,KACdC,YAAa,EACb7lB,YACA0B,YACAI,eACAua,gBAAiB,KACjBljB,WAAY,KACZ0F,IAAKR,GAwBP,OAtBIqnB,GACFI,GAAkBltB,EAAOyI,GACT,IAAZrB,GACFpd,EAAKmjC,UAAUntB,IAERyI,IACTzI,EAAMoH,YAAavD,EAAAA,EAAAA,IAAS4E,GAAY,EAAI,IAK1C0jB,GAAqB,IACxBU,GACDd,KAIC/rB,EAAM8I,UAAY,GAAiB,EAAZ1B,IAEJ,KAApBpH,EAAM8I,WACJijB,GAAa/mC,KAAKgb,GAEbA,CACT,CACA,MAAM2H,GAAyFylB,GAC/F,SAASA,GAAapjC,EAAMoZ,EAAQ,KAAMqF,EAAW,KAAMK,EAAY,EAAGI,EAAe,KAAM2jB,GAAc,GAO3G,GANK7iC,GAAQA,IAAS6f,IAIpB7f,EAAO4d,IAEL2kB,GAAQviC,GAAO,CACjB,MAAMqjC,EAASrlB,GACbhe,EACAoZ,GACA,GAcF,OAXIqF,GACFykB,GAAkBG,EAAQ5kB,GAExB0jB,GAAqB,IAAMU,GAAed,KACrB,EAAnBsB,EAAOjmB,UACT2kB,GAAaA,GAAa1pB,QAAQrY,IAASqjC,EAE3CtB,GAAa/mC,KAAKqoC,IAGtBA,EAAOvkB,YAAc,EACdukB,CACT,CAIA,GAHIC,GAAiBtjC,KACnBA,EAAOA,EAAKujC,WAEVnqB,EAAO,CACTA,EAAQoqB,GAAmBpqB,GAC3B,IAAMwiB,MAAO6H,EAAK,MAAE5H,GAAUziB,EAC1BqqB,KAAU5pB,EAAAA,EAAAA,IAAS4pB,KACrBrqB,EAAMwiB,OAAQ8H,EAAAA,EAAAA,IAAeD,KAE3Bx+B,EAAAA,EAAAA,IAAS42B,MACPzoB,EAAAA,EAAAA,IAAQyoB,MAAW1hC,EAAAA,EAAAA,IAAQ0hC,KAC7BA,GAAQ3gB,EAAAA,EAAAA,IAAO,CAAC,EAAG2gB,IAErBziB,EAAMyiB,OAAQ8H,EAAAA,EAAAA,IAAe9H,GAEjC,CACA,MAAMze,GAAYvD,EAAAA,EAAAA,IAAS7Z,GAAQ,EAAIqgB,EAAWrgB,GAAQ,IAAM6hC,GAAW7hC,GAAQ,IAAKiF,EAAAA,EAAAA,IAASjF,GAAQ,GAAIsU,EAAAA,EAAAA,IAAWtU,GAAQ,EAAI,EAUpI,OAAOsiC,GACLtiC,EACAoZ,EACAqF,EACAK,EACAI,EACA9B,EACAylB,GACA,EAEJ,CACA,SAASW,GAAmBpqB,GAC1B,OAAKA,GAEEhG,EAAAA,EAAAA,IAAQgG,IAAUsa,MAAqBta,GAAQ8B,EAAAA,EAAAA,IAAO,CAAC,EAAG9B,GAASA,EADjE,IAEX,CACA,SAAS4E,GAAWhI,EAAO4tB,EAAYC,GAAW,GAChD,MAAM,MAAEzqB,EAAK,IAAExE,EAAG,UAAEkK,EAAS,SAAEL,GAAazI,EACtC8tB,EAAcF,EAAaG,GAAW3qB,GAAS,CAAC,EAAGwqB,GAAcxqB,EACjEiqB,EAAS,CACbb,aAAa,EACbO,UAAU,EACV/iC,KAAMgW,EAAMhW,KACZoZ,MAAO0qB,EACP7mC,IAAK6mC,GAAerB,GAAaqB,GACjClvB,IAAKgvB,GAAcA,EAAWhvB,IAI5BivB,GAAYjvB,GAAMza,EAAAA,EAAAA,IAAQya,GAAOA,EAAIsJ,OAAOwkB,GAAakB,IAAe,CAAChvB,EAAK8tB,GAAakB,IAAelB,GAAakB,GACrHhvB,EACJgmB,QAAS5kB,EAAM4kB,QACfpB,aAAcxjB,EAAMwjB,aACpB/a,SAA8HA,EAC9HjiB,OAAQwZ,EAAMxZ,OACdwmC,aAAchtB,EAAMgtB,aACpBC,YAAajtB,EAAMitB,YACnB7lB,UAAWpH,EAAMoH,UAKjB0B,UAAW8kB,GAAc5tB,EAAMhW,OAAS4oB,IAA0B,IAAf9J,EAAmB,GAAiB,GAAZA,EAAiBA,EAC5FI,aAAclJ,EAAMkJ,aACpBua,gBAAiBzjB,EAAMyjB,gBACvBljB,WAAYP,EAAMO,WAClB0H,KAAMjI,EAAMiI,KACZE,WAAYnI,EAAMmI,WAKlBQ,UAAW3I,EAAM2I,UACjBY,SAAUvJ,EAAMuJ,SAChB+I,UAAWtS,EAAMsS,WAAatK,GAAWhI,EAAMsS,WAC/CC,WAAYvS,EAAMuS,YAAcvK,GAAWhI,EAAMuS,YACjDlJ,GAAIrJ,EAAMqJ,GACVia,OAAQtjB,EAAMsjB,OACdrd,IAAKjG,EAAMiG,IACX+nB,GAAIhuB,EAAMguB,IAEZ,OAAOX,CACT,CAQA,SAASY,GAAgBC,EAAO,IAAKC,EAAO,GAC1C,OAAOxmB,GAAYgc,GAAM,KAAMuK,EAAMC,EACvC,CACA,SAASC,GAAkBC,EAASC,GAClC,MAAMtuB,EAAQ2H,GAAYmc,GAAQ,KAAMuK,GAExC,OADAruB,EAAMitB,YAAcqB,EACbtuB,CACT,CAIA,SAASuH,GAAeyI,GACtB,OAAa,MAATA,GAAkC,mBAAVA,EACnBrI,GAAYC,KACVzjB,EAAAA,EAAAA,IAAQ6rB,GACVrI,GACLiL,GACA,KAEA5C,EAAMvM,SAEkB,kBAAVuM,EACToV,GAAepV,GAEfrI,GAAYgc,GAAM,KAAM9gC,OAAOmtB,GAE1C,CACA,SAASoV,GAAepV,GACtB,OAAoB,OAAbA,EAAM3G,KAAoC,IAArB2G,EAAMlH,WAAoBkH,EAAMue,KAAOve,EAAQhI,GAAWgI,EACxF,CACA,SAASkd,GAAkBltB,EAAOyI,GAChC,IAAIze,EAAO,EACX,MAAM,UAAEod,GAAcpH,EACtB,GAAgB,MAAZyI,EACFA,EAAW,UACN,IAAItkB,EAAAA,EAAAA,IAAQskB,GACjBze,EAAO,QACF,GAAwB,kBAAbye,EAAuB,CACvC,GAAgB,GAAZrB,EAAsB,CACxB,MAAMonB,EAAO/lB,EAASqH,QAMtB,YALI0e,IACFA,EAAKhoB,KAAOgoB,EAAKnoB,IAAK,GACtB6mB,GAAkBltB,EAAOwuB,KACzBA,EAAKhoB,KAAOgoB,EAAKnoB,IAAK,IAG1B,CAAO,CACLrc,EAAO,GACP,MAAMykC,EAAWhmB,EAASnb,EACrBmhC,GAAc/Q,MAAqBjV,EAEhB,IAAbgmB,GAAkBhpB,IACc,IAArCA,EAAyBoB,MAAMvZ,EACjCmb,EAASnb,EAAI,GAEbmb,EAASnb,EAAI,EACb0S,EAAM8I,WAAa,OANrBL,EAASwX,KAAOxa,CASpB,CACF,MAAWnH,EAAAA,EAAAA,IAAWmK,IACpBA,EAAW,CAAEqH,QAASrH,EAAUwX,KAAMxa,GACtCzb,EAAO,KAEPye,EAAW5lB,OAAO4lB,GACF,GAAZrB,GACFpd,EAAO,GACPye,EAAW,CAACwlB,GAAgBxlB,KAE5Bze,EAAO,GAGXgW,EAAMyI,SAAWA,EACjBzI,EAAMoH,WAAapd,CACrB,CACA,SAAS+jC,MAAcr2B,GACrB,MAAMgb,EAAM,CAAC,EACb,IAAK,IAAIrwB,EAAI,EAAGA,EAAIqV,EAAKpV,OAAQD,IAAK,CACpC,MAAMqsC,EAAUh3B,EAAKrV,GACrB,IAAK,MAAM4E,KAAOynC,EAChB,GAAY,UAARznC,EACEyrB,EAAIkT,QAAU8I,EAAQ9I,QACxBlT,EAAIkT,OAAQ8H,EAAAA,EAAAA,IAAe,CAAChb,EAAIkT,MAAO8I,EAAQ9I,cAE5C,GAAY,UAAR3+B,EACTyrB,EAAImT,OAAQ8H,EAAAA,EAAAA,IAAe,CAACjb,EAAImT,MAAO6I,EAAQ7I,aAC1C,IAAItgB,EAAAA,EAAAA,IAAKte,GAAM,CACpB,MAAMk6B,EAAWzO,EAAIzrB,GACf0nC,EAAWD,EAAQznC,IACrB0nC,GAAYxN,IAAawN,IAAcxqC,EAAAA,EAAAA,IAAQg9B,IAAaA,EAASryB,SAAS6/B,KAChFjc,EAAIzrB,GAAOk6B,EAAW,GAAGjZ,OAAOiZ,EAAUwN,GAAYA,EAE1D,KAAmB,KAAR1nC,IACTyrB,EAAIzrB,GAAOynC,EAAQznC,GAGzB,CACA,OAAOyrB,CACT,CACA,SAASqS,GAAgBnX,EAAMnO,EAAUO,EAAOqI,EAAY,MAC1DzI,EAA2BgO,EAAMnO,EAAU,EAAG,CAC5CO,EACAqI,GAEJ,CAEA,MAAMumB,GAAkB5T,KACxB,IAAInxB,GAAM,EACV,SAAS+8B,GAAwB5mB,EAAO/N,EAAQsX,GAC9C,MAAMvf,EAAOgW,EAAMhW,KACbuW,GAActO,EAASA,EAAOsO,WAAaP,EAAMO,aAAequB,GAChEnvB,EAAW,CACf5V,IAAKA,KACLmW,QACAhW,OACAiI,SACAsO,aACAsH,KAAM,KAENzM,KAAM,KACNkO,QAAS,KAETvW,OAAQ,KACRrC,OAAQ,KAERsC,MAAO,IAAIpB,EAAAA,IACT,GAGFmV,OAAQ,KACR9J,MAAO,KACPwc,QAAS,KACToV,YAAa,KACbloB,UAAW,KACX0S,SAAUpnB,EAASA,EAAOonB,SAAW3yB,OAAOkG,OAAO2T,EAAW8Y,UAC9D3C,YAAa,KACb1P,YAAa,GAEb4R,WAAY,KACZ3L,WAAY,KAEZrG,aAAciY,GAAsB70B,EAAMuW,GAC1CwI,aAAczE,EAAsBta,EAAMuW,GAE1CyC,KAAM,KAENqB,QAAS,KAETsZ,cAAeta,EAAAA,GAEf6D,aAAcld,EAAKkd,aAEnBjB,IAAK5C,EAAAA,GACLrW,KAAMqW,EAAAA,GACND,MAAOC,EAAAA,GACPyD,MAAOzD,EAAAA,GACPwD,MAAOxD,EAAAA,GACPyS,KAAMzS,EAAAA,GACN4D,WAAY5D,EAAAA,GACZyrB,aAAc,KACdC,WAAY,KACZC,WAAY,KAEZzlB,WACAqhB,WAAYrhB,EAAWA,EAASshB,UAAY,EAC5C9D,SAAU,KACVI,eAAe,EAGflZ,WAAW,EACX9K,aAAa,EACbyQ,eAAe,EACfqb,GAAI,KACJ1sC,EAAG,KACHslC,GAAI,KACJ1N,EAAG,KACHmN,GAAI,KACJpkC,EAAG,KACHynC,GAAI,KACJD,IAAK,KACLwE,GAAI,KACJ1gC,EAAG,KACH2gC,IAAK,KACLC,IAAK,KACL/uB,GAAI,KACJgvB,GAAI,MAYN,OAPE5vB,EAASwG,IAAM,CAAE3Y,EAAGmS,GAEtBA,EAASoI,KAAO5V,EAASA,EAAO4V,KAAOpI,EACvCA,EAASuD,KAAOA,EAAK3B,KAAK,KAAM5B,GAC5BO,EAAMguB,IACRhuB,EAAMguB,GAAGvuB,GAEJA,CACT,CACA,IAAIuK,GAAkB,KACtB,MAAM4F,GAAqBA,IAAM5F,IAAmBvE,EACpD,IAAI6pB,GACAC,GACJ,CACE,MAAMC,GAAIlO,EAAAA,EAAAA,MACJmO,EAAuBA,CAACxoC,EAAKmX,KACjC,IAAIsxB,EAIJ,OAHMA,EAAUF,EAAEvoC,MAChByoC,EAAUF,EAAEvoC,GAAO,IACrByoC,EAAQ1qC,KAAKoZ,GACLnK,IACFy7B,EAAQptC,OAAS,EACnBotC,EAAQngC,SAASgG,GAAQA,EAAItB,KAE7By7B,EAAQ,GAAGz7B,EAAE,CAChB,EAEHq7B,GAA6BG,EAC1B,4BACAx7B,GAAM+V,GAAkB/V,IAE3Bs7B,GAAqBE,EAClB,uBACAx7B,GAAMgY,GAAwBhY,GAEnC,CACA,MAAMwY,GAAsBhN,IAC1B,MAAMmG,EAAOoE,GAGb,OAFAslB,GAA2B7vB,GAC3BA,EAASzM,MAAMT,KACR,KACLkN,EAASzM,MAAMR,MACf88B,GAA2B1pB,EAAK,CACjC,EAEG+pB,GAAuBA,KAC3B3lB,IAAmBA,GAAgBhX,MAAMR,MACzC88B,GAA2B,KAAK,EAWlC,SAASja,GAAoB5V,GAC3B,OAAkC,EAA3BA,EAASO,MAAMoH,SACxB,CACA,IA4GIwoB,GACAC,GA7GA5jB,IAAwB,EAC5B,SAAS6a,GAAernB,EAAU9B,GAAQ,GACxCA,GAAS4xB,GAAmB5xB,GAC5B,MAAM,MAAEyF,EAAK,SAAEqF,GAAahJ,EAASO,MAC/Byd,EAAapI,GAAoB5V,GACvC+d,GAAU/d,EAAU2D,EAAOqa,EAAY9f,GACvCwiB,GAAU1gB,EAAUgJ,GACpB,MAAMqnB,EAAcrS,EAAasS,GAAuBtwB,EAAU9B,QAAS,EAE3E,OADAA,GAAS4xB,IAAmB,GACrBO,CACT,CACA,SAASC,GAAuBtwB,EAAU9B,GAExC,MAAM+I,EAAYjH,EAASzV,KAuB3ByV,EAASiX,YAA8BhwB,OAAOkG,OAAO,MACrD6S,EAASxC,OAAQK,EAAAA,EAAAA,IAAQ,IAAIJ,MAAMuC,EAASwG,IAAKwQ,KAIjD,MAAM,MAAE9G,GAAUjJ,EAClB,GAAIiJ,EAAO,CACT,MAAMmf,EAAervB,EAASqvB,aAAenf,EAAMrtB,OAAS,EAAI0tC,GAAmBvwB,GAAY,KACzFvP,EAAQuc,GAAmBhN,IACjC7L,EAAAA,EAAAA,MACA,MAAMk8B,EAActwB,EAClBmQ,EACAlQ,EACA,EACA,CACgFA,EAAS2D,MACvF0rB,IAKJ,IAFA96B,EAAAA,EAAAA,MACA9D,KACI2P,EAAAA,EAAAA,IAAUiwB,GAAc,CAE1B,GADAA,EAAY1uB,KAAKuuB,GAAsBA,IACnChyB,EACF,OAAOmyB,EAAY1uB,MAAM6uB,IACvBC,GAAkBzwB,EAAUwwB,EAAgBtyB,EAAM,IACjDlU,OAAOxD,IACR0Z,EAAY1Z,EAAGwZ,EAAU,EAAE,IAG7BA,EAASsnB,SAAW+I,CAQxB,MACEI,GAAkBzwB,EAAUqwB,EAAanyB,EAE7C,MACEwyB,GAAqB1wB,EAAU9B,EAEnC,CACA,SAASuyB,GAAkBzwB,EAAUqwB,EAAanyB,IAC5CW,EAAAA,EAAAA,IAAWwxB,GACTrwB,EAASzV,KAAKomC,kBAChB3wB,EAAS4wB,UAAYP,EAErBrwB,EAASsH,OAAS+oB,GAEX7gC,EAAAA,EAAAA,IAAS6gC,KASlBrwB,EAASwH,YAAa3H,EAAAA,EAAAA,IAAUwwB,IASlCK,GAAqB1wB,EAAU9B,EACjC,CAYA,SAASwyB,GAAqB1wB,EAAU9B,EAAO2yB,GAC7C,MAAM5pB,EAAYjH,EAASzV,KAC3B,IAAKyV,EAASsH,OAAQ,CACpB,IAAKpJ,GAASiyB,KAAYlpB,EAAUK,OAAQ,CAC1C,MAAM7Z,EAAWwZ,EAAUxZ,UAAYipB,GAAqB1W,GAAUvS,SACtE,GAAIA,EAAU,CACR,EAGJ,MAAM,gBAAEqjC,EAAe,gBAAEjV,GAAoB7b,EAASc,WAAWtX,QAC3D,WAAEunC,EAAYlV,gBAAiBmV,GAA6B/pB,EAC5DgqB,GAAuBxrB,EAAAA,EAAAA,KAC3BA,EAAAA,EAAAA,IACE,CACEqrB,kBACAC,cAEFlV,GAEFmV,GAEF/pB,EAAUK,OAAS6oB,GAAQ1iC,EAAUwjC,EAIvC,CACF,CACAjxB,EAASsH,OAASL,EAAUK,QAAUxI,EAAAA,GAClCsxB,IACFA,GAAiBpwB,EAErB,CACiC,CAC/B,MAAMvP,EAAQuc,GAAmBhN,IACjC7L,EAAAA,EAAAA,MACA,IACEyjB,GAAa5X,EACf,CAAE,SACAzL,EAAAA,EAAAA,MACA9D,GACF,CACF,CAUF,CACA,SAASygC,GAAclxB,GACrB,OAAOA,EAASsvB,aAAetvB,EAASsvB,WAAa,IAAI7xB,MACvDuC,EAASqH,MAeL,CACFnS,GAAAA,CAAInO,EAAQS,GAEV,OADAoP,EAAAA,EAAAA,IAAMoJ,EAAU,MAAO,UAChBjZ,EAAOS,EAChB,IAGN,CASA,SAAS+oC,GAAmBvwB,GAC1B,MAAMkZ,EAAUc,IAqBdha,EAASga,QAAUA,GAAW,CAAC,CAAC,EAgBhC,MAAO,CACL,SAAI3S,GACF,OAAO6pB,GAAclxB,EACvB,EACAoH,MAAOpH,EAASoH,MAChB7D,KAAMvD,EAASuD,KACf2V,SAGN,CACA,SAASzL,GAAezN,GACtB,GAAIA,EAASga,QACX,OAAOha,EAASovB,cAAgBpvB,EAASovB,YAAc,IAAI3xB,OAAMoC,EAAAA,EAAAA,KAAUhC,EAAAA,EAAAA,IAAQmC,EAASga,UAAW,CACrG9kB,GAAAA,CAAInO,EAAQS,GACV,OAAIA,KAAOT,EACFA,EAAOS,GACLA,KAAOquB,GACTA,GAAoBruB,GAAKwY,QAD3B,CAGT,EACA7G,GAAAA,CAAIpS,EAAQS,GACV,OAAOA,KAAOT,GAAUS,KAAOquB,EACjC,IAGN,CAGA,SAASpL,GAAiBxD,EAAWkqB,GAAkB,GACrD,OAAOtyB,EAAAA,EAAAA,IAAWoI,GAAaA,EAAUmqB,aAAenqB,EAAU/gB,KAAO+gB,EAAU/gB,MAAQirC,GAAmBlqB,EAAUoqB,MAC1H,CAuBA,SAASxD,GAAiBjnC,GACxB,OAAOiY,EAAAA,EAAAA,IAAWjY,IAAU,cAAeA,CAC7C,CAEA,MAAMyN,GAAWA,CAACoK,EAAiBC,KAC1B4yB,EAAAA,EAAAA,IAAW7yB,EAAiBC,EAAc8N,IAwDnD,SAAS2N,GAAE5vB,EAAMgnC,EAAiBvoB,GAChC,MAAM9V,EAAI4qB,UAAUj7B,OACpB,OAAU,IAANqQ,GACE1D,EAAAA,EAAAA,IAAS+hC,MAAqB7sC,EAAAA,EAAAA,IAAQ6sC,GACpCzE,GAAQyE,GACHrpB,GAAY3d,EAAM,KAAM,CAACgnC,IAE3BrpB,GAAY3d,EAAMgnC,GAElBrpB,GAAY3d,EAAM,KAAMgnC,IAG7Br+B,EAAI,EACN8V,EAAWvkB,MAAMuI,UAAUgX,MAAMzV,KAAKuvB,UAAW,GAClC,IAAN5qB,GAAW45B,GAAQ9jB,KAC5BA,EAAW,CAACA,IAEPd,GAAY3d,EAAMgnC,EAAiBvoB,GAE9C,CA+MA,MAAM6T,GAAU,Q;;;;;;ACp8PhB,MAAM2U,EAAQ,6BACRC,EAAW,qCACXC,EAA0B,qBAAbrpC,SAA2BA,SAAW,KACnDspC,EAAoBD,GAAuBA,EAAInP,cAAc,YAC7DqP,EAAU,CACd1P,OAAQA,CAAC3R,EAAO/d,EAAQqxB,KACtBrxB,EAAOq/B,aAAathB,EAAOsT,GAAU,KAAK,EAE5CjX,OAAS2D,IACP,MAAM/d,EAAS+d,EAAM0S,WACjBzwB,GACFA,EAAOs/B,YAAYvhB,EACrB,EAEFgS,cAAeA,CAACwP,EAAKzU,EAAW0H,EAAIrhB,KAClC,MAAMiG,EAAmB,QAAd0T,EAAsBoU,EAAIM,gBAAgBR,EAAOO,GAAqB,WAAdzU,EAAyBoU,EAAIM,gBAAgBP,EAAUM,GAAOL,EAAInP,cAAcwP,EAAK/M,EAAK,CAAEA,WAAO,GAItK,MAHY,WAAR+M,GAAoBpuB,GAA2B,MAAlBA,EAAMsuB,UACrCroB,EAAGsoB,aAAa,WAAYvuB,EAAMsuB,UAE7BroB,CAAE,EAEX6Y,WAAagM,GAASiD,EAAIS,eAAe1D,GACzC9L,cAAgB8L,GAASiD,EAAI/O,cAAc8L,GAC3C5L,QAASA,CAACuP,EAAM3D,KACd2D,EAAKC,UAAY5D,CAAI,EAEvB1L,eAAgBA,CAACnZ,EAAI6kB,KACnB7kB,EAAG0oB,YAAc7D,CAAI,EAEvBxL,WAAamP,GAASA,EAAKnP,WAC3BE,YAAciP,GAASA,EAAKjP,YAC5BoP,cAAgBC,GAAad,EAAIa,cAAcC,GAC/CnP,UAAAA,CAAWzZ,EAAI9H,GACb8H,EAAGsoB,aAAapwB,EAAI,GACtB,EAKAyhB,mBAAAA,CAAoBqL,EAASp8B,EAAQqxB,EAAQvG,EAAWvb,EAAOC,GAC7D,MAAMywB,EAAS5O,EAASA,EAAO6O,gBAAkBlgC,EAAOmgC,UACxD,GAAI5wB,IAAUA,IAAUC,GAAOD,EAAMohB,cACnC,MAAO,EAEL,GADA3wB,EAAOq/B,aAAa9vB,EAAM6wB,WAAU,GAAO/O,GACvC9hB,IAAUC,KAASD,EAAQA,EAAMohB,aACnC,UAEC,CACLwO,EAAkBkB,UAA0B,QAAdvV,EAAuB,QAAOsR,UAAgC,WAAdtR,EAA0B,SAAQsR,WAAmBA,EACnI,MAAMnhC,EAAWkkC,EAAkB/C,QACnC,GAAkB,QAAdtR,GAAqC,WAAdA,EAAwB,CACjD,MAAMwV,EAAUrlC,EAASslC,WACzB,MAAOD,EAAQC,WACbtlC,EAASulC,YAAYF,EAAQC,YAE/BtlC,EAASqkC,YAAYgB,EACvB,CACAtgC,EAAOq/B,aAAapkC,EAAUo2B,EAChC,CACA,MAAO,CAEL4O,EAASA,EAAOtP,YAAc3wB,EAAOugC,WAErClP,EAASA,EAAO6O,gBAAkBlgC,EAAOmgC,UAE7C,GAGIM,EAAa,aACbC,EAAY,YACZC,EAASz8B,OAAO,QAChB08B,EAAaA,CAACzvB,GAASyD,YAAY+S,EAAAA,EAAAA,GAAEvI,EAAAA,GAAgByhB,EAAuB1vB,GAAQyD,GAC1FgsB,EAAWhC,YAAc,aACzB,MAAMkC,EAA+B,CACnCptC,KAAM9C,OACNmH,KAAMnH,OACNmwC,IAAK,CACHhpC,KAAM4kB,QACNkB,SAAS,GAEXmjB,SAAU,CAACpwC,OAAQ+T,OAAQlQ,QAC3BwsC,eAAgBrwC,OAChBswC,iBAAkBtwC,OAClBuwC,aAAcvwC,OACdwwC,gBAAiBxwC,OACjBywC,kBAAmBzwC,OACnB0wC,cAAe1wC,OACf2wC,eAAgB3wC,OAChB4wC,iBAAkB5wC,OAClB6wC,aAAc7wC,QAEV8wC,EAA4Bd,EAAWzvB,OAAwB8B,EAAAA,EAAAA,IACnE,CAAC,EACDuJ,EAAAA,GACAskB,GAEIzhB,EAAWA,CAAC1D,EAAMlW,EAAO,OACzBvT,EAAAA,EAAAA,IAAQypB,GACVA,EAAKre,SAASqkC,GAAOA,KAAMl8B,KAClBkW,GACTA,KAAQlW,EACV,EAEIm8B,EAAuBjmB,KACpBA,KAAOzpB,EAAAA,EAAAA,IAAQypB,GAAQA,EAAK9F,MAAM8rB,GAAOA,EAAGtxC,OAAS,IAAKsrB,EAAKtrB,OAAS,GAEjF,SAASwwC,EAAuB5iB,GAC9B,MAAM4jB,EAAY,CAAC,EACnB,IAAK,MAAM7sC,KAAOipB,EACVjpB,KAAO8rC,IACXe,EAAU7sC,GAAOipB,EAASjpB,IAG9B,IAAqB,IAAjBipB,EAAS8iB,IACX,OAAOc,EAET,MAAM,KACJnuC,EAAO,IAAG,KACVqE,EAAI,SACJipC,EAAQ,eACRC,EAAkB,GAAEvtC,eAAiB,iBACrCwtC,EAAoB,GAAExtC,iBAAmB,aACzCytC,EAAgB,GAAEztC,aAAe,gBACjC0tC,EAAkBH,EAAc,kBAChCI,EAAoBH,EAAgB,cACpCI,EAAgBH,EAAY,eAC5BI,EAAkB,GAAE7tC,eAAiB,iBACrC8tC,EAAoB,GAAE9tC,iBAAmB,aACzC+tC,EAAgB,GAAE/tC,cAChBuqB,EACE6jB,EAAYC,EAAkBf,GAC9BgB,EAAgBF,GAAaA,EAAU,GACvCG,EAAgBH,GAAaA,EAAU,IACvC,cACJjlB,EAAa,QACbC,EAAO,iBACPE,EAAgB,QAChBE,EAAO,iBACPE,EAAgB,eAChBC,EAAiBR,EAAa,SAC9BS,EAAWR,EAAO,kBAClBU,EAAoBR,GAClB6kB,EACEK,EAAcA,CAAC9qB,EAAI+qB,EAAU/4B,KACjCg5B,EAAsBhrB,EAAI+qB,EAAWb,EAAgBH,GACrDiB,EAAsBhrB,EAAI+qB,EAAWd,EAAoBH,GACzD93B,GAAQA,GAAM,EAEVi5B,EAAcA,CAACjrB,EAAIhO,KACvBgO,EAAGkrB,YAAa,EAChBF,EAAsBhrB,EAAImqB,GAC1Ba,EAAsBhrB,EAAIqqB,GAC1BW,EAAsBhrB,EAAIoqB,GAC1Bp4B,GAAQA,GAAM,EAEVm5B,EAAiBJ,GACd,CAAC/qB,EAAIhO,KACV,MAAMuS,EAAOwmB,EAAW7kB,EAAWR,EAC7B3lB,EAAUA,IAAM+qC,EAAY9qB,EAAI+qB,EAAU/4B,GAChDiW,EAAS1D,EAAM,CAACvE,EAAIjgB,IACpBqrC,GAAU,KACRJ,EAAsBhrB,EAAI+qB,EAAWf,EAAkBH,GACvDwB,EAAmBrrB,EAAI+qB,EAAWb,EAAgBH,GAC7CS,EAAoBjmB,IACvB+mB,EAAmBtrB,EAAIrf,EAAMiqC,EAAe7qC,EAC9C,GACA,EAGN,OAAO8b,EAAAA,EAAAA,IAAO4uB,EAAW,CACvBhlB,aAAAA,CAAczF,GACZiI,EAASxC,EAAe,CAACzF,IACzBqrB,EAAmBrrB,EAAI6pB,GACvBwB,EAAmBrrB,EAAI8pB,EACzB,EACA7jB,cAAAA,CAAejG,GACbiI,EAAShC,EAAgB,CAACjG,IAC1BqrB,EAAmBrrB,EAAIgqB,GACvBqB,EAAmBrrB,EAAIiqB,EACzB,EACAvkB,QAASylB,GAAc,GACvBjlB,SAAUilB,GAAc,GACxBrlB,OAAAA,CAAQ9F,EAAIhO,GACVgO,EAAGkrB,YAAa,EAChB,MAAMnrC,EAAUA,IAAMkrC,EAAYjrB,EAAIhO,GACtCq5B,EAAmBrrB,EAAImqB,GACvBoB,IACAF,EAAmBrrB,EAAIoqB,GACvBgB,GAAU,KACHprB,EAAGkrB,aAGRF,EAAsBhrB,EAAImqB,GAC1BkB,EAAmBrrB,EAAIqqB,GAClBG,EAAoB1kB,IACvBwlB,EAAmBtrB,EAAIrf,EAAMkqC,EAAe9qC,GAC9C,IAEFkoB,EAASnC,EAAS,CAAC9F,EAAIjgB,GACzB,EACA6lB,gBAAAA,CAAiB5F,GACf8qB,EAAY9qB,GAAI,GAChBiI,EAASrC,EAAkB,CAAC5F,GAC9B,EACAoG,iBAAAA,CAAkBpG,GAChB8qB,EAAY9qB,GAAI,GAChBiI,EAAS7B,EAAmB,CAACpG,GAC/B,EACAgG,gBAAAA,CAAiBhG,GACfirB,EAAYjrB,GACZiI,EAASjC,EAAkB,CAAChG,GAC9B,GAEJ,CACA,SAAS2qB,EAAkBf,GACzB,GAAgB,MAAZA,EACF,OAAO,KACF,IAAIhkC,EAAAA,EAAAA,IAASgkC,GAClB,MAAO,CAAC4B,EAAS5B,EAASphB,OAAQgjB,EAAS5B,EAAS/gB,QAC/C,CACL,MAAMthB,EAAIikC,EAAS5B,GACnB,MAAO,CAACriC,EAAGA,EACb,CACF,CACA,SAASikC,EAASnb,GAChB,MAAMprB,GAAMwmC,EAAAA,EAAAA,IAASpb,GAIrB,OAAOprB,CACT,CACA,SAASomC,EAAmBrrB,EAAI0rB,GAC9BA,EAAIpnC,MAAM,OAAO4B,SAAShN,GAAMA,GAAK8mB,EAAG2rB,UAAU56B,IAAI7X,MACrD8mB,EAAGupB,KAAYvpB,EAAGupB,GAA0B,IAAIx7B,MAAQgD,IAAI26B,EAC/D,CACA,SAASV,EAAsBhrB,EAAI0rB,GACjCA,EAAIpnC,MAAM,OAAO4B,SAAShN,GAAMA,GAAK8mB,EAAG2rB,UAAU3oB,OAAO9pB,KACzD,MAAM0yC,EAAO5rB,EAAGupB,GACZqC,IACFA,EAAKrgC,OAAOmgC,GACPE,EAAKpgC,OACRwU,EAAGupB,QAAU,GAGnB,CACA,SAAS6B,EAAUlyB,GACjB2yB,uBAAsB,KACpBA,sBAAsB3yB,EAAG,GAE7B,CACA,IAAI4yB,EAAQ,EACZ,SAASR,EAAmBtrB,EAAI+rB,EAAcC,EAAiBjsC,GAC7D,MAAMmY,EAAK8H,EAAGisB,SAAWH,EACnBI,EAAoBA,KACpBh0B,IAAO8H,EAAGisB,QACZlsC,GACF,EAEF,GAAIisC,EACF,OAAOG,WAAWD,EAAmBF,GAEvC,MAAM,KAAErrC,EAAI,QAAEyrC,EAAO,UAAEC,GAAcC,EAAkBtsB,EAAI+rB,GAC3D,IAAKprC,EACH,OAAOZ,IAET,MAAMwsC,EAAW5rC,EAAO,MACxB,IAAI6rC,EAAQ,EACZ,MAAMp0B,EAAMA,KACV4H,EAAGysB,oBAAoBF,EAAUG,GACjCR,GAAmB,EAEfQ,EAAS9vC,IACTA,EAAEO,SAAW6iB,KAAQwsB,GAASH,GAChCj0B,GACF,EAEF+zB,YAAW,KACLK,EAAQH,GACVj0B,GACF,GACCg0B,EAAU,GACbpsB,EAAG2sB,iBAAiBJ,EAAUG,EAChC,CACA,SAASJ,EAAkBtsB,EAAI+rB,GAC7B,MAAMa,EAAS7uC,OAAO8uC,iBAAiB7sB,GACjC8sB,EAAsBlvC,IAASgvC,EAAOhvC,IAAQ,IAAI0G,MAAM,MACxDyoC,EAAmBD,EAAoB,GAAEzD,UACzC2D,EAAsBF,EAAoB,GAAEzD,aAC5C4D,EAAoBC,EAAWH,EAAkBC,GACjDG,EAAkBL,EAAoB,GAAExD,UACxC8D,EAAqBN,EAAoB,GAAExD,aAC3C+D,EAAmBH,EAAWC,EAAiBC,GACrD,IAAIzsC,EAAO,KACPyrC,EAAU,EACVC,EAAY,EACZN,IAAiB1C,EACf4D,EAAoB,IACtBtsC,EAAO0oC,EACP+C,EAAUa,EACVZ,EAAYW,EAAoB/zC,QAEzB8yC,IAAiBzC,EACtB+D,EAAmB,IACrB1sC,EAAO2oC,EACP8C,EAAUiB,EACVhB,EAAYe,EAAmBn0C,SAGjCmzC,EAAUlN,KAAKoO,IAAIL,EAAmBI,GACtC1sC,EAAOyrC,EAAU,EAAIa,EAAoBI,EAAmBhE,EAAaC,EAAY,KACrF+C,EAAY1rC,EAAOA,IAAS0oC,EAAa2D,EAAoB/zC,OAASm0C,EAAmBn0C,OAAS,GAEpG,MAAMs0C,EAAe5sC,IAAS0oC,GAAc,yBAAyBvnC,KACnEgrC,EAAoB,GAAEzD,aAAsBnT,YAE9C,MAAO,CACLv1B,OACAyrC,UACAC,YACAkB,eAEJ,CACA,SAASL,EAAWM,EAAQ9C,GAC1B,MAAO8C,EAAOv0C,OAASyxC,EAAUzxC,OAC/Bu0C,EAASA,EAAO3uB,OAAO2uB,GAEzB,OAAOtO,KAAKoO,OAAO5C,EAAU5lC,KAAI,CAACsC,EAAGpO,IAAMy0C,EAAKrmC,GAAKqmC,EAAKD,EAAOx0C,MACnE,CACA,SAASy0C,EAAKjrB,GACZ,MAAU,SAANA,EACK,EACyC,IAA3CjV,OAAOiV,EAAEpI,MAAM,GAAI,GAAG1d,QAAQ,IAAK,KAC5C,CACA,SAAS6uC,IACP,OAAO9sC,SAASivC,KAAKC,YACvB,CAEA,SAASC,EAAW5tB,EAAIhjB,EAAO6wC,GAC7B,MAAMC,EAAoB9tB,EAAGupB,GACzBuE,IACF9wC,GAASA,EAAQ,CAACA,KAAU8wC,GAAqB,IAAIA,IAAoBh0C,KAAK,MAEnE,MAATkD,EACFgjB,EAAG+tB,gBAAgB,SACVF,EACT7tB,EAAGsoB,aAAa,QAAStrC,GAEzBgjB,EAAGguB,UAAYhxC,CAEnB,CAEA,MAAMixC,EAAcnhC,OAAO,QAkD3B,MAAMohC,EAAephC,OAAoE,IA+DzF,SAASqhC,EAAWnuB,EAAIzD,EAAMxK,GAC5B,MAAMyqB,EAAQxc,EAAGwc,MACX4R,EAAiB5R,EAAM6R,QACvBC,GAAc9zB,EAAAA,EAAAA,IAASzI,GAC7B,GAAIA,IAASu8B,EAAa,CACxB,GAAI/xB,KAAS/B,EAAAA,EAAAA,IAAS+B,GACpB,IAAK,MAAM3e,KAAO2e,EACC,MAAbxK,EAAKnU,IACP2wC,EAAS/R,EAAO5+B,EAAK,IAI3B,IAAK,MAAMA,KAAOmU,EAChBw8B,EAAS/R,EAAO5+B,EAAKmU,EAAKnU,GAE9B,MACE,GAAI0wC,GACF,GAAI/xB,IAASxK,EAAM,CACjB,MAAMy8B,EAAahS,EAAM0R,GACrBM,IACFz8B,GAAQ,IAAMy8B,GAEhBhS,EAAMiS,QAAU18B,CAClB,OACSwK,GACTyD,EAAG+tB,gBAAgB,SAGnBE,KAAejuB,IACjBwc,EAAM6R,QAAUD,EAEpB,CACA,MACMM,EAAc,iBACpB,SAASH,EAAS/R,EAAOlgC,EAAM+zB,GAC7B,IAAIv1B,EAAAA,EAAAA,IAAQu1B,GACVA,EAAInqB,SAAS0E,GAAM2jC,EAAS/R,EAAOlgC,EAAMsO,UAWzC,GATW,MAAPylB,IACFA,EAAM,IAQJ/zB,EAAK4d,WAAW,MAClBsiB,EAAMmS,YAAYryC,EAAM+zB,OACnB,CACL,MAAMue,EAAWC,EAAWrS,EAAOlgC,GAC/BoyC,EAAY5sC,KAAKuuB,GACnBmM,EAAMmS,aACJ7zB,EAAAA,EAAAA,IAAU8zB,GACVve,EAAI3zB,QAAQgyC,EAAa,IACzB,aAGFlS,EAAMoS,GAAYve,CAEtB,CAEJ,CACA,MAAMye,EAAW,CAAC,SAAU,MAAO,MAC7BC,EAAc,CAAC,EACrB,SAASF,EAAWrS,EAAOwS,GACzB,MAAM1zB,EAASyzB,EAAYC,GAC3B,GAAI1zB,EACF,OAAOA,EAET,IAAIhf,GAAOue,EAAAA,EAAAA,IAASm0B,GACpB,GAAa,WAAT1yC,GAAqBA,KAAQkgC,EAC/B,OAAOuS,EAAYC,GAAW1yC,EAEhCA,GAAOwkB,EAAAA,EAAAA,IAAWxkB,GAClB,IAAK,IAAItD,EAAI,EAAGA,EAAI81C,EAAS71C,OAAQD,IAAK,CACxC,MAAM41C,EAAWE,EAAS91C,GAAKsD,EAC/B,GAAIsyC,KAAYpS,EACd,OAAOuS,EAAYC,GAAWJ,CAElC,CACA,OAAOI,CACT,CAEA,MAAMC,EAAU,+BAChB,SAASC,EAAUlvB,EAAIpiB,EAAKZ,EAAO6wC,EAAOz3B,GACxC,GAAIy3B,GAASjwC,EAAIsc,WAAW,UACb,MAATld,EACFgjB,EAAGmvB,kBAAkBF,EAASrxC,EAAIwc,MAAM,EAAGxc,EAAI3E,SAE/C+mB,EAAGovB,eAAeH,EAASrxC,EAAKZ,OAE7B,CACL,MAAMqyC,GAAYC,EAAAA,EAAAA,IAAqB1xC,GAC1B,MAATZ,GAAiBqyC,KAAcE,EAAAA,EAAAA,IAAmBvyC,GACpDgjB,EAAG+tB,gBAAgBnwC,GAEnBoiB,EAAGsoB,aAAa1qC,EAAKyxC,EAAY,GAAKryC,EAE1C,CACF,CAEA,SAASwyC,EAAaxvB,EAAIpiB,EAAKZ,EAAOqiB,EAAc6a,EAAiB7C,EAAgBmE,GACnF,GAAY,cAAR59B,GAA+B,gBAARA,EAKzB,OAJIyhB,GACFmc,EAAgBnc,EAAc6a,EAAiB7C,QAEjDrX,EAAGpiB,GAAgB,MAATZ,EAAgB,GAAKA,GAGjC,MAAMmrC,EAAMnoB,EAAGyvB,QACf,GAAY,UAAR7xC,GAA2B,aAARuqC,IACtBA,EAAI1iC,SAAS,KAAM,CAClBua,EAAGxL,OAASxX,EACZ,MAAMmQ,EAAmB,WAARg7B,EAAmBnoB,EAAG0vB,aAAa,SAAW1vB,EAAGhjB,MAC5DkQ,EAAoB,MAATlQ,EAAgB,GAAKA,EAOtC,OANImQ,IAAaD,IACf8S,EAAGhjB,MAAQkQ,QAEA,MAATlQ,GACFgjB,EAAG+tB,gBAAgBnwC,GAGvB,CACA,IAAI+xC,GAAa,EACjB,GAAc,KAAV3yC,GAAyB,MAATA,EAAe,CACjC,MAAM2D,SAAcqf,EAAGpiB,GACV,YAAT+C,EACF3D,GAAQuyC,EAAAA,EAAAA,IAAmBvyC,GACT,MAATA,GAA0B,WAAT2D,GAC1B3D,EAAQ,GACR2yC,GAAa,GACK,WAAThvC,IACT3D,EAAQ,EACR2yC,GAAa,EAEjB,CACA,IACE3vB,EAAGpiB,GAAOZ,CACZ,CAAE,MAAOJ,GACH,CAMN,CACA+yC,GAAc3vB,EAAG+tB,gBAAgBnwC,EACnC,CAEA,SAAS+uC,EAAiB3sB,EAAIpG,EAAOe,EAASsB,GAC5C+D,EAAG2sB,iBAAiB/yB,EAAOe,EAASsB,EACtC,CACA,SAASwwB,EAAoBzsB,EAAIpG,EAAOe,EAASsB,GAC/C+D,EAAGysB,oBAAoB7yB,EAAOe,EAASsB,EACzC,CACA,MAAM2zB,EAAS9iC,OAAO,QACtB,SAAS+iC,EAAW7vB,EAAIgvB,EAASc,EAAWC,EAAW35B,EAAW,MAChE,MAAM45B,EAAWhwB,EAAG4vB,KAAY5vB,EAAG4vB,GAAU,CAAC,GACxCK,EAAkBD,EAAShB,GACjC,GAAIe,GAAaE,EACfA,EAAgBjzC,MAAQ+yC,MACnB,CACL,MAAOzzC,EAAM2f,GAAWi0B,EAAUlB,GAClC,GAAIe,EAAW,CACb,MAAMI,EAAUH,EAAShB,GAAWoB,EAAcL,EAAW35B,GAC7Du2B,EAAiB3sB,EAAI1jB,EAAM6zC,EAASl0B,EACtC,MAAWg0B,IACTxD,EAAoBzsB,EAAI1jB,EAAM2zC,EAAiBh0B,GAC/C+zB,EAAShB,QAAW,EAExB,CACF,CACA,MAAMqB,EAAoB,4BAC1B,SAASH,EAAU5zC,GACjB,IAAI2f,EACJ,GAAIo0B,EAAkBvuC,KAAKxF,GAAO,CAEhC,IAAIw0B,EADJ7U,EAAU,CAAC,EAEX,MAAO6U,EAAIx0B,EAAKoC,MAAM2xC,GACpB/zC,EAAOA,EAAK8d,MAAM,EAAG9d,EAAKrD,OAAS63B,EAAE,GAAG73B,QACxCgjB,EAAQ6U,EAAE,GAAG3U,gBAAiB,CAElC,CACA,MAAMvC,EAAoB,MAAZtd,EAAK,GAAaA,EAAK8d,MAAM,IAAKU,EAAAA,EAAAA,IAAUxe,EAAK8d,MAAM,IACrE,MAAO,CAACR,EAAOqC,EACjB,CACA,IAAIq0B,EAAY,EAChB,MAAMv3C,EAAoBkH,QAAQF,UAC5BwwC,EAASA,IAAMD,IAAcv3C,EAAEgf,MAAK,IAAMu4B,EAAY,IAAIA,EAAYhzC,KAAKkzC,OACjF,SAASJ,EAAcK,EAAcr6B,GACnC,MAAM+5B,EAAWvzC,IACf,GAAKA,EAAE8zC,MAEA,GAAI9zC,EAAE8zC,MAAQP,EAAQQ,SAC3B,YAFA/zC,EAAE8zC,KAAOpzC,KAAKkzC,OAIhBj6B,EAAAA,EAAAA,IACEq6B,EAA8Bh0C,EAAGuzC,EAAQnzC,OACzCoZ,EACA,EACA,CAACxZ,GACF,EAIH,OAFAuzC,EAAQnzC,MAAQyzC,EAChBN,EAAQQ,SAAWJ,IACZJ,CACT,CACA,SAASS,EAA8Bh0C,EAAGI,GACxC,IAAIlC,EAAAA,EAAAA,IAAQkC,GAAQ,CAClB,MAAM6zC,EAAej0C,EAAEk0C,yBAKvB,OAJAl0C,EAAEk0C,yBAA2B,KAC3BD,EAAalsC,KAAK/H,GAClBA,EAAEm0C,UAAW,CAAI,EAEZ/zC,EAAM8H,KAAKC,GAAQy6B,IAAQA,EAAGuR,UAAYhsC,GAAMA,EAAGy6B,IAC5D,CACE,OAAOxiC,CAEX,CAEA,MAAMg0C,GAAcpzC,GAA8B,MAAtBA,EAAIzE,WAAW,IAAoC,MAAtByE,EAAIzE,WAAW,IACxEyE,EAAIzE,WAAW,GAAK,IAAMyE,EAAIzE,WAAW,GAAK,IACxCs/B,GAAYA,CAACzY,EAAIpiB,EAAKkyC,EAAWC,EAAWrc,EAAWrU,EAAc6a,EAAiB7C,EAAgBmE,KAC1G,MAAMqS,EAAsB,QAAdna,EACF,UAAR91B,EACFgwC,EAAW5tB,EAAI+vB,EAAWlC,GACT,UAARjwC,EACTuwC,EAAWnuB,EAAI8vB,EAAWC,IACjB7zB,EAAAA,EAAAA,IAAKte,IACTqc,EAAAA,EAAAA,IAAgBrc,IACnBiyC,EAAW7vB,EAAIpiB,EAAKkyC,EAAWC,EAAW7V,IAExB,MAAXt8B,EAAI,IAAcA,EAAMA,EAAIwc,MAAM,GAAI,GAAmB,MAAXxc,EAAI,IAAcA,EAAMA,EAAIwc,MAAM,GAAI,GAAS62B,GAAgBjxB,EAAIpiB,EAAKmyC,EAAWlC,IAC1I2B,EACExvB,EACApiB,EACAmyC,EACA1wB,EACA6a,EACA7C,EACAmE,IAGU,eAAR59B,EACFoiB,EAAGkxB,WAAanB,EACC,gBAARnyC,IACToiB,EAAGmxB,YAAcpB,GAEnBb,EAAUlvB,EAAIpiB,EAAKmyC,EAAWlC,GAChC,EAEF,SAASoD,GAAgBjxB,EAAIpiB,EAAKZ,EAAO6wC,GACvC,GAAIA,EACF,MAAY,cAARjwC,GAA+B,gBAARA,MAGvBA,KAAOoiB,GAAMgxB,GAAWpzC,KAAQqX,EAAAA,EAAAA,IAAWjY,IAKjD,GAAY,eAARY,GAAgC,cAARA,GAA+B,cAARA,EACjD,OAAO,EAET,GAAY,SAARA,EACF,OAAO,EAET,GAAY,SAARA,GAAiC,UAAfoiB,EAAGyvB,QACvB,OAAO,EAET,GAAY,SAAR7xC,GAAiC,aAAfoiB,EAAGyvB,QACvB,OAAO,EAET,GAAY,UAAR7xC,GAA2B,WAARA,EAAkB,CACvC,MAAMuqC,EAAMnoB,EAAGyvB,QACf,GAAY,QAARtH,GAAyB,UAARA,GAA2B,WAARA,GAA4B,WAARA,EAC1D,OAAO,CAEX,CACA,QAAI6I,GAAWpzC,MAAQ4c,EAAAA,EAAAA,IAASxd,KAGzBY,KAAOoiB,CAChB;;;AAkByC,qBAAhBoxB,aAA8BA,YAmOvD,MAAMC,GAA8B,IAAIzkC,QAClC0kC,GAAiC,IAAI1kC,QACrC2kC,GAAYzkC,OAAO,WACnB2X,GAAa3X,OAAO,YACpB0kC,GAAsB,CAC1Bl1C,KAAM,kBACNyd,OAAuB8B,EAAAA,EAAAA,IAAO,CAAC,EAAGyuB,EAA2B,CAC3DnC,IAAK3uC,OACLi4C,UAAWj4C,SAEb8sB,KAAAA,CAAMvM,GAAO,MAAEyD,IACb,MAAMpH,GAAWmQ,EAAAA,EAAAA,MACX5B,GAAQD,EAAAA,EAAAA,MACd,IAAIrF,EACAD,EAmCJ,OAlCAkM,EAAAA,EAAAA,KAAU,KACR,IAAKjM,EAAapmB,OAChB,OAEF,MAAMw4C,EAAY13B,EAAM03B,WAAc,GAAE13B,EAAMzd,MAAQ,WACtD,IAAKo1C,GACHryB,EAAa,GAAGW,GAChB5J,EAASO,MAAMqJ,GACfyxB,GAEA,OAEFpyB,EAAanZ,QAAQyrC,IACrBtyB,EAAanZ,QAAQ0rC,IACrB,MAAMC,EAAgBxyB,EAAapR,OAAO6jC,IAC1CvG,IACAsG,EAAc3rC,SAAShN,IACrB,MAAM8mB,EAAK9mB,EAAE8mB,GACPwc,EAAQxc,EAAGwc,MACjB6O,EAAmBrrB,EAAIyxB,GACvBjV,EAAMuV,UAAYvV,EAAMwV,gBAAkBxV,EAAMyV,mBAAqB,GACrE,MAAM/4B,EAAK8G,EAAGuxB,IAAc30C,IACtBA,GAAKA,EAAEO,SAAW6iB,GAGjBpjB,IAAK,aAAakF,KAAKlF,EAAEs1C,gBAC5BlyB,EAAGysB,oBAAoB,gBAAiBvzB,GACxC8G,EAAGuxB,IAAa,KAChBvG,EAAsBhrB,EAAIyxB,GAC5B,EAEFzxB,EAAG2sB,iBAAiB,gBAAiBzzB,EAAG,GACxC,IAEG,KACL,MAAM2N,GAAWtY,EAAAA,EAAAA,IAAMwL,GACjBo4B,EAAqB1I,EAAuB5iB,GAClD,IAAIshB,EAAMthB,EAASshB,KAAO5e,EAAAA,GAC1BlK,EAAeD,EACfA,EAAW5B,EAAMiJ,SAAUC,EAAAA,EAAAA,IAAyBlJ,EAAMiJ,WAAa,GACvE,IAAK,IAAIztB,EAAI,EAAGA,EAAIomB,EAASnmB,OAAQD,IAAK,CACxC,MAAM2tB,EAAQvH,EAASpmB,GACN,MAAb2tB,EAAM/oB,MACRupB,EAAAA,EAAAA,IACER,GACAO,EAAAA,EAAAA,IAAuBP,EAAOwrB,EAAoBxtB,EAAOvO,GAK/D,CACA,GAAIiJ,EACF,IAAK,IAAIrmB,EAAI,EAAGA,EAAIqmB,EAAapmB,OAAQD,IAAK,CAC5C,MAAM2tB,EAAQtH,EAAarmB,IAC3BmuB,EAAAA,EAAAA,IACER,GACAO,EAAAA,EAAAA,IAAuBP,EAAOwrB,EAAoBxtB,EAAOvO,IAE3Di7B,GAAYnlC,IAAIya,EAAOA,EAAM3G,GAAGoyB,wBAClC,CAEF,OAAO9zB,EAAAA,EAAAA,IAAY6pB,EAAK,KAAM/oB,EAAS,CAE3C,GAGyBoyB,GAAoBz3B,MAE/C,SAAS43B,GAAez4C,GACtB,MAAM8mB,EAAK9mB,EAAE8mB,GACTA,EAAGuxB,KACLvxB,EAAGuxB,MAEDvxB,EAAGyE,KACLzE,EAAGyE,KAEP,CACA,SAASmtB,GAAe14C,GACtBo4C,GAAeplC,IAAIhT,EAAGA,EAAE8mB,GAAGoyB,wBAC7B,CACA,SAASN,GAAiB54C,GACxB,MAAMm5C,EAAShB,GAAY/lC,IAAIpS,GACzBo5C,EAAShB,GAAehmC,IAAIpS,GAC5Bq5C,EAAKF,EAAOG,KAAOF,EAAOE,KAC1BC,EAAKJ,EAAOK,IAAMJ,EAAOI,IAC/B,GAAIH,GAAME,EAAI,CACZ,MAAMjwB,EAAItpB,EAAE8mB,GAAGwc,MAGf,OAFAha,EAAEuvB,UAAYvvB,EAAEwvB,gBAAmB,aAAYO,OAAQE,OACvDjwB,EAAEyvB,mBAAqB,KAChB/4C,CACT,CACF,CACA,SAASw4C,GAAgB1xB,EAAIxB,EAAMizB,GACjC,MAAM3oB,EAAQ9I,EAAGgpB,YACX4C,EAAO5rB,EAAGupB,GACZqC,GACFA,EAAK1lC,SAASwlC,IACZA,EAAIpnC,MAAM,OAAO4B,SAAShN,GAAMA,GAAK4vB,EAAM6iB,UAAU3oB,OAAO9pB,IAAG,IAGnEu4C,EAAUntC,MAAM,OAAO4B,SAAShN,GAAMA,GAAK4vB,EAAM6iB,UAAU56B,IAAI7X,KAC/D4vB,EAAM0T,MAAM6R,QAAU,OACtB,MAAMrU,EAA8B,IAAlBxb,EAAKm0B,SAAiBn0B,EAAOA,EAAK6a,WACpDW,EAAUoP,YAAYtgB,GACtB,MAAM,aAAEykB,GAAiBjB,EAAkBxjB,GAE3C,OADAkR,EAAUkO,YAAYpf,GACfykB,CACT,CAEA,MAAMqF,GAAoBj8B,IACxB,MAAM5R,EAAK4R,EAAMoD,MAAM,yBAA0B,EACjD,OAAOjf,EAAAA,EAAAA,IAAQiK,GAAO/H,IAAUqhC,EAAAA,EAAAA,IAAet5B,EAAI/H,GAAS+H,CAAE,EAEhE,SAAS8tC,GAAmBj2C,GAC1BA,EAAEO,OAAO21C,WAAY,CACvB,CACA,SAASC,GAAiBn2C,GACxB,MAAMO,EAASP,EAAEO,OACbA,EAAO21C,YACT31C,EAAO21C,WAAY,EACnB31C,EAAO61C,cAAc,IAAIC,MAAM,UAEnC,CACA,MAAMC,GAAYpmC,OAAO,WACnBqmC,GAAa,CACjB1kB,OAAAA,CAAQzO,GAAMiE,WAAW,KAAEmvB,EAAI,KAAE74B,EAAI,OAAED,IAAY3D,GACjDqJ,EAAGkzB,IAAaN,GAAiBj8B,GACjC,MAAM08B,EAAe/4B,GAAU3D,EAAMoD,OAA8B,WAArBpD,EAAMoD,MAAMpZ,KAC1DgsC,EAAiB3sB,EAAIozB,EAAO,SAAW,SAAUx2C,IAC/C,GAAIA,EAAEO,OAAO21C,UACX,OACF,IAAIQ,EAAWtzB,EAAGhjB,MACdud,IACF+4B,EAAWA,EAAS/4B,QAElB84B,IACFC,GAAW74B,EAAAA,EAAAA,IAAc64B,IAE3BtzB,EAAGkzB,IAAWI,EAAS,IAErB/4B,GACFoyB,EAAiB3sB,EAAI,UAAU,KAC7BA,EAAGhjB,MAAQgjB,EAAGhjB,MAAMud,MAAM,IAGzB64B,IACHzG,EAAiB3sB,EAAI,mBAAoB6yB,IACzClG,EAAiB3sB,EAAI,iBAAkB+yB,IACvCpG,EAAiB3sB,EAAI,SAAU+yB,IAEnC,EAEA7uB,OAAAA,CAAQlE,GAAI,MAAEhjB,IACZgjB,EAAGhjB,MAAiB,MAATA,EAAgB,GAAKA,CAClC,EACA2xB,YAAAA,CAAa3O,GAAI,MAAEhjB,EAAOinB,WAAW,KAAEmvB,EAAI,KAAE74B,EAAI,OAAED,IAAY3D,GAE7D,GADAqJ,EAAGkzB,IAAaN,GAAiBj8B,GAC7BqJ,EAAG8yB,UACL,OACF,MAAMS,EAAUj5B,GAAsB,WAAZ0F,EAAGrf,MAAoB8Z,EAAAA,EAAAA,IAAcuF,EAAGhjB,OAASgjB,EAAGhjB,MACxEkQ,EAAoB,MAATlQ,EAAgB,GAAKA,EACtC,GAAIu2C,IAAYrmC,EAAhB,CAGA,GAAIzO,SAAS+0C,gBAAkBxzB,GAAkB,UAAZA,EAAGrf,KAAkB,CACxD,GAAIyyC,EACF,OAEF,GAAI74B,GAAQyF,EAAGhjB,MAAMud,SAAWrN,EAC9B,MAEJ,CACA8S,EAAGhjB,MAAQkQ,CATX,CAUF,GA6NF,MAiDMumC,IAAkC53B,EAAAA,EAAAA,IAAO,CAAE4c,cAAauP,GAC9D,IAAIxK,GAEJ,SAASkW,KACP,OAAOlW,KAAaA,IAAWtF,EAAAA,EAAAA,GAAeub,IAChD,CAMA,MAMM1R,GAAYA,IAAI1zB,KACpB,MAAMujB,EAAM8hB,KAAiB3R,aAAa1zB,GAK1C,MAAM,MAAEklB,GAAU3B,EAiBlB,OAhBAA,EAAI2B,MAASogB,IACX,MAAM3Z,EAAY4Z,GAAmBD,GACrC,IAAK3Z,EACH,OACF,MAAM1a,EAAYsS,EAAIgB,YACjB3d,EAAAA,EAAAA,IAAWqK,IAAeA,EAAU5B,QAAW4B,EAAUzb,WAC5Dyb,EAAUzb,SAAWm2B,EAAUiP,WAEjCjP,EAAUiP,UAAY,GACtB,MAAMr1B,EAAQ2f,EAAMyG,GAAW,EAAO6Z,GAAqB7Z,IAK3D,OAJIA,aAAqB8Z,UACvB9Z,EAAU+T,gBAAgB,WAC1B/T,EAAUsO,aAAa,aAAc,KAEhC10B,CAAK,EAEPge,CAAG,EAiBZ,SAASiiB,GAAqB7Z,GAC5B,OAAIA,aAAqB+Z,WAChB,MAEoB,oBAAlBC,eAAgCha,aAAqBga,cACvD,cADT,CAGF,CAoCA,SAASJ,GAAmB5Z,GAC1B,IAAIxf,EAAAA,EAAAA,IAASwf,GAAY,CACvB,MAAM/0B,EAAMxG,SAASkqC,cAAc3O,GAMnC,OAAO/0B,CACT,CAMA,OAAO+0B,CACT,C;;;;;;ACniDA,SAASnsB,EAAQhV,EAAKo7C,GACpB,MAAM/nC,EAAM,IAAI6B,IAAIlV,EAAIyL,MAAM,MAC9B,OAAO2vC,EAAoB5jB,GAAQnkB,EAAIqD,IAAI8gB,EAAIlU,eAAkBkU,GAAQnkB,EAAIqD,IAAI8gB,EACnF,CAEA,MAAMrW,EAA4E,CAAC,EAC7E0b,EAA4E,GAC5ExgB,EAAOA,OAEP4c,EAAKA,KAAM,EACX5V,EAAQte,GAA8B,MAAtBA,EAAIzE,WAAW,IAAoC,MAAtByE,EAAIzE,WAAW,KACjEyE,EAAIzE,WAAW,GAAK,KAAOyE,EAAIzE,WAAW,GAAK,IAC1C8gB,EAAmBrc,GAAQA,EAAIsc,WAAW,aAC1C2B,EAASxe,OAAO4D,OAChB+hB,EAASA,CAAC1U,EAAK0R,KACnB,MAAMhnB,EAAIsV,EAAI0K,QAAQgH,GAClBhnB,GAAK,GACPsV,EAAIsK,OAAO5f,EAAG,EAChB,EAEI0E,EAAiBL,OAAO+F,UAAU1F,eAClC2R,EAASA,CAACghB,EAAKzyB,IAAQF,EAAeiH,KAAK0rB,EAAKzyB,GAChD9C,EAAUD,MAAMC,QAChB6S,EAAS0iB,GAA8B,iBAAtB6jB,EAAa7jB,GAC9B5M,EAAS4M,GAA8B,iBAAtB6jB,EAAa7jB,GAC9B8jB,EAAU9jB,GAA8B,kBAAtB6jB,EAAa7jB,GAC/BrG,EAAYqG,GAA8B,oBAAtB6jB,EAAa7jB,GACjCpb,EAAcob,GAAuB,oBAARA,EAC7B7V,EAAY6V,GAAuB,kBAARA,EAC3B5iB,EAAY4iB,GAAuB,kBAARA,EAC3BzqB,EAAYyqB,GAAgB,OAARA,GAA+B,kBAARA,EAC3C7Z,EAAa6Z,IACTzqB,EAASyqB,IAAQpb,EAAWob,KAASpb,EAAWob,EAAItY,OAAS9C,EAAWob,EAAIjwB,OAEhFg0C,EAAiB/2C,OAAO+F,UAAU8yB,SAClCge,EAAgBl3C,GAAUo3C,EAAezvC,KAAK3H,GAC9CoW,EAAapW,GACVk3C,EAAal3C,GAAOod,MAAM,GAAI,GAEjCsJ,EAAiB2M,GAA8B,oBAAtB6jB,EAAa7jB,GACtC3iB,EAAgB9P,GAAQ4c,EAAS5c,IAAgB,QAARA,GAA4B,MAAXA,EAAI,IAAc,GAAK6B,SAAS7B,EAAK,MAAQA,EACvGs3B,EAAiCrnB,EAErC,uIAKIwmC,EAAuBtvC,IAC3B,MAAMqW,EAAwB/d,OAAOkG,OAAO,MAC5C,OAAQ1K,IACN,MAAMy7C,EAAMl5B,EAAMviB,GAClB,OAAOy7C,IAAQl5B,EAAMviB,GAAOkM,EAAGlM,GAAK,CACrC,EAEG07C,EAAa,SACb15B,EAAWw5B,GAAqBx7C,GAC7BA,EAAI6D,QAAQ63C,GAAY,CAACtwC,EAAG/K,IAAMA,EAAIA,EAAEs7C,cAAgB,OAE3DC,EAAc,aACd35B,EAAYu5B,GACfx7C,GAAQA,EAAI6D,QAAQ+3C,EAAa,OAAOt4B,gBAErC2E,EAAauzB,GAAqBx7C,GAC/BA,EAAIoD,OAAO,GAAGu4C,cAAgB37C,EAAIuhB,MAAM,KAE3CQ,EAAey5B,GAAqBx7C,IACxC,MAAM2pB,EAAI3pB,EAAO,KAAIioB,EAAWjoB,KAAU,GAC1C,OAAO2pB,CAAC,IAEJxS,EAAaA,CAAChT,EAAOmQ,KAAc9P,OAAO+9B,GAAGp+B,EAAOmQ,GACpDkxB,EAAiBA,CAACqW,EAAK1wB,KAC3B,IAAK,IAAIhrB,EAAI,EAAGA,EAAI07C,EAAIz7C,OAAQD,IAC9B07C,EAAI17C,GAAGgrB,EACT,EAEI9P,EAAMA,CAACxP,EAAK9G,EAAKZ,KACrBK,OAAOuwB,eAAelpB,EAAK9G,EAAK,CAC9BkyB,cAAc,EACdD,YAAY,EACZ7yB,SACA,EAEEyd,EAAiB4V,IACrB,MAAM9oB,EAAIotC,WAAWtkB,GACrB,OAAOukB,MAAMrtC,GAAK8oB,EAAM9oB,CAAC,EAErBkkC,EAAYpb,IAChB,MAAM9oB,EAAIiT,EAAS6V,GAAO9iB,OAAO8iB,GAAOwkB,IACxC,OAAOD,MAAMrtC,GAAK8oB,EAAM9oB,CAAC,EAE3B,IAAIutC,EACJ,MAAM7c,EAAgBA,IACb6c,IAAgBA,EAAoC,qBAAfC,WAA6BA,WAA6B,qBAATj3C,KAAuBA,KAAyB,qBAAXC,OAAyBA,OAA2B,qBAAXC,EAAAA,EAAyBA,EAAAA,EAAS,CAAC,GAOhN,MAsFMg3C,EAAkB,iNAClBC,EAAoCpnC,EAAQmnC,GA2ClD,SAAS1Q,EAAetnC,GACtB,GAAIlC,EAAQkC,GAAQ,CAClB,MAAMiI,EAAM,CAAC,EACb,IAAK,IAAIjM,EAAI,EAAGA,EAAIgE,EAAM/D,OAAQD,IAAK,CACrC,MAAM8yB,EAAO9uB,EAAMhE,GACbwiB,EAAahB,EAASsR,GAAQopB,EAAiBppB,GAAQwY,EAAexY,GAC5E,GAAItQ,EACF,IAAK,MAAM5d,KAAO4d,EAChBvW,EAAIrH,GAAO4d,EAAW5d,EAG5B,CACA,OAAOqH,CACT,CAAO,GAAIuV,EAASxd,IAAU4I,EAAS5I,GACrC,OAAOA,CAEX,CACA,MAAMm4C,EAAkB,gBAClBC,EAAsB,UACtBC,EAAiB,iBACvB,SAASH,EAAiBzG,GACxB,MAAMplB,EAAM,CAAC,EAOb,OANAolB,EAAQ/xC,QAAQ24C,EAAgB,IAAI/wC,MAAM6wC,GAAiBjvC,SAAS4lB,IAClE,GAAIA,EAAM,CACR,MAAMwpB,EAAMxpB,EAAKxnB,MAAM8wC,GACvBE,EAAIr8C,OAAS,IAAMowB,EAAIisB,EAAI,GAAG/6B,QAAU+6B,EAAI,GAAG/6B,OACjD,KAEK8O,CACT,CAeA,SAASgb,EAAernC,GACtB,IAAIiI,EAAM,GACV,GAAIuV,EAASxd,GACXiI,EAAMjI,OACD,GAAIlC,EAAQkC,GACjB,IAAK,IAAIhE,EAAI,EAAGA,EAAIgE,EAAM/D,OAAQD,IAAK,CACrC,MAAMwiB,EAAa6oB,EAAernC,EAAMhE,IACpCwiB,IACFvW,GAAOuW,EAAa,IAExB,MACK,GAAI5V,EAAS5I,GAClB,IAAK,MAAMV,KAAQU,EACbA,EAAMV,KACR2I,GAAO3I,EAAO,KAIpB,OAAO2I,EAAIsV,MACb,CAcA,MASMg7B,EAAuB,8EACvBjG,EAAuCzhC,EAAQ0nC,GAIrD,SAAShG,GAAmBvyC,GAC1B,QAASA,GAAmB,KAAVA,CACpB,CA6EA,SAASw4C,GAAmBrwC,EAAGC,GAC7B,GAAID,EAAElM,SAAWmM,EAAEnM,OACjB,OAAO,EACT,IAAIw8C,GAAQ,EACZ,IAAK,IAAIz8C,EAAI,EAAGy8C,GAASz8C,EAAImM,EAAElM,OAAQD,IACrCy8C,EAAQC,GAAWvwC,EAAEnM,GAAIoM,EAAEpM,IAE7B,OAAOy8C,CACT,CACA,SAASC,GAAWvwC,EAAGC,GACrB,GAAID,IAAMC,EACR,OAAO,EACT,IAAIuwC,EAAaxB,EAAOhvC,GACpBywC,EAAazB,EAAO/uC,GACxB,GAAIuwC,GAAcC,EAChB,SAAOD,IAAcC,IAAazwC,EAAE3H,YAAc4H,EAAE5H,UAItD,GAFAm4C,EAAaloC,EAAStI,GACtBywC,EAAanoC,EAASrI,GAClBuwC,GAAcC,EAChB,OAAOzwC,IAAMC,EAIf,GAFAuwC,EAAa76C,EAAQqK,GACrBywC,EAAa96C,EAAQsK,GACjBuwC,GAAcC,EAChB,SAAOD,IAAcC,IAAaJ,GAAmBrwC,EAAGC,GAI1D,GAFAuwC,EAAa/vC,EAAST,GACtBywC,EAAahwC,EAASR,GAClBuwC,GAAcC,EAAY,CAC5B,IAAKD,IAAeC,EAClB,OAAO,EAET,MAAMC,EAAax4C,OAAOiI,KAAKH,GAAGlM,OAC5B68C,EAAaz4C,OAAOiI,KAAKF,GAAGnM,OAClC,GAAI48C,IAAeC,EACjB,OAAO,EAET,IAAK,MAAMl4C,KAAOuH,EAAG,CACnB,MAAM4wC,EAAU5wC,EAAEzH,eAAeE,GAC3Bo4C,EAAU5wC,EAAE1H,eAAeE,GACjC,GAAIm4C,IAAYC,IAAYD,GAAWC,IAAYN,GAAWvwC,EAAEvH,GAAMwH,EAAExH,IACtE,OAAO,CAEX,CACF,CACA,OAAOpE,OAAO2L,KAAO3L,OAAO4L,EAC9B,CACA,SAAS6wC,GAAa3nC,EAAK+hB,GACzB,OAAO/hB,EAAI+nB,WAAWvK,GAAS4pB,GAAW5pB,EAAMuE,IAClD,CAEA,MAAM6lB,GAAmB7lB,GAChB7V,EAAS6V,GAAOA,EAAa,MAAPA,EAAc,GAAKv1B,EAAQu1B,IAAQzqB,EAASyqB,KAASA,EAAI6F,WAAake,IAAmBn/B,EAAWob,EAAI6F,WAAa53B,KAAKoD,UAAU2uB,EAAK8lB,GAAU,GAAK38C,OAAO62B,GAExL8lB,GAAWA,CAACC,EAAM/lB,IAClBA,GAAOA,EAAI9b,UACN4hC,GAASC,EAAM/lB,EAAIrzB,OACjB2Q,EAAM0iB,GACR,CACL,CAAE,OAAMA,EAAI7kB,SAAU,IAAI6kB,EAAIpqB,WAAW8nB,QACvC,CAAC9nB,GAAUrI,EAAKy4C,GAAOr9C,KACrBiN,EAAQqwC,GAAgB14C,EAAK5E,GAAK,OAASq9C,EACpCpwC,IAET,CAAC,IAGIwd,EAAM4M,GACR,CACL,CAAE,OAAMA,EAAI7kB,SAAU,IAAI6kB,EAAIhjB,UAAUvI,KAAK8F,GAAM0rC,GAAgB1rC,MAE5D6C,EAAS4iB,GACXimB,GAAgBjmB,IACdzqB,EAASyqB,IAASv1B,EAAQu1B,IAAS3M,EAAc2M,GAGrDA,EAFE72B,OAAO62B,GAIZimB,GAAkBA,CAAC1rC,EAAG5R,EAAI,MAC9B,IAAIiG,EACJ,OAAOwO,EAAS7C,GAAM,UAAiC,OAAvB3L,EAAK2L,EAAE2rC,aAAuBt3C,EAAKjG,KAAO4R,CAAC,C,qBCle7E4rC,EAAQ,EAAU,CAACC,EAAK18B,KACpB,MAAM5c,EAASs5C,EAAIvS,WAAauS,EAChC,IAAK,MAAO74C,EAAKyyB,KAAQtW,EACrB5c,EAAOS,GAAOyyB,EAElB,OAAOlzB,CAAM,C,uBCRjB,IAAIu5C,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAEtBC,EAAaC,UAGjBC,EAAON,QAAU,SAAUO,GACzB,GAAIL,EAAWK,GAAW,OAAOA,EACjC,MAAM,IAAIH,EAAWD,EAAYI,GAAY,qBAC/C,C,uBCTA,IAAIC,EAAsB,EAAQ,KAE9BC,EAAUz9C,OACVo9C,EAAaC,UAEjBC,EAAON,QAAU,SAAUO,GACzB,GAAIC,EAAoBD,GAAW,OAAOA,EAC1C,MAAM,IAAIH,EAAW,aAAeK,EAAQF,GAAY,kBAC1D,C,uBCRA,IAAIG,EAAgB,EAAQ,MAExBN,EAAaC,UAEjBC,EAAON,QAAU,SAAUW,EAAIC,GAC7B,GAAIF,EAAcE,EAAWD,GAAK,OAAOA,EACzC,MAAM,IAAIP,EAAW,uBACvB,C,uBCPA,IAAIhxC,EAAW,EAAQ,KAEnBqxC,EAAUz9C,OACVo9C,EAAaC,UAGjBC,EAAON,QAAU,SAAUO,GACzB,GAAInxC,EAASmxC,GAAW,OAAOA,EAC/B,MAAM,IAAIH,EAAWK,EAAQF,GAAY,oBAC3C,C,uBCTA,IAAIM,EAAkB,EAAQ,MAC1BC,EAAkB,EAAQ,MAC1BC,EAAoB,EAAQ,MAG5BC,EAAe,SAAUC,GAC3B,OAAO,SAAUC,EAAO13B,EAAI23B,GAC1B,IAGI36C,EAHA46C,EAAIP,EAAgBK,GACpBz+C,EAASs+C,EAAkBK,GAC3B/uC,EAAQyuC,EAAgBK,EAAW1+C,GAIvC,GAAIw+C,GAAez3B,IAAOA,GAAI,MAAO/mB,EAAS4P,EAG5C,GAFA7L,EAAQ46C,EAAE/uC,KAEN7L,IAAUA,EAAO,OAAO,OAEvB,KAAM/D,EAAS4P,EAAOA,IAC3B,IAAK4uC,GAAe5uC,KAAS+uC,IAAMA,EAAE/uC,KAAWmX,EAAI,OAAOy3B,GAAe5uC,GAAS,EACnF,OAAQ4uC,IAAgB,CAC5B,CACF,EAEAX,EAAON,QAAU,CAGf/wC,SAAU+xC,GAAa,GAGvBx+B,QAASw+B,GAAa,G,uBC9BxB,IAAIK,EAAc,EAAQ,MACtB/8C,EAAU,EAAQ,MAElB87C,EAAaC,UAEbiB,EAA2Bz6C,OAAOy6C,yBAGlCC,EAAoCF,IAAgB,WAEtD,QAAa36C,IAAT5C,KAAoB,OAAO,EAC/B,IAEE+C,OAAOuwB,eAAe,GAAI,SAAU,CAAEoqB,UAAU,IAAS/+C,OAAS,CACpE,CAAE,MAAO6D,GACP,OAAOA,aAAiB+5C,SAC1B,CACF,CATwD,GAWxDC,EAAON,QAAUuB,EAAoC,SAAUH,EAAG3+C,GAChE,GAAI6B,EAAQ88C,KAAOE,EAAyBF,EAAG,UAAUI,SACvD,MAAM,IAAIpB,EAAW,gCACrB,OAAOgB,EAAE3+C,OAASA,CACtB,EAAI,SAAU2+C,EAAG3+C,GACf,OAAO2+C,EAAE3+C,OAASA,CACpB,C,uBCzBA,IAAIg/C,EAAc,EAAQ,MAEtB/hB,EAAW+hB,EAAY,CAAC,EAAE/hB,UAC1BgiB,EAAcD,EAAY,GAAG79B,OAEjC08B,EAAON,QAAU,SAAUW,GACzB,OAAOe,EAAYhiB,EAASihB,GAAK,GAAI,EACvC,C,uBCPA,IAAIgB,EAAwB,EAAQ,MAChCzB,EAAa,EAAQ,MACrB0B,EAAa,EAAQ,MACrBC,EAAkB,EAAQ,MAE1BC,EAAgBD,EAAgB,eAChCE,EAAUl7C,OAGVm7C,EAAwE,cAApDJ,EAAW,WAAc,OAAOlkB,SAAW,CAAhC,IAG/BukB,EAAS,SAAUtB,EAAIv5C,GACzB,IACE,OAAOu5C,EAAGv5C,EACZ,CAAE,MAAOd,GAAqB,CAChC,EAGAg6C,EAAON,QAAU2B,EAAwBC,EAAa,SAAUjB,GAC9D,IAAIS,EAAGzP,EAAK1lC,EACZ,YAAcvF,IAAPi6C,EAAmB,YAAqB,OAAPA,EAAc,OAEO,iBAAjDhP,EAAMsQ,EAAOb,EAAIW,EAAQpB,GAAKmB,IAA8BnQ,EAEpEqQ,EAAoBJ,EAAWR,GAEF,YAA5Bn1C,EAAS21C,EAAWR,KAAoBlB,EAAWkB,EAAEc,QAAU,YAAcj2C,CACpF,C,uBC5BA,IAAI4M,EAAS,EAAQ,MACjBa,EAAU,EAAQ,MAClByoC,EAAiC,EAAQ,MACzCC,EAAuB,EAAQ,KAEnC9B,EAAON,QAAU,SAAUr5C,EAAQC,EAAQy7C,GAIzC,IAHA,IAAIvzC,EAAO4K,EAAQ9S,GACfwwB,EAAiBgrB,EAAqBzxC,EACtC2wC,EAA2Ba,EAA+BxxC,EACrDnO,EAAI,EAAGA,EAAIsM,EAAKrM,OAAQD,IAAK,CACpC,IAAI4E,EAAM0H,EAAKtM,GACVqW,EAAOlS,EAAQS,IAAUi7C,GAAcxpC,EAAOwpC,EAAYj7C,IAC7DgwB,EAAezwB,EAAQS,EAAKk6C,EAAyB16C,EAAQQ,GAEjE,CACF,C,uBCfA,IAAIi6C,EAAc,EAAQ,MACtBe,EAAuB,EAAQ,KAC/BE,EAA2B,EAAQ,MAEvChC,EAAON,QAAUqB,EAAc,SAAUkB,EAAQn7C,EAAKZ,GACpD,OAAO47C,EAAqBzxC,EAAE4xC,EAAQn7C,EAAKk7C,EAAyB,EAAG97C,GACzE,EAAI,SAAU+7C,EAAQn7C,EAAKZ,GAEzB,OADA+7C,EAAOn7C,GAAOZ,EACP+7C,CACT,C,mBCTAjC,EAAON,QAAU,SAAUwC,EAAQh8C,GACjC,MAAO,CACL6yB,aAAuB,EAATmpB,GACdlpB,eAAyB,EAATkpB,GAChBhB,WAAqB,EAATgB,GACZh8C,MAAOA,EAEX,C,uBCPA,IAAI05C,EAAa,EAAQ,MACrBkC,EAAuB,EAAQ,KAC/BK,EAAc,EAAQ,KACtBC,EAAuB,EAAQ,MAEnCpC,EAAON,QAAU,SAAUoB,EAAGh6C,EAAKZ,EAAOif,GACnCA,IAASA,EAAU,CAAC,GACzB,IAAIk9B,EAASl9B,EAAQ4T,WACjBvzB,OAAwBY,IAAjB+e,EAAQ3f,KAAqB2f,EAAQ3f,KAAOsB,EAEvD,GADI84C,EAAW15C,IAAQi8C,EAAYj8C,EAAOV,EAAM2f,GAC5CA,EAAQje,OACNm7C,EAAQvB,EAAEh6C,GAAOZ,EAChBk8C,EAAqBt7C,EAAKZ,OAC1B,CACL,IACOif,EAAQm9B,OACJxB,EAAEh6C,KAAMu7C,GAAS,UADEvB,EAAEh6C,EAEhC,CAAE,MAAOd,GAAqB,CAC1Bq8C,EAAQvB,EAAEh6C,GAAOZ,EAChB47C,EAAqBzxC,EAAEywC,EAAGh6C,EAAK,CAClCZ,MAAOA,EACP6yB,YAAY,EACZC,cAAe7T,EAAQo9B,gBACvBrB,UAAW/7B,EAAQq9B,aAEvB,CAAE,OAAO1B,CACX,C,uBC1BA,IAAI55C,EAAS,EAAQ,MAGjB4vB,EAAiBvwB,OAAOuwB,eAE5BkpB,EAAON,QAAU,SAAU54C,EAAKZ,GAC9B,IACE4wB,EAAe5vB,EAAQJ,EAAK,CAAEZ,MAAOA,EAAO8yB,cAAc,EAAMkoB,UAAU,GAC5E,CAAE,MAAOl7C,GACPkB,EAAOJ,GAAOZ,CAChB,CAAE,OAAOA,CACX,C,uBCXA,IAAIu8C,EAAQ,EAAQ,MAGpBzC,EAAON,SAAW+C,GAAM,WAEtB,OAA+E,IAAxEl8C,OAAOuwB,eAAe,CAAC,EAAG,EAAG,CAAEtiB,IAAK,WAAc,OAAO,CAAG,IAAK,EAC1E,G,uBCNA,IAAItN,EAAS,EAAQ,MACjB4H,EAAW,EAAQ,KAEnBnH,EAAWT,EAAOS,SAElB+6C,EAAS5zC,EAASnH,IAAamH,EAASnH,EAASk6B,eAErDme,EAAON,QAAU,SAAUW,GACzB,OAAOqC,EAAS/6C,EAASk6B,cAAcwe,GAAM,CAAC,CAChD,C,mBCTA,IAAIP,EAAaC,UACb4C,EAAmB,iBAEvB3C,EAAON,QAAU,SAAUW,GACzB,GAAIA,EAAKsC,EAAkB,MAAM7C,EAAW,kCAC5C,OAAOO,CACT,C,mBCNAL,EAAON,QAAU,CACfkD,eAAgB,CAAEl3B,EAAG,iBAAkBtpB,EAAG,EAAG43B,EAAG,GAChD6oB,mBAAoB,CAAEn3B,EAAG,qBAAsBtpB,EAAG,EAAG43B,EAAG,GACxD8oB,sBAAuB,CAAEp3B,EAAG,wBAAyBtpB,EAAG,EAAG43B,EAAG,GAC9D+oB,mBAAoB,CAAEr3B,EAAG,qBAAsBtpB,EAAG,EAAG43B,EAAG,GACxDgpB,sBAAuB,CAAEt3B,EAAG,wBAAyBtpB,EAAG,EAAG43B,EAAG,GAC9DipB,mBAAoB,CAAEv3B,EAAG,sBAAuBtpB,EAAG,EAAG43B,EAAG,GACzDkpB,2BAA4B,CAAEx3B,EAAG,8BAA+BtpB,EAAG,EAAG43B,EAAG,GACzEmpB,cAAe,CAAEz3B,EAAG,gBAAiBtpB,EAAG,EAAG43B,EAAG,GAC9CopB,kBAAmB,CAAE13B,EAAG,oBAAqBtpB,EAAG,EAAG43B,EAAG,GACtDqpB,oBAAqB,CAAE33B,EAAG,sBAAuBtpB,EAAG,GAAI43B,EAAG,GAC3DspB,kBAAmB,CAAE53B,EAAG,oBAAqBtpB,EAAG,GAAI43B,EAAG,GACvDupB,YAAa,CAAE73B,EAAG,aAActpB,EAAG,GAAI43B,EAAG,GAC1CwpB,yBAA0B,CAAE93B,EAAG,2BAA4BtpB,EAAG,GAAI43B,EAAG,GACrEypB,eAAgB,CAAE/3B,EAAG,gBAAiBtpB,EAAG,GAAI43B,EAAG,GAChD0pB,mBAAoB,CAAEh4B,EAAG,qBAAsBtpB,EAAG,GAAI43B,EAAG,GACzD2pB,gBAAiB,CAAEj4B,EAAG,iBAAkBtpB,EAAG,GAAI43B,EAAG,GAClD4pB,kBAAmB,CAAEl4B,EAAG,oBAAqBtpB,EAAG,GAAI43B,EAAG,GACvD6pB,cAAe,CAAEn4B,EAAG,eAAgBtpB,EAAG,GAAI43B,EAAG,GAC9C8pB,aAAc,CAAEp4B,EAAG,cAAetpB,EAAG,GAAI43B,EAAG,GAC5C+pB,WAAY,CAAEr4B,EAAG,YAAatpB,EAAG,GAAI43B,EAAG,GACxCgqB,iBAAkB,CAAEt4B,EAAG,mBAAoBtpB,EAAG,GAAI43B,EAAG,GACrDiqB,mBAAoB,CAAEv4B,EAAG,qBAAsBtpB,EAAG,GAAI43B,EAAG,GACzDkqB,aAAc,CAAEx4B,EAAG,cAAetpB,EAAG,GAAI43B,EAAG,GAC5CmqB,qBAAsB,CAAEz4B,EAAG,wBAAyBtpB,EAAG,GAAI43B,EAAG,GAC9DoqB,eAAgB,CAAE14B,EAAG,iBAAkBtpB,EAAG,GAAI43B,EAAG,G,mBCzBnDgmB,EAAON,QAA8B,oBAAb50C,WAA4BpI,OAAOoI,UAAUu5C,YAAc,E,uBCAnF,IAOIz8C,EAAOu0B,EAPPj1B,EAAS,EAAQ,MACjBm9C,EAAY,EAAQ,MAEpB/8C,EAAUJ,EAAOI,QACjBg9C,EAAOp9C,EAAOo9C,KACdC,EAAWj9C,GAAWA,EAAQi9C,UAAYD,GAAQA,EAAKnoB,QACvDqoB,EAAKD,GAAYA,EAASC,GAG1BA,IACF58C,EAAQ48C,EAAGh3C,MAAM,KAGjB2uB,EAAUv0B,EAAM,GAAK,GAAKA,EAAM,GAAK,EAAI,IAAMA,EAAM,GAAKA,EAAM,MAK7Du0B,GAAWkoB,IACdz8C,EAAQy8C,EAAUz8C,MAAM,iBACnBA,GAASA,EAAM,IAAM,MACxBA,EAAQy8C,EAAUz8C,MAAM,iBACpBA,IAAOu0B,GAAWv0B,EAAM,MAIhCo4C,EAAON,QAAUvjB,C,mBCzBjB6jB,EAAON,QAAU,CACf,cACA,iBACA,gBACA,uBACA,iBACA,WACA,U,uBCRF,IAAIyB,EAAc,EAAQ,MAEtBsD,EAAS5iD,MACT+D,EAAUu7C,EAAY,GAAGv7C,SAEzB8+C,EAAO,SAAWx3B,GAAO,OAAOxqB,OAAO,IAAI+hD,EAAOv3B,GAAKy3B,MAAS,CAAzD,CAA2D,UAElEC,EAA2B,uBAC3BC,EAAwBD,EAAyB55C,KAAK05C,GAE1D1E,EAAON,QAAU,SAAUiF,EAAOG,GAChC,GAAID,GAAyC,iBAATF,IAAsBF,EAAOM,kBAC/D,MAAOD,IAAeH,EAAQ/+C,EAAQ++C,EAAOC,EAA0B,IACvE,OAAOD,CACX,C,uBCdA,IAAIz9C,EAAS,EAAQ,MACjB85C,EAA2B,UAC3BgE,EAA8B,EAAQ,MACtCC,EAAgB,EAAQ,MACxB7C,EAAuB,EAAQ,MAC/B8C,EAA4B,EAAQ,MACpCC,EAAW,EAAQ,MAiBvBnF,EAAON,QAAU,SAAUv6B,EAAS7e,GAClC,IAGI8+C,EAAQ/+C,EAAQS,EAAKu+C,EAAgBC,EAAgBvuB,EAHrDwuB,EAASpgC,EAAQ9e,OACjBm/C,EAASrgC,EAAQje,OACjBu+C,EAAStgC,EAAQugC,KASrB,GANEr/C,EADEm/C,EACOt+C,EACAu+C,EACAv+C,EAAOq+C,IAAWnD,EAAqBmD,EAAQ,CAAC,GAEhDr+C,EAAOq+C,IAAWr+C,EAAOq+C,GAAQj5C,UAExCjG,EAAQ,IAAKS,KAAOR,EAAQ,CAQ9B,GAPAg/C,EAAiBh/C,EAAOQ,GACpBqe,EAAQwgC,gBACV5uB,EAAaiqB,EAAyB36C,EAAQS,GAC9Cu+C,EAAiBtuB,GAAcA,EAAW7wB,OACrCm/C,EAAiBh/C,EAAOS,GAC/Bs+C,EAASD,EAASK,EAAS1+C,EAAMy+C,GAAUE,EAAS,IAAM,KAAO3+C,EAAKqe,EAAQygC,SAEzER,QAA6Bh/C,IAAnBi/C,EAA8B,CAC3C,UAAWC,UAAyBD,EAAgB,SACpDH,EAA0BI,EAAgBD,EAC5C,EAEIlgC,EAAQ0gC,MAASR,GAAkBA,EAAeQ,OACpDb,EAA4BM,EAAgB,QAAQ,GAEtDL,EAAc5+C,EAAQS,EAAKw+C,EAAgBngC,EAC7C,CACF,C,mBCrDA66B,EAAON,QAAU,SAAUoG,GACzB,IACE,QAASA,GACX,CAAE,MAAO9/C,GACP,OAAO,CACT,CACF,C,uBCNA,IAAIy8C,EAAQ,EAAQ,MAEpBzC,EAAON,SAAW+C,GAAM,WAEtB,IAAIz3C,EAAO,WAA4B,EAAEkW,OAEzC,MAAsB,mBAARlW,GAAsBA,EAAKpE,eAAe,YAC1D,G,sBCPA,IAAIm/C,EAAc,EAAQ,MAEtBl4C,EAAOwgB,SAAS/hB,UAAUuB,KAE9BmyC,EAAON,QAAUqG,EAAcl4C,EAAKqT,KAAKrT,GAAQ,WAC/C,OAAOA,EAAK6J,MAAM7J,EAAMuvB,UAC1B,C,uBCNA,IAAI2jB,EAAc,EAAQ,MACtBxoC,EAAS,EAAQ,MAEjBytC,EAAoB33B,SAAS/hB,UAE7B25C,EAAgBlF,GAAex6C,OAAOy6C,yBAEtC0B,EAASnqC,EAAOytC,EAAmB,QAEnCE,EAASxD,GAA0D,cAAhD,WAAqC,EAAEl9C,KAC1D2gD,EAAezD,KAAY3B,GAAgBA,GAAekF,EAAcD,EAAmB,QAAQhtB,cAEvGgnB,EAAON,QAAU,CACfgD,OAAQA,EACRwD,OAAQA,EACRC,aAAcA,E,uBCfhB,IAAIhF,EAAc,EAAQ,MACtBiF,EAAY,EAAQ,MAExBpG,EAAON,QAAU,SAAUuC,EAAQn7C,EAAK6T,GACtC,IAEE,OAAOwmC,EAAYiF,EAAU7/C,OAAOy6C,yBAAyBiB,EAAQn7C,GAAK6T,IAC5E,CAAE,MAAO3U,GAAqB,CAChC,C,uBCRA,IAAI+/C,EAAc,EAAQ,MAEtBC,EAAoB33B,SAAS/hB,UAC7BuB,EAAOm4C,EAAkBn4C,KACzBw4C,EAAsBN,GAAeC,EAAkB9kC,KAAKA,KAAKrT,EAAMA,GAE3EmyC,EAAON,QAAUqG,EAAcM,EAAsB,SAAUp4C,GAC7D,OAAO,WACL,OAAOJ,EAAK6J,MAAMzJ,EAAImvB,UACxB,CACF,C,uBCVA,IAAIl2B,EAAS,EAAQ,MACjB04C,EAAa,EAAQ,MAErB0G,EAAY,SAAUrG,GACxB,OAAOL,EAAWK,GAAYA,OAAW75C,CAC3C,EAEA45C,EAAON,QAAU,SAAU9iB,EAAWjiB,GACpC,OAAOyiB,UAAUj7B,OAAS,EAAImkD,EAAUp/C,EAAO01B,IAAc11B,EAAO01B,IAAc11B,EAAO01B,GAAWjiB,EACtG,C,sBCTA,IAAIyrC,EAAY,EAAQ,MACpBG,EAAoB,EAAQ,KAIhCvG,EAAON,QAAU,SAAU8G,EAAGC,GAC5B,IAAIC,EAAOF,EAAEC,GACb,OAAOF,EAAkBG,QAAQtgD,EAAYggD,EAAUM,EACzD,C,uBCRA,IAAIC,EAAQ,SAAUtG,GACpB,OAAOA,GAAMA,EAAGjY,OAASA,MAAQiY,CACnC,EAGAL,EAAON,QAELiH,EAA2B,iBAAd1I,YAA0BA,aACvC0I,EAAuB,iBAAV1/C,QAAsBA,SAEnC0/C,EAAqB,iBAAR3/C,MAAoBA,OACjC2/C,EAAuB,iBAAV,EAAAtX,GAAsB,EAAAA,IACnCsX,EAAqB,iBAARnjD,MAAoBA,OAEjC,WAAe,OAAOA,IAAO,CAA7B,IAAoC6qB,SAAS,cAATA,E,uBCdtC,IAAI8yB,EAAc,EAAQ,MACtByF,EAAW,EAAQ,MAEnBhgD,EAAiBu6C,EAAY,CAAC,EAAEv6C,gBAKpCo5C,EAAON,QAAUn5C,OAAOgS,QAAU,SAAgB8nC,EAAIv5C,GACpD,OAAOF,EAAeggD,EAASvG,GAAKv5C,EACtC,C,mBCVAk5C,EAAON,QAAU,CAAC,C,sBCAlB,IAAIqB,EAAc,EAAQ,MACtB0B,EAAQ,EAAQ,MAChB5gB,EAAgB,EAAQ,MAG5Bme,EAAON,SAAWqB,IAAgB0B,GAAM,WAEtC,OAES,IAFFl8C,OAAOuwB,eAAe+K,EAAc,OAAQ,IAAK,CACtDrtB,IAAK,WAAc,OAAO,CAAG,IAC5BnG,CACL,G,uBCVA,IAAI8yC,EAAc,EAAQ,MACtBsB,EAAQ,EAAQ,MAChBoE,EAAU,EAAQ,MAElBpF,EAAUl7C,OACViH,EAAQ2zC,EAAY,GAAG3zC,OAG3BwyC,EAAON,QAAU+C,GAAM,WAGrB,OAAQhB,EAAQ,KAAKqF,qBAAqB,EAC5C,IAAK,SAAUzG,GACb,MAAuB,WAAhBwG,EAAQxG,GAAmB7yC,EAAM6yC,EAAI,IAAMoB,EAAQpB,EAC5D,EAAIoB,C,uBCdJ,IAAI7B,EAAa,EAAQ,MACrB9wC,EAAW,EAAQ,KACnBzC,EAAiB,EAAQ,MAG7B2zC,EAAON,QAAU,SAAUkB,EAAOmG,EAAOC,GACvC,IAAIC,EAAWC,EAUf,OAPE76C,GAEAuzC,EAAWqH,EAAYF,EAAMxhD,cAC7B0hD,IAAcD,GACdl4C,EAASo4C,EAAqBD,EAAU36C,YACxC46C,IAAuBF,EAAQ16C,WAC/BD,EAAeu0C,EAAOsG,GACjBtG,CACT,C,uBCjBA,IAAIO,EAAc,EAAQ,MACtBvB,EAAa,EAAQ,MACrBuH,EAAQ,EAAQ,MAEhBC,EAAmBjG,EAAY9yB,SAAS+Q,UAGvCwgB,EAAWuH,EAAME,iBACpBF,EAAME,cAAgB,SAAUhH,GAC9B,OAAO+G,EAAiB/G,EAC1B,GAGFL,EAAON,QAAUyH,EAAME,a,uBCbvB,IAYIjyC,EAAKZ,EAAKiE,EAZV6uC,EAAkB,EAAQ,KAC1BpgD,EAAS,EAAQ,MACjB4H,EAAW,EAAQ,KACnBk2C,EAA8B,EAAQ,MACtCzsC,EAAS,EAAQ,MACjBgvC,EAAS,EAAQ,MACjBC,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MAErBC,EAA6B,6BAC7B3H,EAAY74C,EAAO64C,UACnBjqC,EAAU5O,EAAO4O,QAGjB6xC,EAAU,SAAUtH,GACtB,OAAO5nC,EAAI4nC,GAAM7rC,EAAI6rC,GAAMjrC,EAAIirC,EAAI,CAAC,EACtC,EAEIuH,EAAY,SAAUC,GACxB,OAAO,SAAUxH,GACf,IAAIxyB,EACJ,IAAK/e,EAASuxC,KAAQxyB,EAAQrZ,EAAI6rC,IAAKx2C,OAASg+C,EAC9C,MAAM,IAAI9H,EAAU,0BAA4B8H,EAAO,aACvD,OAAOh6B,CACX,CACF,EAEA,GAAIy5B,GAAmBC,EAAO15B,MAAO,CACnC,IAAIs5B,EAAQI,EAAO15B,QAAU05B,EAAO15B,MAAQ,IAAI/X,GAEhDqxC,EAAM3yC,IAAM2yC,EAAM3yC,IAClB2yC,EAAM1uC,IAAM0uC,EAAM1uC,IAClB0uC,EAAM/xC,IAAM+xC,EAAM/xC,IAElBA,EAAM,SAAUirC,EAAIyH,GAClB,GAAIX,EAAM1uC,IAAI4nC,GAAK,MAAM,IAAIN,EAAU2H,GAGvC,OAFAI,EAASC,OAAS1H,EAClB8G,EAAM/xC,IAAIirC,EAAIyH,GACPA,CACT,EACAtzC,EAAM,SAAU6rC,GACd,OAAO8G,EAAM3yC,IAAI6rC,IAAO,CAAC,CAC3B,EACA5nC,EAAM,SAAU4nC,GACd,OAAO8G,EAAM1uC,IAAI4nC,EACnB,CACF,KAAO,CACL,IAAI2H,EAAQR,EAAU,SACtBC,EAAWO,IAAS,EACpB5yC,EAAM,SAAUirC,EAAIyH,GAClB,GAAIvvC,EAAO8nC,EAAI2H,GAAQ,MAAM,IAAIjI,EAAU2H,GAG3C,OAFAI,EAASC,OAAS1H,EAClB2E,EAA4B3E,EAAI2H,EAAOF,GAChCA,CACT,EACAtzC,EAAM,SAAU6rC,GACd,OAAO9nC,EAAO8nC,EAAI2H,GAAS3H,EAAG2H,GAAS,CAAC,CAC1C,EACAvvC,EAAM,SAAU4nC,GACd,OAAO9nC,EAAO8nC,EAAI2H,EACpB,CACF,CAEAhI,EAAON,QAAU,CACftqC,IAAKA,EACLZ,IAAKA,EACLiE,IAAKA,EACLkvC,QAASA,EACTC,UAAWA,E,uBCpEb,IAAIf,EAAU,EAAQ,MAKtB7G,EAAON,QAAU37C,MAAMC,SAAW,SAAiBi8C,GACjD,MAA6B,UAAtB4G,EAAQ5G,EACjB,C,mBCNA,IAAIgI,EAAiC,iBAAZtgD,UAAwBA,SAASugD,IAK1DlI,EAAON,QAAgC,oBAAfuI,QAA8C7hD,IAAhB6hD,EAA4B,SAAUhI,GAC1F,MAA0B,mBAAZA,GAA0BA,IAAagI,CACvD,EAAI,SAAUhI,GACZ,MAA0B,mBAAZA,CAChB,C,uBCVA,IAAIwC,EAAQ,EAAQ,MAChB7C,EAAa,EAAQ,MAErBuI,EAAc,kBAEdhD,EAAW,SAAUiD,EAASC,GAChC,IAAIniD,EAAQ2G,EAAKmgC,EAAUob,IAC3B,OAAOliD,IAAUoiD,GACbpiD,IAAUqiD,IACV3I,EAAWyI,GAAa5F,EAAM4F,KAC5BA,EACR,EAEIrb,EAAYmY,EAASnY,UAAY,SAAUwb,GAC7C,OAAO9lD,OAAO8lD,GAAQ5iD,QAAQuiD,EAAa,KAAK9iC,aAClD,EAEIxY,EAAOs4C,EAASt4C,KAAO,CAAC,EACxB07C,EAASpD,EAASoD,OAAS,IAC3BD,EAAWnD,EAASmD,SAAW,IAEnCtI,EAAON,QAAUyF,C,kBCnBjBnF,EAAON,QAAU,SAAUW,GACzB,OAAc,OAAPA,QAAsBj6C,IAAPi6C,CACxB,C,sBCJA,IAAIT,EAAa,EAAQ,MAEzBI,EAAON,QAAU,SAAUW,GACzB,MAAoB,iBAANA,EAAwB,OAAPA,EAAcT,EAAWS,EAC1D,C,sBCJA,IAAIvxC,EAAW,EAAQ,KAEvBkxC,EAAON,QAAU,SAAUO,GACzB,OAAOnxC,EAASmxC,IAA0B,OAAbA,CAC/B,C,mBCJAD,EAAON,SAAU,C,uBCAjB,IAAI+I,EAAa,EAAQ,MACrB7I,EAAa,EAAQ,MACrBQ,EAAgB,EAAQ,MACxBsI,EAAoB,EAAQ,MAE5BjH,EAAUl7C,OAEdy5C,EAAON,QAAUgJ,EAAoB,SAAUrI,GAC7C,MAAoB,iBAANA,CAChB,EAAI,SAAUA,GACZ,IAAIsI,EAAUF,EAAW,UACzB,OAAO7I,EAAW+I,IAAYvI,EAAcuI,EAAQr8C,UAAWm1C,EAAQpB,GACzE,C,uBCZA,IAAIuI,EAAW,EAAQ,KAIvB5I,EAAON,QAAU,SAAU9xC,GACzB,OAAOg7C,EAASh7C,EAAIzL,OACtB,C,sBCNA,IAAIg/C,EAAc,EAAQ,MACtBsB,EAAQ,EAAQ,MAChB7C,EAAa,EAAQ,MACrBrnC,EAAS,EAAQ,MACjBwoC,EAAc,EAAQ,MACtB8H,EAA6B,qBAC7BxB,EAAgB,EAAQ,MACxByB,EAAsB,EAAQ,MAE9BC,EAAuBD,EAAoBnB,QAC3CqB,EAAmBF,EAAoBt0C,IACvC2rC,EAAUz9C,OAEVo0B,EAAiBvwB,OAAOuwB,eACxBsqB,EAAcD,EAAY,GAAG79B,OAC7B1d,EAAUu7C,EAAY,GAAGv7C,SACzB5C,EAAOm+C,EAAY,GAAGn+C,MAEtBimD,EAAsBlI,IAAgB0B,GAAM,WAC9C,OAAsF,IAA/E3rB,GAAe,WAA0B,GAAG,SAAU,CAAE5wB,MAAO,IAAK/D,MAC7E,IAEI+mD,EAAWxmD,OAAOA,QAAQ8K,MAAM,UAEhC20C,EAAcnC,EAAON,QAAU,SAAUx5C,EAAOV,EAAM2f,GACf,YAArCi8B,EAAYjB,EAAQ36C,GAAO,EAAG,KAChCA,EAAO,IAAMI,EAAQu6C,EAAQ36C,GAAO,wBAAyB,MAAQ,KAEnE2f,GAAWA,EAAQ7H,SAAQ9X,EAAO,OAASA,GAC3C2f,GAAWA,EAAQlH,SAAQzY,EAAO,OAASA,KAC1C+S,EAAOrS,EAAO,SAAY2iD,GAA8B3iD,EAAMV,OAASA,KACtEu7C,EAAajqB,EAAe5wB,EAAO,OAAQ,CAAEA,MAAOV,EAAMwzB,cAAc,IACvE9yB,EAAMV,KAAOA,GAEhByjD,GAAuB9jC,GAAW5M,EAAO4M,EAAS,UAAYjf,EAAM/D,SAAWgjB,EAAQgkC,OACzFryB,EAAe5wB,EAAO,SAAU,CAAEA,MAAOif,EAAQgkC,QAEnD,IACMhkC,GAAW5M,EAAO4M,EAAS,gBAAkBA,EAAQ5f,YACnDw7C,GAAajqB,EAAe5wB,EAAO,YAAa,CAAEg7C,UAAU,IAEvDh7C,EAAMoG,YAAWpG,EAAMoG,eAAYlG,EAChD,CAAE,MAAOJ,GAAqB,CAC9B,IAAI6nB,EAAQk7B,EAAqB7iD,GAG/B,OAFGqS,EAAOsV,EAAO,YACjBA,EAAMvnB,OAAStD,EAAKkmD,EAAyB,iBAAR1jD,EAAmBA,EAAO,KACxDU,CACX,EAIAmoB,SAAS/hB,UAAU8yB,SAAW+iB,GAAY,WACxC,OAAOvC,EAAWp8C,OAASwlD,EAAiBxlD,MAAM8C,QAAU+gD,EAAc7jD,KAC5E,GAAG,W,mBCrDH,IAAI4lD,EAAOhhB,KAAKghB,KACZC,EAAQjhB,KAAKihB,MAKjBrJ,EAAON,QAAUtX,KAAKkhB,OAAS,SAAeC,GAC5C,IAAI94C,GAAK84C,EACT,OAAQ94C,EAAI,EAAI44C,EAAQD,GAAM34C,EAChC,C,uBCTA,IAAI2uB,EAAW,EAAQ,MAEvB4gB,EAAON,QAAU,SAAUO,EAAUuJ,GACnC,YAAoBpjD,IAAb65C,EAAyB7iB,UAAUj7B,OAAS,EAAI,GAAKqnD,EAAWpqB,EAAS6gB,EAClF,C,sBCJA,IAAIc,EAAc,EAAQ,MACtB0I,EAAiB,EAAQ,KACzBC,EAA0B,EAAQ,MAClCC,EAAW,EAAQ,MACnBC,EAAgB,EAAQ,MAExB9J,EAAaC,UAEb8J,EAAkBtjD,OAAOuwB,eAEzBgzB,EAA4BvjD,OAAOy6C,yBACnC+I,EAAa,aACb5D,EAAe,eACf6D,EAAW,WAIftK,EAAQrvC,EAAI0wC,EAAc2I,EAA0B,SAAwB5I,EAAG2F,EAAGwD,GAIhF,GAHAN,EAAS7I,GACT2F,EAAImD,EAAcnD,GAClBkD,EAASM,GACQ,oBAANnJ,GAA0B,cAAN2F,GAAqB,UAAWwD,GAAcD,KAAYC,IAAeA,EAAWD,GAAW,CAC5H,IAAIx2B,EAAUs2B,EAA0BhJ,EAAG2F,GACvCjzB,GAAWA,EAAQw2B,KACrBlJ,EAAE2F,GAAKwD,EAAW/jD,MAClB+jD,EAAa,CACXjxB,aAAcmtB,KAAgB8D,EAAaA,EAAW9D,GAAgB3yB,EAAQ2yB,GAC9EptB,WAAYgxB,KAAcE,EAAaA,EAAWF,GAAcv2B,EAAQu2B,GACxE7I,UAAU,GAGhB,CAAE,OAAO2I,EAAgB/I,EAAG2F,EAAGwD,EACjC,EAAIJ,EAAkB,SAAwB/I,EAAG2F,EAAGwD,GAIlD,GAHAN,EAAS7I,GACT2F,EAAImD,EAAcnD,GAClBkD,EAASM,GACLR,EAAgB,IAClB,OAAOI,EAAgB/I,EAAG2F,EAAGwD,EAC/B,CAAE,MAAOjkD,GAAqB,CAC9B,GAAI,QAASikD,GAAc,QAASA,EAAY,MAAM,IAAInK,EAAW,2BAErE,MADI,UAAWmK,IAAYnJ,EAAE2F,GAAKwD,EAAW/jD,OACtC46C,CACT,C,uBC1CA,IAAIC,EAAc,EAAQ,MACtBlzC,EAAO,EAAQ,KACfq8C,EAA6B,EAAQ,MACrClI,EAA2B,EAAQ,MACnCzB,EAAkB,EAAQ,MAC1BqJ,EAAgB,EAAQ,MACxBrxC,EAAS,EAAQ,MACjBkxC,EAAiB,EAAQ,KAGzBK,EAA4BvjD,OAAOy6C,yBAIvCtB,EAAQrvC,EAAI0wC,EAAc+I,EAA4B,SAAkChJ,EAAG2F,GAGzF,GAFA3F,EAAIP,EAAgBO,GACpB2F,EAAImD,EAAcnD,GACdgD,EAAgB,IAClB,OAAOK,EAA0BhJ,EAAG2F,EACtC,CAAE,MAAOzgD,GAAqB,CAC9B,GAAIuS,EAAOuoC,EAAG2F,GAAI,OAAOzE,GAA0Bn0C,EAAKq8C,EAA2B75C,EAAGywC,EAAG2F,GAAI3F,EAAE2F,GACjG,C,sBCrBA,IAAI0D,EAAqB,EAAQ,MAC7BC,EAAc,EAAQ,MAEtB3C,EAAa2C,EAAYriC,OAAO,SAAU,aAK9C23B,EAAQrvC,EAAI9J,OAAO2Q,qBAAuB,SAA6B4pC,GACrE,OAAOqJ,EAAmBrJ,EAAG2G,EAC/B,C,qBCTA/H,EAAQrvC,EAAI9J,OAAO8jD,qB,uBCDnB,IAAIlJ,EAAc,EAAQ,MAE1BnB,EAAON,QAAUyB,EAAY,CAAC,EAAEf,c,uBCFhC,IAAIe,EAAc,EAAQ,MACtB5oC,EAAS,EAAQ,MACjBgoC,EAAkB,EAAQ,MAC1Br+B,EAAU,gBACVulC,EAAa,EAAQ,MAErB5iD,EAAOs8C,EAAY,GAAGt8C,MAE1Bm7C,EAAON,QAAU,SAAUuC,EAAQqI,GACjC,IAGIxjD,EAHAg6C,EAAIP,EAAgB0B,GACpB//C,EAAI,EACJyJ,EAAS,GAEb,IAAK7E,KAAOg6C,GAAIvoC,EAAOkvC,EAAY3gD,IAAQyR,EAAOuoC,EAAGh6C,IAAQjC,EAAK8G,EAAQ7E,GAE1E,MAAOwjD,EAAMnoD,OAASD,EAAOqW,EAAOuoC,EAAGh6C,EAAMwjD,EAAMpoD,SAChDggB,EAAQvW,EAAQ7E,IAAQjC,EAAK8G,EAAQ7E,IAExC,OAAO6E,CACT,C,qBCnBA,IAAI4+C,EAAwB,CAAC,EAAEzD,qBAE3B9F,EAA2Bz6C,OAAOy6C,yBAGlCwJ,EAAcxJ,IAA6BuJ,EAAsB18C,KAAK,CAAE,EAAG,GAAK,GAIpF6xC,EAAQrvC,EAAIm6C,EAAc,SAA8BhE,GACtD,IAAIzvB,EAAaiqB,EAAyBx9C,KAAMgjD,GAChD,QAASzvB,GAAcA,EAAWgC,UACpC,EAAIwxB,C,uBCXJ,IAAIE,EAAsB,EAAQ,MAC9Bd,EAAW,EAAQ,MACnBe,EAAqB,EAAQ,MAMjC1K,EAAON,QAAUn5C,OAAO8F,iBAAmB,aAAe,CAAC,EAAI,WAC7D,IAEI4R,EAFA0sC,GAAiB,EACjB3/C,EAAO,CAAC,EAEZ,IACEiT,EAASwsC,EAAoBlkD,OAAO+F,UAAW,YAAa,OAC5D2R,EAAOjT,EAAM,IACb2/C,EAAiB3/C,aAAgBjH,KACnC,CAAE,MAAOiC,GAAqB,CAC9B,OAAO,SAAwB86C,EAAG5mC,GAKhC,OAJAyvC,EAAS7I,GACT4J,EAAmBxwC,GACfywC,EAAgB1sC,EAAO6iC,EAAG5mC,GACzB4mC,EAAE8J,UAAY1wC,EACZ4mC,CACT,CACF,CAhB+D,QAgBzD16C,E,uBCzBN,IAAIyH,EAAO,EAAQ,KACf+xC,EAAa,EAAQ,MACrB9wC,EAAW,EAAQ,KAEnBgxC,EAAaC,UAIjBC,EAAON,QAAU,SAAU77C,EAAOgnD,GAChC,IAAI58C,EAAIsrB,EACR,GAAa,WAATsxB,GAAqBjL,EAAW3xC,EAAKpK,EAAMu7B,YAActwB,EAASyqB,EAAM1rB,EAAKI,EAAIpK,IAAS,OAAO01B,EACrG,GAAIqmB,EAAW3xC,EAAKpK,EAAMinD,WAAah8C,EAASyqB,EAAM1rB,EAAKI,EAAIpK,IAAS,OAAO01B,EAC/E,GAAa,WAATsxB,GAAqBjL,EAAW3xC,EAAKpK,EAAMu7B,YAActwB,EAASyqB,EAAM1rB,EAAKI,EAAIpK,IAAS,OAAO01B,EACrG,MAAM,IAAIumB,EAAW,0CACvB,C,uBCdA,IAAI2I,EAAa,EAAQ,MACrBtH,EAAc,EAAQ,MACtB4J,EAA4B,EAAQ,KACpCC,EAA8B,EAAQ,MACtCrB,EAAW,EAAQ,MAEnB5hC,EAASo5B,EAAY,GAAGp5B,QAG5Bi4B,EAAON,QAAU+I,EAAW,UAAW,YAAc,SAAiBpI,GACpE,IAAI7xC,EAAOu8C,EAA0B16C,EAAEs5C,EAAStJ,IAC5CgK,EAAwBW,EAA4B36C,EACxD,OAAOg6C,EAAwBtiC,EAAOvZ,EAAM67C,EAAsBhK,IAAO7xC,CAC3E,C,uBCbA,IAAI+3C,EAAoB,EAAQ,KAE5BzG,EAAaC,UAIjBC,EAAON,QAAU,SAAUW,GACzB,GAAIkG,EAAkBlG,GAAK,MAAM,IAAIP,EAAW,wBAA0BO,GAC1E,OAAOA,CACT,C,uBCTA,IAAIkH,EAAS,EAAQ,MACjB79C,EAAM,EAAQ,KAEd8E,EAAO+4C,EAAO,QAElBvH,EAAON,QAAU,SAAU54C,GACzB,OAAO0H,EAAK1H,KAAS0H,EAAK1H,GAAO4C,EAAI5C,GACvC,C,uBCPA,IAAII,EAAS,EAAQ,MACjBk7C,EAAuB,EAAQ,MAE/B6I,EAAS,qBACT9D,EAAQjgD,EAAO+jD,IAAW7I,EAAqB6I,EAAQ,CAAC,GAE5DjL,EAAON,QAAUyH,C,uBCNjB,IAAI+D,EAAU,EAAQ,MAClB/D,EAAQ,EAAQ,OAEnBnH,EAAON,QAAU,SAAU54C,EAAKZ,GAC/B,OAAOihD,EAAMrgD,KAASqgD,EAAMrgD,QAAiBV,IAAVF,EAAsBA,EAAQ,CAAC,EACpE,GAAG,WAAY,IAAIrB,KAAK,CACtBs3B,QAAS,SACT5N,KAAM28B,EAAU,OAAS,SACzBC,UAAW,4CACXC,QAAS,2DACT9kD,OAAQ,uC,uBCTV,IAAI+kD,EAAa,EAAQ,MACrB5I,EAAQ,EAAQ,MAChBv7C,EAAS,EAAQ,MAEjBi5C,EAAUj5C,EAAOxE,OAGrBs9C,EAAON,UAAYn5C,OAAO8jD,wBAA0B5H,GAAM,WACxD,IAAI6I,EAASt1C,OAAO,oBAKpB,OAAQmqC,EAAQmL,MAAa/kD,OAAO+kD,aAAmBt1C,UAEpDA,OAAO6vC,MAAQwF,GAAcA,EAAa,EAC/C,G,uBCjBA,IAAIE,EAAsB,EAAQ,MAE9B/U,EAAMpO,KAAKoO,IACXnO,EAAMD,KAAKC,IAKf2X,EAAON,QAAU,SAAU3tC,EAAO5P,GAChC,IAAIqpD,EAAUD,EAAoBx5C,GAClC,OAAOy5C,EAAU,EAAIhV,EAAIgV,EAAUrpD,EAAQ,GAAKkmC,EAAImjB,EAASrpD,EAC/D,C,uBCVA,IAAIspD,EAAgB,EAAQ,MACxBC,EAAyB,EAAQ,MAErC1L,EAAON,QAAU,SAAUW,GACzB,OAAOoL,EAAcC,EAAuBrL,GAC9C,C,uBCNA,IAAIiJ,EAAQ,EAAQ,MAIpBtJ,EAAON,QAAU,SAAUO,GACzB,IAAIz8B,GAAUy8B,EAEd,OAAOz8B,IAAWA,GAAqB,IAAXA,EAAe,EAAI8lC,EAAM9lC,EACvD,C,sBCRA,IAAI+nC,EAAsB,EAAQ,MAE9BljB,EAAMD,KAAKC,IAIf2X,EAAON,QAAU,SAAUO,GACzB,IAAI1U,EAAMggB,EAAoBtL,GAC9B,OAAO1U,EAAM,EAAIlD,EAAIkD,EAAK,kBAAoB,CAChD,C,uBCTA,IAAImgB,EAAyB,EAAQ,MAEjCjK,EAAUl7C,OAIdy5C,EAAON,QAAU,SAAUO,GACzB,OAAOwB,EAAQiK,EAAuBzL,GACxC,C,uBCRA,IAAIpyC,EAAO,EAAQ,KACfiB,EAAW,EAAQ,KACnB6H,EAAW,EAAQ,MACnBg1C,EAAY,EAAQ,KACpBC,EAAsB,EAAQ,MAC9BrK,EAAkB,EAAQ,MAE1BzB,EAAaC,UACb8L,EAAetK,EAAgB,eAInCvB,EAAON,QAAU,SAAU77C,EAAOgnD,GAChC,IAAK/7C,EAASjL,IAAU8S,EAAS9S,GAAQ,OAAOA,EAChD,IACI8H,EADAmgD,EAAeH,EAAU9nD,EAAOgoD,GAEpC,GAAIC,EAAc,CAGhB,QAFa1lD,IAATykD,IAAoBA,EAAO,WAC/Bl/C,EAASkC,EAAKi+C,EAAcjoD,EAAOgnD,IAC9B/7C,EAASnD,IAAWgL,EAAShL,GAAS,OAAOA,EAClD,MAAM,IAAIm0C,EAAW,0CACvB,CAEA,YADa15C,IAATykD,IAAoBA,EAAO,UACxBe,EAAoB/nD,EAAOgnD,EACpC,C,uBCxBA,IAAIkB,EAAc,EAAQ,MACtBp1C,EAAW,EAAQ,MAIvBqpC,EAAON,QAAU,SAAUO,GACzB,IAAIn5C,EAAMilD,EAAY9L,EAAU,UAChC,OAAOtpC,EAAS7P,GAAOA,EAAMA,EAAM,EACrC,C,uBCRA,IAAIy6C,EAAkB,EAAQ,MAE1BC,EAAgBD,EAAgB,eAChCv2C,EAAO,CAAC,EAEZA,EAAKw2C,GAAiB,IAEtBxB,EAAON,QAA2B,eAAjBh9C,OAAOsI,E,uBCPxB,IAAI67C,EAAU,EAAQ,MAElB1G,EAAUz9C,OAEds9C,EAAON,QAAU,SAAUO,GACzB,GAA0B,WAAtB4G,EAAQ5G,GAAwB,MAAM,IAAIF,UAAU,6CACxD,OAAOI,EAAQF,EACjB,C,mBCPA,IAAIE,EAAUz9C,OAEds9C,EAAON,QAAU,SAAUO,GACzB,IACE,OAAOE,EAAQF,EACjB,CAAE,MAAOj6C,GACP,MAAO,QACT,CACF,C,sBCRA,IAAIm7C,EAAc,EAAQ,MAEtB//B,EAAK,EACL4qC,EAAU5jB,KAAK6jB,SACf7sB,EAAW+hB,EAAY,GAAI/hB,UAE/B4gB,EAAON,QAAU,SAAU54C,GACzB,MAAO,gBAAqBV,IAARU,EAAoB,GAAKA,GAAO,KAAOs4B,IAAWhe,EAAK4qC,EAAS,GACtF,C,uBCPA,IAAIE,EAAgB,EAAQ,MAE5BlM,EAAON,QAAUwM,IACXl2C,OAAO6vC,MACkB,iBAAnB7vC,OAAO8E,Q,uBCLnB,IAAIimC,EAAc,EAAQ,MACtB0B,EAAQ,EAAQ,MAIpBzC,EAAON,QAAUqB,GAAe0B,GAAM,WAEpC,OAGiB,KAHVl8C,OAAOuwB,gBAAe,WAA0B,GAAG,YAAa,CACrE5wB,MAAO,GACPg7C,UAAU,IACT50C,SACL,G,sBCXA,IAAIpF,EAAS,EAAQ,MACjB04C,EAAa,EAAQ,MAErB9pC,EAAU5O,EAAO4O,QAErBkqC,EAAON,QAAUE,EAAW9pC,IAAY,cAAc9K,KAAKtI,OAAOoT,G,uBCLlE,IAAI5O,EAAS,EAAQ,MACjBqgD,EAAS,EAAQ,MACjBhvC,EAAS,EAAQ,MACjB7O,EAAM,EAAQ,KACdwiD,EAAgB,EAAQ,MACxBxD,EAAoB,EAAQ,MAE5B1yC,EAAS9O,EAAO8O,OAChBm2C,EAAwB5E,EAAO,OAC/B6E,EAAwB1D,EAAoB1yC,EAAO,QAAUA,EAASA,GAAUA,EAAOq2C,eAAiB3iD,EAE5Gs2C,EAAON,QAAU,SAAUl6C,GAKvB,OAJG+S,EAAO4zC,EAAuB3mD,KACjC2mD,EAAsB3mD,GAAQ0mD,GAAiB3zC,EAAOvC,EAAQxQ,GAC1DwQ,EAAOxQ,GACP4mD,EAAsB,UAAY5mD,IAC/B2mD,EAAsB3mD,EACjC,C,uBCjBA,IAAI4vB,EAAI,EAAQ,MACZwxB,EAAW,EAAQ,MACnBnG,EAAoB,EAAQ,MAC5B6L,EAAiB,EAAQ,MACzBC,EAA2B,EAAQ,MACnC9J,EAAQ,EAAQ,MAEhB+J,EAAsB/J,GAAM,WAC9B,OAAoD,aAA7C,GAAG59C,KAAKgJ,KAAK,CAAE1L,OAAQ,YAAe,EAC/C,IAIIsqD,EAAiC,WACnC,IAEElmD,OAAOuwB,eAAe,GAAI,SAAU,CAAEoqB,UAAU,IAASr8C,MAC3D,CAAE,MAAOmB,GACP,OAAOA,aAAiB+5C,SAC1B,CACF,EAEIqF,EAASoH,IAAwBC,IAIrCr3B,EAAE,CAAE/uB,OAAQ,QAAS6T,OAAO,EAAMivC,MAAO,EAAGvD,OAAQR,GAAU,CAE5DvgD,KAAM,SAAcmwB,GAClB,IAAI8rB,EAAI8F,EAASpjD,MACb+nC,EAAMkV,EAAkBK,GACxB4L,EAAWtvB,UAAUj7B,OACzBoqD,EAAyBhhB,EAAMmhB,GAC/B,IAAK,IAAIxqD,EAAI,EAAGA,EAAIwqD,EAAUxqD,IAC5B4+C,EAAEvV,GAAOnO,UAAUl7B,GACnBqpC,IAGF,OADA+gB,EAAexL,EAAGvV,GACXA,CACT,G,uBCvCF,IAAInW,EAAI,EAAQ,MACZluB,EAAS,EAAQ,MACjBuhD,EAAa,EAAQ,MACrBzG,EAA2B,EAAQ,MACnClrB,EAAiB,SACjBve,EAAS,EAAQ,MACjBo0C,EAAa,EAAQ,MACrBC,EAAoB,EAAQ,MAC5BC,EAA0B,EAAQ,MAClCC,EAAwB,EAAQ,MAChCC,EAAkB,EAAQ,MAC1BhM,EAAc,EAAQ,MACtBmK,EAAU,EAAQ,MAElB8B,EAAgB,eAChBnrD,EAAQ4mD,EAAW,SACnBwE,EAAqBxE,EAAWuE,GAEhCE,EAAgB,WAClBP,EAAWnpD,KAAM2pD,GACjB,IAAIC,EAAkBhwB,UAAUj7B,OAC5BR,EAAUkrD,EAAwBO,EAAkB,OAAIhnD,EAAYg3B,UAAU,IAC9E53B,EAAOqnD,EAAwBO,EAAkB,OAAIhnD,EAAYg3B,UAAU,GAAI,SAC/EiwB,EAAO,IAAIJ,EAAmBtrD,EAAS6D,GACvCQ,EAAQ,IAAInE,EAAMF,GAItB,OAHAqE,EAAMR,KAAOwnD,EACbl2B,EAAeu2B,EAAM,QAASrL,EAAyB,EAAG+K,EAAgB/mD,EAAM2+C,MAAO,KACvFiI,EAAkBS,EAAM7pD,KAAM0pD,GACvBG,CACT,EAEIF,EAAwBD,EAAc5gD,UAAY2gD,EAAmB3gD,UAErEghD,EAAkB,UAAW,IAAIzrD,EAAMmrD,GACvCO,EAA0B,UAAW,IAAIN,EAAmB,EAAG,GAG/Dl2B,EAAak2B,GAAsBlM,GAAex6C,OAAOy6C,yBAAyB95C,EAAQ8lD,GAI1FQ,IAAqBz2B,KAAgBA,EAAWmqB,UAAYnqB,EAAWiC,cAEvEy0B,EAAqBH,IAAoBE,IAAqBD,EAIlEn4B,EAAE,CAAEluB,QAAQ,EAAM3B,aAAa,EAAMqgD,OAAQsF,GAAWuC,GAAsB,CAC5EC,aAAcD,EAAqBP,EAAgBD,IAGrD,IAAIU,EAAyBlF,EAAWuE,GACpCY,EAAkCD,EAAuBrhD,UAE7D,GAAIshD,EAAgCroD,cAAgBooD,EAKlD,IAAK,IAAI7mD,KAJJokD,GACHp0B,EAAe82B,EAAiC,cAAe5L,EAAyB,EAAG2L,IAG7Eb,EAAuB,GAAIv0C,EAAOu0C,EAAuBhmD,GAAM,CAC7E,IAAI+mD,EAAWf,EAAsBhmD,GACjCgnD,EAAeD,EAASniC,EACvBnT,EAAOo1C,EAAwBG,IAClCh3B,EAAe62B,EAAwBG,EAAc9L,EAAyB,EAAG6L,EAASzrD,GAE9F,C,wOClEF,MAAM2rD,EAAgBA,CAAC9L,EAAQ+L,IAAiBA,EAAarmC,MAAMvlB,GAAM6/C,aAAkB7/C,IAE3F,IAAI6rD,EACAC,EAEJ,SAASC,IACL,OAAQF,IACHA,EAAoB,CACjBG,YACAC,eACAC,SACAC,UACAC,gBAEZ,CAEA,SAASC,IACL,OAAQP,IACHA,EAAuB,CACpBK,UAAUjiD,UAAUoiD,QACpBH,UAAUjiD,UAAUqiD,SACpBJ,UAAUjiD,UAAUsiD,oBAEhC,CACA,MAAMC,EAAmB,IAAI/4C,QACvBg5C,EAAqB,IAAIh5C,QACzBi5C,EAA2B,IAAIj5C,QAC/Bk5C,EAAiB,IAAIl5C,QACrBm5C,EAAwB,IAAIn5C,QAClC,SAASo5C,EAAiB1jD,GACtB,MAAMtC,EAAU,IAAIC,SAAQ,CAACF,EAASD,KAClC,MAAMmmD,EAAWA,KACb3jD,EAAQmqC,oBAAoB,UAAWyZ,GACvC5jD,EAAQmqC,oBAAoB,QAAS3vC,EAAM,EAEzCopD,EAAUA,KACZnmD,EAAQ6Q,EAAKtO,EAAQG,SACrBwjD,GAAU,EAERnpD,EAAQA,KACVgD,EAAOwC,EAAQxF,OACfmpD,GAAU,EAEd3jD,EAAQqqC,iBAAiB,UAAWuZ,GACpC5jD,EAAQqqC,iBAAiB,QAAS7vC,EAAM,IAe5C,OAbAkD,EACK+X,MAAM/a,IAGHA,aAAiBqoD,WACjBM,EAAiBz5C,IAAIlP,EAAOsF,EAChC,IAGClC,OAAM,SAGX2lD,EAAsB75C,IAAIlM,EAASsC,GAC5BtC,CACX,CACA,SAASmmD,EAA+BC,GAEpC,GAAIR,EAAmBr2C,IAAI62C,GACvB,OACJ,MAAMp0C,EAAO,IAAI/R,SAAQ,CAACF,EAASD,KAC/B,MAAMmmD,EAAWA,KACbG,EAAG3Z,oBAAoB,WAAY4Z,GACnCD,EAAG3Z,oBAAoB,QAAS3vC,GAChCspD,EAAG3Z,oBAAoB,QAAS3vC,EAAM,EAEpCupD,EAAWA,KACbtmD,IACAkmD,GAAU,EAERnpD,EAAQA,KACVgD,EAAOsmD,EAAGtpD,OAAS,IAAI0nD,aAAa,aAAc,eAClDyB,GAAU,EAEdG,EAAGzZ,iBAAiB,WAAY0Z,GAChCD,EAAGzZ,iBAAiB,QAAS7vC,GAC7BspD,EAAGzZ,iBAAiB,QAAS7vC,EAAM,IAGvC8oD,EAAmB15C,IAAIk6C,EAAIp0C,EAC/B,CACA,IAAIs0C,EAAgB,CAChBh7C,GAAAA,CAAInO,EAAQM,EAAMmR,GACd,GAAIzR,aAAkBmoD,eAAgB,CAElC,GAAa,SAAT7nD,EACA,OAAOmoD,EAAmBt6C,IAAInO,GAElC,GAAa,qBAATM,EACA,OAAON,EAAOopD,kBAAoBV,EAAyBv6C,IAAInO,GAGnE,GAAa,UAATM,EACA,OAAOmR,EAAS23C,iBAAiB,QAC3BrpD,EACA0R,EAAS43C,YAAY53C,EAAS23C,iBAAiB,GAE7D,CAEA,OAAO31C,EAAKzT,EAAOM,GACvB,EACAyO,GAAAA,CAAI/O,EAAQM,EAAMT,GAEd,OADAG,EAAOM,GAAQT,GACR,CACX,EACAuS,GAAAA,CAAIpS,EAAQM,GACR,OAAIN,aAAkBmoD,iBACR,SAAT7nD,GAA4B,UAATA,IAGjBA,KAAQN,CACnB,GAEJ,SAASspD,EAAatmD,GAClBmmD,EAAgBnmD,EAASmmD,EAC7B,CACA,SAASI,EAAalJ,GAIlB,OAAIA,IAAS0H,YAAY9hD,UAAUujD,aAC7B,qBAAsBrB,eAAeliD,UAYvCmiD,IAA0B9/C,SAAS+3C,GAC5B,YAAanvC,GAIhB,OADAmvC,EAAKhvC,MAAMo4C,EAAOtsD,MAAO+T,GAClBuC,EAAK+0C,EAAiBr6C,IAAIhR,MACrC,EAEG,YAAa+T,GAGhB,OAAOuC,EAAK4sC,EAAKhvC,MAAMo4C,EAAOtsD,MAAO+T,GACzC,EAvBW,SAAUw4C,KAAex4C,GAC5B,MAAM+3C,EAAK5I,EAAK74C,KAAKiiD,EAAOtsD,MAAOusD,KAAex4C,GAElD,OADAw3C,EAAyB35C,IAAIk6C,EAAIS,EAAWttC,KAAOstC,EAAWttC,OAAS,CAACstC,IACjEj2C,EAAKw1C,EAChB,CAoBR,CACA,SAASU,EAAuB9pD,GAC5B,MAAqB,oBAAVA,EACA0pD,EAAa1pD,IAGpBA,aAAiBsoD,gBACjBa,EAA+BnpD,GAC/B6nD,EAAc7nD,EAAOioD,KACd,IAAIpxC,MAAM7W,EAAOspD,GAErBtpD,EACX,CACA,SAAS4T,EAAK5T,GAGV,GAAIA,aAAiB+pD,WACjB,OAAOf,EAAiBhpD,GAG5B,GAAI8oD,EAAev2C,IAAIvS,GACnB,OAAO8oD,EAAex6C,IAAItO,GAC9B,MAAMkQ,EAAW45C,EAAuB9pD,GAOxC,OAJIkQ,IAAalQ,IACb8oD,EAAe55C,IAAIlP,EAAOkQ,GAC1B64C,EAAsB75C,IAAIgB,EAAUlQ,IAEjCkQ,CACX,CACA,MAAM05C,EAAU5pD,GAAU+oD,EAAsBz6C,IAAItO,GC5KpD,SAASgqD,EAAO1qD,EAAM22B,GAAS,QAAEg0B,EAAO,QAAEC,EAAO,SAAEC,EAAQ,WAAEC,GAAe,CAAC,GACzE,MAAM9kD,EAAUJ,UAAUK,KAAKjG,EAAM22B,GAC/Bo0B,EAAcz2C,EAAKtO,GAoBzB,OAnBI4kD,GACA5kD,EAAQqqC,iBAAiB,iBAAkB/yB,IACvCstC,EAAQt2C,EAAKtO,EAAQG,QAASmX,EAAM0tC,WAAY1tC,EAAM2tC,WAAY32C,EAAKtO,EAAQqkD,aAAc/sC,EAAM,IAGvGqtC,GACA3kD,EAAQqqC,iBAAiB,WAAY/yB,GAAUqtC,EAE/CrtC,EAAM0tC,WAAY1tC,EAAM2tC,WAAY3tC,KAExCytC,EACKtvC,MAAMyvC,IACHJ,GACAI,EAAG7a,iBAAiB,SAAS,IAAMya,MACnCD,GACAK,EAAG7a,iBAAiB,iBAAkB/yB,GAAUutC,EAASvtC,EAAM0tC,WAAY1tC,EAAM2tC,WAAY3tC,IACjG,IAECxZ,OAAM,SACJinD,CACX,CAgBA,MAAMI,EAAc,CAAC,MAAO,SAAU,SAAU,aAAc,SACxDC,EAAe,CAAC,MAAO,MAAO,SAAU,SACxCC,EAAgB,IAAIj7C,IAC1B,SAAS+1C,EAAUtlD,EAAQM,GACvB,KAAMN,aAAkB+nD,cAClBznD,KAAQN,GACM,kBAATM,EACP,OAEJ,GAAIkqD,EAAcr8C,IAAI7N,GAClB,OAAOkqD,EAAcr8C,IAAI7N,GAC7B,MAAMmqD,EAAiBnqD,EAAKf,QAAQ,aAAc,IAC5CmrD,EAAWpqD,IAASmqD,EACpBE,EAAUJ,EAAajiD,SAASmiD,GACtC,KAEEA,KAAmBC,EAAWzC,SAAWD,gBAAgB/hD,aACrD0kD,IAAWL,EAAYhiD,SAASmiD,GAClC,OAEJ,MAAMn2C,EAASs2C,eAAgBC,KAAc35C,GAEzC,MAAM+3C,EAAK9rD,KAAKqsD,YAAYqB,EAAWF,EAAU,YAAc,YAC/D,IAAI3qD,EAASipD,EAAGnI,MAQhB,OAPI4J,IACA1qD,EAASA,EAAO0L,MAAMwF,EAAKtC,iBAMjB9L,QAAQ++C,IAAI,CACtB7hD,EAAOyqD,MAAmBv5C,GAC1By5C,GAAW1B,EAAGp0C,QACd,EACR,EAEA,OADA21C,EAAcz7C,IAAIzO,EAAMgU,GACjBA,CACX,CACAg1C,GAAcwB,IAAQ,IACfA,EACH38C,IAAKA,CAACnO,EAAQM,EAAMmR,IAAa6zC,EAAUtlD,EAAQM,IAASwqD,EAAS38C,IAAInO,EAAQM,EAAMmR,GACvFW,IAAKA,CAACpS,EAAQM,MAAWglD,EAAUtlD,EAAQM,IAASwqD,EAAS14C,IAAIpS,EAAQM;;;;;;;;;;;;;;;;;MClEhEyqD,EACX7rD,WAAAA,CAA6B29B,GAAA,KAASA,UAATA,C,CAG7BmuB,qBAAAA,GACE,MAAMC,EAAY9tD,KAAK0/B,UAAUquB,eAGjC,OAAOD,EACJtjD,KAAIwjD,IACH,GAAIC,EAAyBD,GAAW,CACtC,MAAM9kD,EAAU8kD,EAASE,eACzB,MAAO,GAAGhlD,EAAQilD,WAAWjlD,EAAQyvB,SACtC,CACC,OAAO,IACR,IAEFhlB,QAAOy6C,GAAaA,IACpB5uD,KAAK,I,EAWZ,SAASyuD,EAAyBD,GAChC,MAAMhpC,EAAYgpC,EAASK,eAC3B,MAAsB,aAAf,OAAArpC,QAAS,IAATA,OAAS,EAATA,EAAW3e,KACpB,C,oCCtCaioD,EAAS,IAAIC,EAAAA,GAAO,iB,wrBC8BpBC,GAAqB,YAErBC,GAAsB,CACjC,CAACC,GAAU,YACX,CAACC,GAAgB,mBACjB,CAACC,GAAgB,iBACjB,CAACC,GAAsB,wBACvB,CAACC,GAAe,iBAChB,CAACC,GAAqB,wBACtB,CAACC,GAAW,YACZ,CAACC,GAAiB,mBAClB,CAACC,GAAe,YAChB,CAACC,GAAqB,mBACtB,CAACC,GAAgB,UACjB,CAACC,GAAsB,iBACvB,CAACC,GAAoB,WACrB,CAACC,GAA0B,kBAC3B,CAACC,GAAgB,WACjB,CAACC,GAAsB,kBACvB,CAACC,GAAkB,YACnB,CAACC,GAAwB,mBACzB,CAACC,GAAmB,UACpB,CAACC,GAAyB,iBAC1B,CAACC,GAAc,WACf,CAACC,IAAoB,kBACrB,CAACC,IAAgB,WACjB,CAACC,IAAsB,kBACvB,CAACC,IAAa,cACd,UAAW,UACX,CAACluD,IAAc,eC/CJmuD,GAAQ,IAAI/9C,IAKZg+C,GAAc,IAAIh+C,IAQlBi+C,GAAc,IAAIj+C,IAOf,SAAAk+C,GACdh5B,EACAtS,GAEA,IACGsS,EAAwBoI,UAAU6wB,aAAavrC,EACjD,CAAC,MAAO1iB,GACPgsD,EAAOkC,MACL,aAAaxrC,EAAUhjB,4CAA4Cs1B,EAAIt1B,OACvEM,EAEH,CACH,CAoBM,SAAUmuD,GACdzrC,GAEA,MAAM0rC,EAAgB1rC,EAAUhjB,KAChC,GAAIquD,GAAYp7C,IAAIy7C,GAKlB,OAJApC,EAAOkC,MACL,sDAAsDE,OAGjD,EAGTL,GAAYz+C,IAAI8+C,EAAe1rC,GAG/B,IAAK,MAAMsS,KAAO64B,GAAMp9C,SACtBu9C,GAAch5B,EAAwBtS,GAGxC,IAAK,MAAM2rC,KAAaP,GAAYr9C,SAClCu9C,GAAcK,EAAoC3rC,GAGpD,OAAO,CACT,CAWgB,SAAA4rC,GACdt5B,EACAt1B,GAEA,MAAM6uD,EAAuBv5B,EAAwBoI,UAClDoxB,YAAY,aACZ5C,aAAa,CAAE6C,UAAU,IAI5B,OAHIF,GACGA,EAAoBG,mBAEnB15B,EAAwBoI,UAAUoxB,YAAY9uD,EACxD;;;;;;;;;;;;;;;;;AC7FA,MAAMivD,GAA6B,CACjC,CAAC,UACC,6EAEF,CAAC,gBAAwB,iCACzB,CAAC,iBACC,kFACF,CAAC,eAAuB,kDACxB,CAAC,sBAA8B,uCAC/B,CAAC,cACC,0EACF,CAAC,wBACC,6EAEF,CAAC,wBACC,wDACF,CAAC,YACC,gFACF,CAAC,WACC,qFACF,CAAC,WACC,mFACF,CAAC,cACC,sFACF,CAAC,uCACC,0GACF,CAAC,kCACC,6DAgBSC,GAAgB,IAAIloD,EAAAA,GAC/B,MACA,WACAioD;;;;;;;;;;;;;;;;;MCrDWE,GAcXpvD,WAAAA,CACE4f,EACArc,EACAo6B,GANQ,KAAU0xB,YAAG,EAQrBpxD,KAAKqxD,SAAgBtuD,OAAA4D,OAAA,GAAAgb,GACrB3hB,KAAKsxD,QAAevuD,OAAA4D,OAAA,GAAArB,GACpBtF,KAAKuxD,MAAQjsD,EAAOtD,KACpBhC,KAAKwxD,gCACHlsD,EAAOmsD,+BACTzxD,KAAKw4B,WAAakH,EAClB1/B,KAAK0/B,UAAU6wB,aACb,IAAIxtC,EAAAA,GAAU,OAAO,IAAM/iB,MAAM,U,CAIrC,kCAAIyxD,GAEF,OADAzxD,KAAK0xD,iBACE1xD,KAAKwxD,+B,CAGd,kCAAIC,CAA+B17B,GACjC/1B,KAAK0xD,iBACL1xD,KAAKwxD,gCAAkCz7B,C,CAGzC,QAAI/zB,GAEF,OADAhC,KAAK0xD,iBACE1xD,KAAKuxD,K,CAGd,WAAI5vC,GAEF,OADA3hB,KAAK0xD,iBACE1xD,KAAKqxD,Q,CAGd,UAAI/rD,GAEF,OADAtF,KAAK0xD,iBACE1xD,KAAKsxD,O,CAGd,aAAI5xB,GACF,OAAO1/B,KAAKw4B,U,CAGd,aAAIm5B,GACF,OAAO3xD,KAAKoxD,U,CAGd,aAAIO,CAAU57B,GACZ/1B,KAAKoxD,WAAar7B,C,CAOV27B,cAAAA,GACR,GAAI1xD,KAAK2xD,UACP,MAAMT,GAAcjoD,OAAO,cAAsB,CAAE2oD,QAAS5xD,KAAKuxD,O;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtChE,MAAMvzD,GAAc26B,G,SAoEXk5B,GACdR,EACAS,EAAY,CAAC,GAEb,IAAInwC,EAAU0vC,EAEd,GAAyB,kBAAdS,EAAwB,CACjC,MAAM9vD,EAAO8vD,EACbA,EAAY,CAAE9vD,OACf,CAED,MAAMsD,EAAMvC,OAAA4D,OAAA,CACV3E,KAAMwsD,GACNiD,gCAAgC,GAC7BK,GAEC9vD,EAAOsD,EAAOtD,KAEpB,GAAoB,kBAATA,IAAsBA,EAC/B,MAAMkvD,GAAcjoD,OAA8B,gBAChD2oD,QAAS1yD,OAAO8C,KAMpB,GAFA2f,IAAAA,GAAYtc,EAAAA,EAAAA,QAEPsc,EACH,MAAMuvC,GAAcjoD,OAAO,cAG7B,MAAM8oD,EAAc5B,GAAMn/C,IAAIhP,GAC9B,GAAI+vD,EAAa,CAEf,IACEnnD,EAAAA,EAAAA,IAAU+W,EAASowC,EAAYpwC,WAC/B/W,EAAAA,EAAAA,IAAUtF,EAAQysD,EAAYzsD,QAE9B,OAAOysD,EAEP,MAAMb,GAAcjoD,OAA+B,iBAAE2oD,QAAS5vD,GAEjE,CAED,MAAM09B,EAAY,IAAIsyB,EAAAA,GAAmBhwD,GACzC,IAAK,MAAMgjB,KAAaqrC,GAAYt9C,SAClC2sB,EAAU6wB,aAAavrC,GAGzB,MAAMitC,EAAS,IAAId,GAAgBxvC,EAASrc,EAAQo6B,GAIpD,OAFAywB,GAAMv+C,IAAI5P,EAAMiwD,GAETA,CACT,CAuJgB,SAAAC,GAAOlwD,EAAewsD,IACpC,MAAMl3B,EAAM64B,GAAMn/C,IAAIhP,GACtB,IAAKs1B,GAAOt1B,IAASwsD,KAAsBnpD,EAAAA,EAAAA,MACzC,OAAOwsD,KAET,IAAKv6B,EACH,MAAM45B,GAAcjoD,OAAwB,UAAE2oD,QAAS5vD,IAGzD,OAAOs1B,CACT,C,SA2DgB66B,GACdC,EACAz5B,EACA05B,G,MAIA,IAAIlE,EAAmD,QAAzCxpD,EAAA8pD,GAAoB2D,UAAqB,IAAAztD,EAAAA,EAAAytD,EACnDC,IACFlE,GAAW,IAAIkE,KAEjB,MAAMC,EAAkBnE,EAAQ/pD,MAAM,SAChCmuD,EAAkB55B,EAAQv0B,MAAM,SACtC,GAAIkuD,GAAmBC,EAAiB,CACtC,MAAMC,EAAU,CACiB,+BAAArE,oBAA0Bx1B,OAgB3D,OAdI25B,GACFE,EAAQnxD,KACN,iBAAiB8sD,sDAGjBmE,GAAmBC,GACrBC,EAAQnxD,KAAK,OAEXkxD,GACFC,EAAQnxD,KACN,iBAAiBs3B,2DAGrB21B,EAAOmE,KAAKD,EAAQhzD,KAAK,KAE1B,CACDixD,GACE,IAAI1tC,EAAAA,GACF,GAAGorC,aACH,KAAM,CAAGA,UAASx1B,aAAU,WAIlC;;;;;;;;;;;;;;;;;ACraA,MAAM+5B,GAAU,8BACVC,GAAa,EACbC,GAAa,2BASnB,IAAIC,GAAiD,KACrD,SAASC,KA2BP,OA1BKD,KACHA,GAAYnG,EAAcgG,GAASC,GAAY,CAC7C/F,QAASA,CAACM,EAAIF,KAMZ,OAAQA,GACN,KAAK,EACH,IACEE,EAAG6F,kBAAkBH,GACtB,CAAC,MAAOtwD,GAIPC,QAAQkwD,KAAKnwD,EACd,EACJ,IAEFwD,OAAMxD,IACP,MAAM4uD,GAAcjoD,OAA0B,YAC5C+pD,qBAAsB1wD,EAAEnE,SACxB,KAGC00D,EACT,CAEOpF,eAAewF,GACpB37B,GAEA,IACE,MAAM41B,QAAW4F,KACXhH,EAAKoB,EAAGb,YAAYuG,IACpBzqD,QAAe2jD,EAAGI,YAAY0G,IAAY5hD,IAAIkiD,GAAW57B,IAI/D,aADMw0B,EAAGp0C,KACFvP,CACR,CAAC,MAAO7F,GACP,GAAIA,aAAamG,EAAAA,GACf6lD,EAAOmE,KAAKnwD,EAAEnE,aACT,CACL,MAAMg1D,EAAcjC,GAAcjoD,OAAyB,WACzD+pD,qBAAkC,OAAX1wD,QAAA,IAAAA,OAAA,EAAAA,EAAanE,UAEtCmwD,EAAOmE,KAAKU,EAAYh1D,QACzB,CACF,CACH,CAEOsvD,eAAe2F,GACpB97B,EACA+7B,GAEA,IACE,MAAMnG,QAAW4F,KACXhH,EAAKoB,EAAGb,YAAYuG,GAAY,aAChC1G,EAAcJ,EAAGI,YAAY0G,UAC7B1G,EAAYoH,IAAID,EAAiBH,GAAW57B,UAC5Cw0B,EAAGp0C,IACV,CAAC,MAAOpV,GACP,GAAIA,aAAamG,EAAAA,GACf6lD,EAAOmE,KAAKnwD,EAAEnE,aACT,CACL,MAAMg1D,EAAcjC,GAAcjoD,OAA2B,WAC3D+pD,qBAAkC,OAAX1wD,QAAA,IAAAA,OAAA,EAAAA,EAAanE,UAEtCmwD,EAAOmE,KAAKU,EAAYh1D,QACzB,CACF,CACH,CAEA,SAAS+0D,GAAW57B,GAClB,MAAO,GAAGA,EAAIt1B,QAAQs1B,EAAI3V,QAAQ4xC,OACpC;;;;;;;;;;;;;;;;GC5EA,MAAMC,GAAmB,KAEnBC,GAAwC,O,MAEjCC,GAyBX3xD,WAAAA,CAA6B29B,GAAA,KAASA,UAATA,EAT7B,KAAgBi0B,iBAAiC,KAU/C,MAAMr8B,EAAMt3B,KAAK0/B,UAAUoxB,YAAY,OAAO5C,eAC9CluD,KAAK4zD,SAAW,IAAIC,GAAqBv8B,GACzCt3B,KAAK8zD,wBAA0B9zD,KAAK4zD,SAASG,OAAOt2C,MAAKtV,IACvDnI,KAAK2zD,iBAAmBxrD,EACjBA,I,CAWX,sBAAM6oD,G,QACJ,IACE,MAAMgD,EAAiBh0D,KAAK0/B,UACzBoxB,YAAY,mBACZ5C,eAIG+F,EAAQD,EAAenG,wBACvBqG,EAAOC,KACb,GAAyC,OAAd,QAAvBxvD,EAAA3E,KAAK2zD,wBAAkB,IAAAhvD,OAAA,EAAAA,EAAAyvD,cACzBp0D,KAAK2zD,uBAAyB3zD,KAAK8zD,wBAEM,OAAd,QAAvBlvD,EAAA5E,KAAK2zD,wBAAkB,IAAA/uD,OAAA,EAAAA,EAAAwvD,aACzB,OAKJ,GACEp0D,KAAK2zD,iBAAiBU,wBAA0BH,GAChDl0D,KAAK2zD,iBAAiBS,WAAWjwC,MAC/BmwC,GAAuBA,EAAoBJ,OAASA,IAGtD,OAYF,OATEl0D,KAAK2zD,iBAAiBS,WAAW/yD,KAAK,CAAE6yD,OAAMD,UAGhDj0D,KAAK2zD,iBAAiBS,WACpBp0D,KAAK2zD,iBAAiBS,WAAWzgD,QAAO2gD,IACtC,MAAMC,EAAc,IAAIvxD,KAAKsxD,EAAoBJ,MAAM5M,UACjDpR,EAAMlzC,KAAKkzC,MACjB,OAAOA,EAAMqe,GAAed,EAAqC,IAE9DzzD,KAAK4zD,SAASY,UAAUx0D,KAAK2zD,iBACrC,CAAC,MAAOrxD,GACPgsD,EAAOmE,KAAKnwD,EACb,C,CAUH,yBAAMmyD,G,MACJ,IAKE,GAJ8B,OAA1Bz0D,KAAK2zD,wBACD3zD,KAAK8zD,wBAI0B,OAAd,QAAvBnvD,EAAA3E,KAAK2zD,wBAAkB,IAAAhvD,OAAA,EAAAA,EAAAyvD,aACqB,IAA5Cp0D,KAAK2zD,iBAAiBS,WAAWz1D,OAEjC,MAAO,GAET,MAAMu1D,EAAOC,MAEP,iBAAEO,EAAgB,cAAEC,GAAkBC,GAC1C50D,KAAK2zD,iBAAiBS,YAElBS,GAAe1yD,EAAAA,EAAAA,IACnB6B,KAAKoD,UAAU,CAAEuxB,QAAS,EAAGy7B,WAAYM,KAgB3C,OAbA10D,KAAK2zD,iBAAiBU,sBAAwBH,EAC1CS,EAAch2D,OAAS,GAEzBqB,KAAK2zD,iBAAiBS,WAAaO,QAI7B30D,KAAK4zD,SAASY,UAAUx0D,KAAK2zD,oBAEnC3zD,KAAK2zD,iBAAiBS,WAAa,GAE9Bp0D,KAAK4zD,SAASY,UAAUx0D,KAAK2zD,mBAE7BkB,CACR,CAAC,MAAOvyD,GAEP,OADAgsD,EAAOmE,KAAKnwD,GACL,EACR,C,EAIL,SAAS6xD,KACP,MAAMW,EAAQ,IAAI9xD,KAElB,OAAO8xD,EAAMC,cAAc3vD,UAAU,EAAG,GAC1C,C,SAEgBwvD,GACdI,EACAC,EAAUzB,IAOV,MAAMkB,EAA4C,GAElD,IAAIC,EAAgBK,EAAgBl1C,QACpC,IAAK,MAAMw0C,KAAuBU,EAAiB,CAEjD,MAAME,EAAiBR,EAAiBS,MACtCC,GAAMA,EAAGnB,QAAUK,EAAoBL,QAEzC,GAAKiB,GAgBH,GAHAA,EAAeG,MAAMh0D,KAAKizD,EAAoBJ,MAG1CoB,GAAWZ,GAAoBO,EAAS,CAC1CC,EAAeG,MAAMnmD,MACrB,KACD,OAbD,GAJAwlD,EAAiBrzD,KAAK,CACpB4yD,MAAOK,EAAoBL,MAC3BoB,MAAO,CAACf,EAAoBJ,QAE1BoB,GAAWZ,GAAoBO,EAAS,CAG1CP,EAAiBxlD,MACjB,KACD,CAYHylD,EAAgBA,EAAc70C,MAAM,EACrC,CACD,MAAO,CACL40C,mBACAC,gBAEJ,C,MAEad,GAEX9xD,WAAAA,CAAmBu1B,GAAA,KAAGA,IAAHA,EACjBt3B,KAAKu1D,wBAA0Bv1D,KAAKw1D,8B,CAEtC,kCAAMA,GACJ,SAAK7tD,EAAAA,EAAAA,QAGIE,EAAAA,EAAAA,MACJ4V,MAAK,KAAM,IACX3X,OAAM,KAAM,G,CAMnB,UAAMiuD,GACJ,MAAM0B,QAAwBz1D,KAAKu1D,wBACnC,GAAKE,EAEE,CACL,MAAMC,QAA2BzC,GAA4BjzD,KAAKs3B,KAClE,OAAI,OAAAo+B,QAAkB,IAAlBA,OAAkB,EAAlBA,EAAoBtB,YACfsB,EAEA,CAAEtB,WAAY,GAExB,CARC,MAAO,CAAEA,WAAY,G,CAWzB,eAAMI,CAAUmB,G,MACd,MAAMF,QAAwBz1D,KAAKu1D,wBACnC,GAAKE,EAEE,CACL,MAAMG,QAAiC51D,KAAK+zD,OAC5C,OAAOX,GAA2BpzD,KAAKs3B,IAAK,CAC1C+8B,sBAEE,QADA1vD,EAAAgxD,EAAiBtB,6BACjB,IAAA1vD,EAAAA,EAAAixD,EAAyBvB,sBAC3BD,WAAYuB,EAAiBvB,YAEhC,C,CAGH,SAAM39C,CAAIk/C,G,MACR,MAAMF,QAAwBz1D,KAAKu1D,wBACnC,GAAKE,EAEE,CACL,MAAMG,QAAiC51D,KAAK+zD,OAC5C,OAAOX,GAA2BpzD,KAAKs3B,IAAK,CAC1C+8B,sBAEE,QADA1vD,EAAAgxD,EAAiBtB,6BACjB,IAAA1vD,EAAAA,EAAAixD,EAAyBvB,sBAC3BD,WAAY,IACPwB,EAAyBxB,cACzBuB,EAAiBvB,aAGzB,C,EASC,SAAUkB,GAAWN,GAEzB,OAAO7yD,EAAAA,EAAAA,IAEL6B,KAAKoD,UAAU,CAAEuxB,QAAS,EAAGy7B,WAAYY,KACzCr2D,MACJ;;;;;;;;;;;;;;;;GCxRM,SAAUk3D,GAAuBxD,GACrC5B,GACE,IAAI1tC,EAAAA,GACF,mBACA2c,GAAa,IAAIkuB,EAA0BluB,IAAU,YAIzD+wB,GACE,IAAI1tC,EAAAA,GACF,aACA2c,GAAa,IAAIg0B,GAAqBh0B,IAAU,YAMpDyyB,GAAgBzD,EAAMoH,EAASzD,GAE/BF,GAAgBzD,EAAMoH,EAAS,WAE/B3D,GAAgB,UAAW,GAC7B,CChBA0D,GAAuB,G,oGCFV9yC,EAiBXhhB,WAAAA,CACWC,EACA+zD,EACA1vD,GAFA,KAAIrE,KAAJA,EACA,KAAe+zD,gBAAfA,EACA,KAAI1vD,KAAJA,EAnBX,KAAiB2vD,mBAAG,EAIpB,KAAYC,aAAe,CAAC,EAE5B,KAAAC,kBAA2C,OAE3C,KAAiBC,kBAAwC,I,CAczDC,oBAAAA,CAAqBrrC,GAEnB,OADA/qB,KAAKk2D,kBAAoBnrC,EAClB/qB,I,CAGTq2D,oBAAAA,CAAqBL,GAEnB,OADAh2D,KAAKg2D,kBAAoBA,EAClBh2D,I,CAGTs2D,eAAAA,CAAgB72C,GAEd,OADAzf,KAAKi2D,aAAex2C,EACbzf,I,CAGTu2D,0BAAAA,CAA2B1wD,GAEzB,OADA7F,KAAKm2D,kBAAoBtwD,EAClB7F,I;;;;;;;;;;;;;;;;GTnDJ,MAAMwuD,EAAqB;;;;;;;;;;;;;;;;SUgBrBgI,EAWXz0D,WAAAA,CACmBC,EACA09B,GADA,KAAI19B,KAAJA,EACA,KAAS09B,UAATA,EAZX,KAAS1a,UAAwB,KACxB,KAAAyxC,UAAgD,IAAIrkD,IACpD,KAAAskD,kBAGb,IAAItkD,IACS,KAAAukD,iBACf,IAAIvkD,IACE,KAAAwkD,gBAAuD,IAAIxkD,G,CAWnEpB,GAAAA,CAAI6lD,GAEF,MAAMC,EAAuB92D,KAAK+2D,4BAA4BF,GAE9D,IAAK72D,KAAK02D,kBAAkBzhD,IAAI6hD,GAAuB,CACrD,MAAME,EAAW,IAAIzxD,EAAAA,GAGrB,GAFAvF,KAAK02D,kBAAkB9kD,IAAIklD,EAAsBE,GAG/Ch3D,KAAKi3D,cAAcH,IACnB92D,KAAKk3D,uBAGL,IACE,MAAMp7C,EAAW9b,KAAKm3D,uBAAuB,CAC3CC,mBAAoBN,IAElBh7C,GACFk7C,EAASvxD,QAAQqW,EAEpB,CAAC,MAAOxZ,G,CAKZ,CAED,OAAOtC,KAAK02D,kBAAkB1lD,IAAI8lD,GAAuBpxD,O,CAmB3DwoD,YAAAA,CAAavsC,G,MAKX,MAAMm1C,EAAuB92D,KAAK+2D,4BAChC,OAAAp1C,QAAA,IAAAA,OAAA,EAAAA,EAASk1C,YAEL9F,EAAgC,QAArBpsD,EAAA,OAAAgd,QAAA,IAAAA,OAAA,EAAAA,EAASovC,gBAAY,IAAApsD,GAAAA,EAEtC,IACE3E,KAAKi3D,cAAcH,KACnB92D,KAAKk3D,uBAaA,CAEL,GAAInG,EACF,OAAO,KAEP,MAAM1yD,MAAiB,WAAA2B,KAAKgC,wBAE/B,CAlBC,IACE,OAAOhC,KAAKm3D,uBAAuB,CACjCC,mBAAoBN,GAEvB,CAAC,MAAOx0D,GACP,GAAIyuD,EACF,OAAO,KAEP,MAAMzuD,CAET,C,CAWL+rD,YAAAA,GACE,OAAOruD,KAAKglB,S,CAGdqyC,YAAAA,CAAaryC,GACX,GAAIA,EAAUhjB,OAAShC,KAAKgC,KAC1B,MAAM3D,MACqB,yBAAA2mB,EAAUhjB,qBAAqBhC,KAAKgC,SAIjE,GAAIhC,KAAKglB,UACP,MAAM3mB,MAAuB,iBAAA2B,KAAKgC,kCAMpC,GAHAhC,KAAKglB,UAAYA,EAGZhlB,KAAKk3D,uBAAV,CAKA,GAAII,EAAiBtyC,GACnB,IACEhlB,KAAKm3D,uBAAuB,CAAEC,mBAAoB5I,GACnD,CAAC,MAAOlsD,G,CAWX,IAAK,MACH80D,EACAG,KACGv3D,KAAK02D,kBAAkB/qD,UAAW,CACrC,MAAMmrD,EACJ92D,KAAK+2D,4BAA4BK,GAEnC,IAEE,MAAMt7C,EAAW9b,KAAKm3D,uBAAuB,CAC3CC,mBAAoBN,IAEtBS,EAAiB9xD,QAAQqW,EAC1B,CAAC,MAAOxZ,G,CAIV,CAlCA,C,CAqCHk1D,aAAAA,CAAcX,EAAqBrI,GACjCxuD,KAAK02D,kBAAkBzlD,OAAO4lD,GAC9B72D,KAAK22D,iBAAiB1lD,OAAO4lD,GAC7B72D,KAAKy2D,UAAUxlD,OAAO4lD,E,CAKxB,YAAM5lD,GACJ,MAAMwmD,EAAWl3D,MAAMgxB,KAAKvxB,KAAKy2D,UAAU1jD,gBAErCpN,QAAQ++C,IAAI,IACb+S,EACA9jD,QAAOzK,GAAW,aAAcA,IAEhCsB,KAAItB,GAAYA,EAAgBwuD,SAAUzmD,cAC1CwmD,EACA9jD,QAAOzK,GAAW,YAAaA,IAE/BsB,KAAItB,GAAYA,EAAgByuD,a,CAIvCC,cAAAA,GACE,OAAyB,MAAlB53D,KAAKglB,S,CAGdiyC,aAAAA,CAAcJ,EAAqBrI,GACjC,OAAOxuD,KAAKy2D,UAAUxhD,IAAI4hD,E,CAG5BgB,UAAAA,CAAWhB,EAAqBrI,GAC9B,OAAOxuD,KAAK22D,iBAAiB3lD,IAAI6lD,IAAe,CAAC,C,CAGnDiB,UAAAA,CAAWC,EAA0B,CAAC,GACpC,MAAM,QAAEp2C,EAAU,CAAC,GAAMo2C,EACnBjB,EAAuB92D,KAAK+2D,4BAChCgB,EAAKX,oBAEP,GAAIp3D,KAAKi3D,cAAcH,GACrB,MAAMz4D,MACJ,GAAG2B,KAAKgC,QAAQ80D,mCAIpB,IAAK92D,KAAK43D,iBACR,MAAMv5D,MAAmB,aAAA2B,KAAKgC,oCAGhC,MAAM8Z,EAAW9b,KAAKm3D,uBAAuB,CAC3CC,mBAAoBN,EACpBn1C,YAIF,IAAK,MACHy1C,EACAG,KACGv3D,KAAK02D,kBAAkB/qD,UAAW,CACrC,MAAMqsD,EACJh4D,KAAK+2D,4BAA4BK,GAC/BN,IAAyBkB,GAC3BT,EAAiB9xD,QAAQqW,EAE5B,CAED,OAAOA,C,CAWTm8C,MAAAA,CAAOpyD,EAA6BgxD,G,MAClC,MAAMC,EAAuB92D,KAAK+2D,4BAA4BF,GACxDqB,EAC0C,QAA9CvzD,EAAA3E,KAAK42D,gBAAgB5lD,IAAI8lD,UAAqB,IAAAnyD,EAAAA,EAC9C,IAAI8O,IACNykD,EAAkBzhD,IAAI5Q,GACtB7F,KAAK42D,gBAAgBhlD,IAAIklD,EAAsBoB,GAE/C,MAAMC,EAAmBn4D,KAAKy2D,UAAUzlD,IAAI8lD,GAK5C,OAJIqB,GACFtyD,EAASsyD,EAAkBrB,GAGtB,KACLoB,EAAkBjnD,OAAOpL,EAAS,C,CAQ9BuyD,qBAAAA,CACNt8C,EACA+6C,GAEA,MAAMwB,EAAYr4D,KAAK42D,gBAAgB5lD,IAAI6lD,GAC3C,GAAKwB,EAGL,IAAK,MAAMxyD,KAAYwyD,EACrB,IACExyD,EAASiW,EAAU+6C,EACpB,CAAC,MAAMlyD,G,EAMJwyD,sBAAAA,EAAuB,mBAC7BC,EAAkB,QAClBz1C,EAAU,CAAC,IAKX,IAAI7F,EAAW9b,KAAKy2D,UAAUzlD,IAAIomD,GAClC,IAAKt7C,GAAY9b,KAAKglB,YACpBlJ,EAAW9b,KAAKglB,UAAU+wC,gBAAgB/1D,KAAK0/B,UAAW,CACxD03B,mBAAoBkB,EAA8BlB,GAClDz1C,YAEF3hB,KAAKy2D,UAAU7kD,IAAIwlD,EAAoBt7C,GACvC9b,KAAK22D,iBAAiB/kD,IAAIwlD,EAAoBz1C,GAO9C3hB,KAAKo4D,sBAAsBt8C,EAAUs7C,GAOjCp3D,KAAKglB,UAAUmxC,mBACjB,IACEn2D,KAAKglB,UAAUmxC,kBACbn2D,KAAK0/B,UACL03B,EACAt7C,EAEH,CAAC,MAAMnX,G,CAMZ,OAAOmX,GAAY,I,CAGbi7C,2BAAAA,CACNF,EAAqBrI,GAErB,OAAIxuD,KAAKglB,UACAhlB,KAAKglB,UAAUgxC,kBAAoBa,EAAarI,EAEhDqI,C,CAIHK,oBAAAA,GACN,QACIl3D,KAAKglB,WAC8B,aAArChlB,KAAKglB,UAAUkxC,iB,EAMrB,SAASoC,EAA8BzB,GACrC,OAAOA,IAAerI,OAAqB5rD,EAAYi0D,CACzD,CAEA,SAASS,EAAiCtyC,GACxC,MAAuC,UAAhCA,EAAUkxC,iBACnB;;;;;;;;;;;;;;;;SCjWalE,EAGXjwD,WAAAA,CAA6BC,GAAA,KAAIA,KAAJA,EAFZ,KAAA8rD,UAAY,IAAI17C,G,CAajCm+C,YAAAA,CAA6BvrC,GAC3B,MAAMgpC,EAAWhuD,KAAK8wD,YAAY9rC,EAAUhjB,MAC5C,GAAIgsD,EAAS4J,iBACX,MAAM,IAAIv5D,MACR,aAAa2mB,EAAUhjB,yCAAyChC,KAAKgC,QAIzEgsD,EAASqJ,aAAaryC,E,CAGxBuzC,uBAAAA,CAAwCvzC,GACtC,MAAMgpC,EAAWhuD,KAAK8wD,YAAY9rC,EAAUhjB,MACxCgsD,EAAS4J,kBAEX53D,KAAK8tD,UAAU78C,OAAO+T,EAAUhjB,MAGlChC,KAAKuwD,aAAavrC,E,CAUpB8rC,WAAAA,CAA4B9uD,GAC1B,GAAIhC,KAAK8tD,UAAU74C,IAAIjT,GACrB,OAAOhC,KAAK8tD,UAAU98C,IAAIhP,GAI5B,MAAMgsD,EAAW,IAAIwI,EAAYx0D,EAAMhC,MAGvC,OAFAA,KAAK8tD,UAAUl8C,IAAI5P,EAAMgsD,GAElBA,C,CAGTD,YAAAA,GACE,OAAOxtD,MAAMgxB,KAAKvxB,KAAK8tD,UAAU/6C,S;;;;;;;;;;;;;;;;GZtC9B,MAAM0jD,EAAsB,G,IAavB+B,GAAZ,SAAYA,GACVA,EAAAA,EAAA,oBACAA,EAAAA,EAAA,wBACAA,EAAAA,EAAA,kBACAA,EAAAA,EAAA,kBACAA,EAAAA,EAAA,oBACAA,EAAAA,EAAA,qBACD,EAPD,CAAYA,IAAAA,EAOX,KAED,MAAMC,EAA2D,CAC/D,MAASD,EAASE,MAClB,QAAWF,EAASG,QACpB,KAAQH,EAASI,KACjB,KAAQJ,EAASK,KACjB,MAASL,EAASM,MAClB,OAAUN,EAASO,QAMfC,EAA4BR,EAASI,KAmBrCK,EAAgB,CACpB,CAACT,EAASE,OAAQ,MAClB,CAACF,EAASG,SAAU,MACpB,CAACH,EAASI,MAAO,OACjB,CAACJ,EAASK,MAAO,OACjB,CAACL,EAASM,OAAQ,SAQdI,EAAgCA,CAACp9C,EAAUq9C,KAAYplD,KAC3D,GAAIolD,EAAUr9C,EAASs9C,SACrB,OAEF,MAAMljB,GAAM,IAAIlzC,MAAO+xD,cACjB59C,EAAS8hD,EAAcE,GAC7B,IAAIhiD,EAMF,MAAM,IAAI9Y,MACR,8DAA8D86D,MANhE52D,QAAQ4U,GACN,IAAI++B,OAASp6B,EAAS9Z,WACnB+R,EAMN,E,MAGUw6C,EAOXxsD,WAAAA,CAAmBC,GAAA,KAAIA,KAAJA,EAUX,KAASq3D,UAAGL,EAsBZ,KAAWM,YAAeJ,EAc1B,KAAeK,gBAAsB,KA1C3C9C,EAAUp1D,KAAK,K,CAQjB,YAAI+3D,GACF,OAAO,KAAKC,S,CAGd,YAAID,CAASrjC,GACX,KAAMA,KAAOyiC,GACX,MAAM,IAAIjc,UAAU,kBAAkBxmB,+BAExC,KAAKsjC,UAAYtjC,C,CAInByjC,WAAAA,CAAYzjC,GACV,KAAKsjC,UAA2B,kBAARtjC,EAAmB0iC,EAAkB1iC,GAAOA,C,CAQtE,cAAI0jC,GACF,OAAO,KAAKH,W,CAEd,cAAIG,CAAW1jC,GACb,GAAmB,oBAARA,EACT,MAAM,IAAIwmB,UAAU,qDAEtB,KAAK+c,YAAcvjC,C,CAOrB,kBAAI2jC,GACF,OAAO,KAAKH,e,CAEd,kBAAIG,CAAe3jC,GACjB,KAAKwjC,gBAAkBxjC,C,CAOzBy6B,KAAAA,IAASz8C,GACP,KAAKwlD,iBAAmB,KAAKA,gBAAgB,KAAMf,EAASE,SAAU3kD,GACtE,KAAKulD,YAAY,KAAMd,EAASE,SAAU3kD,E,CAE5C4lD,GAAAA,IAAO5lD,GACL,KAAKwlD,iBACH,KAAKA,gBAAgB,KAAMf,EAASG,WAAY5kD,GAClD,KAAKulD,YAAY,KAAMd,EAASG,WAAY5kD,E,CAE9CvP,IAAAA,IAAQuP,GACN,KAAKwlD,iBAAmB,KAAKA,gBAAgB,KAAMf,EAASI,QAAS7kD,GACrE,KAAKulD,YAAY,KAAMd,EAASI,QAAS7kD,E,CAE3C0+C,IAAAA,IAAQ1+C,GACN,KAAKwlD,iBAAmB,KAAKA,gBAAgB,KAAMf,EAASK,QAAS9kD,GACrE,KAAKulD,YAAY,KAAMd,EAASK,QAAS9kD,E,CAE3CvR,KAAAA,IAASuR,GACP,KAAKwlD,iBAAmB,KAAKA,gBAAgB,KAAMf,EAASM,SAAU/kD,GACtE,KAAKulD,YAAY,KAAMd,EAASM,SAAU/kD,E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;Ca9L9Co+C,EAAAA,EAAAA,IAAgBnwD,EAAM22B,EAAS,M;;;;;;;;;;;;;;;;GCDxB,IAAI36B,EAAc,GAMnB,SAAU47D,EAAcjhC,GAC5B36B,EAAc26B,CAChB;;;;;;;;;;;;;;;;GCCG,MACUkhC,EAOX93D,WAAAA,CAAoB+3D,GAAA,KAAWA,YAAXA,EALZ,KAAOC,QAAG,WAAY,CAW9BnoD,GAAAA,CAAItO,EAAaZ,GACF,MAATA,EACF1C,KAAK85D,YAAYE,WAAWh6D,KAAKi6D,cAAc32D,IAE/CtD,KAAK85D,YAAYI,QAAQl6D,KAAKi6D,cAAc32D,IAAM8D,EAAAA,EAAAA,GAAU1E,GAC7D,CAMHsO,GAAAA,CAAI1N,GACF,MAAM62D,EAAYn6D,KAAK85D,YAAYM,QAAQp6D,KAAKi6D,cAAc32D,IAC9D,OAAiB,MAAb62D,EACK,MAEAvwD,EAAAA,EAAAA,IAASuwD,EACjB,CAGHzxC,MAAAA,CAAOplB,GACLtD,KAAK85D,YAAYE,WAAWh6D,KAAKi6D,cAAc32D,GAAM,CAKvD22D,aAAAA,CAAcj4D,GACZ,OAAOhC,KAAK+5D,QAAU/3D,CAAK,CAG7B45B,QAAAA,GACE,OAAO57B,KAAK85D,YAAYl+B,UAAW;;;;;;;;;;;;;;;;GClDpC,MACUy+B,EAAbt4D,WAAAA,GACU,KAAMu4D,OAA6B,CAAC,EAqB5C,KAAiBC,mBAAG,CAAK,CAnBzB3oD,GAAAA,CAAItO,EAAaZ,GACF,MAATA,SACK1C,KAAKs6D,OAAOh3D,GAEnBtD,KAAKs6D,OAAOh3D,GAAOZ,CACpB,CAGHsO,GAAAA,CAAI1N,GACF,OAAI6G,EAAAA,EAAAA,IAASnK,KAAKs6D,OAAQh3D,GACjBtD,KAAKs6D,OAAOh3D,GAEd,IAAK,CAGdolB,MAAAA,CAAOplB,UACEtD,KAAKs6D,OAAOh3D,EAAK;;;;;;;;;;;;;;;;GCX5B,MAAMk3D,EAAmB,SACvBC,GAEA,IAGE,GACoB,qBAAXh3D,QAC2B,qBAA3BA,OAAOg3D,GACd,CAEA,MAAMC,EAAaj3D,OAAOg3D,GAG1B,OAFAC,EAAWR,QAAQ,oBAAqB,SACxCQ,EAAWV,WAAW,qBACf,IAAIH,EAAkBa,EAC9B,CACF,CAAC,MAAOp4D,GAAI,CAIb,OAAO,IAAI+3D,CACb,EAGaM,EAAoBH,EAAiB,gBAGrCI,EAAiBJ,EAAiB,kBCxBzCK,EAAY,IAAItM,EAAAA,GAAO,sBAKhBuM,EAA+B,WAC1C,IAAIl9C,EAAK,EACT,OAAO,WACL,OAAOA,GACT,CACF,CAL4C,GAY/Bm9C,EAAO,SAAUx8D,GAC5B,MAAM2D,GAAYuL,EAAAA,EAAAA,IAAkBlP,GAC9Bw8D,EAAO,IAAIhvD,EAAAA,GACjBgvD,EAAKhuD,OAAO7K,GACZ,MAAM84D,EAAYD,EAAK5tD,SACvB,OAAO1N,EAAAA,GAAOW,gBAAgB46D,EAChC,EAEMC,EAAmB,YAAaC,GACpC,IAAI/8D,EAAU,GACd,IAAK,IAAIO,EAAI,EAAGA,EAAIw8D,EAAQv8D,OAAQD,IAAK,CACvC,MAAMgrB,EAAMwxC,EAAQx8D,GAElB6B,MAAMC,QAAQkpB,IACbA,GACgB,kBAARA,GAEwB,kBAAvBA,EAAY/qB,OAEtBR,GAAW88D,EAAiB/mD,MAAM,KAAMwV,GAExCvrB,GADwB,kBAARurB,GACLtiB,EAAAA,EAAAA,GAAUsiB,GAEVA,EAEbvrB,GAAW,GACZ,CAED,OAAOA,CACT,EAKO,IAAImwD,EAAuC,KAK9C6M,GAAY,EAOT,MAAMC,EAAgB,SAC3BC,EACAC,IAEAr9D,EAAAA,EAAAA,KACGq9D,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFR,EAAUzB,SAAWZ,EAAAA,GAASG,QAC9BrK,EAASuM,EAAUlB,IAAIj8C,KAAKm9C,GACxBS,GACFV,EAAehpD,IAAI,mBAAmB,IAEZ,oBAAZypD,EAChB/M,EAAS+M,GAET/M,EAAS,KACTsM,EAAelyC,OAAO,mBAE1B,EAEaixC,EAAM,YAAauB,GAQ9B,IAPkB,IAAdC,IACFA,GAAY,EACG,OAAX7M,IAA6D,IAA1CsM,EAAe5pD,IAAI,oBACxCoqD,GAAc,IAId9M,EAAQ,CACV,MAAMnwD,EAAU88D,EAAiB/mD,MAAM,KAAMgnD,GAC7C5M,EAAOnwD,EACR,CACH,EAEao9D,EAAa,SACxBC,GAEA,OAAO,YAAaN,GAClBvB,EAAI6B,KAAWN,EACjB,CACF,EAEa14D,EAAQ,YAAa04D,GAChC,MAAM/8D,EAAU,4BAA8B88D,KAAoBC,GAClEL,EAAUr4D,MAAMrE,EAClB,EAEas9D,EAAQ,YAAaP,GAChC,MAAM/8D,EAAmC,yBAAA88D,KAAoBC,KAE7D,MADAL,EAAUr4D,MAAMrE,GACV,IAAIE,MAAMF,EAClB,EAEas0D,EAAO,YAAayI,GAC/B,MAAM/8D,EAAU,qBAAuB88D,KAAoBC,GAC3DL,EAAUpI,KAAKt0D,EACjB,EAMau9D,EAAqB,WAGZ,qBAAXj4D,QACPA,OAAOk4D,UACPl4D,OAAOk4D,SAASC,WACgC,IAAhDn4D,OAAOk4D,SAASC,SAASl9C,QAAQ,WAEjC+zC,EACE,4FAIN,EAaaoJ,EAAsB,SAAUxyD,GAC3C,MACkB,kBAATA,IACNA,IAASA,GACRA,IAAS4J,OAAO6oD,mBAChBzyD,IAAS4J,OAAO8oD,kBAEtB,EAEaC,EAAsB,SAAUvxD,GAC3C,IAAI/C,EAAAA,EAAAA,OAAuC,aAAxBvD,SAAS83D,WAC1BxxD,QACK,CAIL,IAAI4jB,GAAS,EACb,MAAM6tC,EAAY,WACX/3D,SAASivC,KAKT/kB,IACHA,GAAS,EACT5jB,KANAonC,WAAWqqB,EAAWt3B,KAAKihB,MAAM,IAQrC,EAEI1hD,SAASkuC,kBACXluC,SAASkuC,iBAAiB,mBAAoB6pB,GAAW,GAEzDz4D,OAAO4uC,iBAAiB,OAAQ6pB,GAAW,IAEjC/3D,SAAiBg4D,cAG1Bh4D,SAAiBg4D,YAAY,sBAAsB,KACtB,aAAxBh4D,SAAS83D,YACXC,GACD,IAIFz4D,OAAe04D,YAAY,SAAUD,GAMzC,CACH,EAKaE,EAAW,aAKXC,EAAW,aAKXC,EAAc,SAAUzxD,EAAWC,GAC9C,GAAID,IAAMC,EACR,OAAO,EACF,GAAID,IAAMuxD,GAAYtxD,IAAMuxD,EACjC,OAAQ,EACH,GAAIvxD,IAAMsxD,GAAYvxD,IAAMwxD,EACjC,OAAO,EACF,CACL,MAAME,EAASC,EAAY3xD,GACzB4xD,EAASD,EAAY1xD,GAEvB,OAAe,OAAXyxD,EACa,OAAXE,EACKF,EAASE,IAAW,EAAI5xD,EAAElM,OAASmM,EAAEnM,OAAS49D,EAASE,GAEtD,EAEU,OAAXA,EACF,EAEA5xD,EAAIC,GAAK,EAAI,CAEvB,CACH,EAKa4xD,EAAgB,SAAU7xD,EAAWC,GAChD,OAAID,IAAMC,EACD,EACED,EAAIC,GACL,EAED,CAEX,EAEa6xD,EAAa,SACxBr5D,EACA8G,GAEA,GAAIA,GAAO9G,KAAO8G,EAChB,OAAOA,EAAI9G,GAEX,MAAM,IAAIjF,MACR,yBAA2BiF,EAAM,iBAAkB8D,EAAAA,EAAAA,GAAUgD,GAGnE,EAEawyD,EAAoB,SAAUxyD,GACzC,GAAmB,kBAARA,GAA4B,OAARA,EAC7B,OAAOhD,EAAAA,EAAAA,GAAUgD,GAGnB,MAAMY,EAAO,GAEb,IAAK,MAAME,KAAKd,EACdY,EAAK3J,KAAK6J,GAIZF,EAAKiU,OACL,IAAI3b,EAAM,IACV,IAAK,IAAI5E,EAAI,EAAGA,EAAIsM,EAAKrM,OAAQD,IACrB,IAANA,IACF4E,GAAO,KAETA,IAAO8D,EAAAA,EAAAA,GAAU4D,EAAKtM,IACtB4E,GAAO,IACPA,GAAOs5D,EAAkBxyD,EAAIY,EAAKtM,KAIpC,OADA4E,GAAO,IACAA,CACT,EAQau5D,EAAoB,SAC/Bt+D,EACAu+D,GAEA,MAAM/0B,EAAMxpC,EAAII,OAEhB,GAAIopC,GAAO+0B,EACT,MAAO,CAACv+D,GAGV,MAAMw+D,EAAW,GACjB,IAAK,IAAIn+D,EAAI,EAAGA,EAAImpC,EAAKnpC,GAAKk+D,EACxBl+D,EAAIk+D,EAAU/0B,EAChBg1B,EAAS17D,KAAK9C,EAAI6G,UAAUxG,EAAGmpC,IAE/Bg1B,EAAS17D,KAAK9C,EAAI6G,UAAUxG,EAAGA,EAAIk+D,IAGvC,OAAOC,CACT,EAQgB,SAAAC,EAAK5yD,EAAaK,GAChC,IAAK,MAAMnH,KAAO8G,EACZA,EAAIhH,eAAeE,IACrBmH,EAAGnH,EAAK8G,EAAI9G,GAGlB,CAsBO,MAAM25D,EAAwB,SAAU3sD,IAC7CrS,EAAAA,EAAAA,KAAQ49D,EAAoBvrD,GAAI,uBAEhC,MAAM4sD,EAAQ,GACZC,EAAQ,GACJC,GAAQ,GAAMF,EAAQ,GAAM,EAClC,IAAIh1C,EAAG5lB,EAAGuK,EAAGwwD,EAAI3+D,EAIP,IAAN4R,GACFhO,EAAI,EACJuK,EAAI,EACJqb,EAAI,EAAI5X,KAAO4O,IAAW,EAAI,IAE9BgJ,EAAI5X,EAAI,EACRA,EAAIs0B,KAAK04B,IAAIhtD,GAETA,GAAKs0B,KAAK24B,IAAI,EAAG,EAAIH,IAEvBC,EAAKz4B,KAAKC,IAAID,KAAKihB,MAAMjhB,KAAK+0B,IAAIrpD,GAAKs0B,KAAK44B,KAAMJ,GAClD96D,EAAI+6D,EAAKD,EACTvwD,EAAI+3B,KAAK64B,MAAMntD,EAAIs0B,KAAK24B,IAAI,EAAGJ,EAAQE,GAAMz4B,KAAK24B,IAAI,EAAGJ,MAGzD76D,EAAI,EACJuK,EAAI+3B,KAAK64B,MAAMntD,EAAIs0B,KAAK24B,IAAI,EAAG,EAAIH,EAAOD,MAK9C,MAAMO,EAAO,GACb,IAAKh/D,EAAIy+D,EAAOz+D,EAAGA,GAAK,EACtBg/D,EAAKr8D,KAAKwL,EAAI,EAAI,EAAI,GACtBA,EAAI+3B,KAAKihB,MAAMh5C,EAAI,GAErB,IAAKnO,EAAIw+D,EAAOx+D,EAAGA,GAAK,EACtBg/D,EAAKr8D,KAAKiB,EAAI,EAAI,EAAI,GACtBA,EAAIsiC,KAAKihB,MAAMvjD,EAAI,GAErBo7D,EAAKr8D,KAAK6mB,EAAI,EAAI,GAClBw1C,EAAKC,UACL,MAAMp/D,EAAMm/D,EAAKl+D,KAAK,IAGtB,IAAIo+D,EAAgB,GACpB,IAAKl/D,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAIm/D,EAAU14D,SAAS5G,EAAIu/D,OAAOp/D,EAAG,GAAI,GAAGk9B,SAAS,IAC9B,IAAnBiiC,EAAQl/D,SACVk/D,EAAU,IAAMA,GAElBD,GAAgCC,CACjC,CACD,OAAOD,EAAc/7C,aACvB,EAMak8C,EAAiC,WAC5C,QACoB,kBAAXt6D,SACPA,OAAO,YACPA,OAAO,UAAU,cAChB,UAAU+D,KAAK/D,OAAOk4D,SAASqC,MAEpC,EAKaC,EAAoB,WAE/B,MAA0B,kBAAZC,SAA8C,kBAAfA,QAAQC,EACvD,EAKgB,SAAAC,EAAmB11D,EAAc21D,GAC/C,IAAIC,EAAS,gBACA,YAAT51D,EACF41D,EACE,0FAEgB,sBAAT51D,EACT41D,EAAS,6DACS,gBAAT51D,IACT41D,EAAS,8BAGX,MAAM97D,EAAQ,IAAInE,MAChBqK,EAAO,OAAS21D,EAAME,MAAM3iC,WAAa,KAAO0iC,GAIlD,OADC97D,EAAckG,KAAOA,EAAKwxC,cACpB13C,CACT,CAKO,MAAMg8D,EAAkB,IAAIjvC,OAAO,qBAK7BkvC,GAAkB,WAKlBC,EAAiB,WAKjBlC,EAAc,SAAUj+D,GACnC,GAAIigE,EAAgBh3D,KAAKjJ,GAAM,CAC7B,MAAMogE,EAAS1rD,OAAO1U,GACtB,GAAIogE,GAAUF,GAAkBE,GAAUD,EACxC,OAAOC,CAEV,CACD,OAAO,IACT,EAmBaC,EAAiB,SAAUn0D,GACtC,IACEA,GACD,CAAC,MAAOnI,GAEPuvC,YAAW,KAKT,MAAMsP,EAAQ7+C,EAAE6+C,OAAS,GAEzB,MADAsR,EAAK,yCAA0CtR,GACzC7+C,CAAC,GACNsiC,KAAKihB,MAAM,GACf,CACH,EAyBagZ,EAAe,WAC1B,MAAMhe,EACe,kBAAXp9C,QACNA,OAAO,cACPA,OAAO,aAAa,cACtB,GAMF,OACEo9C,EAAUie,OACR,6FACG,CAET,EAsBaC,EAAwB,SACnCt0D,EACAu0D,GAEA,MAAMltB,EAA2BD,WAAWpnC,EAAIu0D,GAiBhD,MAdqB,kBAAZltB,GAES,qBAATgP,MAEPA,KAAK,cAGLA,KAAKme,WAAWntB,GAEY,kBAAZA,GAAyBA,EAAgB,UAExDA,EAAgB,WAGZA,CACT;;;;;;;;;;;;;;;;;AChmBG,MACUotB,EAEXn9D,WAAAA,CACUo9D,EACAC,GADA,KAAQD,SAARA,EACA,KAAgBC,iBAAhBA,EAERp/D,KAAKq/D,SAA2B,OAAhBD,QAAA,IAAAA,OAAA,EAAAA,EAAkBlR,aAAa,CAAE6C,UAAU,IACtD/wD,KAAKq/D,UACQ,OAAhBD,QAAA,IAAAA,GAAAA,EAAkBpuD,MAAMyM,MAAK4hD,GAAar/D,KAAKq/D,SAAWA,GAC3D,CAGHC,QAAAA,CAASC,GACP,OAAKv/D,KAAKq/D,SAeHr/D,KAAKq/D,SAASC,SAASC,GAdrB,IAAI55D,SAA6B,CAACF,EAASD,KAKhDqsC,YAAW,KACL7xC,KAAKq/D,SACPr/D,KAAKs/D,SAASC,GAAc9hD,KAAKhY,EAASD,GAE1CC,EAAQ,KACT,GACA,EAAE,GAGmC,CAG9C+5D,sBAAAA,CAAuBC,GAA+B,MAC/B,QAArB96D,EAAA3E,KAAKo/D,wBAAgB,IAAAz6D,GAAAA,EACjBqM,MACDyM,MAAK4hD,GAAYA,EAASK,iBAAiBD,IAAW,CAG3DE,qBAAAA,GACElN,EACE,oDAAoDzyD,KAAKm/D,wFAEzD;;;;;;;;;;;;;;;;GCpCH,MACUS,EAGX79D,WAAAA,CACUo9D,EACAU,EACAC,GAFA,KAAQX,SAARA,EACA,KAAgBU,iBAAhBA,EACA,KAAaC,cAAbA,EALF,KAAKC,MAAgC,KAO3C//D,KAAK+/D,MAAQD,EAAc5R,aAAa,CAAE6C,UAAU,IAC/C/wD,KAAK+/D,OACRD,EAAc7H,QAAO+H,GAAShgE,KAAK+/D,MAAQC,GAC5C,CAGHV,QAAAA,CAASC,GACP,OAAKv/D,KAAK+/D,MAgBH//D,KAAK+/D,MAAMT,SAASC,GAAcz5D,OAAMtD,GAGzCA,GAAwB,+BAAfA,EAAMkG,MACjBixD,EAAI,kEACG,MAEAh0D,QAAQH,OAAOhD,KAtBjB,IAAImD,SAA+B,CAACF,EAASD,KAKlDqsC,YAAW,KACL7xC,KAAK+/D,MACP//D,KAAKs/D,SAASC,GAAc9hD,KAAKhY,EAASD,GAE1CC,EAAQ,KACT,GACA,EAAE,GAaN,CAGL+5D,sBAAAA,CAAuBC,GAGjBz/D,KAAK+/D,MACP//D,KAAK+/D,MAAME,qBAAqBR,GAEhCz/D,KAAK8/D,cACF9uD,MACAyM,MAAKuiD,GAAQA,EAAKC,qBAAqBR,IAC3C,CAGHS,yBAAAA,CAA0BT,GACxBz/D,KAAK8/D,cACF9uD,MACAyM,MAAKuiD,GAAQA,EAAKG,wBAAwBV,IAAW,CAG1DE,qBAAAA,GACE,IAAIS,EACF,0DACApgE,KAAKm/D,SADL,iFAIE,eAAgBn/D,KAAK6/D,iBACvBO,GACE,uJAGO,mBAAoBpgE,KAAK6/D,iBAClCO,GACE,2JAIFA,GACE,kKAIJ3N,EAAK2N,EAAc,EAImF,MAC7FC,EAIXt+D,WAAAA,CAAoBu+D,GAAA,KAAWA,YAAXA,CAAW,CAE/BhB,QAAAA,CAASC,GACP,OAAO55D,QAAQF,QAAQ,CACrB66D,YAAatgE,KAAKsgE,aACjB,CAGLd,sBAAAA,CAAuBC,GAGrBA,EAASz/D,KAAKsgE,YAAa,CAG7BJ,yBAAAA,CAA0BT,GAAwC,CAElEE,qBAAAA,GAAqB,EAlBdU,EAAKE,MAAG;;;;;;;;;;;;;;;;;AC7GV,MAAMC,EAAmB,IAEnBC,GAAgB,IAEhBC,GAA0B,IAE1BC,GAAgB,IAEhBC,GAAY,IAIZC,GACX,6EAEWC,GAAqB,KAErBC,GAAuB,IAEvBC,GAAwB,KAExBC,GAAY,YAEZC,GAAe;;;;;;;;;;;;;;;;;ACdzB,MACUC,GAaXp/D,WAAAA,CACEgD,EACgBq8D,EACAhoC,EACAioC,EACAC,GAAqB,EACrBC,EAAyB,GACzBC,GAAyC,EACzCC,GAA2B,GAN3B,KAAML,OAANA,EACA,KAAShoC,UAATA,EACA,KAAaioC,cAAbA,EACA,KAASC,UAATA,EACA,KAAcC,eAAdA,EACA,KAA6BC,8BAA7BA,EACA,KAAeC,gBAAfA,EAEhBzhE,KAAK0hE,MAAQ38D,EAAK8c,cAClB7hB,KAAK2hE,QAAU3hE,KAAK0hE,MAAM5D,OAAO99D,KAAK0hE,MAAMhjD,QAAQ,KAAO,GAC3D1e,KAAK4hE,aACFjH,EAAkB3pD,IAAI,QAAUjM,IAAoB/E,KAAK0hE,KAAM,CAGpEG,eAAAA,GACE,MAA0C,OAAnC7hE,KAAK4hE,aAAa9D,OAAO,EAAG,EAAY,CAGjDgE,YAAAA,GACE,MACmB,mBAAjB9hE,KAAK2hE,SACY,wBAAjB3hE,KAAK2hE,OAAiC,CAI1C,QAAI58D,GACF,OAAO/E,KAAK0hE,KAAM,CAGpB,QAAI38D,CAAKg9D,GACHA,IAAY/hE,KAAK4hE,eACnB5hE,KAAK4hE,aAAeG,EAChB/hE,KAAK6hE,mBACPlH,EAAkB/oD,IAAI,QAAU5R,KAAK0hE,MAAO1hE,KAAK4hE,cAEpD,CAGHhmC,QAAAA,GACE,IAAIr9B,EAAMyB,KAAKgiE,cAIf,OAHIhiE,KAAKuhE,iBACPhjE,GAAO,IAAMyB,KAAKuhE,eAAiB,KAE9BhjE,CAAI,CAGbyjE,WAAAA,GACE,MAAMpG,EAAW57D,KAAKohE,OAAS,WAAa,UACtC/C,EAAQr+D,KAAKwhE,8BACf,OAAOxhE,KAAKo5B,YACZ,GACJ,MAAO,GAAGwiC,IAAW57D,KAAK+E,QAAQs5D,GAAQ,EAI9C,SAAS4D,GAAwBC,GAC/B,OACEA,EAASn9D,OAASm9D,EAASN,cAC3BM,EAASJ,gBACTI,EAASV,6BAEb,CAQG,SACaW,GACdD,EACA77D,EACAqF,GAKA,IAAI02D,EACJ,IAJAnkE,EAAAA,EAAAA,IAAuB,kBAAToI,EAAmB,+BACjCpI,EAAAA,EAAAA,IAAyB,kBAAXyN,EAAqB,gCAG/BrF,IAAS46D,GACXmB,GACGF,EAASd,OAAS,SAAW,SAAWc,EAASN,aAAe,YAC9D,IAAIv7D,IAAS66D,GAMlB,MAAM,IAAI7iE,MAAM,4BAA8BgI,GAL9C+7D,GACGF,EAASd,OAAS,WAAa,WAChCc,EAASN,aACT,OAGH,CACGK,GAAwBC,KAC1Bx2D,EAAO,MAAQw2D,EAAS9oC,WAG1B,MAAMipC,EAAkB,GAMxB,OAJArF,EAAKtxD,GAAQ,CAACpI,EAAaZ,KACzB2/D,EAAMhhE,KAAKiC,EAAM,IAAMZ,EAAM,IAGxB0/D,EAAUC,EAAM7iE,KAAK,IAC9B;;;;;;;;;;;;;;;;GC1HG,MACU8iE,GAAbvgE,WAAAA,GACU,KAASwgE,UAA4B,CAAC,CAAE,CAEhDC,gBAAAA,CAAiBxgE,EAAcygE,EAAiB,IACzCt4D,EAAAA,EAAAA,IAASnK,KAAKuiE,UAAWvgE,KAC5BhC,KAAKuiE,UAAUvgE,GAAQ,GAGzBhC,KAAKuiE,UAAUvgE,IAASygE,CAAO,CAGjCzxD,GAAAA,GACE,OAAOvO,EAAAA,EAAAA,IAASzC,KAAKuiE,UAAW;;;;;;;;;;;;;;;;GCbpC,MAAMG,GAAgD,CAAC,EACjDC,GAAsC,CAAC,EAEvC,SAAUC,GAA0BV,GACxC,MAAMW,EAAaX,EAAStmC,WAM5B,OAJK8mC,GAAYG,KACfH,GAAYG,GAAc,IAAIP,IAGzBI,GAAYG,EACrB,CAEgB,SAAAC,GACdZ,EACAa,GAEA,MAAMF,EAAaX,EAAStmC,WAM5B,OAJK+mC,GAAUE,KACbF,GAAUE,GAAcE,KAGnBJ,GAAUE,EACnB;;;;;;;;;;;;;;;;GCvBG,MACUG,GASXjhE,WAAAA,CAAoBkhE,GAAA,KAAUA,WAAVA,EARpB,KAAgBC,iBAAc,GAC9B,KAAkBC,mBAAG,EACrB,KAAkBC,oBAAI,EACtB,KAAOC,QAAwB,IAAK,CAOpCC,UAAAA,CAAWC,EAAqB19D,GAC9B7F,KAAKojE,mBAAqBG,EAC1BvjE,KAAKqjE,QAAUx9D,EACX7F,KAAKojE,mBAAqBpjE,KAAKmjE,qBACjCnjE,KAAKqjE,UACLrjE,KAAKqjE,QAAU,KAChB,CAQHG,cAAAA,CAAeC,EAAoBp6D,GACjCrJ,KAAKkjE,iBAAiBO,GAAcp6D,EACpC,MAAOrJ,KAAKkjE,iBAAiBljE,KAAKmjE,oBAAqB,CACrD,MAAMO,EAAY1jE,KAAKkjE,iBACrBljE,KAAKmjE,2BAEAnjE,KAAKkjE,iBAAiBljE,KAAKmjE,oBAClC,IAAK,IAAIzkE,EAAI,EAAGA,EAAIglE,EAAU/kE,SAAUD,EAClCglE,EAAUhlE,IACZkgE,GAAe,KACb5+D,KAAKijE,WAAWS,EAAUhlE,GAAG,IAInC,GAAIsB,KAAKmjE,qBAAuBnjE,KAAKojE,mBAAoB,CACnDpjE,KAAKqjE,UACPrjE,KAAKqjE,UACLrjE,KAAKqjE,QAAU,MAEjB,KACD,CACDrjE,KAAKmjE,oBACN;;;;;;;;;;;;;;;;GCtBE,MAAMQ,GAAgC,QAChCC,GAAkC,QAClCC,GAAoC,aACpCC,GAAiC,UACjCC,GAA6B,KAC7BC,GAA6B,KAC7BC,GAAiC,MACjCC,GAAsC,KACtCC,GAAsC,MACtCC,GAAuC,KACvCC,GAA+B,IAE/BC,GAAgD,SAKvDC,GAAoB,KACpBC,GAAkB,GAClBC,GAAmBF,GAAoBC,GAOvCE,GAA6B,KAK7BC,GAAqB,IAIxB,MACUC,GA4BX7iE,WAAAA,CACS8iE,EACA3C,EACC4C,EACAC,EACAC,EACDC,EACAC,GANA,KAAML,OAANA,EACA,KAAQ3C,SAARA,EACC,KAAa4C,cAAbA,EACA,KAAaC,cAAbA,EACA,KAASC,UAATA,EACD,KAAkBC,mBAAlBA,EACA,KAAaC,cAAbA,EAlCT,KAASC,UAAG,EACZ,KAAaC,cAAG,EAUR,KAAcC,gBAAG,EAyBvBrlE,KAAKslE,KAAO/J,EAAWsJ,GACvB7kE,KAAKulE,OAAS3C,GAA0BV,GACxCliE,KAAKwlE,MAAS95D,IAER1L,KAAK+kE,gBACPr5D,EAAOs1D,IAAyBhhE,KAAK+kE,eAEhC5C,GAAsBD,EAAUhB,GAAcx1D,GACrD,CAOJzD,IAAAA,CAAKw9D,EAA8BC,GACjC1lE,KAAK2lE,cAAgB,EACrB3lE,KAAK4lE,cAAgBF,EACrB1lE,KAAK6lE,gBAAkB,IAAI7C,GAAeyC,GAC1CzlE,KAAK8lE,WAAY,EAEjB9lE,KAAK+lE,qBAAuBl0B,YAAW,KACrC7xC,KAAKslE,KAAK,gCAEVtlE,KAAKgmE,YACLhmE,KAAK+lE,qBAAuB,IAAI,GAE/BnhC,KAAKihB,MAAM8e,KAGd3I,GAAoB,KAClB,GAAIh8D,KAAK8lE,UACP,OAIF9lE,KAAKimE,gBAAkB,IAAIC,IACzB,IAAInyD,KACF,MAAOoyD,EAASC,EAAMC,EAAMC,EAAMC,GAAQxyD,EAE1C,GADA/T,KAAKwmE,wBAAwBzyD,GACxB/T,KAAKimE,gBASV,GALIjmE,KAAK+lE,uBACPU,aAAazmE,KAAK+lE,sBAClB/lE,KAAK+lE,qBAAuB,MAE9B/lE,KAAKqlE,gBAAiB,EAClBc,IAAYxC,GACd3jE,KAAK4d,GAAKwoD,EACVpmE,KAAK0mE,SAAWL,MACX,IAAIF,IAAYvC,GAgBrB,MAAM,IAAIvlE,MAAM,kCAAoC8nE,GAdhDC,GAGFpmE,KAAKimE,gBAAgBU,cAAe,EAIpC3mE,KAAK6lE,gBAAgBvC,WAAW8C,GAAgB,KAC9CpmE,KAAKgmE,WAAW,KAGlBhmE,KAAKgmE,WAIR,KAEH,IAAIjyD,KACF,MAAO6yD,EAAIv9D,GAAQ0K,EACnB/T,KAAKwmE,wBAAwBzyD,GAC7B/T,KAAK6lE,gBAAgBrC,eAAeoD,EAAcv9D,EAAkB,IAEtE,KACErJ,KAAKgmE,WAAW,GAElBhmE,KAAKwlE,OAKP,MAAMqB,EAA8C,CAAC,EACrDA,EAAUlD,IAAiC,IAC3CkD,EAAU5C,IAAkCr/B,KAAKihB,MAC/B,IAAhBjhB,KAAK6jB,UAEHzoD,KAAKimE,gBAAgBa,2BACvBD,EAAU3C,IACRlkE,KAAKimE,gBAAgBa,0BAEzBD,EAAUpG,IAAiBD,EACvBxgE,KAAKilE,qBACP4B,EAAUnG,IAA2B1gE,KAAKilE,oBAExCjlE,KAAKklE,gBACP2B,EAAU/F,IAAsB9gE,KAAKklE,eAEnCllE,KAAK8kE,gBACP+B,EAAU9F,IAAwB/gE,KAAK8kE,eAErC9kE,KAAK+kE,gBACP8B,EAAU7F,IAAyBhhE,KAAK+kE,eAGpB,qBAAbpJ,UACPA,SAASoL,UACTlG,GAAgBr5D,KAAKm0D,SAASoL,YAE9BF,EAAUlG,IAAiBC,IAE7B,MAAMoG,EAAahnE,KAAKwlE,MAAMqB,GAC9B7mE,KAAKslE,KAAK,+BAAiC0B,GAC3ChnE,KAAKimE,gBAAgBgB,OAAOD,GAAY,QAEtC,GACD,CAMLnpD,KAAAA,GACE7d,KAAKimE,gBAAgBiB,cAAclnE,KAAK4d,GAAI5d,KAAK0mE,UACjD1mE,KAAKmnE,uBAAuBnnE,KAAK4d,GAAI5d,KAAK0mE,SAAU,CAQtD,iBAAOU,GACLxC,GAAsByC,aAAc,CAAK,CAQ3C,oBAAOC,GACL1C,GAAsB2C,gBAAiB,CAAK,CAI9C,kBAAOC,GACL,QAAI9/D,EAAAA,EAAAA,UAEOk9D,GAAsByC,cAM5BzC,GAAsB2C,gBACH,qBAAbpjE,UACmB,MAA1BA,SAASk6B,gBACR0/B,MACAE,IAEJ,CAMHwJ,qBAAAA,GAAqB,CAKbC,SAAAA,GACN1nE,KAAK8lE,WAAY,EAEb9lE,KAAKimE,kBACPjmE,KAAKimE,gBAAgB79D,QACrBpI,KAAKimE,gBAAkB,MAIrBjmE,KAAK2nE,iBACPxjE,SAASivC,KAAKxF,YAAY5tC,KAAK2nE,gBAC/B3nE,KAAK2nE,eAAiB,MAGpB3nE,KAAK+lE,uBACPU,aAAazmE,KAAK+lE,sBAClB/lE,KAAK+lE,qBAAuB,KAC7B,CAMKC,SAAAA,GACDhmE,KAAK8lE,YACR9lE,KAAKslE,KAAK,8BACVtlE,KAAK0nE,YAED1nE,KAAK4lE,gBACP5lE,KAAK4lE,cAAc5lE,KAAKqlE,gBACxBrlE,KAAK4lE,cAAgB,MAExB,CAOHx9D,KAAAA,GACOpI,KAAK8lE,YACR9lE,KAAKslE,KAAK,6BACVtlE,KAAK0nE,YACN,CAQHE,IAAAA,CAAKv+D,GACH,MAAMw+D,GAAUzgE,EAAAA,EAAAA,GAAUiC,GAC1BrJ,KAAKmlE,WAAa0C,EAAQlpE,OAC1BqB,KAAKulE,OAAO/C,iBAAiB,aAAcqF,EAAQlpE,QAGnD,MAAMmpE,GAAa7lE,EAAAA,EAAAA,IAAa4lE,GAI1B9K,EAAWF,EAAkBiL,EAAYrD,IAI/C,IAAK,IAAI/lE,EAAI,EAAGA,EAAIq+D,EAASp+D,OAAQD,IACnCsB,KAAKimE,gBAAgB8B,eACnB/nE,KAAK2lE,cACL5I,EAASp+D,OACTo+D,EAASr+D,IAEXsB,KAAK2lE,eACN,CAQHwB,sBAAAA,CAAuBvpD,EAAYoqD,GACjC,IAAItgE,EAAAA,EAAAA,MACF,OAEF1H,KAAK2nE,eAAiBxjE,SAASk6B,cAAc,UAC7C,MAAMwoC,EAAqC,CAAC,EAC5CA,EAAUvC,IAAiD,IAC3DuC,EAAU9C,IAA8BnmD,EACxCipD,EAAU7C,IAA8BgE,EACxChoE,KAAK2nE,eAAeM,IAAMjoE,KAAKwlE,MAAMqB,GACrC7mE,KAAK2nE,eAAezlC,MAAM6R,QAAU,OAEpC5vC,SAASivC,KAAKtE,YAAY9uC,KAAK2nE,eAAgB,CAMzCnB,uBAAAA,CAAwBzyD,GAE9B,MAAMqxD,GAAgBh+D,EAAAA,EAAAA,GAAU2M,GAAMpV,OACtCqB,KAAKolE,eAAiBA,EACtBplE,KAAKulE,OAAO/C,iBAAiB,iBAAkB4C,EAAe,EAW6B,MAClFc,GAiCXnkE,WAAAA,CACEmmE,EACAC,EACOzC,EACAF,GAEP,GAHO,KAAYE,aAAZA,EACA,KAAKF,MAALA,EAlCT,KAAA4C,oBAAsB,IAAI30D,IAG1B,KAAW40D,YAAmD,GAO9D,KAAAC,cAAgB1jC,KAAKihB,MAAsB,IAAhBjhB,KAAK6jB,UAIhC,KAAYke,cAAG,GAsBRj/D,EAAAA,EAAAA,MAuCH1H,KAAKkoE,UAAYA,EACjBloE,KAAKmoE,YAAcA,MAxCH,CAKhBnoE,KAAK8mE,yBAA2BhM,IAChCr3D,OACEogE,GAAoC7jE,KAAK8mE,0BACvCoB,EACJzkE,OAAOqgE,GAAiC9jE,KAAK8mE,0BAC3CqB,EAGFnoE,KAAKuoE,SAAWrC,GAA2BsC,gBAG3C,IAAIC,EAAS,GAGb,GACEzoE,KAAKuoE,SAASN,KACwC,gBAAtDjoE,KAAKuoE,SAASN,IAAInK,OAAO,EAAG,IAC5B,CACA,MAAM4K,EAAgBvkE,SAASwkE,OAC/BF,EAAS,4BAA8BC,EAAgB,cACxD,CACD,MAAME,EAAiB,eAAiBH,EAAS,iBACjD,IACEzoE,KAAKuoE,SAAS/6B,IAAIvlC,OAClBjI,KAAKuoE,SAAS/6B,IAAIq7B,MAAMD,GACxB5oE,KAAKuoE,SAAS/6B,IAAIplC,OACnB,CAAC,MAAO9F,GACPq3D,EAAI,2BACAr3D,EAAE6+C,OACJwY,EAAIr3D,EAAE6+C,OAERwY,EAAIr3D,EACL,CACF,CAGA,CAOK,oBAAOkmE,GACb,MAAMM,EAAS3kE,SAASk6B,cAAc,UAItC,GAHAyqC,EAAO5mC,MAAM6R,QAAU,QAGnB5vC,SAASivC,KAqBX,KAAM,oGApBNjvC,SAASivC,KAAKtE,YAAYg6B,GAC1B,IAIE,MAAMj+D,EAAIi+D,EAAOC,cAAc5kE,SAC1B0G,GAEH8uD,EAAI,gCAEP,CAAC,MAAOr3D,GACP,MAAMqmE,EAASxkE,SAASwkE,OACxBG,EAAOb,IACL,gEACAU,EACA,0BACH,CAkBH,OAVIG,EAAOE,gBACTF,EAAOt7B,IAAMs7B,EAAOE,gBACXF,EAAOC,cAChBD,EAAOt7B,IAAMs7B,EAAOC,cAAc5kE,SAExB2kE,EAAe3kE,WAEzB2kE,EAAOt7B,IAAOs7B,EAAe3kE,UAGxB2kE,CAAO,CAMhB1gE,KAAAA,GAEEpI,KAAKipE,OAAQ,EAETjpE,KAAKuoE,WAIPvoE,KAAKuoE,SAAS/6B,IAAI4F,KAAKhF,YAAc,GACrCyD,YAAW,KACa,OAAlB7xC,KAAKuoE,WACPpkE,SAASivC,KAAKxF,YAAY5tC,KAAKuoE,UAC/BvoE,KAAKuoE,SAAW,KACjB,GACA3jC,KAAKihB,MAAM,KAIhB,MAAM6f,EAAe1lE,KAAK0lE,aACtBA,IACF1lE,KAAK0lE,aAAe,KACpBA,IACD,CAQHwB,aAAAA,CAActpD,EAAYoqD,GACxBhoE,KAAKkpE,KAAOtrD,EACZ5d,KAAKmpE,KAAOnB,EACZhoE,KAAKipE,OAAQ,EAGb,MAAOjpE,KAAKopE,eAAiB,CAUvBA,WAAAA,GAIN,GACEppE,KAAKipE,OACLjpE,KAAK2mE,cACL3mE,KAAKooE,oBAAoBl3D,MAAQlR,KAAKqoE,YAAY1pE,OAAS,EAAI,EAAI,GACnE,CAEAqB,KAAKsoE,gBACL,MAAMzB,EAA8C,CAAC,EACrDA,EAAU9C,IAA8B/jE,KAAKkpE,KAC7CrC,EAAU7C,IAA8BhkE,KAAKmpE,KAC7CtC,EAAU5C,IAAkCjkE,KAAKsoE,cACjD,IAAIe,EAASrpE,KAAKwlE,MAAMqB,GAEpByC,EAAgB,GAChB5qE,EAAI,EAER,MAAOsB,KAAKqoE,YAAY1pE,OAAS,EAAG,CAElC,MAAM4qE,EAAUvpE,KAAKqoE,YAAY,GACjC,KACGkB,EAAQz8D,EAAgBnO,OACvB6lE,GACA8E,EAAc3qE,QAChB4lE,IAuBA,MAtBA,CAEA,MAAMiF,EAASxpE,KAAKqoE,YAAY52D,QAChC63D,EACEA,EACA,IACAnF,GACAzlE,EACA,IACA8qE,EAAOC,IACP,IACArF,GACA1lE,EACA,IACA8qE,EAAOE,GACP,IACArF,GACA3lE,EACA,IACA8qE,EAAO18D,EACTpO,GACD,CAGF,CAKD,OAHA2qE,GAAkBC,EAClBtpE,KAAK2pE,gBAAgBN,EAAQrpE,KAAKsoE,gBAE3B,CACR,CACC,OAAO,CACR,CASHP,cAAAA,CAAe6B,EAAgBC,EAAmBxgE,GAEhDrJ,KAAKqoE,YAAYhnE,KAAK,CAAEooE,IAAKG,EAAQF,GAAIG,EAAW/8D,EAAGzD,IAInDrJ,KAAKipE,OACPjpE,KAAKopE,aACN,CAQKO,eAAAA,CAAgBG,EAAaC,GAEnC/pE,KAAKooE,oBAAoB3xD,IAAIszD,GAE7B,MAAMC,EAAeA,KACnBhqE,KAAKooE,oBAAoBn3D,OAAO84D,GAChC/pE,KAAKopE,aAAa,EAKda,EAAmBp4B,WACvBm4B,EACAplC,KAAKihB,MAAM6e,KAGPwF,EAAeA,KAEnBzD,aAAawD,GAGbD,GAAc,EAGhBhqE,KAAKinE,OAAO6C,EAAKI,EAAc,CAQjCjD,MAAAA,CAAO6C,EAAaK,IACdziE,EAAAA,EAAAA,MAED1H,KAAaoqE,eAAeN,EAAKK,GAElCt4B,YAAW,KACT,IAEE,IAAK7xC,KAAK2mE,aACR,OAEF,MAAM0D,EAAYrqE,KAAKuoE,SAAS/6B,IAAInP,cAAc,UAClDgsC,EAAUhkE,KAAO,kBACjBgkE,EAAU5c,OAAQ,EAClB4c,EAAUpC,IAAM6B,EAEhBO,EAAUC,OAAUD,EAAkBE,mBACpC,WAEE,MAAMC,EAAUH,EAAkBpO,WAC7BuO,GAAqB,WAAXA,GAAkC,aAAXA,IAEpCH,EAAUC,OAAUD,EAAkBE,mBAAqB,KACvDF,EAAUtrC,YACZsrC,EAAUtrC,WAAW6O,YAAYy8B,GAEnCF,IAEJ,EACFE,EAAU9hE,QAAU,KAClBoxD,EAAI,oCAAsCmQ,GAC1C9pE,KAAK2mE,cAAe,EACpB3mE,KAAKoI,OAAO,EAEdpI,KAAKuoE,SAAS/6B,IAAI4F,KAAKtE,YAAYu7B,EACpC,CAAC,MAAO/nE,G,IAGRsiC,KAAKihB,MAAM,GACf;;;;;;;;;;;;;;;;GC7rBL,MAAM4kB,GAA2B,MAC3BC,GAA+B,KAErC,IAAIC,GAAgB,KACQ,qBAAjBC,aACTD,GAAgBC,aACc,qBAAdC,YAChBF,GAAgBE,WASf,MACUC,GA2BX/oE,WAAAA,CACS8iE,EACP3C,EACQ4C,EACAC,EACAC,EACRC,EACAC,GANO,KAAML,OAANA,EAEC,KAAaC,cAAbA,EACA,KAAaC,cAAbA,EACA,KAASC,UAATA,EA/BV,KAAc+F,eAAkB,KAChC,KAAMC,OAAoB,KAC1B,KAAWC,YAAG,EACd,KAAS9F,UAAG,EACZ,KAAaC,cAAG,EA+BdplE,KAAKslE,KAAO/J,EAAWv7D,KAAK6kE,QAC5B7kE,KAAKulE,OAAS3C,GAA0BV,GACxCliE,KAAKoiE,QAAU0I,GAAoBI,eACjChJ,EACA+C,EACAC,EACAH,EACAD,GAEF9kE,KAAKshE,UAAYY,EAASZ,SAAU,CAU9B,qBAAO4J,CACbhJ,EACA+C,EACAC,EACAH,EACAD,GAEA,MAAM+B,EAAqC,CAAC,EAwB5C,OAvBAA,EAAUpG,IAAiBD,IAGxB94D,EAAAA,EAAAA,OACmB,qBAAbi0D,UACPA,SAASoL,UACTlG,GAAgBr5D,KAAKm0D,SAASoL,YAE9BF,EAAUlG,IAAiBC,IAEzBqE,IACF4B,EAAUnG,IAA2BuE,GAEnCC,IACF2B,EAAU/F,IAAsBoE,GAE9BH,IACF8B,EAAU7F,IAAyB+D,GAEjCD,IACF+B,EAAU9F,IAAwB+D,GAG7B3C,GAAsBD,EAAUjB,GAAW4F,EAAW,CAO/D5+D,IAAAA,CAAKw9D,EAA8BC,GACjC1lE,KAAK0lE,aAAeA,EACpB1lE,KAAKylE,UAAYA,EAEjBzlE,KAAKslE,KAAK,2BAA6BtlE,KAAKoiE,SAE5CpiE,KAAKqlE,gBAAiB,EAEtB1K,EAAkB/oD,IAAI,8BAA8B,GAEpD,IACE,IAAI+P,EACJ,IAAIja,EAAAA,EAAAA,MAAa,CACf,MAAMyjE,EAASnrE,KAAKshE,UAAY,YAAc,OAE9C3/C,EAAU,CACRypD,QAAS,CACP,aAA0B,YAAA5K,KAAoBxiE,KAAe8F,QAAQunE,YAAYF,IACjF,mBAAoBnrE,KAAK8kE,eAAiB,KAS1C9kE,KAAKglE,YACPrjD,EAAQypD,QAAQ,iBAAmB,UAAUprE,KAAKglE,aAEhDhlE,KAAK+kE,gBACPpjD,EAAQypD,QAAQ,uBAAyBprE,KAAK+kE,eAIhD,MAAMuG,EAAMxnE,CAAAA,SAAAA,aAAAA,SAAAA,KACNwV,EAC+B,IAAnCtZ,KAAKoiE,QAAQ1jD,QAAQ,UACjB4sD,EAAI,gBAAkBA,EAAI,eAC1BA,EAAI,eAAiBA,EAAI,cAE3BhyD,IACFqI,EAAQ,SAAW,CAAE4pD,OAAQjyD,GAEhC,CACDtZ,KAAKwrE,OAAS,IAAIb,GAAc3qE,KAAKoiE,QAAS,GAAIzgD,EACnD,CAAC,MAAOrf,GACPtC,KAAKslE,KAAK,kCACV,MAAM9iE,EAAQF,EAAEnE,SAAWmE,EAAE+G,KAK7B,OAJI7G,GACFxC,KAAKslE,KAAK9iE,QAEZxC,KAAKgmE,WAEN,CAEDhmE,KAAKwrE,OAAOC,OAAS,KACnBzrE,KAAKslE,KAAK,wBACVtlE,KAAKqlE,gBAAiB,CAAI,EAG5BrlE,KAAKwrE,OAAOE,QAAU,KACpB1rE,KAAKslE,KAAK,0CACVtlE,KAAKwrE,OAAS,KACdxrE,KAAKgmE,WAAW,EAGlBhmE,KAAKwrE,OAAOG,UAAYn1C,IACtBx2B,KAAK4rE,oBAAoBp1C,EAAQ,EAGnCx2B,KAAKwrE,OAAOjjE,QAAUjG,IACpBtC,KAAKslE,KAAK,yCAEV,MAAM9iE,EAASF,EAAUnE,SAAYmE,EAAU+G,KAC3C7G,GACFxC,KAAKslE,KAAK9iE,GAEZxC,KAAKgmE,WAAW,CAChB,CAMJnoD,KAAAA,GAAK,CAIL,oBAAOypD,GACLwD,GAAoBvD,gBAAiB,CAAK,CAG5C,kBAAOC,GACL,IAAIqE,GAAe,EACnB,GAAyB,qBAAdvkE,WAA6BA,UAAUu5C,UAAW,CAC3D,MAAMirB,EAAkB,iCAClBC,EAAkBzkE,UAAUu5C,UAAUz8C,MAAM0nE,GAC9CC,GAAmBA,EAAgBptE,OAAS,GAC1C07C,WAAW0xB,EAAgB,IAAM,MACnCF,GAAe,EAGpB,CAED,OACGA,GACiB,OAAlBlB,KACCG,GAAoBvD,cAAc,CAiBvC,uBAAOyE,GAGL,OACErR,EAAkBJ,oBACsC,IAAxDI,EAAkB3pD,IAAI,6BAAsC,CAIhEy2D,qBAAAA,GACE9M,EAAkBjyC,OAAO,6BAA8B,CAGjDujD,YAAAA,CAAa5iE,GAEnB,GADArJ,KAAKgrE,OAAO3pE,KAAKgI,GACbrJ,KAAKgrE,OAAOrsE,SAAWqB,KAAKirE,YAAa,CAC3C,MAAMiB,EAAWlsE,KAAKgrE,OAAOxrE,KAAK,IAClCQ,KAAKgrE,OAAS,KACd,MAAMmB,GAAWviE,EAAAA,EAAAA,IAASsiE,GAG1BlsE,KAAKylE,UAAU0G,EAChB,EAMKC,oBAAAA,CAAqBC,GAC3BrsE,KAAKirE,YAAcoB,EACnBrsE,KAAKgrE,OAAS,EAAG,CAOXsB,kBAAAA,CAAmBjjE,GAIzB,IAHApL,EAAAA,EAAAA,IAAuB,OAAhB+B,KAAKgrE,OAAiB,kCAGzB3hE,EAAK1K,QAAU,EAAG,CACpB,MAAM0tE,EAAap5D,OAAO5J,GAC1B,IAAKixC,MAAM+xB,GAET,OADArsE,KAAKosE,qBAAqBC,GACnB,IAEV,CAED,OADArsE,KAAKosE,qBAAqB,GACnB/iE,CAAK,CAOduiE,mBAAAA,CAAoBW,GAClB,GAAoB,OAAhBvsE,KAAKwrE,OACP,OAEF,MAAMniE,EAAOkjE,EAAK,QAMlB,GALAvsE,KAAKolE,eAAiB/7D,EAAK1K,OAC3BqB,KAAKulE,OAAO/C,iBAAiB,iBAAkBn5D,EAAK1K,QAEpDqB,KAAKwsE,iBAEe,OAAhBxsE,KAAKgrE,OAEPhrE,KAAKisE,aAAa5iE,OACb,CAEL,MAAMojE,EAAgBzsE,KAAKssE,mBAAmBjjE,GACxB,OAAlBojE,GACFzsE,KAAKisE,aAAaQ,EAErB,EAOH7E,IAAAA,CAAKv+D,GACHrJ,KAAKwsE,iBAEL,MAAM3E,GAAUzgE,EAAAA,EAAAA,GAAUiC,GAC1BrJ,KAAKmlE,WAAa0C,EAAQlpE,OAC1BqB,KAAKulE,OAAO/C,iBAAiB,aAAcqF,EAAQlpE,QAKnD,MAAMo+D,EAAWF,EAAkBgL,EAAS4C,IAGxC1N,EAASp+D,OAAS,GACpBqB,KAAK0sE,YAAYxtE,OAAO69D,EAASp+D,SAInC,IAAK,IAAID,EAAI,EAAGA,EAAIq+D,EAASp+D,OAAQD,IACnCsB,KAAK0sE,YAAY3P,EAASr+D,GAC3B,CAGKgpE,SAAAA,GACN1nE,KAAK8lE,WAAY,EACb9lE,KAAK+qE,iBACP4B,cAAc3sE,KAAK+qE,gBACnB/qE,KAAK+qE,eAAiB,MAGpB/qE,KAAKwrE,SACPxrE,KAAKwrE,OAAOpjE,QACZpI,KAAKwrE,OAAS,KACf,CAGKxF,SAAAA,GACDhmE,KAAK8lE,YACR9lE,KAAKslE,KAAK,+BACVtlE,KAAK0nE,YAGD1nE,KAAK0lE,eACP1lE,KAAK0lE,aAAa1lE,KAAKqlE,gBACvBrlE,KAAK0lE,aAAe,MAEvB,CAOHt9D,KAAAA,GACOpI,KAAK8lE,YACR9lE,KAAKslE,KAAK,6BACVtlE,KAAK0nE,YACN,CAOH8E,cAAAA,GACEG,cAAc3sE,KAAK+qE,gBACnB/qE,KAAK+qE,eAAiB6B,aAAY,KAE5B5sE,KAAKwrE,QACPxrE,KAAK0sE,YAAY,KAEnB1sE,KAAKwsE,gBAAgB,GAEpB5nC,KAAKihB,MAAM6kB,IAAsC,CAQ9CgC,WAAAA,CAAYnuE,GAIlB,IACEyB,KAAKwrE,OAAO5D,KAAKrpE,EAClB,CAAC,MAAO+D,GACPtC,KAAKslE,KACH,0CACAhjE,EAAEnE,SAAWmE,EAAE+G,KACf,uBAEFwoC,WAAW7xC,KAAKgmE,UAAUtoD,KAAK1d,MAAO,EACvC,GA1LI8qE,GAA4B+B,6BAAG,EAK/B/B,GAAcgC,eAAG;;;;;;;;;;;;;;;;;ACnPvB,MACUC,GAqBXhrE,WAAAA,CAAYmgE,GACVliE,KAAKgtE,gBAAgB9K,EAAU,CAhBjC,yBAAW+K,GACT,MAAO,CAACrI,GAAuBkG,GAAqB,CAOtD,mCAAWoC,GACT,OAAOltE,KAAKmtE,2BAA4B,CAUlCH,eAAAA,CAAgB9K,GACtB,MAAMkL,EACJtC,IAAuBA,GAAoB,iBAC7C,IAAIuC,EACFD,IAA0BtC,GAAoBkB,mBAYhD,GAVI9J,EAASb,gBACN+L,GACH3a,EACE,mFAIJ4a,GAAuB,GAGrBA,EACFrtE,KAAKstE,YAAc,CAACxC,QACf,CACL,MAAMyC,EAAcvtE,KAAKstE,YAAc,GACvC,IAAK,MAAME,KAAaT,GAAiBE,eACnCO,GAAaA,EAAU,kBACzBD,EAAWlsE,KAAKmsE,GAGpBT,GAAiBI,6BAA8B,CAChD,EAMHM,gBAAAA,GACE,GAAIztE,KAAKstE,YAAY3uE,OAAS,EAC5B,OAAOqB,KAAKstE,YAAY,GAExB,MAAM,IAAIjvE,MAAM,0BACjB,CAMHqvE,gBAAAA,GACE,OAAI1tE,KAAKstE,YAAY3uE,OAAS,EACrBqB,KAAKstE,YAAY,GAEjB,IACR,EArEIP,GAA2BI,6BAAG;;;;;;;;;;;;;;;;;ACFvC,MAAMQ,GAAkB,IAIlBC,GAAsC,IAKtCC,GAA8B,MAC9BC,GAAkC,OAQlCC,GAAe,IACfC,GAAe,IACfC,GAAmB,IACnBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAe,IACfC,GAAa,IACbC,GAAmB,IACnBC,GAAO,IAEPC,GAAe,IAKlB,MACUC,GA6BX1sE,WAAAA,CACS6b,EACC8wD,EACAC,EACAC,EACAC,EACA5L,EACA6L,EACAlJ,EACAmJ,EACD7J,GATA,KAAEtnD,GAAFA,EACC,KAAS8wD,UAATA,EACA,KAAcC,eAAdA,EACA,KAAcC,eAAdA,EACA,KAAUC,WAAVA,EACA,KAAU5L,WAAVA,EACA,KAAQ6L,SAARA,EACA,KAAalJ,cAAbA,EACA,KAAOmJ,QAAPA,EACD,KAAa7J,cAAbA,EAtCT,KAAe8J,gBAAG,EAClB,KAAmBC,oBAAc,GAWzB,KAAAC,OAAkC,EA4BxClvE,KAAKslE,KAAO/J,EAAW,KAAOv7D,KAAK4d,GAAK,KACxC5d,KAAKmvE,kBAAoB,IAAIpC,GAAiB2B,GAC9C1uE,KAAKslE,KAAK,sBACVtlE,KAAKovE,QAAS,CAMRA,MAAAA,GACN,MAAMC,EAAOrvE,KAAKmvE,kBAAkB1B,mBACpCztE,KAAKsvE,MAAQ,IAAID,EACfrvE,KAAKuvE,mBACLvvE,KAAK0uE,UACL1uE,KAAK2uE,eACL3uE,KAAK4uE,eACL5uE,KAAK6uE,WACL,KACA7uE,KAAKklE,eAKPllE,KAAKwvE,0BAA4BH,EAAK,iCAAmC,EAEzE,MAAMI,EAAoBzvE,KAAK0vE,cAAc1vE,KAAKsvE,OAC5CK,EAAmB3vE,KAAK4vE,iBAAiB5vE,KAAKsvE,OACpDtvE,KAAK6vE,IAAM7vE,KAAKsvE,MAChBtvE,KAAK8vE,IAAM9vE,KAAKsvE,MAChBtvE,KAAK+vE,eAAiB,KACtB/vE,KAAKgwE,YAAa,EAQlBn+B,YAAW,KAET7xC,KAAKsvE,OAAStvE,KAAKsvE,MAAMrnE,KAAKwnE,EAAmBE,EAAiB,GACjE/qC,KAAKihB,MAAM,IAEd,MAAMoqB,EAAmBZ,EAAK,mBAAqB,EAC/CY,EAAmB,IACrBjwE,KAAKkwE,gBAAkBnR,GAAsB,KAC3C/+D,KAAKkwE,gBAAkB,KAClBlwE,KAAKgwE,aAENhwE,KAAKsvE,OACLtvE,KAAKsvE,MAAMlK,cAAgB0I,IAE3B9tE,KAAKslE,KACH,wDACEtlE,KAAKsvE,MAAMlK,cACX,wCAEJplE,KAAKgwE,YAAa,EAClBhwE,KAAKsvE,MAAM7H,yBAEXznE,KAAKsvE,OACLtvE,KAAKsvE,MAAMnK,UAAY0I,GAEvB7tE,KAAKslE,KACH,oDACEtlE,KAAKsvE,MAAMnK,UACX,uCAKJnlE,KAAKslE,KAAK,+CACVtlE,KAAKoI,SAER,GAEAw8B,KAAKihB,MAAMoqB,IACf,CAGKV,gBAAAA,GACN,MAAO,KAAOvvE,KAAK4d,GAAK,IAAM5d,KAAKgvE,iBAAkB,CAG/CY,gBAAAA,CAAiBP,GACvB,OAAOc,IACDd,IAASrvE,KAAKsvE,MAChBtvE,KAAKowE,kBAAkBD,GACdd,IAASrvE,KAAK+vE,gBACvB/vE,KAAKslE,KAAK,8BACVtlE,KAAKqwE,8BAELrwE,KAAKslE,KAAK,4BACX,CACD,CAGIoK,aAAAA,CAAcL,GACpB,OAAQlxE,IACS,IAAX6B,KAAKkvE,SACHG,IAASrvE,KAAK8vE,IAChB9vE,KAAKswE,0BAA0BnyE,GACtBkxE,IAASrvE,KAAK+vE,eACvB/vE,KAAKuwE,4BAA4BpyE,GAEjC6B,KAAKslE,KAAK,6BAEb,CACD,CAMJkL,WAAAA,CAAYC,GAEV,MAAMC,EAAM,CAAE9jE,EAAG,IAAKE,EAAG2jE,GACzBzwE,KAAK2wE,UAAUD,EAAK,CAGtBE,oBAAAA,GACM5wE,KAAK6vE,MAAQ7vE,KAAK+vE,gBAAkB/vE,KAAK8vE,MAAQ9vE,KAAK+vE,iBACxD/vE,KAAKslE,KACH,2CAA6CtlE,KAAK+vE,eAAelL,QAEnE7kE,KAAKsvE,MAAQtvE,KAAK+vE,eAClB/vE,KAAK+vE,eAAiB,KAEvB,CAGKc,mBAAAA,CAAoBC,GAC1B,GAAI/C,MAAgB+C,EAAa,CAC/B,MAAMC,EAAMD,EAAY/C,IACpBgD,IAAQ1C,GACVruE,KAAKgxE,6BACID,IAAQ7C,IAEjBluE,KAAKslE,KAAK,wCACVtlE,KAAK+vE,eAAe3nE,QAGlBpI,KAAK6vE,MAAQ7vE,KAAK+vE,gBAClB/vE,KAAK8vE,MAAQ9vE,KAAK+vE,gBAElB/vE,KAAKoI,SAEE2oE,IAAQ3C,KACjBpuE,KAAKslE,KAAK,0BACVtlE,KAAKixE,8BACLjxE,KAAKgxE,6BAER,EAGKT,2BAAAA,CAA4BW,GAClC,MAAMC,EAAgBxU,EAAW,IAAKuU,GAChC7nE,EAAgBszD,EAAW,IAAKuU,GACtC,GAAc,MAAVC,EACFnxE,KAAK6wE,oBAAoBxnE,OACpB,IAAc,MAAV8nE,EAIT,MAAM,IAAI9yE,MAAM,2BAA6B8yE,GAF7CnxE,KAAKivE,oBAAoB5tE,KAAKgI,EAG/B,EAGK2nE,0BAAAA,GACFhxE,KAAKixE,6BAA+B,GACtCjxE,KAAKslE,KAAK,oCACVtlE,KAAKgwE,YAAa,EAClBhwE,KAAK+vE,eAAetI,wBACpBznE,KAAKoxE,wBAGLpxE,KAAKslE,KAAK,8BACVtlE,KAAK+vE,eAAenI,KAAK,CAAEh7D,EAAG,IAAKE,EAAG,CAAEF,EAAG2hE,GAAMzhE,EAAG,CAAC,KACtD,CAGKskE,mBAAAA,GAENpxE,KAAK+vE,eAAelyD,QAEpB7d,KAAKslE,KAAK,mCACVtlE,KAAK+vE,eAAenI,KAAK,CAAEh7D,EAAG,IAAKE,EAAG,CAAEF,EAAGyhE,GAAYvhE,EAAG,CAAC,KAI3D9M,KAAKslE,KAAK,kCACVtlE,KAAKsvE,MAAM1H,KAAK,CAAEh7D,EAAG,IAAKE,EAAG,CAAEF,EAAG0hE,GAAkBxhE,EAAG,CAAC,KACxD9M,KAAK6vE,IAAM7vE,KAAK+vE,eAEhB/vE,KAAK4wE,sBAAuB,CAGtBN,yBAAAA,CAA0BY,GAEhC,MAAMC,EAAgBxU,EAAW,IAAKuU,GAChC7nE,EAAgBszD,EAAW,IAAKuU,GACxB,MAAVC,EACFnxE,KAAKqxE,WAAWhoE,GACG,MAAV8nE,GACTnxE,KAAKsxE,eAAejoE,EACrB,CAGKioE,cAAAA,CAAenzE,GACrB6B,KAAKuxE,qBAGLvxE,KAAKijE,WAAW9kE,EAAS,CAGnBozE,kBAAAA,GACDvxE,KAAKgwE,aACRhwE,KAAKwvE,4BACDxvE,KAAKwvE,2BAA6B,IACpCxvE,KAAKslE,KAAK,kCACVtlE,KAAKgwE,YAAa,EAClBhwE,KAAKsvE,MAAM7H,yBAEd,CAGK4J,UAAAA,CAAWP,GACjB,MAAMC,EAAcpU,EAAWoR,GAAc+C,GAC7C,GAAI9C,MAAgB8C,EAAa,CAC/B,MAAMpqE,EAAUoqE,EAAY9C,IAC5B,GAAI+C,IAAQvC,GAAc,CACxB,MAAMgD,EAAgBzuE,OAAA4D,OAAA,GAChBD,GAOF1G,KAAK0uE,UAAUjN,kBAEjB+P,EAAiBv7C,EAAIj2B,KAAK0uE,UAAU3pE,MAEtC/E,KAAKyxE,aAAaD,EACnB,MAAM,GAAIT,IAAQzC,GAAkB,CACnCtuE,KAAKslE,KAAK,qCACVtlE,KAAK8vE,IAAM9vE,KAAK+vE,eAChB,IAAK,IAAIrxE,EAAI,EAAGA,EAAIsB,KAAKivE,oBAAoBtwE,SAAUD,EACrDsB,KAAKsxE,eAAetxE,KAAKivE,oBAAoBvwE,IAE/CsB,KAAKivE,oBAAsB,GAC3BjvE,KAAK4wE,sBACN,MAAUG,IAAQ9C,GAGjBjuE,KAAK0xE,sBAAsBhrE,GAClBqqE,IAAQ7C,GAEjBluE,KAAK2xE,SAASjrE,GACLqqE,IAAQ5C,GACjB3rE,EAAM,iBAAmBkE,GAChBqqE,IAAQ3C,IACjBpuE,KAAKslE,KAAK,wBACVtlE,KAAKuxE,qBACLvxE,KAAK4xE,iCAELpvE,EAAM,mCAAqCuuE,EAE9C,EAMKU,YAAAA,CAAaI,GAMnB,MAAMC,EAAYD,EAAUnI,GACtB/wC,EAAUk5C,EAAUvhE,EACpBvL,EAAO8sE,EAAU57C,EACvBj2B,KAAK+xE,UAAYF,EAAU3pD,EAC3BloB,KAAK0uE,UAAU3pE,KAAOA,EAEP,IAAX/E,KAAKkvE,SACPlvE,KAAKsvE,MAAMzxD,QACX7d,KAAKgyE,yBAAyBhyE,KAAKsvE,MAAOwC,GACtCtR,IAAqB7nC,GACvB85B,EAAK,sCAGPzyD,KAAKiyE,mBACN,CAGKA,gBAAAA,GACN,MAAM5C,EAAOrvE,KAAKmvE,kBAAkBzB,mBAChC2B,GACFrvE,KAAKkyE,cAAc7C,EACpB,CAGK6C,aAAAA,CAAc7C,GACpBrvE,KAAK+vE,eAAiB,IAAIV,EACxBrvE,KAAKuvE,mBACLvvE,KAAK0uE,UACL1uE,KAAK2uE,eACL3uE,KAAK4uE,eACL5uE,KAAK6uE,WACL7uE,KAAK+xE,WAIP/xE,KAAKixE,4BACH5B,EAAK,iCAAmC,EAE1C,MAAM5J,EAAYzlE,KAAK0vE,cAAc1vE,KAAK+vE,gBACpCrK,EAAe1lE,KAAK4vE,iBAAiB5vE,KAAK+vE,gBAChD/vE,KAAK+vE,eAAe9nE,KAAKw9D,EAAWC,GAGpC3G,GAAsB,KAChB/+D,KAAK+vE,iBACP/vE,KAAKslE,KAAK,gCACVtlE,KAAK+vE,eAAe3nE,QACrB,GACAw8B,KAAKihB,MAAM8nB,IAAkB,CAG1BgE,QAAAA,CAAS5sE,GACf/E,KAAKslE,KAAK,qCAAuCvgE,GACjD/E,KAAK0uE,UAAU3pE,KAAOA,EAGP,IAAX/E,KAAKkvE,OACPlvE,KAAKoI,SAGLpI,KAAKmyE,oBACLnyE,KAAKovE,SACN,CAGK4C,wBAAAA,CAAyB3C,EAAiByC,GAChD9xE,KAAKslE,KAAK,oCACVtlE,KAAKsvE,MAAQD,EACbrvE,KAAKkvE,OAAM,EAEPlvE,KAAK8uE,WACP9uE,KAAK8uE,SAASgD,EAAW9xE,KAAK+xE,WAC9B/xE,KAAK8uE,SAAW,MAKqB,IAAnC9uE,KAAKwvE,2BACPxvE,KAAKslE,KAAK,kCACVtlE,KAAKgwE,YAAa,GAElBjR,GAAsB,KACpB/+D,KAAK4xE,+BAA+B,GACnChtC,KAAKihB,MAAM+nB,IACf,CAGKgE,6BAAAA,GAED5xE,KAAKgwE,YAAyB,IAAXhwE,KAAKkvE,SAC3BlvE,KAAKslE,KAAK,4BACVtlE,KAAK2wE,UAAU,CAAE/jE,EAAG,IAAKE,EAAG,CAAEF,EAAG2hE,GAAMzhE,EAAG,CAAC,KAC5C,CAGKujE,0BAAAA,GACN,MAAMhB,EAAOrvE,KAAK+vE,eAClB/vE,KAAK+vE,eAAiB,KAClB/vE,KAAK6vE,MAAQR,GAAQrvE,KAAK8vE,MAAQT,GAEpCrvE,KAAKoI,OACN,CAOKgoE,iBAAAA,CAAkBD,GACxBnwE,KAAKsvE,MAAQ,KAIRa,GAA4B,IAAXnwE,KAAKkvE,OAQL,IAAXlvE,KAAKkvE,QACdlvE,KAAKslE,KAAK,8BARVtlE,KAAKslE,KAAK,+BAENtlE,KAAK0uE,UAAU7M,oBACjBlH,EAAkBjyC,OAAO,QAAU1oB,KAAK0uE,UAAU3pE,MAElD/E,KAAK0uE,UAAU9M,aAAe5hE,KAAK0uE,UAAU3pE,OAMjD/E,KAAKoI,OAAQ,CAGPspE,qBAAAA,CAAsBpT,GAC5Bt+D,KAAKslE,KAAK,0DAENtlE,KAAK+uE,UACP/uE,KAAK+uE,QAAQzQ,GACbt+D,KAAK+uE,QAAU,MAKjB/uE,KAAK4lE,cAAgB,KAErB5lE,KAAKoI,OAAQ,CAGPuoE,SAAAA,CAAUtnE,GAChB,GAAe,IAAXrJ,KAAKkvE,OACP,KAAM,8BAENlvE,KAAK6vE,IAAIjI,KAAKv+D,EACf,CAMHjB,KAAAA,GACiB,IAAXpI,KAAKkvE,SACPlvE,KAAKslE,KAAK,gCACVtlE,KAAKkvE,OAAM,EAEXlvE,KAAKmyE,oBAEDnyE,KAAK4lE,gBACP5lE,KAAK4lE,gBACL5lE,KAAK4lE,cAAgB,MAExB,CAGKuM,iBAAAA,GACNnyE,KAAKslE,KAAK,iCACNtlE,KAAKsvE,QACPtvE,KAAKsvE,MAAMlnE,QACXpI,KAAKsvE,MAAQ,MAGXtvE,KAAK+vE,iBACP/vE,KAAK+vE,eAAe3nE,QACpBpI,KAAK+vE,eAAiB,MAGpB/vE,KAAKkwE,kBACPzJ,aAAazmE,KAAKkwE,iBAClBlwE,KAAKkwE,gBAAkB,KACxB;;;;;;;;;;;;;;;;GCniBF,MACmBkC,GAkBpB9e,GAAAA,CACE+e,EACAhpE,EACAipE,EACAC,GAAa,CAGfC,KAAAA,CACEH,EACAhpE,EACAipE,EACAC,GAAa,CAOfE,gBAAAA,CAAiBzsE,GAAa,CAM9B0sE,oBAAAA,CAAqB1sE,GAAa,CAElC2sE,eAAAA,CACEN,EACAhpE,EACAipE,GAA2C,CAG7CM,iBAAAA,CACEP,EACAhpE,EACAipE,GAA2C,CAG7CO,kBAAAA,CACER,EACAC,GAA2C,CAG7CQ,WAAAA,CAAYC,GAA+B;;;;;;;;;;;;;;;;GChE1C,MACmBC,GAQpBjxE,WAAAA,CAAoBkxE,GAAA,KAAcA,eAAdA,EAPZ,KAAUC,WAKd,CAAC,GAGHj1E,EAAAA,EAAAA,IACEsC,MAAMC,QAAQyyE,IAAmBA,EAAet0E,OAAS,EACzD,6BACA,CAcM6Q,OAAAA,CAAQ2jE,KAAsBjY,GACtC,GAAI36D,MAAMC,QAAQR,KAAKkzE,WAAWC,IAAa,CAE7C,MAAMC,EAAY,IAAIpzE,KAAKkzE,WAAWC,IAEtC,IAAK,IAAIz0E,EAAI,EAAGA,EAAI00E,EAAUz0E,OAAQD,IACpC00E,EAAU10E,GAAGmH,SAASqO,MAAMk/D,EAAU10E,GAAGw5B,QAASgjC,EAErD,EAGHtsD,EAAAA,CAAGukE,EAAmBttE,EAAgCqyB,GACpDl4B,KAAKqzE,mBAAmBF,GACxBnzE,KAAKkzE,WAAWC,GAAanzE,KAAKkzE,WAAWC,IAAc,GAC3DnzE,KAAKkzE,WAAWC,GAAW9xE,KAAK,CAAEwE,WAAUqyB,YAE5C,MAAMo7C,EAAYtzE,KAAKuzE,gBAAgBJ,GACnCG,GACFztE,EAASqO,MAAMgkB,EAASo7C,EACzB,CAGHzkE,GAAAA,CAAIskE,EAAmBttE,EAAgCqyB,GACrDl4B,KAAKqzE,mBAAmBF,GACxB,MAAMC,EAAYpzE,KAAKkzE,WAAWC,IAAc,GAChD,IAAK,IAAIz0E,EAAI,EAAGA,EAAI00E,EAAUz0E,OAAQD,IACpC,GACE00E,EAAU10E,GAAGmH,WAAaA,KACxBqyB,GAAWA,IAAYk7C,EAAU10E,GAAGw5B,SAGtC,YADAk7C,EAAU90D,OAAO5f,EAAG,EAGvB,CAGK20E,kBAAAA,CAAmBF,IACzBl1E,EAAAA,EAAAA,IACE+B,KAAKizE,eAAe9d,MAAKqe,GAChBA,IAAOL,IAEhB,kBAAoBA,EACpB;;;;;;;;;;;;;;;;GC/DA,MAAOM,WAAsBT,GAOjCjxE,WAAAA,GACE6G,MAAM,CAAC,WAPD,KAAO8qE,SAAG,EAcI,qBAAXjwE,QAC4B,qBAA5BA,OAAO4uC,mBACb9qC,EAAAA,EAAAA,QAED9D,OAAO4uC,iBACL,UACA,KACOryC,KAAK0zE,UACR1zE,KAAK0zE,SAAU,EACf1zE,KAAKwP,QAAQ,UAAU,GACxB,IAEH,GAGF/L,OAAO4uC,iBACL,WACA,KACMryC,KAAK0zE,UACP1zE,KAAK0zE,SAAU,EACf1zE,KAAKwP,QAAQ,UAAU,GACxB,IAEH,GAEH,CArCH,kBAAOmkE,GACL,OAAO,IAAIF,EAAgB,CAuC7BF,eAAAA,CAAgBJ,GAEd,OADAl1E,EAAAA,EAAAA,IAAqB,WAAdk1E,EAAwB,uBAAyBA,GACjD,CAACnzE,KAAK0zE,QAAS,CAGxBE,eAAAA,GACE,OAAO5zE,KAAK0zE,OAAQ;;;;;;;;;;;;;;;;GCvDxB,MAAMG,GAAiB,GAGjBC,GAAwB,IAM3B,MAEUC,GAQXhyE,WAAAA,CAAYiyE,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvBj0E,KAAKk0E,QAAWF,EAAwBhqE,MAAM,KAG9C,IAAImqE,EAAS,EACb,IAAK,IAAIz1E,EAAI,EAAGA,EAAIsB,KAAKk0E,QAAQv1E,OAAQD,IACnCsB,KAAKk0E,QAAQx1E,GAAGC,OAAS,IAC3BqB,KAAKk0E,QAAQC,GAAUn0E,KAAKk0E,QAAQx1E,GACpCy1E,KAGJn0E,KAAKk0E,QAAQv1E,OAASw1E,EAEtBn0E,KAAKo0E,UAAY,CAClB,MACCp0E,KAAKk0E,QAAUF,EACfh0E,KAAKo0E,UAAYH,CAClB,CAGHr4C,QAAAA,GACE,IAAIy2C,EAAa,GACjB,IAAK,IAAI3zE,EAAIsB,KAAKo0E,UAAW11E,EAAIsB,KAAKk0E,QAAQv1E,OAAQD,IAC5B,KAApBsB,KAAKk0E,QAAQx1E,KACf2zE,GAAc,IAAMryE,KAAKk0E,QAAQx1E,IAIrC,OAAO2zE,GAAc,GAAI,EAE5B,SAEegC,KACd,OAAO,IAAIN,GAAK,GAClB,CAEM,SAAUO,GAAavrD,GAC3B,OAAIA,EAAKqrD,WAAarrD,EAAKmrD,QAAQv1E,OAC1B,KAGFoqB,EAAKmrD,QAAQnrD,EAAKqrD,UAC3B,CAKM,SAAUG,GAAcxrD,GAC5B,OAAOA,EAAKmrD,QAAQv1E,OAASoqB,EAAKqrD,SACpC,CAEM,SAAUI,GAAazrD,GAC3B,IAAIkrD,EAAWlrD,EAAKqrD,UAIpB,OAHIH,EAAWlrD,EAAKmrD,QAAQv1E,QAC1Bs1E,IAEK,IAAIF,GAAKhrD,EAAKmrD,QAASD,EAChC,CAEM,SAAUQ,GAAY1rD,GAC1B,OAAIA,EAAKqrD,UAAYrrD,EAAKmrD,QAAQv1E,OACzBoqB,EAAKmrD,QAAQnrD,EAAKmrD,QAAQv1E,OAAS,GAGrC,IACT,CAEM,SAAU+1E,GAAuB3rD,GACrC,IAAIspD,EAAa,GACjB,IAAK,IAAI3zE,EAAIqqB,EAAKqrD,UAAW11E,EAAIqqB,EAAKmrD,QAAQv1E,OAAQD,IAC5B,KAApBqqB,EAAKmrD,QAAQx1E,KACf2zE,GAAc,IAAMvmE,mBAAmB5M,OAAO6pB,EAAKmrD,QAAQx1E,MAI/D,OAAO2zE,GAAc,GACvB,CAKG,SACasC,GAAU5rD,EAAY6rD,EAAgB,GACpD,OAAO7rD,EAAKmrD,QAAQp0D,MAAMiJ,EAAKqrD,UAAYQ,EAC7C,CAEM,SAAUC,GAAW9rD,GACzB,GAAIA,EAAKqrD,WAAarrD,EAAKmrD,QAAQv1E,OACjC,OAAO,KAGT,MAAMm2E,EAAS,GACf,IAAK,IAAIp2E,EAAIqqB,EAAKqrD,UAAW11E,EAAIqqB,EAAKmrD,QAAQv1E,OAAS,EAAGD,IACxDo2E,EAAOzzE,KAAK0nB,EAAKmrD,QAAQx1E,IAG3B,OAAO,IAAIq1E,GAAKe,EAAQ,EAC1B,CAEgB,SAAAC,GAAUhsD,EAAYisD,GACpC,MAAMF,EAAS,GACf,IAAK,IAAIp2E,EAAIqqB,EAAKqrD,UAAW11E,EAAIqqB,EAAKmrD,QAAQv1E,OAAQD,IACpDo2E,EAAOzzE,KAAK0nB,EAAKmrD,QAAQx1E,IAG3B,GAAIs2E,aAAwBjB,GAC1B,IAAK,IAAIr1E,EAAIs2E,EAAaZ,UAAW11E,EAAIs2E,EAAad,QAAQv1E,OAAQD,IACpEo2E,EAAOzzE,KAAK2zE,EAAad,QAAQx1E,QAE9B,CACL,MAAMu2E,EAAcD,EAAahrE,MAAM,KACvC,IAAK,IAAItL,EAAI,EAAGA,EAAIu2E,EAAYt2E,OAAQD,IAClCu2E,EAAYv2E,GAAGC,OAAS,GAC1Bm2E,EAAOzzE,KAAK4zE,EAAYv2E,GAG7B,CAED,OAAO,IAAIq1E,GAAKe,EAAQ,EAC1B,CAKM,SAAUI,GAAYnsD,GAC1B,OAAOA,EAAKqrD,WAAarrD,EAAKmrD,QAAQv1E,MACxC,CAKgB,SAAAw2E,GAAgBC,EAAiBC,GAC/C,MAAMC,EAAQhB,GAAac,GACzBG,EAAQjB,GAAae,GACvB,GAAc,OAAVC,EACF,OAAOD,EACF,GAAIC,IAAUC,EACnB,OAAOJ,GAAgBX,GAAaY,GAAYZ,GAAaa,IAE7D,MAAM,IAAIh3E,MACR,8BACEg3E,EADF,8BAIED,EACA,IAGR,CAKgB,SAAAI,GAAYt9B,EAAYu9B,GACtC,MAAMC,EAAWf,GAAUz8B,EAAM,GAC3By9B,EAAYhB,GAAUc,EAAO,GACnC,IAAK,IAAI/2E,EAAI,EAAGA,EAAIg3E,EAAS/2E,QAAUD,EAAIi3E,EAAUh3E,OAAQD,IAAK,CAChE,MAAMk3E,EAAMtZ,EAAYoZ,EAASh3E,GAAIi3E,EAAUj3E,IAC/C,GAAY,IAARk3E,EACF,OAAOA,CAEV,CACD,OAAIF,EAAS/2E,SAAWg3E,EAAUh3E,OACzB,EAEF+2E,EAAS/2E,OAASg3E,EAAUh3E,QAAU,EAAI,CACnD,CAKgB,SAAAk3E,GAAW9sD,EAAY+sD,GACrC,GAAIvB,GAAcxrD,KAAUwrD,GAAcuB,GACxC,OAAO,EAGT,IACE,IAAIp3E,EAAIqqB,EAAKqrD,UAAW/mE,EAAIyoE,EAAM1B,UAClC11E,GAAKqqB,EAAKmrD,QAAQv1E,OAClBD,IAAK2O,IAEL,GAAI0b,EAAKmrD,QAAQx1E,KAAOo3E,EAAM5B,QAAQ7mE,GACpC,OAAO,EAIX,OAAO,CACT,CAKgB,SAAA0oE,GAAahtD,EAAY+sD,GACvC,IAAIp3E,EAAIqqB,EAAKqrD,UACT/mE,EAAIyoE,EAAM1B,UACd,GAAIG,GAAcxrD,GAAQwrD,GAAcuB,GACtC,OAAO,EAET,MAAOp3E,EAAIqqB,EAAKmrD,QAAQv1E,OAAQ,CAC9B,GAAIoqB,EAAKmrD,QAAQx1E,KAAOo3E,EAAM5B,QAAQ7mE,GACpC,OAAO,IAEP3O,IACA2O,CACH,CACD,OAAO,CACT,CAWG,MACU2oE,GASXj0E,WAAAA,CAAYgnB,EAAmBktD,GAAA,KAAYA,aAAZA,EAC7Bj2E,KAAKk2E,OAASvB,GAAU5rD,EAAM,GAE9B/oB,KAAKm2E,YAAcvxC,KAAKoO,IAAI,EAAGhzC,KAAKk2E,OAAOv3E,QAE3C,IAAK,IAAID,EAAI,EAAGA,EAAIsB,KAAKk2E,OAAOv3E,OAAQD,IACtCsB,KAAKm2E,cAAevoE,EAAAA,EAAAA,IAAa5N,KAAKk2E,OAAOx3E,IAE/C03E,GAAyBp2E,KAAM,EAInB,SAAAq2E,GACdC,EACAjqD,GAGIiqD,EAAeJ,OAAOv3E,OAAS,IACjC23E,EAAeH,aAAe,GAEhCG,EAAeJ,OAAO70E,KAAKgrB,GAC3BiqD,EAAeH,cAAevoE,EAAAA,EAAAA,IAAaye,GAC3C+pD,GAAyBE,EAC3B,CAEM,SAAUC,GAAkBD,GAChC,MAAMrnE,EAAOqnE,EAAeJ,OAAOhnE,MACnConE,EAAeH,cAAevoE,EAAAA,EAAAA,IAAaqB,GAEvCqnE,EAAeJ,OAAOv3E,OAAS,IACjC23E,EAAeH,aAAe,EAElC,CAEA,SAASC,GAAyBE,GAChC,GAAIA,EAAeH,YAAcrC,GAC/B,MAAM,IAAIz1E,MACRi4E,EAAeL,aACb,8BACAnC,GACA,WACAwC,EAAeH,YACf,MAGN,GAAIG,EAAeJ,OAAOv3E,OAASk1E,GACjC,MAAM,IAAIx1E,MACRi4E,EAAeL,aACb,iEACApC,GACA,gCACA2C,GAA4BF,GAGpC,CAKM,SAAUE,GACdF,GAEA,OAAqC,IAAjCA,EAAeJ,OAAOv3E,OACjB,GAEF,gBAAkB23E,EAAeJ,OAAO12E,KAAK,KAAO,GAC7D;;;;;;;;;;;;;;;;GCxTM,MAAOi3E,WAA0BzD,GAOrCjxE,WAAAA,GAEE,IAAI20E,EACAC,EAFJ/tE,MAAM,CAAC,YAIe,qBAAbzE,UAC8B,qBAA9BA,SAASkuC,mBAEkB,qBAAvBluC,SAAS,WAElBwyE,EAAmB,mBACnBD,EAAS,UACiC,qBAA1BvyE,SAAS,cACzBwyE,EAAmB,sBACnBD,EAAS,aACgC,qBAAzBvyE,SAAS,aACzBwyE,EAAmB,qBACnBD,EAAS,YACoC,qBAA7BvyE,SAAS,kBACzBwyE,EAAmB,yBACnBD,EAAS,iBAQb12E,KAAK42E,UAAW,EAEZD,GACFxyE,SAASkuC,iBACPskC,GACA,KACE,MAAME,GAAW1yE,SAASuyE,GACtBG,IAAY72E,KAAK42E,WACnB52E,KAAK42E,SAAWC,EAChB72E,KAAKwP,QAAQ,UAAWqnE,GACzB,IAEH,EAEH,CA9CH,kBAAOlD,GACL,OAAO,IAAI8C,EAAoB,CAgDjClD,eAAAA,CAAgBJ,GAEd,OADAl1E,EAAAA,EAAAA,IAAqB,YAAdk1E,EAAyB,uBAAyBA,GAClD,CAACnzE,KAAK42E,SAAU;;;;;;;;;;;;;;;;GCjC3B,MAAME,GAAsB,IACtBC,GAA8B,IAC9BC,GAAiC,IACjCC,GAA6B,IAC7BC,GAAgC,IAChCC,GAA+B,cAG/BC,GAA0B,EAoC1B,MAAOC,WAA6BjF,GAwDxCrwE,WAAAA,CACU2sE,EACAC,EACA2I,EAMAC,EACAC,EACAC,EACAC,EACAC,GAIR,GAFA/uE,QAdQ,KAAS8lE,UAATA,EACA,KAAcC,eAAdA,EACA,KAAa2I,cAAbA,EAMA,KAAgBC,iBAAhBA,EACA,KAAmBC,oBAAnBA,EACA,KAAkBC,mBAAlBA,EACA,KAAsBC,uBAAtBA,EACA,KAAaC,cAAbA,EAnEV,KAAA/5D,GAAKy5D,GAAqBO,8BAClB,KAAItS,KAAG/J,EAAW,KAAOv7D,KAAK4d,GAAK,KAEnC,KAAiBi6D,kBAAkC,CAAC,EAC3C,KAAAC,QAGb,IAAI1lE,IACA,KAAgB2lE,iBAAqB,GACrC,KAAgBC,iBAAqB,GACrC,KAAoBC,qBAAG,EACvB,KAAoBC,qBAAG,EACvB,KAAyBC,0BAA0B,GACnD,KAAUC,YAAG,EACb,KAAeC,gBAAGvB,GAClB,KAAkBwB,mBAAGvB,GACrB,KAAsBwB,uBAAiC,KAC/D,KAAarT,cAAkB,KAEvB,KAAyBsT,0BAAkB,KAE3C,KAAQ5B,UAAY,EAGpB,KAAc6B,eAA0C,CAAC,EACzD,KAAcC,eAAG,EAEjB,KAASC,UAGN,KAEH,KAAU9J,WAAkB,KAC5B,KAAcD,eAAkB,KAChC,KAAkBgK,oBAAG,EACrB,KAAsBC,uBAAG,EACzB,KAA0BC,2BAAG,EAE7B,KAAgBC,kBAAG,EACnB,KAA0BC,2BAAkB,KAC5C,KAA8BC,+BAAkB,KA+BlDtB,KAAkBjwE,EAAAA,EAAAA,MACpB,MAAM,IAAIrJ,MACR,kFAIJo4E,GAAkB9C,cAAc/kE,GAAG,UAAW5O,KAAKk5E,WAAYl5E,OAEpB,IAAvC0uE,EAAU3pE,KAAK2Z,QAAQ,YACzB+0D,GAAcE,cAAc/kE,GAAG,SAAU5O,KAAKm5E,UAAWn5E,KAC1D,CAGOwwE,WAAAA,CACR4I,EACAhmC,EACAimC,GAEA,MAAMC,IAAct5E,KAAK04E,eAEnBhI,EAAM,CAAE11D,EAAGs+D,EAAWzuE,EAAGuuE,EAAQtuE,EAAGsoC,GAC1CpzC,KAAKslE,MAAKl+D,EAAAA,EAAAA,GAAUspE,KACpBzyE,EAAAA,EAAAA,IACE+B,KAAKo4E,WACL,0DAEFp4E,KAAK24E,UAAUnI,YAAYE,GACvB2I,IACFr5E,KAAKy4E,eAAea,GAAaD,EAClC,CAGHroE,GAAAA,CAAIqtD,GACFr+D,KAAKu5E,kBAEL,MAAMviB,EAAW,IAAIzxD,EAAAA,GACfyC,EAAU,CACdvJ,EAAG4/D,EAAME,MAAM3iC,WACf49C,EAAGnb,EAAMob,cAELC,EAAiB,CACrBN,OAAQ,IACRpxE,UACAsqE,WAAan0E,IACX,MAAMuI,EAAUvI,EAAQ,KACH,OAAjBA,EAAQ,KACV64D,EAASvxD,QAAQiB,GAEjBswD,EAASxxD,OAAOkB,EACjB,GAGL1G,KAAKg4E,iBAAiB32E,KAAKq4E,GAC3B15E,KAAKk4E,uBACL,MAAM3pE,EAAQvO,KAAKg4E,iBAAiBr5E,OAAS,EAM7C,OAJIqB,KAAKo4E,YACPp4E,KAAK25E,SAASprE,GAGTyoD,EAAStxD,OAAQ,CAG1Bk0E,MAAAA,CACEvb,EACAwb,EACAhsC,EACAykC,GAEAtyE,KAAKu5E,kBAEL,MAAMO,EAAUzb,EAAM0b,iBAChB1H,EAAahU,EAAME,MAAM3iC,WAC/B57B,KAAKslE,KAAK,qBAAuB+M,EAAa,IAAMyH,GAC/C95E,KAAK83E,QAAQ7iE,IAAIo9D,IACpBryE,KAAK83E,QAAQlmE,IAAIygE,EAAY,IAAIjgE,MAEnCnU,EAAAA,EAAAA,IACEogE,EAAM2b,aAAaC,cAAgB5b,EAAM2b,aAAaE,eACtD,uDAEFj8E,EAAAA,EAAAA,KACG+B,KAAK83E,QAAQ9mE,IAAIqhE,GAAap9D,IAAI6kE,GACnC,gDAEF,MAAMK,EAAyB,CAC7B7H,aACA8H,OAAQP,EACRxb,QACAxwB,OAEF7tC,KAAK83E,QAAQ9mE,IAAIqhE,GAAazgE,IAAIkoE,EAASK,GAEvCn6E,KAAKo4E,YACPp4E,KAAKq6E,YAAYF,EAClB,CAGKR,QAAAA,CAASprE,GACf,MAAMyC,EAAMhR,KAAKg4E,iBAAiBzpE,GAClCvO,KAAKwwE,YAAY,IAAKx/D,EAAIhJ,SAAU7J,WAC3B6B,KAAKg4E,iBAAiBzpE,GAC7BvO,KAAKk4E,uBAC6B,IAA9Bl4E,KAAKk4E,uBACPl4E,KAAKg4E,iBAAmB,IAEtBhnE,EAAIshE,YACNthE,EAAIshE,WAAWn0E,EAChB,GACA,CAGGk8E,WAAAA,CAAYF,GAClB,MAAM9b,EAAQ8b,EAAW9b,MACnBgU,EAAahU,EAAME,MAAM3iC,WACzBk+C,EAAUzb,EAAM0b,iBACtB/5E,KAAKslE,KAAK,aAAe+M,EAAa,QAAUyH,GAChD,MAAMQ,EAAgC,CAAW77E,EAAG4zE,GAE9C+G,EAAS,IAGXe,EAAWtsC,MACbysC,EAAI,KAAOjc,EAAMob,aACjBa,EAAI,KAAOH,EAAWtsC,KAGxBysC,EAAa,KAAOH,EAAWC,SAE/Bp6E,KAAKwwE,YAAY4I,EAAQkB,GAAMn8E,IAC7B,MAAMuI,EAAmBvI,EAAiB,KACpCo8E,EAASp8E,EAAmB,KAGlCk5E,GAAqBmD,sBAAsB9zE,EAAS23D,GAEpD,MAAMoc,EACJz6E,KAAK83E,QAAQ9mE,IAAIqhE,IACjBryE,KAAK83E,QAAQ9mE,IAAIqhE,GAAarhE,IAAI8oE,GAEhCW,IAAsBN,IACxBn6E,KAAKslE,KAAK,kBAAmBnnE,GAEd,OAAXo8E,GACFv6E,KAAK06E,cAAcrI,EAAYyH,GAG7BK,EAAW7H,YACb6H,EAAW7H,WAAWiI,EAAQ7zE,GAEjC,GACA,CAGG,4BAAO8zE,CAAsB9zE,EAAkB23D,GACrD,GAAI33D,GAA8B,kBAAZA,IAAwByD,EAAAA,EAAAA,IAASzD,EAAS,KAAM,CAEpE,MAAMi0E,GAAWrwE,EAAAA,EAAAA,IAAQ5D,EAAgB,KACzC,GAAInG,MAAMC,QAAQm6E,KAAcA,EAASj8D,QAAQ,YAAa,CAC5D,MAAMk8D,EACJ,gBAAkBvc,EAAM2b,aAAaa,WAAWj/C,WAAa,IACzDk/C,EAAYzc,EAAME,MAAM3iC,WAC9B62B,EAEI,wGAA2CmoB,QACxCE,mDAER,CACF,EAGHrI,gBAAAA,CAAiBzsE,GACfhG,KAAK6uE,WAAa7oE,EAClBhG,KAAKslE,KAAK,wBACNtlE,KAAK6uE,WACP7uE,KAAK+6E,UAID/6E,KAAKo4E,YACPp4E,KAAKwwE,YAAY,SAAU,CAAC,GAAG,SAInCxwE,KAAKg7E,uCAAuCh1E,EAAO,CAG7Cg1E,sCAAAA,CAAuCC,GAG7C,MAAMC,EAAmBD,GAAoC,KAAtBA,EAAWt8E,QAC9Cu8E,IAAoBhxE,EAAAA,EAAAA,IAAQ+wE,MAC9Bj7E,KAAKslE,KACH,iEAEFtlE,KAAKs4E,mBAAqBtB,GAC3B,CAGHtE,oBAAAA,CAAqB1sE,GACnBhG,KAAK4uE,eAAiB5oE,EACtBhG,KAAKslE,KAAK,6BACNtlE,KAAK4uE,eACP5uE,KAAKm7E,cAKDn7E,KAAKo4E,YACPp4E,KAAKwwE,YAAY,WAAY,CAAC,GAAG,QAEpC,CAOHuK,OAAAA,GACE,GAAI/6E,KAAKo4E,YAAcp4E,KAAK6uE,WAAY,CACtC,MAAM7oE,EAAQhG,KAAK6uE,WACbuM,GAAanxE,EAAAA,EAAAA,IAAcjE,GAAS,OAAS,QAC7Cq1E,EAAwC,CAAEC,KAAMt1E,GAC3B,OAAvBhG,KAAK23E,cACP0D,EAAY,WAAY,EACe,kBAAvBr7E,KAAK23E,gBACrB0D,EAAY,WAAar7E,KAAK23E,eAEhC33E,KAAKwwE,YACH4K,EACAC,GACC1wE,IACC,MAAM4vE,EAAS5vE,EAAe,KACxBtB,EAAQsB,EAAa,MAAmB,QAE1C3K,KAAK6uE,aAAe7oE,IACP,OAAXu0E,EACFv6E,KAAK64E,uBAAyB,EAG9B74E,KAAKu7E,eAAehB,EAAQlxE,GAE/B,GAGN,EAQH8xE,WAAAA,GACMn7E,KAAKo4E,YAAcp4E,KAAK4uE,gBAC1B5uE,KAAKwwE,YACH,WACA,CAAE,MAASxwE,KAAK4uE,iBACfjkE,IACC,MAAM4vE,EAAS5vE,EAAe,KACxBtB,EAAQsB,EAAa,MAAmB,QAC/B,OAAX4vE,EACFv6E,KAAK84E,2BAA6B,EAElC94E,KAAKw7E,mBAAmBjB,EAAQlxE,EACjC,GAGN,CAMHsiD,QAAAA,CAAS0S,EAAqBxwB,GAC5B,MAAMwkC,EAAahU,EAAME,MAAM3iC,WACzBk+C,EAAUzb,EAAM0b,iBAEtB/5E,KAAKslE,KAAK,uBAAyB+M,EAAa,IAAMyH,IAEtD77E,EAAAA,EAAAA,IACEogE,EAAM2b,aAAaC,cAAgB5b,EAAM2b,aAAaE,eACtD,wDAEF,MAAMN,EAAS55E,KAAK06E,cAAcrI,EAAYyH,GAC1CF,GAAU55E,KAAKo4E,YACjBp4E,KAAKy7E,cAAcpJ,EAAYyH,EAASzb,EAAMob,aAAc5rC,EAC7D,CAGK4tC,aAAAA,CACNpJ,EACAyH,EACA4B,EACA7tC,GAEA7tC,KAAKslE,KAAK,eAAiB+M,EAAa,QAAUyH,GAElD,MAAMQ,EAAgC,CAAW77E,EAAG4zE,GAC9C+G,EAAS,IAEXvrC,IACFysC,EAAI,KAAOoB,EACXpB,EAAI,KAAOzsC,GAGb7tC,KAAKwwE,YAAY4I,EAAQkB,EAAK,CAGhC3H,eAAAA,CACEN,EACAhpE,EACAipE,GAEAtyE,KAAKu5E,kBAEDv5E,KAAKo4E,WACPp4E,KAAK27E,kBAAkB,IAAKtJ,EAAYhpE,EAAMipE,GAE9CtyE,KAAKm4E,0BAA0B92E,KAAK,CAClCgxE,aACA+G,OAAQ,IACR/vE,OACAipE,cAEH,CAGHM,iBAAAA,CACEP,EACAhpE,EACAipE,GAEAtyE,KAAKu5E,kBAEDv5E,KAAKo4E,WACPp4E,KAAK27E,kBAAkB,KAAMtJ,EAAYhpE,EAAMipE,GAE/CtyE,KAAKm4E,0BAA0B92E,KAAK,CAClCgxE,aACA+G,OAAQ,KACR/vE,OACAipE,cAEH,CAGHO,kBAAAA,CACER,EACAC,GAEAtyE,KAAKu5E,kBAEDv5E,KAAKo4E,WACPp4E,KAAK27E,kBAAkB,KAAMtJ,EAAY,KAAMC,GAE/CtyE,KAAKm4E,0BAA0B92E,KAAK,CAClCgxE,aACA+G,OAAQ,KACR/vE,KAAM,KACNipE,cAEH,CAGKqJ,iBAAAA,CACNvC,EACA/G,EACAhpE,EACAipE,GAEA,MAAMtqE,EAAU,CAAWvJ,EAAG4zE,EAAqBvlE,EAAGzD,GACtDrJ,KAAKslE,KAAK,gBAAkB8T,EAAQpxE,GACpChI,KAAKwwE,YAAY4I,EAAQpxE,GAAU4zE,IAC7BtJ,GACFzgC,YAAW,KACTygC,EACEsJ,EAAoB,KACpBA,EAAoB,KACrB,GACAh3C,KAAKihB,MAAM,GACf,GACA,CAGLyN,GAAAA,CACE+e,EACAhpE,EACAipE,EACAC,GAEAvyE,KAAK67E,YAAY,IAAKxJ,EAAYhpE,EAAMipE,EAAYC,EAAM,CAG5DC,KAAAA,CACEH,EACAhpE,EACAipE,EACAC,GAEAvyE,KAAK67E,YAAY,IAAKxJ,EAAYhpE,EAAMipE,EAAYC,EAAM,CAG5DsJ,WAAAA,CACEzC,EACA/G,EACAhpE,EACAipE,EACAC,GAEAvyE,KAAKu5E,kBAEL,MAAMvxE,EAAoC,CAC/BvJ,EAAG4zE,EACHvlE,EAAGzD,QAGDzG,IAAT2vE,IACFvqE,EAAiB,KAAOuqE,GAI1BvyE,KAAK+3E,iBAAiB12E,KAAK,CACzB+3E,SACApxE,UACAsqE,eAGFtyE,KAAKi4E,uBACL,MAAM1pE,EAAQvO,KAAK+3E,iBAAiBp5E,OAAS,EAEzCqB,KAAKo4E,WACPp4E,KAAK87E,SAASvtE,GAEdvO,KAAKslE,KAAK,kBAAoB+M,EAC/B,CAGKyJ,QAAAA,CAASvtE,GACf,MAAM6qE,EAASp5E,KAAK+3E,iBAAiBxpE,GAAO6qE,OACtCpxE,EAAUhI,KAAK+3E,iBAAiBxpE,GAAOvG,QACvCsqE,EAAatyE,KAAK+3E,iBAAiBxpE,GAAO+jE,WAChDtyE,KAAK+3E,iBAAiBxpE,GAAOwtE,OAAS/7E,KAAKo4E,WAE3Cp4E,KAAKwwE,YAAY4I,EAAQpxE,GAAU7J,IACjC6B,KAAKslE,KAAK8T,EAAS,YAAaj7E,UAEzB6B,KAAK+3E,iBAAiBxpE,GAC7BvO,KAAKi4E,uBAG6B,IAA9Bj4E,KAAKi4E,uBACPj4E,KAAK+3E,iBAAmB,IAGtBzF,GACFA,EACEn0E,EAAmB,KACnBA,EAAmB,KAEtB,GACA,CAGL20E,WAAAA,CAAYC,GAEV,GAAI/yE,KAAKo4E,WAAY,CACnB,MAAMpwE,EAAU,CAAepJ,EAAGm0E,GAClC/yE,KAAKslE,KAAK,cAAet9D,GAEzBhI,KAAKwwE,YAAsB,IAAKxoE,GAASG,IACvC,MAAMoyE,EAASpyE,EAAkB,KACjC,GAAe,OAAXoyE,EAAiB,CACnB,MAAMyB,EAAc7zE,EAAkB,KACtCnI,KAAKslE,KAAK,cAAe,wBAA0B0W,EACpD,IAEJ,EAGK1K,cAAAA,CAAenzE,GACrB,GAAI,MAAOA,EAAS,CAElB6B,KAAKslE,KAAK,iBAAkBl+D,EAAAA,EAAAA,GAAUjJ,IACtC,MAAM89E,EAAS99E,EAAQ,KACjBk7E,EAAar5E,KAAKy4E,eAAewD,GACnC5C,WACKr5E,KAAKy4E,eAAewD,GAC3B5C,EAAWl7E,EAAiB,MAE/B,KAAM,IAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAQ,SAC5C,MAAOA,GAEhB6B,KAAKk8E,YAAY/9E,EAAQ,KAAgBA,EAAQ,KAClD,EAGK+9E,WAAAA,CAAY9C,EAAgBhmC,GAClCpzC,KAAKslE,KAAK,sBAAuB8T,EAAQhmC,GAC1B,MAAXgmC,EACFp5E,KAAKs3E,cACHlkC,EAAc,KACdA,EAAc,MACF,EACZA,EAAK,MAEa,MAAXgmC,EACTp5E,KAAKs3E,cACHlkC,EAAc,KACdA,EAAc,MACD,EACbA,EAAK,MAEa,MAAXgmC,EACTp5E,KAAKm8E,iBACH/oC,EAAc,KACdA,EAAe,MAEG,OAAXgmC,EACTp5E,KAAKu7E,eACHnoC,EAAqB,KACrBA,EAAuB,MAEL,QAAXgmC,EACTp5E,KAAKw7E,mBACHpoC,EAAqB,KACrBA,EAAuB,MAEL,OAAXgmC,EACTp5E,KAAKo8E,uBAAuBhpC,GAE5B5wC,EACE,8CACE4E,EAAAA,EAAAA,GAAUgyE,GACV,qCAEL,CAGKtK,QAAAA,CAASgD,EAAmBC,GAClC/xE,KAAKslE,KAAK,oBACVtlE,KAAKo4E,YAAa,EAClBp4E,KAAKi5E,gCAAiC,IAAIj2E,MAAOE,UACjDlD,KAAKq8E,iBAAiBvK,GACtB9xE,KAAKklE,cAAgB6M,EACjB/xE,KAAK+4E,kBACP/4E,KAAKs8E,oBAEPt8E,KAAKu8E,gBACLv8E,KAAK+4E,kBAAmB,EACxB/4E,KAAKu3E,kBAAiB,EAAM,CAGtBiF,gBAAAA,CAAiB1qC,IACvB7zC,EAAAA,EAAAA,KACG+B,KAAK24E,UACN,0DAGE34E,KAAKw4E,2BACP/R,aAAazmE,KAAKw4E,2BAMpBx4E,KAAKw4E,0BAA4B3mC,YAAW,KAC1C7xC,KAAKw4E,0BAA4B,KACjCx4E,KAAKy8E,sBAAsB,GAE1B73C,KAAKihB,MAAM/T,GAAiB,CAGzBynC,eAAAA,IACDv5E,KAAK24E,WAAa34E,KAAK+4E,kBAC1B/4E,KAAKw8E,iBAAiB,EACvB,CAGKtD,UAAAA,CAAWrC,GAGfA,IACC72E,KAAK42E,UACN52E,KAAKq4E,kBAAoBr4E,KAAKs4E,qBAE9Bt4E,KAAKslE,KAAK,2CACVtlE,KAAKq4E,gBAAkBvB,GAElB92E,KAAK24E,WACR34E,KAAKw8E,iBAAiB,IAG1Bx8E,KAAK42E,SAAWC,CAAQ,CAGlBsC,SAAAA,CAAUuD,GACZA,GACF18E,KAAKslE,KAAK,wBACVtlE,KAAKq4E,gBAAkBvB,GAClB92E,KAAK24E,WACR34E,KAAKw8E,iBAAiB,KAGxBx8E,KAAKslE,KAAK,8CACNtlE,KAAK24E,WACP34E,KAAK24E,UAAUvwE,QAElB,CAGKu0E,qBAAAA,GAWN,GAVA38E,KAAKslE,KAAK,4BACVtlE,KAAKo4E,YAAa,EAClBp4E,KAAK24E,UAAY,KAGjB34E,KAAK48E,0BAGL58E,KAAKy4E,eAAiB,CAAC,EAEnBz4E,KAAK68E,mBAAoB,CAC3B,GAAK78E,KAAK42E,UAIH,GAAI52E,KAAKi5E,+BAAgC,CAE9C,MAAM6D,GACJ,IAAI95E,MAAOE,UAAYlD,KAAKi5E,+BAC1B6D,EAAgC5F,KAClCl3E,KAAKq4E,gBAAkBvB,IAEzB92E,KAAKi5E,+BAAiC,IACvC,OAXCj5E,KAAKslE,KAAK,8CACVtlE,KAAKq4E,gBAAkBr4E,KAAKs4E,mBAC5Bt4E,KAAKg5E,4BAA6B,IAAIh2E,MAAOE,UAW/C,MAAM65E,GACJ,IAAI/5E,MAAOE,UAAYlD,KAAKg5E,2BAC9B,IAAIgE,EAAiBp4C,KAAKoO,IACxB,EACAhzC,KAAKq4E,gBAAkB0E,GAEzBC,EAAiBp4C,KAAK6jB,SAAWu0B,EAEjCh9E,KAAKslE,KAAK,0BAA4B0X,EAAiB,MACvDh9E,KAAKw8E,iBAAiBQ,GAGtBh9E,KAAKq4E,gBAAkBzzC,KAAKC,IAC1B7kC,KAAKs4E,mBACLt4E,KAAKq4E,gBAAkBpB,GAE1B,CACDj3E,KAAKu3E,kBAAiB,EAAO,CAGvB,0BAAMkF,GACZ,GAAIz8E,KAAK68E,mBAAoB,CAC3B78E,KAAKslE,KAAK,+BACVtlE,KAAKg5E,4BAA6B,IAAIh2E,MAAOE,UAC7ClD,KAAKi5E,+BAAiC,KACtC,MAAMgE,EAAgBj9E,KAAKsxE,eAAe5zD,KAAK1d,MACzCk9E,EAAUl9E,KAAK8uE,SAASpxD,KAAK1d,MAC7B0lE,EAAe1lE,KAAK28E,sBAAsBj/D,KAAK1d,MAC/C6kE,EAAS7kE,KAAK4d,GAAK,IAAMy5D,GAAqB8F,oBAC9CjY,EAAgBllE,KAAKklE,cAC3B,IAAIkY,GAAW,EACXC,EAAgC,KACpC,MAAMC,EAAU,WACVD,EACFA,EAAWj1E,SAEXg1E,GAAW,EACX1X,IAEJ,EACM6X,EAAgB,SAAU7M,IAC9BzyE,EAAAA,EAAAA,IACEo/E,EACA,0DAEFA,EAAW7M,YAAYE,EACzB,EAEA1wE,KAAK24E,UAAY,CACfvwE,MAAOk1E,EACP9M,YAAa+M,GAGf,MAAMhe,EAAev/D,KAAK44E,mBAC1B54E,KAAK44E,oBAAqB,EAE1B,IAGE,MAAO5T,EAAWD,SAAuBp/D,QAAQ++C,IAAI,CACnD1kD,KAAKy3E,mBAAmBnY,SAASC,GACjCv/D,KAAK03E,uBAAuBpY,SAASC,KAGlC6d,EAoBHzjB,EAAI,0CAnBJA,EAAI,8CACJ35D,KAAK6uE,WAAa7J,GAAaA,EAAU1E,YACzCtgE,KAAK4uE,eAAiB7J,GAAiBA,EAAc/+D,MACrDq3E,EAAa,IAAI5O,GACf5J,EACA7kE,KAAK0uE,UACL1uE,KAAK2uE,eACL3uE,KAAK4uE,eACL5uE,KAAK6uE,WACLoO,EACAC,EACAxX,GACcpH,IACZ7L,EAAK6L,EAAS,KAAOt+D,KAAK0uE,UAAU9yC,WAAa,KACjD57B,KAAKw9E,UAAUrG,GAA6B,GAE9CjS,GAKL,CAAC,MAAO1iE,GACPxC,KAAKslE,KAAK,wBAA0B9iE,GAC/B46E,IACCp9E,KAAK0uE,UAAUpN,WAIjB7O,EAAKjwD,GAEP86E,IAEH,CACF,EAGHE,SAAAA,CAAUlf,GACR3E,EAAI,uCAAyC2E,GAC7Ct+D,KAAK63E,kBAAkBvZ,IAAU,EAC7Bt+D,KAAK24E,UACP34E,KAAK24E,UAAUvwE,SAEXpI,KAAKw4E,4BACP/R,aAAazmE,KAAKw4E,2BAClBx4E,KAAKw4E,0BAA4B,MAE/Bx4E,KAAKo4E,YACPp4E,KAAK28E,wBAER,CAGHc,MAAAA,CAAOnf,GACL3E,EAAI,mCAAqC2E,UAClCt+D,KAAK63E,kBAAkBvZ,IAC1B/zD,EAAAA,EAAAA,IAAQvK,KAAK63E,qBACf73E,KAAKq4E,gBAAkBvB,GAClB92E,KAAK24E,WACR34E,KAAKw8E,iBAAiB,GAEzB,CAGKH,gBAAAA,CAAiBvK,GACvB,MAAM4L,EAAQ5L,GAAY,IAAI9uE,MAAOE,UACrClD,KAAKw3E,oBAAoB,CAAEmG,iBAAkBD,GAAS,CAGhDd,uBAAAA,GACN,IAAK,IAAIl+E,EAAI,EAAGA,EAAIsB,KAAK+3E,iBAAiBp5E,OAAQD,IAAK,CACrD,MAAM40D,EAAMtzD,KAAK+3E,iBAAiBr5E,GAC9B40D,GAAgB,MAAOA,EAAItrD,SAAWsrD,EAAIyoB,SACxCzoB,EAAIgf,YACNhf,EAAIgf,WAAW,qBAGVtyE,KAAK+3E,iBAAiBr5E,GAC7BsB,KAAKi4E,uBAER,CAGiC,IAA9Bj4E,KAAKi4E,uBACPj4E,KAAK+3E,iBAAmB,GACzB,CAGKoE,gBAAAA,CAAiB9J,EAAoBhU,GAE3C,IAAIyb,EAIFA,EAHGzb,EAGOA,EAAM7zD,KAAIgvE,GAAK5c,EAAkB4c,KAAIh6E,KAAK,KAF1C,UAIZ,MAAMo6E,EAAS55E,KAAK06E,cAAcrI,EAAYyH,GAC1CF,GAAUA,EAAOtH,YACnBsH,EAAOtH,WAAW,oBACnB,CAGKoI,aAAAA,CAAcrI,EAAoByH,GACxC,MAAM8D,EAAuB,IAAI7J,GAAK1B,GAAYz2C,WAClD,IAAIg+C,EACJ,GAAI55E,KAAK83E,QAAQ7iE,IAAI2oE,GAAuB,CAC1C,MAAMpzE,EAAMxK,KAAK83E,QAAQ9mE,IAAI4sE,GAC7BhE,EAASpvE,EAAIwG,IAAI8oE,GACjBtvE,EAAIyG,OAAO6oE,GACM,IAAbtvE,EAAI0G,MACNlR,KAAK83E,QAAQ7mE,OAAO2sE,EAEvB,MAEChE,OAASh3E,EAEX,OAAOg3E,CAAO,CAGR2B,cAAAA,CAAesC,EAAoBC,GACzCnkB,EAAI,uBAAyBkkB,EAAa,IAAMC,GAChD99E,KAAK6uE,WAAa,KAClB7uE,KAAK44E,oBAAqB,EAC1B54E,KAAK24E,UAAUvwE,QACI,kBAAfy1E,GAAiD,sBAAfA,IAIpC79E,KAAK64E,yBACD74E,KAAK64E,wBAA0BzB,KAEjCp3E,KAAKq4E,gBAAkBrB,GAIvBh3E,KAAKy3E,mBAAmB9X,yBAE3B,CAGK6b,kBAAAA,CAAmBqC,EAAoBC,GAC7CnkB,EAAI,4BAA8BkkB,EAAa,IAAMC,GACrD99E,KAAK4uE,eAAiB,KACtB5uE,KAAK44E,oBAAqB,EAGP,kBAAfiF,GAAiD,sBAAfA,IAIpC79E,KAAK84E,6BACD94E,KAAK84E,4BAA8B1B,IACrCp3E,KAAK03E,uBAAuB/X,wBAE/B,CAGKyc,sBAAAA,CAAuBhpC,GACzBpzC,KAAKu4E,uBACPv4E,KAAKu4E,uBAAuBnlC,GAExB,QAASA,GACX7wC,QAAQo3D,IACN,aAAgBvmB,EAAK,OAAkBhxC,QAAQ,KAAM,gBAG1D,CAGKm6E,aAAAA,GAENv8E,KAAK+6E,UACL/6E,KAAKm7E,cAIL,IAAK,MAAM4C,KAAW/9E,KAAK83E,QAAQ/kE,SACjC,IAAK,MAAMonE,KAAc4D,EAAQhrE,SAC/B/S,KAAKq6E,YAAYF,GAIrB,IAAK,IAAIz7E,EAAI,EAAGA,EAAIsB,KAAK+3E,iBAAiBp5E,OAAQD,IAC5CsB,KAAK+3E,iBAAiBr5E,IACxBsB,KAAK87E,SAASp9E,GAIlB,MAAOsB,KAAKm4E,0BAA0Bx5E,OAAQ,CAC5C,MAAMqJ,EAAUhI,KAAKm4E,0BAA0B1mE,QAC/CzR,KAAK27E,kBACH3zE,EAAQoxE,OACRpxE,EAAQqqE,WACRrqE,EAAQqB,KACRrB,EAAQsqE,WAEX,CAED,IAAK,IAAI5zE,EAAI,EAAGA,EAAIsB,KAAKg4E,iBAAiBr5E,OAAQD,IAC5CsB,KAAKg4E,iBAAiBt5E,IACxBsB,KAAK25E,SAASj7E,EAEjB,CAMK49E,iBAAAA,GACN,MAAMvJ,EAAiC,CAAC,EAExC,IAAIiL,EAAa,MACbt2E,EAAAA,EAAAA,QAEAs2E,EADEh+E,KAAK0uE,UAAUpN,UACJ,aAEA,QAIjByR,EAAM,OAASiL,EAAa,IAAMhgF,EAAYoE,QAAQ,MAAO,MAAQ,GAEjEmF,EAAAA,EAAAA,MACFwrE,EAAM,qBAAuB,GACpBtrE,EAAAA,EAAAA,QACTsrE,EAAM,yBAA2B,GAEnC/yE,KAAK8yE,YAAYC,EAAO,CAGlB8J,gBAAAA,GACN,MAAMH,EAASjJ,GAAcE,cAAcC,kBAC3C,OAAOrpE,EAAAA,EAAAA,IAAQvK,KAAK63E,oBAAsB6E,CAAO,EAn8BpCrF,GAA2BO,4BAAG,EAK9BP,GAAiB8F,kBAAG;;;;;;;;;;;;;;;;;AC1HlC,MAkIUc,GACXl8E,WAAAA,CAAmBC,EAAqBksC,GAArB,KAAIlsC,KAAJA,EAAqB,KAAIksC,KAAJA,CAAI,CAE5C,WAAOgwC,CAAKl8E,EAAcksC,GACxB,OAAO,IAAI+vC,GAAUj8E,EAAMksC,EAAM;;;;;;;;;;;;;;;;GCtIlC,MAMmBiwC,GASpBC,UAAAA,GACE,OAAOp+E,KAAKq+E,QAAQ3gE,KAAK1d,KAAM,CAUjCs+E,mBAAAA,CAAoBC,EAAeC,GACjC,MAAMC,EAAa,IAAIR,GAAU7hB,EAAUmiB,GACrCG,EAAa,IAAIT,GAAU7hB,EAAUoiB,GAC3C,OAAgD,IAAzCx+E,KAAKq+E,QAAQI,EAAYC,EAAkB,CAOpDC,OAAAA,GAEE,OAAQV,GAAkBW,GAAI;;;;;;;;;;;;;;;;GC5BlC,IAAIC,GAEE,MAAOC,WAAiBX,GAC5B,uBAAWU,GACT,OAAOA,EAAa,CAGtB,uBAAWA,CAAa9oD,GACtB8oD,GAAe9oD,CAAI,CAErBsoD,OAAAA,CAAQxzE,EAAcC,GACpB,OAAOwxD,EAAYzxD,EAAE7I,KAAM8I,EAAE9I,KAAM,CAErC+8E,WAAAA,CAAY7wC,GAGV,MAAM9vC,EAAAA,EAAAA,IAAe,kDAAmD,CAE1EkgF,mBAAAA,CAAoBC,EAAeC,GACjC,OAAO,C,CAETG,OAAAA,GAEE,OAAQV,GAAkBW,GAAI,CAEhCI,OAAAA,GAGE,OAAO,IAAIf,GAAU5hB,EAAUwiB,GAAc,CAG/CI,QAAAA,CAASC,EAAoBl9E,GAM3B,OALA/D,EAAAA,EAAAA,IACwB,kBAAfihF,EACP,gDAGK,IAAIjB,GAAUiB,EAAYL,GAAc,CAMjDjjD,QAAAA,GACE,MAAO,MAAO,EAIX,MAAMujD,GAAY,IAAIL;;;;;;;;;;;;;;;;GChC1B,MACUM,GAOXr9E,WAAAA,CACEmsC,EACAmxC,EACAlgE,EACQmgE,EACAC,EAA+C,MAD/C,KAAUD,WAAVA,EACA,KAAgBC,iBAAhBA,EAXF,KAAUC,WAAgD,GAahE,IAAI5J,EAAM,EACV,OAAQ1nC,EAAK3jC,UAQX,GANAqrE,EAAMyJ,EAAWlgE,EAAW+uB,EAAK5qC,IAAK+7E,GAAY,EAE9CC,IACF1J,IAAQ,GAGNA,EAAM,EAGN1nC,EADEluC,KAAKs/E,WACApxC,EAAKgK,KAELhK,EAAKunC,UAET,IAAY,IAARG,EAAW,CAEpB51E,KAAKw/E,WAAWn+E,KAAK6sC,GACrB,KACD,CAECluC,KAAKw/E,WAAWn+E,KAAK6sC,GAEnBA,EADEluC,KAAKs/E,WACApxC,EAAKunC,MAELvnC,EAAKgK,IAEf,CACF,CAGHunC,OAAAA,GACE,GAA+B,IAA3Bz/E,KAAKw/E,WAAW7gF,OAClB,OAAO,KAGT,IACIwJ,EADA+lC,EAAOluC,KAAKw/E,WAAWtwE,MAQ3B,GALE/G,EADEnI,KAAKu/E,iBACEv/E,KAAKu/E,iBAAiBrxC,EAAK5qC,IAAK4qC,EAAKxrC,OAErC,CAAEY,IAAK4qC,EAAK5qC,IAAKZ,MAAOwrC,EAAKxrC,OAGpC1C,KAAKs/E,WAAY,CACnBpxC,EAAOA,EAAKgK,KACZ,OAAQhK,EAAK3jC,UACXvK,KAAKw/E,WAAWn+E,KAAK6sC,GACrBA,EAAOA,EAAKunC,KAEf,KAAM,CACLvnC,EAAOA,EAAKunC,MACZ,OAAQvnC,EAAK3jC,UACXvK,KAAKw/E,WAAWn+E,KAAK6sC,GACrBA,EAAOA,EAAKgK,IAEf,CAED,OAAO/vC,CAAO,CAGhBu3E,OAAAA,GACE,OAAO1/E,KAAKw/E,WAAW7gF,OAAS,CAAE,CAGpCghF,IAAAA,GACE,GAA+B,IAA3B3/E,KAAKw/E,WAAW7gF,OAClB,OAAO,KAGT,MAAMuvC,EAAOluC,KAAKw/E,WAAWx/E,KAAKw/E,WAAW7gF,OAAS,GACtD,OAAIqB,KAAKu/E,iBACAv/E,KAAKu/E,iBAAiBrxC,EAAK5qC,IAAK4qC,EAAKxrC,OAErC,CAAEY,IAAK4qC,EAAK5qC,IAAKZ,MAAOwrC,EAAKxrC,MACrC,EAMF,MACUk9E,GAYX79E,WAAAA,CACSuB,EACAZ,EACPm9E,EACA3nC,EACAu9B,GAJO,KAAGnyE,IAAHA,EACA,KAAKZ,MAALA,EAKP1C,KAAK6/E,MAAiB,MAATA,EAAgBA,EAAQD,GAASE,IAC9C9/E,KAAKk4C,KACK,MAARA,EAAeA,EAAQ6nC,GAAUC,WACnChgF,KAAKy1E,MACM,MAATA,EAAgBA,EAASsK,GAAUC,UAAmC,CAgB1EC,IAAAA,CACE38E,EACAZ,EACAm9E,EACA3nC,EACAu9B,GAEA,OAAO,IAAImK,GACF,MAAPt8E,EAAcA,EAAMtD,KAAKsD,IAChB,MAATZ,EAAgBA,EAAQ1C,KAAK0C,MACpB,MAATm9E,EAAgBA,EAAQ7/E,KAAK6/E,MACrB,MAAR3nC,EAAeA,EAAOl4C,KAAKk4C,KAClB,MAATu9B,EAAgBA,EAAQz1E,KAAKy1E,MAC7B,CAMJyK,KAAAA,GACE,OAAOlgF,KAAKk4C,KAAKgoC,QAAU,EAAIlgF,KAAKy1E,MAAMyK,OAAQ,CAMpD31E,OAAAA,GACE,OAAO,CAAM,CAYf41E,gBAAAA,CAAiB/G,GACf,OACEp5E,KAAKk4C,KAAKioC,iBAAiB/G,MACzBA,EAAOp5E,KAAKsD,IAAKtD,KAAK0C,QACxB1C,KAAKy1E,MAAM0K,iBAAiB/G,EAAO,CAYvCgH,gBAAAA,CAAiBhH,GACf,OACEp5E,KAAKy1E,MAAM2K,iBAAiBhH,IAC5BA,EAAOp5E,KAAKsD,IAAKtD,KAAK0C,QACtB1C,KAAKk4C,KAAKkoC,iBAAiBhH,EAAO,CAO9BiH,IAAAA,GACN,OAAIrgF,KAAKk4C,KAAK3tC,UACLvK,KAECA,KAAKk4C,KAAwBmoC,MACtC,CAMHC,MAAAA,GACE,OAAOtgF,KAAKqgF,OAAO/8E,GAAI,CAMzBi9E,MAAAA,GACE,OAAIvgF,KAAKy1E,MAAMlrE,UACNvK,KAAKsD,IAELtD,KAAKy1E,MAAM8K,QACnB,CASHviD,MAAAA,CAAO16B,EAAQZ,EAAUyc,GACvB,IAAIlS,EAAoBjN,KACxB,MAAM41E,EAAMz2D,EAAW7b,EAAK2J,EAAE3J,KAc9B,OAZE2J,EADE2oE,EAAM,EACJ3oE,EAAEgzE,KAAK,KAAM,KAAM,KAAMhzE,EAAEirC,KAAKla,OAAO16B,EAAKZ,EAAOyc,GAAa,MACnD,IAARy2D,EACL3oE,EAAEgzE,KAAK,KAAMv9E,EAAO,KAAM,KAAM,MAEhCuK,EAAEgzE,KACJ,KACA,KACA,KACA,KACAhzE,EAAEwoE,MAAMz3C,OAAO16B,EAAKZ,EAAOyc,IAGxBlS,EAAEuzE,QAAS,CAMZC,UAAAA,GACN,GAAIzgF,KAAKk4C,KAAK3tC,UACZ,OAAOw1E,GAAUC,WAEnB,IAAI/yE,EAAoBjN,KAKxB,OAJKiN,EAAEirC,KAAKwoC,UAAazzE,EAAEirC,KAAKA,KAAKwoC,WACnCzzE,EAAIA,EAAE0zE,gBAER1zE,EAAIA,EAAEgzE,KAAK,KAAM,KAAM,KAAOhzE,EAAEirC,KAAwBuoC,aAAc,MAC/DxzE,EAAEuzE,QAAS,CAQpB93D,MAAAA,CACEplB,EACA6b,GAEA,IAAIlS,EAAG2zE,EAEP,GADA3zE,EAAIjN,KACAmf,EAAW7b,EAAK2J,EAAE3J,KAAO,EACtB2J,EAAEirC,KAAK3tC,WAAc0C,EAAEirC,KAAKwoC,UAAazzE,EAAEirC,KAAKA,KAAKwoC,WACxDzzE,EAAIA,EAAE0zE,gBAER1zE,EAAIA,EAAEgzE,KAAK,KAAM,KAAM,KAAMhzE,EAAEirC,KAAKxvB,OAAOplB,EAAK6b,GAAa,UACxD,CAOL,GANIlS,EAAEirC,KAAKwoC,WACTzzE,EAAIA,EAAE4zE,gBAEH5zE,EAAEwoE,MAAMlrE,WAAc0C,EAAEwoE,MAAMiL,UAAazzE,EAAEwoE,MAAMv9B,KAAKwoC,WAC3DzzE,EAAIA,EAAE6zE,iBAEuB,IAA3B3hE,EAAW7b,EAAK2J,EAAE3J,KAAY,CAChC,GAAI2J,EAAEwoE,MAAMlrE,UACV,OAAOw1E,GAAUC,WAEjBY,EAAY3zE,EAAEwoE,MAAyB4K,OACvCpzE,EAAIA,EAAEgzE,KACJW,EAASt9E,IACTs9E,EAASl+E,MACT,KACA,KACCuK,EAAEwoE,MAAyBgL,aAGjC,CACDxzE,EAAIA,EAAEgzE,KAAK,KAAM,KAAM,KAAM,KAAMhzE,EAAEwoE,MAAM/sD,OAAOplB,EAAK6b,GACxD,CACD,OAAOlS,EAAEuzE,QAAS,CAMpBE,MAAAA,GACE,OAAO1gF,KAAK6/E,KAAM,CAMZW,MAAAA,GACN,IAAIvzE,EAAoBjN,KAUxB,OATIiN,EAAEwoE,MAAMiL,WAAazzE,EAAEirC,KAAKwoC,WAC9BzzE,EAAIA,EAAE8zE,eAEJ9zE,EAAEirC,KAAKwoC,UAAYzzE,EAAEirC,KAAKA,KAAKwoC,WACjCzzE,EAAIA,EAAE4zE,gBAEJ5zE,EAAEirC,KAAKwoC,UAAYzzE,EAAEwoE,MAAMiL,WAC7BzzE,EAAIA,EAAE+zE,cAED/zE,CAAE,CAMH0zE,YAAAA,GACN,IAAI1zE,EAAIjN,KAAKghF,aAYb,OAXI/zE,EAAEwoE,MAAMv9B,KAAKwoC,WACfzzE,EAAIA,EAAEgzE,KACJ,KACA,KACA,KACA,KACChzE,EAAEwoE,MAAyBoL,gBAE9B5zE,EAAIA,EAAE8zE,cACN9zE,EAAIA,EAAE+zE,cAED/zE,CAAE,CAMH6zE,aAAAA,GACN,IAAI7zE,EAAIjN,KAAKghF,aAKb,OAJI/zE,EAAEirC,KAAKA,KAAKwoC,WACdzzE,EAAIA,EAAE4zE,eACN5zE,EAAIA,EAAE+zE,cAED/zE,CAAE,CAMH8zE,WAAAA,GACN,MAAME,EAAKjhF,KAAKigF,KAAK,KAAM,KAAML,GAASE,IAAK,KAAM9/E,KAAKy1E,MAAMv9B,MAChE,OAAOl4C,KAAKy1E,MAAMwK,KAAK,KAAM,KAAMjgF,KAAK6/E,MAAOoB,EAAI,KAAwB,CAMrEJ,YAAAA,GACN,MAAMK,EAAKlhF,KAAKigF,KAAK,KAAM,KAAML,GAASE,IAAK9/E,KAAKk4C,KAAKu9B,MAAO,MAChE,OAAOz1E,KAAKk4C,KAAK+nC,KAAK,KAAM,KAAMjgF,KAAK6/E,MAAO,KAAMqB,EAAsB,CAMpEF,UAAAA,GACN,MAAM9oC,EAAOl4C,KAAKk4C,KAAK+nC,KAAK,KAAM,MAAOjgF,KAAKk4C,KAAK2nC,MAAO,KAAM,MAC1DpK,EAAQz1E,KAAKy1E,MAAMwK,KAAK,KAAM,MAAOjgF,KAAKy1E,MAAMoK,MAAO,KAAM,MACnE,OAAO7/E,KAAKigF,KAAK,KAAM,MAAOjgF,KAAK6/E,MAAO3nC,EAAMu9B,EAAO,CAQjD0L,cAAAA,GACN,MAAMC,EAAaphF,KAAKqhF,SACxB,OAAOz8C,KAAK24B,IAAI,EAAK6jB,IAAephF,KAAKkgF,QAAU,CAAE,CAGvDmB,MAAAA,GACE,GAAIrhF,KAAK0gF,UAAY1gF,KAAKk4C,KAAKwoC,SAC7B,MAAM,IAAIriF,MACR,0BAA4B2B,KAAKsD,IAAM,IAAMtD,KAAK0C,MAAQ,KAG9D,GAAI1C,KAAKy1E,MAAMiL,SACb,MAAM,IAAIriF,MACR,mBAAqB2B,KAAKsD,IAAM,IAAMtD,KAAK0C,MAAQ,YAGvD,MAAM0+E,EAAaphF,KAAKk4C,KAAKmpC,SAC7B,GAAID,IAAephF,KAAKy1E,MAAM4L,SAC5B,MAAM,IAAIhjF,MAAM,uBAEhB,OAAO+iF,GAAcphF,KAAK0gF,SAAW,EAAI,EAC1C,EArSId,GAAGE,KAAG,EACNF,GAAK0B,OAAG,EA0Sd,MACUC,GAYXtB,IAAAA,CACE38E,EACAZ,EACAm9E,EACA3nC,EACAu9B,GAEA,OAAOz1E,IAAK,CAWdg+B,MAAAA,CAAO16B,EAAQZ,EAAUyc,GACvB,OAAO,IAAIygE,GAASt8E,EAAKZ,EAAO,KAAM,CAUxCgmB,MAAAA,CAAOplB,EAAQ6b,GACb,OAAOnf,IAAK,CAMdkgF,KAAAA,GACE,OAAO,CAAE,CAMX31E,OAAAA,GACE,OAAO,CAAK,CAWd41E,gBAAAA,CAAiB/G,GACf,OAAO,CAAM,CAWfgH,gBAAAA,CAAiBhH,GACf,OAAO,CAAM,CAGfkH,MAAAA,GACE,OAAO,IAAK,CAGdC,MAAAA,GACE,OAAO,IAAK,CAGdc,MAAAA,GACE,OAAO,CAAE,CAMXX,MAAAA,GACE,OAAO,CAAM,EAOd,MACUX,GAUXh+E,WAAAA,CACUy/E,EACAC,EAEkB1B,GAAUC,YAH5B,KAAWwB,YAAXA,EACA,KAAKC,MAALA,CAAK,CAafzjD,MAAAA,CAAO16B,EAAQZ,GACb,OAAO,IAAIq9E,GACT//E,KAAKwhF,YACLxhF,KAAKyhF,MACFzjD,OAAO16B,EAAKZ,EAAO1C,KAAKwhF,aACxBvB,KAAK,KAAM,KAAML,GAAS0B,MAAO,KAAM,MAC1C,CASJ54D,MAAAA,CAAOplB,GACL,OAAO,IAAIy8E,GACT//E,KAAKwhF,YACLxhF,KAAKyhF,MACF/4D,OAAOplB,EAAKtD,KAAKwhF,aACjBvB,KAAK,KAAM,KAAML,GAAS0B,MAAO,KAAM,MAC1C,CAUJtwE,GAAAA,CAAI1N,GACF,IAAIsyE,EACA1nC,EAAOluC,KAAKyhF,MAChB,OAAQvzC,EAAK3jC,UAAW,CAEtB,GADAqrE,EAAM51E,KAAKwhF,YAAYl+E,EAAK4qC,EAAK5qC,KACrB,IAARsyE,EACF,OAAO1nC,EAAKxrC,MACHkzE,EAAM,EACf1nC,EAAOA,EAAKgK,KACH09B,EAAM,IACf1nC,EAAOA,EAAKunC,MAEf,CACD,OAAO,IAAK,CAQdiM,iBAAAA,CAAkBp+E,GAChB,IAAIsyE,EACF1nC,EAAOluC,KAAKyhF,MACZE,EAAc,KAChB,OAAQzzC,EAAK3jC,UAAW,CAEtB,GADAqrE,EAAM51E,KAAKwhF,YAAYl+E,EAAK4qC,EAAK5qC,KACrB,IAARsyE,EAAW,CACb,GAAK1nC,EAAKgK,KAAK3tC,UAMR,OAAIo3E,EACFA,EAAYr+E,IAEZ,KARP4qC,EAAOA,EAAKgK,KACZ,OAAQhK,EAAKunC,MAAMlrE,UACjB2jC,EAAOA,EAAKunC,MAEd,OAAOvnC,EAAK5qC,GAMf,CAAUsyE,EAAM,EACf1nC,EAAOA,EAAKgK,KACH09B,EAAM,IACf+L,EAAczzC,EACdA,EAAOA,EAAKunC,MAEf,CAED,MAAM,IAAIp3E,MACR,wEACA,CAMJkM,OAAAA,GACE,OAAOvK,KAAKyhF,MAAMl3E,SAAU,CAM9B21E,KAAAA,GACE,OAAOlgF,KAAKyhF,MAAMvB,OAAQ,CAM5BI,MAAAA,GACE,OAAOtgF,KAAKyhF,MAAMnB,QAAS,CAM7BC,MAAAA,GACE,OAAOvgF,KAAKyhF,MAAMlB,QAAS,CAY7BJ,gBAAAA,CAAiB/G,GACf,OAAOp5E,KAAKyhF,MAAMtB,iBAAiB/G,EAAQ,CAW7CgH,gBAAAA,CAAiBhH,GACf,OAAOp5E,KAAKyhF,MAAMrB,iBAAiBhH,EAAQ,CAO7CwI,WAAAA,CACEC,GAEA,OAAO,IAAIzC,GACTp/E,KAAKyhF,MACL,KACAzhF,KAAKwhF,aACL,EACAK,EACA,CAGJC,eAAAA,CACEx+E,EACAu+E,GAEA,OAAO,IAAIzC,GACTp/E,KAAKyhF,MACLn+E,EACAtD,KAAKwhF,aACL,EACAK,EACA,CAGJE,sBAAAA,CACEz+E,EACAu+E,GAEA,OAAO,IAAIzC,GACTp/E,KAAKyhF,MACLn+E,EACAtD,KAAKwhF,aACL,EACAK,EACA,CAGJG,kBAAAA,CACEH,GAEA,OAAO,IAAIzC,GACTp/E,KAAKyhF,MACL,KACAzhF,KAAKwhF,aACL,EACAK,EACA;;;;;;;;;;;;;;;;;AC3vBU,SAAAI,GAAqB/pC,EAAiBu9B,GACpD,OAAOnZ,EAAYpkB,EAAKl2C,KAAMyzE,EAAMzzE,KACtC,CAEgB,SAAAkgF,GAAgBhqC,EAAcu9B,GAC5C,OAAOnZ,EAAYpkB,EAAMu9B,EAC3B;;;;;;;;;;;;;;;;GCHA,IAAI0M,GAEE,SAAUC,GAAWrsD,GACzBosD,GAAWpsD,CACb,CFoiBSgqD,GAAAC,WAAa,IAAIuB,GEliBnB,MAAMc,GAAmB,SAAUC,GACxC,MAAwB,kBAAbA,EACF,UAAYrlB,EAAsBqlB,GAElC,UAAYA,CAEvB,EAKaC,GAAuB,SAAUC,GAC5C,GAAIA,EAAaC,aAAc,CAC7B,MAAM1sD,EAAMysD,EAAazsD,OACzB93B,EAAAA,EAAAA,IACiB,kBAAR83B,GACU,kBAARA,GACS,kBAARA,IAAoB5rB,EAAAA,EAAAA,IAAS4rB,EAAkB,OACzD,uCAEH,MACC93B,EAAAA,EAAAA,IACEukF,IAAiBL,IAAYK,EAAaj4E,UAC1C,iCAIJtM,EAAAA,EAAAA,IACEukF,IAAiBL,IAAYK,EAAaE,cAAcn4E,UACxD,qDAEJ;;;;;;;;;;;;;;;;;AC3BA,IAAIo4E,GCXAC,GACAC,GDgBD,MACUC,GAsBX/gF,WAAAA,CACmBghF,EACTC,EAAsBF,GAASH,0BAA0B3C,YADhD,KAAM+C,OAANA,EACT,KAAaC,cAAbA,EATF,KAASC,UAAkB,MAWjChlF,EAAAA,EAAAA,SACkB2E,IAAhB5C,KAAK+iF,QAAwC,OAAhB/iF,KAAK+iF,OAClC,4DAGFR,GAAqBviF,KAAKgjF,cAAe,CA9B3C,oCAAWL,CAA0B5sD,GACnC4sD,GAA4B5sD,CAAI,CAGlC,oCAAW4sD,GACT,OAAOA,EAA0B,CA6BnCF,UAAAA,GACE,OAAO,CAAK,CAIdC,WAAAA,GACE,OAAO1iF,KAAKgjF,aAAc,CAI5BE,cAAAA,CAAeC,GACb,OAAO,IAAIL,GAAS9iF,KAAK+iF,OAAQI,EAAiB,CAIpDC,iBAAAA,CAAkBC,GAEhB,MAAkB,cAAdA,EACKrjF,KAAKgjF,cAELF,GAASH,0BAA0B3C,UAC3C,CAIHsD,QAAAA,CAASv6D,GACP,OAAImsD,GAAYnsD,GACP/oB,KACyB,cAAvBs0E,GAAavrD,GACf/oB,KAAKgjF,cAELF,GAASH,0BAA0B3C,UAC3C,CAEHuD,QAAAA,GACE,OAAO,CAAM,CAIfC,uBAAAA,CAAwBH,EAAmBI,GACzC,OAAO,IAAK,CAIdC,oBAAAA,CAAqBL,EAAmBM,GACtC,MAAkB,cAAdN,EACKrjF,KAAKkjF,eAAeS,GAClBA,EAAap5E,WAA2B,cAAd84E,EAC5BrjF,KAEA8iF,GAASH,0BAA0B3C,WAAW0D,qBACnDL,EACAM,GACAT,eAAeljF,KAAKgjF,cACvB,CAIHY,WAAAA,CAAY76D,EAAY46D,GACtB,MAAME,EAAQvP,GAAavrD,GAC3B,OAAc,OAAV86D,EACKF,EACEA,EAAap5E,WAAuB,cAAVs5E,EAC5B7jF,OAEP/B,EAAAA,EAAAA,IACY,cAAV4lF,GAAiD,IAAxBtP,GAAcxrD,GACvC,8CAGK/oB,KAAK0jF,qBACVG,EACAf,GAASH,0BAA0B3C,WAAW4D,YAC5CpP,GAAazrD,GACb46D,IAGL,CAIHp5E,OAAAA,GACE,OAAO,CAAM,CAIfu5E,WAAAA,GACE,OAAO,CAAE,CAIXC,YAAAA,CAAax1E,EAAc6qE,GACzB,OAAO,CAAM,CAEfrjD,GAAAA,CAAIiuD,GACF,OAAIA,IAAiBhkF,KAAK0iF,cAAcn4E,UAC/B,CACL,SAAUvK,KAAKikF,WACf,YAAajkF,KAAK0iF,cAAc3sD,OAG3B/1B,KAAKikF,UACb,CAIH1R,IAAAA,GACE,GAAuB,OAAnBvyE,KAAKijF,UAAoB,CAC3B,IAAIiB,EAAS,GACRlkF,KAAKgjF,cAAcz4E,YACtB25E,GACE,YACA7B,GAAiBriF,KAAKgjF,cAAcjtD,OACpC,KAGJ,MAAM1vB,SAAcrG,KAAK+iF,OACzBmB,GAAU79E,EAAO,IAEf69E,GADW,WAAT79E,EACQ42D,EAAsBj9D,KAAK+iF,QAE3B/iF,KAAK+iF,OAEjB/iF,KAAKijF,UAAYloB,EAAKmpB,EACvB,CACD,OAAOlkF,KAAKijF,SAAU,CAOxBgB,QAAAA,GACE,OAAOjkF,KAAK+iF,MAAO,CAErBoB,SAAAA,CAAUrO,GACR,OAAIA,IAAUgN,GAASH,0BAA0B3C,WACxC,EACElK,aAAiBgN,GAASH,2BAC3B,IAER1kF,EAAAA,EAAAA,IAAO63E,EAAM2M,aAAc,qBACpBziF,KAAKokF,mBAAmBtO,GAChC,CAMKsO,kBAAAA,CAAmBC,GACzB,MAAMC,SAAuBD,EAAUtB,OACjCwB,SAAsBvkF,KAAK+iF,OAC3ByB,EAAa1B,GAAS2B,iBAAiB/lE,QAAQ4lE,GAC/CI,EAAY5B,GAAS2B,iBAAiB/lE,QAAQ6lE,GAGpD,OAFAtmF,EAAAA,EAAAA,IAAOumF,GAAc,EAAG,sBAAwBF,IAChDrmF,EAAAA,EAAAA,IAAOymF,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHvkF,KAAK+iF,OAASsB,EAAUtB,QAClB,EACC/iF,KAAK+iF,SAAWsB,EAAUtB,OAC5B,EAEA,EAIJ2B,EAAYF,CACpB,CAEHG,SAAAA,GACE,OAAO3kF,IAAK,CAEd4kF,SAAAA,GACE,OAAO,CAAK,CAEdC,MAAAA,CAAO/O,GACL,GAAIA,IAAU91E,KACZ,OAAO,EACF,GAAI81E,EAAM2M,aAAc,CAC7B,MAAM4B,EAAYvO,EAClB,OACE91E,KAAK+iF,SAAWsB,EAAUtB,QAC1B/iF,KAAKgjF,cAAc6B,OAAOR,EAAUrB,cAEvC,CACC,OAAO,CACR,EClPC,SAAU8B,GAAgB/uD,GAC9B6sD,GAAe7sD,CACjB,CAEM,SAAUgvD,GAAWhvD,GACzB8sD,GAAW9sD,CACb,CDsBS+sD,GAAgB2B,iBAAG,CAAC,SAAU,UAAW,SAAU,UCpBtD,MAAOO,WAAsB7G,GACjCE,OAAAA,CAAQxzE,EAAcC,GACpB,MAAMm6E,EAAYp6E,EAAEqjC,KAAKw0C,cACnBwC,EAAYp6E,EAAEojC,KAAKw0C,cACnByC,EAAWF,EAAUd,UAAUe,GACrC,OAAiB,IAAbC,EACK7oB,EAAYzxD,EAAE7I,KAAM8I,EAAE9I,MAEtBmjF,CACR,CAEHpG,WAAAA,CAAY7wC,GACV,OAAQA,EAAKw0C,cAAcn4E,SAAU,CAEvC+zE,mBAAAA,CAAoBC,EAAeC,GACjC,OAAQD,EAAQmE,cAAcmC,OAAOrG,EAAQkE,cAAe,CAE9D/D,OAAAA,GAEE,OAAQV,GAAkBW,GAAI,CAEhCI,OAAAA,GACE,OAAO,IAAIf,GAAU5hB,EAAU,IAAIymB,GAAS,kBAAmBD,IAAW,CAG5E5D,QAAAA,CAASC,EAAqBl9E,GAC5B,MAAMwgF,EAAeI,GAAa1D,GAClC,OAAO,IAAIjB,GAAUj8E,EAAM,IAAI8gF,GAAS,kBAAmBN,GAAe,CAM5E5mD,QAAAA,GACE,MAAO,WAAY,EAIhB,MAAMwpD,GAAiB,IAAIJ,GCnD5BK,GAAQzgD,KAAK+0B,IAAI;;;;;;;;;;;;;;;;GAEvB,MAAM2rB,GAKJvjF,WAAAA,CAAYpD,GACV,MAAM4mF,EAAYC,GAEhBrgF,SAAUy/B,KAAK+0B,IAAI6rB,GAAOH,GAAe,IACrCI,EAAW/nB,GAAiBv4D,SAAS5E,MAAMm9D,EAAO,GAAGl+D,KAAK,KAAM,GACtEQ,KAAKkgF,MAAQqF,EAAS5mF,EAAS,GAC/BqB,KAAK0lF,SAAW1lF,KAAKkgF,MAAQ,EAC7B,MAAMyF,EAAOF,EAAQzlF,KAAKkgF,OAC1BlgF,KAAK4lF,MAASjnF,EAAS,EAAKgnF,CAAK,CAGnCE,YAAAA,GAEE,MAAM19E,IAAWnI,KAAK4lF,MAAS,GAAO5lF,KAAK0lF,UAE3C,OADA1lF,KAAK0lF,WACEv9E,CAAO,EAiBX,MAAM29E,GAAgB,SAC3BC,EACAnQ,EACAoQ,EACAC,GAEAF,EAAU9mE,KAAK22D,GAEf,MAAMsQ,EAAoB,SACxBv4E,EACAD,GAEA,MAAM/O,EAAS+O,EAAOC,EACtB,IAAIw4E,EACA7iF,EACJ,GAAe,IAAX3E,EACF,OAAO,KACF,GAAe,IAAXA,EAGT,OAFAwnF,EAAYJ,EAAUp4E,GACtBrK,EAAM0iF,EAAQA,EAAMG,GAAcA,EAC3B,IAAIvG,GACTt8E,EACA6iF,EAAUj4C,KACV0xC,GAAS0B,MACT,KACA,MAEG,CAEL,MAAMvjE,EAAS5Y,SAAUxG,EAAS,EAAW,IAAMgP,EAC7CuqC,EAAOguC,EAAkBv4E,EAAKoQ,GAC9B03D,EAAQyQ,EAAkBnoE,EAAS,EAAGrQ,GAG5C,OAFAy4E,EAAYJ,EAAUhoE,GACtBza,EAAM0iF,EAAQA,EAAMG,GAAcA,EAC3B,IAAIvG,GACTt8E,EACA6iF,EAAUj4C,KACV0xC,GAAS0B,MACTppC,EACAu9B,EAEH,CACH,EAEM2Q,EAAmB,SAAUC,GACjC,IAAIn4C,EAAuB,KACvBhqB,EAAO,KACP3V,EAAQw3E,EAAUpnF,OAEtB,MAAM2nF,EAAe,SAAUC,EAAmB1G,GAChD,MAAMlyE,EAAMY,EAAQg4E,EACd74E,EAAOa,EACbA,GAASg4E,EACT,MAAMC,EAAYN,EAAkBv4E,EAAM,EAAGD,GACvCy4E,EAAYJ,EAAUp4E,GACtBrK,EAAS0iF,EAAQA,EAAMG,GAAcA,EAC3CM,EACE,IAAI7G,GACFt8E,EACA6iF,EAAUj4C,KACV2xC,EACA,KACA2G,GAGN,EAEMC,EAAgB,SAAUC,GAC1Bx4C,GACFA,EAAKgK,KAAOwuC,EACZx4C,EAAOw4C,IAEPxiE,EAAOwiE,EACPx4C,EAAOw4C,EAEX,EAEA,IAAK,IAAIhoF,EAAI,EAAGA,EAAI2nF,EAAOnG,QAASxhF,EAAG,CACrC,MAAMioF,EAAQN,EAAOR,eAEfU,EAAY3hD,KAAK24B,IAAI,EAAG8oB,EAAOnG,OAASxhF,EAAI,IAC9CioF,EACFL,EAAaC,EAAW3G,GAAS0B,QAGjCgF,EAAaC,EAAW3G,GAAS0B,OACjCgF,EAAaC,EAAW3G,GAASE,KAEpC,CACD,OAAO57D,CACT,EAEMmiE,EAAS,IAAIf,GAAUS,EAAUpnF,QACjCulB,EAAOkiE,EAAiBC,GAE9B,OAAO,IAAItG,GAAgBkG,GAAcrQ,EAAa1xD,EACxD;;;;;;;;;;;;;;;;GCjIA,IAAI0iE,GAEJ,MAAMC,GAAiB,CAAC,EAAE,MAEbC,GAkBX/kF,WAAAA,CACUglF,EAGAC,GAHA,KAAQD,SAARA,EAGA,KAASC,UAATA,CAAS,CAlBnB,kBAAWC,GAWT,OAVAhpF,EAAAA,EAAAA,IACE4oF,IAAkBzB,GAClB,uCAEFwB,GACEA,IACA,IAAIE,GACF,CAAE,YAAaD,IACf,CAAE,YAAazB,KAEZwB,EAAiB,CAU1B51E,GAAAA,CAAIk2E,GACF,MAAMC,GAAY78E,EAAAA,EAAAA,IAAQtK,KAAK+mF,SAAUG,GACzC,IAAKC,EACH,MAAM,IAAI9oF,MAAM,wBAA0B6oF,GAG5C,OAAIC,aAAqBpH,GAChBoH,EAIA,IACR,CAGHC,QAAAA,CAASC,GACP,OAAOl9E,EAAAA,EAAAA,IAASnK,KAAKgnF,UAAWK,EAAgBzrD,WAAY,CAG9D0rD,QAAAA,CACED,EACAE,IAEAtpF,EAAAA,EAAAA,IACEopF,IAAoBlI,GACpB,uEAEF,MAAM4G,EAAY,GAClB,IAAIyB,GAAkB,EACtB,MAAMC,EAAOF,EAAiB3F,YAAY3D,GAAUC,MACpD,IAOIr4C,EAPApuB,EAAOgwE,EAAKhI,UAChB,MAAOhoE,EACL+vE,EACEA,GAAmBH,EAAgBtI,YAAYtnE,EAAKy2B,MACtD63C,EAAU1kF,KAAKoW,GACfA,EAAOgwE,EAAKhI,UAIZ55C,EADE2hD,EACS1B,GAAcC,EAAWsB,EAAgBjJ,cAEzCyI,GAEb,MAAMa,EAAYL,EAAgBzrD,WAC5B+rD,EAAmB5kF,OAAA4D,OAAA,GAAA3G,KAAKgnF,WAC9BW,EAAYD,GAAaL,EACzB,MAAMO,EAAkB7kF,OAAA4D,OAAA,GAAA3G,KAAK+mF,UAE7B,OADAa,EAAWF,GAAa7hD,EACjB,IAAIihD,GAASc,EAAYD,EAAa,CAM/CE,YAAAA,CACE1B,EACAoB,GAEA,MAAMK,GAAap9E,EAAAA,EAAAA,IACjBxK,KAAK+mF,UACL,CAACe,EAA6CJ,KAC5C,MAAMn5E,GAAQjE,EAAAA,EAAAA,IAAQtK,KAAKgnF,UAAWU,GAEtC,IADAzpF,EAAAA,EAAAA,IAAOsQ,EAAO,oCAAsCm5E,GAChDI,IAAoBjB,GAAgB,CAEtC,GAAIt4E,EAAMwwE,YAAYoH,EAAUj4C,MAAO,CAErC,MAAM63C,EAAY,GACZ0B,EAAOF,EAAiB3F,YAAY3D,GAAUC,MACpD,IAAIzmE,EAAOgwE,EAAKhI,UAChB,MAAOhoE,EACDA,EAAKzV,OAASmkF,EAAUnkF,MAC1B+jF,EAAU1kF,KAAKoW,GAEjBA,EAAOgwE,EAAKhI,UAGd,OADAsG,EAAU1kF,KAAK8kF,GACRL,GAAcC,EAAWx3E,EAAM6vE,aACvC,CAEC,OAAOyI,EAEV,CAAM,CACL,MAAMkB,EAAeR,EAAiBv2E,IAAIm1E,EAAUnkF,MACpD,IAAIqgC,EAAcylD,EAMlB,OALIC,IACF1lD,EAAcA,EAAY3Z,OACxB,IAAIu1D,GAAUkI,EAAUnkF,KAAM+lF,KAG3B1lD,EAAYrE,OAAOmoD,EAAWA,EAAUj4C,KAChD,KAGL,OAAO,IAAI44C,GAASc,EAAY5nF,KAAKgnF,UAAW,CAMlDgB,iBAAAA,CACE7B,EACAoB,GAEA,MAAMK,GAAap9E,EAAAA,EAAAA,IACjBxK,KAAK+mF,UACJe,IACC,GAAIA,IAAoBjB,GAEtB,OAAOiB,EACF,CACL,MAAMC,EAAeR,EAAiBv2E,IAAIm1E,EAAUnkF,MACpD,OAAI+lF,EACKD,EAAgBp/D,OACrB,IAAIu1D,GAAUkI,EAAUnkF,KAAM+lF,IAIzBD,CAEV,KAGL,OAAO,IAAIhB,GAASc,EAAY5nF,KAAKgnF,UAAW;;;;;;;;;;;;;;;;GCrIpD,IAAIhH,GAMD,MACUiI,GAkBXlmF,WAAAA,CACmBmmF,EACAlF,EACTmF,GAFS,KAASD,UAATA,EACA,KAAalF,cAAbA,EACT,KAASmF,UAATA,EApBF,KAASlF,UAAkB,KA2B7BjjF,KAAKgjF,eACPT,GAAqBviF,KAAKgjF,eAGxBhjF,KAAKkoF,UAAU39E,YACjBtM,EAAAA,EAAAA,KACG+B,KAAKgjF,eAAiBhjF,KAAKgjF,cAAcz4E,UAC1C,uCAEH,CAlCH,qBAAWy1E,GACT,OACEA,KACCA,GAAa,IAAIiI,GAChB,IAAIlI,GAAwBmC,IAC5B,KACA4E,GAASG,SACT,CA+BNxE,UAAAA,GACE,OAAO,CAAM,CAIfC,WAAAA,GACE,OAAO1iF,KAAKgjF,eAAiBhD,EAAW,CAI1CkD,cAAAA,CAAeC,GACb,OAAInjF,KAAKkoF,UAAU39E,UAEVvK,KAEA,IAAIioF,GAAajoF,KAAKkoF,UAAW/E,EAAiBnjF,KAAKmoF,UAC/D,CAIH/E,iBAAAA,CAAkBC,GAEhB,GAAkB,cAAdA,EACF,OAAOrjF,KAAK0iF,cACP,CACL,MAAMr2D,EAAQrsB,KAAKkoF,UAAUl3E,IAAIqyE,GACjC,OAAiB,OAAVh3D,EAAiB2zD,GAAa3zD,CACtC,EAIHi3D,QAAAA,CAASv6D,GACP,MAAM86D,EAAQvP,GAAavrD,GAC3B,OAAc,OAAV86D,EACK7jF,KAGFA,KAAKojF,kBAAkBS,GAAOP,SAAS9O,GAAazrD,GAAO,CAIpEw6D,QAAAA,CAASF,GACP,OAAyC,OAAlCrjF,KAAKkoF,UAAUl3E,IAAIqyE,EAAoB,CAIhDK,oBAAAA,CAAqBL,EAAmBM,GAEtC,IADA1lF,EAAAA,EAAAA,IAAO0lF,EAAc,8CACH,cAAdN,EACF,OAAOrjF,KAAKkjF,eAAeS,GACtB,CACL,MAAMwC,EAAY,IAAIlI,GAAUoF,EAAWM,GAC3C,IAAIthD,EAAa+lD,EACbzE,EAAap5E,WACf83B,EAAcriC,KAAKkoF,UAAUx/D,OAAO26D,GACpC+E,EAAcpoF,KAAKmoF,UAAUH,kBAC3B7B,EACAnmF,KAAKkoF,aAGP7lD,EAAcriC,KAAKkoF,UAAUlqD,OAAOqlD,EAAWM,GAC/CyE,EAAcpoF,KAAKmoF,UAAUN,aAAa1B,EAAWnmF,KAAKkoF,YAG5D,MAAMG,EAAchmD,EAAY93B,UAC5By1E,GACAhgF,KAAKgjF,cACT,OAAO,IAAIiF,GAAa5lD,EAAagmD,EAAaD,EACnD,EAIHxE,WAAAA,CAAY76D,EAAY46D,GACtB,MAAME,EAAQvP,GAAavrD,GAC3B,GAAc,OAAV86D,EACF,OAAOF,EACF,EACL1lF,EAAAA,EAAAA,IACyB,cAAvBq2E,GAAavrD,IAAiD,IAAxBwrD,GAAcxrD,GACpD,8CAEF,MAAMu/D,EAAoBtoF,KAAKojF,kBAAkBS,GAAOD,YACtDpP,GAAazrD,GACb46D,GAEF,OAAO3jF,KAAK0jF,qBAAqBG,EAAOyE,EACzC,EAIH/9E,OAAAA,GACE,OAAOvK,KAAKkoF,UAAU39E,SAAU,CAIlCu5E,WAAAA,GACE,OAAO9jF,KAAKkoF,UAAUhI,OAAQ,CAMhCnqD,GAAAA,CAAIiuD,GACF,GAAIhkF,KAAKuK,UACP,OAAO,KAGT,MAAMH,EAAgC,CAAC,EACvC,IAAIm+E,EAAU,EACZhI,EAAS,EACTiI,GAAiB,EAYnB,GAXAxoF,KAAK+jF,aAAaqB,IAAgB,CAAC9hF,EAAamgF,KAC9Cr5E,EAAI9G,GAAOmgF,EAAU1tD,IAAIiuD,GAEzBuE,IACIC,GAAkBP,GAAazpB,gBAAgBh3D,KAAKlE,GACtDi9E,EAAS37C,KAAKoO,IAAIutC,EAAQttE,OAAO3P,IAEjCklF,GAAiB,CAClB,KAGExE,GAAgBwE,GAAkBjI,EAAS,EAAIgI,EAAS,CAE3D,MAAME,EAAmB,GAEzB,IAAK,MAAMnlF,KAAO8G,EAChBq+E,EAAMnlF,GAA4B8G,EAAI9G,GAGxC,OAAOmlF,CACR,CAIC,OAHIzE,IAAiBhkF,KAAK0iF,cAAcn4E,YACtCH,EAAI,aAAepK,KAAK0iF,cAAc3sD,OAEjC3rB,CACR,CAIHmoE,IAAAA,GACE,GAAuB,OAAnBvyE,KAAKijF,UAAoB,CAC3B,IAAIiB,EAAS,GACRlkF,KAAK0iF,cAAcn4E,YACtB25E,GACE,YACA7B,GAAiBriF,KAAK0iF,cAAc3sD,OACpC,KAGJ/1B,KAAK+jF,aAAaqB,IAAgB,CAAC9hF,EAAKmgF,KACtC,MAAMiF,EAAYjF,EAAUlR,OACV,KAAdmW,IACFxE,GAAU,IAAM5gF,EAAM,IAAMolF,EAC7B,IAGH1oF,KAAKijF,UAAuB,KAAXiB,EAAgB,GAAKnpB,EAAKmpB,EAC5C,CACD,OAAOlkF,KAAKijF,SAAU,CAIxBO,uBAAAA,CACEH,EACAI,EACAl1E,GAEA,MAAMo6E,EAAM3oF,KAAK4oF,cAAcr6E,GAC/B,GAAIo6E,EAAK,CACP,MAAME,EAAcF,EAAIjH,kBACtB,IAAIzD,GAAUoF,EAAWI,IAE3B,OAAOoF,EAAcA,EAAY7mF,KAAO,IACzC,CACC,OAAOhC,KAAKkoF,UAAUxG,kBAAkB2B,EACzC,CAGHyF,iBAAAA,CAAkBzB,GAChB,MAAMsB,EAAM3oF,KAAK4oF,cAAcvB,GAC/B,GAAIsB,EAAK,CACP,MAAMrI,EAASqI,EAAIrI,SACnB,OAAOA,GAAUA,EAAOt+E,IACzB,CACC,OAAOhC,KAAKkoF,UAAU5H,QACvB,CAGHyI,aAAAA,CAAc1B,GACZ,MAAM/G,EAAStgF,KAAK8oF,kBAAkBzB,GACtC,OAAI/G,EACK,IAAIrC,GAAUqC,EAAQtgF,KAAKkoF,UAAUl3E,IAAIsvE,IAEzC,IACR,CAMH0I,gBAAAA,CAAiB3B,GACf,MAAMsB,EAAM3oF,KAAK4oF,cAAcvB,GAC/B,GAAIsB,EAAK,CACP,MAAMpI,EAASoI,EAAIpI,SACnB,OAAOA,GAAUA,EAAOv+E,IACzB,CACC,OAAOhC,KAAKkoF,UAAU3H,QACvB,CAGH0I,YAAAA,CAAa5B,GACX,MAAM9G,EAASvgF,KAAKgpF,iBAAiB3B,GACrC,OAAI9G,EACK,IAAItC,GAAUsC,EAAQvgF,KAAKkoF,UAAUl3E,IAAIuvE,IAEzC,IACR,CAEHwD,YAAAA,CACEx1E,EACA6qE,GAEA,MAAMuP,EAAM3oF,KAAK4oF,cAAcr6E,GAC/B,OAAIo6E,EACKA,EAAIxI,kBAAiB+I,GACnB9P,EAAO8P,EAAYlnF,KAAMknF,EAAYh7C,QAGvCluC,KAAKkoF,UAAU/H,iBAAiB/G,EACxC,CAGHwI,WAAAA,CACEyF,GAEA,OAAOrnF,KAAK8hF,gBAAgBuF,EAAgB1I,UAAW0I,EAAiB,CAG1EvF,eAAAA,CACEqH,EACA9B,GAEA,MAAMsB,EAAM3oF,KAAK4oF,cAAcvB,GAC/B,GAAIsB,EACF,OAAOA,EAAI7G,gBAAgBqH,GAAW7lF,GAAOA,IACxC,CACL,MAAMgU,EAAWtX,KAAKkoF,UAAUpG,gBAC9BqH,EAAUnnF,KACVi8E,GAAUC,MAEZ,IAAIzmE,EAAOH,EAASqoE,OACpB,MAAe,MAARloE,GAAgB4vE,EAAgBhJ,QAAQ5mE,EAAM0xE,GAAa,EAChE7xE,EAASmoE,UACThoE,EAAOH,EAASqoE,OAElB,OAAOroE,CACR,EAGH0qE,kBAAAA,CACEqF,GAEA,OAAOrnF,KAAK+hF,uBACVsF,EAAgBrI,UAChBqI,EACA,CAGJtF,sBAAAA,CACEqH,EACA/B,GAEA,MAAMsB,EAAM3oF,KAAK4oF,cAAcvB,GAC/B,GAAIsB,EACF,OAAOA,EAAI5G,uBAAuBqH,GAAS9lF,GAClCA,IAEJ,CACL,MAAMgU,EAAWtX,KAAKkoF,UAAUnG,uBAC9BqH,EAAQpnF,KACRi8E,GAAUC,MAEZ,IAAIzmE,EAAOH,EAASqoE,OACpB,MAAe,MAARloE,GAAgB4vE,EAAgBhJ,QAAQ5mE,EAAM2xE,GAAW,EAC9D9xE,EAASmoE,UACThoE,EAAOH,EAASqoE,OAElB,OAAOroE,CACR,EAEH6sE,SAAAA,CAAUrO,GACR,OAAI91E,KAAKuK,UACHurE,EAAMvrE,UACD,GAEC,EAEDurE,EAAM2M,cAAgB3M,EAAMvrE,UAC9B,EACEurE,IAAUuT,IACX,EAGD,CACR,CAEH1E,SAAAA,CAAU0C,GACR,GACEA,IAAoBlI,IACpBn/E,KAAKmoF,UAAUf,SAASC,GAExB,OAAOrnF,KACF,CACL,MAAMooF,EAAcpoF,KAAKmoF,UAAUb,SACjCD,EACArnF,KAAKkoF,WAEP,OAAO,IAAID,GAAajoF,KAAKkoF,UAAWloF,KAAKgjF,cAAeoF,EAC7D,EAEHxD,SAAAA,CAAUr2E,GACR,OAAOA,IAAU4wE,IAAan/E,KAAKmoF,UAAUf,SAAS74E,EAAO,CAE/Ds2E,MAAAA,CAAO/O,GACL,GAAIA,IAAU91E,KACZ,OAAO,EACF,GAAI81E,EAAM2M,aACf,OAAO,EACF,CACL,MAAM6G,EAAoBxT,EAC1B,GAAK91E,KAAK0iF,cAAcmC,OAAOyE,EAAkB5G,eAE1C,IACL1iF,KAAKkoF,UAAUhI,UAAYoJ,EAAkBpB,UAAUhI,QACvD,CACA,MAAMqJ,EAAWvpF,KAAK4hF,YAAYwD,IAC5BoE,EAAYF,EAAkB1H,YAAYwD,IAChD,IAAIqE,EAAcF,EAAS9J,UACvBiK,EAAeF,EAAU/J,UAC7B,MAAOgK,GAAeC,EAAc,CAClC,GACED,EAAYznF,OAAS0nF,EAAa1nF,OACjCynF,EAAYv7C,KAAK22C,OAAO6E,EAAax7C,MAEtC,OAAO,EAETu7C,EAAcF,EAAS9J,UACvBiK,EAAeF,EAAU/J,SAC1B,CACD,OAAuB,OAAhBgK,GAAyC,OAAjBC,CAChC,CACC,OAAO,CACR,CArBC,OAAO,CAsBV,EAQKd,aAAAA,CACNvB,GAEA,OAAIA,IAAoBlI,GACf,KAEAn/E,KAAKmoF,UAAUn3E,IAAIq2E,EAAgBzrD,WAC3C,EA9QYqsD,GAAezpB,gBAAG,iBAkR7B,MAAOmrB,WAAgB1B,GAC3BlmF,WAAAA,GACE6G,MACE,IAAIm3E,GAAwBmC,IAC5B+F,GAAajI,WACb8G,GAASG,QACT,CAGJ9C,SAAAA,CAAUrO,GACR,OAAIA,IAAU91E,KACL,EAEA,CACR,CAGH6kF,MAAAA,CAAO/O,GAEL,OAAOA,IAAU91E,IAAK,CAGxB0iF,WAAAA,GACE,OAAO1iF,IAAK,CAGdojF,iBAAAA,CAAkBC,GAChB,OAAO4E,GAAajI,UAAW,CAGjCz1E,OAAAA,GACE,OAAO,CAAM,EAOV,MAAM8+E,GAAW,IAAIM,GAY5B5mF,OAAO6mF,iBAAiB3L,GAAW,CACjCW,IAAK,CACHl8E,MAAO,IAAIu7E,GAAU7hB,EAAU6rB,GAAajI,aAE9C6J,IAAK,CACHnnF,MAAO,IAAIu7E,GAAU5hB,EAAUgtB,OAOnCvK,GAASD,aAAeoJ,GAAajI,WACrC8C,GAASH,0BAA4BsF,GACrC7F,GAAWiH,IACXtE,GAAmBsE;;;;;;;;;;;;;;;;;ACrfnB,MAAMS,IAAY,EAOf,SACaC,GACdC,EACA1H,EAAoB,MAEpB,GAAa,OAAT0H,EACF,OAAO/B,GAAajI,WAoBtB,GAjBoB,kBAATgK,GAAqB,cAAeA,IAC7C1H,EAAW0H,EAAK,eAGlB/rF,EAAAA,EAAAA,IACe,OAAbqkF,GACsB,kBAAbA,GACa,kBAAbA,GACc,kBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,kBAAT0H,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,kBAATA,GAAqB,QAASA,EAAM,CAC7C,MAAMC,EAAWD,EACjB,OAAO,IAAIlH,GAASmH,EAAUF,GAAazH,GAC5C,CAED,GAAM0H,aAAgBzpF,QAAUupF,GA8CzB,CACL,IAAI57C,EAAa+5C,GAAajI,WAa9B,OAZAhjB,EAAKgtB,GAAM,CAAC1mF,EAAa4mF,KACvB,IAAI//E,EAAAA,EAAAA,IAAS6/E,EAAgB1mF,IACC,MAAxBA,EAAI8B,UAAU,EAAG,GAAY,CAE/B,MAAMq+E,EAAYsG,GAAaG,IAC3BzG,EAAUhB,cAAiBgB,EAAUl5E,YACvC2jC,EAAOA,EAAKw1C,qBAAqBpgF,EAAKmgF,GAEzC,CACF,IAGIv1C,EAAKg1C,eAAe6G,GAAazH,GACzC,CA7D0C,CACzC,MAAMx9D,EAAwB,GAC9B,IAAIqlE,GAAuB,EAC3B,MAAMC,EAAeJ,EAarB,GAZAhtB,EAAKotB,GAAc,CAAC9mF,EAAK+oB,KACvB,GAA4B,MAAxB/oB,EAAI8B,UAAU,EAAG,GAAY,CAE/B,MAAMq+E,EAAYsG,GAAa19D,GAC1Bo3D,EAAUl5E,YACb4/E,EACEA,IAAyB1G,EAAUf,cAAcn4E,UACnDua,EAASzjB,KAAK,IAAI48E,GAAU36E,EAAKmgF,IAEpC,KAGqB,IAApB3+D,EAASnmB,OACX,OAAOspF,GAAajI,WAGtB,MAAMqK,EAAWvE,GACfhhE,EACAm9D,IACAkE,GAAaA,EAAUnkF,MACvBkgF,IAEF,GAAIiI,EAAsB,CACxB,MAAMG,EAAiBxE,GACrBhhE,EACAsgE,GAAehH,cAEjB,OAAO,IAAI6J,GACToC,EACAN,GAAazH,GACb,IAAIwE,GACF,CAAE,YAAawD,GACf,CAAE,YAAalF,KAGpB,CACC,OAAO,IAAI6C,GACToC,EACAN,GAAazH,GACbwE,GAASG,QAGd,CAgBH,CAEAnC,GAAgBiF;;;;;;;;;;;;;;;;;AC1GV,MAAOQ,WAAkBpM,GAC7Bp8E,WAAAA,CAAoByoF,GAClB5hF,QADkB,KAAU4hF,WAAVA,GAGlBvsF,EAAAA,EAAAA,KACGi3E,GAAYsV,IAA4C,cAA7BlW,GAAakW,GACzC,0DACA,CAGMC,YAAAA,CAAaC,GACrB,OAAOA,EAAKpH,SAAStjF,KAAKwqF,WAAY,CAExCzL,WAAAA,CAAY7wC,GACV,OAAQA,EAAKo1C,SAAStjF,KAAKwqF,YAAYjgF,SAAU,CAEnD8zE,OAAAA,CAAQxzE,EAAcC,GACpB,MAAM6/E,EAAS3qF,KAAKyqF,aAAa5/E,EAAEqjC,MAC7B08C,EAAS5qF,KAAKyqF,aAAa3/E,EAAEojC,MAC7Bi3C,EAAWwF,EAAOxG,UAAUyG,GAClC,OAAiB,IAAbzF,EACK7oB,EAAYzxD,EAAE7I,KAAM8I,EAAE9I,MAEtBmjF,CACR,CAEHlG,QAAAA,CAASC,EAAoBl9E,GAC3B,MAAM6oF,EAAYd,GAAa7K,GACzBhxC,EAAO+5C,GAAajI,WAAW4D,YACnC5jF,KAAKwqF,WACLK,GAEF,OAAO,IAAI5M,GAAUj8E,EAAMksC,EAAM,CAEnC8wC,OAAAA,GACE,MAAM9wC,EAAO+5C,GAAajI,WAAW4D,YAAY5jF,KAAKwqF,WAAYnB,IAClE,OAAO,IAAIpL,GAAU5hB,EAAUnuB,EAAM,CAEvCtS,QAAAA,GACE,OAAO+4C,GAAU30E,KAAKwqF,WAAY,GAAGhrF,KAAK,IAAK;;;;;;;;;;;;;;;;GC3C7C,MAAOsrF,WAAmB3M,GAC9BE,OAAAA,CAAQxzE,EAAcC,GACpB,MAAMq6E,EAAWt6E,EAAEqjC,KAAKi2C,UAAUr5E,EAAEojC,MACpC,OAAiB,IAAbi3C,EACK7oB,EAAYzxD,EAAE7I,KAAM8I,EAAE9I,MAEtBmjF,CACR,CAEHpG,WAAAA,CAAY7wC,GACV,OAAO,CAAK,CAEdowC,mBAAAA,CAAoBC,EAAeC,GACjC,OAAQD,EAAQsG,OAAOrG,EAAS,CAElCG,OAAAA,GAEE,OAAQV,GAAkBW,GAAI,CAEhCI,OAAAA,GAEE,OAAQf,GAAkB4L,GAAI,CAGhC5K,QAAAA,CAASC,EAAoBl9E,GAC3B,MAAM6oF,EAAYd,GAAa7K,GAC/B,OAAO,IAAIjB,GAAUj8E,EAAM6oF,EAAW,CAMxCjvD,QAAAA,GACE,MAAO,QAAS,EAIb,MAAMmvD,GAAc,IAAID;;;;;;;;;;;;;;;;GCfzB,SAAUE,GAAYC,GAC1B,MAAO,CAAE5kF,KAAK,QAAmB4kF,eACnC,CAEgB,SAAAC,GACd7H,EACA4H,GAEA,MAAO,CAAE5kF,KAA4B,cAAE4kF,eAAc5H,YACvD,CAEgB,SAAA8H,GACd9H,EACA4H,GAEA,MAAO,CAAE5kF,KAA8B,gBAAE4kF,eAAc5H,YACzD,CAAC,SAEe+H,GACd/H,EACA4H,EACAI,GAEA,MAAO,CACLhlF,KAA8B,gBAC9B4kF,eACA5H,YACAgI,UAEJ,CAEgB,SAAAC,GACdjI,EACA4H,GAEA,MAAO,CAAE5kF,KAA4B,cAAE4kF,eAAc5H,YACvD;;;;;;;;;;;;;;;;GC7CG,MACUkI,GACXxpF,WAAAA,CAA6BypF,GAAA,KAAMA,OAANA,CAAM,CAEnC5H,WAAAA,CACE8G,EACApnF,EACAmoF,EACAC,EACA5oF,EACA6oF,IAEA1tF,EAAAA,EAAAA,IACEysF,EAAK9F,UAAU5kF,KAAKwrF,QACpB,qDAEF,MAAM1+D,EAAW49D,EAAKtH,kBAAkB9/E,GAExC,OACEwpB,EAASw2D,SAASoI,GAAc7G,OAAO4G,EAASnI,SAASoI,KAKrD5+D,EAASviB,YAAckhF,EAASlhF,UAK3BmgF,GAIiB,MAAxBiB,IACEF,EAASlhF,UACPmgF,EAAKnH,SAASjgF,GAChBqoF,EAAqBC,iBACnBT,GAAmB7nF,EAAKwpB,KAG1B7uB,EAAAA,EAAAA,IACEysF,EAAKjI,aACL,uEAGK31D,EAASviB,UAClBohF,EAAqBC,iBAAiBV,GAAiB5nF,EAAKmoF,IAE5DE,EAAqBC,iBACnBR,GAAmB9nF,EAAKmoF,EAAU3+D,KAIpC49D,EAAKjI,cAAgBgJ,EAASlhF,UACzBmgF,EAGAA,EAAKhH,qBAAqBpgF,EAAKmoF,GAAU9G,UAAU3kF,KAAKwrF,QAChE,CAEHK,cAAAA,CACER,EACAS,EACAH,GA6BA,OA3B4B,MAAxBA,IACGN,EAAQ5I,cACX4I,EAAQtH,aAAaqB,IAAgB,CAAC9hF,EAAKmgF,KACpCqI,EAAQvI,SAASjgF,IACpBqoF,EAAqBC,iBACnBT,GAAmB7nF,EAAKmgF,GAE3B,IAGAqI,EAAQrJ,cACXqJ,EAAQ/H,aAAaqB,IAAgB,CAAC9hF,EAAKmgF,KACzC,GAAI4H,EAAQ9H,SAASjgF,GAAM,CACzB,MAAMwpB,EAAWu+D,EAAQjI,kBAAkB9/E,GACtCwpB,EAAS+3D,OAAOpB,IACnBkI,EAAqBC,iBACnBR,GAAmB9nF,EAAKmgF,EAAW32D,GAGxC,MACC6+D,EAAqBC,iBACnBV,GAAiB5nF,EAAKmgF,GAEzB,KAIAqI,EAAQnH,UAAU3kF,KAAKwrF,OAAQ,CAExCtI,cAAAA,CAAemI,EAAehD,GAC5B,OAAIgD,EAAQ9gF,UACH09E,GAAajI,WAEbqL,EAAQnI,eAAemF,EAC/B,CAEH0D,YAAAA,GACE,OAAO,CAAM,CAEfC,gBAAAA,GACE,OAAOhsF,IAAK,CAEd66E,QAAAA,GACE,OAAO76E,KAAKwrF,MAAO;;;;;;;;;;;;;;;;GCjHpB,MACUS,GAaXlqF,WAAAA,CAAY2J,GACV1L,KAAKksF,eAAiB,IAAIX,GAAc7/E,EAAOmvE,YAC/C76E,KAAKwrF,OAAS9/E,EAAOmvE,WACrB76E,KAAKmsF,WAAaF,GAAaG,cAAc1gF,GAC7C1L,KAAKqsF,SAAWJ,GAAaK,YAAY5gF,GACzC1L,KAAKusF,mBAAqB7gF,EAAO8gF,eACjCxsF,KAAKysF,iBAAmB/gF,EAAOghF,aAAc,CAG/CC,YAAAA,GACE,OAAO3sF,KAAKmsF,UAAW,CAGzBS,UAAAA,GACE,OAAO5sF,KAAKqsF,QAAS,CAGvB78D,OAAAA,CAAQ0e,GACN,MAAM2+C,EAAgB7sF,KAAKusF,kBACvBvsF,KAAKwrF,OAAOnN,QAAQr+E,KAAK2sF,eAAgBz+C,IAAS,EAClDluC,KAAKwrF,OAAOnN,QAAQr+E,KAAK2sF,eAAgBz+C,GAAQ,EAC/C4+C,EAAc9sF,KAAKysF,gBACrBzsF,KAAKwrF,OAAOnN,QAAQnwC,EAAMluC,KAAK4sF,eAAiB,EAChD5sF,KAAKwrF,OAAOnN,QAAQnwC,EAAMluC,KAAK4sF,cAAgB,EACnD,OAAOC,GAAiBC,CAAY,CAEtClJ,WAAAA,CACE8G,EACApnF,EACAmoF,EACAC,EACA5oF,EACA6oF,GAKA,OAHK3rF,KAAKwvB,QAAQ,IAAIyuD,GAAU36E,EAAKmoF,MACnCA,EAAWxD,GAAajI,YAEnBhgF,KAAKksF,eAAetI,YACzB8G,EACApnF,EACAmoF,EACAC,EACA5oF,EACA6oF,EACA,CAEJE,cAAAA,CACER,EACAS,EACAH,GAEIG,EAAQrJ,eAEVqJ,EAAU7D,GAAajI,YAEzB,IAAI+M,EAAWjB,EAAQnH,UAAU3kF,KAAKwrF,QAEtCuB,EAAWA,EAAS7J,eAAe+E,GAAajI,YAChD,MAAMx8E,EAAOxD,KAMb,OALA8rF,EAAQ/H,aAAaqB,IAAgB,CAAC9hF,EAAKmgF,KACpCjgF,EAAKgsB,QAAQ,IAAIyuD,GAAU36E,EAAKmgF,MACnCsJ,EAAWA,EAASrJ,qBAAqBpgF,EAAK2kF,GAAajI,YAC5D,IAEIhgF,KAAKksF,eAAeL,eACzBR,EACA0B,EACApB,EACA,CAEJzI,cAAAA,CAAemI,EAAehD,GAE5B,OAAOgD,CAAQ,CAEjBU,YAAAA,GACE,OAAO,CAAK,CAEdC,gBAAAA,GACE,OAAOhsF,KAAKksF,cAAe,CAE7BrR,QAAAA,GACE,OAAO76E,KAAKwrF,MAAO,CAGb,oBAAOY,CAAc1gF,GAC3B,GAAIA,EAAOshF,WAAY,CACrB,MAAMC,EAAYvhF,EAAOwhF,oBACzB,OAAOxhF,EAAOmvE,WAAWoE,SAASvzE,EAAOyhF,qBAAsBF,EAChE,CACC,OAAOvhF,EAAOmvE,WAAW8D,SAC1B,CAGK,kBAAO2N,CAAY5gF,GACzB,GAAIA,EAAO0hF,SAAU,CACnB,MAAMC,EAAU3hF,EAAO4hF,kBACvB,OAAO5hF,EAAOmvE,WAAWoE,SAASvzE,EAAO6hF,mBAAoBF,EAC9D,CACC,OAAO3hF,EAAOmvE,WAAWmE,SAC1B;;;;;;;;;;;;;;;;GC1GF,MACUwO,GAaXzrF,WAAAA,CAAY2J,GAgPJ,KAAsB+hF,uBAAIv/C,GAChCluC,KAAK0tF,SAAW1tF,KAAK2tF,cAAcz/C,GAAQluC,KAAK4tF,gBAAgB1/C,GAE1D,KAAoB2/C,qBAAI3/C,GAC9BluC,KAAK0tF,SAAW1tF,KAAK4tF,gBAAgB1/C,GAAQluC,KAAK2tF,cAAcz/C,GAE1D,KAAA0/C,gBAAmB1/C,IACzB,MAAM4/C,EAAa9tF,KAAKwrF,OAAOnN,QAC7Br+E,KAAK+tF,cAAcpB,eACnBz+C,GAEF,OAAOluC,KAAKusF,kBAAoBuB,GAAc,EAAIA,EAAa,CAAC,EAG1D,KAAAH,cAAiBz/C,IACvB,MAAM4/C,EAAa9tF,KAAKwrF,OAAOnN,QAC7BnwC,EACAluC,KAAK+tF,cAAcnB,cAErB,OAAO5sF,KAAKysF,gBAAkBqB,GAAc,EAAIA,EAAa,CAAC,EAlQ9D9tF,KAAK+tF,cAAgB,IAAI9B,GAAavgF,GACtC1L,KAAKwrF,OAAS9/E,EAAOmvE,WACrB76E,KAAKguF,OAAStiF,EAAOuiF,WACrBjuF,KAAK0tF,UAAYhiF,EAAOwiF,iBACxBluF,KAAKusF,mBAAqB7gF,EAAO8gF,eACjCxsF,KAAKysF,iBAAmB/gF,EAAOghF,aAAc,CAE/C9I,WAAAA,CACE8G,EACApnF,EACAmoF,EACAC,EACA5oF,EACA6oF,GAKA,OAHK3rF,KAAK+tF,cAAcv+D,QAAQ,IAAIyuD,GAAU36E,EAAKmoF,MACjDA,EAAWxD,GAAajI,YAEtB0K,EAAKtH,kBAAkB9/E,GAAKuhF,OAAO4G,GAE9Bf,EACEA,EAAK5G,cAAgB9jF,KAAKguF,OAC5BhuF,KAAK+tF,cACT/B,mBACApI,YACC8G,EACApnF,EACAmoF,EACAC,EACA5oF,EACA6oF,GAGG3rF,KAAKmuF,sBACVzD,EACApnF,EACAmoF,EACA3oF,EACA6oF,EAEH,CAEHE,cAAAA,CACER,EACAS,EACAH,GAEA,IAAIoB,EACJ,GAAIjB,EAAQrJ,cAAgBqJ,EAAQvhF,UAElCwiF,EAAW9E,GAAajI,WAAW2E,UAAU3kF,KAAKwrF,aAElD,GACgB,EAAdxrF,KAAKguF,OAAalC,EAAQhI,eAC1BgI,EAAQlH,UAAU5kF,KAAKwrF,QACvB,CAIA,IAAIl0E,EAFJy1E,EAAW9E,GAAajI,WAAW2E,UAAU3kF,KAAKwrF,QAIhDl0E,EADEtX,KAAK0tF,SACK5B,EAAyB/J,uBACnC/hF,KAAK+tF,cAAcnB,aACnB5sF,KAAKwrF,QAGKM,EAAyBhK,gBACnC9hF,KAAK+tF,cAAcpB,eACnB3sF,KAAKwrF,QAGT,IAAItL,EAAQ,EACZ,MAAO5oE,EAASooE,WAAaQ,EAAQlgF,KAAKguF,OAAQ,CAChD,MAAMv2E,EAAOH,EAASmoE,UACtB,GAAKz/E,KAAKytF,uBAAuBh2E,GAAjC,CAGO,IAAKzX,KAAK6tF,qBAAqBp2E,GAEpC,MAEAs1E,EAAWA,EAASrJ,qBAAqBjsE,EAAKzV,KAAMyV,EAAKy2B,MACzDgyC,GACD,CACF,CACF,KAAM,CAQL,IAAI5oE,EANJy1E,EAAWjB,EAAQnH,UAAU3kF,KAAKwrF,QAElCuB,EAAWA,EAAS7J,eAClB+E,GAAajI,YAKb1oE,EADEtX,KAAK0tF,SACIX,EAAS/K,mBAAmBhiF,KAAKwrF,QAEjCuB,EAASnL,YAAY5hF,KAAKwrF,QAGvC,IAAItL,EAAQ,EACZ,MAAO5oE,EAASooE,UAAW,CACzB,MAAMjoE,EAAOH,EAASmoE,UAChB2O,EACJlO,EAAQlgF,KAAKguF,QACbhuF,KAAKytF,uBAAuBh2E,IAC5BzX,KAAK6tF,qBAAqBp2E,GACxB22E,EACFlO,IAEA6M,EAAWA,EAASrJ,qBAClBjsE,EAAKzV,KACLimF,GAAajI,WAGlB,CACF,CAEH,OAAOhgF,KAAK+tF,cACT/B,mBACAH,eAAeR,EAAS0B,EAAUpB,EAAsB,CAE7DzI,cAAAA,CAAemI,EAAehD,GAE5B,OAAOgD,CAAQ,CAEjBU,YAAAA,GACE,OAAO,CAAK,CAEdC,gBAAAA,GACE,OAAOhsF,KAAK+tF,cAAc/B,kBAAmB,CAE/CnR,QAAAA,GACE,OAAO76E,KAAKwrF,MAAO,CAGb2C,qBAAAA,CACNzD,EACA2D,EACAC,EACAxrF,EACAyrF,GAGA,IAAI3Y,EACJ,GAAI51E,KAAK0tF,SAAU,CACjB,MAAMvI,EAAWnlF,KAAKwrF,OAAOpN,aAC7BxI,EAAMA,CAAC/qE,EAAcC,IAAiBq6E,EAASr6E,EAAGD,EACnD,MACC+qE,EAAM51E,KAAKwrF,OAAOpN,aAEpB,MAAMoQ,EAAgB9D,GACtBzsF,EAAAA,EAAAA,IAAOuwF,EAAc1K,gBAAkB9jF,KAAKguF,OAAQ,IACpD,MAAMS,EAAoB,IAAIxQ,GAAUoQ,EAAUC,GAC5CI,EAAiB1uF,KAAK0tF,SACxBc,EAAczF,cAAc/oF,KAAKwrF,QAChCgD,EAAcvF,aAAajpF,KAAKwrF,QAC/B4C,EAAUpuF,KAAK+tF,cAAcv+D,QAAQi/D,GAC3C,GAAID,EAAcjL,SAAS8K,GAAW,CACpC,MAAMM,EAAeH,EAAcpL,kBAAkBiL,GACrD,IAAIvpD,EAAYhiC,EAAO8rF,mBACrB5uF,KAAKwrF,OACLkD,EACA1uF,KAAK0tF,UAEP,MACe,MAAb5oD,IACCA,EAAU9iC,OAASqsF,GAAYG,EAAcjL,SAASz+C,EAAU9iC,OAKjE8iC,EAAYhiC,EAAO8rF,mBACjB5uF,KAAKwrF,OACL1mD,EACA9kC,KAAK0tF,UAGT,MAAMmB,EACS,MAAb/pD,EAAoB,EAAI8wC,EAAI9wC,EAAW2pD,GACnCK,EACJV,IAAYE,EAAU/jF,WAAaskF,GAAe,EACpD,GAAIC,EAMF,OALyB,MAArBP,GACFA,EAAkB3C,iBAChBR,GAAmBiD,EAAUC,EAAWK,IAGrCH,EAAc9K,qBAAqB2K,EAAUC,GAC/C,CACoB,MAArBC,GACFA,EAAkB3C,iBAChBT,GAAmBkD,EAAUM,IAGjC,MAAMI,EAAgBP,EAAc9K,qBAClC2K,EACApG,GAAajI,YAETgP,EACS,MAAblqD,GAAqB9kC,KAAK+tF,cAAcv+D,QAAQsV,GAClD,OAAIkqD,GACuB,MAArBT,GACFA,EAAkB3C,iBAChBV,GAAiBpmD,EAAU9iC,KAAM8iC,EAAUoJ,OAGxC6gD,EAAcrL,qBACnB5+C,EAAU9iC,KACV8iC,EAAUoJ,OAGL6gD,CAEV,CACF,CAAM,OAAIT,EAAU/jF,UAEZmgF,EACE0D,GACLxY,EAAI8Y,EAAgBD,IAAsB,GACnB,MAArBF,IACFA,EAAkB3C,iBAChBT,GAAmBuD,EAAe1sF,KAAM0sF,EAAexgD,OAEzDqgD,EAAkB3C,iBAChBV,GAAiBmD,EAAUC,KAGxBE,EACJ9K,qBAAqB2K,EAAUC,GAC/B5K,qBAAqBgL,EAAe1sF,KAAMimF,GAAajI,aAKrD0K,CACR;;;;;;;;;;;;;;;;GC3NF,MACUuE,GAAbltF,WAAAA,GACE,KAASmtF,WAAG,EACZ,KAASC,WAAG,EACZ,KAAaC,eAAG,EAChB,KAAA5C,gBAAiB,EACjB,KAAO6C,SAAG,EACV,KAAWC,aAAG,EACd,KAAA5C,eAAgB,EAChB,KAAMsB,OAAG,EACT,KAASuB,UAAG,GACZ,KAAgBC,iBAAmB,KACnC,KAAeC,gBAAG,GAClB,KAAcC,eAAmB,KACjC,KAAaC,cAAG,GAChB,KAAMnE,OAAkBpG,EAAe,CAEvC4H,QAAAA,GACE,OAAOhtF,KAAKmvF,SAAU,CAMxBjB,cAAAA,GACE,MAAuB,KAAnBluF,KAAKuvF,UAKAvvF,KAAKmvF,UAES,MAAdnvF,KAAKuvF,SACb,CAMHpC,kBAAAA,GAEE,OADAlvF,EAAAA,EAAAA,IAAO+B,KAAKmvF,UAAW,oCAChBnvF,KAAKwvF,gBAAiB,CAO/BtC,iBAAAA,GAEE,OADAjvF,EAAAA,EAAAA,IAAO+B,KAAKmvF,UAAW,oCACnBnvF,KAAKovF,cACApvF,KAAKyvF,gBAELrzB,CACR,CAGHgxB,MAAAA,GACE,OAAOptF,KAAKqvF,OAAQ,CAMtB9B,gBAAAA,GAEE,OADAtvF,EAAAA,EAAAA,IAAO+B,KAAKqvF,QAAS,kCACdrvF,KAAK0vF,cAAe,CAO7BpC,eAAAA,GAEE,OADArvF,EAAAA,EAAAA,IAAO+B,KAAKqvF,QAAS,kCACjBrvF,KAAKsvF,YACAtvF,KAAK2vF,cAELtzB,CACR,CAGHuzB,QAAAA,GACE,OAAO5vF,KAAKkvF,SAAU,CAMxBW,gBAAAA,GACE,OAAO7vF,KAAKkvF,WAAgC,KAAnBlvF,KAAKuvF,SAAiB,CAMjDtB,QAAAA,GAEE,OADAhwF,EAAAA,EAAAA,IAAO+B,KAAKkvF,UAAW,oCAChBlvF,KAAKguF,MAAO,CAGrBnT,QAAAA,GACE,OAAO76E,KAAKwrF,MAAO,CAGrBtR,YAAAA,GACE,QAASl6E,KAAKmvF,WAAanvF,KAAKqvF,SAAWrvF,KAAKkvF,UAAW,CAG7DjV,SAAAA,GACE,OAAOj6E,KAAKk6E,gBAAkBl6E,KAAKwrF,SAAWpG,EAAe,CAG/DnF,IAAAA,GACE,MAAMA,EAAO,IAAIgP,GAejB,OAdAhP,EAAKiP,UAAYlvF,KAAKkvF,UACtBjP,EAAK+N,OAAShuF,KAAKguF,OACnB/N,EAAKkP,UAAYnvF,KAAKmvF,UACtBlP,EAAKuM,eAAiBxsF,KAAKwsF,eAC3BvM,EAAKuP,iBAAmBxvF,KAAKwvF,iBAC7BvP,EAAKmP,cAAgBpvF,KAAKovF,cAC1BnP,EAAKwP,gBAAkBzvF,KAAKyvF,gBAC5BxP,EAAKoP,QAAUrvF,KAAKqvF,QACpBpP,EAAKyM,cAAgB1sF,KAAK0sF,cAC1BzM,EAAKyP,eAAiB1vF,KAAK0vF,eAC3BzP,EAAKqP,YAActvF,KAAKsvF,YACxBrP,EAAK0P,cAAgB3vF,KAAK2vF,cAC1B1P,EAAKuL,OAASxrF,KAAKwrF,OACnBvL,EAAKsP,UAAYvvF,KAAKuvF,UACftP,CAAK,EAIV,SAAU6P,GAAyBC,GACvC,OAAIA,EAAY7V,eACP,IAAIqR,GAAcwE,EAAYlV,YAC5BkV,EAAYH,WACd,IAAIpC,GAAcuC,GAElB,IAAI9D,GAAa8D,EAE5B,CAyHM,SAAUC,GACdD,GAEA,MAAME,EAAsC,CAAC,EAE7C,GAAIF,EAAY9V,YACd,OAAOgW,EAGT,IAAIC,EAaJ,GAZIH,EAAYvE,SAAWpG,GACzB8K,EAAO,YACEH,EAAYvE,SAAWT,GAChCmF,EAAO,SACEH,EAAYvE,SAAWrM,GAChC+Q,EAAO,SAEPjyF,EAAAA,EAAAA,IAAO8xF,EAAYvE,kBAAkBjB,GAAW,4BAChD2F,EAAUH,EAAYvE,OAAO5vD,YAE/Bq0D,EAAG,YAAiC7oF,EAAAA,EAAAA,GAAU8oF,GAE1CH,EAAYZ,UAAW,CACzB,MAAMgB,EAAaJ,EAAYvD,eAC5B,aACD,UACFyD,EAAGE,IAAc/oF,EAAAA,EAAAA,GAAU2oF,EAAYP,kBACnCO,EAAYX,gBACda,EAAGE,IAAe,KAAM/oF,EAAAA,EAAAA,GAAU2oF,EAAYN,iBAEjD,CAED,GAAIM,EAAYV,QAAS,CACvB,MAAMe,EAAWL,EAAYrD,cAC1B,YACD,QACFuD,EAAGG,IAAYhpF,EAAAA,EAAAA,GAAU2oF,EAAYL,gBACjCK,EAAYT,cACdW,EAAGG,IAAa,KAAMhpF,EAAAA,EAAAA,GAAU2oF,EAAYJ,eAE/C,CAUD,OARII,EAAYb,YACVa,EAAY7B,iBACd+B,EAAuC,gBAAGF,EAAY/B,OAEtDiC,EAAsC,eAAGF,EAAY/B,QAIlDiC,CACT,CAEM,SAAUI,GACdN,GAEA,MAAM3lF,EAA+B,CAAC,EAmBtC,GAlBI2lF,EAAYZ,YACd/kF,EAA8C,MAC5C2lF,EAAYP,iBACVO,EAAYX,gBACdhlF,EAA6C,MAC3C2lF,EAAYN,iBAEhBrlF,EAAqD,QAClD2lF,EAAYvD,gBAEbuD,EAAYV,UACdjlF,EAA4C,MAAG2lF,EAAYL,eACvDK,EAAYT,cACdllF,EAA2C,MAAG2lF,EAAYJ,eAE5DvlF,EAAmD,QAChD2lF,EAAYrD,eAEbqD,EAAYb,UAAW,CACzB9kF,EAAkC,KAAG2lF,EAAY/B,OACjD,IAAIsC,EAAWP,EAAYR,UACV,KAAbe,IAEAA,EADEP,EAAY7B,iBACN,IAEA,KAGZ9jF,EAAI,MAAqCkmF,CAC1C,CAKD,OAHIP,EAAYvE,SAAWpG,KACzBh7E,EAAI,KAAiC2lF,EAAYvE,OAAO5vD,YAEnDxxB,CACT;;;;;;;;;;;;;;;;GClYM,MAAOmmF,WAA2Bne,GA8BtCrwE,WAAAA,CACU2sE,EACA4I,EAMAG,EACAC,GAER9uE,QAVQ,KAAS8lE,UAATA,EACA,KAAa4I,cAAbA,EAMA,KAAkBG,mBAAlBA,EACA,KAAsBC,uBAAtBA,EAjCF,KAAApS,KAAqC/J,EAAW,WAMhD,KAAQi1B,SAA4B,CAAC,CAAE,CAX/C1d,WAAAA,CAAYC,GACV,MAAM,IAAI10E,MAAM,0BAA2B,CAY7C,mBAAOoyF,CAAapyB,EAAqBxwB,GACvC,YAAYjrC,IAARirC,EACK,OAASA,IAEhB5vC,EAAAA,EAAAA,IACEogE,EAAM2b,aAAaC,YACnB,kDAEK5b,EAAME,MAAM3iC,WACpB,CAsBHg+C,MAAAA,CACEvb,EACAwb,EACAhsC,EACAykC,GAEA,MAAMD,EAAahU,EAAME,MAAM3iC,WAC/B57B,KAAKslE,KAAK,qBAAuB+M,EAAa,IAAMhU,EAAM0b,kBAG1D,MAAM2W,EAAWH,GAAmBE,aAAapyB,EAAOxwB,GAClD8iD,EAAa,CAAC,EACpB3wF,KAAKwwF,SAASE,GAAYC,EAE1B,MAAMC,EAAwBZ,GAC5B3xB,EAAM2b,cAGRh6E,KAAK6wF,aACHxe,EAAa,QACbue,GACA,CAACpuF,EAAO2F,KACN,IAAIkB,EAAOlB,EAWX,GATc,MAAV3F,IACF6G,EAAO,KACP7G,EAAQ,MAGI,OAAVA,GACFxC,KAAKs3E,cAAcjF,EAAYhpE,GAAmB,EAAOwkC,IAGvDvjC,EAAAA,EAAAA,IAAQtK,KAAKwwF,SAAUE,KAAcC,EAAY,CACnD,IAAIpW,EAIFA,EAHG/3E,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOX8vE,EAAWiI,EAAQ,KACpB,IAEH,CAIJ5uB,QAAAA,CAAS0S,EAAqBxwB,GAC5B,MAAM6iD,EAAWH,GAAmBE,aAAapyB,EAAOxwB,UACjD7tC,KAAKwwF,SAASE,EAAU,CAGjC1/E,GAAAA,CAAIqtD,GACF,MAAMuyB,EAAwBZ,GAC5B3xB,EAAM2b,cAGF3H,EAAahU,EAAME,MAAM3iC,WAEzBo7B,EAAW,IAAIzxD,EAAAA,GA0BrB,OAxBAvF,KAAK6wF,aACHxe,EAAa,QACbue,GACA,CAACpuF,EAAO2F,KACN,IAAIkB,EAAOlB,EAEG,MAAV3F,IACF6G,EAAO,KACP7G,EAAQ,MAGI,OAAVA,GACFxC,KAAKs3E,cACHjF,EACAhpE,GACa,EACJ,MAEX2tD,EAASvxD,QAAQ4D,IAEjB2tD,EAASxxD,OAAO,IAAInH,MAAMgL,GAC3B,IAGE2tD,EAAStxD,OAAQ,CAI1B+sE,gBAAAA,CAAiBzsE,G,CAQT6qF,YAAAA,CACNxe,EACAue,EAA0D,GAC1D/qF,GAIA,OAFA+qF,EAAsB,UAAY,SAE3BjrF,QAAQ++C,IAAI,CACjB1kD,KAAKy3E,mBAAmBnY,UAA2B,GACnDt/D,KAAK03E,uBAAuBpY,UAA2B,KACtD7hD,MAAK,EAAEunD,EAAWD,MACfC,GAAaA,EAAU1E,cACzBswB,EAAsB,QAAU5rB,EAAU1E,aAExCyE,GAAiBA,EAAc/+D,QACjC4qF,EAAsB,MAAQ7rB,EAAc/+D,OAG9C,MAAM8jE,GACH9pE,KAAK0uE,UAAUtN,OAAS,WAAa,WACtCphE,KAAK0uE,UAAU3pE,KACfstE,EAFA,OAKAryE,KAAK0uE,UAAUt1C,WACf5tB,EAAAA,EAAAA,IAAYolF,GAEd5wF,KAAKslE,KAAK,4BAA8BwE,GACxC,MAAMgnB,EAAM,IAAIC,eAChBD,EAAIvmB,mBAAqB,KACvB,GAAI1kE,GAA+B,IAAnBirF,EAAI70B,WAAkB,CACpCj8D,KAAKslE,KACH,qBAAuBwE,EAAM,qBAC7BgnB,EAAIvW,OACJ,YACAuW,EAAIE,cAEN,IAAIrmF,EAAM,KACV,GAAImmF,EAAIvW,QAAU,KAAOuW,EAAIvW,OAAS,IAAK,CACzC,IACE5vE,GAAMf,EAAAA,EAAAA,IAASknF,EAAIE,aACpB,CAAC,MAAO1uF,GACPmwD,EACE,qCACEqX,EACA,KACAgnB,EAAIE,aAET,CACDnrF,EAAS,KAAM8E,EAChB,MAEoB,MAAfmmF,EAAIvW,QAAiC,MAAfuW,EAAIvW,QAC5B9nB,EACE,sCACEqX,EACA,YACAgnB,EAAIvW,QAGV10E,EAASirF,EAAIvW,QAEf10E,EAAW,IACZ,GAGHirF,EAAI7oF,KAAK,MAAO6hE,GAAuB,GACvCgnB,EAAIlpB,MAAM,GACT;;;;;;;;;;;;;;;;GCpOJ,MACUqpB,GAAblvF,WAAAA,GACU,KAAAmvF,UAAkBjJ,GAAajI,UAAW,CAElDmR,OAAAA,CAAQpoE,GACN,OAAO/oB,KAAKkxF,UAAU5N,SAASv6D,EAAM,CAGvCqoE,cAAAA,CAAeroE,EAAYsoE,GACzBrxF,KAAKkxF,UAAYlxF,KAAKkxF,UAAUtN,YAAY76D,EAAMsoE,EAAiB;;;;;;;;;;;;;;;;GCjBpE,SAcaC,KACd,MAAO,CACL5uF,MAAO,KACPoiB,SAAU,IAAI1S,IAElB,CAmCG,SACam/E,GACdC,EACAzoE,EACA1f,GAEA,GAAI6rE,GAAYnsD,GACdyoE,EAAmB9uF,MAAQ2G,EAC3BmoF,EAAmB1sE,SAASjO,aACvB,GAAiC,OAA7B26E,EAAmB9uF,MAC5B8uF,EAAmB9uF,MAAQ8uF,EAAmB9uF,MAAMkhF,YAAY76D,EAAM1f,OACjE,CACL,MAAMglF,EAAW/Z,GAAavrD,GACzByoE,EAAmB1sE,SAAS7P,IAAIo5E,IACnCmD,EAAmB1sE,SAASlT,IAAIy8E,EAAUiD,MAG5C,MAAMjlE,EAAQmlE,EAAmB1sE,SAAS9T,IAAIq9E,GAC9CtlE,EAAOyrD,GAAazrD,GACpBwoE,GAA2BllE,EAAOtD,EAAM1f,EACzC,CACH,CAyDG,SACaooF,GACdD,EACAE,EACAxuC,GAEiC,OAA7BsuC,EAAmB9uF,MACrBwgD,EAAKwuC,EAAYF,EAAmB9uF,OAEpCivF,GAA+BH,GAAoB,CAACluF,EAAKsuF,KACvD,MAAM7oE,EAAO,IAAIgrD,GAAK2d,EAAW91D,WAAa,IAAMt4B,GACpDmuF,GAA8BG,EAAM7oE,EAAMm6B,EAAK,GAGrD,CAQgB,SAAAyuC,GACdH,EACAtuC,GAEAsuC,EAAmB1sE,SAASlZ,SAAQ,CAACgmF,EAAMtuF,KACzC4/C,EAAK5/C,EAAKsuF,EAAK,GAEnB;;;;;;;;;;;;;;;;GCvJG,MACUC,GAGX9vF,WAAAA,CAAoB+vF,GAAA,KAAWA,YAAXA,EAFZ,KAAKC,MAAmC,IAAK,CAIrD/gF,GAAAA,GACE,MAAMghF,EAAWhyF,KAAK8xF,YAAY9gF,MAE5B0sE,EAAK36E,OAAA4D,OAAA,GAAQqrF,GAQnB,OAPIhyF,KAAK+xF,OACP/0B,EAAKh9D,KAAK+xF,OAAO,CAAC7vC,EAAcx/C,KAC9Bg7E,EAAMx7B,GAAQw7B,EAAMx7B,GAAQx/C,CAAK,IAGrC1C,KAAK+xF,MAAQC,EAENtU,CAAM;;;;;;;;;;;;;;;;GCdjB,MAAMuU,GAAuB,IACvBC,GAAuB,IAGvBC,GAAwB,IAAc,MAE/BC,GAIXrwF,WAAAA,CAAYswF,EAAqCC,GAAA,KAAOA,QAAPA,EAFjD,KAAcC,eAA6B,CAAC,EAG1CvyF,KAAKwyF,eAAiB,IAAIX,GAAcQ,GAExC,MAAMvgD,EACJmgD,IACCC,GAAuBD,IAAwBrtD,KAAK6jB,SACvDsW,EAAsB/+D,KAAKyyF,aAAa/0E,KAAK1d,MAAO4kC,KAAKihB,MAAM/T,GAAU,CAGnE2gD,YAAAA,GACN,MAAM1f,EAAQ/yE,KAAKwyF,eAAexhF,MAC5B0hF,EAA8B,CAAC,EACrC,IAAIC,GAAoB,EAExB31B,EAAK+V,GAAO,CAAC7wB,EAAcx/C,KACrBA,EAAQ,IAAKyH,EAAAA,EAAAA,IAASnK,KAAKuyF,eAAgBrwC,KAC7CwwC,EAAcxwC,GAAQx/C,EACtBiwF,GAAoB,EACrB,IAGCA,GACF3yF,KAAKsyF,QAAQxf,YAAY4f,GAI3B3zB,EACE/+D,KAAKyyF,aAAa/0E,KAAK1d,MACvB4kC,KAAKihB,MAAsB,EAAhBjhB,KAAK6jB,SAAe0pC,IAC/B;;;;;;;;;;;;;;;;GC5CN,IAAYS,GAKX,SAsBeC,KACd,MAAO,CACLC,UAAU,EACVC,YAAY,EACZjZ,QAAS,KACTkZ,QAAQ,EAEZ,CAAC,SAEeC,KACd,MAAO,CACLH,UAAU,EACVC,YAAY,EACZjZ,QAAS,KACTkZ,QAAQ,EAEZ,CAEM,SAAUE,GACdpZ,GAEA,MAAO,CACLgZ,UAAU,EACVC,YAAY,EACZjZ,UACAkZ,QAAQ,EAEZ;;;;;;;;;;;;;;;;IAtDA,SAAYJ,GACVA,EAAAA,EAAA,4BACAA,EAAAA,EAAA,oBACAA,EAAAA,EAAA,sCACAA,EAAAA,EAAA,uCACD,EALD,CAAYA,KAAAA,GAKX,KCbE,MAeUO,GAUXpxF,WAAAA,CAC4BgnB,EACAqqE,EACAC,GAFA,KAAItqE,KAAJA,EACA,KAAYqqE,aAAZA,EACA,KAAMC,OAANA,EAX5B,KAAAhtF,KAAOusF,GAAcU,eAGrB,KAAMxwF,OAAG+vF,IAAyB,CAUlCU,iBAAAA,CAAkBlQ,GAChB,GAAKnO,GAAYl1E,KAAK+oB,MAUf,IAA+B,MAA3B/oB,KAAKozF,aAAa1wF,MAM3B,OALAzE,EAAAA,EAAAA,IACE+B,KAAKozF,aAAatuE,SAASva,UAC3B,4DAGKvK,KACF,CACL,MAAMwmF,EAAYxmF,KAAKozF,aAAaI,QAAQ,IAAIzf,GAAKsP,IACrD,OAAO,IAAI8P,GAAa9e,KAAgBmS,EAAWxmF,KAAKqzF,OACzD,EAfC,OAJAp1F,EAAAA,EAAAA,IACEq2E,GAAat0E,KAAK+oB,QAAUs6D,EAC5B,iDAEK,IAAI8P,GACT3e,GAAax0E,KAAK+oB,MAClB/oB,KAAKozF,aACLpzF,KAAKqzF,OAYR;;;;;;;;;;;;;;;;GCnDF,MAMUI,GAIX1xF,WAAAA,CAAmBe,EAAgCimB,GAAhC,KAAMjmB,OAANA,EAAgC,KAAIimB,KAAJA,EAFnD,KAAA1iB,KAAOusF,GAAcc,eAAgB,CAIrCH,iBAAAA,CAAkBlQ,GAChB,OAAInO,GAAYl1E,KAAK+oB,MACZ,IAAI0qE,GAAezzF,KAAK8C,OAAQuxE,MAEhC,IAAIof,GAAezzF,KAAK8C,OAAQ0xE,GAAax0E,KAAK+oB,MAC1D;;;;;;;;;;;;;;;;GCjBF,MAOU4qE,GAIX5xF,WAAAA,CACSe,EACAimB,EACA2hE,GAFA,KAAM5nF,OAANA,EACA,KAAIimB,KAAJA,EACA,KAAI2hE,KAAJA,EALT,KAAArkF,KAAOusF,GAAcgB,SAAU,CAQ/BL,iBAAAA,CAAkBlQ,GAChB,OAAInO,GAAYl1E,KAAK+oB,MACZ,IAAI4qE,GACT3zF,KAAK8C,OACLuxE,KACAr0E,KAAK0qF,KAAKtH,kBAAkBC,IAGvB,IAAIsQ,GAAU3zF,KAAK8C,OAAQ0xE,GAAax0E,KAAK+oB,MAAO/oB,KAAK0qF,KACjE;;;;;;;;;;;;;;;;GC1BF,MAiBUmJ,GAIX9xF,WAAAA,CAC4Be,EACAimB,EACAjE,GAFA,KAAMhiB,OAANA,EACA,KAAIimB,KAAJA,EACA,KAAQjE,SAARA,EAL5B,KAAAze,KAAOusF,GAAckB,KAAM,CAO3BP,iBAAAA,CAAkBlQ,GAChB,GAAInO,GAAYl1E,KAAK+oB,MAAO,CAC1B,MAAMy9D,EAAYxmF,KAAK8kB,SAAS0uE,QAAQ,IAAIzf,GAAKsP,IACjD,OAAImD,EAAUj8E,UAEL,KACEi8E,EAAU9jF,MAEZ,IAAIixF,GAAU3zF,KAAK8C,OAAQuxE,KAAgBmS,EAAU9jF,OAGrD,IAAImxF,GAAM7zF,KAAK8C,OAAQuxE,KAAgBmS,EAEjD,CAKC,OAJAvoF,EAAAA,EAAAA,IACEq2E,GAAat0E,KAAK+oB,QAAUs6D,EAC5B,kEAEK,IAAIwQ,GAAM7zF,KAAK8C,OAAQ0xE,GAAax0E,KAAK+oB,MAAO/oB,KAAK8kB,SAC7D,CAEH8W,QAAAA,GACE,MACE,aACA57B,KAAK+oB,KACL,KACA/oB,KAAK8C,OAAO84B,WACZ,WACA57B,KAAK8kB,SAAS8W,WACd,GAAG;;;;;;;;;;;;;;;;GC7CN,MACUm4D,GACXhyF,WAAAA,CACUiyF,EACAC,EACAC,GAFA,KAAKF,MAALA,EACA,KAAiBC,kBAAjBA,EACA,KAASC,UAATA,CAAS,CAMnBC,kBAAAA,GACE,OAAOn0F,KAAKi0F,iBAAkB,CAMhCG,UAAAA,GACE,OAAOp0F,KAAKk0F,SAAU,CAGxBG,iBAAAA,CAAkBtrE,GAChB,GAAImsD,GAAYnsD,GACd,OAAO/oB,KAAKm0F,uBAAyBn0F,KAAKk0F,UAG5C,MAAM7F,EAAW/Z,GAAavrD,GAC9B,OAAO/oB,KAAKs0F,mBAAmBjG,EAAU,CAG3CiG,kBAAAA,CAAmBhxF,GACjB,OACGtD,KAAKm0F,uBAAyBn0F,KAAKk0F,WAAcl0F,KAAKg0F,MAAMzQ,SAASjgF,EAAI,CAI9E6tF,OAAAA,GACE,OAAOnxF,KAAKg0F,KAAM;;;;;;;;;;;;;;;;GChCnB,MACUO,GAGXxyF,WAAAA,CAAmByyF,GAAA,KAAMA,OAANA,EACjBx0F,KAAKwrF,OAASxrF,KAAKw0F,OAAOxa,aAAaa,UAAW,EAahD,SAAU4Z,GACdC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAkB,GAClBC,EAAkB,GAuDxB,OArDAJ,EAAQ/oF,SAAQopF,IAE4B,kBAAxCA,EAAO3uF,MACPquF,EAAelJ,OAAOlN,oBACpB0W,EAAO3J,QACP2J,EAAO/J,eAGT8J,EAAM1zF,KAAKiqF,GAAiB0J,EAAO3R,UAAW2R,EAAO/J,cACtD,IAGHgK,GACEP,EACAI,EAAO,gBAEPH,EACAE,EACAD,GAEFK,GACEP,EACAI,EAAO,cAEPH,EACAE,EACAD,GAEFK,GACEP,EACAI,EAAO,cAEPC,EACAF,EACAD,GAEFK,GACEP,EACAI,EAAO,gBAEPH,EACAE,EACAD,GAEFK,GACEP,EACAI,EAAO,QAEPH,EACAE,EACAD,GAGKE,CACT,CAKA,SAASG,GACPP,EACAI,EACA3hB,EACAwhB,EACAO,EACAN,GAEA,MAAMO,EAAkBR,EAAQhhF,QAAOqhF,GAAUA,EAAO3uF,OAAS8sE,IAEjEgiB,EAAgBl2E,MAAK,CAACpU,EAAGC,IACvBsqF,GAA6BV,EAAgB7pF,EAAGC,KAElDqqF,EAAgBvpF,SAAQopF,IACtB,MAAMK,EAAqBC,GACzBZ,EACAM,EACAJ,GAEFM,EAActpF,SAAQ2pF,IAChBA,EAAaC,WAAWR,EAAO3uF,OACjCyuF,EAAOzzF,KACLk0F,EAAaE,YAAYJ,EAAoBX,EAAeF,QAE/D,GACD,GAEN,CAEA,SAASc,GACPZ,EACAM,EACAJ,GAEA,MAAoB,UAAhBI,EAAO3uF,MAAoC,kBAAhB2uF,EAAO3uF,OAGpC2uF,EAAOU,SAAWd,EAAWpR,wBAC3BwR,EAAO3R,UACP2R,EAAO/J,aACPyJ,EAAelJ,SALVwJ,CASX,CAEA,SAASI,GACPV,EACA7pF,EACAC,GAEA,GAAmB,MAAfD,EAAEw4E,WAAoC,MAAfv4E,EAAEu4E,UAC3B,MAAMjlF,EAAAA,EAAAA,IAAe,sCAEvB,MAAMu3F,EAAW,IAAI1X,GAAUpzE,EAAEw4E,UAAWx4E,EAAEogF,cACxC2K,EAAW,IAAI3X,GAAUnzE,EAAEu4E,UAAWv4E,EAAEmgF,cAC9C,OAAOyJ,EAAelJ,OAAOnN,QAAQsX,EAAUC,EACjD;;;;;;;;;;;;;;;;GC/IgB,SAAAC,GACdjB,EACAkB,GAEA,MAAO,CAAElB,aAAYkB,cACvB,CAEM,SAAUC,GACdC,EACAC,EACAlqC,EACAghC,GAEA,OAAO8I,GACL,IAAI9B,GAAUkC,EAAWlqC,EAAUghC,GACnCiJ,EAAUF,YAEd,CAEM,SAAUI,GACdF,EACAG,EACApqC,EACAghC,GAEA,OAAO8I,GACLG,EAAUpB,WACV,IAAIb,GAAUoC,EAAYpqC,EAAUghC,GAExC,CAEM,SAAUqJ,GACdJ,GAEA,OAAOA,EAAUpB,WAAWT,qBACxB6B,EAAUpB,WAAWzD,UACrB,IACN,CAEM,SAAUkF,GACdL,GAEA,OAAOA,EAAUF,YAAY3B,qBACzB6B,EAAUF,YAAY3E,UACtB,IACN;;;;;;;;;;;;;;;;GChDA,IAAImF,GAMJ,MAAMC,GAAgBA,KACfD,KACHA,GAAyB,IAAIvW,GAC3BrjB,IAGG45B,IAKN,MACUE,GASXz0F,WAAAA,CACkBW,EACAoiB,EAGZyxE,MAJY,KAAK7zF,MAALA,EACA,KAAQoiB,SAARA,CAAQ,CAV1B,iBAAO2xE,CAAcrsF,GACnB,IAAIwnF,EAAyB,IAAI4E,GAAiB,MAIlD,OAHAx5B,EAAK5yD,GAAK,CAACssF,EAAmBpI,KAC5BsD,EAAOA,EAAKhgF,IAAI,IAAImiE,GAAK2iB,GAAYpI,EAAU,IAE1CsD,CAAK,CAcdrnF,OAAAA,GACE,OAAsB,OAAfvK,KAAK0C,OAAkB1C,KAAK8kB,SAASva,SAAU,CAaxDosF,gCAAAA,CACEC,EACAC,GAEA,GAAkB,MAAd72F,KAAK0C,OAAiBm0F,EAAU72F,KAAK0C,OACvC,MAAO,CAAEqmB,KAAMsrD,KAAgB3xE,MAAO1C,KAAK0C,OAE3C,GAAIwyE,GAAY0hB,GACd,OAAO,KACF,CACL,MAAM/S,EAAQvP,GAAasiB,GACrBvqE,EAAQrsB,KAAK8kB,SAAS9T,IAAI6yE,GAChC,GAAc,OAAVx3D,EAAgB,CAClB,MAAMyqE,EACJzqE,EAAMsqE,iCACJniB,GAAaoiB,GACbC,GAEJ,GAAiC,MAA7BC,EAAmC,CACrC,MAAMC,EAAWhiB,GACf,IAAIhB,GAAK8P,GACTiT,EAA0B/tE,MAE5B,MAAO,CAAEA,KAAMguE,EAAUr0F,MAAOo0F,EAA0Bp0F,MAC3D,CACC,OAAO,IAEV,CACC,OAAO,IAEV,CACF,CAOHs0F,wBAAAA,CACEJ,GAEA,OAAO52F,KAAK22F,iCAAiCC,GAAc,KAAM,GAAM,CAMzEpD,OAAAA,CAAQoD,GACN,GAAI1hB,GAAY0hB,GACd,OAAO52F,KACF,CACL,MAAM6jF,EAAQvP,GAAasiB,GACrBpQ,EAAYxmF,KAAK8kB,SAAS9T,IAAI6yE,GACpC,OAAkB,OAAd2C,EACKA,EAAUgN,QAAQhf,GAAaoiB,IAE/B,IAAIJ,GAAiB,KAE/B,EAUH5kF,GAAAA,CAAIglF,EAAoBK,GACtB,GAAI/hB,GAAY0hB,GACd,OAAO,IAAIJ,GAAcS,EAAOj3F,KAAK8kB,UAChC,CACL,MAAM++D,EAAQvP,GAAasiB,GACrBvqE,EAAQrsB,KAAK8kB,SAAS9T,IAAI6yE,IAAU,IAAI2S,GAAiB,MACzD/K,EAAWp/D,EAAMza,IAAI4iE,GAAaoiB,GAAeK,GACjD50D,EAAcriC,KAAK8kB,SAASkZ,OAAO6lD,EAAO4H,GAChD,OAAO,IAAI+K,GAAcx2F,KAAK0C,MAAO2/B,EACtC,EASH3Z,MAAAA,CAAOkuE,GACL,GAAI1hB,GAAY0hB,GACd,OAAI52F,KAAK8kB,SAASva,UACT,IAAIisF,GAAiB,MAErB,IAAIA,GAAc,KAAMx2F,KAAK8kB,UAEjC,CACL,MAAM++D,EAAQvP,GAAasiB,GACrBvqE,EAAQrsB,KAAK8kB,SAAS9T,IAAI6yE,GAChC,GAAIx3D,EAAO,CACT,MAAMo/D,EAAWp/D,EAAM3D,OAAO8rD,GAAaoiB,IAC3C,IAAIv0D,EAMJ,OAJEA,EADEopD,EAASlhF,UACGvK,KAAK8kB,SAAS4D,OAAOm7D,GAErB7jF,KAAK8kB,SAASkZ,OAAO6lD,EAAO4H,GAEzB,OAAfzrF,KAAK0C,OAAkB2/B,EAAY93B,UAC9B,IAAIisF,GAAiB,MAErB,IAAIA,GAAcx2F,KAAK0C,MAAO2/B,EAExC,CACC,OAAOriC,IAEV,EASHgR,GAAAA,CAAI4lF,GACF,GAAI1hB,GAAY0hB,GACd,OAAO52F,KAAK0C,MACP,CACL,MAAMmhF,EAAQvP,GAAasiB,GACrBvqE,EAAQrsB,KAAK8kB,SAAS9T,IAAI6yE,GAChC,OAAIx3D,EACKA,EAAMrb,IAAIwjE,GAAaoiB,IAEvB,IAEV,EAUHM,OAAAA,CAAQN,EAAoBO,GAC1B,GAAIjiB,GAAY0hB,GACd,OAAOO,EACF,CACL,MAAMtT,EAAQvP,GAAasiB,GACrBvqE,EAAQrsB,KAAK8kB,SAAS9T,IAAI6yE,IAAU,IAAI2S,GAAiB,MACzD/K,EAAWp/D,EAAM6qE,QAAQ1iB,GAAaoiB,GAAeO,GAC3D,IAAI90D,EAMJ,OAJEA,EADEopD,EAASlhF,UACGvK,KAAK8kB,SAAS4D,OAAOm7D,GAErB7jF,KAAK8kB,SAASkZ,OAAO6lD,EAAO4H,GAErC,IAAI+K,GAAcx2F,KAAK0C,MAAO2/B,EACtC,EAQH+0D,IAAAA,CAAQ3sF,GACN,OAAOzK,KAAKq3F,MAAMhjB,KAAgB5pE,EAAI,CAMhC4sF,KAAAA,CACNC,EACA7sF,GAEA,MAAM8sF,EAA4B,CAAC,EAMnC,OALAv3F,KAAK8kB,SAASq7D,kBACZ,CAACkO,EAAkB7H,KACjB+Q,EAAMlJ,GAAY7H,EAAU6Q,MAAMtiB,GAAUuiB,EAAWjJ,GAAW5jF,EAAG,IAGlEA,EAAG6sF,EAAWt3F,KAAK0C,MAAO60F,EAAO,CAM1CC,UAAAA,CAAczuE,EAAYlc,GACxB,OAAO7M,KAAKy3F,YAAY1uE,EAAMsrD,KAAgBxnE,EAAG,CAG3C4qF,WAAAA,CACNC,EACAJ,EACAzqF,GAEA,MAAM1E,IAASnI,KAAK0C,OAAQmK,EAAEyqF,EAAWt3F,KAAK0C,OAC9C,GAAIyF,EACF,OAAOA,EAEP,GAAI+sE,GAAYwiB,GACd,OAAO,KACF,CACL,MAAM7T,EAAQvP,GAAaojB,GACrB5yD,EAAY9kC,KAAK8kB,SAAS9T,IAAI6yE,GACpC,OAAI/+C,EACKA,EAAU2yD,YACfjjB,GAAakjB,GACb3iB,GAAUuiB,EAAWzT,GACrBh3E,GAGK,IAEV,CACF,CAGH8qF,aAAAA,CACE5uE,EACAlc,GAEA,OAAO7M,KAAK43F,eAAe7uE,EAAMsrD,KAAgBxnE,EAAG,CAG9C+qF,cAAAA,CACNF,EACAG,EACAhrF,GAEA,GAAIqoE,GAAYwiB,GACd,OAAO13F,KACF,CACDA,KAAK0C,OACPmK,EAAEgrF,EAAqB73F,KAAK0C,OAE9B,MAAMmhF,EAAQvP,GAAaojB,GACrB5yD,EAAY9kC,KAAK8kB,SAAS9T,IAAI6yE,GACpC,OAAI/+C,EACKA,EAAU8yD,eACfpjB,GAAakjB,GACb3iB,GAAU8iB,EAAqBhU,GAC/Bh3E,GAGK,IAAI2pF,GAAiB,KAE/B,EASHsB,OAAAA,CAAQjrF,GACN7M,KAAK+3F,SAAS1jB,KAAgBxnE,EAAG,CAG3BkrF,QAAAA,CACNF,EACAhrF,GAEA7M,KAAK8kB,SAASq7D,kBAAiB,CAACkD,EAAWmD,KACzCA,EAAUuR,SAAShjB,GAAU8iB,EAAqBxU,GAAYx2E,EAAE,IAE9D7M,KAAK0C,OACPmK,EAAEgrF,EAAqB73F,KAAK0C,MAC7B,CAGHs1F,YAAAA,CAAanrF,GACX7M,KAAK8kB,SAASq7D,kBACZ,CAACkD,EAAmBmD,KACdA,EAAU9jF,OACZmK,EAAEw2E,EAAWmD,EAAU9jF,MACxB,GAEH;;;;;;;;;;;;;;;;GClUH,MACUu1F,GACXl2F,WAAAA,CAAmBm2F,GAAA,KAAUA,WAAVA,CAAU,CAE7B,YAAOC,GACL,OAAO,IAAIF,GAAc,IAAIzB,GAAc,MAAO,EAErD,SAEe4B,GACdC,EACAtvE,EACAmlB,GAEA,GAAIgnC,GAAYnsD,GACd,OAAO,IAAIkvE,GAAc,IAAIzB,GAActoD,IACtC,CACL,MAAMoqD,EAAWD,EAAcH,WAAWlB,yBAAyBjuE,GACnE,GAAgB,MAAZuvE,EAAkB,CACpB,MAAMC,EAAeD,EAASvvE,KAC9B,IAAIrmB,EAAQ41F,EAAS51F,MACrB,MAAMk0F,EAAezhB,GAAgBojB,EAAcxvE,GAEnD,OADArmB,EAAQA,EAAMkhF,YAAYgT,EAAc1oD,GACjC,IAAI+pD,GACTI,EAAcH,WAAWtmF,IAAI2mF,EAAc71F,GAE9C,CAAM,CACL,MAAM8wF,EAAU,IAAIgD,GAActoD,GAC5BsqD,EAAeH,EAAcH,WAAWhB,QAAQnuE,EAAMyqE,GAC5D,OAAO,IAAIyE,GAAcO,EAC1B,CACF,CACH,CAAC,SAEeC,GACdJ,EACAtvE,EACA2vE,GAEA,IAAIC,EAAWN,EAIf,OAHAr7B,EAAK07B,GAAS,CAACrK,EAAkBngD,KAC/ByqD,EAAWP,GAAsBO,EAAU5jB,GAAUhsD,EAAMslE,GAAWngD,EAAK,IAEtEyqD,CACT,CAUgB,SAAAC,GACdP,EACAtvE,GAEA,GAAImsD,GAAYnsD,GACd,OAAOkvE,GAAcE,QAChB,CACL,MAAMK,EAAeH,EAAcH,WAAWhB,QAC5CnuE,EACA,IAAIytE,GAAoB,OAE1B,OAAO,IAAIyB,GAAcO,EAC1B,CACH,CAUgB,SAAAK,GACdR,EACAtvE,GAEA,OAA4D,MAArD+vE,GAA6BT,EAAetvE,EACrD,CAUgB,SAAA+vE,GACdT,EACAtvE,GAEA,MAAMuvE,EAAWD,EAAcH,WAAWlB,yBAAyBjuE,GACnE,OAAgB,MAAZuvE,EACKD,EAAcH,WAClBlnF,IAAIsnF,EAASvvE,MACbu6D,SAASnO,GAAgBmjB,EAASvvE,KAAMA,IAEpC,IAEX,CAQM,SAAUgwE,GACdV,GAEA,MAAMvzE,EAAwB,GACxBopB,EAAOmqD,EAAcH,WAAWx1F,MAoBtC,OAnBY,MAARwrC,EAEGA,EAAKu0C,cACPv0C,EAAsB61C,aACrBqB,IACA,CAAC/B,EAAWI,KACV3+D,EAASzjB,KAAK,IAAI48E,GAAUoF,EAAWI,GAAW,IAKxD4U,EAAcH,WAAWpzE,SAASq7D,kBAChC,CAACkD,EAAWmD,KACa,MAAnBA,EAAU9jF,OACZoiB,EAASzjB,KAAK,IAAI48E,GAAUoF,EAAWmD,EAAU9jF,OAClD,IAIAoiB,CACT,CAEgB,SAAAk0E,GACdX,EACAtvE,GAEA,GAAImsD,GAAYnsD,GACd,OAAOsvE,EACF,CACL,MAAMY,EAAgBH,GAA6BT,EAAetvE,GAClE,OACS,IAAIkvE,GADQ,MAAjBgB,EACuB,IAAIzC,GAAcyC,GAElBZ,EAAcH,WAAW1E,QAAQzqE,GAE7D,CACH,CAMM,SAAUmwE,GAAqBb,GACnC,OAAOA,EAAcH,WAAW3tF,SAClC,CAQgB,SAAA4uF,GACdd,EACAnqD,GAEA,OAAOkrD,GAAkB/kB,KAAgBgkB,EAAcH,WAAYhqD,EACrE,CAEA,SAASkrD,GACPxC,EACAyC,EACAnrD,GAEA,GAAuB,MAAnBmrD,EAAU32F,MAEZ,OAAOwrC,EAAK01C,YAAYgT,EAAcyC,EAAU32F,OAC3C,CACL,IAAI42F,EAAgB,KAyBpB,OAxBAD,EAAUv0E,SAASq7D,kBAAiB,CAACkO,EAAU7H,KAC5B,cAAb6H,IAGFpwF,EAAAA,EAAAA,IACsB,OAApBuoF,EAAU9jF,MACV,6CAEF42F,EAAgB9S,EAAU9jF,OAE1BwrC,EAAOkrD,GACLrkB,GAAU6hB,EAAcvI,GACxB7H,EACAt4C,EAEH,IAGEA,EAAKo1C,SAASsT,GAAcrsF,WAA+B,OAAlB+uF,IAC5CprD,EAAOA,EAAK01C,YACV7O,GAAU6hB,EAAc,aACxB0C,IAGGprD,CACR,CACH;;;;;;;;;;;;;;;;GCzLgB,SAAAqrD,GACdF,EACAtwE,GAEA,OAAOywE,GAAgBzwE,EAAMswE,EAC/B,CAOM,SAAUI,GACdJ,EACAtwE,EACA2hE,EACAgP,EACA7iB,IAEA54E,EAAAA,EAAAA,IACEy7F,EAAUL,EAAUM,YACpB,qDAEc/2F,IAAZi0E,IACFA,GAAU,GAEZwiB,EAAUO,UAAUv4F,KAAK,CACvB0nB,OACA2hE,OACAgP,UACA7iB,YAGEA,IACFwiB,EAAUQ,cAAgBzB,GACxBiB,EAAUQ,cACV9wE,EACA2hE,IAGJ2O,EAAUM,YAAcD,CAC1B,CAKM,SAAUI,GACdT,EACAtwE,EACAgxE,EACAL,IAEAz7F,EAAAA,EAAAA,IACEy7F,EAAUL,EAAUM,YACpB,gDAEFN,EAAUO,UAAUv4F,KAAK,CACvB0nB,OACAjE,SAAUi1E,EACVL,UACA7iB,SAAS,IAGXwiB,EAAUQ,cAAgBpB,GACxBY,EAAUQ,cACV9wE,EACAgxE,GAEFV,EAAUM,YAAcD,CAC1B,CAEgB,SAAAM,GACdX,EACAK,GAEA,IAAK,IAAIh7F,EAAI,EAAGA,EAAI26F,EAAUO,UAAUj7F,OAAQD,IAAK,CACnD,MAAMu7F,EAASZ,EAAUO,UAAUl7F,GACnC,GAAIu7F,EAAOP,UAAYA,EACrB,OAAOO,CAEV,CACD,OAAO,IACT,CASgB,SAAAC,GACdb,EACAK,GAOA,MAAM/Q,EAAM0Q,EAAUO,UAAU79D,WAAU7T,GACjCA,EAAEwxE,UAAYA,KAEvBz7F,EAAAA,EAAAA,IAAO0qF,GAAO,EAAG,gDACjB,MAAMwR,EAAgBd,EAAUO,UAAUjR,GAC1C0Q,EAAUO,UAAUt7E,OAAOqqE,EAAK,GAEhC,IAAIyR,EAAyBD,EAActjB,QACvCwjB,GAAsC,EAEtC37F,EAAI26F,EAAUO,UAAUj7F,OAAS,EAErC,MAAOy7F,GAA0B17F,GAAK,EAAG,CACvC,MAAM47F,EAAejB,EAAUO,UAAUl7F,GACrC47F,EAAazjB,UAEbn4E,GAAKiqF,GACL4R,GAA6BD,EAAcH,EAAcpxE,MAGzDqxE,GAAyB,EAChBrkB,GAAaokB,EAAcpxE,KAAMuxE,EAAavxE,QAEvDsxE,GAAsC,IAG1C37F,GACD,CAED,GAAK07F,EAEE,IAAIC,EAGT,OADAG,GAAoBnB,IACb,EAGP,GAAIc,EAAczP,KAChB2O,EAAUQ,cAAgBjB,GACxBS,EAAUQ,cACVM,EAAcpxE,UAEX,CACL,MAAMjE,EAAWq1E,EAAcr1E,SAC/Bk4C,EAAKl4C,GAAWu+D,IACdgW,EAAUQ,cAAgBjB,GACxBS,EAAUQ,cACV9kB,GAAUolB,EAAcpxE,KAAMs6D,GAC/B,GAEJ,CACD,OAAO,CACR,CAtBC,OAAO,CAuBX,CAEA,SAASkX,GACPE,EACA1xE,GAEA,GAAI0xE,EAAY/P,KACd,OAAO3U,GAAa0kB,EAAY1xE,KAAMA,GAEtC,IAAK,MAAMs6D,KAAaoX,EAAY31E,SAClC,GACE21E,EAAY31E,SAAS1hB,eAAeigF,IACpCtN,GAAahB,GAAU0lB,EAAY1xE,KAAMs6D,GAAYt6D,GAErD,OAAO,EAGX,OAAO,CAEX,CAKA,SAASyxE,GAAoBnB,GAC3BA,EAAUQ,cAAgBa,GACxBrB,EAAUO,UACVe,GACAtmB,MAEEglB,EAAUO,UAAUj7F,OAAS,EAC/B06F,EAAUM,YACRN,EAAUO,UAAUP,EAAUO,UAAUj7F,OAAS,GAAG+6F,QAEtDL,EAAUM,aAAe,CAE7B,CAKA,SAASgB,GAAwB9xB,GAC/B,OAAOA,EAAMgO,OACf,CAMA,SAAS6jB,GACPE,EACAjnF,EACAknF,GAEA,IAAIxC,EAAgBJ,GAAcE,QAClC,IAAK,IAAIz5F,EAAI,EAAGA,EAAIk8F,EAAOj8F,SAAUD,EAAG,CACtC,MAAMmqE,EAAQ+xB,EAAOl8F,GAIrB,GAAIiV,EAAOk1D,GAAQ,CACjB,MAAMiyB,EAAYjyB,EAAM9/C,KACxB,IAAI6tE,EACJ,GAAI/tB,EAAM6hB,KACJ3U,GAAa8kB,EAAUC,IACzBlE,EAAezhB,GAAgB0lB,EAAUC,GACzCzC,EAAgBD,GACdC,EACAzB,EACA/tB,EAAM6hB,OAEC3U,GAAa+kB,EAAWD,KACjCjE,EAAezhB,GAAgB2lB,EAAWD,GAC1CxC,EAAgBD,GACdC,EACAhkB,KACAxL,EAAM6hB,KAAKpH,SAASsT,SAKnB,KAAI/tB,EAAM/jD,SAgCf,MAAM1mB,EAAAA,EAAAA,IAAe,8CA/BrB,GAAI23E,GAAa8kB,EAAUC,GACzBlE,EAAezhB,GAAgB0lB,EAAUC,GACzCzC,EAAgBI,GACdJ,EACAzB,EACA/tB,EAAM/jD,eAEH,GAAIixD,GAAa+kB,EAAWD,GAEjC,GADAjE,EAAezhB,GAAgB2lB,EAAWD,GACtC3lB,GAAY0hB,GACdyB,EAAgBI,GACdJ,EACAhkB,KACAxL,EAAM/jD,cAEH,CACL,MAAMuH,GAAQ/hB,EAAAA,EAAAA,IAAQu+D,EAAM/jD,SAAUwvD,GAAasiB,IACnD,GAAIvqE,EAAO,CAET,MAAM0uE,EAAW1uE,EAAMi3D,SAAS9O,GAAaoiB,IAC7CyB,EAAgBD,GACdC,EACAhkB,KACA0mB,EAEH,CACF,CAMJ,CACF,CACF,CACD,OAAO1C,CACT,CAqBM,SAAU2C,GACd3B,EACA4B,EACAC,EACAC,EACAC,GAEA,GAAKD,GAAsBC,EAyBpB,CACL,MAAM5oB,EAAQwmB,GACZK,EAAUQ,cACVoB,GAEF,IAAKG,GAAuBlC,GAAqB1mB,GAC/C,OAAO0oB,EAGP,GACGE,GACsB,MAAvBF,GACCrC,GAA8BrmB,EAAO6B,MAGjC,CACL,MAAM1gE,EAAS,SAAUk1D,GACvB,OACGA,EAAMgO,SAAWukB,MAChBD,KACEA,EAAkBz8E,QAAQmqD,EAAM6wB,YACnC3jB,GAAalN,EAAM9/C,KAAMkyE,IACxBllB,GAAaklB,EAAUpyB,EAAM9/C,MAEnC,EACMsyE,EAAcX,GAClBrB,EAAUO,UACVjmF,EACAsnF,GAEIK,EAAeJ,GAAuBjT,GAAajI,WACzD,OAAOmZ,GAAmBkC,EAAaC,EACxC,CAlBC,OAAO,IAoBZ,CA3D+C,CAC9C,MAAMrC,EAAgBH,GACpBO,EAAUQ,cACVoB,GAEF,GAAqB,MAAjBhC,EACF,OAAOA,EACF,CACL,MAAMsC,EAAWvC,GACfK,EAAUQ,cACVoB,GAEF,GAAI/B,GAAqBqC,GACvB,OAAOL,EACF,GACkB,MAAvBA,GACCrC,GAA8B0C,EAAUlnB,MAIpC,CACL,MAAMinB,EAAeJ,GAAuBjT,GAAajI,WACzD,OAAOmZ,GAAmBoC,EAAUD,EACrC,CAJC,OAAO,IAKV,CACF,CAmCH,CAKG,SACaE,GACdnC,EACA4B,EACAQ,GAEA,IAAIC,EAAmBzT,GAAajI,WACpC,MAAM2b,EAAc7C,GAClBO,EAAUQ,cACVoB,GAEF,GAAIU,EAUF,OATKA,EAAYlZ,cAEfkZ,EAAY5X,aAAaqB,IAAgB,CAAC/B,EAAWiL,KACnDoN,EAAmBA,EAAiBhY,qBAClCL,EACAiL,EACD,IAGEoN,EACF,GAAID,EAAwB,CAGjC,MAAMjpB,EAAQwmB,GACZK,EAAUQ,cACVoB,GAsBF,OApBAQ,EAAuB1X,aACrBqB,IACA,CAAC/B,EAAWI,KACV,MAAMv1C,EAAOirD,GACXH,GAAgCxmB,EAAO,IAAIuB,GAAKsP,IAChDI,GAEFiY,EAAmBA,EAAiBhY,qBAClCL,EACAn1C,EACD,IAIL6qD,GAAiCvmB,GAAO5mE,SAAQu6E,IAC9CuV,EAAmBA,EAAiBhY,qBAClCyC,EAAUnkF,KACVmkF,EAAUj4C,KACX,IAEIwtD,CACR,CAAM,CAGL,MAAMlpB,EAAQwmB,GACZK,EAAUQ,cACVoB,GAQF,OANAlC,GAAiCvmB,GAAO5mE,SAAQu6E,IAC9CuV,EAAmBA,EAAiBhY,qBAClCyC,EAAUnkF,KACVmkF,EAAUj4C,KACX,IAEIwtD,CACR,CACH,CAgBM,SAAUE,GACdvC,EACA4B,EACAvE,EACAmF,EACAC,IAEA79F,EAAAA,EAAAA,IACE49F,GAAqBC,EACrB,6DAEF,MAAM/yE,EAAOgsD,GAAUkmB,EAAUvE,GACjC,GAAImC,GAA8BQ,EAAUQ,cAAe9wE,GAGzD,OAAO,KACF,CAEL,MAAMgzE,EAAa/C,GACjBK,EAAUQ,cACV9wE,GAEF,OAAImwE,GAAqB6C,GAEhBD,EAAmBxY,SAASoT,GAQ5ByC,GACL4C,EACAD,EAAmBxY,SAASoT,GAGjC,CACH,CAMM,SAAUsF,GACd3C,EACA4B,EACA5M,EACAyN,GAEA,MAAM/yE,EAAOgsD,GAAUkmB,EAAU5M,GAC3B4K,EAAgBH,GACpBO,EAAUQ,cACV9wE,GAEF,GAAqB,MAAjBkwE,EACF,OAAOA,EAEP,GAAI6C,EAAmBxH,mBAAmBjG,GAAW,CACnD,MAAM0N,EAAa/C,GACjBK,EAAUQ,cACV9wE,GAEF,OAAOowE,GACL4C,EACAD,EAAmB3K,UAAU/N,kBAAkBiL,GAElD,CACC,OAAO,IAGb,CAOgB,SAAA4N,GACd5C,EACAtwE,GAEA,OAAO+vE,GAA6BO,EAAUQ,cAAe9wE,EAC/D,CAMgB,SAAAmzE,GACd7C,EACA4B,EACAkB,EACAhT,EACAjJ,EACAviB,EACApvD,GAEA,IAAI6tF,EACJ,MAAM5pB,EAAQwmB,GACZK,EAAUQ,cACVoB,GAEIhC,EAAgBH,GAA6BtmB,EAAO6B,MAC1D,GAAqB,MAAjB4kB,EACFmD,EAAYnD,MACP,IAA0B,MAAtBkD,EAIT,MAAO,GAHPC,EAAYjD,GAAmB3mB,EAAO2pB,EAIvC,CAED,GADAC,EAAYA,EAAUzX,UAAUp2E,GAC3B6tF,EAAU7xF,WAAc6xF,EAAU3Z,aAerC,MAAO,GAf4C,CACnD,MAAM4Z,EAAQ,GACRzmB,EAAMrnE,EAAM6vE,aACZqJ,EAAO9pB,EACRy+B,EAA2Bra,uBAAuBoH,EAAW56E,GAC7D6tF,EAA2Bta,gBAAgBqH,EAAW56E,GAC3D,IAAIkJ,EAAOgwE,EAAKhI,UAChB,MAAOhoE,GAAQ4kF,EAAM19F,OAASuhF,EACC,IAAzBtK,EAAIn+D,EAAM0xE,IACZkT,EAAMh7F,KAAKoW,GAEbA,EAAOgwE,EAAKhI,UAEd,OAAO4c,CACR,CAGH,CAAC,SAEe7D,KACd,MAAO,CACLqB,cAAe5B,GAAcE,QAC7ByB,UAAW,GACXD,aAAc,EAElB,CAgCM,SAAU2C,GACdC,EACArB,EACAC,EACAC,GAEA,OAAOJ,GACLuB,EAAalD,UACbkD,EAAatB,SACbC,EACAC,EACAC,EAEJ,CAOgB,SAAAoB,GACdD,EACAd,GAEA,OAAOD,GACLe,EAAalD,UACbkD,EAAatB,SACbQ,EAEJ,CAkBM,SAAUgB,GACdF,EACAxzE,EACA8yE,EACAC,GAEA,OAAOF,GACLW,EAAalD,UACbkD,EAAatB,SACblyE,EACA8yE,EACAC,EAEJ,CAQgB,SAAAY,GACdH,EACAxzE,GAEA,OAAOkzE,GACLM,EAAalD,UACbtkB,GAAUwnB,EAAatB,SAAUlyE,GAErC,CAMgB,SAAA4zE,GACdJ,EACAJ,EACAhT,EACAjJ,EACAviB,EACApvD,GAEA,OAAO2tF,GACLK,EAAalD,UACbkD,EAAatB,SACbkB,EACAhT,EACAjJ,EACAviB,EACApvD,EAEJ,CAKG,SACaquF,GACdL,EACAlO,EACAwO,GAEA,OAAOb,GACLO,EAAalD,UACbkD,EAAatB,SACb5M,EACAwO,EAEJ,CAKgB,SAAAC,GACdP,EACAlZ,GAEA,OAAOmW,GACLzkB,GAAUwnB,EAAatB,SAAU5X,GACjCkZ,EAAalD,UAEjB,CAEgB,SAAAG,GACdzwE,EACAswE,GAEA,MAAO,CACL4B,SAAUlyE,EACVswE,YAEJ;;;;;;;;;;;;;;;;GCnyBG,MAYU0D,GAAbh7F,WAAAA,GACmB,KAAAi7F,UAAiC,IAAI5qF,GAAM,CAE5Dw5E,gBAAAA,CAAiBoJ,GACf,MAAM3uF,EAAO2uF,EAAO3uF,KACdgoF,EAAW2G,EAAO3R,WACxBplF,EAAAA,EAAAA,IACiC,gBAA/BoI,GACmC,kBAAjCA,GACiC,kBAAjCA,EACF,8CAEFpI,EAAAA,EAAAA,IACe,cAAbowF,EACA,mDAEF,MAAM4O,EAAYj9F,KAAKg9F,UAAUhsF,IAAIq9E,GACrC,GAAI4O,EAAW,CACb,MAAMC,EAAUD,EAAU52F,KAC1B,GACiC,gBAA/BA,GACO,kBAAP62F,EAEAl9F,KAAKg9F,UAAUprF,IACby8E,EACAjD,GACEiD,EACA2G,EAAO/J,aACPgS,EAAUhS,oBAGT,GAC4B,kBAAjC5kF,GACO,gBAAP62F,EAEAl9F,KAAKg9F,UAAU/rF,OAAOo9E,QACjB,GAC4B,kBAAjChoF,GACO,kBAAP62F,EAEAl9F,KAAKg9F,UAAUprF,IACby8E,EACAlD,GAAmBkD,EAAU4O,EAAU5R,eAEpC,GAC4B,kBAAjChlF,GACO,gBAAP62F,EAEAl9F,KAAKg9F,UAAUprF,IACby8E,EACAnD,GAAiBmD,EAAU2G,EAAO/J,mBAE/B,IAC4B,kBAAjC5kF,GACO,kBAAP62F,EAOA,MAAM9+F,EAAAA,EAAAA,IACJ,mCACE42F,EACA,mBACAiI,GATJj9F,KAAKg9F,UAAUprF,IACby8E,EACAjD,GAAmBiD,EAAU2G,EAAO/J,aAAcgS,EAAU5R,SAS/D,CACF,MACCrrF,KAAKg9F,UAAUprF,IAAIy8E,EAAU2G,EAC9B,CAGHmI,UAAAA,GACE,OAAO58F,MAAMgxB,KAAKvxB,KAAKg9F,UAAUjqF,SAAU;;;;;;;;;;;;;;;;SCnDlCqqF,GACXC,gBAAAA,CAAiBhP,GACf,OAAO,IAAK,CAEdO,kBAAAA,CACErgF,EACA8d,EACAsxC,GAEA,OAAO,IAAK,EAOT,MAAM2/B,GAA2B,IAAIF,GAKzC,MACUG,GACXx7F,WAAAA,CACUy7F,EACAC,EACAC,EAAuC,MAFvC,KAAOF,QAAPA,EACA,KAAUC,WAAVA,EACA,KAAuBC,wBAAvBA,CAAuB,CAEjCL,gBAAAA,CAAiBhP,GACf,MAAMngD,EAAOluC,KAAKy9F,WAAW7I,WAC7B,GAAI1mD,EAAKomD,mBAAmBjG,GAC1B,OAAOngD,EAAKijD,UAAU/N,kBAAkBiL,GACnC,CACL,MAAMsP,EAC4B,MAAhC39F,KAAK09F,wBACD,IAAI3J,GAAU/zF,KAAK09F,yBAAyB,GAAM,GAClD19F,KAAKy9F,WAAW3H,YACtB,OAAO8G,GAA8B58F,KAAKw9F,QAASnP,EAAUsP,EAC9D,EAEH/O,kBAAAA,CACErgF,EACA8d,EACAsxC,GAEA,MAAMw+B,EAC4B,MAAhCn8F,KAAK09F,wBACD19F,KAAK09F,wBACLrH,GAA+Br2F,KAAKy9F,YACpCpB,EAAQM,GACZ38F,KAAKw9F,QACLrB,EACA9vE,EACA,EACAsxC,EACApvD,GAEF,OAAqB,IAAjB8tF,EAAM19F,OACD,KAEA09F,EAAM,EACd;;;;;;;;;;;;;;;;GCvCC,SAAUuB,GAAiBjqF,GAC/B,MAAO,CAAEA,SACX,CAEgB,SAAAkqF,GACdC,EACA9H,IAEA/3F,EAAAA,EAAAA,IACE+3F,EAAUpB,WAAWzD,UAAUvM,UAAUkZ,EAAcnqF,OAAOknE,YAC9D,2BAEF58E,EAAAA,EAAAA,IACE+3F,EAAUF,YAAY3E,UAAUvM,UAAUkZ,EAAcnqF,OAAOknE,YAC/D,0BAEJ,CAEM,SAAUkjB,GACdD,EACAE,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAc,IAAIrB,GACxB,IAAIlH,EAAcwI,EAClB,GAAIJ,EAAU53F,OAASusF,GAAcgB,UAAW,CAC9C,MAAMp/B,EAAYypC,EACdzpC,EAAU1xD,OAAOgwF,SACnB+C,EAAeyI,GACbR,EACAE,EACAxpC,EAAUzrC,KACVyrC,EAAUk2B,KACVwT,EACAC,EACAC,KAGFngG,EAAAA,EAAAA,IAAOu2D,EAAU1xD,OAAOiwF,WAAY,mBAIpCsL,EACE7pC,EAAU1xD,OAAOkwF,QAChBgL,EAAalI,YAAY1B,eAAiBlf,GAAY1gB,EAAUzrC,MACnE8sE,EAAe0I,GACbT,EACAE,EACAxpC,EAAUzrC,KACVyrC,EAAUk2B,KACVwT,EACAC,EACAE,EACAD,GAGL,MAAM,GAAIH,EAAU53F,OAASusF,GAAckB,MAAO,CACjD,MAAMthB,EAAQyrB,EACVzrB,EAAM1vE,OAAOgwF,SACf+C,EAAe2I,GACbV,EACAE,EACAxrB,EAAMzpD,KACNypD,EAAM1tD,SACNo5E,EACAC,EACAC,KAGFngG,EAAAA,EAAAA,IAAOu0E,EAAM1vE,OAAOiwF,WAAY,mBAEhCsL,EACE7rB,EAAM1vE,OAAOkwF,QAAUgL,EAAalI,YAAY1B,aAClDyB,EAAe4I,GACbX,EACAE,EACAxrB,EAAMzpD,KACNypD,EAAM1tD,SACNo5E,EACAC,EACAE,EACAD,GAGL,MAAM,GAAIH,EAAU53F,OAASusF,GAAcU,eAAgB,CAC1D,MAAMoL,EAAeT,EAYnBpI,EAXG6I,EAAarL,OAWDsL,GACbb,EACAE,EACAU,EAAa31E,KACbm1E,EACAC,EACAC,GAhBaQ,GACbd,EACAE,EACAU,EAAa31E,KACb21E,EAAatL,aACb8K,EACAC,EACAC,EAYL,KAAM,IAAIH,EAAU53F,OAASusF,GAAcc,gBAS1C,MAAMt1F,EAAAA,EAAAA,IAAe,2BAA6B6/F,EAAU53F,MAR5DwvF,EAAegJ,GACbf,EACAE,EACAC,EAAUl1E,KACVm1E,EACAE,EAIH,CACD,MAAMzJ,EAAUyJ,EAAYjB,aAE5B,OADA2B,GAAgCd,EAAcnI,EAAclB,GACrD,CAAEqB,UAAWH,EAAclB,UACpC,CAEA,SAASmK,GACPd,EACAnI,EACAuI,GAEA,MAAMnI,EAAYJ,EAAajB,WAC/B,GAAIqB,EAAU9B,qBAAsB,CAClC,MAAM4K,EACJ9I,EAAU9E,UAAU1O,cAAgBwT,EAAU9E,UAAU5mF,UACpDy0F,EAAkB5I,GAA8B4H,IAEpDI,EAAYz/F,OAAS,IACpBq/F,EAAapJ,WAAWT,sBACxB4K,IAAkB9I,EAAU9E,UAAUtM,OAAOma,KAC7C/I,EAAU9E,UAAUzO,cAAcmC,OAAOma,EAAgBtc,iBAE1D0b,EAAY/8F,KACV2pF,GAAYoL,GAA8BP,IAG/C,CACH,CAEA,SAASoJ,GACPnB,EACA9H,EACAkJ,EACAhB,EACAp7F,EACAs7F,GAEA,MAAMe,EAAenJ,EAAUpB,WAC/B,GAA2D,MAAvD8H,GAA2BwB,EAAagB,GAE1C,OAAOlJ,EACF,CACL,IAAIjH,EAAe4O,EACnB,GAAIzoB,GAAYgqB,GAMd,IAJAjhG,EAAAA,EAAAA,IACE+3F,EAAUF,YAAY3B,qBACtB,8DAEE6B,EAAUF,YAAY1B,aAAc,CAItC,MAAM0B,EAAcO,GAA+BL,GAC7C0F,EACJ5F,aAAuB7N,GACnB6N,EACA7N,GAAajI,WACbof,EAAwB5C,GAC5B0B,EACAxC,GAEF3M,EAAgB+O,EAAcnqF,OAAOk4E,eACnCmK,EAAUpB,WAAWzD,UACrBiO,EACAhB,EAEH,KAAM,CACL,MAAMiB,EAAe/C,GACnB4B,EACA7H,GAA+BL,IAEjCjH,EAAgB+O,EAAcnqF,OAAOk4E,eACnCmK,EAAUpB,WAAWzD,UACrBkO,EACAjB,EAEH,KACI,CACL,MAAM/P,EAAW/Z,GAAa4qB,GAC9B,GAAiB,cAAb7Q,EAA0B,EAC5BpwF,EAAAA,EAAAA,IACgC,IAA9Bs2E,GAAc2qB,GACd,yDAEF,MAAMI,EAAeH,EAAahO,UAClCwM,EAAa3H,EAAUF,YAAY3E,UAEnC,MAAMoO,EAAkB9C,GACtByB,EACAgB,EACAI,EACA3B,GAGA5O,EADqB,MAAnBwQ,EACczB,EAAcnqF,OAAOuvE,eACnCoc,EACAC,GAIcJ,EAAahO,SAEhC,KAAM,CACL,MAAMqO,EAAkBhrB,GAAa0qB,GAErC,IAAIO,EACJ,GAAIN,EAAa7K,mBAAmBjG,GAAW,CAC7CsP,EAAa3H,EAAUF,YAAY3E,UACnC,MAAMuO,EACJjD,GACEyB,EACAgB,EACAC,EAAahO,UACbwM,GAGF8B,EADsB,MAApBC,EACcP,EACbhO,UACA/N,kBAAkBiL,GAClBzK,YAAY4b,EAAiBE,GAGhBP,EAAahO,UAAU/N,kBAAkBiL,EAE5D,MACCoR,EAAgB7C,GACdsB,EACA7P,EACA2H,EAAUF,aAIZ/G,EADmB,MAAjB0Q,EACc3B,EAAcnqF,OAAOiwE,YACnCub,EAAahO,UACb9C,EACAoR,EACAD,EACA18F,EACAs7F,GAIce,EAAahO,SAEhC,CACF,CACD,OAAO4E,GACLC,EACAjH,EACAoQ,EAAahL,sBAAwBjf,GAAYgqB,GACjDpB,EAAcnqF,OAAOo4E,eAExB,CACH,CAEA,SAASwS,GACPT,EACAE,EACAkB,EACAS,EACAzB,EACAC,EACAE,EACAD,GAEA,MAAMwB,EAAgB5B,EAAalI,YACnC,IAAI+J,EACJ,MAAMC,EAAezB,EACjBP,EAAcnqF,OACdmqF,EAAcnqF,OAAOq4E,mBACzB,GAAI9W,GAAYgqB,GACdW,EAAiBC,EAAajU,eAC5B+T,EAAczO,UACdwO,EACA,WAEG,GAAIG,EAAa/T,iBAAmB6T,EAAcxL,aAAc,CAErE,MAAM2L,EAAgBH,EACnBzO,UACAvN,YAAYsb,EAAYS,GAC3BE,EAAiBC,EAAajU,eAC5B+T,EAAczO,UACd4O,EACA,KAEH,KAAM,CACL,MAAM1R,EAAW/Z,GAAa4qB,GAC9B,IACGU,EAAcvL,kBAAkB6K,IACjC3qB,GAAc2qB,GAAc,EAG5B,OAAOlB,EAET,MAAMwB,EAAkBhrB,GAAa0qB,GAC/Bzb,EAAYmc,EAAczO,UAAU/N,kBAAkBiL,GACtD1K,EAAeF,EAAUG,YAAY4b,EAAiBG,GAE1DE,EADe,cAAbxR,EACeyR,EAAa5c,eAC5B0c,EAAczO,UACdxN,GAGemc,EAAalc,YAC5Bgc,EAAczO,UACd9C,EACA1K,EACA6b,EACAlC,GACA,KAGL,CACD,MAAMzH,EAAeK,GACnB8H,EACA6B,EACAD,EAAczL,sBAAwBjf,GAAYgqB,GAClDY,EAAa/T,gBAETjpF,EAAS,IAAIy6F,GACjBW,EACArI,EACAsI,GAEF,OAAOc,GACLnB,EACAjI,EACAqJ,EACAhB,EACAp7F,EACAs7F,EAEJ,CAEA,SAASE,GACPR,EACAE,EACAkB,EACAS,EACAzB,EACAC,EACAC,GAEA,MAAMe,EAAenB,EAAapJ,WAClC,IAAIiB,EAAc9G,EAClB,MAAMjsF,EAAS,IAAIy6F,GACjBW,EACAF,EACAG,GAEF,GAAIjpB,GAAYgqB,GACdnQ,EAAgB+O,EAAcnqF,OAAOk4E,eACnCmS,EAAapJ,WAAWzD,UACxBwO,EACAvB,GAEFvI,EAAeE,GACbiI,EACAjP,GACA,EACA+O,EAAcnqF,OAAOo4E,oBAElB,CACL,MAAMsC,EAAW/Z,GAAa4qB,GAC9B,GAAiB,cAAb7Q,EACFU,EAAgB+O,EAAcnqF,OAAOuvE,eACnC8a,EAAapJ,WAAWzD,UACxBwO,GAEF9J,EAAeE,GACbiI,EACAjP,EACAoQ,EAAahL,qBACbgL,EAAa/K,kBAEV,CACL,MAAMoL,EAAkBhrB,GAAa0qB,GAC/BpyE,EAAWqyE,EAAahO,UAAU/N,kBAAkBiL,GAC1D,IAAI5C,EACJ,GAAIvW,GAAYsqB,GAEd/T,EAAWkU,MACN,CACL,MAAMlc,EAAY3gF,EAAOu6F,iBAAiBhP,GAQtC5C,EAPa,MAAbhI,EAEiC,cAAjChP,GAAY+qB,IACZ/b,EAAUH,SAASzO,GAAW2qB,IAAkBj1F,UAIrCk5E,EAEAA,EAAUG,YAAY4b,EAAiBG,GAIzC1X,GAAajI,UAE3B,CACD,GAAKlzD,EAAS+3D,OAAO4G,GAgBnBoK,EAAemI,MAhBe,CAC9B,MAAMgC,EAAelC,EAAcnqF,OAAOiwE,YACxCub,EAAahO,UACb9C,EACA5C,EACA+T,EACA18F,EACAs7F,GAEFvI,EAAeE,GACbiI,EACAgC,EACAb,EAAahL,qBACb2J,EAAcnqF,OAAOo4E,eAExB,CAGF,CACF,CACD,OAAO8J,CACT,CAEA,SAASoK,GACPjK,EACA3H,GAEA,OAAO2H,EAAUpB,WAAWN,mBAAmBjG,EACjD,CAEA,SAASmQ,GACPV,EACA9H,EACAjtE,EACAgxE,EACAmE,EACApI,EACAsI,GAQA,IAAI8B,EAAelK,EA+BnB,OA9BA+D,EAAgBjC,SAAQ,CAAClB,EAAcnT,KACrC,MAAMqX,EAAY/lB,GAAUhsD,EAAM6tE,GAC9BqJ,GAA2BjK,EAAW1hB,GAAawmB,MACrDoF,EAAe5B,GACbR,EACAoC,EACApF,EACArX,EACAya,EACApI,EACAsI,GAEH,IAGHrE,EAAgBjC,SAAQ,CAAClB,EAAcnT,KACrC,MAAMqX,EAAY/lB,GAAUhsD,EAAM6tE,GAC7BqJ,GAA2BjK,EAAW1hB,GAAawmB,MACtDoF,EAAe5B,GACbR,EACAoC,EACApF,EACArX,EACAya,EACApI,EACAsI,GAEH,IAGI8B,CACT,CAEA,SAASC,GACPrC,EACA5vD,EACAskC,GAKA,OAHAA,EAAMslB,SAAQ,CAAClB,EAAcnT,KAC3Bv1C,EAAOA,EAAK01C,YAAYgT,EAAcnT,EAAU,IAE3Cv1C,CACT,CAEA,SAASuwD,GACPX,EACA9H,EACAjtE,EACAgxE,EACAmE,EACApI,EACAuI,EACAD,GAIA,GACEpI,EAAUF,YAAY3E,UAAU5mF,YAC/ByrF,EAAUF,YAAY3B,qBAEvB,OAAO6B,EAST,IACIoK,EADAF,EAAelK,EAGjBoK,EADElrB,GAAYnsD,GACEgxE,EAEA,IAAIvD,GAAoB,MAAMU,QAC5CnuE,EACAgxE,GAGJ,MAAM4D,EAAa3H,EAAUF,YAAY3E,UAiDzC,OAhDAiP,EAAct7E,SAASq7D,kBAAiB,CAACkO,EAAU7H,KACjD,GAAImX,EAAWpa,SAAS8K,GAAW,CACjC,MAAMgS,EAAcrK,EAAUF,YAC3B3E,UACA/N,kBAAkBiL,GACf5C,EAAW0U,GACfrC,EACAuC,EACA7Z,GAEF0Z,EAAe3B,GACbT,EACAoC,EACA,IAAInsB,GAAKsa,GACT5C,EACAyS,EACApI,EACAuI,EACAD,EAEH,KAEHgC,EAAct7E,SAASq7D,kBAAiB,CAACkO,EAAUiS,KACjD,MAAMC,GACHvK,EAAUF,YAAYxB,mBAAmBjG,IACjB,OAAzBiS,EAAe59F,MACjB,IAAKi7F,EAAWpa,SAAS8K,KAAckS,EAAoB,CACzD,MAAMF,EAAcrK,EAAUF,YAC3B3E,UACA/N,kBAAkBiL,GACf5C,EAAW0U,GACfrC,EACAuC,EACAC,GAEFJ,EAAe3B,GACbT,EACAoC,EACA,IAAInsB,GAAKsa,GACT5C,EACAyS,EACApI,EACAuI,EACAD,EAEH,KAGI8B,CACT,CAEA,SAAStB,GACPd,EACA9H,EACAwK,EACApN,EACA8K,EACAC,EACAC,GAEA,GAAwD,MAApD1B,GAA2BwB,EAAasC,GAC1C,OAAOxK,EAIT,MAAMqI,EAAmBrI,EAAUF,YAAY1B,aAIzC0B,EAAcE,EAAUF,YAC9B,GAA0B,MAAtB1C,EAAa1wF,MAAe,CAE9B,GACGwyE,GAAYsrB,IAAY1K,EAAY3B,sBACrC2B,EAAYzB,kBAAkBmM,GAE9B,OAAOjC,GACLT,EACA9H,EACAwK,EACA1K,EAAY3E,UAAU7N,SAASkd,GAC/BtC,EACAC,EACAE,EACAD,GAEG,GAAIlpB,GAAYsrB,GAAU,CAG/B,IAAIzG,EAAkB,IAAIvD,GAAoB,MAI9C,OAHAV,EAAY3E,UAAUpN,aAAa5E,IAAW,CAACn9E,EAAMksC,KACnD6rD,EAAkBA,EAAgBnoF,IAAI,IAAImiE,GAAK/xE,GAAOksC,EAAK,IAEtDuwD,GACLX,EACA9H,EACAwK,EACAzG,EACAmE,EACAC,EACAE,EACAD,EAEH,CACC,OAAOpI,CAEV,CAAM,CAEL,IAAI+D,EAAkB,IAAIvD,GAAoB,MAU9C,OATApD,EAAa0E,SAAQ,CAAC2I,EAAW/9F,KAC/B,MAAMg+F,EAAkB3rB,GAAUyrB,EAASC,GACvC3K,EAAYzB,kBAAkBqM,KAChC3G,EAAkBA,EAAgBnoF,IAChC6uF,EACA3K,EAAY3E,UAAU7N,SAASod,IAElC,IAEIjC,GACLX,EACA9H,EACAwK,EACAzG,EACAmE,EACAC,EACAE,EACAD,EAEH,CACH,CAEA,SAASS,GACPf,EACA9H,EACAjtE,EACAm1E,EACAE,GAEA,MAAMuC,EAAgB3K,EAAUF,YAC1BD,EAAeK,GACnBF,EACA2K,EAAcxP,UACdwP,EAAcxM,sBAAwBjf,GAAYnsD,GAClD43E,EAAcvM,cAEhB,OAAO6K,GACLnB,EACAjI,EACA9sE,EACAm1E,EACAZ,GACAc,EAEJ,CAEA,SAASO,GACPb,EACA9H,EACAjtE,EACAm1E,EACAhD,EACAkD,GAEA,IAAIryC,EACJ,GAAqD,MAAjD2wC,GAA2BwB,EAAan1E,GAC1C,OAAOitE,EACF,CACL,MAAMlzF,EAAS,IAAIy6F,GACjBW,EACAlI,EACAkF,GAEI1M,EAAgBwH,EAAUpB,WAAWzD,UAC3C,IAAIpC,EACJ,GAAI7Z,GAAYnsD,IAAgC,cAAvBurD,GAAavrD,GAAuB,CAC3D,IAAIy1D,EACJ,GAAIwX,EAAUF,YAAY3B,qBACxB3V,EAAU8d,GACR4B,EACA7H,GAA+BL,QAE5B,CACL,MAAM4K,EAAiB5K,EAAUF,YAAY3E,WAC7ClzF,EAAAA,EAAAA,IACE2iG,aAA0B3Y,GAC1B,iDAEFzJ,EAAUge,GACR0B,EACA0C,EAEH,CAED7R,EAAgB+O,EAAcnqF,OAAOk4E,eACnC2C,EACAhQ,EACA4f,EAEH,KAAM,CACL,MAAM/P,EAAW/Z,GAAavrD,GAC9B,IAAI0iE,EAAWmR,GACbsB,EACA7P,EACA2H,EAAUF,aAGE,MAAZrK,GACAuK,EAAUF,YAAYxB,mBAAmBjG,KAEzC5C,EAAW+C,EAAcpL,kBAAkBiL,IAG3CU,EADc,MAAZtD,EACcqS,EAAcnqF,OAAOiwE,YACnC4K,EACAH,EACA5C,EACAjX,GAAazrD,GACbjmB,EACAs7F,GAEOpI,EAAUpB,WAAWzD,UAAU5N,SAAS8K,GAEjCyP,EAAcnqF,OAAOiwE,YACnC4K,EACAH,EACApG,GAAajI,WACbxL,GAAazrD,GACbjmB,EACAs7F,GAGc5P,EAGhBO,EAAcxkF,WACdyrF,EAAUF,YAAY3B,uBAGtBpoC,EAAWuwC,GACT4B,EACA7H,GAA+BL,IAE7BjqC,EAAS02B,eACXsM,EAAgB+O,EAAcnqF,OAAOk4E,eACnCkD,EACAhjC,EACAqyC,IAIP,CAID,OAHAryC,EACEiqC,EAAUF,YAAY3B,sBACqC,MAA3DuI,GAA2BwB,EAAa7pB,MACnC0hB,GACLC,EACAjH,EACAhjC,EACA+xC,EAAcnqF,OAAOo4E,eAExB,CACH;;;;;;;;;;;;;;;;GCtzBG,MACU8U,GAMX9+F,WAAAA,CAAoByyF,EAAsBsM,GAAtB,KAAMtM,OAANA,EAHpB,KAAmBuM,oBAAwB,GAIzC,MAAMr1F,EAAS1L,KAAKw0F,OAAOxa,aAErBgnB,EAAc,IAAIzV,GAAc7/E,EAAOmvE,YACvClnE,EAASm8E,GAAyBpkF,GAExC1L,KAAKihG,WAAarD,GAAiBjqF,GAEnC,MAAMutF,EAAqBJ,EAAiBhL,YACtCqL,EAAoBL,EAAiBlM,WAGrCuB,EAAa6K,EAAYnV,eAC7B5D,GAAajI,WACbkhB,EAAmB/P,UACnB,MAEI8E,EAAYtiF,EAAOk4E,eACvB5D,GAAajI,WACbmhB,EAAkBhQ,UAClB,MAEI0O,EAAiB,IAAI9L,GACzBoC,EACA+K,EAAmB/M,qBACnB6M,EAAYjV,gBAERgD,EAAgB,IAAIgF,GACxBkC,EACAkL,EAAkBhN,qBAClBxgF,EAAOo4E,gBAGT/rF,KAAKy9F,WAAa5H,GAAa9G,EAAe8Q,GAC9C7/F,KAAKohG,gBAAkB,IAAI7M,GAAev0F,KAAKw0F,OAAQ,CAGzD,SAAIn2B,GACF,OAAOr+D,KAAKw0F,MAAO,EAIjB,SAAU6M,GAAmBC,GACjC,OAAOA,EAAK7D,WAAW3H,YAAY3E,SACrC,CAEM,SAAUoQ,GAAoBD,GAClC,OAAOlL,GAA8BkL,EAAK7D,WAC5C,CAEgB,SAAA+D,GACdF,EACAv4E,GAEA,MAAMjI,EAAQu1E,GAA+BiL,EAAK7D,YAClD,OAAI38E,IAIAwgF,EAAKjjC,MAAM2b,aAAaE,iBACtBhF,GAAYnsD,KACXjI,EAAMsiE,kBAAkB9O,GAAavrD,IAAOxe,WAExCuW,EAAMwiE,SAASv6D,GAGnB,IACT,CAEM,SAAU04E,GAAYH,GAC1B,OAA2C,IAApCA,EAAKP,oBAAoBpiG,MAClC,CAEgB,SAAA+iG,GACdJ,EACAK,GAEAL,EAAKP,oBAAoB1/F,KAAKsgG,EAChC,CAMG,SACaC,GACdN,EACAK,EACAE,GAEA,MAAMC,EAA8B,GACpC,GAAID,EAAa,EACf5jG,EAAAA,EAAAA,IACuB,MAArB0jG,EACA,mDAEF,MAAM54E,EAAOu4E,EAAKjjC,MAAME,MACxB+iC,EAAKP,oBAAoBn1F,SAAQ2pF,IAC/B,MAAMwM,EAAaxM,EAAayM,kBAAkBH,EAAa94E,GAC3Dg5E,GACFD,EAAazgG,KAAK0gG,EACnB,GAEJ,CAED,GAAIJ,EAAmB,CACrB,IAAIM,EAAY,GAChB,IAAK,IAAIvjG,EAAI,EAAGA,EAAI4iG,EAAKP,oBAAoBpiG,SAAUD,EAAG,CACxD,MAAM8+B,EAAW8jE,EAAKP,oBAAoBriG,GAC1C,GAAK8+B,EAAShO,QAAQmyE,IAEf,GAAIA,EAAkBO,iBAAkB,CAE7CD,EAAYA,EAAU19E,OAAO+8E,EAAKP,oBAAoBjhF,MAAMphB,EAAI,IAChE,KACD,OALCujG,EAAU5gG,KAAKm8B,EAMlB,CACD8jE,EAAKP,oBAAsBkB,CAC5B,MACCX,EAAKP,oBAAsB,GAE7B,OAAOe,CACT,CAKM,SAAUK,GACdb,EACArD,EACAC,EACAhD,GAGE+C,EAAU53F,OAASusF,GAAckB,OACJ,OAA7BmK,EAAUn7F,OAAOg3E,WAEjB77E,EAAAA,EAAAA,IACEo4F,GAA+BiL,EAAK7D,YACpC,8DAEFx/F,EAAAA,EAAAA,IACEm4F,GAA8BkL,EAAK7D,YACnC,4DAIJ,MAAMO,EAAesD,EAAK7D,WACpBt1F,EAAS41F,GACbuD,EAAKL,WACLjD,EACAC,EACAC,EACAhD,GAYF,OAVA2C,GAA2ByD,EAAKL,WAAY94F,EAAO6tF,YAEnD/3F,EAAAA,EAAAA,IACEkK,EAAO6tF,UAAUF,YAAY3B,uBAC1B6J,EAAalI,YAAY3B,qBAC5B,2DAGFmN,EAAK7D,WAAat1F,EAAO6tF,UAElBoM,GACLd,EACAn5F,EAAOwsF,QACPxsF,EAAO6tF,UAAUpB,WAAWzD,UAC5B,KAEJ,CAEgB,SAAAkR,GACdf,EACA/L,GAEA,MAAMU,EAAYqL,EAAK7D,WAAW7I,WAC5B0N,EAA2B,GACjC,IAAKrM,EAAU9E,UAAU1O,aAAc,CACrC,MAAM8f,EAAYtM,EAAU9E,UAC5BoR,EAAUxe,aAAaqB,IAAgB,CAAC9hF,EAAKmgF,KAC3C6e,EAAejhG,KAAK6pF,GAAiB5nF,EAAKmgF,GAAW,GAExD,CAID,OAHIwS,EAAU9B,sBACZmO,EAAejhG,KAAK2pF,GAAYiL,EAAU9E,YAErCiR,GACLd,EACAgB,EACArM,EAAU9E,UACVoE,EAEJ,CAEA,SAAS6M,GACPd,EACA3M,EACAC,EACA+M,GAEA,MAAMzM,EAAgByM,EAClB,CAACA,GACDL,EAAKP,oBACT,OAAOtM,GACL6M,EAAKF,gBACLzM,EACAC,EACAM,EAEJ;;;;;;;;;;;;;;;;GCvOA,IAAIsN,GC6BAC,GDlBD,MACUC,GAAb3gG,WAAAA,GAOW,KAAA4gG,MAA2B,IAAIvwF,GAAM,EAG1C,SAAUwwF,GACd7sE,IAEA93B,EAAAA,EAAAA,KACGukG,GACD,mDAEFA,GAAuBzsE,CACzB,CAEA,SAAS8sE,KAEP,OADA5kG,EAAAA,EAAAA,IAAOukG,GAAsB,oCACtBA,EACT,CAEM,SAAUM,GAAiBC,GAC/B,OAAgC,IAAzBA,EAAUJ,MAAMzxF,IACzB,CAEM,SAAU8xF,GACdD,EACA9E,EACAC,EACA+E,GAEA,MAAMnpB,EAAUmkB,EAAUn7F,OAAOg3E,QACjC,GAAgB,OAAZA,EAAkB,CACpB,MAAMwnB,EAAOyB,EAAUJ,MAAM3xF,IAAI8oE,GAEjC,OADA77E,EAAAA,EAAAA,IAAe,MAARqjG,EAAc,gDACda,GACLb,EACArD,EACAC,EACA+E,EAEH,CAAM,CACL,IAAInO,EAAkB,GAEtB,IAAK,MAAMwM,KAAQyB,EAAUJ,MAAM5vF,SACjC+hF,EAASA,EAAOvwE,OACd49E,GAAmBb,EAAMrD,EAAWC,EAAa+E,IAIrD,OAAOnO,CACR,CACH,CAWM,SAAUoO,GACdH,EACA1kC,EACA6/B,EACApI,EACAqN,GAEA,MAAMrpB,EAAUzb,EAAM0b,iBAChBunB,EAAOyB,EAAUJ,MAAM3xF,IAAI8oE,GACjC,IAAKwnB,EAAM,CAET,IAAI1M,EAAa0H,GACf4B,EACAiF,EAAsBrN,EAAc,MAElCsN,GAAqB,EACrBxO,EACFwO,GAAqB,EACZtN,aAAuB7N,IAChC2M,EAAa4H,GACX0B,EACApI,GAEFsN,GAAqB,IAErBxO,EAAa3M,GAAajI,WAC1BojB,GAAqB,GAEvB,MAAMpN,EAAYH,GAChB,IAAI9B,GAAUa,EAAYwO,GAAoB,GAC9C,IAAIrP,GAAU+B,EAAaqN,GAAqB,IAElD,OAAO,IAAItC,GAAKxiC,EAAO23B,EACxB,CACD,OAAOsL,CACT,CAYgB,SAAA+B,GACdN,EACA1kC,EACAsjC,EACAzD,EACApI,EACAqN,GAEA,MAAM7B,EAAO4B,GACXH,EACA1kC,EACA6/B,EACApI,EACAqN,GAOF,OALKJ,EAAUJ,MAAM1tF,IAAIopD,EAAM0b,mBAC7BgpB,EAAUJ,MAAM/wF,IAAIysD,EAAM0b,iBAAkBunB,GAG9CI,GAAyBJ,EAAMK,GACxBU,GAAqBf,EAAMK,EACpC,CAYM,SAAU2B,GACdP,EACA1kC,EACAsjC,EACAE,GAEA,MAAM/nB,EAAUzb,EAAM0b,iBAChBwpB,EAA0B,GAChC,IAAIzB,EAAwB,GAC5B,MAAM0B,EAAkBC,GAAyBV,GACjD,GAAgB,YAAZjpB,EAEF,IAAK,MAAO4pB,EAAapC,KAASyB,EAAUJ,MAAMh3F,UAChDm2F,EAAeA,EAAav9E,OAC1Bq9E,GAA4BN,EAAMK,EAAmBE,IAEnDJ,GAAYH,KACdyB,EAAUJ,MAAM1xF,OAAOyyF,GAGlBpC,EAAKjjC,MAAM2b,aAAaE,gBAC3BqpB,EAAQliG,KAAKigG,EAAKjjC,YAInB,CAEL,MAAMijC,EAAOyB,EAAUJ,MAAM3xF,IAAI8oE,GAC7BwnB,IACFQ,EAAeA,EAAav9E,OAC1Bq9E,GAA4BN,EAAMK,EAAmBE,IAEnDJ,GAAYH,KACdyB,EAAUJ,MAAM1xF,OAAO6oE,GAGlBwnB,EAAKjjC,MAAM2b,aAAaE,gBAC3BqpB,EAAQliG,KAAKigG,EAAKjjC,QAIzB,CASD,OAPImlC,IAAoBC,GAAyBV,IAE/CQ,EAAQliG,KACN,IAAKwhG,KAAL,CAAyCxkC,EAAMslC,MAAOtlC,EAAME,QAIzD,CAAEglC,UAASzO,OAAQgN,EAC5B,CAEM,SAAU8B,GAAuBb,GACrC,MAAM56F,EAAS,GACf,IAAK,MAAMm5F,KAAQyB,EAAUJ,MAAM5vF,SAC5BuuF,EAAKjjC,MAAM2b,aAAaE,gBAC3B/xE,EAAO9G,KAAKigG,GAGhB,OAAOn5F,CACT,CAMgB,SAAA07F,GACdd,EACAh6E,GAEA,IAAI+sE,EAA2B,KAC/B,IAAK,MAAMwL,KAAQyB,EAAUJ,MAAM5vF,SACjC+iF,EAAcA,GAAe0L,GAA2BF,EAAMv4E,GAEhE,OAAO+sE,CACT,CAEgB,SAAAgO,GACdf,EACA1kC,GAEA,MAAM3yD,EAAS2yD,EAAM2b,aACrB,GAAItuE,EAAOwuE,eACT,OAAO6pB,GAAyBhB,GAC3B,CACL,MAAMjpB,EAAUzb,EAAM0b,iBACtB,OAAOgpB,EAAUJ,MAAM3xF,IAAI8oE,EAC5B,CACH,CAEgB,SAAAkqB,GACdjB,EACA1kC,GAEA,OAAkD,MAA3CylC,GAAsBf,EAAW1kC,EAC1C,CAEM,SAAUolC,GAAyBV,GACvC,OAA8C,MAAvCgB,GAAyBhB,EAClC,CAEM,SAAUgB,GAAyBhB,GACvC,IAAK,MAAMzB,KAAQyB,EAAUJ,MAAM5vF,SACjC,GAAIuuF,EAAKjjC,MAAM2b,aAAaE,eAC1B,OAAOonB,EAGX,OAAO,IACT;;;;;;;;;;;;;;;;GC7OM,SAAU2C,GACdluE,IAEA93B,EAAAA,EAAAA,KACGwkG,GACD,mDAEFA,GAAuB1sE,CACzB,CAEA,SAASmuE,KAEP,OADAjmG,EAAAA,EAAAA,IAAOwkG,GAAsB,oCACtBA,EACT,CAgBA,IAAI0B,GAAwB,EA0BzB,MACUC,GAkBXriG,WAAAA,CAAmBsiG,GAAA,KAAeA,gBAAfA,EAdnB,KAAAC,eAA2C,IAAI9N,GAAyB,MAKxE,KAAiB+N,kBAAc/L,KAEtB,KAAAgM,cAAqC,IAAIpyF,IACzC,KAAAqyF,cAAqC,IAAIryF,GAAM,EAcpD,SAAUsyF,GACdC,EACA57E,EACA67E,EACAlL,EACA7iB,GAWA,OARA4iB,GACEkL,EAASJ,kBACTx7E,EACA67E,EACAlL,EACA7iB,GAGGA,EAGIguB,GACLF,EACA,IAAIhR,GAAUd,KAA0B9pE,EAAM67E,IAJzC,EAOX,CAOM,SAAUE,GACdH,EACA57E,EACAgxE,EACAL,GAGAI,GAAkB6K,EAASJ,kBAAmBx7E,EAAMgxE,EAAiBL,GAErE,MAAMqL,EAAavO,GAAcC,WAAWsD,GAE5C,OAAO8K,GACLF,EACA,IAAI9Q,GAAMhB,KAA0B9pE,EAAMg8E,GAE9C,CAQM,SAAUC,GACdL,EACAjL,EACArG,GAAkB,GAElB,MAAMxqB,EAAQmxB,GAAkB2K,EAASJ,kBAAmB7K,GACtDuL,EAAmB/K,GACvByK,EAASJ,kBACT7K,GAEF,GAAKuL,EAEE,CACL,IAAI7R,EAAe,IAAIoD,GAAuB,MAS9C,OARkB,MAAd3tB,EAAM6hB,KAER0I,EAAeA,EAAaxhF,IAAIyiE,MAAgB,GAEhDrX,EAAK6L,EAAM/jD,UAAWutD,IACpB+gB,EAAeA,EAAaxhF,IAAI,IAAImiE,GAAK1B,IAAa,EAAK,IAGxDwyB,GACLF,EACA,IAAIxR,GAAatqB,EAAM9/C,KAAMqqE,EAAcC,GAE9C,CAfC,MAAO,EAgBX,CAMG,SACa6R,GACdP,EACA57E,EACA67E,GAEA,OAAOC,GACLF,EACA,IAAIhR,GAAUV,KAA4BlqE,EAAM67E,GAEpD,CAMG,SACaO,GACdR,EACA57E,EACAgxE,GAEA,MAAMgL,EAAavO,GAAcC,WAAWsD,GAE5C,OAAO8K,GACLF,EACA,IAAI9Q,GAAMZ,KAA4BlqE,EAAMg8E,GAEhD,CAOgB,SAAAK,GACdT,EACA57E,GAEA,OAAO87E,GACLF,EACA,IAAIlR,GAAeR,KAA4BlqE,GAEnD,CAMG,SACas8E,GACdV,EACA57E,EACA8kB,GAEA,MAAMy3D,EAAWC,GAAwBZ,EAAU92D,GACnD,GAAIy3D,EAAU,CACZ,MAAMtqF,EAAIwqF,GAAuBF,GAC3BG,EAAYzqF,EAAE+N,KAClB+wD,EAAU9+D,EAAE8+D,QACR8c,EAAezhB,GAAgBswB,EAAW18E,GAC1C28E,EAAK,IAAIjS,GACbP,GAAoCpZ,GACpC8c,GAEF,OAAO+O,GAA8BhB,EAAUc,EAAWC,EAC3D,CAEC,MAAO,EAEX,CAcgB,SAAAE,GACdjB,EACAtmC,EACAsjC,EACAE,EACAgE,GAAoB,GAGpB,MAAM98E,EAAOs1C,EAAME,MACbunC,EAAiBnB,EAASL,eAAetzF,IAAI+X,GACnD,IAAI+4E,EAAwB,GAI5B,GACEgE,IAC4B,YAA3BznC,EAAM0b,kBACLiqB,GAA4B8B,EAAgBznC,IAC9C,CACA,MAAM0nC,EAAmBzC,GACvBwC,EACAznC,EACAsjC,EACAE,GAEEiB,GAAiBgD,KACnBnB,EAASL,eAAiBK,EAASL,eAAe57E,OAAOK,IAG3D,MAAMw6E,EAAUwC,EAAiBxC,QAGjC,GAFAzB,EAAeiE,EAAiBjR,QAE3B+Q,EAAmB,CAStB,MAAMG,GACH,IACDzC,EAAQxnE,WAAUsiC,GACTA,EAAM2b,aAAaE,iBAExB+rB,EAAUtB,EAASL,eAAe9M,WACtCzuE,GACA,CAAC6tE,EAAcsP,IACbzC,GAAyByC,KAG7B,GAAIF,IAAoBC,EAAS,CAC/B,MAAMzS,EAAUmR,EAASL,eAAe9Q,QAAQzqE,GAGhD,IAAKyqE,EAAQjpF,UAAW,CAEtB,MAAM47F,EAAWC,GAAwC5S,GAGzD,IAAK,IAAI90F,EAAI,EAAGA,EAAIynG,EAASxnG,SAAUD,EAAG,CACxC,MAAM4iG,EAAO6E,EAASznG,GACpB2nG,EAAW/E,EAAKjjC,MACZoB,EAAW6mC,GAA+B3B,EAAUrD,GAC1DqD,EAASN,gBAAgBkC,eACvBC,GAA2BH,GAC3BI,GAAoB9B,EAAU0B,GAC9B5mC,EAAS2a,OACT3a,EAAS6S,WAEZ,CACF,CAEF,CAID,IAAK2zB,GAAW1C,EAAQ5kG,OAAS,IAAMkjG,EAGrC,GAAImE,EAAiB,CAEnB,MAAMU,EAA4B,KAClC/B,EAASN,gBAAgBsC,cACvBH,GAA2BnoC,GAC3BqoC,EAEH,MACCnD,EAAQ33F,SAASg7F,IACf,MAAMC,EAAclC,EAASF,cAAczzF,IACzC81F,GAAsBF,IAExBjC,EAASN,gBAAgBsC,cACvBH,GAA2BI,GAC3BC,EACD,GAIR,CAEDE,GAAoBpC,EAAUpB,EAC/B,CAGD,OAAOzB,CACT,CAOM,SAAUkF,GACdrC,EACA57E,EACA2hE,EACA78C,GAEA,MAAMy3D,EAAWC,GAAwBZ,EAAU92D,GACnD,GAAgB,MAAZy3D,EAAkB,CACpB,MAAMtqF,EAAIwqF,GAAuBF,GAC3BG,EAAYzqF,EAAE+N,KAClB+wD,EAAU9+D,EAAE8+D,QACR8c,EAAezhB,GAAgBswB,EAAW18E,GAC1C28E,EAAK,IAAI/R,GACbT,GAAoCpZ,GACpC8c,EACAlM,GAEF,OAAOib,GAA8BhB,EAAUc,EAAWC,EAC3D,CAEC,MAAO,EAEX,CAOM,SAAUuB,GACdtC,EACA57E,EACAgxE,EACAlsD,GAEA,MAAMy3D,EAAWC,GAAwBZ,EAAU92D,GACnD,GAAIy3D,EAAU,CACZ,MAAMtqF,EAAIwqF,GAAuBF,GAC3BG,EAAYzqF,EAAE+N,KAClB+wD,EAAU9+D,EAAE8+D,QACR8c,EAAezhB,GAAgBswB,EAAW18E,GAC1Cg8E,EAAavO,GAAcC,WAAWsD,GACtC2L,EAAK,IAAI7R,GACbX,GAAoCpZ,GACpC8c,EACAmO,GAEF,OAAOY,GAA8BhB,EAAUc,EAAWC,EAC3D,CAEC,MAAO,EAEX,CAOM,SAAUwB,GACdvC,EACAtmC,EACAsjC,EACAwF,GAAoB,GAEpB,MAAMp+E,EAAOs1C,EAAME,MAEnB,IAAIu3B,EAA2B,KAC3BsR,GAA2B,EAG/BzC,EAASL,eAAe3M,cAAc5uE,GAAM,CAACs+E,EAAiB37D,KAC5D,MAAMkrD,EAAezhB,GAAgBkyB,EAAiBt+E,GACtD+sE,EACEA,GAAe+N,GAAgCn4D,EAAIkrD,GACrDwQ,EACEA,GAA4B3D,GAAyB/3D,EAAG,IAE5D,IAWIy3D,EAXAJ,EAAY4B,EAASL,eAAetzF,IAAI+X,GAY5C,GAXKg6E,GAIHqE,EACEA,GAA4B3D,GAAyBV,GACvDjN,EACEA,GAAe+N,GAAgCd,EAAW1uB,QAN5D0uB,EAAY,IAAIL,GAChBiC,EAASL,eAAiBK,EAASL,eAAe1yF,IAAImX,EAAMg6E,IAS3C,MAAfjN,EACFqN,GAAsB,MACjB,CACLA,GAAsB,EACtBrN,EAAc7N,GAAajI,WAC3B,MAAMwT,EAAUmR,EAASL,eAAe9Q,QAAQzqE,GAChDyqE,EAAQwE,cAAa,CAAC3U,EAAWikB,KAC/B,MAAMnJ,EAAgB0F,GACpByD,EACAjzB,MAEE8pB,IACFrI,EAAcA,EAAYpS,qBACxBL,EACA8a,GAEH,GAEJ,CAED,MAAMoJ,EAAoBvD,GAA4BjB,EAAW1kC,GACjE,IAAKkpC,IAAsBlpC,EAAM2b,aAAaE,eAAgB,CAE5D,MAAMorB,EAAWwB,GAAsBzoC,IACvCpgE,EAAAA,EAAAA,KACG0mG,EAASF,cAAcxvF,IAAIqwF,GAC5B,0CAEF,MAAMz3D,EAAM25D,KACZ7C,EAASF,cAAc7yF,IAAI0zF,EAAUz3D,GACrC82D,EAASH,cAAc5yF,IAAIi8B,EAAKy3D,EACjC,CACD,MAAMpH,EAAc3E,GAAqBoL,EAASJ,kBAAmBx7E,GACrE,IAAI+rE,EAASuO,GACXN,EACA1kC,EACAsjC,EACAzD,EACApI,EACAqN,GAEF,IAAKoE,IAAsBH,IAA6BD,EAAmB,CACzE,MAAM7F,EAAOwC,GAAsBf,EAAW1kC,GAC9Cy2B,EAASA,EAAOvwE,OAAOkjF,GAAuB9C,EAAUtmC,EAAOijC,GAChE,CACD,OAAOxM,CACT,CAYG,SACa4S,GACd/C,EACA57E,EACAoyE,GAEA,MAAMwM,GAAoB,EACpBtO,EAAYsL,EAASJ,kBACrBzO,EAAc6O,EAASL,eAAe9M,WAC1CzuE,GACA,CAACuuE,EAAWyL,KACV,MAAMnM,EAAezhB,GAAgBmiB,EAAWvuE,GAC1C+sE,EAAc+N,GAClBd,EACAnM,GAEF,GAAId,EACF,OAAOA,CACR,IAGL,OAAOkF,GACL3B,EACAtwE,EACA+sE,EACAqF,EACAwM,EAEJ,CAEgB,SAAAC,GACdjD,EACAtmC,GAEA,MAAMt1C,EAAOs1C,EAAME,MACnB,IAAIu3B,EAA2B,KAG/B6O,EAASL,eAAe3M,cAAc5uE,GAAM,CAACs+E,EAAiB37D,KAC5D,MAAMkrD,EAAezhB,GAAgBkyB,EAAiBt+E,GACtD+sE,EACEA,GAAe+N,GAAgCn4D,EAAIkrD,EAAa,IAEpE,IAAImM,EAAY4B,EAASL,eAAetzF,IAAI+X,GACvCg6E,EAIHjN,EACEA,GAAe+N,GAAgCd,EAAW1uB,OAJ5D0uB,EAAY,IAAIL,GAChBiC,EAASL,eAAiBK,EAASL,eAAe1yF,IAAImX,EAAMg6E,IAK9D,MAAMI,EAAqC,MAAfrN,EACtB+R,EAAoC1E,EACtC,IAAIpP,GAAU+B,GAAa,GAAM,GACjC,KACEoI,EAAmC3E,GACvCoL,EAASJ,kBACTlmC,EAAME,OAEF+iC,EAAa4B,GACjBH,EACA1kC,EACA6/B,EACAiF,EAAsB0E,EAAgB1W,UAAYlJ,GAAajI,WAC/DmjB,GAEF,OAAO5B,GAAoBD,EAC7B,CAeA,SAASuD,GACPF,EACA1G,GAEA,OAAO6J,GACL7J,EACA0G,EAASL,eACQ,KACjB/K,GAAqBoL,EAASJ,kBAAmBlwB,MAErD,CAKA,SAASyzB,GACP7J,EACA8J,EACAjS,EACAoI,GAEA,GAAIhpB,GAAY+oB,EAAUl1E,MACxB,OAAOi/E,GACL/J,EACA8J,EACAjS,EACAoI,GAEG,CACL,MAAM6E,EAAYgF,EAAc/2F,IAAIqjE,MAGjB,MAAfyhB,GAAoC,MAAbiN,IACzBjN,EAAc+N,GAAgCd,EAAW1uB,OAG3D,IAAIygB,EAAkB,GACtB,MAAMzR,EAAY/O,GAAa2pB,EAAUl1E,MACnCk/E,EAAiBhK,EAAU1K,kBAAkBlQ,GAC7CmD,EAAYuhB,EAAcjjF,SAAS9T,IAAIqyE,GAC7C,GAAImD,GAAayhB,EAAgB,CAC/B,MAAMC,EAAmBpS,EACrBA,EAAY1S,kBAAkBC,GAC9B,KACE8kB,EAAmBrL,GAAkBoB,EAAa7a,GACxDyR,EAASA,EAAOvwE,OACdujF,GACEG,EACAzhB,EACA0hB,EACAC,GAGL,CAQD,OANIpF,IACFjO,EAASA,EAAOvwE,OACdy+E,GAAwBD,EAAW9E,EAAWC,EAAapI,KAIxDhB,CACR,CACH,CAKA,SAASkT,GACP/J,EACA8J,EACAjS,EACAoI,GAEA,MAAM6E,EAAYgF,EAAc/2F,IAAIqjE,MAGjB,MAAfyhB,GAAoC,MAAbiN,IACzBjN,EAAc+N,GAAgCd,EAAW1uB,OAG3D,IAAIygB,EAAkB,GAyBtB,OAxBAiT,EAAcjjF,SAASq7D,kBAAiB,CAACkD,EAAWmD,KAClD,MAAM0hB,EAAmBpS,EACrBA,EAAY1S,kBAAkBC,GAC9B,KACE8kB,EAAmBrL,GAAkBoB,EAAa7a,GAClD4kB,EAAiBhK,EAAU1K,kBAAkBlQ,GAC/C4kB,IACFnT,EAASA,EAAOvwE,OACdyjF,GACEC,EACAzhB,EACA0hB,EACAC,IAGL,IAGCpF,IACFjO,EAASA,EAAOvwE,OACdy+E,GAAwBD,EAAW9E,EAAWC,EAAapI,KAIxDhB,CACT,CAEA,SAASwR,GACP3B,EACArD,GAEA,MAAMjjC,EAAQijC,EAAKjjC,MACbxwB,EAAM44D,GAAoB9B,EAAUtmC,GAE1C,MAAO,CACL+b,OAAQA,KACN,MAAMt5D,EAAQugF,GAAmBC,IAASrZ,GAAajI,WACvD,OAAOl/D,EAAMyxD,MAAM,EAErBD,WAAaiI,IACX,GAAe,OAAXA,EACF,OAAI1sC,EACKw3D,GAAkCV,EAAUtmC,EAAME,MAAO1wB,GAEzDu3D,GAA4BT,EAAUtmC,EAAME,OAEhD,CAGL,MAAM/7D,EAAQ47D,EAAmBmc,EAAQlc,GACzC,OAAOunC,GACLjB,EACAtmC,EACsB,KACtB77D,EAEH,GAGP,CAKgB,SAAAikG,GACd9B,EACAtmC,GAEA,MAAMinC,EAAWwB,GAAsBzoC,GACvC,OAAOsmC,EAASF,cAAczzF,IAAIs0F,EACpC,CAKA,SAASwB,GAAsBzoC,GAC7B,OAAOA,EAAME,MAAM3iC,WAAa,IAAMyiC,EAAM0b,gBAC9C,CAKA,SAASwrB,GACPZ,EACA92D,GAEA,OAAO82D,EAASH,cAAcxzF,IAAI68B,EACpC,CAKA,SAAS23D,GAAuBF,GAI9B,MAAM8C,EAAa9C,EAAS5mF,QAAQ,KAKpC,OAJAzgB,EAAAA,EAAAA,KACkB,IAAhBmqG,GAAqBA,EAAa9C,EAAS3mG,OAAS,EACpD,iBAEK,CACLm7E,QAASwrB,EAASxnC,OAAOsqC,EAAa,GACtCr/E,KAAM,IAAIgrD,GAAKuxB,EAASxnC,OAAO,EAAGsqC,IAEtC,CAKA,SAASzC,GACPhB,EACAc,EACAxH,GAEA,MAAM8E,EAAY4B,EAASL,eAAetzF,IAAIy0F,IAC9CxnG,EAAAA,EAAAA,IAAO8kG,EAAW,wDAClB,MAAM7E,EAAc3E,GAClBoL,EAASJ,kBACTkB,GAEF,OAAOzC,GAAwBD,EAAW9E,EAAWC,EAAa,KACpE,CAMA,SAASkI,GACP5S,GAEA,OAAOA,EAAQ4D,MAAa,CAACR,EAAcyR,EAAqBC,KAC9D,GAAID,GAAuB5E,GAAyB4E,GAAsB,CACxE,MAAME,EAAexE,GAAyBsE,GAC9C,MAAO,CAACE,EACT,CAAM,CAEL,IAAI5F,EAAgB,GAOpB,OANI0F,IACF1F,EAAQiB,GAAuByE,IAEjCrrC,EAAKsrC,GAAU,CAACxsD,EAAc0sD,KAC5B7F,EAAQA,EAAMp+E,OAAOikF,EAAW,IAE3B7F,CACR,IAEL,CAOA,SAAS6D,GAA2BnoC,GAClC,OAAIA,EAAM2b,aAAaE,iBAAmB7b,EAAM2b,aAAaC,YAIpD,IAAKiqB,KAAL,CAAwC7lC,EAAMslC,MAAOtlC,EAAME,OAE3DF,CAEX,CAEA,SAAS0oC,GAAoBpC,EAAoB5mB,GAC/C,IAAK,IAAI1wE,EAAI,EAAGA,EAAI0wE,EAAQp/E,SAAU0O,EAAG,CACvC,MAAMo7F,EAAe1qB,EAAQ1wE,GAC7B,IAAKo7F,EAAazuB,aAAaE,eAAgB,CAE7C,MAAMwuB,EAAkB5B,GAAsB2B,GACxCE,EAAkBhE,EAASF,cAAczzF,IAAI03F,GACnD/D,EAASF,cAAcxzF,OAAOy3F,GAC9B/D,EAASH,cAAcvzF,OAAO03F,EAC/B,CACF,CACH,CAKA,SAASnB,KACP,OAAOrD,IACT,CAOA,SAASsD,GACP9C,EACAtmC,EACAijC,GAEA,MAAMv4E,EAAOs1C,EAAME,MACb1wB,EAAM44D,GAAoB9B,EAAUtmC,GACpCoB,EAAW6mC,GAA+B3B,EAAUrD,GAEpDxM,EAAS6P,EAASN,gBAAgBkC,eACtCC,GAA2BnoC,GAC3BxwB,EACA4xB,EAAS2a,OACT3a,EAAS6S,YAGLkhB,EAAUmR,EAASL,eAAe9Q,QAAQzqE,GAGhD,GAAI8kB,GACF5vC,EAAAA,EAAAA,KACGwlG,GAAyBjQ,EAAQ9wF,OAClC,yDAEG,CAEL,MAAMkmG,EAAgBpV,EAAQ4D,MAC5B,CAACR,EAAcyR,EAAqBC,KAClC,IACGpzB,GAAY0hB,IACbyR,GACA5E,GAAyB4E,GAEzB,MAAO,CAACtE,GAAyBsE,GAAqBhqC,OACjD,CAEL,IAAI0f,EAA0B,GAW9B,OAVIsqB,IACFtqB,EAAUA,EAAQx5D,OAChBq/E,GAAuByE,GAAqB79F,KAC1C82F,GAAQA,EAAKjjC,UAInBrB,EAAKsrC,GAAU,CAACxsD,EAAc+sD,KAC5B9qB,EAAUA,EAAQx5D,OAAOskF,EAAa,IAEjC9qB,CACR,KAGL,IAAK,IAAIr/E,EAAI,EAAGA,EAAIkqG,EAAcjqG,SAAUD,EAAG,CAC7C,MAAMoqG,EAAcF,EAAclqG,GAClCimG,EAASN,gBAAgBsC,cACvBH,GAA2BsC,GAC3BrC,GAAoB9B,EAAUmE,GAEjC,CACF,CACD,OAAOhU,CACT;;;;;;;;;;;;;;;;GCn8BA,MAAMiU,GACJhnG,WAAAA,CAAqBiyF,GAAA,KAAKA,MAALA,CAAK,CAE1B5Q,iBAAAA,CAAkBC,GAChB,MAAMh3D,EAAQrsB,KAAKg0F,MAAM5Q,kBAAkBC,GAC3C,OAAO,IAAI0lB,GAAsB18E,EAAO,CAG1C6hB,IAAAA,GACE,OAAOluC,KAAKg0F,KAAM,EAItB,MAAMgV,GAIJjnG,WAAAA,CAAY4iG,EAAoB57E,GAC9B/oB,KAAKipG,UAAYtE,EACjB3kG,KAAKkpG,MAAQngF,CAAK,CAGpBq6D,iBAAAA,CAAkBC,GAChB,MAAMqT,EAAY3hB,GAAU/0E,KAAKkpG,MAAO7lB,GACxC,OAAO,IAAI2lB,GAAsBhpG,KAAKipG,UAAWvS,EAAW,CAG9DxoD,IAAAA,GACE,OAAOw5D,GAA+B1nG,KAAKipG,UAAWjpG,KAAKkpG,MAAO,EAO/D,MAAMC,GAAqB,SAChCp2F,GAMA,OAFAA,EAASA,GAAU,CAAC,EACpBA,EAAO,aAAeA,EAAO,eAAgB,IAAI/P,MAAOE,UACjD6P,CACT,EAMaq2F,GAA2B,SACtC1mG,EACA2mG,EACAC,GAEA,OAAK5mG,GAA0B,kBAAVA,IAGrBzE,EAAAA,EAAAA,IAAO,QAASyE,EAAO,6CAEK,kBAAjBA,EAAM,OACR6mG,GAA2B7mG,EAAM,OAAQ2mG,EAAaC,GAC5B,kBAAjB5mG,EAAM,OACf8mG,GAA4B9mG,EAAM,OAAQ2mG,QAEjDprG,EAAAA,EAAAA,KAAO,EAAO,4BAA8B+F,KAAKoD,UAAU1E,EAAO,KAAM,KATjEA,CAWX,EAEM6mG,GAA6B,SACjC7D,EACAloE,EACA8rE,GAEA,OAAQ5D,GACN,IAAK,YACH,OAAO4D,EAAa,aACtB,SACErrG,EAAAA,EAAAA,KAAO,EAAO,4BAA8BynG,GAElD,EAEM8D,GAA8B,SAClC9D,EACAloE,EACAisE,GAEK/D,EAAGtiG,eAAe,eACrBnF,EAAAA,EAAAA,KAAO,EAAO,4BAA8B+F,KAAKoD,UAAUs+F,EAAI,KAAM,IAEvE,MAAMhoB,EAAQgoB,EAAG,aACI,kBAAVhoB,IACTz/E,EAAAA,EAAAA,KAAO,EAAO,+BAAiCy/E,GAGjD,MAAMgsB,EAAelsE,EAAS0Q,OAO9B,IANAjwC,EAAAA,EAAAA,IACmB,OAAjByrG,GAAiD,qBAAjBA,EAChC,+CAIGA,EAAajnB,aAChB,OAAO/E,EAGT,MAAMisB,EAAOD,EACPL,EAAcM,EAAK1lB,WACzB,MAA2B,kBAAhBolB,EACF3rB,EAIF2rB,EAAc3rB,CACvB,EASaksB,GAA2B,SACtC7gF,EACAmlB,EACAy2D,EACA2E,GAEA,OAAOO,GACL37D,EACA,IAAI86D,GAAsBrE,EAAU57E,GACpCugF,EAEJ,EAOaQ,GAA+B,SAC1C57D,EACA1Q,EACA8rE,GAEA,OAAOO,GACL37D,EACA,IAAI66D,GAAsBvrE,GAC1B8rE,EAEJ,EAEA,SAASO,GACP37D,EACAm7D,EACAC,GAEA,MAAMS,EAAS77D,EAAKw0C,cAAc3sD,MAM5BusD,EAAW8mB,GACfW,EACAV,EAAYjmB,kBAAkB,aAC9BkmB,GAEF,IAAI9qB,EAEJ,GAAItwC,EAAKu0C,aAAc,CACrB,MAAMunB,EAAW97D,EACXxrC,EAAQ0mG,GACZY,EAAS/lB,WACTolB,EACAC,GAEF,OACE5mG,IAAUsnG,EAAS/lB,YACnB3B,IAAa0nB,EAAStnB,cAAc3sD,MAE7B,IAAI+sD,GAASpgF,EAAOqnF,GAAazH,IAEjCp0C,CAEV,CAAM,CACL,MAAM+7D,EAAe/7D,EAerB,OAdAswC,EAAUyrB,EACN3nB,IAAa2nB,EAAavnB,cAAc3sD,QAC1CyoD,EAAUA,EAAQ0E,eAAe,IAAIJ,GAASR,KAEhD2nB,EAAalmB,aAAaqB,IAAgB,CAAC/B,EAAWI,KACpD,MAAME,EAAekmB,GACnBpmB,EACA4lB,EAAYjmB,kBAAkBC,GAC9BimB,GAEE3lB,IAAiBF,IACnBjF,EAAUA,EAAQkF,qBAAqBL,EAAWM,GACnD,IAEInF,CACR,CACH;;;;;;;;;;;;;;;;GC/MG,MACU0rB,GAMXnoG,WAAAA,CACWC,EAAe,GACfsM,EAAyB,KAC3B4/B,EAAoB,CAAEppB,SAAU,CAAC,EAAGqlF,WAAY,IAF9C,KAAInoG,KAAJA,EACA,KAAMsM,OAANA,EACF,KAAI4/B,KAAJA,CAAI,EAUC,SAAAk8D,GAAexY,EAAeyY,GAE5C,IAAIthF,EAAOshF,aAAmBt2B,GAAOs2B,EAAU,IAAIt2B,GAAKs2B,GACpDh+E,EAAQulE,EACVn6E,EAAO68D,GAAavrD,GACtB,MAAgB,OAATtR,EAAe,CACpB,MAAMgsE,GAAYn5E,EAAAA,EAAAA,IAAQ+hB,EAAM6hB,KAAKppB,SAAUrN,IAAS,CACtDqN,SAAU,CAAC,EACXqlF,WAAY,GAEd99E,EAAQ,IAAI69E,GAAQzyF,EAAM4U,EAAOo3D,GACjC16D,EAAOyrD,GAAazrD,GACpBtR,EAAO68D,GAAavrD,EACrB,CAED,OAAOsD,CACT,CAOM,SAAUi+E,GAAgB1Y,GAC9B,OAAOA,EAAK1jD,KAAKxrC,KACnB,CAOgB,SAAA6nG,GAAgB3Y,EAAelvF,GAC7CkvF,EAAK1jD,KAAKxrC,MAAQA,EAClB8nG,GAAkB5Y,EACpB,CAKM,SAAU6Y,GAAmB7Y,GACjC,OAAOA,EAAK1jD,KAAKi8D,WAAa,CAChC,CAKM,SAAUO,GAAe9Y,GAC7B,YAA8BhvF,IAAvB0nG,GAAa1Y,KAAwB6Y,GAAgB7Y,EAC9D,CAOgB,SAAA+Y,GACd/Y,EACAxY,GAEApc,EAAK40B,EAAK1jD,KAAKppB,UAAU,CAACuH,EAAem6D,KACvCpN,EAAO,IAAI8wB,GAAQ79E,EAAOulE,EAAMpL,GAAW,GAE/C,CAWM,SAAUokB,GACdhZ,EACAxY,EACAyxB,EACAC,GAEID,IAAgBC,GAClB1xB,EAAOwY,GAGT+Y,GAAiB/Y,GAAMvlE,IACrBu+E,GAAsBv+E,EAAO+sD,GAAQ,EAAM0xB,EAAc,IAGvDD,GAAeC,GACjB1xB,EAAOwY,EAEX,CASG,SACamZ,GACdnZ,EACAxY,EACAyxB,GAEA,IAAI38D,EAAO28D,EAAcjZ,EAAOA,EAAKtjF,OACrC,MAAgB,OAAT4/B,EAAe,CACpB,GAAIkrC,EAAOlrC,GACT,OAAO,EAETA,EAAOA,EAAK5/B,MACb,CACD,OAAO,CACT,CAyBM,SAAU08F,GAAepZ,GAC7B,OAAO,IAAI7d,GACO,OAAhB6d,EAAKtjF,OACDsjF,EAAK5vF,KACLgpG,GAAYpZ,EAAKtjF,QAAU,IAAMsjF,EAAK5vF,KAE9C,CAKA,SAASwoG,GAAqB5Y,GACR,OAAhBA,EAAKtjF,QACP28F,GAAgBrZ,EAAKtjF,OAAQsjF,EAAK5vF,KAAM4vF,EAE5C,CAQA,SAASqZ,GAAmBrZ,EAAevO,EAAmBh3D,GAC5D,MAAM6+E,EAAaR,GAAYr+E,GACzB8+E,GAAchhG,EAAAA,EAAAA,IAASynF,EAAK1jD,KAAKppB,SAAUu+D,GAC7C6nB,GAAcC,UACTvZ,EAAK1jD,KAAKppB,SAASu+D,GAC1BuO,EAAK1jD,KAAKi8D,aACVK,GAAkB5Y,IACRsZ,GAAeC,IACzBvZ,EAAK1jD,KAAKppB,SAASu+D,GAAah3D,EAAM6hB,KACtC0jD,EAAK1jD,KAAKi8D,aACVK,GAAkB5Y,GAEtB;;;;;;;;;;;;;;;;GC3LO,MAAMwZ,GAAqB,iCAMrBC,GAAsB,+BAKtBC,GAAiB,SAEjBjoG,GAAa,SAAUC,GAClC,MACiB,kBAARA,GAAmC,IAAfA,EAAI3E,SAAiBysG,GAAmB5jG,KAAKlE,EAE5E,EAEaioG,GAAoB,SAAUl5B,GACzC,MACwB,kBAAfA,GACe,IAAtBA,EAAW1zE,SACV0sG,GAAoB7jG,KAAK6qE,EAE9B,EAEam5B,GAAwB,SAAUn5B,GAM7C,OALIA,IAEFA,EAAaA,EAAWjwE,QAAQ,mBAAoB,MAG/CmpG,GAAkBl5B,EAC3B,EAEao5B,GAAkB,SAAUnpB,GACvC,OACe,OAAbA,GACoB,kBAAbA,GACc,kBAAbA,IAA0BzmB,EAAoBymB,IACrDA,GACqB,kBAAbA,IAEPn4E,EAAAA,EAAAA,IAASm4E,EAAiB,MAEhC,EAqBaopB,GAAuB,SAClCp+F,EACAjE,EACA6/F,GAEA,MAAMngF,EACJmgF,aAAiBn1B,GAAO,IAAIiC,GAAekzB,EAAO57F,GAAe47F,EAEnE,QAAatmG,IAATyG,EACF,MAAM,IAAIhL,MACRiP,EAAc,sBAAwBkpE,GAA4BztD,IAGtE,GAAoB,oBAAT1f,EACT,MAAM,IAAIhL,MACRiP,EACE,uBACAkpE,GAA4BztD,GAC5B,oBACA1f,EAAKuyB,YAGX,GAAIigC,EAAoBxyD,GACtB,MAAM,IAAIhL,MACRiP,EACE,YACAjE,EAAKuyB,WACL,IACA46C,GAA4BztD,IAKlC,GACkB,kBAAT1f,GACPA,EAAK1K,OAAS2sG,GAAiB,IAC/B19F,EAAAA,EAAAA,IAAavE,GAAQiiG,GAErB,MAAM,IAAIjtG,MACRiP,EACE,kCACAg+F,GACA,eACA90B,GAA4BztD,GAC5B,MACA1f,EAAKjE,UAAU,EAAG,IAClB,SAMN,GAAIiE,GAAwB,kBAATA,EAAmB,CACpC,IAAIsiG,GAAc,EACdC,GAAiB,EAwBrB,GAvBA5uC,EAAK3zD,GAAM,CAAC/F,EAAaZ,KACvB,GAAY,WAARY,EACFqoG,GAAc,OACT,GAAY,cAARroG,GAA+B,QAARA,IAChCsoG,GAAiB,GACZvoG,GAAWC,IACd,MAAM,IAAIjF,MACRiP,EACE,6BACAhK,EACA,KACAkzE,GAA4BztD,GAJ9Bzb,wFAWN+oE,GAAmBttD,EAAMzlB,GACzBooG,GAAqBp+F,EAAa5K,EAAOqmB,GACzCwtD,GAAkBxtD,EAAK,IAGrB4iF,GAAeC,EACjB,MAAM,IAAIvtG,MACRiP,EACE,4BACAkpE,GAA4BztD,GAC5B,mCAGP,CACH,EAKa8iF,GAA6B,SACxCv+F,EACAw+F,GAEA,IAAIptG,EAAGqtG,EACP,IAAKrtG,EAAI,EAAGA,EAAIotG,EAAWntG,OAAQD,IAAK,CACtCqtG,EAAUD,EAAWptG,GACrB,MAAMsM,EAAO2pE,GAAUo3B,GACvB,IAAK,IAAI1+F,EAAI,EAAGA,EAAIrC,EAAKrM,OAAQ0O,IAC/B,GAAgB,cAAZrC,EAAKqC,IAAsBA,IAAMrC,EAAKrM,OAAS,QAE5C,IAAK0E,GAAW2H,EAAKqC,IAC1B,MAAM,IAAIhP,MACRiP,EACE,4BACAtC,EAAKqC,GACL,aACA0+F,EAAQnwE,WAJVtuB,sFAUP,CAKDw+F,EAAW7sF,KAAKu2D,IAChB,IAAIw2B,EAAwB,KAC5B,IAAKttG,EAAI,EAAGA,EAAIotG,EAAWntG,OAAQD,IAAK,CAEtC,GADAqtG,EAAUD,EAAWptG,GACJ,OAAbstG,GAAqBj2B,GAAai2B,EAAUD,GAC9C,MAAM,IAAI1tG,MACRiP,EACE,mBACA0+F,EAASpwE,WACT,qCACAmwE,EAAQnwE,YAGdowE,EAAWD,CACZ,CACH,EAMaE,GAA+B,SAC1C1+F,EACAlE,EACA0f,EACAgoC,GAEA,GAAIA,QAAqBnuD,IAATyG,EACd,OAGF,MAAM6iG,GAAc5+F,EAAAA,EAAAA,IAAeC,EAAQ,UAE3C,IAAMlE,GAAwB,kBAATA,GAAsB9I,MAAMC,QAAQ6I,GACvD,MAAM,IAAIhL,MACR6tG,EAAc,0DAIlB,MAAMJ,EAAqB,GAC3B9uC,EAAK3zD,GAAM,CAAC/F,EAAaZ,KACvB,MAAMqpG,EAAU,IAAIh4B,GAAKzwE,GAEzB,GADAooG,GAAqBQ,EAAaxpG,EAAOqyE,GAAUhsD,EAAMgjF,IAC5B,cAAzBt3B,GAAYs3B,KACTN,GAAgB/oG,GACnB,MAAM,IAAIrE,MACR6tG,EACE,kCACAH,EAAQnwE,WAFVswE,gGAQNJ,EAAWzqG,KAAK0qG,EAAQ,IAE1BF,GAA2BK,EAAaJ,EAC1C,EAoDaK,GAAqB,SAChC5+F,EACA6+F,EACA/5B,EACAthB,GAEA,KAAIA,QAA2BnuD,IAAfyvE,KAIXk5B,GAAkBl5B,GACrB,MAAM,IAAIh0E,OACRiP,EAAAA,EAAAA,IAAeC,EAAQ6+F,GACrB,0BACA/5B,EAFF/kE,mFAON,EAEa++F,GAAyB,SACpC9+F,EACA6+F,EACA/5B,EACAthB,GAEIshB,IAEFA,EAAaA,EAAWjwE,QAAQ,mBAAoB,MAGtD+pG,GAAmB5+F,EAAQ6+F,EAAc/5B,EAAYthB,EACvD,EAWau7C,GAAc,SACzB/+F,EACAg/F,GAGA,MAAMl6B,EAAak6B,EAAUxjF,KAAK6S,WAClC,GACuC,kBAA5B2wE,EAAUrqC,SAASn9D,MACO,IAAnCwnG,EAAUrqC,SAASn9D,KAAKpG,SACtB0E,GAAWkpG,EAAUrqC,SAAS9oC,YACY,cAA1CmzE,EAAUrqC,SAASn9D,KAAKiF,MAAM,KAAK,IACd,IAAtBqoE,EAAW1zE,SAAiB6sG,GAAsBn5B,GAEnD,MAAM,IAAIh0E,OACRiP,EAAAA,EAAAA,IAAeC,EAAQ,OAAvBD,uFAKN;;;;;;;;;;;;;;;;;ACjXG,MACUk/F,GAAbzqG,WAAAA,GACE,KAAW0qG,YAAgB,GAK3B,KAAeC,gBAAG,CAAE,EAMN,SAAAC,GACdC,EACAC,GAGA,IAAIC,EAA6B,KACjC,IAAK,IAAIpuG,EAAI,EAAGA,EAAImuG,EAAcluG,OAAQD,IAAK,CAC7C,MAAM2K,EAAOwjG,EAAcnuG,GACrBqqB,EAAO1f,EAAK0jG,UACD,OAAbD,GAAsBj3B,GAAW9sD,EAAM+jF,EAAS/jF,QAClD6jF,EAAWH,YAAYprG,KAAKyrG,GAC5BA,EAAW,MAGI,OAAbA,IACFA,EAAW,CAAEhY,OAAQ,GAAI/rE,SAG3B+jF,EAAShY,OAAOzzF,KAAKgI,EACtB,CACGyjG,GACFF,EAAWH,YAAYprG,KAAKyrG,EAEhC,CA8BG,SACaE,GACdJ,EACAK,EACAJ,GAEAF,GAAsBC,EAAYC,GAClCK,GACEN,GACAO,GACEp3B,GAAao3B,EAAWF,IACxBl3B,GAAak3B,EAAaE,IAEhC,CAEA,SAASD,GACPN,EACA/V,GAEA+V,EAAWF,kBAEX,IAAIU,GAAU,EACd,IAAK,IAAI1uG,EAAI,EAAGA,EAAIkuG,EAAWH,YAAY9tG,OAAQD,IAAK,CACtD,MAAM2uG,EAAYT,EAAWH,YAAY/tG,GACzC,GAAI2uG,EAAW,CACb,MAAMF,EAAYE,EAAUtkF,KACxB8tE,EAAUsW,IACZG,GAAeV,EAAWH,YAAY/tG,IACtCkuG,EAAWH,YAAY/tG,GAAK,MAE5B0uG,GAAU,CAEb,CACF,CAEGA,IACFR,EAAWH,YAAc,IAG3BG,EAAWF,iBACb,CAUA,SAASY,GAAeD,GACtB,IAAK,IAAI3uG,EAAI,EAAGA,EAAI2uG,EAAUvY,OAAOn2F,OAAQD,IAAK,CAChD,MAAM40E,EAAY+5B,EAAUvY,OAAOp2F,GACnC,GAAkB,OAAd40E,EAAoB,CACtB+5B,EAAUvY,OAAOp2F,GAAK,KACtB,MAAM6uG,EAAUj6B,EAAUk6B,iBACtBl/C,GACFqL,EAAI,UAAY2Z,EAAU13C,YAE5BgjC,EAAe2uC,EAChB,CACF,CACH;;;;;;;;;;;;;;;;GCpDA,MAAME,GAAmB,iBAOnBC,GAA0B,GA8C7B,MACUC,GA0BX5rG,WAAAA,CACS2sE,EACAk/B,EACAn2B,EACAo2B,GAHA,KAASn/B,UAATA,EACA,KAAgBk/B,iBAAhBA,EACA,KAAkBn2B,mBAAlBA,EACA,KAAiBo2B,kBAAjBA,EA1BT,KAAeC,gBAAG,EAKlB,KAActb,eAAyB,KACvC,KAAAub,YAAc,IAAIvB,GAClB,KAAYwB,aAAG,EAIf,KAA4BC,6BAA6C,KAGzE,KAAaroC,cAAuB0rB,KAGpC,KAAA4c,sBAAwB,IAAIhE,GAG5B,KAAqBiE,sBAAgC,KASnDnuG,KAAKsD,IAAMtD,KAAK0uE,UAAU1M,aAAc,CAM1CpmC,QAAAA,GACE,OACG57B,KAAK0uE,UAAUtN,OAAS,WAAa,WAAaphE,KAAK0uE,UAAU3pE,IAAI,EAG3E,SAEeqpG,GACdC,EACA96C,EACA+6C,GAIA,GAFAD,EAAK9oC,OAAS3C,GAA0ByrC,EAAK3/B,WAEzC2/B,EAAKT,kBAAoB/uC,IAC3BwvC,EAAK/b,QAAU,IAAI/B,GACjB8d,EAAK3/B,WACL,CACE2D,EACAhpE,EACAklG,EACA1gE,KAEA2gE,GAAiBH,EAAMh8B,EAAYhpE,EAAMklG,EAAS1gE,EAAI,GAExDwgE,EAAK52B,mBACL42B,EAAKR,mBAIPh8D,YAAW,IAAM48D,GAAoBJ,GAA2B,IAAO,OAClE,CAEL,GAA4B,qBAAjBC,GAAiD,OAAjBA,EAAuB,CAChE,GAA4B,kBAAjBA,EACT,MAAM,IAAIjwG,MACR,sEAGJ,KACE+I,EAAAA,EAAAA,GAAUknG,EACX,CAAC,MAAOhsG,GACP,MAAM,IAAIjE,MAAM,kCAAoCiE,EACrD,CACF,CAED+rG,EAAKF,sBAAwB,IAAI92B,GAC/Bg3B,EAAK3/B,UACLnb,GACA,CACE8e,EACAhpE,EACAklG,EACA1gE,KAEA2gE,GAAiBH,EAAMh8B,EAAYhpE,EAAMklG,EAAS1gE,EAAI,IAEvD6gE,IACCD,GAAoBJ,EAAMK,EAAc,IAEzChW,IACCiW,GAAuBN,EAAM3V,EAAQ,GAEvC2V,EAAK52B,mBACL42B,EAAKR,kBACLS,GAGFD,EAAK/b,QAAU+b,EAAKF,qBACrB,CAEDE,EAAK52B,mBAAmBjY,wBAAuBx5D,IAC7CqoG,EAAK/b,QAAQ7f,iBAAiBzsE,EAAM,IAGtCqoG,EAAKR,kBAAkBruC,wBAAuBr3D,IAC5CkmG,EAAK/b,QAAQ5f,qBAAqBvqE,EAAOnC,MAAM,IAKjDqoG,EAAKO,eAAiB9rC,GACpBurC,EAAK3/B,WACL,IAAM,IAAI0jB,GAAcic,EAAK9oC,OAAQ8oC,EAAK/b,WAI5C+b,EAAKQ,UAAY,IAAI5d,GACrBod,EAAKS,cAAgB,IAAI1K,GAAS,CAChCmC,eAAgBA,CAACloC,EAAOxwB,EAAKgsC,EAAevH,KAC1C,IAAIy8B,EAAsB,GAC1B,MAAM7gE,EAAOmgE,EAAKQ,UAAU1d,QAAQ9yB,EAAME,OAa1C,OAVKrwB,EAAK3jC,YACRwkG,EAAa7J,GACXmJ,EAAKS,cACLzwC,EAAME,MACNrwB,GAEF2D,YAAW,KACTygC,EAAW,KAAK,GACf,IAEEy8B,CAAU,EAEnBpI,cAAeA,SAEjBqI,GAAeX,EAAM,aAAa,GAElCA,EAAKY,gBAAkB,IAAI7K,GAAS,CAClCmC,eAAgBA,CAACloC,EAAOxwB,EAAKgsC,EAAevH,KAC1C+7B,EAAK/b,QAAQ1Y,OAAOvb,EAAOwb,EAAehsC,GAAK,CAAC0sC,EAAQlxE,KACtD,MAAMyrF,EAASxiB,EAAWiI,EAAQlxE,GAClC2jG,GACEqB,EAAKN,YACL1vC,EAAME,MACNu2B,EACD,IAGI,IAET6R,cAAeA,CAACtoC,EAAOxwB,KACrBwgE,EAAK/b,QAAQ3mC,SAAS0S,EAAOxwB,EAAI,GAGvC,CAKM,SAAUqhE,GAAeb,GAC7B,MAAMc,EAAad,EAAKQ,UAAU1d,QAAQ,IAAIpd,GAAK,2BAC7CrnE,EAAUyiG,EAAWp5E,OAAoB,EAC/C,OAAO,IAAI/yB,MAAOE,UAAYwJ,CAChC,CAKM,SAAU0iG,GAAyBf,GACvC,OAAOlF,GAAmB,CACxBr3B,UAAWo9B,GAAeb,IAE9B,CAKA,SAASG,GACPH,EACAh8B,EACAhpE,EACAklG,EACA1gE,GAGAwgE,EAAKP,kBACL,MAAM/kF,EAAO,IAAIgrD,GAAK1B,GACtBhpE,EAAOglG,EAAKJ,6BACRI,EAAKJ,6BAA6B57B,EAAYhpE,GAC9CA,EACJ,IAAIyrF,EAAS,GACb,GAAIjnD,EACF,GAAI0gE,EAAS,CACX,MAAMc,GAAiB7kG,EAAAA,EAAAA,IACrBnB,GACCqQ,GAAiBqwE,GAAarwE,KAEjCo7E,EAASmS,GACPoH,EAAKY,gBACLlmF,EACAsmF,EACAxhE,EAEH,KAAM,CACL,MAAMyhE,EAAavlB,GAAa1gF,GAChCyrF,EAASkS,GACPqH,EAAKY,gBACLlmF,EACAumF,EACAzhE,EAEH,MACI,GAAI0gE,EAAS,CAClB,MAAMxU,GAAkBvvF,EAAAA,EAAAA,IACtBnB,GACCqQ,GAAiBqwE,GAAarwE,KAEjCo7E,EAASqQ,GACPkJ,EAAKY,gBACLlmF,EACAgxE,EAEH,KAAM,CACL,MAAMrP,EAAOX,GAAa1gF,GAC1ByrF,EAASoQ,GAA6BmJ,EAAKY,gBAAiBlmF,EAAM2hE,EACnE,CACD,IAAIgB,EAAe3iE,EACf+rE,EAAOn2F,OAAS,IAGlB+sF,EAAe6jB,GAAsBlB,EAAMtlF,IAE7CikF,GAAoCqB,EAAKN,YAAariB,EAAcoJ,EACtE,CAUA,SAAS2Z,GAAoBJ,EAAYK,GACvCM,GAAeX,EAAM,YAAaK,IACZ,IAAlBA,GACFc,GAA0BnB,EAE9B,CAEA,SAASM,GAAuBN,EAAY3V,GAC1C17B,EAAK07B,GAAS,CAACp1F,EAAaZ,KAC1BssG,GAAeX,EAAM/qG,EAAKZ,EAAM,GAEpC,CAEA,SAASssG,GAAeX,EAAYh8B,EAAoB3vE,GACtD,MAAMqmB,EAAO,IAAIgrD,GAAK,UAAY1B,GAC5BmM,EAAUuL,GAAarnF,GAC7B2rG,EAAKQ,UAAUzd,eAAeroE,EAAMy1D,GACpC,MAAMsW,EAASoQ,GACbmJ,EAAKS,cACL/lF,EACAy1D,GAEFwuB,GAAoCqB,EAAKN,YAAahlF,EAAM+rE,EAC9D,CAEA,SAAS2a,GAAmBpB,GAC1B,OAAOA,EAAKL,cACd,CAgBG,SACa0B,GACdrB,EACAhwC,EACAsjC,GAGA,MAAM3gF,EAAS4mF,GAAuByG,EAAKY,gBAAiB5wC,GAC5D,OAAc,MAAVr9C,EACKrb,QAAQF,QAAQub,GAElBqtF,EAAK/b,QAAQthF,IAAIqtD,GAAO5gD,MAC7B/W,IACE,MAAMwnC,EAAO67C,GAAarjF,GAASi+E,UACjCtmB,EAAM2b,aAAaa,YAerB,IAAIia,EACJ,GAPAoS,GACEmH,EAAKY,gBACL5wC,EACAsjC,GACA,GAGEtjC,EAAM2b,aAAaE,eACrB4a,EAASoQ,GACPmJ,EAAKY,gBACL5wC,EAAME,MACNrwB,OAEG,CACL,MAAML,EAAM44D,GAAoB4H,EAAKY,gBAAiB5wC,GACtDy2B,EAASkS,GACPqH,EAAKY,gBACL5wC,EAAME,MACNrwB,EACAL,EAEH,CAuBD,OAZAm/D,GACEqB,EAAKN,YACL1vC,EAAME,MACNu2B,GAEF8Q,GACEyI,EAAKY,gBACL5wC,EACAsjC,EACA,MACA,GAEKzzD,CAAI,IAEbnyB,IACE4zF,GAAQtB,EAAM,kBAAmBjnG,EAAAA,EAAAA,GAAUi3D,GAAS,YAActiD,GAC3DpW,QAAQH,OAAO,IAAInH,MAAM0d,MAGtC,CA2DM,SAAU6zF,GACdvB,EACAtlF,EACA8mF,EACAv9B,GAEAq9B,GAAQtB,EAAM,SAAU,CAAEtlF,KAAMA,EAAK6S,WAAYl5B,MAAOmtG,IAGxD,IAAI1X,GAAQ,EACZ,MAAMmR,EAAe8F,GAAyBf,GACxCtU,EAAyC,CAAC,EAWhD,GAVA/8B,EAAK6yC,GAAiB,CAACC,EAAoBC,KACzC5X,GAAQ,EACR4B,EAAgB+V,GAAclG,GAC5B70B,GAAUhsD,EAAM+mF,GAChB/lB,GAAagmB,GACb1B,EAAKY,gBACL3F,EACD,IAGEnR,EA6CHx+B,EAAI,wDACJq2C,GAA2B3B,EAAM/7B,EAAY,UAAM1vE,OA9CzC,CACV,MAAM82F,EAAU+V,GAAmBpB,GAC7BvZ,EAASgQ,GACbuJ,EAAKY,gBACLlmF,EACAgxE,EACAL,GAEFiT,GAAsB0B,EAAKN,YAAajZ,GACxCuZ,EAAK/b,QAAQ9f,MACXzpD,EAAK6S,WACLi0E,GACA,CAACt1B,EAAQyB,KACP,MAAMpwB,EAAqB,OAAX2uB,EACX3uB,GACH6G,EAAK,aAAe1pC,EAAO,YAAcwxD,GAG3C,MAAM01B,EAAcjL,GAClBqJ,EAAKY,gBACLvV,GACC9tC,GAEG8/B,EACJukB,EAAYtxG,OAAS,EAAI4wG,GAAsBlB,EAAMtlF,GAAQA,EAC/DikF,GACEqB,EAAKN,YACLriB,EACAukB,GAEFD,GAA2B3B,EAAM/7B,EAAYiI,EAAQyB,EAAY,IAIrEhf,EAAK6yC,GAAkB5C,IACrB,MAAMvhB,EAAewkB,GACnB7B,EACAt5B,GAAUhsD,EAAMkkF,IAElBsC,GAAsBlB,EAAM3iB,EAAa,IAI3CshB,GAAoCqB,EAAKN,YAAahlF,EAAM,GAC7D,CAIH,CAKA,SAASymF,GAA0BnB,GACjCsB,GAAQtB,EAAM,sBAEd,MAAM/E,EAAe8F,GAAyBf,GACxC8B,EAA2B7e,KACjCG,GACE4c,EAAKzoC,cACLyO,MACA,CAACtrD,EAAMmlB,KACL,MAAM3X,EAAWqzE,GACf7gF,EACAmlB,EACAmgE,EAAKY,gBACL3F,GAEF/X,GAA2B4e,EAA0BpnF,EAAMwN,EAAS,IAGxE,IAAIu+D,EAAkB,GAEtBrD,GACE0e,EACA97B,MACA,CAACtrD,EAAM2hE,KACLoK,EAASA,EAAOvwE,OACd2gF,GAA6BmJ,EAAKY,gBAAiBlmF,EAAM2hE,IAE3D,MAAMgB,EAAewkB,GAAsB7B,EAAMtlF,GACjDwmF,GAAsBlB,EAAM3iB,EAAa,IAI7C2iB,EAAKzoC,cAAgB0rB,KACrB0b,GAAoCqB,EAAKN,YAAa15B,KAAgBygB,EACxE,CAmIM,SAAUsb,GAAc/B,GACxBA,EAAKF,uBACPE,EAAKF,sBAAsB3wB,UAAUiwB,GAEzC,CA4CA,SAASkC,GAAQtB,KAAenzC,GAC9B,IAAIM,EAAS,GACT6yC,EAAKF,wBACP3yC,EAAS6yC,EAAKF,sBAAsBvwF,GAAK,KAE3C+7C,EAAI6B,KAAWN,EACjB,CAEM,SAAU80C,GACd3B,EACAxoG,EACA00E,EACAyB,GAEIn2E,GACF+4D,GAAe,KACb,GAAe,OAAX2b,EACF10E,EAAS,UACJ,CACL,MAAM6C,GAAQ6xE,GAAU,SAASrgC,cACjC,IAAI/7C,EAAUuK,EACVszE,IACF79E,GAAW,KAAO69E,GAGpB,MAAMx5E,EAAQ,IAAInE,MAAMF,GAGvBqE,EAAckG,KAAOA,EACtB7C,EAASrD,EACV,IAGP,CA6HA,SAAS6tG,GACPhC,EACAtlF,EACAunF,GAEA,OACE5I,GAA+B2G,EAAKY,gBAAiBlmF,EAAMunF,IAC3DroB,GAAajI,UAEjB,CAWA,SAASuwB,GACPlC,EACAngE,EAA4BmgE,EAAKH,uBAOjC,GAJKhgE,GACHsiE,GAAwCnC,EAAMngE,GAG5Co8D,GAAap8D,GAAO,CACtB,MAAMjxB,EAAQwzF,GAA0BpC,EAAMngE,IAC9CjwC,EAAAA,EAAAA,IAAOgf,EAAMte,OAAS,EAAG,yCAEzB,MAAM+xG,EAASzzF,EAAM4Q,OAClBw+B,GAA+C,IAAlBA,EAAYkuB,SAIxCm2B,GACFC,GAAyBtC,EAAMrD,GAAY98D,GAAOjxB,EAErD,MAAUwtF,GAAgBv8D,IACzBy8D,GAAiBz8D,GAAMu1C,IACrB8sB,GAA0BlC,EAAM5qB,EAAU,GAGhD,CASA,SAASktB,GACPtC,EACAtlF,EACA9L,GAGA,MAAM2zF,EAAe3zF,EAAMzS,KAAIqmG,GACtBA,EAAIC,iBAEPC,EAAcV,GAAmBhC,EAAMtlF,EAAM6nF,GACnD,IAAII,EAAaD,EACjB,MAAME,EAAaF,EAAYx+B,OAC/B,IAAK,IAAI7zE,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IAAK,CACrC,MAAMmyG,EAAM5zF,EAAMve,IAClBT,EAAAA,EAAAA,IACY,IAAV4yG,EAAIt2B,OACJ,iEAEFs2B,EAAIt2B,OAAM,EACVs2B,EAAIK,aACJ,MAAMta,EAAezhB,GAAgBpsD,EAAM8nF,EAAI9nF,MAE/CioF,EAAaA,EAAWptB,YACtBgT,EACAia,EAAIM,yBAEP,CAED,MAAMC,EAAaJ,EAAWj7E,KAAI,GAC5Bs7E,EAAatoF,EAGnBslF,EAAK/b,QAAQh/B,IACX+9C,EAAWz1E,WACXw1E,GACC72B,IACCo1B,GAAQtB,EAAM,2BAA4B,CACxCtlF,KAAMsoF,EAAWz1E,WACjB2+C,WAGF,IAAIua,EAAkB,GACtB,GAAe,OAAXva,EAAiB,CAInB,MAAMliB,EAAY,GAClB,IAAK,IAAI35D,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IAChCue,EAAMve,GAAG67E,OAAM,EACfua,EAASA,EAAOvwE,OACdygF,GAAqBqJ,EAAKY,gBAAiBhyF,EAAMve,GAAGoyG,iBAElD7zF,EAAMve,GAAG4zE,YAGXja,EAAUh3D,MAAK,IACb4b,EAAMve,GAAG4zE,WACP,MACA,EACAr1D,EAAMve,GAAG4yG,iCAIfr0F,EAAMve,GAAG6yG,YAIXf,GACEnC,EACAjE,GAAYiE,EAAKH,sBAAuBnlF,IAG1CwnF,GAA0BlC,EAAMA,EAAKH,uBAErClB,GAAoCqB,EAAKN,YAAahlF,EAAM+rE,GAG5D,IAAK,IAAIp2F,EAAI,EAAGA,EAAI25D,EAAU15D,OAAQD,IACpCkgE,EAAevG,EAAU35D,GAE5B,KAAM,CAEL,GAAe,cAAX67E,EACF,IAAK,IAAI77E,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IACb,IAAfue,EAAMve,GAAG67E,OACXt9D,EAAMve,GAAG67E,OAAM,EAEft9D,EAAMve,GAAG67E,OAAM,MAGd,CACL9nB,EACE,kBAAoB4+C,EAAWz1E,WAAa,YAAc2+C,GAE5D,IAAK,IAAI77E,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IAChCue,EAAMve,GAAG67E,OAAM,EACft9D,EAAMve,GAAG8yG,YAAcj3B,CAE1B,CAEDg1B,GAAsBlB,EAAMtlF,EAC7B,IAEHkoF,EAEJ,CAaA,SAAS1B,GAAsBlB,EAAYpB,GACzC,MAAMwE,EAA0BC,GAC9BrD,EACApB,GAEIlkF,EAAOiiF,GAAYyG,GAEnBx0F,EAAQwzF,GAA0BpC,EAAMoD,GAG9C,OAFAE,GAA0BtD,EAAMpxF,EAAO8L,GAEhCA,CACT,CASA,SAAS4oF,GACPtD,EACApxF,EACA8L,GAEA,GAAqB,IAAjB9L,EAAMte,OACR,OAMF,MAAM05D,EAAY,GAClB,IAAIy8B,EAAkB,GAEtB,MAAM8c,EAAc30F,EAAMtJ,QAAO6lE,GAChB,IAARA,EAAEe,SAELq2B,EAAegB,EAAYpnG,KAAIgvE,GAC5BA,EAAEs3B,iBAEX,IAAK,IAAIpyG,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IAAK,CACrC,MAAM2tD,EAAcpvC,EAAMve,GACpBk4F,EAAezhB,GAAgBpsD,EAAMsjC,EAAYtjC,MACvD,IACEyoF,EADEK,GAAmB,EAOvB,IALA5zG,EAAAA,EAAAA,IACmB,OAAjB24F,EACA,iEAGoB,IAAlBvqC,EAAYkuB,OACds3B,GAAmB,EACnBL,EAAcnlD,EAAYmlD,YAC1B1c,EAASA,EAAOvwE,OACdygF,GACEqJ,EAAKY,gBACL5iD,EAAYykD,gBACZ,SAGC,GAAsB,IAAlBzkD,EAAYkuB,OACrB,GAAIluB,EAAY6kD,YAAcxD,GAC5BmE,GAAmB,EACnBL,EAAc,WACd1c,EAASA,EAAOvwE,OACdygF,GACEqJ,EAAKY,gBACL5iD,EAAYykD,gBACZ,QAGC,CAEL,MAAMgB,EAAczB,GAClBhC,EACAhiD,EAAYtjC,KACZ6nF,GAEFvkD,EAAY0lD,qBAAuBD,EACnC,MAAMlN,EAAU3nF,EAAMve,GAAGqO,OAAO+kG,EAAY/7E,OAC5C,QAAgBnzB,IAAZgiG,EAAuB,CACzB8G,GACE,qCACA9G,EACAv4C,EAAYtjC,MAEd,IAAIipF,EAAcjoB,GAAa6a,GAC/B,MAAMqN,EACe,kBAAZrN,GACI,MAAXA,IACAz6F,EAAAA,EAAAA,IAASy6F,EAAS,aACfqN,IAEHD,EAAcA,EAAY9uB,eAAe4uB,EAAYpvB,gBAGvD,MAAMwvB,EAAa7lD,EAAYykD,eACzBxH,EAAe8F,GAAyBf,GACxC8D,EAAkBrI,GACtBkI,EACAF,EACAxI,GAGFj9C,EAAY8kD,yBAA2Ba,EACvC3lD,EAAYilD,8BAAgCa,EAC5C9lD,EAAYykD,eAAiBrB,GAAmBpB,GAEhDuC,EAAatyF,OAAOsyF,EAAalyF,QAAQwzF,GAAa,GACtDpd,EAASA,EAAOvwE,OACdmgF,GACE2J,EAAKY,gBACL5iD,EAAYtjC,KACZopF,EACA9lD,EAAYykD,eACZzkD,EAAY+lD,eAGhBtd,EAASA,EAAOvwE,OACdygF,GAAqBqJ,EAAKY,gBAAiBiD,GAAY,GAE1D,MACCL,GAAmB,EACnBL,EAAc,SACd1c,EAASA,EAAOvwE,OACdygF,GACEqJ,EAAKY,gBACL5iD,EAAYykD,gBACZ,GAIP,CAEH9D,GAAoCqB,EAAKN,YAAahlF,EAAM+rE,GAC5DA,EAAS,GACL+c,IAEF50F,EAAMve,GAAG67E,OAAM,EAKf,SAAWg3B,GACT1/D,WAAW0/D,EAAW3sE,KAAKihB,MAAM,GAClC,CAFD,CAEG5oC,EAAMve,GAAG6yG,WAERt0F,EAAMve,GAAG4zE,aACS,WAAhBk/B,EACFn5C,EAAUh3D,MAAK,IACb4b,EAAMve,GAAG4zE,WAAW,MAAM,EAAOr1D,EAAMve,GAAGqzG,wBAG5C15C,EAAUh3D,MAAK,IACb4b,EAAMve,GAAG4zE,WAAW,IAAIj0E,MAAMmzG,IAAc,EAAO,SAK5D,CAGDhB,GAAwCnC,EAAMA,EAAKH,uBAGnD,IAAK,IAAIxvG,EAAI,EAAGA,EAAI25D,EAAU15D,OAAQD,IACpCkgE,EAAevG,EAAU35D,IAI3B6xG,GAA0BlC,EAAMA,EAAKH,sBACvC,CAUA,SAASwD,GACPrD,EACAtlF,GAEA,IAAI86D,EAIAwuB,EAAkBhE,EAAKH,sBAC3BrqB,EAAQvP,GAAavrD,GACrB,MAAiB,OAAV86D,QAAoDjhF,IAAlC0nG,GAAa+H,GACpCA,EAAkBjI,GAAYiI,EAAiBxuB,GAC/C96D,EAAOyrD,GAAazrD,GACpB86D,EAAQvP,GAAavrD,GAGvB,OAAOspF,CACT,CASA,SAAS5B,GACPpC,EACAgE,GAGA,MAAMC,EAAkC,GAUxC,OATAC,GACElE,EACAgE,EACAC,GAIFA,EAAiBrzF,MAAK,CAACpU,EAAGC,IAAMD,EAAE2nG,MAAQ1nG,EAAE0nG,QAErCF,CACT,CAEA,SAASC,GACPlE,EACAngE,EACAjxB,GAEA,MAAMw1F,EAAYnI,GAAap8D,GAC/B,GAAIukE,EACF,IAAK,IAAI/zG,EAAI,EAAGA,EAAI+zG,EAAU9zG,OAAQD,IACpCue,EAAM5b,KAAKoxG,EAAU/zG,IAIzBisG,GAAiBz8D,GAAM7hB,IACrBkmF,GAAsClE,EAAMhiF,EAAOpP,EAAM,GAE7D,CAKA,SAASuzF,GACPnC,EACAngE,GAEA,MAAMjxB,EAAQqtF,GAAap8D,GAC3B,GAAIjxB,EAAO,CACT,IAAIyZ,EAAK,EACT,IAAK,IAAInF,EAAO,EAAGA,EAAOtU,EAAMte,OAAQ4yB,IAChB,IAAlBtU,EAAMsU,GAAMgpD,SACdt9D,EAAMyZ,GAAMzZ,EAAMsU,GAClBmF,KAGJzZ,EAAMte,OAAS+3B,EACf6zE,GAAar8D,EAAMjxB,EAAMte,OAAS,EAAIse,OAAQra,EAC/C,CAED+nG,GAAiBz8D,GAAMu1C,IACrB+sB,GAAwCnC,EAAM5qB,EAAU,GAE5D,CASA,SAASysB,GAAsB7B,EAAYtlF,GACzC,MAAM2iE,EAAesf,GAAY0G,GAA+BrD,EAAMtlF,IAEhEspF,EAAkBjI,GAAYiE,EAAKH,sBAAuBnlF,GAYhE,OAVAgiF,GAAoBsH,GAAkBnkE,IACpCwkE,GAA4BrE,EAAMngE,EAAK,IAGzCwkE,GAA4BrE,EAAMgE,GAElCzH,GAAsByH,GAAkBnkE,IACtCwkE,GAA4BrE,EAAMngE,EAAK,IAGlCw9C,CACT,CAOA,SAASgnB,GACPrE,EACAngE,GAEA,MAAMjxB,EAAQqtF,GAAap8D,GAC3B,GAAIjxB,EAAO,CAIT,MAAMo7C,EAAY,GAIlB,IAAIy8B,EAAkB,GAClB6d,GAAY,EAChB,IAAK,IAAIj0G,EAAI,EAAGA,EAAIue,EAAMte,OAAQD,IACb,IAAfue,EAAMve,GAAG67E,SAEa,IAAft9D,EAAMve,GAAG67E,SAClBt8E,EAAAA,EAAAA,IACE00G,IAAaj0G,EAAI,EACjB,mDAEFi0G,EAAWj0G,EAEXue,EAAMve,GAAG67E,OAAM,EACft9D,EAAMve,GAAG8yG,YAAc,SAEvBvzG,EAAAA,EAAAA,IAC2C,IAAzCgf,EAAMve,GAAG67E,OACT,0CAGFt9D,EAAMve,GAAG6yG,YACTzc,EAASA,EAAOvwE,OACdygF,GACEqJ,EAAKY,gBACLhyF,EAAMve,GAAGoyG,gBACT,IAGA7zF,EAAMve,GAAG4zE,YACXja,EAAUh3D,KACR4b,EAAMve,GAAG4zE,WAAW50D,KAAK,KAAM,IAAIrf,MAAM,QAAQ,EAAO,UAK9C,IAAds0G,EAEFpI,GAAar8D,OAAMtrC,GAGnBqa,EAAMte,OAASg0G,EAAW,EAI5B3F,GACEqB,EAAKN,YACL/C,GAAY98D,GACZ4mD,GAEF,IAAK,IAAIp2F,EAAI,EAAGA,EAAI25D,EAAU15D,OAAQD,IACpCkgE,EAAevG,EAAU35D,GAE5B,CACH;;;;;;;;;;;;;;;;GCrhDA,SAASk0G,GAAWvgC,GAClB,IAAIwgC,EAAoB,GACxB,MAAM/9B,EAASzC,EAAWroE,MAAM,KAChC,IAAK,IAAItL,EAAI,EAAGA,EAAIo2E,EAAOn2E,OAAQD,IACjC,GAAIo2E,EAAOp2E,GAAGC,OAAS,EAAG,CACxB,IAAIm0G,EAAQh+B,EAAOp2E,GACnB,IACEo0G,EAAQC,mBAAmBD,EAAM1wG,QAAQ,MAAO,KACjD,CAAC,MAAOE,GAAI,CACbuwG,GAAqB,IAAMC,CAC5B,CAEH,OAAOD,CACT,CAKA,SAASG,GAAYC,GACnB,MAAMC,EAAU,CAAC,EACa,MAA1BD,EAAYtxG,OAAO,KACrBsxG,EAAcA,EAAY7tG,UAAU,IAEtC,IAAK,MAAM+tG,KAAWF,EAAYjpG,MAAM,KAAM,CAC5C,GAAuB,IAAnBmpG,EAAQx0G,OACV,SAEF,MAAMy0G,EAAKD,EAAQnpG,MAAM,KACP,IAAdopG,EAAGz0G,OACLu0G,EAAQH,mBAAmBK,EAAG,KAAOL,mBAAmBK,EAAG,IAE3D3gD,EAA+B,0BAAA0gD,gBAAsBF,KAExD,CACD,OAAOC,CACT,CAEO,MAAMG,GAAgB,SAC3BC,EACAhyC,GAEA,MAAMirC,EAAYgH,GAAiBD,GACjCl6E,EAAYmzE,EAAUnzE,UAEC,iBAArBmzE,EAAU5jC,QACZlN,EACE8wC,EAAUxnG,KAAVwnG,8EAQAnzE,GAA2B,cAAdA,GACM,cAArBmzE,EAAU5jC,QAEVlN,EACE,gFAIC8wC,EAAUnrC,QACb1F,IAGF,MAAM2F,EAAqC,OAArBkrC,EAAUiH,QAAwC,QAArBjH,EAAUiH,OAE7D,MAAO,CACLtxC,SAAU,IAAIf,GACZorC,EAAUxnG,KACVwnG,EAAUnrC,OACVhoC,EACAioC,EACAC,EACoB,GACeloC,IAAcmzE,EAAUkH,WAE7D1qF,KAAM,IAAIgrD,GAAKw4B,EAAUl6B,YAE7B,EAEakhC,GAAmB,SAAUD,GAWxC,IAAIvuG,EAAO,GACT4jE,EAAS,GACT8qC,EAAY,GACZphC,EAAa,GACbj5C,EAAY,GAGVgoC,GAAS,EACXoyC,EAAS,QACTtuG,EAAO,IAGT,GAAuB,kBAAZouG,EAAsB,CAE/B,IAAII,EAAWJ,EAAQ50F,QAAQ,MAC3Bg1F,GAAY,IACdF,EAASF,EAAQluG,UAAU,EAAGsuG,EAAW,GACzCJ,EAAUA,EAAQluG,UAAUsuG,EAAW,IAIzC,IAAIC,EAAWL,EAAQ50F,QAAQ,MACb,IAAdi1F,IACFA,EAAWL,EAAQ30G,QAErB,IAAIi1G,EAAkBN,EAAQ50F,QAAQ,MACb,IAArBk1F,IACFA,EAAkBN,EAAQ30G,QAE5BoG,EAAOuuG,EAAQluG,UAAU,EAAGw/B,KAAKC,IAAI8uE,EAAUC,IAC3CD,EAAWC,IAEbvhC,EAAaugC,GAAWU,EAAQluG,UAAUuuG,EAAUC,KAEtD,MAAM7jB,EAAcijB,GAClBM,EAAQluG,UAAUw/B,KAAKC,IAAIyuE,EAAQ30G,OAAQi1G,KAI7CF,EAAW3uG,EAAK2Z,QAAQ,KACpBg1F,GAAY,GACdtyC,EAAoB,UAAXoyC,GAAiC,QAAXA,EAC/BtuG,EAAOC,SAASJ,EAAKK,UAAUsuG,EAAW,GAAI,KAE9CA,EAAW3uG,EAAKpG,OAGlB,MAAMk1G,EAAkB9uG,EAAK+a,MAAM,EAAG4zF,GACtC,GAAsC,cAAlCG,EAAgBhyF,cAClB8mD,EAAS,iBACJ,GAAIkrC,EAAgB7pG,MAAM,KAAKrL,QAAU,EAC9CgqE,EAASkrC,MACJ,CAEL,MAAMC,EAAS/uG,EAAK2Z,QAAQ,KAC5B+0F,EAAY1uG,EAAKK,UAAU,EAAG0uG,GAAQjyF,cACtC8mD,EAAS5jE,EAAKK,UAAU0uG,EAAS,GAEjC16E,EAAYq6E,CACb,CAEG,OAAQ1jB,IACV32D,EAAY22D,EAAY,MAE3B,CAED,MAAO,CACLhrF,OACAG,OACAyjE,SACA8qC,YACAryC,SACAoyC,SACAnhC,aACAj5C,YAEJ,EClKM26E,GACJ,oEAsByB,WAGzB,IAAIC,EAAe,EAMnB,MAAMC,EAA0B,EAqClC,EA9C2B;;;;;;;;;;;;;;;;;ACAxB,MACUC,GAOXnyG,WAAAA,CACSoxE,EACAwuB,EACAwS,EACAze,GAHA,KAASviB,UAATA,EACA,KAAiBwuB,kBAAjBA,EACA,KAAQwS,SAARA,EACA,KAAQze,SAARA,CAAQ,CAEjBqX,OAAAA,GACE,MAAM9xF,EAAMjb,KAAKm0G,SAASl5F,IAC1B,MAAuB,UAAnBjb,KAAKmzE,UACAl4D,EAAIsjD,MAEJtjD,EAAI3M,OAAOiwD,KACnB,CAEH61C,YAAAA,GACE,OAAOp0G,KAAKmzE,SAAU,CAExBq6B,cAAAA,GACE,OAAOxtG,KAAK2hG,kBAAkB6L,eAAextG,KAAM,CAErD47B,QAAAA,GACE,OACE57B,KAAK+sG,UAAUnxE,WACf,IACA57B,KAAKmzE,UACL,KACA/rE,EAAAA,EAAAA,GAAUpH,KAAKm0G,SAASE,YAAY,EAGzC,MAEYC,GACXvyG,WAAAA,CACS4/F,EACAn/F,EACAumB,GAFA,KAAiB44E,kBAAjBA,EACA,KAAKn/F,MAALA,EACA,KAAIumB,KAAJA,CAAI,CAEbgkF,OAAAA,GACE,OAAO/sG,KAAK+oB,IAAK,CAEnBqrF,YAAAA,GACE,MAAO,QAAS,CAElB5G,cAAAA,GACE,OAAOxtG,KAAK2hG,kBAAkB6L,eAAextG,KAAM,CAErD47B,QAAAA,GACE,OAAO57B,KAAK+oB,KAAK6S,WAAa,SAAU;;;;;;;;;;;;;;;;GC5DzC,MACU24E,GACXxyG,WAAAA,CACmByyG,EACAC,GADA,KAAgBD,iBAAhBA,EACA,KAAcC,eAAdA,CAAc,CAGjCC,OAAAA,CACEC,EACAC,GAEA50G,KAAKw0G,iBAAiBnqG,KAAK,KAAMsqG,EAAiBC,EAAmB,CAGvEC,QAAAA,CAASryG,GAKP,OAJAvE,EAAAA,EAAAA,IACE+B,KAAK80G,kBACL,gEAEK90G,KAAKy0G,eAAepqG,KAAK,KAAM7H,EAAO,CAG/C,qBAAIsyG,GACF,QAAS90G,KAAKy0G,cAAe,CAG/BjlF,OAAAA,CAAQsmD,GACN,OACE91E,KAAKw0G,mBAAqB1+B,EAAM0+B,uBACQ5xG,IAAvC5C,KAAKw0G,iBAAiBO,cACrB/0G,KAAKw0G,iBAAiBO,eACpBj/B,EAAM0+B,iBAAiBO,cACzB/0G,KAAKw0G,iBAAiBt8E,UAAY49C,EAAM0+B,iBAAiBt8E,OAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACoBtE,MACU88E,GAIXjzG,WAAAA,CACW4hG,EACAplC,EACAyb,EACAi7B,GAHA,KAAKtR,MAALA,EACA,KAAKplC,MAALA,EACA,KAAYyb,aAAZA,EACA,KAAci7B,eAAdA,CAAc,CAGzB,OAAI3xG,GACF,OAAI4xE,GAAYl1E,KAAKu+D,OACZ,KAEAkW,GAAYz0E,KAAKu+D,MACzB,CAGH,OAAItjD,GACF,OAAO,IAAIi6F,GAAcl1G,KAAK2jG,MAAO3jG,KAAKu+D,MAAO,CAGnD,oBAAIwb,GACF,MAAM3vE,EAAMimF,GAA0BrwF,KAAKg6E,cACrCp8D,EAAKg/C,EAAkBxyD,GAC7B,MAAc,OAAPwT,EAAc,UAAYA,CAAG,CAMtC,gBAAI67D,GACF,OAAO4W,GAA0BrwF,KAAKg6E,aAAc,CAGtDm7B,OAAAA,CAAQr/B,GAEN,GADAA,GAAQjoE,EAAAA,EAAAA,IAAmBioE,KACrBA,aAAiBk/B,IACrB,OAAO,EAGT,MAAMI,EAAWp1G,KAAK2jG,QAAU7tB,EAAM6tB,MAChC0R,EAAWx/B,GAAW71E,KAAKu+D,MAAOuX,EAAMvX,OACxC+2C,EACJt1G,KAAK+5E,mBAAqBjE,EAAMiE,iBAElC,OAAOq7B,GAAYC,GAAYC,CAAoB,CAGrDC,MAAAA,GACE,OAAOv1G,KAAK47B,UAAW,CAGzBA,QAAAA,GACE,OAAO57B,KAAK2jG,MAAM/nE,WAAa84C,GAAuB10E,KAAKu+D,MAAO,EAiGhE,MAAO22C,WAAsBF,GAEjCjzG,WAAAA,CAAYssG,EAAYtlF,GACtBngB,MAAMylG,EAAMtlF,EAAM,IAAIkmE,IAAe,EAAO,CAG9C,UAAI3gF,GACF,MAAMknG,EAAa3gC,GAAW70E,KAAKu+D,OACnC,OAAsB,OAAfi3C,EACH,KACA,IAAIN,GAAcl1G,KAAK2jG,MAAO6R,EAAY,CAGhD,QAAItxF,GACF,IAAIjJ,EAAqBjb,KACzB,MAAsB,OAAfib,EAAI3M,OACT2M,EAAMA,EAAI3M,OAEZ,OAAO2M,CAAI,EAiBZ,MACUw6F,GAOX1zG,WAAAA,CACW2zG,EAIAz6F,EACA06F,GALA,KAAKD,MAALA,EAIA,KAAGz6F,IAAHA,EACA,KAAM06F,OAANA,CAAM,CAWjB,YAAIrzB,GAEF,OAAOtiF,KAAK01G,MAAMhzB,cAAc3sD,KAAgC,CAYlE,OAAIzyB,GACF,OAAOtD,KAAKib,IAAI3X,GAAI,CAItB,QAAI4N,GACF,OAAOlR,KAAK01G,MAAM5xB,aAAc,CAelCz3D,KAAAA,CAAMtD,GACJ,MAAM2tE,EAAY,IAAI3iB,GAAKhrD,GACrB6sF,EAAWvpF,GAAMrsB,KAAKib,IAAK8N,GACjC,OAAO,IAAI0sF,GACTz1G,KAAK01G,MAAMpyB,SAASoT,GACpBkf,EACAxwB,GACA,CAMJywB,MAAAA,GACE,OAAQ71G,KAAK01G,MAAMnrG,SAAU,CAa/B8pG,SAAAA,GACE,OAAOr0G,KAAK01G,MAAM3/E,KAAI,EAAM,CAqB9BnqB,OAAAA,CAAQwtE,GACN,GAAIp5E,KAAK01G,MAAMjzB,aACb,OAAO,EAGT,MAAMwnB,EAAejqG,KAAK01G,MAE1B,QAASzL,EAAalmB,aAAa/jF,KAAK21G,QAAQ,CAACryG,EAAK4qC,IAC7CkrC,EACL,IAAIq8B,GAAavnE,EAAM7hB,GAAMrsB,KAAKib,IAAK3X,GAAM8hF,MAE9C,CAUL7B,QAAAA,CAASx6D,GACP,MAAM2tE,EAAY,IAAI3iB,GAAKhrD,GAC3B,OAAQ/oB,KAAK01G,MAAMpyB,SAASoT,GAAWnsF,SAAU,CAenDurG,WAAAA,GACE,OAAI91G,KAAK01G,MAAMjzB,eAGLziF,KAAK01G,MAAMnrG,SACpB,CAMHgrG,MAAAA,GACE,OAAOv1G,KAAKq0G,WAAY,CAe1Bt+E,GAAAA,GACE,OAAO/1B,KAAK01G,MAAM3/E,KAAM,EAyBZ,SAAA9a,GAAIiyC,EAAcnkC,GAGhC,OAFAmkC,GAAKr/C,EAAAA,EAAAA,IAAmBq/C,GACxBA,EAAG6oD,iBAAiB,YACJnzG,IAATmmB,EAAqBsD,GAAM6gC,EAAG8oD,MAAOjtF,GAAQmkC,EAAG8oD,KACzD,CAqDgB,SAAA3pF,GACd/d,EACAya,GAQA,OANAza,GAAST,EAAAA,EAAAA,IAAmBS,GACO,OAA/BgmE,GAAahmE,EAAOiwD,OACtB8tC,GAAuB,QAAS,OAAQtjF,GAAM,GAE9CojF,GAAmB,QAAS,OAAQpjF,GAAM,GAErC,IAAImsF,GAAc5mG,EAAOq1F,MAAO5uB,GAAUzmE,EAAOiwD,MAAOx1C,GACjE,CAiPgB,SAAAhc,GAAOkO,EAAwBlI,GAC7Ck5F,GAA6B,SAAUl5F,EAAQkI,EAAIsjD,OAAO,GAC1D,MAAMvH,EAAW,IAAIzxD,EAAAA,GAOrB,OANAqqG,GACE30F,EAAI0oF,MACJ1oF,EAAIsjD,MACJxrD,EACAikD,EAASpxD,cAAa,UAEjBoxD,EAAStxD,OAClB,CAUM,SAAUsL,GAAIqtD,GAClBA,GAAQxwD,EAAAA,EAAAA,IAAmBwwD,GAC3B,MAAM43C,EAAkB,IAAI1B,IAAgB,SACtC70E,EAAY,IAAIw2E,GAAuBD,GAC7C,OAAOvG,GAAarxC,EAAMslC,MAAOtlC,EAAO3+B,GAAWjiB,MAAKywB,GAC/C,IAAIunE,GACTvnE,EACA,IAAIgnE,GAAc72C,EAAMslC,MAAOtlC,EAAME,OACrCF,EAAM2b,aAAaa,aAGzB,CAGG,MACUq7B,GACXn0G,WAAAA,CAAoBk0G,GAAA,KAAeA,gBAAfA,CAAe,CAEnCzgB,UAAAA,CAAWriB,GACT,MAAqB,UAAdA,CAAsB,CAG/BsiB,WAAAA,CAAYT,EAAgB32B,GAC1B,MAAM9vD,EAAQ8vD,EAAM2b,aAAaa,WACjC,OAAO,IAAIq5B,GACT,QACAl0G,KACA,IAAIy1G,GACFzgB,EAAO/J,aACP,IAAIiqB,GAAc72C,EAAMslC,MAAOtlC,EAAME,OACrChwD,GAEF,CAGJi/F,cAAAA,CAAel6B,GACb,MAAiC,WAA7BA,EAAU8gC,eACL,IACLp0G,KAAKi2G,gBAAgBpB,SAAUvhC,EAA0B9wE,OAEpD,IACLxC,KAAKi2G,gBAAgBvB,QAASphC,EAAwB6gC,SAAU,KACnE,CAGHnS,iBAAAA,CAAkBx/F,EAAcumB,GAC9B,OAAI/oB,KAAKi2G,gBAAgBnB,kBAChB,IAAIR,GAAYt0G,KAAMwC,EAAOumB,GAE7B,IACR,CAGHyG,OAAAA,CAAQsmD,GACN,OAAMA,aAAiBogC,MAEXpgC,EAAMmgC,kBAAoBj2G,KAAKi2G,iBAIlCngC,EAAMmgC,gBAAgBzmF,QAAQxvB,KAAKi2G,iBAC3C,CAGH/T,cAAAA,GACE,OAAgC,OAAzBliG,KAAKi2G,eAAyB,EA02CzCrT,GAAiCsS,IACjCjR,GAAgCiR;;;;;;;;;;;;;;;;;AC1pEhC,MAAMiB,GAAsC,kCAKtCC,GAIF,CAAC,EAKL,IAAIC,IAAgB,EAKpB,SAASC,GACPjI,EACAtpG,EACAG,EACAqxG,GAEAlI,EAAK3/B,UAAY,IAAIvN,GAChB,GAAAp8D,KAAQG,KACG,EACdmpG,EAAK3/B,UAAUt1C,UACfi1E,EAAK3/B,UAAUrN,cACfgtC,EAAK3/B,UAAUpN,UACf+sC,EAAK3/B,UAAUnN,eACf8sC,EAAK3/B,UAAUlN,+BACM,GAGnB+0C,IACFlI,EAAK52B,mBAAqB8+B,EAE9B,CAMM,SAAUC,GACdl/E,EACAm/E,EACAr3C,EACA0K,EACAxI,GAEA,IAAIo1C,EAA4B5sC,GAAOxyC,EAAI3V,QAAQg1F,iBACrC/zG,IAAV8zG,IACGp/E,EAAI3V,QAAQ1b,WACfw1D,EACE,kHAKJ9B,EAAI,kCAAmCriC,EAAI3V,QAAQ1b,WACnDywG,EAAQ,GAAGp/E,EAAI3V,QAAQ1b,yCAGzB,IAGI2wG,EAEAC,EALAtK,EAAY8G,GAAcqD,EAAOp1C,GACjCY,EAAWqqC,EAAUrqC,SAKF,qBAAZp+D,UACT+yG,EAAiB/yG,CAAAA,SAAAA,aAAAA,SAAAA,KAAYqyG,KAG3BU,GACFD,GAAa,EACbF,EAAQ,UAAUG,QAAqB30C,EAAS9oC,YAChDmzE,EAAY8G,GAAcqD,EAAOp1C,GACjCY,EAAWqqC,EAAUrqC,UAErB00C,GAAcrK,EAAUrqC,SAASd,OAGnC,MAAM01C,EACJx1C,GAAas1C,EACT,IAAIv2C,EAAsBA,EAAsBE,OAChD,IAAIX,EAA0BtoC,EAAIt1B,KAAMs1B,EAAI3V,QAAS80F,GAE3DnK,GAAY,gCAAiCC,GACxCr3B,GAAYq3B,EAAUxjF,OACzB0yC,EACE,4FAKJ,MAAM4yC,EAAO0I,GACX70C,EACA5qC,EACAw/E,EACA,IAAI53C,EAAsB5nC,EAAIt1B,KAAMo9D,IAEtC,OAAO,IAAI43C,GAAS3I,EAAM/2E,EAC5B,CAMA,SAAS2/E,GAAsB5I,EAAYz8C,GACzC,MAAMslD,EAAWd,GAAMxkD,GAElBslD,GAAYA,EAAS7I,EAAK/qG,OAAS+qG,GACtC5yC,EAAM,YAAY7J,KAAWy8C,EAAK3/B,wCAEpC0hC,GAAc/B,UACP6I,EAAS7I,EAAK/qG,IACvB,CASA,SAASyzG,GACP70C,EACA5qC,EACAw/E,EACA13C,GAEA,IAAI83C,EAAWd,GAAM9+E,EAAIt1B,MAEpBk1G,IACHA,EAAW,CAAC,EACZd,GAAM9+E,EAAIt1B,MAAQk1G,GAGpB,IAAI7I,EAAO6I,EAASh1C,EAASF,eAS7B,OARIqsC,GACF5yC,EACE,2HAGJ4yC,EAAO,IAAIV,GAAKzrC,EAAUm0C,GAAeS,EAAmB13C,GAC5D83C,EAASh1C,EAASF,eAAiBqsC,EAE5BA,CACT,CAWG,MACU2I,GAWXj1G,WAAAA,CACSo1G,EAEE7/E,GAFF,KAAa6/E,cAAbA,EAEE,KAAG7/E,IAAHA,EAZF,KAAM,QAAG,WAGlB,KAAgB8/E,kBAAY,CAAM,CAYlC,SAAIzT,GASF,OARK3jG,KAAKo3G,mBACRhJ,GACEpuG,KAAKm3G,cACLn3G,KAAKs3B,IAAI3V,QAAQ4xC,MACjBvzD,KAAKs3B,IAAI3V,QAAQ,iCAEnB3hB,KAAKo3G,kBAAmB,GAEnBp3G,KAAKm3G,aAAc,CAG5B,SAAInB,GAIF,OAHKh2G,KAAKq3G,gBACRr3G,KAAKq3G,cAAgB,IAAInC,GAAcl1G,KAAK2jG,MAAOtvB,OAE9Cr0E,KAAKq3G,aAAc,CAG5B1/C,OAAAA,GAME,OAL2B,OAAvB33D,KAAKq3G,gBACPJ,GAAsBj3G,KAAK2jG,MAAO3jG,KAAKs3B,IAAIt1B,MAC3ChC,KAAKm3G,cAAgB,KACrBn3G,KAAKq3G,cAAgB,MAEhB1xG,QAAQF,SAAU,CAG3BswG,gBAAAA,CAAiBuB,GACY,OAAvBt3G,KAAKq3G,eACP57C,EAAM,eAAiB67C,EAAU,0BAClC,EAuCF,SACaC,GACdjgF,GAAmB46B,EAAAA,EAAAA,MACnB4X,GAEA,MAAM5c,GAAK0D,EAAAA,EAAAA,IAAat5B,EAAK,YAAY42B,aAAa,CACpD2I,WAAYiT,IAEd,IAAK5c,EAAGkqD,iBAAkB,CACxB,MAAMI,GAAW1yG,EAAAA,EAAAA,IAAkC,YAC/C0yG,GACFC,GAAwBvqD,KAAOsqD,EAElC,CACD,OAAOtqD,CACT,CAaM,SAAUuqD,GACdvqD,EACAnoD,EACAG,EACAyc,EAEI,CAAC,GAELurC,GAAKr/C,EAAAA,EAAAA,IAAmBq/C,GACxBA,EAAG6oD,iBAAiB,eAChB7oD,EAAGkqD,kBACL37C,EACE,0EAIJ,MAAM4yC,EAAOnhD,EAAGiqD,cAChB,IAAIZ,EACJ,GAAIlI,EAAK3/B,UAAUpN,UACb3/C,EAAQ+1F,eACVj8C,EACE,sJAGJ86C,EAAgB,IAAIl2C,EAAsBA,EAAsBE,YAC3D,GAAI5+C,EAAQ+1F,cAAe,CAChC,MAAM1xG,EAC6B,kBAA1B2b,EAAQ+1F,cACX/1F,EAAQ+1F,eACR3xG,EAAAA,EAAAA,IAAoB4b,EAAQ+1F,cAAexqD,EAAG51B,IAAI3V,QAAQ1b,WAChEswG,EAAgB,IAAIl2C,EAAsBr6D,EAC3C,CAGDswG,GAAiCjI,EAAMtpG,EAAMG,EAAMqxG,EACrD;;;;;;;;;;;;;;;;;AC5VM,SAAUoB,GAAiBtlD,GAC/BuH,EAAcg+C,EAAAA,KACdnnD,EAAAA,EAAAA,IACE,IAAI1tC,EAAAA,GACF,YACA,CAAC2c,GAAa03B,mBAAoB0S,MAChC,MAAMxyC,EAAMoI,EAAUoxB,YAAY,OAAO5C,eACnCuoD,EAAe/2E,EAAUoxB,YAAY,iBACrCsO,EAAmB1/B,EAAUoxB,YAAY,sBAC/C,OAAO0lD,GACLl/E,EACAm/E,EACAr3C,EACA0K,EACD,GACD,UAEFzT,sBAAqB,KAEzBlE,EAAAA,EAAAA,IAAgBnwD,EAAM22B,EAAS05B,IAE/BF,EAAAA,EAAAA,IAAgBnwD,EAAM22B,EAAS,UACjC;;;;;;;;;;;;;;;;GCzBC0+C,GAAqBvuE,UAAkB+uG,aAAe,SACrDxlC,EACAC,GAEAtyE,KAAKwwE,YAAY,IAAK,CAAE/xE,EAAG4zE,GAAcC,EAC3C,EAGC+E,GAAqBvuE,UAAkBgvG,KAAO,SAC7CzuG,EACA0uG,GAEA/3G,KAAKwwE,YAAY,OAAQ,CAAE1jE,EAAGzD,GAAQ0uG,EACxC,ECXAJ,I;;AC1BA,SAAShxG,EAAQ9D,GACf,IAAK,IAAInE,EAAI,EAAGA,EAAIk7B,UAAUj7B,OAAQD,IAAK,CACzC,IAAIoE,EAAS82B,UAAUl7B,GACvB,IAAK,IAAI4E,KAAOR,EACdD,EAAOS,GAAOR,EAAOQ,EAEzB,CACA,OAAOT,CACT,CAIA,IAAIm1G,EAAmB,CACrBjkD,KAAM,SAAUrxD,GAId,MAHiB,MAAbA,EAAM,KACRA,EAAQA,EAAMod,MAAM,GAAI,IAEnBpd,EAAMN,QAAQ,mBAAoB2wG,mBAC3C,EACAlqC,MAAO,SAAUnmE,GACf,OAAOoJ,mBAAmBpJ,GAAON,QAC/B,2CACA2wG,mBAEJ,GAMF,SAASkF,EAAMC,EAAWC,GACxB,SAASvmG,EAAK5P,EAAMU,EAAO01G,GACzB,GAAwB,qBAAbj0G,SAAX,CAIAi0G,EAAazxG,EAAO,CAAC,EAAGwxG,EAAmBC,GAET,kBAAvBA,EAAWC,UACpBD,EAAWC,QAAU,IAAIr1G,KAAKA,KAAKkzC,MAA6B,MAArBkiE,EAAWC,UAEpDD,EAAWC,UACbD,EAAWC,QAAUD,EAAWC,QAAQC,eAG1Ct2G,EAAO8J,mBAAmB9J,GACvBI,QAAQ,uBAAwB2wG,oBAChC3wG,QAAQ,QAASm2G,QAEpB,IAAIC,EAAwB,GAC5B,IAAK,IAAIC,KAAiBL,EACnBA,EAAWK,KAIhBD,GAAyB,KAAOC,GAEE,IAA9BL,EAAWK,KAWfD,GAAyB,IAAMJ,EAAWK,GAAezuG,MAAM,KAAK,KAGtE,OAAQ7F,SAASE,OACfrC,EAAO,IAAMk2G,EAAUrvC,MAAMnmE,EAAOV,GAAQw2G,CAtC9C,CAuCF,CAEA,SAASxnG,EAAKhP,GACZ,GAAwB,qBAAbmC,YAA6By1B,UAAUj7B,QAAWqD,GAA7D,CAQA,IAFA,IAAI02G,EAAUv0G,SAASE,OAASF,SAASE,OAAO2F,MAAM,MAAQ,GAC1D2uG,EAAM,CAAC,EACFj6G,EAAI,EAAGA,EAAIg6G,EAAQ/5G,OAAQD,IAAK,CACvC,IAAIqL,EAAQ2uG,EAAQh6G,GAAGsL,MAAM,KACzBtH,EAAQqH,EAAM+V,MAAM,GAAGtgB,KAAK,KAEhC,IACE,IAAIo5G,EAAQ7F,mBAAmBhpG,EAAM,IAGrC,GAFA4uG,EAAIC,GAASV,EAAUnkD,KAAKrxD,EAAOk2G,GAE/B52G,IAAS42G,EACX,KAEJ,CAAE,MAAOt2G,GAAI,CACf,CAEA,OAAON,EAAO22G,EAAI32G,GAAQ22G,CApB1B,CAqBF,CAEA,OAAO51G,OAAOkG,OACZ,CACE2I,MACAZ,MACA0X,OAAQ,SAAU1mB,EAAMo2G,GACtBxmG,EACE5P,EACA,GACA2E,EAAO,CAAC,EAAGyxG,EAAY,CACrBC,SAAU,IAGhB,EACAQ,eAAgB,SAAUT,GACxB,OAAOH,EAAKj4G,KAAKk4G,UAAWvxG,EAAO,CAAC,EAAG3G,KAAKo4G,WAAYA,GAC1D,EACAU,cAAe,SAAUZ,GACvB,OAAOD,EAAKtxG,EAAO,CAAC,EAAG3G,KAAKk4G,UAAWA,GAAYl4G,KAAKo4G,WAC1D,GAEF,CACEA,WAAY,CAAE11G,MAAOK,OAAOg2G,OAAOZ,IACnCD,UAAW,CAAEx1G,MAAOK,OAAOg2G,OAAOb,KAGxC,CAEUD,EAAKD,EAAkB,CAAEjvF,KAAM,K;;;;;;AC1HzC,MAAMiwF,EAA8B,qBAAXv1G,OAEzB,SAASw1G,EAAW7uG,GAChB,OAAOA,EAAI8uG,YAA0C,WAA5B9uG,EAAIoI,OAAO2mG,YACxC,CACA,MAAMxyG,EAAS5D,OAAO4D,OACtB,SAASyyG,EAAc3uG,EAAIiB,GACvB,MAAM2tG,EAAY,CAAC,EACnB,IAAK,MAAM/1G,KAAOoI,EAAQ,CACtB,MAAMhJ,EAAQgJ,EAAOpI,GACrB+1G,EAAU/1G,GAAO9C,EAAQkC,GACnBA,EAAM8H,IAAIC,GACVA,EAAG/H,EACb,CACA,OAAO22G,CACX,CACA,MAAMC,EAAOA,OAKP94G,EAAUD,MAAMC,QAQtB,MAAM+4G,EAAoB,MACpBC,EAAuBzwF,GAASA,EAAK3mB,QAAQm3G,EAAmB,IAUtE,SAASE,EAASC,EAAY/9C,EAAUg+C,EAAkB,KACtD,IAAI5wF,EAAMs1C,EAAQ,CAAC,EAAGu7C,EAAe,GAAIrnC,EAAO,GAGhD,MAAMsnC,EAAUl+C,EAASj9C,QAAQ,KACjC,IAAIo7F,EAAYn+C,EAASj9C,QAAQ,KAkBjC,OAhBIm7F,EAAUC,GAAaD,GAAW,IAClCC,GAAa,GAEbA,GAAa,IACb/wF,EAAO4yC,EAAS77C,MAAM,EAAGg6F,GACzBF,EAAej+C,EAAS77C,MAAMg6F,EAAY,EAAGD,GAAW,EAAIA,EAAUl+C,EAASh9D,QAC/E0/D,EAAQq7C,EAAWE,IAEnBC,GAAW,IACX9wF,EAAOA,GAAQ4yC,EAAS77C,MAAM,EAAG+5F,GAEjCtnC,EAAO5W,EAAS77C,MAAM+5F,EAASl+C,EAASh9D,SAG5CoqB,EAAOgxF,EAA4B,MAARhxF,EAAeA,EAAO4yC,EAAUg+C,GAEpD,CACH5iB,SAAUhuE,GAAQ6wF,GAAgB,KAAOA,EAAernC,EACxDxpD,OACAs1C,QACAkU,OAER,CAOA,SAASynC,EAAaC,EAAgBt+C,GAClC,MAAM0C,EAAQ1C,EAAS0C,MAAQ47C,EAAet+C,EAAS0C,OAAS,GAChE,OAAO1C,EAAS5yC,MAAQs1C,GAAS,KAAOA,GAAS1C,EAAS4W,MAAQ,GACtE,CAOA,SAAS2nC,EAAUC,EAAUjkF,GAEzB,OAAKA,GAASikF,EAASt4F,cAAcjC,WAAWsW,EAAKrU,eAE9Cs4F,EAASr6F,MAAMoW,EAAKv3B,SAAW,IAD3Bw7G,CAEf,CAUA,SAASC,EAAoBH,EAAgBpvG,EAAGC,GAC5C,MAAMuvG,EAAaxvG,EAAEyvG,QAAQ37G,OAAS,EAChC47G,EAAazvG,EAAEwvG,QAAQ37G,OAAS,EACtC,OAAQ07G,GAAc,GAClBA,IAAeE,GACfC,EAAkB3vG,EAAEyvG,QAAQD,GAAavvG,EAAEwvG,QAAQC,KACnDE,EAA0B5vG,EAAEa,OAAQZ,EAAEY,SACtCuuG,EAAepvG,EAAEwzD,SAAW47C,EAAenvG,EAAEuzD,QAC7CxzD,EAAE0nE,OAASznE,EAAEynE,IACrB,CAQA,SAASioC,EAAkB3vG,EAAGC,GAI1B,OAAQD,EAAE6vG,SAAW7vG,MAAQC,EAAE4vG,SAAW5vG,EAC9C,CACA,SAAS2vG,EAA0B5vG,EAAGC,GAClC,GAAI/H,OAAOiI,KAAKH,GAAGlM,SAAWoE,OAAOiI,KAAKF,GAAGnM,OACzC,OAAO,EACX,IAAK,MAAM2E,KAAOuH,EACd,IAAK8vG,EAA+B9vG,EAAEvH,GAAMwH,EAAExH,IAC1C,OAAO,EAEf,OAAO,CACX,CACA,SAASq3G,EAA+B9vG,EAAGC,GACvC,OAAOtK,EAAQqK,GACT+vG,EAAkB/vG,EAAGC,GACrBtK,EAAQsK,GACJ8vG,EAAkB9vG,EAAGD,GACrBA,IAAMC,CACpB,CAQA,SAAS8vG,EAAkB/vG,EAAGC,GAC1B,OAAOtK,EAAQsK,GACTD,EAAElM,SAAWmM,EAAEnM,QAAUkM,EAAEgjB,OAAM,CAACnrB,EAAOhE,IAAMgE,IAAUoI,EAAEpM,KAC9C,IAAbmM,EAAElM,QAAgBkM,EAAE,KAAOC,CACrC,CAOA,SAASivG,EAAoBrjF,EAAInF,GAC7B,GAAImF,EAAG9W,WAAW,KACd,OAAO8W,EAKX,IAAKA,EACD,OAAOnF,EACX,MAAMspF,EAAetpF,EAAKvnB,MAAM,KAC1B8wG,EAAapkF,EAAG1sB,MAAM,KACtB+wG,EAAgBD,EAAWA,EAAWn8G,OAAS,GAG/B,OAAlBo8G,GAA4C,MAAlBA,GAC1BD,EAAWz5G,KAAK,IAEpB,IACI25G,EACA7H,EAFA8H,EAAWJ,EAAal8G,OAAS,EAGrC,IAAKq8G,EAAa,EAAGA,EAAaF,EAAWn8G,OAAQq8G,IAGjD,GAFA7H,EAAU2H,EAAWE,GAEL,MAAZ7H,EAAJ,CAGA,GAAgB,OAAZA,EAQA,MANI8H,EAAW,GACXA,GALI,CAYhB,OAAQJ,EAAa/6F,MAAM,EAAGm7F,GAAUz7G,KAAK,KACzC,IACAs7G,EAEKh7F,MAAMk7F,GAAcA,IAAeF,EAAWn8G,OAAS,EAAI,IAC3Da,KAAK,IAClB,CAEA,IAAI07G,EAKAC,GAJJ,SAAWD,GACPA,EAAe,OAAS,MACxBA,EAAe,QAAU,MAC5B,EAHD,CAGGA,IAAmBA,EAAiB,CAAC,IAExC,SAAWC,GACPA,EAAoB,QAAU,OAC9BA,EAAoB,WAAa,UACjCA,EAAoB,WAAa,EACpC,CAJD,CAIGA,IAAwBA,EAAsB,CAAC,IAYlD,SAASC,EAAcllF,GACnB,IAAKA,EACD,GAAI8iF,EAAW,CAEX,MAAMqC,EAASl3G,SAASkqC,cAAc,QACtCnY,EAAQmlF,GAAUA,EAAOjmE,aAAa,SAAY,IAElDlf,EAAOA,EAAK9zB,QAAQ,kBAAmB,GAC3C,MAEI8zB,EAAO,IAUf,MAJgB,MAAZA,EAAK,IAA0B,MAAZA,EAAK,KACxBA,EAAO,IAAMA,GAGVsjF,EAAoBtjF,EAC/B,CAEA,MAAMolF,EAAiB,UACvB,SAASC,EAAWrlF,EAAMylC,GACtB,OAAOzlC,EAAK9zB,QAAQk5G,EAAgB,KAAO3/C,CAC/C,CAEA,SAAS6/C,EAAmB91F,EAAIhZ,GAC5B,MAAM+uG,EAAUt3G,SAASu3G,gBAAgB5jE,wBACnC6jE,EAASj2F,EAAGoyB,wBAClB,MAAO,CACH8jE,SAAUlvG,EAAOkvG,SACjB1jE,KAAMyjE,EAAOzjE,KAAOujE,EAAQvjE,MAAQxrC,EAAOwrC,MAAQ,GACnDE,IAAKujE,EAAOvjE,IAAMqjE,EAAQrjE,KAAO1rC,EAAO0rC,KAAO,GAEvD,CACA,MAAMyjE,EAAwBA,KAAA,CAC1B3jE,KAAMz0C,OAAOq4G,YACb1jE,IAAK30C,OAAOs4G,cAEhB,SAASC,EAAiBf,GACtB,IAAIgB,EACJ,GAAI,OAAQhB,EAAU,CAClB,MAAMiB,EAAajB,EAASv1F,GACtBy2F,EAAqC,kBAAfD,GAA2BA,EAAWt8F,WAAW,KAsBxE9b,EAiBL,MAAM4hB,EAA2B,kBAAfw2F,EACZC,EACIh4G,SAASi4G,eAAeF,EAAWp8F,MAAM,IACzC3b,SAASkqC,cAAc6tE,GAC3BA,EACN,IAAKx2F,EAGD,OAEJu2F,EAAkBT,EAAmB91F,EAAIu1F,EAC7C,MAEIgB,EAAkBhB,EAElB,mBAAoB92G,SAASu3G,gBAAgBx5E,MAC7Cz+B,OAAO44G,SAASJ,GAEhBx4G,OAAO44G,SAAiC,MAAxBJ,EAAgB/jE,KAAe+jE,EAAgB/jE,KAAOz0C,OAAOq4G,YAAoC,MAAvBG,EAAgB7jE,IAAc6jE,EAAgB7jE,IAAM30C,OAAOs4G,YAE7J,CACA,SAASO,EAAavzF,EAAM20D,GACxB,MAAMu9B,EAAWsB,QAAQlyF,MAAQkyF,QAAQlyF,MAAM4wF,SAAWv9B,GAAS,EACnE,OAAOu9B,EAAWlyF,CACtB,CACA,MAAMyzF,EAAkB,IAAIpqG,IAC5B,SAASqqG,EAAmBn5G,EAAKo5G,GAC7BF,EAAgB5qG,IAAItO,EAAKo5G,EAC7B,CACA,SAASC,EAAuBr5G,GAC5B,MAAMs5G,EAASJ,EAAgBxrG,IAAI1N,GAGnC,OADAk5G,EAAgBvrG,OAAO3N,GAChBs5G,CACX,CAiBA,IAAIC,EAAqBA,IAAMlhD,SAASC,SAAW,KAAOD,SAAS52D,KAMnE,SAAS+3G,EAAsB5mF,EAAMylC,GACjC,MAAM,SAAEw+C,EAAQ,OAAEr7C,EAAM,KAAEyT,GAAS5W,EAE7Bk+C,EAAU3jF,EAAKxX,QAAQ,KAC7B,GAAIm7F,GAAW,EAAG,CACd,IAAIkD,EAAWxqC,EAAKpnE,SAAS+qB,EAAKpW,MAAM+5F,IAClC3jF,EAAKpW,MAAM+5F,GAASl7G,OACpB,EACFq+G,EAAezqC,EAAKzyD,MAAMi9F,GAI9B,MAFwB,MAApBC,EAAa,KACbA,EAAe,IAAMA,GAClB9C,EAAU8C,EAAc,GACnC,CACA,MAAMj0F,EAAOmxF,EAAUC,EAAUjkF,GACjC,OAAOnN,EAAO+1C,EAASyT,CAC3B,CACA,SAAS0qC,EAAoB/mF,EAAMgnF,EAAcvD,EAAiBv3G,GAC9D,IAAIgxE,EAAY,GACZ+pC,EAAY,GAGZC,EAAa,KACjB,MAAMC,EAAkBA,EAAGhzF,YACvB,MAAMqM,EAAKomF,EAAsB5mF,EAAMylC,UACjCpqC,EAAOooF,EAAgBj3G,MACvB46G,EAAYJ,EAAax6G,MAC/B,IAAIg7E,EAAQ,EACZ,GAAIrzD,EAAO,CAIP,GAHAsvF,EAAgBj3G,MAAQg0B,EACxBwmF,EAAax6G,MAAQ2nB,EAEjB+yF,GAAcA,IAAe7rF,EAE7B,YADA6rF,EAAa,MAGjB1/B,EAAQ4/B,EAAYjzF,EAAM4wF,SAAWqC,EAAUrC,SAAW,CAC9D,MAEI74G,EAAQs0B,GAOZ08C,EAAUxnE,SAAQ6zD,IACdA,EAASk6C,EAAgBj3G,MAAO6uB,EAAM,CAClCmsD,QACAr3E,KAAM60G,EAAehsG,IACrBquG,UAAW7/B,EACLA,EAAQ,EACJy9B,EAAoBqC,QACpBrC,EAAoBsC,KACxBtC,EAAoBuC,SAC5B,GACJ,EAEN,SAASC,IACLP,EAAazD,EAAgBj3G,KACjC,CACA,SAASk3E,EAAO/zE,GAEZutE,EAAU/xE,KAAKwE,GACf,MAAM+3G,EAAWA,KACb,MAAMrvG,EAAQ6kE,EAAU10D,QAAQ7Y,GAC5B0I,GAAS,GACT6kE,EAAU90D,OAAO/P,EAAO,EAAE,EAGlC,OADA4uG,EAAU97G,KAAKu8G,GACRA,CACX,CACA,SAASC,IACL,MAAM,QAAEtB,GAAY94G,OACf84G,EAAQlyF,OAEbkyF,EAAQuB,aAAan3G,EAAO,CAAC,EAAG41G,EAAQlyF,MAAO,CAAEuyF,OAAQf,MAA4B,GACzF,CACA,SAASkC,IACL,IAAK,MAAMH,KAAYT,EACnBS,IACJT,EAAY,GACZ15G,OAAO0uC,oBAAoB,WAAYkrE,GACvC55G,OAAO0uC,oBAAoB,eAAgB0rE,EAC/C,CAQA,OANAp6G,OAAO4uC,iBAAiB,WAAYgrE,GAGpC55G,OAAO4uC,iBAAiB,eAAgBwrE,EAAsB,CAC1DG,SAAS,IAEN,CACHL,iBACA/jC,SACAmkC,UAER,CAIA,SAASE,EAAWR,EAAMztF,EAASwtF,EAASU,GAAW,EAAOC,GAAgB,GAC1E,MAAO,CACHV,OACAztF,UACAwtF,UACAU,WACAjD,SAAUx3G,OAAO84G,QAAQ59G,OACzBi+G,OAAQuB,EAAgBtC,IAA0B,KAE1D,CACA,SAASuC,EAA0BloF,GAC/B,MAAM,QAAEqmF,EAAO,SAAE5gD,GAAal4D,OAExBk2G,EAAkB,CACpBj3G,MAAOo6G,EAAsB5mF,EAAMylC,IAEjCuhD,EAAe,CAAEx6G,MAAO65G,EAAQlyF,OAetC,SAASg0F,EAAe3nF,EAAIrM,EAAOjoB,GAU/B,MAAMk8G,EAAYpoF,EAAKxX,QAAQ,KACzBorD,EAAMw0C,GAAa,GAClB3iD,EAAS52D,MAAQZ,SAASkqC,cAAc,QACrCnY,EACAA,EAAKpW,MAAMw+F,IAAc5nF,EAC7BmmF,IAAuB3mF,EAAOQ,EACpC,IAGI6lF,EAAQn6G,EAAU,eAAiB,aAAaioB,EAAO,GAAIy/C,GAC3DozC,EAAax6G,MAAQ2nB,CACzB,CACA,MAAOtO,GAKCxZ,QAAQC,MAAMuZ,GAGlB4/C,EAASv5D,EAAU,UAAY,UAAU0nE,EAC7C,CACJ,CACA,SAAS1nE,EAAQs0B,EAAIrtB,GACjB,MAAMghB,EAAQ1jB,EAAO,CAAC,EAAG41G,EAAQlyF,MAAO4zF,EAAWf,EAAax6G,MAAM+6G,KAEtE/mF,EAAIwmF,EAAax6G,MAAM86G,SAAS,GAAOn0G,EAAM,CAAE4xG,SAAUiC,EAAax6G,MAAMu4G,WAC5EoD,EAAe3nF,EAAIrM,GAAO,GAC1BsvF,EAAgBj3G,MAAQg0B,CAC5B,CACA,SAASr1B,EAAKq1B,EAAIrtB,GAGd,MAAMk1G,EAAe53G,EAAO,CAAC,EAI7Bu2G,EAAax6G,MAAO65G,EAAQlyF,MAAO,CAC/BmzF,QAAS9mF,EACTkmF,OAAQf,MAOZwC,EAAeE,EAAavuF,QAASuuF,GAAc,GACnD,MAAMl0F,EAAQ1jB,EAAO,CAAC,EAAGs3G,EAAWtE,EAAgBj3G,MAAOg0B,EAAI,MAAO,CAAEukF,SAAUsD,EAAatD,SAAW,GAAK5xG,GAC/Gg1G,EAAe3nF,EAAIrM,GAAO,GAC1BsvF,EAAgBj3G,MAAQg0B,CAC5B,CACA,OA1EKwmF,EAAax6G,OACd27G,EAAe1E,EAAgBj3G,MAAO,CAClC+6G,KAAM,KACNztF,QAAS2pF,EAAgBj3G,MACzB86G,QAAS,KAETvC,SAAUsB,EAAQ59G,OAAS,EAC3Bu/G,UAAU,EAGVtB,OAAQ,OACT,GA+DA,CACHjhD,SAAUg+C,EACVtvF,MAAO6yF,EACP77G,OACAe,UAER,CAMA,SAASo8G,EAAiBtoF,GACtBA,EAAOklF,EAAcllF,GACrB,MAAMuoF,EAAoBL,EAA0BloF,GAC9CwoF,EAAmBzB,EAAoB/mF,EAAMuoF,EAAkBp0F,MAAOo0F,EAAkB9iD,SAAU8iD,EAAkBr8G,SAC1H,SAASu8G,EAAGjhC,EAAOkhC,GAAmB,GAC7BA,GACDF,EAAiBf,iBACrBpB,QAAQoC,GAAGjhC,EACf,CACA,MAAMmhC,EAAgBl4G,EAAO,CAEzBg1D,SAAU,GACVzlC,OACAyoF,KACApD,WAAYA,EAAW79F,KAAK,KAAMwY,IACnCuoF,EAAmBC,GAStB,OARA37G,OAAOuwB,eAAeurF,EAAe,WAAY,CAC7CtpF,YAAY,EACZvkB,IAAKA,IAAMytG,EAAkB9iD,SAASj5D,QAE1CK,OAAOuwB,eAAeurF,EAAe,QAAS,CAC1CtpF,YAAY,EACZvkB,IAAKA,IAAMytG,EAAkBp0F,MAAM3nB,QAEhCm8G,CACX,CAyHA,SAASC,EAAgBC,GACrB,MAAwB,kBAAVA,GAAuBA,GAA0B,kBAAVA,CACzD,CACA,SAASC,EAAYh9G,GACjB,MAAuB,kBAATA,GAAqC,kBAATA,CAC9C,CAiBA,MAAMi9G,EAA4B,CAC9Bl2F,KAAM,IACN/mB,UAAMY,EACN8I,OAAQ,CAAC,EACT2yD,MAAO,CAAC,EACRkU,KAAM,GACNwkB,SAAU,IACVujB,QAAS,GACT4E,KAAM,CAAC,EACPC,oBAAgBv8G,GAGdw8G,EAA0B5sG,OAAwE,IAKxG,IAAI6sG,GACJ,SAAWA,GAKPA,EAAsBA,EAAsB,WAAa,GAAK,UAK9DA,EAAsBA,EAAsB,aAAe,GAAK,YAKhEA,EAAsBA,EAAsB,cAAgB,IAAM,YACrE,EAhBD,CAgBGA,IAA0BA,EAAwB,CAAC,IAqBtD,SAASC,EAAkBj5G,EAAMqF,GASzB,OAAO/E,EAAO,IAAItI,MAAS,CACvBgI,OACA,CAAC+4G,IAA0B,GAC5B1zG,EAEX,CACA,SAAS6zG,EAAoB/8G,EAAO6D,GAChC,OAAQ7D,aAAiBnE,OACrB+gH,KAA2B58G,IAClB,MAAR6D,MAAmB7D,EAAM6D,KAAOA,GACzC,CAgBA,MAAMm5G,EAAqB,SACrBC,EAA2B,CAC7BC,WAAW,EACXC,QAAQ,EACR9hG,OAAO,EACPC,KAAK,GAGH8hG,EAAiB,sBAQvB,SAASC,EAAe72F,EAAUmG,GAC9B,MAAMxN,EAAUhb,EAAO,CAAC,EAAG84G,EAA0BtwF,GAE/C2wF,EAAQ,GAEd,IAAIrwF,EAAU9N,EAAQ9D,MAAQ,IAAM,GAEpC,MAAM7S,EAAO,GACb,IAAK,MAAMmoG,KAAWnqF,EAAU,CAE5B,MAAM+2F,EAAgB5M,EAAQx0G,OAAS,GAAK,CAAC,IAEzCgjB,EAAQg+F,SAAWxM,EAAQx0G,SAC3B8wB,GAAW,KACf,IAAK,IAAIuwF,EAAa,EAAGA,EAAa7M,EAAQx0G,OAAQqhH,IAAc,CAChE,MAAMh6G,EAAQmtG,EAAQ6M,GAEtB,IAAIC,EAAkB,IACjBt+F,EAAQ+9F,UAAY,IAA0C,GACnE,GAAmB,IAAf15G,EAAMK,KAED25G,IACDvwF,GAAW,KACfA,GAAWzpB,EAAMtD,MAAMN,QAAQw9G,EAAgB,QAC/CK,GAAmB,QAElB,GAAmB,IAAfj6G,EAAMK,KAAkC,CAC7C,MAAM,MAAE3D,EAAK,WAAEw9G,EAAU,SAAEnvD,EAAQ,OAAEovD,GAAWn6G,EAChDgF,EAAK3J,KAAK,CACNW,KAAMU,EACNw9G,aACAnvD,aAEJ,MAAMqvD,EAAKD,GAAkBX,EAE7B,GAAIY,IAAOZ,EAAoB,CAC3BS,GAAmB,GAEnB,IACI,IAAI1wF,OAAQ,IAAG6wF,KACnB,CACA,MAAOrkG,GACH,MAAM,IAAI1d,MAAO,oCAAmCqE,OAAW09G,OAC3DrkG,EAAI5d,QACZ,CACJ,CAEA,IAAIkiH,EAAaH,EAAc,OAAME,YAAaA,QAAY,IAAGA,KAE5DJ,IACDK,EAGItvD,GAAYoiD,EAAQx0G,OAAS,EACtB,OAAM0hH,KACP,IAAMA,GAChBtvD,IACAsvD,GAAc,KAClB5wF,GAAW4wF,EACXJ,GAAmB,GACflvD,IACAkvD,IAAoB,GACpBC,IACAD,IAAoB,IACb,OAAPG,IACAH,IAAoB,GAC5B,CACAF,EAAc1+G,KAAK4+G,EACvB,CAGAH,EAAMz+G,KAAK0+G,EACf,CAEA,GAAIp+F,EAAQg+F,QAAUh+F,EAAQ7D,IAAK,CAC/B,MAAMpf,EAAIohH,EAAMnhH,OAAS,EACzBmhH,EAAMphH,GAAGohH,EAAMphH,GAAGC,OAAS,IAAM,iBACrC,CAEKgjB,EAAQg+F,SACTlwF,GAAW,MACX9N,EAAQ7D,IACR2R,GAAW,IAEN9N,EAAQg+F,SACblwF,GAAW,WACf,MAAM2wF,EAAK,IAAI7wF,OAAOE,EAAS9N,EAAQ+9F,UAAY,GAAK,KACxD,SAASz7G,EAAM8kB,GACX,MAAM3kB,EAAQ2kB,EAAK3kB,MAAMg8G,GACnB10G,EAAS,CAAC,EAChB,IAAKtH,EACD,OAAO,KACX,IAAK,IAAI1F,EAAI,EAAGA,EAAI0F,EAAMzF,OAAQD,IAAK,CACnC,MAAMgE,EAAQ0B,EAAM1F,IAAM,GACpB4E,EAAM0H,EAAKtM,EAAI,GACrBgN,EAAOpI,EAAItB,MAAQU,GAASY,EAAI48G,WAAax9G,EAAMsH,MAAM,KAAOtH,CACpE,CACA,OAAOgJ,CACX,CACA,SAAStE,EAAUsE,GACf,IAAIqd,EAAO,GAEPu3F,GAAuB,EAC3B,IAAK,MAAMnN,KAAWnqF,EAAU,CACvBs3F,GAAyBv3F,EAAKw3F,SAAS,OACxCx3F,GAAQ,KACZu3F,GAAuB,EACvB,IAAK,MAAMt6G,KAASmtG,EAChB,GAAmB,IAAfntG,EAAMK,KACN0iB,GAAQ/iB,EAAMtD,WAEb,GAAmB,IAAfsD,EAAMK,KAAkC,CAC7C,MAAM,MAAE3D,EAAK,WAAEw9G,EAAU,SAAEnvD,GAAa/qD,EAClCw6G,EAAQ99G,KAASgJ,EAASA,EAAOhJ,GAAS,GAChD,GAAIlC,EAAQggH,KAAWN,EACnB,MAAM,IAAI7hH,MAAO,mBAAkBqE,8DAEvC,MAAM6nC,EAAO/pC,EAAQggH,GACfA,EAAMhhH,KAAK,KACXghH,EACN,IAAKj2E,EAAM,CACP,IAAIwmB,EAYA,MAAM,IAAI1yD,MAAO,2BAA0BqE,MAVvCywG,EAAQx0G,OAAS,IAEboqB,EAAKw3F,SAAS,KACdx3F,EAAOA,EAAKjJ,MAAM,GAAI,GAGtBwgG,GAAuB,EAKvC,CACAv3F,GAAQwhB,CACZ,CAER,CAEA,OAAOxhB,GAAQ,GACnB,CACA,MAAO,CACHq3F,KACAN,QACA90G,OACA/G,QACAmD,YAER,CAUA,SAASq5G,EAAkB51G,EAAGC,GAC1B,IAAIpM,EAAI,EACR,MAAOA,EAAImM,EAAElM,QAAUD,EAAIoM,EAAEnM,OAAQ,CACjC,MAAMygB,EAAOtU,EAAEpM,GAAKmM,EAAEnM,GAEtB,GAAI0gB,EACA,OAAOA,EACX1gB,GACJ,CAGA,OAAImM,EAAElM,OAASmM,EAAEnM,OACO,IAAbkM,EAAElM,QAAyB,KAATkM,EAAE,IACpB,EACD,EAEDA,EAAElM,OAASmM,EAAEnM,OACE,IAAbmM,EAAEnM,QAAyB,KAATmM,EAAE,GACrB,GACC,EAEJ,CACX,CAQA,SAAS41G,EAAuB71G,EAAGC,GAC/B,IAAIpM,EAAI,EACR,MAAMiiH,EAAS91G,EAAEi1G,MACXc,EAAS91G,EAAEg1G,MACjB,MAAOphH,EAAIiiH,EAAOhiH,QAAUD,EAAIkiH,EAAOjiH,OAAQ,CAC3C,MAAMiiB,EAAO6/F,EAAkBE,EAAOjiH,GAAIkiH,EAAOliH,IAEjD,GAAIkiB,EACA,OAAOA,EACXliB,GACJ,CACA,GAAgD,IAA5CkmC,KAAK04B,IAAIsjD,EAAOjiH,OAASgiH,EAAOhiH,QAAe,CAC/C,GAAIkiH,EAAoBF,GACpB,OAAO,EACX,GAAIE,EAAoBD,GACpB,OAAQ,CAChB,CAEA,OAAOA,EAAOjiH,OAASgiH,EAAOhiH,MAOlC,CAOA,SAASkiH,EAAoBf,GACzB,MAAM7wG,EAAO6wG,EAAMA,EAAMnhH,OAAS,GAClC,OAAOmhH,EAAMnhH,OAAS,GAAKsQ,EAAKA,EAAKtQ,OAAS,GAAK,CACvD,CAEA,MAAMmiH,GAAa,CACfz6G,KAAM,EACN3D,MAAO,IAELq+G,GAAiB,eAIvB,SAASC,GAAaj4F,GAClB,IAAKA,EACD,MAAO,CAAC,IACZ,GAAa,MAATA,EACA,MAAO,CAAC,CAAC+3F,KACb,IAAK/3F,EAAKnJ,WAAW,KACjB,MAAM,IAAIvhB,MAEH,iBAAgB0qB,MAG3B,SAASk4F,EAAM9iH,GACX,MAAM,IAAIE,MAAO,QAAOgsB,OAAW62F,OAAY/iH,IACnD,CACA,IAAIksB,EAAQ,EACR82F,EAAgB92F,EACpB,MAAM+2F,EAAS,GAGf,IAAIjO,EACJ,SAASkO,IACDlO,GACAiO,EAAO//G,KAAK8xG,GAChBA,EAAU,EACd,CAEA,IAEImO,EAFA5iH,EAAI,EAIJwiH,EAAS,GAETK,EAAW,GACf,SAASC,IACAN,IAES,IAAV72F,EACA8oF,EAAQ9xG,KAAK,CACTgF,KAAM,EACN3D,MAAOw+G,IAGI,IAAV72F,GACK,IAAVA,GACU,IAAVA,GACI8oF,EAAQx0G,OAAS,IAAe,MAAT2iH,GAAyB,MAATA,IACvCL,EAAO,uBAAsBC,iDACjC/N,EAAQ9xG,KAAK,CACTgF,KAAM,EACN3D,MAAOw+G,EACPf,OAAQoB,EACRrB,WAAqB,MAAToB,GAAyB,MAATA,EAC5BvwD,SAAmB,MAATuwD,GAAyB,MAATA,KAI9BL,EAAM,mCAEVC,EAAS,GACb,CACA,SAASO,IACLP,GAAUI,CACd,CACA,MAAO5iH,EAAIqqB,EAAKpqB,OAEZ,GADA2iH,EAAOv4F,EAAKrqB,KACC,OAAT4iH,GAA2B,IAAVj3F,EAKrB,OAAQA,GACJ,KAAK,EACY,MAATi3F,GACIJ,GACAM,IAEJH,KAEc,MAATC,GACLE,IACAn3F,EAAQ,GAGRo3F,IAEJ,MACJ,KAAK,EACDA,IACAp3F,EAAQ82F,EACR,MACJ,KAAK,EACY,MAATG,EACAj3F,EAAQ,EAEH02F,GAAev5G,KAAK85G,GACzBG,KAGAD,IACAn3F,EAAQ,EAEK,MAATi3F,GAAyB,MAATA,GAAyB,MAATA,GAChC5iH,KAER,MACJ,KAAK,EAMY,MAAT4iH,EAEqC,MAAjCC,EAASA,EAAS5iH,OAAS,GAC3B4iH,EAAWA,EAASzhG,MAAM,GAAI,GAAKwhG,EAEnCj3F,EAAQ,EAGZk3F,GAAYD,EAEhB,MACJ,KAAK,EAEDE,IACAn3F,EAAQ,EAEK,MAATi3F,GAAyB,MAATA,GAAyB,MAATA,GAChC5iH,IACJ6iH,EAAW,GACX,MACJ,QACIN,EAAM,iBACN,WAnEJE,EAAgB92F,EAChBA,EAAQ,EA0EhB,OALc,IAAVA,GACA42F,EAAO,uCAAsCC,MACjDM,IACAH,IAEOD,CACX,CAEA,SAASM,GAAyBznB,EAAQ3rF,EAAQqT,GAC9C,MAAMggG,EAAS9B,EAAemB,GAAa/mB,EAAOlxE,MAAOpH,GAUzD,MAAMigG,EAAUj7G,EAAOg7G,EAAQ,CAC3B1nB,SACA3rF,SAEAwW,SAAU,GACV+8F,MAAO,KASX,OAPIvzG,IAIKszG,EAAQ3nB,OAAOygB,WAAapsG,EAAO2rF,OAAOygB,SAC3CpsG,EAAOwW,SAASzjB,KAAKugH,GAEtBA,CACX,CASA,SAASE,GAAoBC,EAAQC,GAEjC,MAAMC,EAAW,GACXC,EAAa,IAAI9vG,IAEvB,SAAS+vG,EAAiBngH,GACtB,OAAOkgH,EAAWlxG,IAAIhP,EAC1B,CACA,SAASogH,EAASnoB,EAAQ3rF,EAAQ+zG,GAE9B,MAAMC,GAAaD,EACbE,EAAuBC,GAAqBvoB,GAKlDsoB,EAAqB7H,QAAU2H,GAAkBA,EAAepoB,OAChE,MAAMt4E,EAAU8U,GAAaurF,EAAe/nB,GAEtCwoB,EAAoB,CACtBF,GAEJ,GAAI,UAAWtoB,EAAQ,CACnB,MAAMyoB,EAAkC,kBAAjBzoB,EAAO4nB,MAAqB,CAAC5nB,EAAO4nB,OAAS5nB,EAAO4nB,MAC3E,IAAK,MAAMA,KAASa,EAChBD,EAAkBphH,KAAKsF,EAAO,CAAC,EAAG47G,EAAsB,CAGpDttF,WAAYotF,EACNA,EAAepoB,OAAOhlE,WACtBstF,EAAqBttF,WAC3BlM,KAAM84F,EAENnH,QAAS2H,EACHA,EAAepoB,OACfsoB,IAKlB,CACA,IAAIX,EACAe,EACJ,IAAK,MAAMC,KAAoBH,EAAmB,CAC9C,MAAM,KAAE15F,GAAS65F,EAIjB,GAAIt0G,GAAsB,MAAZya,EAAK,GAAY,CAC3B,MAAMysF,EAAalnG,EAAO2rF,OAAOlxE,KAC3B85F,EAAwD,MAAtCrN,EAAWA,EAAW72G,OAAS,GAAa,GAAK,IACzEikH,EAAiB75F,KACbza,EAAO2rF,OAAOlxE,MAAQA,GAAQ85F,EAAkB95F,EACxD,CA2BA,GArBA64F,EAAUF,GAAyBkB,EAAkBt0G,EAAQqT,GAKzD0gG,EACAA,EAAeR,MAAMxgH,KAAKugH,IAO1Be,EAAkBA,GAAmBf,EACjCe,IAAoBf,GACpBe,EAAgBd,MAAMxgH,KAAKugH,GAG3BU,GAAaroB,EAAOj4F,OAAS8gH,GAAclB,IAC3CmB,EAAY9oB,EAAOj4F,OAEvBugH,EAAqBz9F,SAAU,CAC/B,MAAMA,EAAWy9F,EAAqBz9F,SACtC,IAAK,IAAIpmB,EAAI,EAAGA,EAAIomB,EAASnmB,OAAQD,IACjC0jH,EAASt9F,EAASpmB,GAAIkjH,EAASS,GAAkBA,EAAev9F,SAASpmB,GAEjF,CAGA2jH,EAAiBA,GAAkBT,GAO9BA,EAAQ3nB,OAAOhlE,YAChBlyB,OAAOiI,KAAK42G,EAAQ3nB,OAAOhlE,YAAYt2B,QACvCijH,EAAQ3nB,OAAOj4F,MACf4/G,EAAQ3nB,OAAO+oB,WACfC,EAAcrB,EAEtB,CACA,OAAOe,EACD,KAEEI,EAAYJ,EAAgB,EAE9BrJ,CACV,CACA,SAASyJ,EAAYG,GACjB,GAAIlE,EAAYkE,GAAa,CACzB,MAAMtB,EAAUM,EAAWlxG,IAAIkyG,GAC3BtB,IACAM,EAAWjxG,OAAOiyG,GAClBjB,EAAS3jG,OAAO2jG,EAASvjG,QAAQkjG,GAAU,GAC3CA,EAAQ98F,SAASlZ,QAAQm3G,GACzBnB,EAAQC,MAAMj2G,QAAQm3G,GAE9B,KACK,CACD,MAAMx0G,EAAQ0zG,EAASvjG,QAAQwkG,GAC3B30G,GAAS,IACT0zG,EAAS3jG,OAAO/P,EAAO,GACnB20G,EAAWjpB,OAAOj4F,MAClBkgH,EAAWjxG,OAAOiyG,EAAWjpB,OAAOj4F,MACxCkhH,EAAWp+F,SAASlZ,QAAQm3G,GAC5BG,EAAWrB,MAAMj2G,QAAQm3G,GAEjC,CACJ,CACA,SAASI,IACL,OAAOlB,CACX,CACA,SAASgB,EAAcrB,GACnB,IAAIljH,EAAI,EACR,MAAOA,EAAIujH,EAAStjH,QAChB+hH,EAAuBkB,EAASK,EAASvjH,KAAO,IAG/CkjH,EAAQ3nB,OAAOlxE,OAASk5F,EAASvjH,GAAGu7F,OAAOlxE,OACvCq6F,GAAgBxB,EAASK,EAASvjH,KACvCA,IACJujH,EAAS3jG,OAAO5f,EAAG,EAAGkjH,GAElBA,EAAQ3nB,OAAOj4F,OAAS8gH,GAAclB,IACtCM,EAAWtwG,IAAIgwG,EAAQ3nB,OAAOj4F,KAAM4/G,EAC5C,CACA,SAASn8G,EAAQk2D,EAAUg+C,GACvB,IAAIiI,EAEA74F,EACA/mB,EAFA0J,EAAS,CAAC,EAGd,GAAI,SAAUiwD,GAAYA,EAAS35D,KAAM,CAErC,GADA4/G,EAAUM,EAAWlxG,IAAI2qD,EAAS35D,OAC7B4/G,EACD,MAAMtC,EAAkB,EAAsC,CAC1D3jD,aAGH73D,EAML9B,EAAO4/G,EAAQ3nB,OAAOj4F,KACtB0J,EAAS/E,EAET08G,GAAmB1J,EAAgBjuG,OAGnCk2G,EAAQ52G,KAAK2I,QAAOzI,IAAMA,EAAE6lD,WAAUvmD,KAAIU,GAAKA,EAAElJ,QAGjD25D,EAASjwD,QACL23G,GAAmB1nD,EAASjwD,OAAQk2G,EAAQ52G,KAAKR,KAAIU,GAAKA,EAAElJ,SAEhE+mB,EAAO64F,EAAQx6G,UAAUsE,EAC7B,MACK,GAAI,SAAUiwD,EAGf5yC,EAAO4yC,EAAS5yC,KAIhB64F,EAAUK,EAAS9sD,MAAK3+B,GAAKA,EAAE4pF,GAAG54G,KAAKuhB,KAEnC64F,IAEAl2G,EAASk2G,EAAQ39G,MAAM8kB,GACvB/mB,EAAO4/G,EAAQ3nB,OAAOj4F,UAIzB,CAKD,GAHA4/G,EAAUjI,EAAgB33G,KACpBkgH,EAAWlxG,IAAI2oG,EAAgB33G,MAC/BigH,EAAS9sD,MAAK3+B,GAAKA,EAAE4pF,GAAG54G,KAAKmyG,EAAgB5wF,SAC9C64F,EACD,MAAMtC,EAAkB,EAAsC,CAC1D3jD,WACAg+C,oBAER33G,EAAO4/G,EAAQ3nB,OAAOj4F,KAGtB0J,EAAS/E,EAAO,CAAC,EAAGgzG,EAAgBjuG,OAAQiwD,EAASjwD,QACrDqd,EAAO64F,EAAQx6G,UAAUsE,EAC7B,CACA,MAAM4uG,EAAU,GAChB,IAAIgJ,EAAgB1B,EACpB,MAAO0B,EAEHhJ,EAAQ3pF,QAAQ2yF,EAAcrpB,QAC9BqpB,EAAgBA,EAAch1G,OAElC,MAAO,CACHtM,OACA+mB,OACArd,SACA4uG,UACA4E,KAAMqE,GAAgBjJ,GAE9B,CAGA,OAhOA0H,EAAgBvrF,GAAa,CAAEkpF,QAAQ,EAAO7hG,KAAK,EAAM4hG,WAAW,GAASsC,GA+N7ED,EAAOn2G,SAAQmzG,GAASqD,EAASrD,KAC1B,CAAEqD,WAAU38G,UAASs9G,cAAaI,YAAWhB,mBACxD,CACA,SAASkB,GAAmB33G,EAAQV,GAChC,MAAMquG,EAAY,CAAC,EACnB,IAAK,MAAM/1G,KAAO0H,EACV1H,KAAOoI,IACP2tG,EAAU/1G,GAAOoI,EAAOpI,IAEhC,OAAO+1G,CACX,CAOA,SAASmJ,GAAqBvoB,GAC1B,MAAO,CACHlxE,KAAMkxE,EAAOlxE,KACbi6F,SAAU/oB,EAAO+oB,SACjBhhH,KAAMi4F,EAAOj4F,KACbk9G,KAAMjlB,EAAOilB,MAAQ,CAAC,EACtBxE,aAAS93G,EACTorB,YAAaisE,EAAOjsE,YACpBvO,MAAO+jG,GAAqBvpB,GAC5Bn1E,SAAUm1E,EAAOn1E,UAAY,GAC7B2xC,UAAW,CAAC,EACZgtD,YAAa,IAAIhwG,IACjBiwG,aAAc,IAAIjwG,IAClBkwG,eAAgB,CAAC,EACjB1uF,WAAY,eAAgBglE,EACtBA,EAAOhlE,YAAc,KACrBglE,EAAOj1E,WAAa,CAAEmH,QAAS8tE,EAAOj1E,WAEpD,CAMA,SAASw+F,GAAqBvpB,GAC1B,MAAM2pB,EAAc,CAAC,EAEfnkG,EAAQw6E,EAAOx6E,QAAS,EAC9B,GAAI,cAAew6E,EACf2pB,EAAYz3F,QAAU1M,OAKtB,IAAK,MAAMzd,KAAQi4F,EAAOhlE,WACtB2uF,EAAY5hH,GAAyB,kBAAVyd,EAAqBA,EAAMzd,GAAQyd,EAEtE,OAAOmkG,CACX,CAKA,SAASd,GAAc7oB,GACnB,MAAOA,EAAQ,CACX,GAAIA,EAAOA,OAAOygB,QACd,OAAO,EACXzgB,EAASA,EAAO3rF,MACpB,CACA,OAAO,CACX,CAMA,SAASi1G,GAAgBjJ,GACrB,OAAOA,EAAQ7mF,QAAO,CAACyrF,EAAMjlB,IAAWtzF,EAAOu4G,EAAMjlB,EAAOilB,OAAO,CAAC,EACxE,CACA,SAASzoF,GAAaotF,EAAUC,GAC5B,MAAMniG,EAAU,CAAC,EACjB,IAAK,MAAMre,KAAOugH,EACdliG,EAAQre,GAAOA,KAAOwgH,EAAiBA,EAAexgH,GAAOugH,EAASvgH,GAE1E,OAAOqe,CACX,CA0CA,SAASyhG,GAAgBnpB,EAAQ3rF,GAC7B,OAAOA,EAAOwW,SAASX,MAAKkI,GAASA,IAAU4tE,GAAUmpB,GAAgBnpB,EAAQ5tE,IACrF,CAmBA,MAAM03F,GAAU,KACVC,GAAe,KACfC,GAAW,MACXC,GAAW,KACXC,GAAQ,MACRC,GAAU,MAeVC,GAAsB,OACtBC,GAAuB,OACvBC,GAAe,OACfC,GAAkB,OAClBC,GAAoB,OACpBC,GAAc,OACdC,GAAqB,OACrBC,GAAe,OASrB,SAASC,GAAat6E,GAClB,OAAOu6E,UAAU,GAAKv6E,GACjBnoC,QAAQsiH,GAAa,KACrBtiH,QAAQiiH,GAAqB,KAC7BjiH,QAAQkiH,GAAsB,IACvC,CAOA,SAASS,GAAWx6E,GAChB,OAAOs6E,GAAat6E,GACfnoC,QAAQqiH,GAAmB,KAC3BriH,QAAQuiH,GAAoB,KAC5BviH,QAAQmiH,GAAc,IAC/B,CAQA,SAASS,GAAiBz6E,GACtB,OAAQs6E,GAAat6E,GAEhBnoC,QAAQgiH,GAAS,OACjBhiH,QAAQwiH,GAAc,KACtBxiH,QAAQ2hH,GAAS,OACjB3hH,QAAQ4hH,GAAc,OACtB5hH,QAAQoiH,GAAiB,KACzBpiH,QAAQqiH,GAAmB,KAC3BriH,QAAQuiH,GAAoB,KAC5BviH,QAAQmiH,GAAc,IAC/B,CAMA,SAASU,GAAe16E,GACpB,OAAOy6E,GAAiBz6E,GAAMnoC,QAAQ8hH,GAAU,MACpD,CAOA,SAASgB,GAAW36E,GAChB,OAAOs6E,GAAat6E,GAAMnoC,QAAQ2hH,GAAS,OAAO3hH,QAAQ+hH,GAAO,MACrE,CAUA,SAASgB,GAAY56E,GACjB,OAAe,MAARA,EAAe,GAAK26E,GAAW36E,GAAMnoC,QAAQ6hH,GAAU,MAClE,CAQA,SAASp6G,GAAO0gC,GACZ,IACI,OAAOwoE,mBAAmB,GAAKxoE,EACnC,CACA,MAAOxuB,GAEP,CACA,MAAO,GAAKwuB,CAChB,CAWA,SAASmvE,GAAW56C,GAChB,MAAMT,EAAQ,CAAC,EAGf,GAAe,KAAXS,GAA4B,MAAXA,EACjB,OAAOT,EACX,MAAM+mD,EAA6B,MAAdtmD,EAAO,GACtBumD,GAAgBD,EAAetmD,EAAOh/C,MAAM,GAAKg/C,GAAQ90D,MAAM,KACrE,IAAK,IAAItL,EAAI,EAAGA,EAAI2mH,EAAa1mH,SAAUD,EAAG,CAE1C,MAAM4mH,EAAcD,EAAa3mH,GAAG0D,QAAQgiH,GAAS,KAE/CmB,EAAQD,EAAY5mG,QAAQ,KAC5Bpb,EAAMuG,GAAO07G,EAAQ,EAAID,EAAcA,EAAYxlG,MAAM,EAAGylG,IAC5D7iH,EAAQ6iH,EAAQ,EAAI,KAAO17G,GAAOy7G,EAAYxlG,MAAMylG,EAAQ,IAClE,GAAIjiH,KAAO+6D,EAAO,CAEd,IAAImnD,EAAennD,EAAM/6D,GACpB9C,EAAQglH,KACTA,EAAennD,EAAM/6D,GAAO,CAACkiH,IAEjCA,EAAankH,KAAKqB,EACtB,MAEI27D,EAAM/6D,GAAOZ,CAErB,CACA,OAAO27D,CACX,CAUA,SAAS47C,GAAe57C,GACpB,IAAIS,EAAS,GACb,IAAK,IAAIx7D,KAAO+6D,EAAO,CACnB,MAAM37D,EAAQ27D,EAAM/6D,GAEpB,GADAA,EAAM2hH,GAAe3hH,GACR,MAATZ,EAAe,MAEDE,IAAVF,IACAo8D,IAAWA,EAAOngE,OAAS,IAAM,IAAM2E,GAE3C,QACJ,CAEA,MAAMyP,EAASvS,EAAQkC,GACjBA,EAAM8H,KAAI8F,GAAKA,GAAK00G,GAAiB10G,KACrC,CAAC5N,GAASsiH,GAAiBtiH,IACjCqQ,EAAOnH,SAAQlJ,SAGGE,IAAVF,IAEAo8D,IAAWA,EAAOngE,OAAS,IAAM,IAAM2E,EAC1B,MAATZ,IACAo8D,GAAU,IAAMp8D,GACxB,GAER,CACA,OAAOo8D,CACX,CASA,SAAS2mD,GAAepnD,GACpB,MAAMqnD,EAAkB,CAAC,EACzB,IAAK,MAAMpiH,KAAO+6D,EAAO,CACrB,MAAM37D,EAAQ27D,EAAM/6D,QACNV,IAAVF,IACAgjH,EAAgBpiH,GAAO9C,EAAQkC,GACzBA,EAAM8H,KAAI8F,GAAW,MAALA,EAAY,KAAO,GAAKA,IAC/B,MAAT5N,EACIA,EACA,GAAKA,EAEvB,CACA,OAAOgjH,CACX,CASA,MAAMC,GAAkBnzG,OAAkF,IAOpGozG,GAAepzG,OAAuE,IAOtFqzG,GAAYrzG,OAA4D,IAOxEszG,GAAmBtzG,OAAoE,IAOvFuzG,GAAwBvzG,OAA0E,IAKxG,SAASwzG,KACL,IAAIC,EAAW,GACf,SAASxvG,EAAI4J,GAET,OADA4lG,EAAS5kH,KAAKgf,GACP,KACH,MAAM3hB,EAAIunH,EAASvnG,QAAQ2B,GACvB3hB,GAAK,GACLunH,EAAS3nG,OAAO5f,EAAG,EAAE,CAEjC,CACA,SAAS6N,IACL05G,EAAW,EACf,CACA,MAAO,CACHxvG,MACAyvG,KAAMA,IAAMD,EAASnmG,QACrBvT,QAER,CAyDA,SAAS45G,GAAiBC,EAAO1vF,EAAInF,EAAM0oE,EAAQj4F,GAE/C,MAAMqkH,EAAqBpsB,IAEtBA,EAAO0pB,eAAe3hH,GAAQi4F,EAAO0pB,eAAe3hH,IAAS,IAClE,MAAO,IAAM,IAAI2D,SAAQ,CAACF,EAASD,KAC/B,MAAMiS,EAAQ6uG,KACI,IAAVA,EACA9gH,EAAO85G,EAAkB,EAAuC,CAC5D/tF,OACAmF,QAGC4vF,aAAiBjoH,MACtBmH,EAAO8gH,GAEFxH,EAAgBwH,GACrB9gH,EAAO85G,EAAkB,EAA8C,CACnE/tF,KAAMmF,EACNA,GAAI4vF,MAIJD,GAEApsB,EAAO0pB,eAAe3hH,KAAUqkH,GACf,oBAAVC,GACPD,EAAmBhlH,KAAKilH,GAE5B7gH,IACJ,EAGE8gH,EAAcH,EAAM/7G,KAAK4vF,GAAUA,EAAOxjC,UAAUz0D,GAAO00B,EAAInF,EAAsF9Z,GAC3J,IAAI+uG,EAAY7gH,QAAQF,QAAQ8gH,GAC5BH,EAAMznH,OAAS,IACf6nH,EAAYA,EAAU/oG,KAAKhG,IAsB/B+uG,EAAU1gH,OAAMiW,GAAOvW,EAAOuW,IAAK,GAE3C,CAYA,SAAS0qG,GAAwBnM,EAASoM,EAAWhwF,EAAInF,GACrD,MAAMo1F,EAAS,GACf,IAAK,MAAM1sB,KAAUqgB,EAAS,CACrBx2G,EAIL,IAAK,MAAM9B,KAAQi4F,EAAOhlE,WAAY,CAClC,IAAI2xF,EAAe3sB,EAAOhlE,WAAWjzB,GAiCrC,GAAkB,qBAAd0kH,GAAqCzsB,EAAOxjC,UAAUz0D,GAE1D,GAAI6kH,GAAiBD,GAAe,CAEhC,MAAMjlG,EAAUilG,EAAah9E,WAAag9E,EACpCR,EAAQzkG,EAAQ+kG,GACtBN,GAASO,EAAOtlH,KAAK8kH,GAAiBC,EAAO1vF,EAAInF,EAAM0oE,EAAQj4F,GACnE,KACK,CAED,IAAI8kH,EAAmBF,IAClB9iH,EAIL6iH,EAAOtlH,MAAK,IAAMylH,EAAiBrpG,MAAK8Y,IACpC,IAAKA,EACD,OAAO5wB,QAAQH,OAAO,IAAInH,MAAO,+BAA8B2D,UAAai4F,EAAOlxE,UACvF,MAAMg+F,EAAoB9N,EAAW1iF,GAC/BA,EAASpK,QACToK,EAGN0jE,EAAOhlE,WAAWjzB,GAAQ+kH,EAE1B,MAAMplG,EAAUolG,EAAkBn9E,WAAam9E,EACzCX,EAAQzkG,EAAQ+kG,GACtB,OAAON,GAASD,GAAiBC,EAAO1vF,EAAInF,EAAM0oE,EAAQj4F,EAA1CmkH,EAAiD,KAEzE,CACJ,CACJ,CACA,OAAOQ,CACX,CAOA,SAASE,GAAiB7hG,GACtB,MAA6B,kBAAdA,GACX,gBAAiBA,GACjB,UAAWA,GACX,cAAeA,CACvB,CAgCA,SAASgiG,GAAQvnG,GACb,MAAMwnG,GAASjgG,EAAAA,EAAAA,IAAO6+F,IAChBqB,GAAelgG,EAAAA,EAAAA,IAAO8+F,IACtB/G,GAAQ5uG,EAAAA,EAAAA,KAAS,IAAM82G,EAAOxhH,SAAQgW,EAAAA,EAAAA,IAAMgE,EAAMiX,OAClDywF,GAAoBh3G,EAAAA,EAAAA,KAAS,KAC/B,MAAM,QAAEmqG,GAAYyE,EAAMr8G,OACpB,OAAE/D,GAAW27G,EACb8M,EAAe9M,EAAQ37G,EAAS,GAChC0oH,EAAiBH,EAAa5M,QACpC,IAAK8M,IAAiBC,EAAe1oH,OACjC,OAAQ,EACZ,MAAM4P,EAAQ84G,EAAetrF,UAAUy+E,EAAkB98F,KAAK,KAAM0pG,IACpE,GAAI74G,GAAS,EACT,OAAOA,EAEX,MAAM+4G,EAAmBC,GAAgBjN,EAAQ37G,EAAS,IAC1D,OAEAA,EAAS,GAIL4oH,GAAgBH,KAAkBE,GAElCD,EAAeA,EAAe1oH,OAAS,GAAGoqB,OAASu+F,EACjDD,EAAetrF,UAAUy+E,EAAkB98F,KAAK,KAAM48F,EAAQ37G,EAAS,KACvE4P,CAAM,IAEVi5G,GAAWr3G,EAAAA,EAAAA,KAAS,IAAMg3G,EAAkBzkH,OAAS,GACvD+kH,GAAeP,EAAax7G,OAAQqzG,EAAMr8G,MAAMgJ,UAC9Cg8G,GAAgBv3G,EAAAA,EAAAA,KAAS,IAAMg3G,EAAkBzkH,OAAS,GAC5DykH,EAAkBzkH,QAAUwkH,EAAa5M,QAAQ37G,OAAS,GAC1D87G,EAA0ByM,EAAax7G,OAAQqzG,EAAMr8G,MAAMgJ,UAC/D,SAASi8G,EAASrlH,EAAI,CAAC,GACnB,OAAIslH,GAAWtlH,GACJ2kH,GAAOxrG,EAAAA,EAAAA,IAAMgE,EAAMrd,SAAW,UAAY,SAAQqZ,EAAAA,EAAAA,IAAMgE,EAAMiX,KAEnE5wB,MAAMwzG,GAEL3zG,QAAQF,SACnB,CAwBA,MAAO,CACHs5G,QACA/gD,MAAM7tD,EAAAA,EAAAA,KAAS,IAAM4uG,EAAMr8G,MAAMs7D,OACjCwpD,WACAE,gBACAC,WAER,CACA,MAAME,IAA+B34F,EAAAA,EAAAA,IAAgB,CACjDltB,KAAM,aACN8lH,aAAc,CAAEC,KAAM,GACtBtoG,MAAO,CACHiX,GAAI,CACArwB,KAAM,CAACnH,OAAQ6D,QACfilH,UAAU,GAEd5lH,QAAS6oB,QACTg9F,YAAa/oH,OAEbgpH,iBAAkBhpH,OAClBipH,OAAQl9F,QACRm9F,iBAAkB,CACd/hH,KAAMnH,OACNitB,QAAS,SAGjB66F,WACAh7F,KAAAA,CAAMvM,GAAO,MAAEyD,IACX,MAAMmlG,GAAOjzG,EAAAA,EAAAA,IAAS4xG,GAAQvnG,KACxB,QAAEkC,IAAYqF,EAAAA,EAAAA,IAAO6+F,IACrByC,GAAUn4G,EAAAA,EAAAA,KAAS,KAAM,CAC3B,CAACo4G,GAAa9oG,EAAMwoG,YAAatmG,EAAQ6mG,gBAAiB,uBAAwBH,EAAKb,SAMvF,CAACe,GAAa9oG,EAAMyoG,iBAAkBvmG,EAAQ8mG,qBAAsB,6BAA8BJ,EAAKX,kBAE3G,MAAO,KACH,MAAM5iG,EAAW5B,EAAMiJ,SAAWjJ,EAAMiJ,QAAQk8F,GAChD,OAAO5oG,EAAM0oG,OACPrjG,GACAmR,EAAAA,EAAAA,GAAE,IAAK,CACL,eAAgBoyF,EAAKX,cACfjoG,EAAM2oG,iBACN,KACNpqD,KAAMqqD,EAAKrqD,KAGX0qD,QAASL,EAAKV,SACd1lF,MAAOqmF,EAAQ5lH,OAChBoiB,EAAS,CAExB,IAOE6jG,GAAad,GACnB,SAASD,GAAWtlH,GAEhB,KAAIA,EAAEsmH,SAAWtmH,EAAEumH,QAAUvmH,EAAEwmH,SAAWxmH,EAAEymH,YAGxCzmH,EAAE0mH,wBAGWpmH,IAAbN,EAAE2mH,QAAqC,IAAb3mH,EAAE2mH,QAAhC,CAIA,GAAI3mH,EAAE4mH,eAAiB5mH,EAAE4mH,cAAc9zE,aAAc,CAEjD,MAAMvyC,EAASP,EAAE4mH,cAAc9zE,aAAa,UAC5C,GAAI,cAAc5tC,KAAK3E,GACnB,MACR,CAIA,OAFIP,EAAE6mH,gBACF7mH,EAAE6mH,kBACC,CAZG,CAad,CACA,SAAS1B,GAAenyC,EAAOC,GAC3B,IAAK,MAAMjyE,KAAOiyE,EAAO,CACrB,MAAM6zC,EAAa7zC,EAAMjyE,GACnB+lH,EAAa/zC,EAAMhyE,GACzB,GAA0B,kBAAf8lH,GACP,GAAIA,IAAeC,EACf,OAAO,OAGX,IAAK7oH,EAAQ6oH,IACTA,EAAW1qH,SAAWyqH,EAAWzqH,QACjCyqH,EAAWjlG,MAAK,CAACzhB,EAAOhE,IAAMgE,IAAU2mH,EAAW3qH,KACnD,OAAO,CAEnB,CACA,OAAO,CACX,CAKA,SAAS6oH,GAAgBttB,GACrB,OAAOA,EAAUA,EAAOygB,QAAUzgB,EAAOygB,QAAQ3xF,KAAOkxE,EAAOlxE,KAAQ,EAC3E,CAOA,MAAMw/F,GAAeA,CAACe,EAAWC,EAAaC,IAA8B,MAAbF,EACzDA,EACe,MAAfC,EACIA,EACAC,EAEJC,IAA+Bv6F,EAAAA,EAAAA,IAAgB,CACjDltB,KAAM,aAENuhB,cAAc,EACd9D,MAAO,CACHzd,KAAM,CACFqE,KAAMnH,OACNitB,QAAS,WAEb4yF,MAAOh8G,QAIX+kH,aAAc,CAAEC,KAAM,GACtB/7F,KAAAA,CAAMvM,GAAO,MAAE0D,EAAK,MAAED,IAElB,MAAMwmG,GAAgB1iG,EAAAA,EAAAA,IAAO++F,IACvB4D,GAAiBx5G,EAAAA,EAAAA,KAAS,IAAMsP,EAAMs/F,OAAS2K,EAAchnH,QAC7DknH,GAAgB5iG,EAAAA,EAAAA,IAAO4+F,GAAc,GAGrC38F,GAAQ9Y,EAAAA,EAAAA,KAAS,KACnB,IAAI05G,GAAepuG,EAAAA,EAAAA,IAAMmuG,GACzB,MAAM,QAAEtP,GAAYqP,EAAejnH,MACnC,IAAIonH,EACJ,OAAQA,EAAexP,EAAQuP,MAC1BC,EAAa70F,WACd40F,IAEJ,OAAOA,CAAY,IAEjBE,GAAkB55G,EAAAA,EAAAA,KAAS,IAAMw5G,EAAejnH,MAAM43G,QAAQrxF,EAAMvmB,UAC1EsxB,EAAAA,EAAAA,IAAQ4xF,IAAcz1G,EAAAA,EAAAA,KAAS,IAAM8Y,EAAMvmB,MAAQ,MACnDsxB,EAAAA,EAAAA,IAAQ2xF,GAAiBoE,IACzB/1F,EAAAA,EAAAA,IAAQ+xF,GAAuB4D,GAC/B,MAAMK,GAAU/uG,EAAAA,EAAAA,MAiChB,OA9BAiM,EAAAA,EAAAA,KAAM,IAAM,CAAC8iG,EAAQtnH,MAAOqnH,EAAgBrnH,MAAO+c,EAAMzd,QAAO,EAAE8Z,EAAU4a,EAAI10B,IAAQioH,EAAa14F,EAAM24F,MAEnGxzF,IAGAA,EAAG+/B,UAAUz0D,GAAQ8Z,EAOjByV,GAAQA,IAASmF,GAAM5a,GAAYA,IAAamuG,IAC3CvzF,EAAG+sF,YAAYvyG,OAChBwlB,EAAG+sF,YAAclyF,EAAKkyF,aAErB/sF,EAAGgtF,aAAaxyG,OACjBwlB,EAAGgtF,aAAenyF,EAAKmyF,iBAK/B5nG,IACA4a,GAGEnF,GAASipF,EAAkB9jF,EAAInF,IAAU04F,IAC1CvzF,EAAGitF,eAAe3hH,IAAS,IAAI4J,SAAQ/F,GAAYA,EAASiW,IACjE,GACD,CAAEwL,MAAO,SACL,KACH,MAAMy3F,EAAQ4K,EAAejnH,MAGvBynH,EAAc1qG,EAAMzd,KACpB8nH,EAAeC,EAAgBrnH,MAC/B0nH,EAAgBN,GAAgBA,EAAa70F,WAAWk1F,GAC9D,IAAKC,EACD,OAAOluF,GAAchZ,EAAMiJ,QAAS,CAAEpJ,UAAWqnG,EAAerL,UAGpE,MAAMsL,EAAmBP,EAAarqG,MAAM0qG,GACtCG,EAAaD,GACQ,IAArBA,EACItL,EAAMrzG,OACsB,oBAArB2+G,EACHA,EAAiBtL,GACjBsL,EACR,KACAzjF,EAAmBvqB,IAEjBA,EAAM2I,UAAUxF,cAChBsqG,EAAarzD,UAAU0zD,GAAe,KAC1C,EAEEnlG,GAAYiR,EAAAA,EAAAA,GAAEm0F,EAAezjH,EAAO,CAAC,EAAG2jH,EAAYnnG,EAAO,CAC7DyjB,mBACA3rB,IAAK+uG,KAoBT,OAGA9tF,GAAchZ,EAAMiJ,QAAS,CAAEpJ,UAAWiC,EAAW+5F,WACjD/5F,CAAU,CAEtB,IAEJ,SAASkX,GAAc2O,EAAMxhC,GACzB,IAAKwhC,EACD,OAAO,KACX,MAAM0/E,EAAc1/E,EAAKxhC,GACzB,OAA8B,IAAvBkhH,EAAY5rH,OAAe4rH,EAAY,GAAKA,CACvD,CAMA,MAAMC,GAAaf,GA0dnB,SAASgB,GAAa9oG,GAClB,MAAMigG,EAAUE,GAAoBngG,EAAQogG,OAAQpgG,GAC9C+oG,EAAe/oG,EAAQ+3F,YAAcA,GACrCiR,EAAmBhpG,EAAQs4F,gBAAkBA,GAC7C4E,EAAgBl9F,EAAQ46F,QAI9B,MAAMqO,EAAe5E,KACf6E,EAAsB7E,KACtB8E,EAAc9E,KACdkB,GAAe/rG,EAAAA,EAAAA,IAAW8jG,GAChC,IAAI8L,EAAkB9L,EAElBjG,GAAar3F,EAAQqpG,gBAAkB,sBAAuBzO,UAC9DA,QAAQ0O,kBAAoB,UAEhC,MAAMC,EAAkB9R,EAAc17F,KAAK,MAAMytG,GAAc,GAAKA,IAC9DC,EAAehS,EAAc17F,KAAK,KAAMynG,IACxCkG,EAENjS,EAAc17F,KAAK,KAAM7T,IACzB,SAASu4G,EAASkJ,EAAevM,GAC7B,IAAIzwG,EACA2rF,EAQJ,OAPI+kB,EAAYsM,IACZh9G,EAASszG,EAAQO,iBAAiBmJ,GAClCrxB,EAAS8kB,GAGT9kB,EAASqxB,EAEN1J,EAAQQ,SAASnoB,EAAQ3rF,EACpC,CACA,SAASy0G,EAAY/gH,GACjB,MAAMupH,EAAgB3J,EAAQO,iBAAiBngH,GAC3CupH,GACA3J,EAAQmB,YAAYwI,EAK5B,CACA,SAASpI,IACL,OAAOvB,EAAQuB,YAAY34G,KAAIghH,GAAgBA,EAAavxB,QAChE,CACA,SAASwxB,EAASzpH,GACd,QAAS4/G,EAAQO,iBAAiBngH,EACtC,CACA,SAASyD,EAAQimH,EAAa/R,GAI1B,GADAA,EAAkBhzG,EAAO,CAAC,EAAGgzG,GAAmBuN,EAAaxkH,OAClC,kBAAhBgpH,EAA0B,CACjC,MAAMC,EAAqBlS,EAASiR,EAAcgB,EAAa/R,EAAgB5wF,MACzE+gG,EAAelI,EAAQn8G,QAAQ,CAAEsjB,KAAM4iG,EAAmB5iG,MAAQ4wF,GAClE37C,EAAO6gD,EAActD,WAAWoQ,EAAmB50B,UASzD,OAAOpwF,EAAOglH,EAAoB7B,EAAc,CAC5Cp+G,OAAQ2/G,EAAavB,EAAap+G,QAClC6mE,KAAM1oE,GAAO8hH,EAAmBp5C,MAChC4sC,oBAAgBv8G,EAChBo7D,QAER,CACA,IAAI4tD,EAEJ,GAAI,SAAUF,EAQVE,EAAkBjlH,EAAO,CAAC,EAAG+kH,EAAa,CACtC3iG,KAAM0wF,EAASiR,EAAcgB,EAAY3iG,KAAM4wF,EAAgB5wF,MAAMA,WAGxE,CAED,MAAM8iG,EAAellH,EAAO,CAAC,EAAG+kH,EAAYhgH,QAC5C,IAAK,MAAMpI,KAAOuoH,EACW,MAArBA,EAAavoH,WACNuoH,EAAavoH,GAI5BsoH,EAAkBjlH,EAAO,CAAC,EAAG+kH,EAAa,CACtChgH,OAAQ0/G,EAAaS,KAIzBlS,EAAgBjuG,OAAS0/G,EAAazR,EAAgBjuG,OAC1D,CACA,MAAMo+G,EAAelI,EAAQn8G,QAAQmmH,EAAiBjS,GAChDpnC,EAAOm5C,EAAYn5C,MAAQ,GAMjCu3C,EAAap+G,OAASw/G,EAAgBG,EAAavB,EAAap+G,SAChE,MAAMqrF,EAAWijB,EAAa2Q,EAAkBhkH,EAAO,CAAC,EAAG+kH,EAAa,CACpEn5C,KAAMwyC,GAAWxyC,GACjBxpD,KAAM+gG,EAAa/gG,QAEjBi1C,EAAO6gD,EAActD,WAAWxkB,GAStC,OAAOpwF,EAAO,CACVowF,WAGAxkB,OACAlU,MAMAssD,IAAqB1Q,GACfwL,GAAeiG,EAAYrtD,OAC1BqtD,EAAYrtD,OAAS,CAAC,GAC9ByrD,EAAc,CACb3K,oBAAgBv8G,EAChBo7D,QAER,CACA,SAAS8tD,EAAiBp1F,GACtB,MAAqB,kBAAPA,EACR+iF,EAASiR,EAAch0F,EAAIwwF,EAAaxkH,MAAMqmB,MAC9CpiB,EAAO,CAAC,EAAG+vB,EACrB,CACA,SAASq1F,EAAwBr1F,EAAInF,GACjC,GAAIw5F,IAAoBr0F,EACpB,OAAO4oF,EAAkB,EAAyC,CAC9D/tF,OACAmF,MAGZ,CACA,SAASr1B,EAAKq1B,GACV,OAAOs1F,EAAiBt1F,EAC5B,CACA,SAASt0B,EAAQs0B,GACb,OAAOr1B,EAAKsF,EAAOmlH,EAAiBp1F,GAAK,CAAEt0B,SAAS,IACxD,CACA,SAAS6pH,EAAqBv1F,GAC1B,MAAMw1F,EAAcx1F,EAAG4jF,QAAQ5jF,EAAG4jF,QAAQ37G,OAAS,GACnD,GAAIutH,GAAeA,EAAYlJ,SAAU,CACrC,MAAM,SAAEA,GAAakJ,EACrB,IAAIC,EAAwC,oBAAbnJ,EAA0BA,EAAStsF,GAAMssF,EAiBxE,MAhBiC,kBAAtBmJ,IACPA,EACIA,EAAkBhhH,SAAS,MAAQghH,EAAkBhhH,SAAS,KACvDghH,EAAoBL,EAAiBK,GAEpC,CAAEpjG,KAAMojG,GAGpBA,EAAkBzgH,OAAS,CAAC,GAQzB/E,EAAO,CACV03D,MAAO3nC,EAAG2nC,MACVkU,KAAM77C,EAAG67C,KAET7mE,OAAQ,SAAUygH,EAAoB,CAAC,EAAIz1F,EAAGhrB,QAC/CygH,EACP,CACJ,CACA,SAASH,EAAiBt1F,EAAIyoF,GAC1B,MAAMiN,EAAkBrB,EAAkBtlH,EAAQixB,GAC5CnF,EAAO21F,EAAaxkH,MACpB2G,EAAOqtB,EAAGrM,MACVgiG,EAAQ31F,EAAG21F,MAEXjqH,GAAyB,IAAfs0B,EAAGt0B,QACbkqH,EAAiBL,EAAqBG,GAC5C,GAAIE,EACA,OAAON,EAAiBrlH,EAAOmlH,EAAiBQ,GAAiB,CAC7DjiG,MAAiC,kBAAnBiiG,EACR3lH,EAAO,CAAC,EAAG0C,EAAMijH,EAAejiG,OAChChhB,EACNgjH,QACAjqH,YAGJ+8G,GAAkBiN,GAEtB,MAAMG,EAAaH,EAEnB,IAAII,EAYJ,OAbAD,EAAWpN,eAAiBA,GAEvBkN,GAASjS,EAAoBuQ,EAAkBp5F,EAAM66F,KACtDI,EAAUlN,EAAkB,GAA2C,CAAE5oF,GAAI61F,EAAYh7F,SAEzFk7F,GAAal7F,EAAMA,GAGnB,GAGA,KAEIi7F,EAAU7mH,QAAQF,QAAQ+mH,GAAW7E,EAAS4E,EAAYh7F,IAC7DzrB,OAAOtD,GAAU+8G,EAAoB/8G,GAElC+8G,EAAoB/8G,EAAO,GACrBA,EACAkqH,GAAYlqH,GAElBmqH,GAAanqH,EAAO+pH,EAAYh7F,KACnC9T,MAAM+uG,IACP,GAAIA,GACA,GAAIjN,EAAoBiN,EAAS,GAc7B,OAAOR,EAEPrlH,EAAO,CAEHvE,WACD0pH,EAAiBU,EAAQ91F,IAAK,CAC7BrM,MAA6B,kBAAfmiG,EAAQ91F,GAChB/vB,EAAO,CAAC,EAAG0C,EAAMmjH,EAAQ91F,GAAGrM,OAC5BhhB,EACNgjH,UAGJlN,GAAkBoN,QAKtBC,EAAUI,EAAmBL,EAAYh7F,GAAM,EAAMnvB,EAASiH,GAGlE,OADAwjH,EAAiBN,EAAYh7F,EAAMi7F,GAC5BA,CAAO,GAEtB,CAMA,SAASM,EAAiCp2F,EAAInF,GAC1C,MAAM/uB,EAAQupH,EAAwBr1F,EAAInF,GAC1C,OAAO/uB,EAAQmD,QAAQH,OAAOhD,GAASmD,QAAQF,SACnD,CACA,SAAS8zB,EAAe9uB,GACpB,MAAM6sB,EAAMy1F,GAAch6G,SAAS0E,OAAO/U,MAE1C,OAAO40B,GAAqC,oBAAvBA,EAAIiC,eACnBjC,EAAIiC,eAAe9uB,GACnBA,GACV,CAEA,SAASk9G,EAASjxF,EAAInF,GAClB,IAAIo1F,EACJ,MAAOqG,EAAgBC,EAAiBC,GAAmBC,GAAuBz2F,EAAInF,GAEtFo1F,EAASF,GAAwBuG,EAAervD,UAAW,mBAAoBjnC,EAAInF,GAEnF,IAAK,MAAM0oE,KAAU+yB,EACjB/yB,EAAOwpB,YAAY73G,SAAQw6G,IACvBO,EAAOtlH,KAAK8kH,GAAiBC,EAAO1vF,EAAInF,GAAM,IAGtD,MAAM67F,EAA0BN,EAAiCpvG,KAAK,KAAMgZ,EAAInF,GAGhF,OAFAo1F,EAAOtlH,KAAK+rH,GAEJC,GAAc1G,GACjBlpG,MAAK,KAENkpG,EAAS,GACT,IAAK,MAAMP,KAASwE,EAAa1E,OAC7BS,EAAOtlH,KAAK8kH,GAAiBC,EAAO1vF,EAAInF,IAG5C,OADAo1F,EAAOtlH,KAAK+rH,GACLC,GAAc1G,EAAO,IAE3BlpG,MAAK,KAENkpG,EAASF,GAAwBwG,EAAiB,oBAAqBv2F,EAAInF,GAC3E,IAAK,MAAM0oE,KAAUgzB,EACjBhzB,EAAOypB,aAAa93G,SAAQw6G,IACxBO,EAAOtlH,KAAK8kH,GAAiBC,EAAO1vF,EAAInF,GAAM,IAKtD,OAFAo1F,EAAOtlH,KAAK+rH,GAELC,GAAc1G,EAAO,IAE3BlpG,MAAK,KAENkpG,EAAS,GACT,IAAK,MAAM1sB,KAAUizB,EAEjB,GAAIjzB,EAAOjsE,YACP,GAAIxtB,EAAQy5F,EAAOjsE,aACf,IAAK,MAAMA,KAAeisE,EAAOjsE,YAC7B24F,EAAOtlH,KAAK8kH,GAAiBn4F,EAAa0I,EAAInF,SAGlDo1F,EAAOtlH,KAAK8kH,GAAiBlsB,EAAOjsE,YAAa0I,EAAInF,IAMjE,OAFAo1F,EAAOtlH,KAAK+rH,GAELC,GAAc1G,EAAO,IAE3BlpG,MAAK,KAGNiZ,EAAG4jF,QAAQ1uG,SAAQquF,GAAWA,EAAO0pB,eAAiB,CAAC,IAEvDgD,EAASF,GAAwByG,EAAiB,mBAAoBx2F,EAAInF,GAC1Eo1F,EAAOtlH,KAAK+rH,GAELC,GAAc1G,MAEpBlpG,MAAK,KAENkpG,EAAS,GACT,IAAK,MAAMP,KAASyE,EAAoB3E,OACpCS,EAAOtlH,KAAK8kH,GAAiBC,EAAO1vF,EAAInF,IAG5C,OADAo1F,EAAOtlH,KAAK+rH,GACLC,GAAc1G,EAAO,IAG3B7gH,OAAMiW,GAAOwjG,EAAoBxjG,EAAK,GACrCA,EACApW,QAAQH,OAAOuW,IACzB,CACA,SAAS8wG,EAAiBn2F,EAAInF,EAAMi7F,GAGhC1B,EACK5E,OACAt6G,SAAQw6G,GAAS7sF,GAAe,IAAM6sF,EAAM1vF,EAAInF,EAAMi7F,MAC/D,CAMA,SAASI,EAAmBL,EAAYh7F,EAAM+7F,EAAQlrH,EAASiH,GAE3D,MAAM7G,EAAQupH,EAAwBQ,EAAYh7F,GAClD,GAAI/uB,EACA,OAAOA,EAEX,MAAM+qH,EAAoBh8F,IAAS0tF,EAC7B50F,EAAS2uF,EAAiBuD,QAAQlyF,MAAb,CAAC,EAGxBijG,IAGIlrH,GAAWmrH,EACX1O,EAAcz8G,QAAQmqH,EAAWx1B,SAAUpwF,EAAO,CAC9Ci2G,OAAQ2Q,GAAqBljG,GAASA,EAAMuyF,QAC7CvzG,IAEHw1G,EAAcx9G,KAAKkrH,EAAWx1B,SAAU1tF,IAGhD69G,EAAaxkH,MAAQ6pH,EACrBE,GAAaF,EAAYh7F,EAAM+7F,EAAQC,GACvCb,IACJ,CACA,IAAIc,EAEJ,SAASC,IAEDD,IAEJA,EAAwB3O,EAAcjlC,QAAO,CAACljD,EAAIg3F,EAAOlpH,KACrD,IAAKyiH,GAAO0G,UACR,OAEJ,MAAMpB,EAAa9mH,EAAQixB,GAIrB41F,EAAiBL,EAAqBM,GAC5C,GAAID,EAEA,YADAN,EAAiBrlH,EAAO2lH,EAAgB,CAAElqH,SAAS,IAASmqH,GAAYzmH,MAAMwzG,GAGlFyR,EAAkBwB,EAClB,MAAMh7F,EAAO21F,EAAaxkH,MAEtBs2G,GACAyD,EAAmBH,EAAa/qF,EAAKwlE,SAAUvyF,EAAKk5E,OAAQm+B,KAEhE8L,EAAS4E,EAAYh7F,GAChBzrB,OAAOtD,GACJ+8G,EAAoB/8G,EAAO,IACpBA,EAEP+8G,EAAoB/8G,EAAO,IAU3BwpH,EAAiBxpH,EAAMk0B,GAAI61F,GAGtB9uG,MAAK+uG,IAIFjN,EAAoBiN,EAAS,MAE5BhoH,EAAKk5E,OACNl5E,EAAK6B,OAAS60G,EAAehsG,KAC7B2vG,EAAcF,IAAI,GAAG,EACzB,IAEC74G,MAAMwzG,GAEJ3zG,QAAQH,WAGfhB,EAAKk5E,OACLmhC,EAAcF,IAAIn6G,EAAKk5E,OAAO,GAG3BivC,GAAanqH,EAAO+pH,EAAYh7F,MAEtC9T,MAAM+uG,IACPA,EACIA,GACII,EAEAL,EAAYh7F,GAAM,GAEtBi7F,IACIhoH,EAAKk5E,QAGJ6hC,EAAoBiN,EAAS,GAC9B3N,EAAcF,IAAIn6G,EAAKk5E,OAAO,GAEzBl5E,EAAK6B,OAAS60G,EAAehsG,KAClCqwG,EAAoBiN,EAAS,KAG7B3N,EAAcF,IAAI,GAAG,IAG7BkO,EAAiBN,EAAYh7F,EAAMi7F,EAAQ,IAG1C1mH,MAAMwzG,EAAK,IAExB,CAEA,IAEIsU,EAFAC,EAAgB7H,KAChB8H,EAAiB9H,KAUrB,SAAS2G,GAAanqH,EAAOk0B,EAAInF,GAC7Bm7F,GAAYlqH,GACZ,MAAM0jH,EAAO4H,EAAe5H,OAW5B,OAVIA,EAAKvnH,OACLunH,EAAKt6G,SAAQyU,GAAWA,EAAQ7d,EAAOk0B,EAAInF,KAM3ChvB,QAAQC,MAAMA,GAGXmD,QAAQH,OAAOhD,EAC1B,CACA,SAASurH,KACL,OAAIH,GAAS1G,EAAaxkH,QAAUu8G,EACzBt5G,QAAQF,UACZ,IAAIE,SAAQ,CAACF,EAASD,KACzBqoH,EAAcp3G,IAAI,CAAChR,EAASD,GAAQ,GAE5C,CACA,SAASknH,GAAY3wG,GAUjB,OATK6xG,IAEDA,GAAS7xG,EACT0xG,IACAI,EACK3H,OACAt6G,SAAQ,EAAEnG,EAASD,KAAauW,EAAMvW,EAAOuW,GAAOtW,MACzDooH,EAActhH,SAEXwP,CACX,CAEA,SAAS0wG,GAAa/1F,EAAInF,EAAM+7F,EAAQC,GACpC,MAAM,eAAEvC,GAAmBrpG,EAC3B,IAAKq3F,IAAcgS,EACf,OAAOrlH,QAAQF,UACnB,MAAMi3G,GAAmB4Q,GAAU3Q,EAAuBL,EAAa5lF,EAAGqgE,SAAU,MAC9Ew2B,IAAsBD,IACpB/Q,QAAQlyF,OACRkyF,QAAQlyF,MAAMuyF,QAClB,KACJ,OAAOp/F,EAAAA,EAAAA,MACFC,MAAK,IAAMutG,EAAet0F,EAAInF,EAAMmrF,KACpCj/F,MAAKw9F,GAAYA,GAAYe,EAAiBf,KAC9Cn1G,OAAMiW,GAAO4wG,GAAa5wG,EAAK2a,EAAInF,IAC5C,CACA,MAAMotF,GAAMjhC,GAAUmhC,EAAcF,GAAGjhC,GACvC,IAAIswC,GACJ,MAAMjB,GAAgB,IAAIt5G,IACpBwzG,GAAS,CACXC,eACAyG,WAAW,EACXvL,WACAW,cACA0I,WACAtI,YACA19G,UACAkc,UACAtgB,OACAe,UACAu8G,MACAlB,KAAMA,IAAMkB,IAAI,GAChBnB,QAASA,IAAMmB,GAAG,GAClBsP,WAAYrD,EAAan0G,IACzBy3G,cAAerD,EAAoBp0G,IACnC03G,UAAWrD,EAAYr0G,IACvB23G,QAASN,EAAer3G,IACxBs3G,WACAj1F,OAAAA,CAAQxB,GACJ,MAAM2vF,EAASjnH,KACfs3B,EAAItS,UAAU,aAAc2jG,IAC5BrxF,EAAItS,UAAU,aAAcwlG,IAC5BlzF,EAAIhyB,OAAO8tB,iBAAiBi7F,QAAUpH,EACtClkH,OAAOuwB,eAAegE,EAAIhyB,OAAO8tB,iBAAkB,SAAU,CACzDmC,YAAY,EACZvkB,IAAKA,KAAMyK,EAAAA,EAAAA,IAAMyrG,KAKjBlO,IAGCgV,IACD9G,EAAaxkH,QAAUu8G,IAEvB+O,IAAU,EACV3sH,EAAKw9G,EAAcljD,UAAU71D,OAAMiW,IAC1BjY,CACD2uD,KAGZ,MAAM67D,EAAgB,CAAC,EACvB,IAAK,MAAMhrH,KAAO27G,EACdl8G,OAAOuwB,eAAeg7F,EAAehrH,EAAK,CACtC0N,IAAKA,IAAMk2G,EAAaxkH,MAAMY,GAC9BiyB,YAAY,IAGpB+B,EAAItD,QAAQ6xF,GAAWoB,GACvB3vF,EAAItD,QAAQ8xF,IAAkB9sG,EAAAA,EAAAA,IAAgBs1G,IAC9Ch3F,EAAItD,QAAQ+xF,GAAuBmB,GACnC,MAAMqH,EAAaj3F,EAAIgC,QACvByzF,GAAct2G,IAAI6gB,GAClBA,EAAIgC,QAAU,WACVyzF,GAAc97G,OAAOqmB,GAEjBy1F,GAAc77G,KAAO,IAErB65G,EAAkB9L,EAClBuO,GAAyBA,IACzBA,EAAwB,KACxBtG,EAAaxkH,MAAQu8G,EACrB+O,IAAU,EACVJ,GAAQ,GAEZW,GACJ,CAKJ,GAGJ,SAASlB,GAAc1G,GACnB,OAAOA,EAAOlzF,QAAO,CAAC/tB,EAAS0gH,IAAU1gH,EAAQ+X,MAAK,IAAM8b,EAAe6sF,MAASzgH,QAAQF,UAChG,CACA,OAAOwhH,EACX,CACA,SAASkG,GAAuBz2F,EAAInF,GAChC,MAAMy7F,EAAiB,GACjBC,EAAkB,GAClBC,EAAkB,GAClBnlF,EAAMnD,KAAKoO,IAAIzhB,EAAK+oF,QAAQ37G,OAAQ+3B,EAAG4jF,QAAQ37G,QACrD,IAAK,IAAID,EAAI,EAAGA,EAAIqpC,EAAKrpC,IAAK,CAC1B,MAAM8vH,EAAaj9F,EAAK+oF,QAAQ57G,GAC5B8vH,IACI93F,EAAG4jF,QAAQnlD,MAAK8kC,GAAUugB,EAAkBvgB,EAAQu0B,KACpDvB,EAAgB5rH,KAAKmtH,GAErBxB,EAAe3rH,KAAKmtH,IAE5B,MAAMC,EAAW/3F,EAAG4jF,QAAQ57G,GACxB+vH,IAEKl9F,EAAK+oF,QAAQnlD,MAAK8kC,GAAUugB,EAAkBvgB,EAAQw0B,MACvDvB,EAAgB7rH,KAAKotH,GAGjC,CACA,MAAO,CAACzB,EAAgBC,EAAiBC,EAC7C,C","sources":["webpack://websitre/../src/constants.ts","webpack://websitre/../src/assert.ts","webpack://websitre/../src/crypt.ts","webpack://websitre/../src/deepCopy.ts","webpack://websitre/../src/global.ts","webpack://websitre/../src/defaults.ts","webpack://websitre/../src/deferred.ts","webpack://websitre/../src/emulator.ts","webpack://websitre/../src/environment.ts","webpack://websitre/../src/errors.ts","webpack://websitre/../src/json.ts","webpack://websitre/../src/jwt.ts","webpack://websitre/../src/obj.ts","webpack://websitre/../src/query.ts","webpack://websitre/../src/sha1.ts","webpack://websitre/../src/validation.ts","webpack://websitre/../src/utf8.ts","webpack://websitre/../src/compat.ts","webpack://websitre/./node_modules/@vue/reactivity/dist/reactivity.esm-bundler.js","webpack://websitre/./node_modules/@vue/runtime-core/dist/runtime-core.esm-bundler.js","webpack://websitre/./node_modules/@vue/runtime-dom/dist/runtime-dom.esm-bundler.js","webpack://websitre/./node_modules/@vue/shared/dist/shared.esm-bundler.js","webpack://websitre/./node_modules/vue-loader/dist/exportHelper.js","webpack://websitre/./node_modules/core-js/internals/a-callable.js","webpack://websitre/./node_modules/core-js/internals/a-possible-prototype.js","webpack://websitre/./node_modules/core-js/internals/an-instance.js","webpack://websitre/./node_modules/core-js/internals/an-object.js","webpack://websitre/./node_modules/core-js/internals/array-includes.js","webpack://websitre/./node_modules/core-js/internals/array-set-length.js","webpack://websitre/./node_modules/core-js/internals/classof-raw.js","webpack://websitre/./node_modules/core-js/internals/classof.js","webpack://websitre/./node_modules/core-js/internals/copy-constructor-properties.js","webpack://websitre/./node_modules/core-js/internals/create-non-enumerable-property.js","webpack://websitre/./node_modules/core-js/internals/create-property-descriptor.js","webpack://websitre/./node_modules/core-js/internals/define-built-in.js","webpack://websitre/./node_modules/core-js/internals/define-global-property.js","webpack://websitre/./node_modules/core-js/internals/descriptors.js","webpack://websitre/./node_modules/core-js/internals/document-create-element.js","webpack://websitre/./node_modules/core-js/internals/does-not-exceed-safe-integer.js","webpack://websitre/./node_modules/core-js/internals/dom-exception-constants.js","webpack://websitre/./node_modules/core-js/internals/engine-user-agent.js","webpack://websitre/./node_modules/core-js/internals/engine-v8-version.js","webpack://websitre/./node_modules/core-js/internals/enum-bug-keys.js","webpack://websitre/./node_modules/core-js/internals/error-stack-clear.js","webpack://websitre/./node_modules/core-js/internals/export.js","webpack://websitre/./node_modules/core-js/internals/fails.js","webpack://websitre/./node_modules/core-js/internals/function-bind-native.js","webpack://websitre/./node_modules/core-js/internals/function-call.js","webpack://websitre/./node_modules/core-js/internals/function-name.js","webpack://websitre/./node_modules/core-js/internals/function-uncurry-this-accessor.js","webpack://websitre/./node_modules/core-js/internals/function-uncurry-this.js","webpack://websitre/./node_modules/core-js/internals/get-built-in.js","webpack://websitre/./node_modules/core-js/internals/get-method.js","webpack://websitre/./node_modules/core-js/internals/global.js","webpack://websitre/./node_modules/core-js/internals/has-own-property.js","webpack://websitre/./node_modules/core-js/internals/hidden-keys.js","webpack://websitre/./node_modules/core-js/internals/ie8-dom-define.js","webpack://websitre/./node_modules/core-js/internals/indexed-object.js","webpack://websitre/./node_modules/core-js/internals/inherit-if-required.js","webpack://websitre/./node_modules/core-js/internals/inspect-source.js","webpack://websitre/./node_modules/core-js/internals/internal-state.js","webpack://websitre/./node_modules/core-js/internals/is-array.js","webpack://websitre/./node_modules/core-js/internals/is-callable.js","webpack://websitre/./node_modules/core-js/internals/is-forced.js","webpack://websitre/./node_modules/core-js/internals/is-null-or-undefined.js","webpack://websitre/./node_modules/core-js/internals/is-object.js","webpack://websitre/./node_modules/core-js/internals/is-possible-prototype.js","webpack://websitre/./node_modules/core-js/internals/is-pure.js","webpack://websitre/./node_modules/core-js/internals/is-symbol.js","webpack://websitre/./node_modules/core-js/internals/length-of-array-like.js","webpack://websitre/./node_modules/core-js/internals/make-built-in.js","webpack://websitre/./node_modules/core-js/internals/math-trunc.js","webpack://websitre/./node_modules/core-js/internals/normalize-string-argument.js","webpack://websitre/./node_modules/core-js/internals/object-define-property.js","webpack://websitre/./node_modules/core-js/internals/object-get-own-property-descriptor.js","webpack://websitre/./node_modules/core-js/internals/object-get-own-property-names.js","webpack://websitre/./node_modules/core-js/internals/object-get-own-property-symbols.js","webpack://websitre/./node_modules/core-js/internals/object-is-prototype-of.js","webpack://websitre/./node_modules/core-js/internals/object-keys-internal.js","webpack://websitre/./node_modules/core-js/internals/object-property-is-enumerable.js","webpack://websitre/./node_modules/core-js/internals/object-set-prototype-of.js","webpack://websitre/./node_modules/core-js/internals/ordinary-to-primitive.js","webpack://websitre/./node_modules/core-js/internals/own-keys.js","webpack://websitre/./node_modules/core-js/internals/require-object-coercible.js","webpack://websitre/./node_modules/core-js/internals/shared-key.js","webpack://websitre/./node_modules/core-js/internals/shared-store.js","webpack://websitre/./node_modules/core-js/internals/shared.js","webpack://websitre/./node_modules/core-js/internals/symbol-constructor-detection.js","webpack://websitre/./node_modules/core-js/internals/to-absolute-index.js","webpack://websitre/./node_modules/core-js/internals/to-indexed-object.js","webpack://websitre/./node_modules/core-js/internals/to-integer-or-infinity.js","webpack://websitre/./node_modules/core-js/internals/to-length.js","webpack://websitre/./node_modules/core-js/internals/to-object.js","webpack://websitre/./node_modules/core-js/internals/to-primitive.js","webpack://websitre/./node_modules/core-js/internals/to-property-key.js","webpack://websitre/./node_modules/core-js/internals/to-string-tag-support.js","webpack://websitre/./node_modules/core-js/internals/to-string.js","webpack://websitre/./node_modules/core-js/internals/try-to-string.js","webpack://websitre/./node_modules/core-js/internals/uid.js","webpack://websitre/./node_modules/core-js/internals/use-symbol-as-uid.js","webpack://websitre/./node_modules/core-js/internals/v8-prototype-define-bug.js","webpack://websitre/./node_modules/core-js/internals/weak-map-basic-detection.js","webpack://websitre/./node_modules/core-js/internals/well-known-symbol.js","webpack://websitre/./node_modules/core-js/modules/es.array.push.js","webpack://websitre/./node_modules/core-js/modules/web.dom-exception.stack.js","webpack://websitre/./node_modules/idb/build/wrap-idb-value.js","webpack://websitre/./node_modules/idb/build/index.js","webpack://websitre/../../src/platformLoggerService.ts","webpack://websitre/../../src/logger.ts","webpack://websitre/../../src/constants.ts","webpack://websitre/../../src/internal.ts","webpack://websitre/../../src/errors.ts","webpack://websitre/../../src/firebaseApp.ts","webpack://websitre/../../src/api.ts","webpack://websitre/../../src/indexeddb.ts","webpack://websitre/../../src/heartbeatService.ts","webpack://websitre/../../src/registerCoreComponents.ts","webpack://websitre/../../src/index.ts","webpack://websitre/../../src/component.ts","webpack://websitre/../../src/provider.ts","webpack://websitre/../../src/component_container.ts","webpack://websitre/../../index.ts","webpack://websitre/../src/core/version.ts","webpack://websitre/../src/core/storage/DOMStorageWrapper.ts","webpack://websitre/../src/core/storage/MemoryStorage.ts","webpack://websitre/../src/core/storage/storage.ts","webpack://websitre/../src/core/util/util.ts","webpack://websitre/../src/core/AppCheckTokenProvider.ts","webpack://websitre/../src/core/AuthTokenProvider.ts","webpack://websitre/../src/realtime/Constants.ts","webpack://websitre/../src/core/RepoInfo.ts","webpack://websitre/../src/core/stats/StatsCollection.ts","webpack://websitre/../src/core/stats/StatsManager.ts","webpack://websitre/../src/realtime/polling/PacketReceiver.ts","webpack://websitre/../src/realtime/BrowserPollConnection.ts","webpack://websitre/../src/realtime/WebSocketConnection.ts","webpack://websitre/../src/realtime/TransportManager.ts","webpack://websitre/../src/realtime/Connection.ts","webpack://websitre/../src/core/ServerActions.ts","webpack://websitre/../src/core/util/EventEmitter.ts","webpack://websitre/../src/core/util/OnlineMonitor.ts","webpack://websitre/../src/core/util/Path.ts","webpack://websitre/../src/core/util/VisibilityMonitor.ts","webpack://websitre/../src/core/PersistentConnection.ts","webpack://websitre/../src/core/snap/Node.ts","webpack://websitre/../src/core/snap/indexes/Index.ts","webpack://websitre/../src/core/snap/indexes/KeyIndex.ts","webpack://websitre/../src/core/util/SortedMap.ts","webpack://websitre/../src/core/snap/comparators.ts","webpack://websitre/../src/core/snap/snap.ts","webpack://websitre/../src/core/snap/LeafNode.ts","webpack://websitre/../src/core/snap/indexes/PriorityIndex.ts","webpack://websitre/../src/core/snap/childSet.ts","webpack://websitre/../src/core/snap/IndexMap.ts","webpack://websitre/../src/core/snap/ChildrenNode.ts","webpack://websitre/../src/core/snap/nodeFromJSON.ts","webpack://websitre/../src/core/snap/indexes/PathIndex.ts","webpack://websitre/../src/core/snap/indexes/ValueIndex.ts","webpack://websitre/../src/core/view/Change.ts","webpack://websitre/../src/core/view/filter/IndexedFilter.ts","webpack://websitre/../src/core/view/filter/RangedFilter.ts","webpack://websitre/../src/core/view/filter/LimitedFilter.ts","webpack://websitre/../src/core/view/QueryParams.ts","webpack://websitre/../src/core/ReadonlyRestClient.ts","webpack://websitre/../src/core/SnapshotHolder.ts","webpack://websitre/../src/core/SparseSnapshotTree.ts","webpack://websitre/../src/core/stats/StatsListener.ts","webpack://websitre/../src/core/stats/StatsReporter.ts","webpack://websitre/../src/core/operation/Operation.ts","webpack://websitre/../src/core/operation/AckUserWrite.ts","webpack://websitre/../src/core/operation/ListenComplete.ts","webpack://websitre/../src/core/operation/Overwrite.ts","webpack://websitre/../src/core/operation/Merge.ts","webpack://websitre/../src/core/view/CacheNode.ts","webpack://websitre/../src/core/view/EventGenerator.ts","webpack://websitre/../src/core/view/ViewCache.ts","webpack://websitre/../src/core/util/ImmutableTree.ts","webpack://websitre/../src/core/CompoundWrite.ts","webpack://websitre/../src/core/WriteTree.ts","webpack://websitre/../src/core/view/ChildChangeAccumulator.ts","webpack://websitre/../src/core/view/CompleteChildSource.ts","webpack://websitre/../src/core/view/ViewProcessor.ts","webpack://websitre/../src/core/view/View.ts","webpack://websitre/../src/core/SyncPoint.ts","webpack://websitre/../src/core/SyncTree.ts","webpack://websitre/../src/core/util/ServerValues.ts","webpack://websitre/../src/core/util/Tree.ts","webpack://websitre/../src/core/util/validation.ts","webpack://websitre/../src/core/view/EventQueue.ts","webpack://websitre/../src/core/Repo.ts","webpack://websitre/../src/core/util/libs/parser.ts","webpack://websitre/../src/core/util/NextPushId.ts","webpack://websitre/../src/core/view/Event.ts","webpack://websitre/../src/core/view/EventRegistration.ts","webpack://websitre/../src/api/Reference_impl.ts","webpack://websitre/../src/api/Database.ts","webpack://websitre/../src/register.ts","webpack://websitre/../src/api/test_access.ts","webpack://websitre/../src/index.ts","webpack://websitre/./node_modules/js-cookie/dist/js.cookie.mjs","webpack://websitre/./node_modules/vue-router/dist/vue-router.mjs"],"sourcesContent":["/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\n\nexport const CONSTANTS = {\n  /**\n   * @define {boolean} Whether this is the client Node.js SDK.\n   */\n  NODE_CLIENT: false,\n  /**\n   * @define {boolean} Whether this is the Admin Node.js SDK.\n   */\n  NODE_ADMIN: false,\n\n  /**\n   * Firebase SDK Version\n   */\n  SDK_VERSION: '${JSCORE_VERSION}'\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\n\n/**\n * Throws an error if the provided assertion is falsy\n */\nexport const assert = function (assertion: unknown, message: string): void {\n  if (!assertion) {\n    throw assertionError(message);\n  }\n};\n\n/**\n * Returns an Error object suitable for throwing.\n */\nexport const assertionError = function (message: string): Error {\n  return new Error(\n    'Firebase Database (' +\n      CONSTANTS.SDK_VERSION +\n      ') INTERNAL ASSERT FAILED: ' +\n      message\n  );\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nconst stringToByteArray = function (str: string): number[] {\n  // TODO(user): Use native implementations if/when available\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (\n      (c & 0xfc00) === 0xd800 &&\n      i + 1 < str.length &&\n      (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00\n    ) {\n      // Surrogate Pair\n      c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param bytes Array of numbers representing characters.\n * @return Stringification of the array.\n */\nconst byteArrayToString = function (bytes: number[]): string {\n  // TODO(user): Use native implementations if/when available\n  const out: string[] = [];\n  let pos = 0,\n    c = 0;\n  while (pos < bytes.length) {\n    const c1 = bytes[pos++];\n    if (c1 < 128) {\n      out[c++] = String.fromCharCode(c1);\n    } else if (c1 > 191 && c1 < 224) {\n      const c2 = bytes[pos++];\n      out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n    } else if (c1 > 239 && c1 < 365) {\n      // Surrogate Pair\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      const c4 = bytes[pos++];\n      const u =\n        (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\n        0x10000;\n      out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n      out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n    } else {\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      out[c++] = String.fromCharCode(\n        ((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)\n      );\n    }\n  }\n  return out.join('');\n};\n\ninterface Base64 {\n  byteToCharMap_: { [key: number]: string } | null;\n  charToByteMap_: { [key: string]: number } | null;\n  byteToCharMapWebSafe_: { [key: number]: string } | null;\n  charToByteMapWebSafe_: { [key: string]: number } | null;\n  ENCODED_VALS_BASE: string;\n  readonly ENCODED_VALS: string;\n  readonly ENCODED_VALS_WEBSAFE: string;\n  HAS_NATIVE_SUPPORT: boolean;\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string;\n  encodeString(input: string, webSafe?: boolean): string;\n  decodeString(input: string, webSafe: boolean): string;\n  decodeStringToByteArray(input: string, webSafe: boolean): number[];\n  init_(): void;\n}\n\n// We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\nexport const base64: Base64 = {\n  /**\n   * Maps bytes to characters.\n   */\n  byteToCharMap_: null,\n\n  /**\n   * Maps characters to bytes.\n   */\n  charToByteMap_: null,\n\n  /**\n   * Maps bytes to websafe characters.\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n\n  /**\n   * Maps websafe characters to bytes.\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   */\n  ENCODED_VALS_BASE:\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n  /**\n   * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n   */\n  get ENCODED_VALS() {\n    return this.ENCODED_VALS_BASE + '+/=';\n  },\n\n  /**\n   * Our websafe alphabet.\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\n  },\n\n  /**\n   * Whether this browser supports the atob and btoa functions. This extension\n   * started at Mozilla but is now implemented by many browsers. We use the\n   * ASSUME_* variables to avoid pulling in the full useragent detection library\n   * but still allowing the standard per-browser compilations.\n   *\n   */\n  HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n  /**\n   * Base64-encode an array of bytes.\n   *\n   * @param input An array of bytes (numbers with\n   *     value in [0, 255]) to encode.\n   * @param webSafe Boolean indicating we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n\n    this.init_();\n\n    const byteToCharMap = webSafe\n      ? this.byteToCharMapWebSafe_!\n      : this.byteToCharMap_!;\n\n    const output = [];\n\n    for (let i = 0; i < input.length; i += 3) {\n      const byte1 = input[i];\n      const haveByte2 = i + 1 < input.length;\n      const byte2 = haveByte2 ? input[i + 1] : 0;\n      const haveByte3 = i + 2 < input.length;\n      const byte3 = haveByte3 ? input[i + 2] : 0;\n\n      const outByte1 = byte1 >> 2;\n      const outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n      let outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n      let outByte4 = byte3 & 0x3f;\n\n      if (!haveByte3) {\n        outByte4 = 64;\n\n        if (!haveByte2) {\n          outByte3 = 64;\n        }\n      }\n\n      output.push(\n        byteToCharMap[outByte1],\n        byteToCharMap[outByte2],\n        byteToCharMap[outByte3],\n        byteToCharMap[outByte4]\n      );\n    }\n\n    return output.join('');\n  },\n\n  /**\n   * Base64-encode a string.\n   *\n   * @param input A string to encode.\n   * @param webSafe If true, we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeString(input: string, webSafe?: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return btoa(input);\n    }\n    return this.encodeByteArray(stringToByteArray(input), webSafe);\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * @param input to decode.\n   * @param webSafe True if we should use the\n   *     alternative alphabet.\n   * @return string representing the decoded value.\n   */\n  decodeString(input: string, webSafe: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return atob(input);\n    }\n    return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * In base-64 decoding, groups of four characters are converted into three\n   * bytes.  If the encoder did not apply padding, the input length may not\n   * be a multiple of 4.\n   *\n   * In this case, the last group will have fewer than 4 characters, and\n   * padding will be inferred.  If the group has one or two characters, it decodes\n   * to one byte.  If the group has three characters, it decodes to two bytes.\n   *\n   * @param input Input to decode.\n   * @param webSafe True if we should use the web-safe alphabet.\n   * @return bytes representing the decoded value.\n   */\n  decodeStringToByteArray(input: string, webSafe: boolean): number[] {\n    this.init_();\n\n    const charToByteMap = webSafe\n      ? this.charToByteMapWebSafe_!\n      : this.charToByteMap_!;\n\n    const output: number[] = [];\n\n    for (let i = 0; i < input.length; ) {\n      const byte1 = charToByteMap[input.charAt(i++)];\n\n      const haveByte2 = i < input.length;\n      const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n\n      const haveByte3 = i < input.length;\n      const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      const haveByte4 = i < input.length;\n      const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n        throw new DecodeBase64StringError();\n      }\n\n      const outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 !== 64) {\n        const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 !== 64) {\n          const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n        this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n        this.charToByteMap_[this.byteToCharMap_[i]] = i;\n        this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n        this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n        // Be forgiving when decoding and correctly decode both encodings.\n        if (i >= this.ENCODED_VALS_BASE.length) {\n          this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n          this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n        }\n      }\n    }\n  }\n};\n\n/**\n * An error encountered while decoding base64 string.\n */\nexport class DecodeBase64StringError extends Error {\n  readonly name = 'DecodeBase64StringError';\n}\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 encoding (without \".\" padding in the end).\n * e.g. Used in JSON Web Token (JWT) parts.\n */\nexport const base64urlEncodeWithoutPadding = function (str: string): string {\n  // Use base64url encoding and remove padding in the end (dot characters).\n  return base64Encode(str).replace(/\\./g, '');\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function (str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nexport function deepCopy<T>(value: T): T {\n  return deepExtend(undefined, value) as T;\n}\n\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays).  Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n *\n * Note: we don't merge __proto__ to prevent prototype pollution\n */\nexport function deepExtend(target: unknown, source: unknown): unknown {\n  if (!(source instanceof Object)) {\n    return source;\n  }\n\n  switch (source.constructor) {\n    case Date:\n      // Treat Dates like scalars; if the target date object had any child\n      // properties - they will be lost!\n      const dateValue = source as Date;\n      return new Date(dateValue.getTime());\n\n    case Object:\n      if (target === undefined) {\n        target = {};\n      }\n      break;\n    case Array:\n      // Always copy the array source and overwrite the target.\n      target = [];\n      break;\n\n    default:\n      // Not a plain Object - treat it as a scalar.\n      return source;\n  }\n\n  for (const prop in source) {\n    // use isValidKey to guard against prototype pollution. See https://snyk.io/vuln/SNYK-JS-LODASH-450202\n    if (!source.hasOwnProperty(prop) || !isValidKey(prop)) {\n      continue;\n    }\n    (target as Record<string, unknown>)[prop] = deepExtend(\n      (target as Record<string, unknown>)[prop],\n      (source as Record<string, unknown>)[prop]\n    );\n  }\n\n  return target;\n}\n\nfunction isValidKey(key: string): boolean {\n  return key !== '__proto__';\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Polyfill for `globalThis` object.\n * @returns the `globalThis` object for the given environment.\n * @public\n */\nexport function getGlobal(): typeof globalThis {\n  if (typeof self !== 'undefined') {\n    return self;\n  }\n  if (typeof window !== 'undefined') {\n    return window;\n  }\n  if (typeof global !== 'undefined') {\n    return global;\n  }\n  throw new Error('Unable to locate global object.');\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Decode } from './crypt';\nimport { getGlobal } from './global';\n\n/**\n * Keys for experimental properties on the `FirebaseDefaults` object.\n * @public\n */\nexport type ExperimentalKey = 'authTokenSyncURL' | 'authIdTokenMaxAge';\n\n/**\n * An object that can be injected into the environment as __FIREBASE_DEFAULTS__,\n * either as a property of globalThis, a shell environment variable, or a\n * cookie.\n *\n * This object can be used to automatically configure and initialize\n * a Firebase app as well as any emulators.\n *\n * @public\n */\nexport interface FirebaseDefaults {\n  config?: Record<string, string>;\n  emulatorHosts?: Record<string, string>;\n  _authTokenSyncURL?: string;\n  _authIdTokenMaxAge?: number;\n  /**\n   * Override Firebase's runtime environment detection and\n   * force the SDK to act as if it were in the specified environment.\n   */\n  forceEnvironment?: 'browser' | 'node';\n  [key: string]: unknown;\n}\n\ndeclare global {\n  // Need `var` for this to work.\n  // eslint-disable-next-line no-var\n  var __FIREBASE_DEFAULTS__: FirebaseDefaults | undefined;\n}\n\nconst getDefaultsFromGlobal = (): FirebaseDefaults | undefined =>\n  getGlobal().__FIREBASE_DEFAULTS__;\n\n/**\n * Attempt to read defaults from a JSON string provided to\n * process(.)env(.)__FIREBASE_DEFAULTS__ or a JSON file whose path is in\n * process(.)env(.)__FIREBASE_DEFAULTS_PATH__\n * The dots are in parens because certain compilers (Vite?) cannot\n * handle seeing that variable in comments.\n * See https://github.com/firebase/firebase-js-sdk/issues/6838\n */\nconst getDefaultsFromEnvVariable = (): FirebaseDefaults | undefined => {\n  if (typeof process === 'undefined' || typeof process.env === 'undefined') {\n    return;\n  }\n  const defaultsJsonString = process.env.__FIREBASE_DEFAULTS__;\n  if (defaultsJsonString) {\n    return JSON.parse(defaultsJsonString);\n  }\n};\n\nconst getDefaultsFromCookie = (): FirebaseDefaults | undefined => {\n  if (typeof document === 'undefined') {\n    return;\n  }\n  let match;\n  try {\n    match = document.cookie.match(/__FIREBASE_DEFAULTS__=([^;]+)/);\n  } catch (e) {\n    // Some environments such as Angular Universal SSR have a\n    // `document` object but error on accessing `document.cookie`.\n    return;\n  }\n  const decoded = match && base64Decode(match[1]);\n  return decoded && JSON.parse(decoded);\n};\n\n/**\n * Get the __FIREBASE_DEFAULTS__ object. It checks in order:\n * (1) if such an object exists as a property of `globalThis`\n * (2) if such an object was provided on a shell environment variable\n * (3) if such an object exists in a cookie\n * @public\n */\nexport const getDefaults = (): FirebaseDefaults | undefined => {\n  try {\n    return (\n      getDefaultsFromGlobal() ||\n      getDefaultsFromEnvVariable() ||\n      getDefaultsFromCookie()\n    );\n  } catch (e) {\n    /**\n     * Catch-all for being unable to get __FIREBASE_DEFAULTS__ due\n     * to any environment case we have not accounted for. Log to\n     * info instead of swallowing so we can find these unknown cases\n     * and add paths for them if needed.\n     */\n    console.info(`Unable to get __FIREBASE_DEFAULTS__ due to: ${e}`);\n    return;\n  }\n};\n\n/**\n * Returns emulator host stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a URL host formatted like `127.0.0.1:9999` or `[::1]:4000` if available\n * @public\n */\nexport const getDefaultEmulatorHost = (\n  productName: string\n): string | undefined => getDefaults()?.emulatorHosts?.[productName];\n\n/**\n * Returns emulator hostname and port stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a pair of hostname and port like `[\"::1\", 4000]` if available\n * @public\n */\nexport const getDefaultEmulatorHostnameAndPort = (\n  productName: string\n): [hostname: string, port: number] | undefined => {\n  const host = getDefaultEmulatorHost(productName);\n  if (!host) {\n    return undefined;\n  }\n  const separatorIndex = host.lastIndexOf(':'); // Finding the last since IPv6 addr also has colons.\n  if (separatorIndex <= 0 || separatorIndex + 1 === host.length) {\n    throw new Error(`Invalid host ${host} with no separate hostname and port!`);\n  }\n  // eslint-disable-next-line no-restricted-globals\n  const port = parseInt(host.substring(separatorIndex + 1), 10);\n  if (host[0] === '[') {\n    // Bracket-quoted `[ipv6addr]:port` => return \"ipv6addr\" (without brackets).\n    return [host.substring(1, separatorIndex - 1), port];\n  } else {\n    return [host.substring(0, separatorIndex), port];\n  }\n};\n\n/**\n * Returns Firebase app config stored in the __FIREBASE_DEFAULTS__ object.\n * @public\n */\nexport const getDefaultAppConfig = (): Record<string, string> | undefined =>\n  getDefaults()?.config;\n\n/**\n * Returns an experimental setting on the __FIREBASE_DEFAULTS__ object (properties\n * prefixed by \"_\")\n * @public\n */\nexport const getExperimentalSetting = <T extends ExperimentalKey>(\n  name: T\n): FirebaseDefaults[`_${T}`] =>\n  getDefaults()?.[`_${name}`] as FirebaseDefaults[`_${T}`];\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport class Deferred<R> {\n  promise: Promise<R>;\n  reject: (value?: unknown) => void = () => {};\n  resolve: (value?: unknown) => void = () => {};\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = resolve as (value?: unknown) => void;\n      this.reject = reject as (value?: unknown) => void;\n    });\n  }\n\n  /**\n   * Our API internals are not promisified and cannot because our callback APIs have subtle expectations around\n   * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n   * and returns a node-style callback which will resolve or reject the Deferred's promise.\n   */\n  wrapCallback(\n    callback?: (error?: unknown, value?: unknown) => void\n  ): (error: unknown, value?: unknown) => void {\n    return (error, value?) => {\n      if (error) {\n        this.reject(error);\n      } else {\n        this.resolve(value);\n      }\n      if (typeof callback === 'function') {\n        // Attaching noop handler just in case developer wasn't expecting\n        // promises\n        this.promise.catch(() => {});\n\n        // Some of our callbacks don't expect a value and our own tests\n        // assert that the parameter length is 1\n        if (callback.length === 1) {\n          callback(error);\n        } else {\n          callback(error, value);\n        }\n      }\n    };\n  }\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64urlEncodeWithoutPadding } from './crypt';\n\n// Firebase Auth tokens contain snake_case claims following the JWT standard / convention.\n/* eslint-disable camelcase */\n\nexport type FirebaseSignInProvider =\n  | 'custom'\n  | 'email'\n  | 'password'\n  | 'phone'\n  | 'anonymous'\n  | 'google.com'\n  | 'facebook.com'\n  | 'github.com'\n  | 'twitter.com'\n  | 'microsoft.com'\n  | 'apple.com';\n\ninterface FirebaseIdToken {\n  // Always set to https://securetoken.google.com/PROJECT_ID\n  iss: string;\n\n  // Always set to PROJECT_ID\n  aud: string;\n\n  // The user's unique ID\n  sub: string;\n\n  // The token issue time, in seconds since epoch\n  iat: number;\n\n  // The token expiry time, normally 'iat' + 3600\n  exp: number;\n\n  // The user's unique ID. Must be equal to 'sub'\n  user_id: string;\n\n  // The time the user authenticated, normally 'iat'\n  auth_time: number;\n\n  // The sign in provider, only set when the provider is 'anonymous'\n  provider_id?: 'anonymous';\n\n  // The user's primary email\n  email?: string;\n\n  // The user's email verification status\n  email_verified?: boolean;\n\n  // The user's primary phone number\n  phone_number?: string;\n\n  // The user's display name\n  name?: string;\n\n  // The user's profile photo URL\n  picture?: string;\n\n  // Information on all identities linked to this user\n  firebase: {\n    // The primary sign-in provider\n    sign_in_provider: FirebaseSignInProvider;\n\n    // A map of providers to the user's list of unique identifiers from\n    // each provider\n    identities?: { [provider in FirebaseSignInProvider]?: string[] };\n  };\n\n  // Custom claims set by the developer\n  [claim: string]: unknown;\n\n  uid?: never; // Try to catch a common mistake of \"uid\" (should be \"sub\" instead).\n}\n\nexport type EmulatorMockTokenOptions = ({ user_id: string } | { sub: string }) &\n  Partial<FirebaseIdToken>;\n\nexport function createMockUserToken(\n  token: EmulatorMockTokenOptions,\n  projectId?: string\n): string {\n  if (token.uid) {\n    throw new Error(\n      'The \"uid\" field is no longer supported by mockUserToken. Please use \"sub\" instead for Firebase Auth User ID.'\n    );\n  }\n  // Unsecured JWTs use \"none\" as the algorithm.\n  const header = {\n    alg: 'none',\n    type: 'JWT'\n  };\n\n  const project = projectId || 'demo-project';\n  const iat = token.iat || 0;\n  const sub = token.sub || token.user_id;\n  if (!sub) {\n    throw new Error(\"mockUserToken must contain 'sub' or 'user_id' field!\");\n  }\n\n  const payload: FirebaseIdToken = {\n    // Set all required fields to decent defaults\n    iss: `https://securetoken.google.com/${project}`,\n    aud: project,\n    iat,\n    exp: iat + 3600,\n    auth_time: iat,\n    sub,\n    user_id: sub,\n    firebase: {\n      sign_in_provider: 'custom',\n      identities: {}\n    },\n\n    // Override with user options\n    ...token\n  };\n\n  // Unsecured JWTs use the empty string as a signature.\n  const signature = '';\n  return [\n    base64urlEncodeWithoutPadding(JSON.stringify(header)),\n    base64urlEncodeWithoutPadding(JSON.stringify(payload)),\n    signature\n  ].join('.');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\nimport { getDefaults } from './defaults';\n\n/**\n * Type placeholder for `WorkerGlobalScope` from `webworker`\n */\ndeclare class WorkerGlobalScope {}\n\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return user agent string\n */\nexport function getUA(): string {\n  if (\n    typeof navigator !== 'undefined' &&\n    typeof navigator['userAgent'] === 'string'\n  ) {\n    return navigator['userAgent'];\n  } else {\n    return '';\n  }\n}\n\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap\n * in the Ripple emulator) nor Cordova `onDeviceReady`, which would normally\n * wait for a callback.\n */\nexport function isMobileCordova(): boolean {\n  return (\n    typeof window !== 'undefined' &&\n    // @ts-ignore Setting up an broadly applicable index signature for Window\n    // just to deal with this case would probably be a bad idea.\n    !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n    /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA())\n  );\n}\n\n/**\n * Detect Node.js.\n *\n * @return true if Node.js environment is detected or specified.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nexport function isNode(): boolean {\n  const forceEnvironment = getDefaults()?.forceEnvironment;\n  if (forceEnvironment === 'node') {\n    return true;\n  } else if (forceEnvironment === 'browser') {\n    return false;\n  }\n\n  try {\n    return (\n      Object.prototype.toString.call(global.process) === '[object process]'\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n/**\n * Detect Browser Environment.\n * Note: This will return true for certain test frameworks that are incompletely\n * mimicking a browser, and should not lead to assuming all browser APIs are\n * available.\n */\nexport function isBrowser(): boolean {\n  return typeof window !== 'undefined' || isWebWorker();\n}\n\n/**\n * Detect Web Worker context.\n */\nexport function isWebWorker(): boolean {\n  return (\n    typeof WorkerGlobalScope !== 'undefined' &&\n    typeof self !== 'undefined' &&\n    self instanceof WorkerGlobalScope\n  );\n}\n\n/**\n * Detect Cloudflare Worker context.\n */\nexport function isCloudflareWorker(): boolean {\n  return (\n    typeof navigator !== 'undefined' &&\n    navigator.userAgent === 'Cloudflare-Workers'\n  );\n}\n\n/**\n * Detect browser extensions (Chrome and Firefox at least).\n */\ninterface BrowserRuntime {\n  id?: unknown;\n}\ndeclare const chrome: { runtime?: BrowserRuntime };\ndeclare const browser: { runtime?: BrowserRuntime };\nexport function isBrowserExtension(): boolean {\n  const runtime =\n    typeof chrome === 'object'\n      ? chrome.runtime\n      : typeof browser === 'object'\n      ? browser.runtime\n      : undefined;\n  return typeof runtime === 'object' && runtime.id !== undefined;\n}\n\n/**\n * Detect React Native.\n *\n * @return true if ReactNative environment is detected.\n */\nexport function isReactNative(): boolean {\n  return (\n    typeof navigator === 'object' && navigator['product'] === 'ReactNative'\n  );\n}\n\n/** Detects Electron apps. */\nexport function isElectron(): boolean {\n  return getUA().indexOf('Electron/') >= 0;\n}\n\n/** Detects Internet Explorer. */\nexport function isIE(): boolean {\n  const ua = getUA();\n  return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n\n/** Detects Universal Windows Platform apps. */\nexport function isUWP(): boolean {\n  return getUA().indexOf('MSAppHost/') >= 0;\n}\n\n/**\n * Detect whether the current SDK build is the Node version.\n *\n * @return true if it's the Node SDK build.\n */\nexport function isNodeSdk(): boolean {\n  return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n\n/** Returns true if we are running in Safari. */\nexport function isSafari(): boolean {\n  return (\n    !isNode() &&\n    !!navigator.userAgent &&\n    navigator.userAgent.includes('Safari') &&\n    !navigator.userAgent.includes('Chrome')\n  );\n}\n\n/**\n * This method checks if indexedDB is supported by current browser/service worker context\n * @return true if indexedDB is supported by current browser/service worker context\n */\nexport function isIndexedDBAvailable(): boolean {\n  try {\n    return typeof indexedDB === 'object';\n  } catch (e) {\n    return false;\n  }\n}\n\n/**\n * This method validates browser/sw context for indexedDB by opening a dummy indexedDB database and reject\n * if errors occur during the database open operation.\n *\n * @throws exception if current browser/sw context can't run idb.open (ex: Safari iframe, Firefox\n * private browsing)\n */\nexport function validateIndexedDBOpenable(): Promise<boolean> {\n  return new Promise((resolve, reject) => {\n    try {\n      let preExist: boolean = true;\n      const DB_CHECK_NAME =\n        'validate-browser-context-for-indexeddb-analytics-module';\n      const request = self.indexedDB.open(DB_CHECK_NAME);\n      request.onsuccess = () => {\n        request.result.close();\n        // delete database only when it doesn't pre-exist\n        if (!preExist) {\n          self.indexedDB.deleteDatabase(DB_CHECK_NAME);\n        }\n        resolve(true);\n      };\n      request.onupgradeneeded = () => {\n        preExist = false;\n      };\n\n      request.onerror = () => {\n        reject(request.error?.message || '');\n      };\n    } catch (error) {\n      reject(error);\n    }\n  });\n}\n\n/**\n *\n * This method checks whether cookie is enabled within current browser\n * @return true if cookie is enabled within current browser\n */\nexport function areCookiesEnabled(): boolean {\n  if (typeof navigator === 'undefined' || !navigator.cookieEnabled) {\n    return false;\n  }\n  return true;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @fileoverview Standardized Firebase Error.\n *\n * Usage:\n *\n *   // TypeScript string literals for type-safe codes\n *   type Err =\n *     'unknown' |\n *     'object-not-found'\n *     ;\n *\n *   // Closure enum for type-safe error codes\n *   // at-enum {string}\n *   var Err = {\n *     UNKNOWN: 'unknown',\n *     OBJECT_NOT_FOUND: 'object-not-found',\n *   }\n *\n *   let errors: Map<Err, string> = {\n *     'generic-error': \"Unknown error\",\n *     'file-not-found': \"Could not find file: {$file}\",\n *   };\n *\n *   // Type-safe function - must pass a valid error code as param.\n *   let error = new ErrorFactory<Err>('service', 'Service', errors);\n *\n *   ...\n *   throw error.create(Err.GENERIC);\n *   ...\n *   throw error.create(Err.FILE_NOT_FOUND, {'file': fileName});\n *   ...\n *   // Service: Could not file file: foo.txt (service/file-not-found).\n *\n *   catch (e) {\n *     assert(e.message === \"Could not find file: foo.txt.\");\n *     if ((e as FirebaseError)?.code === 'service/file-not-found') {\n *       console.log(\"Could not read file: \" + e['file']);\n *     }\n *   }\n */\n\nexport type ErrorMap<ErrorCode extends string> = {\n  readonly [K in ErrorCode]: string;\n};\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n  toString(): string;\n}\n\nexport interface ErrorData {\n  [key: string]: unknown;\n}\n\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nexport class FirebaseError extends Error {\n  /** The custom name for all FirebaseErrors. */\n  readonly name: string = ERROR_NAME;\n\n  constructor(\n    /** The error code for this error. */\n    readonly code: string,\n    message: string,\n    /** Custom data for this error. */\n    public customData?: Record<string, unknown>\n  ) {\n    super(message);\n\n    // Fix For ES5\n    // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n    Object.setPrototypeOf(this, FirebaseError.prototype);\n\n    // Maintains proper stack trace for where our error was thrown.\n    // Only available on V8.\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, ErrorFactory.prototype.create);\n    }\n  }\n}\n\nexport class ErrorFactory<\n  ErrorCode extends string,\n  ErrorParams extends { readonly [K in ErrorCode]?: ErrorData } = {}\n> {\n  constructor(\n    private readonly service: string,\n    private readonly serviceName: string,\n    private readonly errors: ErrorMap<ErrorCode>\n  ) {}\n\n  create<K extends ErrorCode>(\n    code: K,\n    ...data: K extends keyof ErrorParams ? [ErrorParams[K]] : []\n  ): FirebaseError {\n    const customData = (data[0] as ErrorData) || {};\n    const fullCode = `${this.service}/${code}`;\n    const template = this.errors[code];\n\n    const message = template ? replaceTemplate(template, customData) : 'Error';\n    // Service Name: Error message (service/code).\n    const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n\n    const error = new FirebaseError(fullCode, fullMessage, customData);\n\n    return error;\n  }\n}\n\nfunction replaceTemplate(template: string, data: ErrorData): string {\n  return template.replace(PATTERN, (_, key) => {\n    const value = data[key];\n    return value != null ? String(value) : `<${key}?>`;\n  });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nexport function jsonEval(str: string): unknown {\n  return JSON.parse(str);\n}\n\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data JavaScript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nexport function stringify(data: unknown): string {\n  return JSON.stringify(data);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Decode } from './crypt';\nimport { jsonEval } from './json';\n\ninterface Claims {\n  [key: string]: {};\n}\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const decode = function (token: string): DecodedToken {\n  let header = {},\n    claims: Claims = {},\n    data = {},\n    signature = '';\n\n  try {\n    const parts = token.split('.');\n    header = jsonEval(base64Decode(parts[0]) || '') as object;\n    claims = jsonEval(base64Decode(parts[1]) || '') as Claims;\n    signature = parts[2];\n    data = claims['d'] || {};\n    delete claims['d'];\n  } catch (e) {}\n\n  return {\n    header,\n    claims,\n    data,\n    signature\n  };\n};\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidTimestamp = function (token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  const now: number = Math.floor(new Date().getTime() / 1000);\n  let validSince: number = 0,\n    validUntil: number = 0;\n\n  if (typeof claims === 'object') {\n    if (claims.hasOwnProperty('nbf')) {\n      validSince = claims['nbf'] as number;\n    } else if (claims.hasOwnProperty('iat')) {\n      validSince = claims['iat'] as number;\n    }\n\n    if (claims.hasOwnProperty('exp')) {\n      validUntil = claims['exp'] as number;\n    } else {\n      // token will expire after 24h by default\n      validUntil = validSince + 86400;\n    }\n  }\n\n  return (\n    !!now &&\n    !!validSince &&\n    !!validUntil &&\n    now >= validSince &&\n    now <= validUntil\n  );\n};\n\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const issuedAtTime = function (token: string): number | null {\n  const claims: Claims = decode(token).claims;\n  if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n    return claims['iat'] as number;\n  }\n  return null;\n};\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidFormat = function (token: string): boolean {\n  const decoded = decode(token),\n    claims = decoded.claims;\n\n  return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\n};\n\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isAdmin = function (token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  return typeof claims === 'object' && claims['admin'] === true;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function contains<T extends object>(obj: T, key: string): boolean {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexport function safeGet<T extends object, K extends keyof T>(\n  obj: T,\n  key: K\n): T[K] | undefined {\n  if (Object.prototype.hasOwnProperty.call(obj, key)) {\n    return obj[key];\n  } else {\n    return undefined;\n  }\n}\n\nexport function isEmpty(obj: object): obj is {} {\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function map<K extends string, V, U>(\n  obj: { [key in K]: V },\n  fn: (value: V, key: K, obj: { [key in K]: V }) => U,\n  contextObj?: unknown\n): { [key in K]: U } {\n  const res: Partial<{ [key in K]: U }> = {};\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      res[key] = fn.call(contextObj, obj[key], key, obj);\n    }\n  }\n  return res as { [key in K]: U };\n}\n\n/**\n * Deep equal two objects. Support Arrays and Objects.\n */\nexport function deepEqual(a: object, b: object): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  const aKeys = Object.keys(a);\n  const bKeys = Object.keys(b);\n  for (const k of aKeys) {\n    if (!bKeys.includes(k)) {\n      return false;\n    }\n\n    const aProp = (a as Record<string, unknown>)[k];\n    const bProp = (b as Record<string, unknown>)[k];\n    if (isObject(aProp) && isObject(bProp)) {\n      if (!deepEqual(aProp, bProp)) {\n        return false;\n      }\n    } else if (aProp !== bProp) {\n      return false;\n    }\n  }\n\n  for (const k of bKeys) {\n    if (!aKeys.includes(k)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isObject(thing: unknown): thing is object {\n  return thing !== null && typeof thing === 'object';\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a\n * params object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n */\nexport function querystring(querystringParams: {\n  [key: string]: string | number;\n}): string {\n  const params = [];\n  for (const [key, value] of Object.entries(querystringParams)) {\n    if (Array.isArray(value)) {\n      value.forEach(arrayVal => {\n        params.push(\n          encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal)\n        );\n      });\n    } else {\n      params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n    }\n  }\n  return params.length ? '&' + params.join('&') : '';\n}\n\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\n * (e.g. {arg: 'val', arg2: 'val2'})\n */\nexport function querystringDecode(querystring: string): Record<string, string> {\n  const obj: Record<string, string> = {};\n  const tokens = querystring.replace(/^\\?/, '').split('&');\n\n  tokens.forEach(token => {\n    if (token) {\n      const [key, value] = token.split('=');\n      obj[decodeURIComponent(key)] = decodeURIComponent(value);\n    }\n  });\n  return obj;\n}\n\n/**\n * Extract the query string part of a URL, including the leading question mark (if present).\n */\nexport function extractQuerystring(url: string): string {\n  const queryStart = url.indexOf('?');\n  if (!queryStart) {\n    return '';\n  }\n  const fragmentStart = url.indexOf('#', queryStart);\n  return url.substring(\n    queryStart,\n    fragmentStart > 0 ? fragmentStart : undefined\n  );\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n *   var sha1 = new sha1();\n *   sha1.update(bytes);\n *   var hash = sha1.digest();\n *\n * Performance:\n *   Chrome 23:   ~400 Mbit/s\n *   Firefox 16:  ~250 Mbit/s\n *\n */\n\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @final\n * @struct\n */\nexport class Sha1 {\n  /**\n   * Holds the previous values of accumulated variables a-e in the compress_\n   * function.\n   * @private\n   */\n  private chain_: number[] = [];\n\n  /**\n   * A buffer holding the partially computed hash result.\n   * @private\n   */\n  private buf_: number[] = [];\n\n  /**\n   * An array of 80 bytes, each a part of the message to be hashed.  Referred to\n   * as the message schedule in the docs.\n   * @private\n   */\n  private W_: number[] = [];\n\n  /**\n   * Contains data needed to pad messages less than 64 bytes.\n   * @private\n   */\n  private pad_: number[] = [];\n\n  /**\n   * @private {number}\n   */\n  private inbuf_: number = 0;\n\n  /**\n   * @private {number}\n   */\n  private total_: number = 0;\n\n  blockSize: number;\n\n  constructor() {\n    this.blockSize = 512 / 8;\n\n    this.pad_[0] = 128;\n    for (let i = 1; i < this.blockSize; ++i) {\n      this.pad_[i] = 0;\n    }\n\n    this.reset();\n  }\n\n  reset(): void {\n    this.chain_[0] = 0x67452301;\n    this.chain_[1] = 0xefcdab89;\n    this.chain_[2] = 0x98badcfe;\n    this.chain_[3] = 0x10325476;\n    this.chain_[4] = 0xc3d2e1f0;\n\n    this.inbuf_ = 0;\n    this.total_ = 0;\n  }\n\n  /**\n   * Internal compress helper function.\n   * @param buf Block to compress.\n   * @param offset Offset of the block in the buffer.\n   * @private\n   */\n  compress_(buf: number[] | Uint8Array | string, offset?: number): void {\n    if (!offset) {\n      offset = 0;\n    }\n\n    const W = this.W_;\n\n    // get 16 big endian words\n    if (typeof buf === 'string') {\n      for (let i = 0; i < 16; i++) {\n        // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n        // have a bug that turns the post-increment ++ operator into pre-increment\n        // during JIT compilation.  We have code that depends heavily on SHA-1 for\n        // correctness and which is affected by this bug, so I've removed all uses\n        // of post-increment ++ in which the result value is used.  We can revert\n        // this change once the Safari bug\n        // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n        // most clients have been updated.\n        W[i] =\n          (buf.charCodeAt(offset) << 24) |\n          (buf.charCodeAt(offset + 1) << 16) |\n          (buf.charCodeAt(offset + 2) << 8) |\n          buf.charCodeAt(offset + 3);\n        offset += 4;\n      }\n    } else {\n      for (let i = 0; i < 16; i++) {\n        W[i] =\n          (buf[offset] << 24) |\n          (buf[offset + 1] << 16) |\n          (buf[offset + 2] << 8) |\n          buf[offset + 3];\n        offset += 4;\n      }\n    }\n\n    // expand to 80 words\n    for (let i = 16; i < 80; i++) {\n      const t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n      W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n    }\n\n    let a = this.chain_[0];\n    let b = this.chain_[1];\n    let c = this.chain_[2];\n    let d = this.chain_[3];\n    let e = this.chain_[4];\n    let f, k;\n\n    // TODO(user): Try to unroll this loop to speed up the computation.\n    for (let i = 0; i < 80; i++) {\n      if (i < 40) {\n        if (i < 20) {\n          f = d ^ (b & (c ^ d));\n          k = 0x5a827999;\n        } else {\n          f = b ^ c ^ d;\n          k = 0x6ed9eba1;\n        }\n      } else {\n        if (i < 60) {\n          f = (b & c) | (d & (b | c));\n          k = 0x8f1bbcdc;\n        } else {\n          f = b ^ c ^ d;\n          k = 0xca62c1d6;\n        }\n      }\n\n      const t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\n      e = d;\n      d = c;\n      c = ((b << 30) | (b >>> 2)) & 0xffffffff;\n      b = a;\n      a = t;\n    }\n\n    this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\n    this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\n    this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\n    this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\n    this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\n  }\n\n  update(bytes?: number[] | Uint8Array | string, length?: number): void {\n    // TODO(johnlenz): tighten the function signature and remove this check\n    if (bytes == null) {\n      return;\n    }\n\n    if (length === undefined) {\n      length = bytes.length;\n    }\n\n    const lengthMinusBlock = length - this.blockSize;\n    let n = 0;\n    // Using local instead of member variables gives ~5% speedup on Firefox 16.\n    const buf = this.buf_;\n    let inbuf = this.inbuf_;\n\n    // The outer while loop should execute at most twice.\n    while (n < length) {\n      // When we have no data in the block to top up, we can directly process the\n      // input buffer (assuming it contains sufficient data). This gives ~25%\n      // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n      // the data is provided in large chunks (or in multiples of 64 bytes).\n      if (inbuf === 0) {\n        while (n <= lengthMinusBlock) {\n          this.compress_(bytes, n);\n          n += this.blockSize;\n        }\n      }\n\n      if (typeof bytes === 'string') {\n        while (n < length) {\n          buf[inbuf] = bytes.charCodeAt(n);\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      } else {\n        while (n < length) {\n          buf[inbuf] = bytes[n];\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      }\n    }\n\n    this.inbuf_ = inbuf;\n    this.total_ += length;\n  }\n\n  /** @override */\n  digest(): number[] {\n    const digest: number[] = [];\n    let totalBits = this.total_ * 8;\n\n    // Add pad 0x80 0x00*.\n    if (this.inbuf_ < 56) {\n      this.update(this.pad_, 56 - this.inbuf_);\n    } else {\n      this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n    }\n\n    // Add # bits.\n    for (let i = this.blockSize - 1; i >= 56; i--) {\n      this.buf_[i] = totalBits & 255;\n      totalBits /= 256; // Don't use bit-shifting here!\n    }\n\n    this.compress_(this.buf_);\n\n    let n = 0;\n    for (let i = 0; i < 5; i++) {\n      for (let j = 24; j >= 0; j -= 8) {\n        digest[n] = (this.chain_[i] >> j) & 255;\n        ++n;\n      }\n    }\n    return digest;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param fnName The function name\n * @param minCount The minimum number of arguments to allow for the function call\n * @param maxCount The maximum number of argument to allow for the function call\n * @param argCount The actual number of arguments provided.\n */\nexport const validateArgCount = function (\n  fnName: string,\n  minCount: number,\n  maxCount: number,\n  argCount: number\n): void {\n  let argError;\n  if (argCount < minCount) {\n    argError = 'at least ' + minCount;\n  } else if (argCount > maxCount) {\n    argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n  }\n  if (argError) {\n    const error =\n      fnName +\n      ' failed: Was called with ' +\n      argCount +\n      (argCount === 1 ? ' argument.' : ' arguments.') +\n      ' Expects ' +\n      argError +\n      '.';\n    throw new Error(error);\n  }\n};\n\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param fnName The function name\n * @param argName The name of the argument\n * @return The prefix to add to the error thrown for validation.\n */\nexport function errorPrefix(fnName: string, argName: string): string {\n  return `${fnName} failed: ${argName} argument `;\n}\n\n/**\n * @param fnName\n * @param argumentNumber\n * @param namespace\n * @param optional\n */\nexport function validateNamespace(\n  fnName: string,\n  namespace: string,\n  optional: boolean\n): void {\n  if (optional && !namespace) {\n    return;\n  }\n  if (typeof namespace !== 'string') {\n    //TODO: I should do more validation here. We only allow certain chars in namespaces.\n    throw new Error(\n      errorPrefix(fnName, 'namespace') + 'must be a valid firebase namespace.'\n    );\n  }\n}\n\nexport function validateCallback(\n  fnName: string,\n  argumentName: string,\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  callback: Function,\n  optional: boolean\n): void {\n  if (optional && !callback) {\n    return;\n  }\n  if (typeof callback !== 'function') {\n    throw new Error(\n      errorPrefix(fnName, argumentName) + 'must be a valid function.'\n    );\n  }\n}\n\nexport function validateContextObject(\n  fnName: string,\n  argumentName: string,\n  context: unknown,\n  optional: boolean\n): void {\n  if (optional && !context) {\n    return;\n  }\n  if (typeof context !== 'object' || context === null) {\n    throw new Error(\n      errorPrefix(fnName, argumentName) + 'must be a valid context object.'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from './assert';\n\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in JavaScript.  All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n\n/**\n * @param {string} str\n * @return {Array}\n */\nexport const stringToByteArray = function (str: string): number[] {\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n\n    // Is this the lead surrogate in a surrogate pair?\n    if (c >= 0xd800 && c <= 0xdbff) {\n      const high = c - 0xd800; // the high 10 bits.\n      i++;\n      assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n      const low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n      c = 0x10000 + (high << 10) + low;\n    }\n\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (c < 65536) {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexport const stringLength = function (str: string): number {\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    const c = str.charCodeAt(i);\n    if (c < 128) {\n      p++;\n    } else if (c < 2048) {\n      p += 2;\n    } else if (c >= 0xd800 && c <= 0xdbff) {\n      // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\n      p += 4;\n      i++; // skip trail surrogate.\n    } else {\n      p += 3;\n    }\n  }\n  return p;\n};\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface Compat<T> {\n  _delegate: T;\n}\n\nexport function getModularInstance<ExpService>(\n  service: Compat<ExpService> | ExpService\n): ExpService {\n  if (service && (service as Compat<ExpService>)._delegate) {\n    return (service as Compat<ExpService>)._delegate;\n  } else {\n    return service as ExpService;\n  }\n}\n","/**\n* @vue/reactivity v3.4.15\n* (c) 2018-present Yuxi (Evan) You and Vue contributors\n* @license MIT\n**/\nimport { NOOP, extend, isArray, isSymbol, isMap, isIntegerKey, hasOwn, hasChanged, isObject, makeMap, capitalize, toRawType, def, isFunction } from '@vue/shared';\n\nfunction warn(msg, ...args) {\n  console.warn(`[Vue warn] ${msg}`, ...args);\n}\n\nlet activeEffectScope;\nclass EffectScope {\n  constructor(detached = false) {\n    this.detached = detached;\n    /**\n     * @internal\n     */\n    this._active = true;\n    /**\n     * @internal\n     */\n    this.effects = [];\n    /**\n     * @internal\n     */\n    this.cleanups = [];\n    this.parent = activeEffectScope;\n    if (!detached && activeEffectScope) {\n      this.index = (activeEffectScope.scopes || (activeEffectScope.scopes = [])).push(\n        this\n      ) - 1;\n    }\n  }\n  get active() {\n    return this._active;\n  }\n  run(fn) {\n    if (this._active) {\n      const currentEffectScope = activeEffectScope;\n      try {\n        activeEffectScope = this;\n        return fn();\n      } finally {\n        activeEffectScope = currentEffectScope;\n      }\n    } else if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn(`cannot run an inactive effect scope.`);\n    }\n  }\n  /**\n   * This should only be called on non-detached scopes\n   * @internal\n   */\n  on() {\n    activeEffectScope = this;\n  }\n  /**\n   * This should only be called on non-detached scopes\n   * @internal\n   */\n  off() {\n    activeEffectScope = this.parent;\n  }\n  stop(fromParent) {\n    if (this._active) {\n      let i, l;\n      for (i = 0, l = this.effects.length; i < l; i++) {\n        this.effects[i].stop();\n      }\n      for (i = 0, l = this.cleanups.length; i < l; i++) {\n        this.cleanups[i]();\n      }\n      if (this.scopes) {\n        for (i = 0, l = this.scopes.length; i < l; i++) {\n          this.scopes[i].stop(true);\n        }\n      }\n      if (!this.detached && this.parent && !fromParent) {\n        const last = this.parent.scopes.pop();\n        if (last && last !== this) {\n          this.parent.scopes[this.index] = last;\n          last.index = this.index;\n        }\n      }\n      this.parent = void 0;\n      this._active = false;\n    }\n  }\n}\nfunction effectScope(detached) {\n  return new EffectScope(detached);\n}\nfunction recordEffectScope(effect, scope = activeEffectScope) {\n  if (scope && scope.active) {\n    scope.effects.push(effect);\n  }\n}\nfunction getCurrentScope() {\n  return activeEffectScope;\n}\nfunction onScopeDispose(fn) {\n  if (activeEffectScope) {\n    activeEffectScope.cleanups.push(fn);\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    warn(\n      `onScopeDispose() is called when there is no active effect scope to be associated with.`\n    );\n  }\n}\n\nlet activeEffect;\nclass ReactiveEffect {\n  constructor(fn, trigger, scheduler, scope) {\n    this.fn = fn;\n    this.trigger = trigger;\n    this.scheduler = scheduler;\n    this.active = true;\n    this.deps = [];\n    /**\n     * @internal\n     */\n    this._dirtyLevel = 2;\n    /**\n     * @internal\n     */\n    this._trackId = 0;\n    /**\n     * @internal\n     */\n    this._runnings = 0;\n    /**\n     * @internal\n     */\n    this._shouldSchedule = false;\n    /**\n     * @internal\n     */\n    this._depsLength = 0;\n    recordEffectScope(this, scope);\n  }\n  get dirty() {\n    if (this._dirtyLevel === 1) {\n      pauseTracking();\n      for (let i = 0; i < this._depsLength; i++) {\n        const dep = this.deps[i];\n        if (dep.computed) {\n          triggerComputed(dep.computed);\n          if (this._dirtyLevel >= 2) {\n            break;\n          }\n        }\n      }\n      if (this._dirtyLevel < 2) {\n        this._dirtyLevel = 0;\n      }\n      resetTracking();\n    }\n    return this._dirtyLevel >= 2;\n  }\n  set dirty(v) {\n    this._dirtyLevel = v ? 2 : 0;\n  }\n  run() {\n    this._dirtyLevel = 0;\n    if (!this.active) {\n      return this.fn();\n    }\n    let lastShouldTrack = shouldTrack;\n    let lastEffect = activeEffect;\n    try {\n      shouldTrack = true;\n      activeEffect = this;\n      this._runnings++;\n      preCleanupEffect(this);\n      return this.fn();\n    } finally {\n      postCleanupEffect(this);\n      this._runnings--;\n      activeEffect = lastEffect;\n      shouldTrack = lastShouldTrack;\n    }\n  }\n  stop() {\n    var _a;\n    if (this.active) {\n      preCleanupEffect(this);\n      postCleanupEffect(this);\n      (_a = this.onStop) == null ? void 0 : _a.call(this);\n      this.active = false;\n    }\n  }\n}\nfunction triggerComputed(computed) {\n  return computed.value;\n}\nfunction preCleanupEffect(effect2) {\n  effect2._trackId++;\n  effect2._depsLength = 0;\n}\nfunction postCleanupEffect(effect2) {\n  if (effect2.deps && effect2.deps.length > effect2._depsLength) {\n    for (let i = effect2._depsLength; i < effect2.deps.length; i++) {\n      cleanupDepEffect(effect2.deps[i], effect2);\n    }\n    effect2.deps.length = effect2._depsLength;\n  }\n}\nfunction cleanupDepEffect(dep, effect2) {\n  const trackId = dep.get(effect2);\n  if (trackId !== void 0 && effect2._trackId !== trackId) {\n    dep.delete(effect2);\n    if (dep.size === 0) {\n      dep.cleanup();\n    }\n  }\n}\nfunction effect(fn, options) {\n  if (fn.effect instanceof ReactiveEffect) {\n    fn = fn.effect.fn;\n  }\n  const _effect = new ReactiveEffect(fn, NOOP, () => {\n    if (_effect.dirty) {\n      _effect.run();\n    }\n  });\n  if (options) {\n    extend(_effect, options);\n    if (options.scope)\n      recordEffectScope(_effect, options.scope);\n  }\n  if (!options || !options.lazy) {\n    _effect.run();\n  }\n  const runner = _effect.run.bind(_effect);\n  runner.effect = _effect;\n  return runner;\n}\nfunction stop(runner) {\n  runner.effect.stop();\n}\nlet shouldTrack = true;\nlet pauseScheduleStack = 0;\nconst trackStack = [];\nfunction pauseTracking() {\n  trackStack.push(shouldTrack);\n  shouldTrack = false;\n}\nfunction enableTracking() {\n  trackStack.push(shouldTrack);\n  shouldTrack = true;\n}\nfunction resetTracking() {\n  const last = trackStack.pop();\n  shouldTrack = last === void 0 ? true : last;\n}\nfunction pauseScheduling() {\n  pauseScheduleStack++;\n}\nfunction resetScheduling() {\n  pauseScheduleStack--;\n  while (!pauseScheduleStack && queueEffectSchedulers.length) {\n    queueEffectSchedulers.shift()();\n  }\n}\nfunction trackEffect(effect2, dep, debuggerEventExtraInfo) {\n  var _a;\n  if (dep.get(effect2) !== effect2._trackId) {\n    dep.set(effect2, effect2._trackId);\n    const oldDep = effect2.deps[effect2._depsLength];\n    if (oldDep !== dep) {\n      if (oldDep) {\n        cleanupDepEffect(oldDep, effect2);\n      }\n      effect2.deps[effect2._depsLength++] = dep;\n    } else {\n      effect2._depsLength++;\n    }\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      (_a = effect2.onTrack) == null ? void 0 : _a.call(effect2, extend({ effect: effect2 }, debuggerEventExtraInfo));\n    }\n  }\n}\nconst queueEffectSchedulers = [];\nfunction triggerEffects(dep, dirtyLevel, debuggerEventExtraInfo) {\n  var _a;\n  pauseScheduling();\n  for (const effect2 of dep.keys()) {\n    if (effect2._dirtyLevel < dirtyLevel && dep.get(effect2) === effect2._trackId) {\n      const lastDirtyLevel = effect2._dirtyLevel;\n      effect2._dirtyLevel = dirtyLevel;\n      if (lastDirtyLevel === 0) {\n        effect2._shouldSchedule = true;\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          (_a = effect2.onTrigger) == null ? void 0 : _a.call(effect2, extend({ effect: effect2 }, debuggerEventExtraInfo));\n        }\n        effect2.trigger();\n      }\n    }\n  }\n  scheduleEffects(dep);\n  resetScheduling();\n}\nfunction scheduleEffects(dep) {\n  for (const effect2 of dep.keys()) {\n    if (effect2.scheduler && effect2._shouldSchedule && (!effect2._runnings || effect2.allowRecurse) && dep.get(effect2) === effect2._trackId) {\n      effect2._shouldSchedule = false;\n      queueEffectSchedulers.push(effect2.scheduler);\n    }\n  }\n}\n\nconst createDep = (cleanup, computed) => {\n  const dep = /* @__PURE__ */ new Map();\n  dep.cleanup = cleanup;\n  dep.computed = computed;\n  return dep;\n};\n\nconst targetMap = /* @__PURE__ */ new WeakMap();\nconst ITERATE_KEY = Symbol(!!(process.env.NODE_ENV !== \"production\") ? \"iterate\" : \"\");\nconst MAP_KEY_ITERATE_KEY = Symbol(!!(process.env.NODE_ENV !== \"production\") ? \"Map key iterate\" : \"\");\nfunction track(target, type, key) {\n  if (shouldTrack && activeEffect) {\n    let depsMap = targetMap.get(target);\n    if (!depsMap) {\n      targetMap.set(target, depsMap = /* @__PURE__ */ new Map());\n    }\n    let dep = depsMap.get(key);\n    if (!dep) {\n      depsMap.set(key, dep = createDep(() => depsMap.delete(key)));\n    }\n    trackEffect(\n      activeEffect,\n      dep,\n      !!(process.env.NODE_ENV !== \"production\") ? {\n        target,\n        type,\n        key\n      } : void 0\n    );\n  }\n}\nfunction trigger(target, type, key, newValue, oldValue, oldTarget) {\n  const depsMap = targetMap.get(target);\n  if (!depsMap) {\n    return;\n  }\n  let deps = [];\n  if (type === \"clear\") {\n    deps = [...depsMap.values()];\n  } else if (key === \"length\" && isArray(target)) {\n    const newLength = Number(newValue);\n    depsMap.forEach((dep, key2) => {\n      if (key2 === \"length\" || !isSymbol(key2) && key2 >= newLength) {\n        deps.push(dep);\n      }\n    });\n  } else {\n    if (key !== void 0) {\n      deps.push(depsMap.get(key));\n    }\n    switch (type) {\n      case \"add\":\n        if (!isArray(target)) {\n          deps.push(depsMap.get(ITERATE_KEY));\n          if (isMap(target)) {\n            deps.push(depsMap.get(MAP_KEY_ITERATE_KEY));\n          }\n        } else if (isIntegerKey(key)) {\n          deps.push(depsMap.get(\"length\"));\n        }\n        break;\n      case \"delete\":\n        if (!isArray(target)) {\n          deps.push(depsMap.get(ITERATE_KEY));\n          if (isMap(target)) {\n            deps.push(depsMap.get(MAP_KEY_ITERATE_KEY));\n          }\n        }\n        break;\n      case \"set\":\n        if (isMap(target)) {\n          deps.push(depsMap.get(ITERATE_KEY));\n        }\n        break;\n    }\n  }\n  pauseScheduling();\n  for (const dep of deps) {\n    if (dep) {\n      triggerEffects(\n        dep,\n        2,\n        !!(process.env.NODE_ENV !== \"production\") ? {\n          target,\n          type,\n          key,\n          newValue,\n          oldValue,\n          oldTarget\n        } : void 0\n      );\n    }\n  }\n  resetScheduling();\n}\nfunction getDepFromReactive(object, key) {\n  var _a;\n  return (_a = targetMap.get(object)) == null ? void 0 : _a.get(key);\n}\n\nconst isNonTrackableKeys = /* @__PURE__ */ makeMap(`__proto__,__v_isRef,__isVue`);\nconst builtInSymbols = new Set(\n  /* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((key) => key !== \"arguments\" && key !== \"caller\").map((key) => Symbol[key]).filter(isSymbol)\n);\nconst arrayInstrumentations = /* @__PURE__ */ createArrayInstrumentations();\nfunction createArrayInstrumentations() {\n  const instrumentations = {};\n  [\"includes\", \"indexOf\", \"lastIndexOf\"].forEach((key) => {\n    instrumentations[key] = function(...args) {\n      const arr = toRaw(this);\n      for (let i = 0, l = this.length; i < l; i++) {\n        track(arr, \"get\", i + \"\");\n      }\n      const res = arr[key](...args);\n      if (res === -1 || res === false) {\n        return arr[key](...args.map(toRaw));\n      } else {\n        return res;\n      }\n    };\n  });\n  [\"push\", \"pop\", \"shift\", \"unshift\", \"splice\"].forEach((key) => {\n    instrumentations[key] = function(...args) {\n      pauseTracking();\n      pauseScheduling();\n      const res = toRaw(this)[key].apply(this, args);\n      resetScheduling();\n      resetTracking();\n      return res;\n    };\n  });\n  return instrumentations;\n}\nfunction hasOwnProperty(key) {\n  const obj = toRaw(this);\n  track(obj, \"has\", key);\n  return obj.hasOwnProperty(key);\n}\nclass BaseReactiveHandler {\n  constructor(_isReadonly = false, _shallow = false) {\n    this._isReadonly = _isReadonly;\n    this._shallow = _shallow;\n  }\n  get(target, key, receiver) {\n    const isReadonly2 = this._isReadonly, shallow = this._shallow;\n    if (key === \"__v_isReactive\") {\n      return !isReadonly2;\n    } else if (key === \"__v_isReadonly\") {\n      return isReadonly2;\n    } else if (key === \"__v_isShallow\") {\n      return shallow;\n    } else if (key === \"__v_raw\") {\n      if (receiver === (isReadonly2 ? shallow ? shallowReadonlyMap : readonlyMap : shallow ? shallowReactiveMap : reactiveMap).get(target) || // receiver is not the reactive proxy, but has the same prototype\n      // this means the reciever is a user proxy of the reactive proxy\n      Object.getPrototypeOf(target) === Object.getPrototypeOf(receiver)) {\n        return target;\n      }\n      return;\n    }\n    const targetIsArray = isArray(target);\n    if (!isReadonly2) {\n      if (targetIsArray && hasOwn(arrayInstrumentations, key)) {\n        return Reflect.get(arrayInstrumentations, key, receiver);\n      }\n      if (key === \"hasOwnProperty\") {\n        return hasOwnProperty;\n      }\n    }\n    const res = Reflect.get(target, key, receiver);\n    if (isSymbol(key) ? builtInSymbols.has(key) : isNonTrackableKeys(key)) {\n      return res;\n    }\n    if (!isReadonly2) {\n      track(target, \"get\", key);\n    }\n    if (shallow) {\n      return res;\n    }\n    if (isRef(res)) {\n      return targetIsArray && isIntegerKey(key) ? res : res.value;\n    }\n    if (isObject(res)) {\n      return isReadonly2 ? readonly(res) : reactive(res);\n    }\n    return res;\n  }\n}\nclass MutableReactiveHandler extends BaseReactiveHandler {\n  constructor(shallow = false) {\n    super(false, shallow);\n  }\n  set(target, key, value, receiver) {\n    let oldValue = target[key];\n    if (!this._shallow) {\n      const isOldValueReadonly = isReadonly(oldValue);\n      if (!isShallow(value) && !isReadonly(value)) {\n        oldValue = toRaw(oldValue);\n        value = toRaw(value);\n      }\n      if (!isArray(target) && isRef(oldValue) && !isRef(value)) {\n        if (isOldValueReadonly) {\n          return false;\n        } else {\n          oldValue.value = value;\n          return true;\n        }\n      }\n    }\n    const hadKey = isArray(target) && isIntegerKey(key) ? Number(key) < target.length : hasOwn(target, key);\n    const result = Reflect.set(target, key, value, receiver);\n    if (target === toRaw(receiver)) {\n      if (!hadKey) {\n        trigger(target, \"add\", key, value);\n      } else if (hasChanged(value, oldValue)) {\n        trigger(target, \"set\", key, value, oldValue);\n      }\n    }\n    return result;\n  }\n  deleteProperty(target, key) {\n    const hadKey = hasOwn(target, key);\n    const oldValue = target[key];\n    const result = Reflect.deleteProperty(target, key);\n    if (result && hadKey) {\n      trigger(target, \"delete\", key, void 0, oldValue);\n    }\n    return result;\n  }\n  has(target, key) {\n    const result = Reflect.has(target, key);\n    if (!isSymbol(key) || !builtInSymbols.has(key)) {\n      track(target, \"has\", key);\n    }\n    return result;\n  }\n  ownKeys(target) {\n    track(\n      target,\n      \"iterate\",\n      isArray(target) ? \"length\" : ITERATE_KEY\n    );\n    return Reflect.ownKeys(target);\n  }\n}\nclass ReadonlyReactiveHandler extends BaseReactiveHandler {\n  constructor(shallow = false) {\n    super(true, shallow);\n  }\n  set(target, key) {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn(\n        `Set operation on key \"${String(key)}\" failed: target is readonly.`,\n        target\n      );\n    }\n    return true;\n  }\n  deleteProperty(target, key) {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn(\n        `Delete operation on key \"${String(key)}\" failed: target is readonly.`,\n        target\n      );\n    }\n    return true;\n  }\n}\nconst mutableHandlers = /* @__PURE__ */ new MutableReactiveHandler();\nconst readonlyHandlers = /* @__PURE__ */ new ReadonlyReactiveHandler();\nconst shallowReactiveHandlers = /* @__PURE__ */ new MutableReactiveHandler(\n  true\n);\nconst shallowReadonlyHandlers = /* @__PURE__ */ new ReadonlyReactiveHandler(true);\n\nconst toShallow = (value) => value;\nconst getProto = (v) => Reflect.getPrototypeOf(v);\nfunction get(target, key, isReadonly = false, isShallow = false) {\n  target = target[\"__v_raw\"];\n  const rawTarget = toRaw(target);\n  const rawKey = toRaw(key);\n  if (!isReadonly) {\n    if (hasChanged(key, rawKey)) {\n      track(rawTarget, \"get\", key);\n    }\n    track(rawTarget, \"get\", rawKey);\n  }\n  const { has: has2 } = getProto(rawTarget);\n  const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\n  if (has2.call(rawTarget, key)) {\n    return wrap(target.get(key));\n  } else if (has2.call(rawTarget, rawKey)) {\n    return wrap(target.get(rawKey));\n  } else if (target !== rawTarget) {\n    target.get(key);\n  }\n}\nfunction has(key, isReadonly = false) {\n  const target = this[\"__v_raw\"];\n  const rawTarget = toRaw(target);\n  const rawKey = toRaw(key);\n  if (!isReadonly) {\n    if (hasChanged(key, rawKey)) {\n      track(rawTarget, \"has\", key);\n    }\n    track(rawTarget, \"has\", rawKey);\n  }\n  return key === rawKey ? target.has(key) : target.has(key) || target.has(rawKey);\n}\nfunction size(target, isReadonly = false) {\n  target = target[\"__v_raw\"];\n  !isReadonly && track(toRaw(target), \"iterate\", ITERATE_KEY);\n  return Reflect.get(target, \"size\", target);\n}\nfunction add(value) {\n  value = toRaw(value);\n  const target = toRaw(this);\n  const proto = getProto(target);\n  const hadKey = proto.has.call(target, value);\n  if (!hadKey) {\n    target.add(value);\n    trigger(target, \"add\", value, value);\n  }\n  return this;\n}\nfunction set(key, value) {\n  value = toRaw(value);\n  const target = toRaw(this);\n  const { has: has2, get: get2 } = getProto(target);\n  let hadKey = has2.call(target, key);\n  if (!hadKey) {\n    key = toRaw(key);\n    hadKey = has2.call(target, key);\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    checkIdentityKeys(target, has2, key);\n  }\n  const oldValue = get2.call(target, key);\n  target.set(key, value);\n  if (!hadKey) {\n    trigger(target, \"add\", key, value);\n  } else if (hasChanged(value, oldValue)) {\n    trigger(target, \"set\", key, value, oldValue);\n  }\n  return this;\n}\nfunction deleteEntry(key) {\n  const target = toRaw(this);\n  const { has: has2, get: get2 } = getProto(target);\n  let hadKey = has2.call(target, key);\n  if (!hadKey) {\n    key = toRaw(key);\n    hadKey = has2.call(target, key);\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    checkIdentityKeys(target, has2, key);\n  }\n  const oldValue = get2 ? get2.call(target, key) : void 0;\n  const result = target.delete(key);\n  if (hadKey) {\n    trigger(target, \"delete\", key, void 0, oldValue);\n  }\n  return result;\n}\nfunction clear() {\n  const target = toRaw(this);\n  const hadItems = target.size !== 0;\n  const oldTarget = !!(process.env.NODE_ENV !== \"production\") ? isMap(target) ? new Map(target) : new Set(target) : void 0;\n  const result = target.clear();\n  if (hadItems) {\n    trigger(target, \"clear\", void 0, void 0, oldTarget);\n  }\n  return result;\n}\nfunction createForEach(isReadonly, isShallow) {\n  return function forEach(callback, thisArg) {\n    const observed = this;\n    const target = observed[\"__v_raw\"];\n    const rawTarget = toRaw(target);\n    const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\n    !isReadonly && track(rawTarget, \"iterate\", ITERATE_KEY);\n    return target.forEach((value, key) => {\n      return callback.call(thisArg, wrap(value), wrap(key), observed);\n    });\n  };\n}\nfunction createIterableMethod(method, isReadonly, isShallow) {\n  return function(...args) {\n    const target = this[\"__v_raw\"];\n    const rawTarget = toRaw(target);\n    const targetIsMap = isMap(rawTarget);\n    const isPair = method === \"entries\" || method === Symbol.iterator && targetIsMap;\n    const isKeyOnly = method === \"keys\" && targetIsMap;\n    const innerIterator = target[method](...args);\n    const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\n    !isReadonly && track(\n      rawTarget,\n      \"iterate\",\n      isKeyOnly ? MAP_KEY_ITERATE_KEY : ITERATE_KEY\n    );\n    return {\n      // iterator protocol\n      next() {\n        const { value, done } = innerIterator.next();\n        return done ? { value, done } : {\n          value: isPair ? [wrap(value[0]), wrap(value[1])] : wrap(value),\n          done\n        };\n      },\n      // iterable protocol\n      [Symbol.iterator]() {\n        return this;\n      }\n    };\n  };\n}\nfunction createReadonlyMethod(type) {\n  return function(...args) {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      const key = args[0] ? `on key \"${args[0]}\" ` : ``;\n      console.warn(\n        `${capitalize(type)} operation ${key}failed: target is readonly.`,\n        toRaw(this)\n      );\n    }\n    return type === \"delete\" ? false : type === \"clear\" ? void 0 : this;\n  };\n}\nfunction createInstrumentations() {\n  const mutableInstrumentations2 = {\n    get(key) {\n      return get(this, key);\n    },\n    get size() {\n      return size(this);\n    },\n    has,\n    add,\n    set,\n    delete: deleteEntry,\n    clear,\n    forEach: createForEach(false, false)\n  };\n  const shallowInstrumentations2 = {\n    get(key) {\n      return get(this, key, false, true);\n    },\n    get size() {\n      return size(this);\n    },\n    has,\n    add,\n    set,\n    delete: deleteEntry,\n    clear,\n    forEach: createForEach(false, true)\n  };\n  const readonlyInstrumentations2 = {\n    get(key) {\n      return get(this, key, true);\n    },\n    get size() {\n      return size(this, true);\n    },\n    has(key) {\n      return has.call(this, key, true);\n    },\n    add: createReadonlyMethod(\"add\"),\n    set: createReadonlyMethod(\"set\"),\n    delete: createReadonlyMethod(\"delete\"),\n    clear: createReadonlyMethod(\"clear\"),\n    forEach: createForEach(true, false)\n  };\n  const shallowReadonlyInstrumentations2 = {\n    get(key) {\n      return get(this, key, true, true);\n    },\n    get size() {\n      return size(this, true);\n    },\n    has(key) {\n      return has.call(this, key, true);\n    },\n    add: createReadonlyMethod(\"add\"),\n    set: createReadonlyMethod(\"set\"),\n    delete: createReadonlyMethod(\"delete\"),\n    clear: createReadonlyMethod(\"clear\"),\n    forEach: createForEach(true, true)\n  };\n  const iteratorMethods = [\"keys\", \"values\", \"entries\", Symbol.iterator];\n  iteratorMethods.forEach((method) => {\n    mutableInstrumentations2[method] = createIterableMethod(\n      method,\n      false,\n      false\n    );\n    readonlyInstrumentations2[method] = createIterableMethod(\n      method,\n      true,\n      false\n    );\n    shallowInstrumentations2[method] = createIterableMethod(\n      method,\n      false,\n      true\n    );\n    shallowReadonlyInstrumentations2[method] = createIterableMethod(\n      method,\n      true,\n      true\n    );\n  });\n  return [\n    mutableInstrumentations2,\n    readonlyInstrumentations2,\n    shallowInstrumentations2,\n    shallowReadonlyInstrumentations2\n  ];\n}\nconst [\n  mutableInstrumentations,\n  readonlyInstrumentations,\n  shallowInstrumentations,\n  shallowReadonlyInstrumentations\n] = /* @__PURE__ */ createInstrumentations();\nfunction createInstrumentationGetter(isReadonly, shallow) {\n  const instrumentations = shallow ? isReadonly ? shallowReadonlyInstrumentations : shallowInstrumentations : isReadonly ? readonlyInstrumentations : mutableInstrumentations;\n  return (target, key, receiver) => {\n    if (key === \"__v_isReactive\") {\n      return !isReadonly;\n    } else if (key === \"__v_isReadonly\") {\n      return isReadonly;\n    } else if (key === \"__v_raw\") {\n      return target;\n    }\n    return Reflect.get(\n      hasOwn(instrumentations, key) && key in target ? instrumentations : target,\n      key,\n      receiver\n    );\n  };\n}\nconst mutableCollectionHandlers = {\n  get: /* @__PURE__ */ createInstrumentationGetter(false, false)\n};\nconst shallowCollectionHandlers = {\n  get: /* @__PURE__ */ createInstrumentationGetter(false, true)\n};\nconst readonlyCollectionHandlers = {\n  get: /* @__PURE__ */ createInstrumentationGetter(true, false)\n};\nconst shallowReadonlyCollectionHandlers = {\n  get: /* @__PURE__ */ createInstrumentationGetter(true, true)\n};\nfunction checkIdentityKeys(target, has2, key) {\n  const rawKey = toRaw(key);\n  if (rawKey !== key && has2.call(target, rawKey)) {\n    const type = toRawType(target);\n    console.warn(\n      `Reactive ${type} contains both the raw and reactive versions of the same object${type === `Map` ? ` as keys` : ``}, which can lead to inconsistencies. Avoid differentiating between the raw and reactive versions of an object and only use the reactive version if possible.`\n    );\n  }\n}\n\nconst reactiveMap = /* @__PURE__ */ new WeakMap();\nconst shallowReactiveMap = /* @__PURE__ */ new WeakMap();\nconst readonlyMap = /* @__PURE__ */ new WeakMap();\nconst shallowReadonlyMap = /* @__PURE__ */ new WeakMap();\nfunction targetTypeMap(rawType) {\n  switch (rawType) {\n    case \"Object\":\n    case \"Array\":\n      return 1 /* COMMON */;\n    case \"Map\":\n    case \"Set\":\n    case \"WeakMap\":\n    case \"WeakSet\":\n      return 2 /* COLLECTION */;\n    default:\n      return 0 /* INVALID */;\n  }\n}\nfunction getTargetType(value) {\n  return value[\"__v_skip\"] || !Object.isExtensible(value) ? 0 /* INVALID */ : targetTypeMap(toRawType(value));\n}\nfunction reactive(target) {\n  if (isReadonly(target)) {\n    return target;\n  }\n  return createReactiveObject(\n    target,\n    false,\n    mutableHandlers,\n    mutableCollectionHandlers,\n    reactiveMap\n  );\n}\nfunction shallowReactive(target) {\n  return createReactiveObject(\n    target,\n    false,\n    shallowReactiveHandlers,\n    shallowCollectionHandlers,\n    shallowReactiveMap\n  );\n}\nfunction readonly(target) {\n  return createReactiveObject(\n    target,\n    true,\n    readonlyHandlers,\n    readonlyCollectionHandlers,\n    readonlyMap\n  );\n}\nfunction shallowReadonly(target) {\n  return createReactiveObject(\n    target,\n    true,\n    shallowReadonlyHandlers,\n    shallowReadonlyCollectionHandlers,\n    shallowReadonlyMap\n  );\n}\nfunction createReactiveObject(target, isReadonly2, baseHandlers, collectionHandlers, proxyMap) {\n  if (!isObject(target)) {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      console.warn(`value cannot be made reactive: ${String(target)}`);\n    }\n    return target;\n  }\n  if (target[\"__v_raw\"] && !(isReadonly2 && target[\"__v_isReactive\"])) {\n    return target;\n  }\n  const existingProxy = proxyMap.get(target);\n  if (existingProxy) {\n    return existingProxy;\n  }\n  const targetType = getTargetType(target);\n  if (targetType === 0 /* INVALID */) {\n    return target;\n  }\n  const proxy = new Proxy(\n    target,\n    targetType === 2 /* COLLECTION */ ? collectionHandlers : baseHandlers\n  );\n  proxyMap.set(target, proxy);\n  return proxy;\n}\nfunction isReactive(value) {\n  if (isReadonly(value)) {\n    return isReactive(value[\"__v_raw\"]);\n  }\n  return !!(value && value[\"__v_isReactive\"]);\n}\nfunction isReadonly(value) {\n  return !!(value && value[\"__v_isReadonly\"]);\n}\nfunction isShallow(value) {\n  return !!(value && value[\"__v_isShallow\"]);\n}\nfunction isProxy(value) {\n  return isReactive(value) || isReadonly(value);\n}\nfunction toRaw(observed) {\n  const raw = observed && observed[\"__v_raw\"];\n  return raw ? toRaw(raw) : observed;\n}\nfunction markRaw(value) {\n  def(value, \"__v_skip\", true);\n  return value;\n}\nconst toReactive = (value) => isObject(value) ? reactive(value) : value;\nconst toReadonly = (value) => isObject(value) ? readonly(value) : value;\n\nclass ComputedRefImpl {\n  constructor(getter, _setter, isReadonly, isSSR) {\n    this._setter = _setter;\n    this.dep = void 0;\n    this.__v_isRef = true;\n    this[\"__v_isReadonly\"] = false;\n    this.effect = new ReactiveEffect(\n      () => getter(this._value),\n      () => triggerRefValue(this, 1),\n      () => this.dep && scheduleEffects(this.dep)\n    );\n    this.effect.computed = this;\n    this.effect.active = this._cacheable = !isSSR;\n    this[\"__v_isReadonly\"] = isReadonly;\n  }\n  get value() {\n    const self = toRaw(this);\n    if (!self._cacheable || self.effect.dirty) {\n      if (hasChanged(self._value, self._value = self.effect.run())) {\n        triggerRefValue(self, 2);\n      }\n    }\n    trackRefValue(self);\n    if (self.effect._dirtyLevel >= 1) {\n      triggerRefValue(self, 1);\n    }\n    return self._value;\n  }\n  set value(newValue) {\n    this._setter(newValue);\n  }\n  // #region polyfill _dirty for backward compatibility third party code for Vue <= 3.3.x\n  get _dirty() {\n    return this.effect.dirty;\n  }\n  set _dirty(v) {\n    this.effect.dirty = v;\n  }\n  // #endregion\n}\nfunction computed(getterOrOptions, debugOptions, isSSR = false) {\n  let getter;\n  let setter;\n  const onlyGetter = isFunction(getterOrOptions);\n  if (onlyGetter) {\n    getter = getterOrOptions;\n    setter = !!(process.env.NODE_ENV !== \"production\") ? () => {\n      console.warn(\"Write operation failed: computed value is readonly\");\n    } : NOOP;\n  } else {\n    getter = getterOrOptions.get;\n    setter = getterOrOptions.set;\n  }\n  const cRef = new ComputedRefImpl(getter, setter, onlyGetter || !setter, isSSR);\n  if (!!(process.env.NODE_ENV !== \"production\") && debugOptions && !isSSR) {\n    cRef.effect.onTrack = debugOptions.onTrack;\n    cRef.effect.onTrigger = debugOptions.onTrigger;\n  }\n  return cRef;\n}\n\nfunction trackRefValue(ref2) {\n  if (shouldTrack && activeEffect) {\n    ref2 = toRaw(ref2);\n    trackEffect(\n      activeEffect,\n      ref2.dep || (ref2.dep = createDep(\n        () => ref2.dep = void 0,\n        ref2 instanceof ComputedRefImpl ? ref2 : void 0\n      )),\n      !!(process.env.NODE_ENV !== \"production\") ? {\n        target: ref2,\n        type: \"get\",\n        key: \"value\"\n      } : void 0\n    );\n  }\n}\nfunction triggerRefValue(ref2, dirtyLevel = 2, newVal) {\n  ref2 = toRaw(ref2);\n  const dep = ref2.dep;\n  if (dep) {\n    triggerEffects(\n      dep,\n      dirtyLevel,\n      !!(process.env.NODE_ENV !== \"production\") ? {\n        target: ref2,\n        type: \"set\",\n        key: \"value\",\n        newValue: newVal\n      } : void 0\n    );\n  }\n}\nfunction isRef(r) {\n  return !!(r && r.__v_isRef === true);\n}\nfunction ref(value) {\n  return createRef(value, false);\n}\nfunction shallowRef(value) {\n  return createRef(value, true);\n}\nfunction createRef(rawValue, shallow) {\n  if (isRef(rawValue)) {\n    return rawValue;\n  }\n  return new RefImpl(rawValue, shallow);\n}\nclass RefImpl {\n  constructor(value, __v_isShallow) {\n    this.__v_isShallow = __v_isShallow;\n    this.dep = void 0;\n    this.__v_isRef = true;\n    this._rawValue = __v_isShallow ? value : toRaw(value);\n    this._value = __v_isShallow ? value : toReactive(value);\n  }\n  get value() {\n    trackRefValue(this);\n    return this._value;\n  }\n  set value(newVal) {\n    const useDirectValue = this.__v_isShallow || isShallow(newVal) || isReadonly(newVal);\n    newVal = useDirectValue ? newVal : toRaw(newVal);\n    if (hasChanged(newVal, this._rawValue)) {\n      this._rawValue = newVal;\n      this._value = useDirectValue ? newVal : toReactive(newVal);\n      triggerRefValue(this, 2, newVal);\n    }\n  }\n}\nfunction triggerRef(ref2) {\n  triggerRefValue(ref2, 2, !!(process.env.NODE_ENV !== \"production\") ? ref2.value : void 0);\n}\nfunction unref(ref2) {\n  return isRef(ref2) ? ref2.value : ref2;\n}\nfunction toValue(source) {\n  return isFunction(source) ? source() : unref(source);\n}\nconst shallowUnwrapHandlers = {\n  get: (target, key, receiver) => unref(Reflect.get(target, key, receiver)),\n  set: (target, key, value, receiver) => {\n    const oldValue = target[key];\n    if (isRef(oldValue) && !isRef(value)) {\n      oldValue.value = value;\n      return true;\n    } else {\n      return Reflect.set(target, key, value, receiver);\n    }\n  }\n};\nfunction proxyRefs(objectWithRefs) {\n  return isReactive(objectWithRefs) ? objectWithRefs : new Proxy(objectWithRefs, shallowUnwrapHandlers);\n}\nclass CustomRefImpl {\n  constructor(factory) {\n    this.dep = void 0;\n    this.__v_isRef = true;\n    const { get, set } = factory(\n      () => trackRefValue(this),\n      () => triggerRefValue(this)\n    );\n    this._get = get;\n    this._set = set;\n  }\n  get value() {\n    return this._get();\n  }\n  set value(newVal) {\n    this._set(newVal);\n  }\n}\nfunction customRef(factory) {\n  return new CustomRefImpl(factory);\n}\nfunction toRefs(object) {\n  if (!!(process.env.NODE_ENV !== \"production\") && !isProxy(object)) {\n    console.warn(`toRefs() expects a reactive object but received a plain one.`);\n  }\n  const ret = isArray(object) ? new Array(object.length) : {};\n  for (const key in object) {\n    ret[key] = propertyToRef(object, key);\n  }\n  return ret;\n}\nclass ObjectRefImpl {\n  constructor(_object, _key, _defaultValue) {\n    this._object = _object;\n    this._key = _key;\n    this._defaultValue = _defaultValue;\n    this.__v_isRef = true;\n  }\n  get value() {\n    const val = this._object[this._key];\n    return val === void 0 ? this._defaultValue : val;\n  }\n  set value(newVal) {\n    this._object[this._key] = newVal;\n  }\n  get dep() {\n    return getDepFromReactive(toRaw(this._object), this._key);\n  }\n}\nclass GetterRefImpl {\n  constructor(_getter) {\n    this._getter = _getter;\n    this.__v_isRef = true;\n    this.__v_isReadonly = true;\n  }\n  get value() {\n    return this._getter();\n  }\n}\nfunction toRef(source, key, defaultValue) {\n  if (isRef(source)) {\n    return source;\n  } else if (isFunction(source)) {\n    return new GetterRefImpl(source);\n  } else if (isObject(source) && arguments.length > 1) {\n    return propertyToRef(source, key, defaultValue);\n  } else {\n    return ref(source);\n  }\n}\nfunction propertyToRef(source, key, defaultValue) {\n  const val = source[key];\n  return isRef(val) ? val : new ObjectRefImpl(source, key, defaultValue);\n}\n\nconst deferredComputed = computed;\n\nconst TrackOpTypes = {\n  \"GET\": \"get\",\n  \"HAS\": \"has\",\n  \"ITERATE\": \"iterate\"\n};\nconst TriggerOpTypes = {\n  \"SET\": \"set\",\n  \"ADD\": \"add\",\n  \"DELETE\": \"delete\",\n  \"CLEAR\": \"clear\"\n};\nconst ReactiveFlags = {\n  \"SKIP\": \"__v_skip\",\n  \"IS_REACTIVE\": \"__v_isReactive\",\n  \"IS_READONLY\": \"__v_isReadonly\",\n  \"IS_SHALLOW\": \"__v_isShallow\",\n  \"RAW\": \"__v_raw\"\n};\n\nexport { EffectScope, ITERATE_KEY, ReactiveEffect, ReactiveFlags, TrackOpTypes, TriggerOpTypes, computed, customRef, deferredComputed, effect, effectScope, enableTracking, getCurrentScope, isProxy, isReactive, isReadonly, isRef, isShallow, markRaw, onScopeDispose, pauseScheduling, pauseTracking, proxyRefs, reactive, readonly, ref, resetScheduling, resetTracking, shallowReactive, shallowReadonly, shallowRef, stop, toRaw, toRef, toRefs, toValue, track, trigger, triggerRef, unref };\n","/**\n* @vue/runtime-core v3.4.15\n* (c) 2018-present Yuxi (Evan) You and Vue contributors\n* @license MIT\n**/\nimport { pauseTracking, resetTracking, isRef, toRaw, isShallow as isShallow$1, isReactive, ReactiveEffect, getCurrentScope, ref, shallowReadonly, track, reactive, shallowReactive, trigger, isProxy, proxyRefs, markRaw, EffectScope, computed as computed$1, customRef, isReadonly } from '@vue/reactivity';\nexport { EffectScope, ReactiveEffect, TrackOpTypes, TriggerOpTypes, customRef, effect, effectScope, getCurrentScope, isProxy, isReactive, isReadonly, isRef, isShallow, markRaw, onScopeDispose, proxyRefs, reactive, readonly, ref, shallowReactive, shallowReadonly, shallowRef, stop, toRaw, toRef, toRefs, toValue, triggerRef, unref } from '@vue/reactivity';\nimport { isString, isFunction, isPromise, isArray, NOOP, getGlobalThis, extend, EMPTY_OBJ, toHandlerKey, looseToNumber, hyphenate, camelize, isObject, isOn, hasOwn, isModelListener, capitalize, toNumber, hasChanged, remove, isSet, isMap, isPlainObject, isBuiltInDirective, invokeArrayFns, isRegExp, isGloballyAllowed, NO, def, isReservedProp, EMPTY_ARR, toRawType, makeMap, normalizeClass, stringifyStyle, normalizeStyle, isKnownSvgAttr, isBooleanAttr, isKnownHtmlAttr, includeBooleanAttr, isRenderableAttrValue } from '@vue/shared';\nexport { camelize, capitalize, normalizeClass, normalizeProps, normalizeStyle, toDisplayString, toHandlerKey } from '@vue/shared';\n\nconst stack = [];\nfunction pushWarningContext(vnode) {\n  stack.push(vnode);\n}\nfunction popWarningContext() {\n  stack.pop();\n}\nfunction warn$1(msg, ...args) {\n  pauseTracking();\n  const instance = stack.length ? stack[stack.length - 1].component : null;\n  const appWarnHandler = instance && instance.appContext.config.warnHandler;\n  const trace = getComponentTrace();\n  if (appWarnHandler) {\n    callWithErrorHandling(\n      appWarnHandler,\n      instance,\n      11,\n      [\n        msg + args.join(\"\"),\n        instance && instance.proxy,\n        trace.map(\n          ({ vnode }) => `at <${formatComponentName(instance, vnode.type)}>`\n        ).join(\"\\n\"),\n        trace\n      ]\n    );\n  } else {\n    const warnArgs = [`[Vue warn]: ${msg}`, ...args];\n    if (trace.length && // avoid spamming console during tests\n    true) {\n      warnArgs.push(`\n`, ...formatTrace(trace));\n    }\n    console.warn(...warnArgs);\n  }\n  resetTracking();\n}\nfunction getComponentTrace() {\n  let currentVNode = stack[stack.length - 1];\n  if (!currentVNode) {\n    return [];\n  }\n  const normalizedStack = [];\n  while (currentVNode) {\n    const last = normalizedStack[0];\n    if (last && last.vnode === currentVNode) {\n      last.recurseCount++;\n    } else {\n      normalizedStack.push({\n        vnode: currentVNode,\n        recurseCount: 0\n      });\n    }\n    const parentInstance = currentVNode.component && currentVNode.component.parent;\n    currentVNode = parentInstance && parentInstance.vnode;\n  }\n  return normalizedStack;\n}\nfunction formatTrace(trace) {\n  const logs = [];\n  trace.forEach((entry, i) => {\n    logs.push(...i === 0 ? [] : [`\n`], ...formatTraceEntry(entry));\n  });\n  return logs;\n}\nfunction formatTraceEntry({ vnode, recurseCount }) {\n  const postfix = recurseCount > 0 ? `... (${recurseCount} recursive calls)` : ``;\n  const isRoot = vnode.component ? vnode.component.parent == null : false;\n  const open = ` at <${formatComponentName(\n    vnode.component,\n    vnode.type,\n    isRoot\n  )}`;\n  const close = `>` + postfix;\n  return vnode.props ? [open, ...formatProps(vnode.props), close] : [open + close];\n}\nfunction formatProps(props) {\n  const res = [];\n  const keys = Object.keys(props);\n  keys.slice(0, 3).forEach((key) => {\n    res.push(...formatProp(key, props[key]));\n  });\n  if (keys.length > 3) {\n    res.push(` ...`);\n  }\n  return res;\n}\nfunction formatProp(key, value, raw) {\n  if (isString(value)) {\n    value = JSON.stringify(value);\n    return raw ? value : [`${key}=${value}`];\n  } else if (typeof value === \"number\" || typeof value === \"boolean\" || value == null) {\n    return raw ? value : [`${key}=${value}`];\n  } else if (isRef(value)) {\n    value = formatProp(key, toRaw(value.value), true);\n    return raw ? value : [`${key}=Ref<`, value, `>`];\n  } else if (isFunction(value)) {\n    return [`${key}=fn${value.name ? `<${value.name}>` : ``}`];\n  } else {\n    value = toRaw(value);\n    return raw ? value : [`${key}=`, value];\n  }\n}\nfunction assertNumber(val, type) {\n  if (!!!(process.env.NODE_ENV !== \"production\"))\n    return;\n  if (val === void 0) {\n    return;\n  } else if (typeof val !== \"number\") {\n    warn$1(`${type} is not a valid number - got ${JSON.stringify(val)}.`);\n  } else if (isNaN(val)) {\n    warn$1(`${type} is NaN - the duration expression might be incorrect.`);\n  }\n}\n\nconst ErrorCodes = {\n  \"SETUP_FUNCTION\": 0,\n  \"0\": \"SETUP_FUNCTION\",\n  \"RENDER_FUNCTION\": 1,\n  \"1\": \"RENDER_FUNCTION\",\n  \"WATCH_GETTER\": 2,\n  \"2\": \"WATCH_GETTER\",\n  \"WATCH_CALLBACK\": 3,\n  \"3\": \"WATCH_CALLBACK\",\n  \"WATCH_CLEANUP\": 4,\n  \"4\": \"WATCH_CLEANUP\",\n  \"NATIVE_EVENT_HANDLER\": 5,\n  \"5\": \"NATIVE_EVENT_HANDLER\",\n  \"COMPONENT_EVENT_HANDLER\": 6,\n  \"6\": \"COMPONENT_EVENT_HANDLER\",\n  \"VNODE_HOOK\": 7,\n  \"7\": \"VNODE_HOOK\",\n  \"DIRECTIVE_HOOK\": 8,\n  \"8\": \"DIRECTIVE_HOOK\",\n  \"TRANSITION_HOOK\": 9,\n  \"9\": \"TRANSITION_HOOK\",\n  \"APP_ERROR_HANDLER\": 10,\n  \"10\": \"APP_ERROR_HANDLER\",\n  \"APP_WARN_HANDLER\": 11,\n  \"11\": \"APP_WARN_HANDLER\",\n  \"FUNCTION_REF\": 12,\n  \"12\": \"FUNCTION_REF\",\n  \"ASYNC_COMPONENT_LOADER\": 13,\n  \"13\": \"ASYNC_COMPONENT_LOADER\",\n  \"SCHEDULER\": 14,\n  \"14\": \"SCHEDULER\"\n};\nconst ErrorTypeStrings$1 = {\n  [\"sp\"]: \"serverPrefetch hook\",\n  [\"bc\"]: \"beforeCreate hook\",\n  [\"c\"]: \"created hook\",\n  [\"bm\"]: \"beforeMount hook\",\n  [\"m\"]: \"mounted hook\",\n  [\"bu\"]: \"beforeUpdate hook\",\n  [\"u\"]: \"updated\",\n  [\"bum\"]: \"beforeUnmount hook\",\n  [\"um\"]: \"unmounted hook\",\n  [\"a\"]: \"activated hook\",\n  [\"da\"]: \"deactivated hook\",\n  [\"ec\"]: \"errorCaptured hook\",\n  [\"rtc\"]: \"renderTracked hook\",\n  [\"rtg\"]: \"renderTriggered hook\",\n  [0]: \"setup function\",\n  [1]: \"render function\",\n  [2]: \"watcher getter\",\n  [3]: \"watcher callback\",\n  [4]: \"watcher cleanup function\",\n  [5]: \"native event handler\",\n  [6]: \"component event handler\",\n  [7]: \"vnode hook\",\n  [8]: \"directive hook\",\n  [9]: \"transition hook\",\n  [10]: \"app errorHandler\",\n  [11]: \"app warnHandler\",\n  [12]: \"ref function\",\n  [13]: \"async component loader\",\n  [14]: \"scheduler flush. This is likely a Vue internals bug. Please open an issue at https://github.com/vuejs/core .\"\n};\nfunction callWithErrorHandling(fn, instance, type, args) {\n  let res;\n  try {\n    res = args ? fn(...args) : fn();\n  } catch (err) {\n    handleError(err, instance, type);\n  }\n  return res;\n}\nfunction callWithAsyncErrorHandling(fn, instance, type, args) {\n  if (isFunction(fn)) {\n    const res = callWithErrorHandling(fn, instance, type, args);\n    if (res && isPromise(res)) {\n      res.catch((err) => {\n        handleError(err, instance, type);\n      });\n    }\n    return res;\n  }\n  const values = [];\n  for (let i = 0; i < fn.length; i++) {\n    values.push(callWithAsyncErrorHandling(fn[i], instance, type, args));\n  }\n  return values;\n}\nfunction handleError(err, instance, type, throwInDev = true) {\n  const contextVNode = instance ? instance.vnode : null;\n  if (instance) {\n    let cur = instance.parent;\n    const exposedInstance = instance.proxy;\n    const errorInfo = !!(process.env.NODE_ENV !== \"production\") ? ErrorTypeStrings$1[type] : `https://vuejs.org/error-reference/#runtime-${type}`;\n    while (cur) {\n      const errorCapturedHooks = cur.ec;\n      if (errorCapturedHooks) {\n        for (let i = 0; i < errorCapturedHooks.length; i++) {\n          if (errorCapturedHooks[i](err, exposedInstance, errorInfo) === false) {\n            return;\n          }\n        }\n      }\n      cur = cur.parent;\n    }\n    const appErrorHandler = instance.appContext.config.errorHandler;\n    if (appErrorHandler) {\n      callWithErrorHandling(\n        appErrorHandler,\n        null,\n        10,\n        [err, exposedInstance, errorInfo]\n      );\n      return;\n    }\n  }\n  logError(err, type, contextVNode, throwInDev);\n}\nfunction logError(err, type, contextVNode, throwInDev = true) {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    const info = ErrorTypeStrings$1[type];\n    if (contextVNode) {\n      pushWarningContext(contextVNode);\n    }\n    warn$1(`Unhandled error${info ? ` during execution of ${info}` : ``}`);\n    if (contextVNode) {\n      popWarningContext();\n    }\n    if (throwInDev) {\n      throw err;\n    } else {\n      console.error(err);\n    }\n  } else {\n    console.error(err);\n  }\n}\n\nlet isFlushing = false;\nlet isFlushPending = false;\nconst queue = [];\nlet flushIndex = 0;\nconst pendingPostFlushCbs = [];\nlet activePostFlushCbs = null;\nlet postFlushIndex = 0;\nconst resolvedPromise = /* @__PURE__ */ Promise.resolve();\nlet currentFlushPromise = null;\nconst RECURSION_LIMIT = 100;\nfunction nextTick(fn) {\n  const p = currentFlushPromise || resolvedPromise;\n  return fn ? p.then(this ? fn.bind(this) : fn) : p;\n}\nfunction findInsertionIndex(id) {\n  let start = flushIndex + 1;\n  let end = queue.length;\n  while (start < end) {\n    const middle = start + end >>> 1;\n    const middleJob = queue[middle];\n    const middleJobId = getId(middleJob);\n    if (middleJobId < id || middleJobId === id && middleJob.pre) {\n      start = middle + 1;\n    } else {\n      end = middle;\n    }\n  }\n  return start;\n}\nfunction queueJob(job) {\n  if (!queue.length || !queue.includes(\n    job,\n    isFlushing && job.allowRecurse ? flushIndex + 1 : flushIndex\n  )) {\n    if (job.id == null) {\n      queue.push(job);\n    } else {\n      queue.splice(findInsertionIndex(job.id), 0, job);\n    }\n    queueFlush();\n  }\n}\nfunction queueFlush() {\n  if (!isFlushing && !isFlushPending) {\n    isFlushPending = true;\n    currentFlushPromise = resolvedPromise.then(flushJobs);\n  }\n}\nfunction invalidateJob(job) {\n  const i = queue.indexOf(job);\n  if (i > flushIndex) {\n    queue.splice(i, 1);\n  }\n}\nfunction queuePostFlushCb(cb) {\n  if (!isArray(cb)) {\n    if (!activePostFlushCbs || !activePostFlushCbs.includes(\n      cb,\n      cb.allowRecurse ? postFlushIndex + 1 : postFlushIndex\n    )) {\n      pendingPostFlushCbs.push(cb);\n    }\n  } else {\n    pendingPostFlushCbs.push(...cb);\n  }\n  queueFlush();\n}\nfunction flushPreFlushCbs(instance, seen, i = isFlushing ? flushIndex + 1 : 0) {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    seen = seen || /* @__PURE__ */ new Map();\n  }\n  for (; i < queue.length; i++) {\n    const cb = queue[i];\n    if (cb && cb.pre) {\n      if (instance && cb.id !== instance.uid) {\n        continue;\n      }\n      if (!!(process.env.NODE_ENV !== \"production\") && checkRecursiveUpdates(seen, cb)) {\n        continue;\n      }\n      queue.splice(i, 1);\n      i--;\n      cb();\n    }\n  }\n}\nfunction flushPostFlushCbs(seen) {\n  if (pendingPostFlushCbs.length) {\n    const deduped = [...new Set(pendingPostFlushCbs)].sort(\n      (a, b) => getId(a) - getId(b)\n    );\n    pendingPostFlushCbs.length = 0;\n    if (activePostFlushCbs) {\n      activePostFlushCbs.push(...deduped);\n      return;\n    }\n    activePostFlushCbs = deduped;\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      seen = seen || /* @__PURE__ */ new Map();\n    }\n    for (postFlushIndex = 0; postFlushIndex < activePostFlushCbs.length; postFlushIndex++) {\n      if (!!(process.env.NODE_ENV !== \"production\") && checkRecursiveUpdates(seen, activePostFlushCbs[postFlushIndex])) {\n        continue;\n      }\n      activePostFlushCbs[postFlushIndex]();\n    }\n    activePostFlushCbs = null;\n    postFlushIndex = 0;\n  }\n}\nconst getId = (job) => job.id == null ? Infinity : job.id;\nconst comparator = (a, b) => {\n  const diff = getId(a) - getId(b);\n  if (diff === 0) {\n    if (a.pre && !b.pre)\n      return -1;\n    if (b.pre && !a.pre)\n      return 1;\n  }\n  return diff;\n};\nfunction flushJobs(seen) {\n  isFlushPending = false;\n  isFlushing = true;\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    seen = seen || /* @__PURE__ */ new Map();\n  }\n  queue.sort(comparator);\n  const check = !!(process.env.NODE_ENV !== \"production\") ? (job) => checkRecursiveUpdates(seen, job) : NOOP;\n  try {\n    for (flushIndex = 0; flushIndex < queue.length; flushIndex++) {\n      const job = queue[flushIndex];\n      if (job && job.active !== false) {\n        if (!!(process.env.NODE_ENV !== \"production\") && check(job)) {\n          continue;\n        }\n        callWithErrorHandling(job, null, 14);\n      }\n    }\n  } finally {\n    flushIndex = 0;\n    queue.length = 0;\n    flushPostFlushCbs(seen);\n    isFlushing = false;\n    currentFlushPromise = null;\n    if (queue.length || pendingPostFlushCbs.length) {\n      flushJobs(seen);\n    }\n  }\n}\nfunction checkRecursiveUpdates(seen, fn) {\n  if (!seen.has(fn)) {\n    seen.set(fn, 1);\n  } else {\n    const count = seen.get(fn);\n    if (count > RECURSION_LIMIT) {\n      const instance = fn.ownerInstance;\n      const componentName = instance && getComponentName(instance.type);\n      handleError(\n        `Maximum recursive updates exceeded${componentName ? ` in component <${componentName}>` : ``}. This means you have a reactive effect that is mutating its own dependencies and thus recursively triggering itself. Possible sources include component template, render function, updated hook or watcher source function.`,\n        null,\n        10\n      );\n      return true;\n    } else {\n      seen.set(fn, count + 1);\n    }\n  }\n}\n\nlet isHmrUpdating = false;\nconst hmrDirtyComponents = /* @__PURE__ */ new Set();\nif (!!(process.env.NODE_ENV !== \"production\")) {\n  getGlobalThis().__VUE_HMR_RUNTIME__ = {\n    createRecord: tryWrap(createRecord),\n    rerender: tryWrap(rerender),\n    reload: tryWrap(reload)\n  };\n}\nconst map = /* @__PURE__ */ new Map();\nfunction registerHMR(instance) {\n  const id = instance.type.__hmrId;\n  let record = map.get(id);\n  if (!record) {\n    createRecord(id, instance.type);\n    record = map.get(id);\n  }\n  record.instances.add(instance);\n}\nfunction unregisterHMR(instance) {\n  map.get(instance.type.__hmrId).instances.delete(instance);\n}\nfunction createRecord(id, initialDef) {\n  if (map.has(id)) {\n    return false;\n  }\n  map.set(id, {\n    initialDef: normalizeClassComponent(initialDef),\n    instances: /* @__PURE__ */ new Set()\n  });\n  return true;\n}\nfunction normalizeClassComponent(component) {\n  return isClassComponent(component) ? component.__vccOpts : component;\n}\nfunction rerender(id, newRender) {\n  const record = map.get(id);\n  if (!record) {\n    return;\n  }\n  record.initialDef.render = newRender;\n  [...record.instances].forEach((instance) => {\n    if (newRender) {\n      instance.render = newRender;\n      normalizeClassComponent(instance.type).render = newRender;\n    }\n    instance.renderCache = [];\n    isHmrUpdating = true;\n    instance.effect.dirty = true;\n    instance.update();\n    isHmrUpdating = false;\n  });\n}\nfunction reload(id, newComp) {\n  const record = map.get(id);\n  if (!record)\n    return;\n  newComp = normalizeClassComponent(newComp);\n  updateComponentDef(record.initialDef, newComp);\n  const instances = [...record.instances];\n  for (const instance of instances) {\n    const oldComp = normalizeClassComponent(instance.type);\n    if (!hmrDirtyComponents.has(oldComp)) {\n      if (oldComp !== record.initialDef) {\n        updateComponentDef(oldComp, newComp);\n      }\n      hmrDirtyComponents.add(oldComp);\n    }\n    instance.appContext.propsCache.delete(instance.type);\n    instance.appContext.emitsCache.delete(instance.type);\n    instance.appContext.optionsCache.delete(instance.type);\n    if (instance.ceReload) {\n      hmrDirtyComponents.add(oldComp);\n      instance.ceReload(newComp.styles);\n      hmrDirtyComponents.delete(oldComp);\n    } else if (instance.parent) {\n      instance.parent.effect.dirty = true;\n      queueJob(instance.parent.update);\n    } else if (instance.appContext.reload) {\n      instance.appContext.reload();\n    } else if (typeof window !== \"undefined\") {\n      window.location.reload();\n    } else {\n      console.warn(\n        \"[HMR] Root or manually mounted instance modified. Full reload required.\"\n      );\n    }\n  }\n  queuePostFlushCb(() => {\n    for (const instance of instances) {\n      hmrDirtyComponents.delete(\n        normalizeClassComponent(instance.type)\n      );\n    }\n  });\n}\nfunction updateComponentDef(oldComp, newComp) {\n  extend(oldComp, newComp);\n  for (const key in oldComp) {\n    if (key !== \"__file\" && !(key in newComp)) {\n      delete oldComp[key];\n    }\n  }\n}\nfunction tryWrap(fn) {\n  return (id, arg) => {\n    try {\n      return fn(id, arg);\n    } catch (e) {\n      console.error(e);\n      console.warn(\n        `[HMR] Something went wrong during Vue component hot-reload. Full reload required.`\n      );\n    }\n  };\n}\n\nlet devtools$1;\nlet buffer = [];\nlet devtoolsNotInstalled = false;\nfunction emit$1(event, ...args) {\n  if (devtools$1) {\n    devtools$1.emit(event, ...args);\n  } else if (!devtoolsNotInstalled) {\n    buffer.push({ event, args });\n  }\n}\nfunction setDevtoolsHook$1(hook, target) {\n  var _a, _b;\n  devtools$1 = hook;\n  if (devtools$1) {\n    devtools$1.enabled = true;\n    buffer.forEach(({ event, args }) => devtools$1.emit(event, ...args));\n    buffer = [];\n  } else if (\n    // handle late devtools injection - only do this if we are in an actual\n    // browser environment to avoid the timer handle stalling test runner exit\n    // (#4815)\n    typeof window !== \"undefined\" && // some envs mock window but not fully\n    window.HTMLElement && // also exclude jsdom\n    !((_b = (_a = window.navigator) == null ? void 0 : _a.userAgent) == null ? void 0 : _b.includes(\"jsdom\"))\n  ) {\n    const replay = target.__VUE_DEVTOOLS_HOOK_REPLAY__ = target.__VUE_DEVTOOLS_HOOK_REPLAY__ || [];\n    replay.push((newHook) => {\n      setDevtoolsHook$1(newHook, target);\n    });\n    setTimeout(() => {\n      if (!devtools$1) {\n        target.__VUE_DEVTOOLS_HOOK_REPLAY__ = null;\n        devtoolsNotInstalled = true;\n        buffer = [];\n      }\n    }, 3e3);\n  } else {\n    devtoolsNotInstalled = true;\n    buffer = [];\n  }\n}\nfunction devtoolsInitApp(app, version) {\n  emit$1(\"app:init\" /* APP_INIT */, app, version, {\n    Fragment,\n    Text,\n    Comment,\n    Static\n  });\n}\nfunction devtoolsUnmountApp(app) {\n  emit$1(\"app:unmount\" /* APP_UNMOUNT */, app);\n}\nconst devtoolsComponentAdded = /* @__PURE__ */ createDevtoolsComponentHook(\n  \"component:added\" /* COMPONENT_ADDED */\n);\nconst devtoolsComponentUpdated = /* @__PURE__ */ createDevtoolsComponentHook(\"component:updated\" /* COMPONENT_UPDATED */);\nconst _devtoolsComponentRemoved = /* @__PURE__ */ createDevtoolsComponentHook(\n  \"component:removed\" /* COMPONENT_REMOVED */\n);\nconst devtoolsComponentRemoved = (component) => {\n  if (devtools$1 && typeof devtools$1.cleanupBuffer === \"function\" && // remove the component if it wasn't buffered\n  !devtools$1.cleanupBuffer(component)) {\n    _devtoolsComponentRemoved(component);\n  }\n};\nfunction createDevtoolsComponentHook(hook) {\n  return (component) => {\n    emit$1(\n      hook,\n      component.appContext.app,\n      component.uid,\n      component.parent ? component.parent.uid : void 0,\n      component\n    );\n  };\n}\nconst devtoolsPerfStart = /* @__PURE__ */ createDevtoolsPerformanceHook(\n  \"perf:start\" /* PERFORMANCE_START */\n);\nconst devtoolsPerfEnd = /* @__PURE__ */ createDevtoolsPerformanceHook(\n  \"perf:end\" /* PERFORMANCE_END */\n);\nfunction createDevtoolsPerformanceHook(hook) {\n  return (component, type, time) => {\n    emit$1(hook, component.appContext.app, component.uid, component, type, time);\n  };\n}\nfunction devtoolsComponentEmit(component, event, params) {\n  emit$1(\n    \"component:emit\" /* COMPONENT_EMIT */,\n    component.appContext.app,\n    component,\n    event,\n    params\n  );\n}\n\nfunction emit(instance, event, ...rawArgs) {\n  if (instance.isUnmounted)\n    return;\n  const props = instance.vnode.props || EMPTY_OBJ;\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    const {\n      emitsOptions,\n      propsOptions: [propsOptions]\n    } = instance;\n    if (emitsOptions) {\n      if (!(event in emitsOptions) && true) {\n        if (!propsOptions || !(toHandlerKey(event) in propsOptions)) {\n          warn$1(\n            `Component emitted event \"${event}\" but it is neither declared in the emits option nor as an \"${toHandlerKey(event)}\" prop.`\n          );\n        }\n      } else {\n        const validator = emitsOptions[event];\n        if (isFunction(validator)) {\n          const isValid = validator(...rawArgs);\n          if (!isValid) {\n            warn$1(\n              `Invalid event arguments: event validation failed for event \"${event}\".`\n            );\n          }\n        }\n      }\n    }\n  }\n  let args = rawArgs;\n  const isModelListener = event.startsWith(\"update:\");\n  const modelArg = isModelListener && event.slice(7);\n  if (modelArg && modelArg in props) {\n    const modifiersKey = `${modelArg === \"modelValue\" ? \"model\" : modelArg}Modifiers`;\n    const { number, trim } = props[modifiersKey] || EMPTY_OBJ;\n    if (trim) {\n      args = rawArgs.map((a) => isString(a) ? a.trim() : a);\n    }\n    if (number) {\n      args = rawArgs.map(looseToNumber);\n    }\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n    devtoolsComponentEmit(instance, event, args);\n  }\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    const lowerCaseEvent = event.toLowerCase();\n    if (lowerCaseEvent !== event && props[toHandlerKey(lowerCaseEvent)]) {\n      warn$1(\n        `Event \"${lowerCaseEvent}\" is emitted in component ${formatComponentName(\n          instance,\n          instance.type\n        )} but the handler is registered for \"${event}\". Note that HTML attributes are case-insensitive and you cannot use v-on to listen to camelCase events when using in-DOM templates. You should probably use \"${hyphenate(\n          event\n        )}\" instead of \"${event}\".`\n      );\n    }\n  }\n  let handlerName;\n  let handler = props[handlerName = toHandlerKey(event)] || // also try camelCase event handler (#2249)\n  props[handlerName = toHandlerKey(camelize(event))];\n  if (!handler && isModelListener) {\n    handler = props[handlerName = toHandlerKey(hyphenate(event))];\n  }\n  if (handler) {\n    callWithAsyncErrorHandling(\n      handler,\n      instance,\n      6,\n      args\n    );\n  }\n  const onceHandler = props[handlerName + `Once`];\n  if (onceHandler) {\n    if (!instance.emitted) {\n      instance.emitted = {};\n    } else if (instance.emitted[handlerName]) {\n      return;\n    }\n    instance.emitted[handlerName] = true;\n    callWithAsyncErrorHandling(\n      onceHandler,\n      instance,\n      6,\n      args\n    );\n  }\n}\nfunction normalizeEmitsOptions(comp, appContext, asMixin = false) {\n  const cache = appContext.emitsCache;\n  const cached = cache.get(comp);\n  if (cached !== void 0) {\n    return cached;\n  }\n  const raw = comp.emits;\n  let normalized = {};\n  let hasExtends = false;\n  if (__VUE_OPTIONS_API__ && !isFunction(comp)) {\n    const extendEmits = (raw2) => {\n      const normalizedFromExtend = normalizeEmitsOptions(raw2, appContext, true);\n      if (normalizedFromExtend) {\n        hasExtends = true;\n        extend(normalized, normalizedFromExtend);\n      }\n    };\n    if (!asMixin && appContext.mixins.length) {\n      appContext.mixins.forEach(extendEmits);\n    }\n    if (comp.extends) {\n      extendEmits(comp.extends);\n    }\n    if (comp.mixins) {\n      comp.mixins.forEach(extendEmits);\n    }\n  }\n  if (!raw && !hasExtends) {\n    if (isObject(comp)) {\n      cache.set(comp, null);\n    }\n    return null;\n  }\n  if (isArray(raw)) {\n    raw.forEach((key) => normalized[key] = null);\n  } else {\n    extend(normalized, raw);\n  }\n  if (isObject(comp)) {\n    cache.set(comp, normalized);\n  }\n  return normalized;\n}\nfunction isEmitListener(options, key) {\n  if (!options || !isOn(key)) {\n    return false;\n  }\n  key = key.slice(2).replace(/Once$/, \"\");\n  return hasOwn(options, key[0].toLowerCase() + key.slice(1)) || hasOwn(options, hyphenate(key)) || hasOwn(options, key);\n}\n\nlet currentRenderingInstance = null;\nlet currentScopeId = null;\nfunction setCurrentRenderingInstance(instance) {\n  const prev = currentRenderingInstance;\n  currentRenderingInstance = instance;\n  currentScopeId = instance && instance.type.__scopeId || null;\n  return prev;\n}\nfunction pushScopeId(id) {\n  currentScopeId = id;\n}\nfunction popScopeId() {\n  currentScopeId = null;\n}\nconst withScopeId = (_id) => withCtx;\nfunction withCtx(fn, ctx = currentRenderingInstance, isNonScopedSlot) {\n  if (!ctx)\n    return fn;\n  if (fn._n) {\n    return fn;\n  }\n  const renderFnWithContext = (...args) => {\n    if (renderFnWithContext._d) {\n      setBlockTracking(-1);\n    }\n    const prevInstance = setCurrentRenderingInstance(ctx);\n    let res;\n    try {\n      res = fn(...args);\n    } finally {\n      setCurrentRenderingInstance(prevInstance);\n      if (renderFnWithContext._d) {\n        setBlockTracking(1);\n      }\n    }\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      devtoolsComponentUpdated(ctx);\n    }\n    return res;\n  };\n  renderFnWithContext._n = true;\n  renderFnWithContext._c = true;\n  renderFnWithContext._d = true;\n  return renderFnWithContext;\n}\n\nlet accessedAttrs = false;\nfunction markAttrsAccessed() {\n  accessedAttrs = true;\n}\nfunction renderComponentRoot(instance) {\n  const {\n    type: Component,\n    vnode,\n    proxy,\n    withProxy,\n    props,\n    propsOptions: [propsOptions],\n    slots,\n    attrs,\n    emit,\n    render,\n    renderCache,\n    data,\n    setupState,\n    ctx,\n    inheritAttrs\n  } = instance;\n  let result;\n  let fallthroughAttrs;\n  const prev = setCurrentRenderingInstance(instance);\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    accessedAttrs = false;\n  }\n  try {\n    if (vnode.shapeFlag & 4) {\n      const proxyToUse = withProxy || proxy;\n      const thisProxy = !!(process.env.NODE_ENV !== \"production\") && setupState.__isScriptSetup ? new Proxy(proxyToUse, {\n        get(target, key, receiver) {\n          warn$1(\n            `Property '${String(\n              key\n            )}' was accessed via 'this'. Avoid using 'this' in templates.`\n          );\n          return Reflect.get(target, key, receiver);\n        }\n      }) : proxyToUse;\n      result = normalizeVNode(\n        render.call(\n          thisProxy,\n          proxyToUse,\n          renderCache,\n          props,\n          setupState,\n          data,\n          ctx\n        )\n      );\n      fallthroughAttrs = attrs;\n    } else {\n      const render2 = Component;\n      if (!!(process.env.NODE_ENV !== \"production\") && attrs === props) {\n        markAttrsAccessed();\n      }\n      result = normalizeVNode(\n        render2.length > 1 ? render2(\n          props,\n          !!(process.env.NODE_ENV !== \"production\") ? {\n            get attrs() {\n              markAttrsAccessed();\n              return attrs;\n            },\n            slots,\n            emit\n          } : { attrs, slots, emit }\n        ) : render2(\n          props,\n          null\n          /* we know it doesn't need it */\n        )\n      );\n      fallthroughAttrs = Component.props ? attrs : getFunctionalFallthrough(attrs);\n    }\n  } catch (err) {\n    blockStack.length = 0;\n    handleError(err, instance, 1);\n    result = createVNode(Comment);\n  }\n  let root = result;\n  let setRoot = void 0;\n  if (!!(process.env.NODE_ENV !== \"production\") && result.patchFlag > 0 && result.patchFlag & 2048) {\n    [root, setRoot] = getChildRoot(result);\n  }\n  if (fallthroughAttrs && inheritAttrs !== false) {\n    const keys = Object.keys(fallthroughAttrs);\n    const { shapeFlag } = root;\n    if (keys.length) {\n      if (shapeFlag & (1 | 6)) {\n        if (propsOptions && keys.some(isModelListener)) {\n          fallthroughAttrs = filterModelListeners(\n            fallthroughAttrs,\n            propsOptions\n          );\n        }\n        root = cloneVNode(root, fallthroughAttrs);\n      } else if (!!(process.env.NODE_ENV !== \"production\") && !accessedAttrs && root.type !== Comment) {\n        const allAttrs = Object.keys(attrs);\n        const eventAttrs = [];\n        const extraAttrs = [];\n        for (let i = 0, l = allAttrs.length; i < l; i++) {\n          const key = allAttrs[i];\n          if (isOn(key)) {\n            if (!isModelListener(key)) {\n              eventAttrs.push(key[2].toLowerCase() + key.slice(3));\n            }\n          } else {\n            extraAttrs.push(key);\n          }\n        }\n        if (extraAttrs.length) {\n          warn$1(\n            `Extraneous non-props attributes (${extraAttrs.join(\", \")}) were passed to component but could not be automatically inherited because component renders fragment or text root nodes.`\n          );\n        }\n        if (eventAttrs.length) {\n          warn$1(\n            `Extraneous non-emits event listeners (${eventAttrs.join(\", \")}) were passed to component but could not be automatically inherited because component renders fragment or text root nodes. If the listener is intended to be a component custom event listener only, declare it using the \"emits\" option.`\n          );\n        }\n      }\n    }\n  }\n  if (vnode.dirs) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !isElementRoot(root)) {\n      warn$1(\n        `Runtime directive used on component with non-element root node. The directives will not function as intended.`\n      );\n    }\n    root = cloneVNode(root);\n    root.dirs = root.dirs ? root.dirs.concat(vnode.dirs) : vnode.dirs;\n  }\n  if (vnode.transition) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !isElementRoot(root)) {\n      warn$1(\n        `Component inside <Transition> renders non-element root node that cannot be animated.`\n      );\n    }\n    root.transition = vnode.transition;\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && setRoot) {\n    setRoot(root);\n  } else {\n    result = root;\n  }\n  setCurrentRenderingInstance(prev);\n  return result;\n}\nconst getChildRoot = (vnode) => {\n  const rawChildren = vnode.children;\n  const dynamicChildren = vnode.dynamicChildren;\n  const childRoot = filterSingleRoot(rawChildren, false);\n  if (!childRoot) {\n    return [vnode, void 0];\n  } else if (!!(process.env.NODE_ENV !== \"production\") && childRoot.patchFlag > 0 && childRoot.patchFlag & 2048) {\n    return getChildRoot(childRoot);\n  }\n  const index = rawChildren.indexOf(childRoot);\n  const dynamicIndex = dynamicChildren ? dynamicChildren.indexOf(childRoot) : -1;\n  const setRoot = (updatedRoot) => {\n    rawChildren[index] = updatedRoot;\n    if (dynamicChildren) {\n      if (dynamicIndex > -1) {\n        dynamicChildren[dynamicIndex] = updatedRoot;\n      } else if (updatedRoot.patchFlag > 0) {\n        vnode.dynamicChildren = [...dynamicChildren, updatedRoot];\n      }\n    }\n  };\n  return [normalizeVNode(childRoot), setRoot];\n};\nfunction filterSingleRoot(children, recurse = true) {\n  let singleRoot;\n  for (let i = 0; i < children.length; i++) {\n    const child = children[i];\n    if (isVNode(child)) {\n      if (child.type !== Comment || child.children === \"v-if\") {\n        if (singleRoot) {\n          return;\n        } else {\n          singleRoot = child;\n          if (!!(process.env.NODE_ENV !== \"production\") && recurse && singleRoot.patchFlag > 0 && singleRoot.patchFlag & 2048) {\n            return filterSingleRoot(singleRoot.children);\n          }\n        }\n      }\n    } else {\n      return;\n    }\n  }\n  return singleRoot;\n}\nconst getFunctionalFallthrough = (attrs) => {\n  let res;\n  for (const key in attrs) {\n    if (key === \"class\" || key === \"style\" || isOn(key)) {\n      (res || (res = {}))[key] = attrs[key];\n    }\n  }\n  return res;\n};\nconst filterModelListeners = (attrs, props) => {\n  const res = {};\n  for (const key in attrs) {\n    if (!isModelListener(key) || !(key.slice(9) in props)) {\n      res[key] = attrs[key];\n    }\n  }\n  return res;\n};\nconst isElementRoot = (vnode) => {\n  return vnode.shapeFlag & (6 | 1) || vnode.type === Comment;\n};\nfunction shouldUpdateComponent(prevVNode, nextVNode, optimized) {\n  const { props: prevProps, children: prevChildren, component } = prevVNode;\n  const { props: nextProps, children: nextChildren, patchFlag } = nextVNode;\n  const emits = component.emitsOptions;\n  if (!!(process.env.NODE_ENV !== \"production\") && (prevChildren || nextChildren) && isHmrUpdating) {\n    return true;\n  }\n  if (nextVNode.dirs || nextVNode.transition) {\n    return true;\n  }\n  if (optimized && patchFlag >= 0) {\n    if (patchFlag & 1024) {\n      return true;\n    }\n    if (patchFlag & 16) {\n      if (!prevProps) {\n        return !!nextProps;\n      }\n      return hasPropsChanged(prevProps, nextProps, emits);\n    } else if (patchFlag & 8) {\n      const dynamicProps = nextVNode.dynamicProps;\n      for (let i = 0; i < dynamicProps.length; i++) {\n        const key = dynamicProps[i];\n        if (nextProps[key] !== prevProps[key] && !isEmitListener(emits, key)) {\n          return true;\n        }\n      }\n    }\n  } else {\n    if (prevChildren || nextChildren) {\n      if (!nextChildren || !nextChildren.$stable) {\n        return true;\n      }\n    }\n    if (prevProps === nextProps) {\n      return false;\n    }\n    if (!prevProps) {\n      return !!nextProps;\n    }\n    if (!nextProps) {\n      return true;\n    }\n    return hasPropsChanged(prevProps, nextProps, emits);\n  }\n  return false;\n}\nfunction hasPropsChanged(prevProps, nextProps, emitsOptions) {\n  const nextKeys = Object.keys(nextProps);\n  if (nextKeys.length !== Object.keys(prevProps).length) {\n    return true;\n  }\n  for (let i = 0; i < nextKeys.length; i++) {\n    const key = nextKeys[i];\n    if (nextProps[key] !== prevProps[key] && !isEmitListener(emitsOptions, key)) {\n      return true;\n    }\n  }\n  return false;\n}\nfunction updateHOCHostEl({ vnode, parent }, el) {\n  while (parent) {\n    const root = parent.subTree;\n    if (root.suspense && root.suspense.activeBranch === vnode) {\n      root.el = vnode.el;\n    }\n    if (root === vnode) {\n      (vnode = parent.vnode).el = el;\n      parent = parent.parent;\n    } else {\n      break;\n    }\n  }\n}\n\nconst COMPONENTS = \"components\";\nconst DIRECTIVES = \"directives\";\nfunction resolveComponent(name, maybeSelfReference) {\n  return resolveAsset(COMPONENTS, name, true, maybeSelfReference) || name;\n}\nconst NULL_DYNAMIC_COMPONENT = Symbol.for(\"v-ndc\");\nfunction resolveDynamicComponent(component) {\n  if (isString(component)) {\n    return resolveAsset(COMPONENTS, component, false) || component;\n  } else {\n    return component || NULL_DYNAMIC_COMPONENT;\n  }\n}\nfunction resolveDirective(name) {\n  return resolveAsset(DIRECTIVES, name);\n}\nfunction resolveAsset(type, name, warnMissing = true, maybeSelfReference = false) {\n  const instance = currentRenderingInstance || currentInstance;\n  if (instance) {\n    const Component = instance.type;\n    if (type === COMPONENTS) {\n      const selfName = getComponentName(\n        Component,\n        false\n      );\n      if (selfName && (selfName === name || selfName === camelize(name) || selfName === capitalize(camelize(name)))) {\n        return Component;\n      }\n    }\n    const res = (\n      // local registration\n      // check instance[type] first which is resolved for options API\n      resolve(instance[type] || Component[type], name) || // global registration\n      resolve(instance.appContext[type], name)\n    );\n    if (!res && maybeSelfReference) {\n      return Component;\n    }\n    if (!!(process.env.NODE_ENV !== \"production\") && warnMissing && !res) {\n      const extra = type === COMPONENTS ? `\nIf this is a native custom element, make sure to exclude it from component resolution via compilerOptions.isCustomElement.` : ``;\n      warn$1(`Failed to resolve ${type.slice(0, -1)}: ${name}${extra}`);\n    }\n    return res;\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    warn$1(\n      `resolve${capitalize(type.slice(0, -1))} can only be used in render() or setup().`\n    );\n  }\n}\nfunction resolve(registry, name) {\n  return registry && (registry[name] || registry[camelize(name)] || registry[capitalize(camelize(name))]);\n}\n\nconst isSuspense = (type) => type.__isSuspense;\nlet suspenseId = 0;\nconst SuspenseImpl = {\n  name: \"Suspense\",\n  // In order to make Suspense tree-shakable, we need to avoid importing it\n  // directly in the renderer. The renderer checks for the __isSuspense flag\n  // on a vnode's type and calls the `process` method, passing in renderer\n  // internals.\n  __isSuspense: true,\n  process(n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized, rendererInternals) {\n    if (n1 == null) {\n      mountSuspense(\n        n2,\n        container,\n        anchor,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized,\n        rendererInternals\n      );\n    } else {\n      if (parentSuspense && parentSuspense.deps > 0) {\n        n2.suspense = n1.suspense;\n        return;\n      }\n      patchSuspense(\n        n1,\n        n2,\n        container,\n        anchor,\n        parentComponent,\n        namespace,\n        slotScopeIds,\n        optimized,\n        rendererInternals\n      );\n    }\n  },\n  hydrate: hydrateSuspense,\n  create: createSuspenseBoundary,\n  normalize: normalizeSuspenseChildren\n};\nconst Suspense = SuspenseImpl ;\nfunction triggerEvent(vnode, name) {\n  const eventListener = vnode.props && vnode.props[name];\n  if (isFunction(eventListener)) {\n    eventListener();\n  }\n}\nfunction mountSuspense(vnode, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized, rendererInternals) {\n  const {\n    p: patch,\n    o: { createElement }\n  } = rendererInternals;\n  const hiddenContainer = createElement(\"div\");\n  const suspense = vnode.suspense = createSuspenseBoundary(\n    vnode,\n    parentSuspense,\n    parentComponent,\n    container,\n    hiddenContainer,\n    anchor,\n    namespace,\n    slotScopeIds,\n    optimized,\n    rendererInternals\n  );\n  patch(\n    null,\n    suspense.pendingBranch = vnode.ssContent,\n    hiddenContainer,\n    null,\n    parentComponent,\n    suspense,\n    namespace,\n    slotScopeIds\n  );\n  if (suspense.deps > 0) {\n    triggerEvent(vnode, \"onPending\");\n    triggerEvent(vnode, \"onFallback\");\n    patch(\n      null,\n      vnode.ssFallback,\n      container,\n      anchor,\n      parentComponent,\n      null,\n      // fallback tree will not have suspense context\n      namespace,\n      slotScopeIds\n    );\n    setActiveBranch(suspense, vnode.ssFallback);\n  } else {\n    suspense.resolve(false, true);\n  }\n}\nfunction patchSuspense(n1, n2, container, anchor, parentComponent, namespace, slotScopeIds, optimized, { p: patch, um: unmount, o: { createElement } }) {\n  const suspense = n2.suspense = n1.suspense;\n  suspense.vnode = n2;\n  n2.el = n1.el;\n  const newBranch = n2.ssContent;\n  const newFallback = n2.ssFallback;\n  const { activeBranch, pendingBranch, isInFallback, isHydrating } = suspense;\n  if (pendingBranch) {\n    suspense.pendingBranch = newBranch;\n    if (isSameVNodeType(newBranch, pendingBranch)) {\n      patch(\n        pendingBranch,\n        newBranch,\n        suspense.hiddenContainer,\n        null,\n        parentComponent,\n        suspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n      if (suspense.deps <= 0) {\n        suspense.resolve();\n      } else if (isInFallback) {\n        if (!isHydrating) {\n          patch(\n            activeBranch,\n            newFallback,\n            container,\n            anchor,\n            parentComponent,\n            null,\n            // fallback tree will not have suspense context\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n          setActiveBranch(suspense, newFallback);\n        }\n      }\n    } else {\n      suspense.pendingId = suspenseId++;\n      if (isHydrating) {\n        suspense.isHydrating = false;\n        suspense.activeBranch = pendingBranch;\n      } else {\n        unmount(pendingBranch, parentComponent, suspense);\n      }\n      suspense.deps = 0;\n      suspense.effects.length = 0;\n      suspense.hiddenContainer = createElement(\"div\");\n      if (isInFallback) {\n        patch(\n          null,\n          newBranch,\n          suspense.hiddenContainer,\n          null,\n          parentComponent,\n          suspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        if (suspense.deps <= 0) {\n          suspense.resolve();\n        } else {\n          patch(\n            activeBranch,\n            newFallback,\n            container,\n            anchor,\n            parentComponent,\n            null,\n            // fallback tree will not have suspense context\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n          setActiveBranch(suspense, newFallback);\n        }\n      } else if (activeBranch && isSameVNodeType(newBranch, activeBranch)) {\n        patch(\n          activeBranch,\n          newBranch,\n          container,\n          anchor,\n          parentComponent,\n          suspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        suspense.resolve(true);\n      } else {\n        patch(\n          null,\n          newBranch,\n          suspense.hiddenContainer,\n          null,\n          parentComponent,\n          suspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        if (suspense.deps <= 0) {\n          suspense.resolve();\n        }\n      }\n    }\n  } else {\n    if (activeBranch && isSameVNodeType(newBranch, activeBranch)) {\n      patch(\n        activeBranch,\n        newBranch,\n        container,\n        anchor,\n        parentComponent,\n        suspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n      setActiveBranch(suspense, newBranch);\n    } else {\n      triggerEvent(n2, \"onPending\");\n      suspense.pendingBranch = newBranch;\n      if (newBranch.shapeFlag & 512) {\n        suspense.pendingId = newBranch.component.suspenseId;\n      } else {\n        suspense.pendingId = suspenseId++;\n      }\n      patch(\n        null,\n        newBranch,\n        suspense.hiddenContainer,\n        null,\n        parentComponent,\n        suspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n      if (suspense.deps <= 0) {\n        suspense.resolve();\n      } else {\n        const { timeout, pendingId } = suspense;\n        if (timeout > 0) {\n          setTimeout(() => {\n            if (suspense.pendingId === pendingId) {\n              suspense.fallback(newFallback);\n            }\n          }, timeout);\n        } else if (timeout === 0) {\n          suspense.fallback(newFallback);\n        }\n      }\n    }\n  }\n}\nlet hasWarned = false;\nfunction createSuspenseBoundary(vnode, parentSuspense, parentComponent, container, hiddenContainer, anchor, namespace, slotScopeIds, optimized, rendererInternals, isHydrating = false) {\n  if (!!(process.env.NODE_ENV !== \"production\") && true && !hasWarned) {\n    hasWarned = true;\n    console[console.info ? \"info\" : \"log\"](\n      `<Suspense> is an experimental feature and its API will likely change.`\n    );\n  }\n  const {\n    p: patch,\n    m: move,\n    um: unmount,\n    n: next,\n    o: { parentNode, remove }\n  } = rendererInternals;\n  let parentSuspenseId;\n  const isSuspensible = isVNodeSuspensible(vnode);\n  if (isSuspensible) {\n    if (parentSuspense == null ? void 0 : parentSuspense.pendingBranch) {\n      parentSuspenseId = parentSuspense.pendingId;\n      parentSuspense.deps++;\n    }\n  }\n  const timeout = vnode.props ? toNumber(vnode.props.timeout) : void 0;\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    assertNumber(timeout, `Suspense timeout`);\n  }\n  const initialAnchor = anchor;\n  const suspense = {\n    vnode,\n    parent: parentSuspense,\n    parentComponent,\n    namespace,\n    container,\n    hiddenContainer,\n    deps: 0,\n    pendingId: suspenseId++,\n    timeout: typeof timeout === \"number\" ? timeout : -1,\n    activeBranch: null,\n    pendingBranch: null,\n    isInFallback: !isHydrating,\n    isHydrating,\n    isUnmounted: false,\n    effects: [],\n    resolve(resume = false, sync = false) {\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        if (!resume && !suspense.pendingBranch) {\n          throw new Error(\n            `suspense.resolve() is called without a pending branch.`\n          );\n        }\n        if (suspense.isUnmounted) {\n          throw new Error(\n            `suspense.resolve() is called on an already unmounted suspense boundary.`\n          );\n        }\n      }\n      const {\n        vnode: vnode2,\n        activeBranch,\n        pendingBranch,\n        pendingId,\n        effects,\n        parentComponent: parentComponent2,\n        container: container2\n      } = suspense;\n      let delayEnter = false;\n      if (suspense.isHydrating) {\n        suspense.isHydrating = false;\n      } else if (!resume) {\n        delayEnter = activeBranch && pendingBranch.transition && pendingBranch.transition.mode === \"out-in\";\n        if (delayEnter) {\n          activeBranch.transition.afterLeave = () => {\n            if (pendingId === suspense.pendingId) {\n              move(\n                pendingBranch,\n                container2,\n                anchor === initialAnchor ? next(activeBranch) : anchor,\n                0\n              );\n              queuePostFlushCb(effects);\n            }\n          };\n        }\n        if (activeBranch) {\n          if (parentNode(activeBranch.el) !== suspense.hiddenContainer) {\n            anchor = next(activeBranch);\n          }\n          unmount(activeBranch, parentComponent2, suspense, true);\n        }\n        if (!delayEnter) {\n          move(pendingBranch, container2, anchor, 0);\n        }\n      }\n      setActiveBranch(suspense, pendingBranch);\n      suspense.pendingBranch = null;\n      suspense.isInFallback = false;\n      let parent = suspense.parent;\n      let hasUnresolvedAncestor = false;\n      while (parent) {\n        if (parent.pendingBranch) {\n          parent.effects.push(...effects);\n          hasUnresolvedAncestor = true;\n          break;\n        }\n        parent = parent.parent;\n      }\n      if (!hasUnresolvedAncestor && !delayEnter) {\n        queuePostFlushCb(effects);\n      }\n      suspense.effects = [];\n      if (isSuspensible) {\n        if (parentSuspense && parentSuspense.pendingBranch && parentSuspenseId === parentSuspense.pendingId) {\n          parentSuspense.deps--;\n          if (parentSuspense.deps === 0 && !sync) {\n            parentSuspense.resolve();\n          }\n        }\n      }\n      triggerEvent(vnode2, \"onResolve\");\n    },\n    fallback(fallbackVNode) {\n      if (!suspense.pendingBranch) {\n        return;\n      }\n      const { vnode: vnode2, activeBranch, parentComponent: parentComponent2, container: container2, namespace: namespace2 } = suspense;\n      triggerEvent(vnode2, \"onFallback\");\n      const anchor2 = next(activeBranch);\n      const mountFallback = () => {\n        if (!suspense.isInFallback) {\n          return;\n        }\n        patch(\n          null,\n          fallbackVNode,\n          container2,\n          anchor2,\n          parentComponent2,\n          null,\n          // fallback tree will not have suspense context\n          namespace2,\n          slotScopeIds,\n          optimized\n        );\n        setActiveBranch(suspense, fallbackVNode);\n      };\n      const delayEnter = fallbackVNode.transition && fallbackVNode.transition.mode === \"out-in\";\n      if (delayEnter) {\n        activeBranch.transition.afterLeave = mountFallback;\n      }\n      suspense.isInFallback = true;\n      unmount(\n        activeBranch,\n        parentComponent2,\n        null,\n        // no suspense so unmount hooks fire now\n        true\n        // shouldRemove\n      );\n      if (!delayEnter) {\n        mountFallback();\n      }\n    },\n    move(container2, anchor2, type) {\n      suspense.activeBranch && move(suspense.activeBranch, container2, anchor2, type);\n      suspense.container = container2;\n    },\n    next() {\n      return suspense.activeBranch && next(suspense.activeBranch);\n    },\n    registerDep(instance, setupRenderEffect) {\n      const isInPendingSuspense = !!suspense.pendingBranch;\n      if (isInPendingSuspense) {\n        suspense.deps++;\n      }\n      const hydratedEl = instance.vnode.el;\n      instance.asyncDep.catch((err) => {\n        handleError(err, instance, 0);\n      }).then((asyncSetupResult) => {\n        if (instance.isUnmounted || suspense.isUnmounted || suspense.pendingId !== instance.suspenseId) {\n          return;\n        }\n        instance.asyncResolved = true;\n        const { vnode: vnode2 } = instance;\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          pushWarningContext(vnode2);\n        }\n        handleSetupResult(instance, asyncSetupResult, false);\n        if (hydratedEl) {\n          vnode2.el = hydratedEl;\n        }\n        const placeholder = !hydratedEl && instance.subTree.el;\n        setupRenderEffect(\n          instance,\n          vnode2,\n          // component may have been moved before resolve.\n          // if this is not a hydration, instance.subTree will be the comment\n          // placeholder.\n          parentNode(hydratedEl || instance.subTree.el),\n          // anchor will not be used if this is hydration, so only need to\n          // consider the comment placeholder case.\n          hydratedEl ? null : next(instance.subTree),\n          suspense,\n          namespace,\n          optimized\n        );\n        if (placeholder) {\n          remove(placeholder);\n        }\n        updateHOCHostEl(instance, vnode2.el);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          popWarningContext();\n        }\n        if (isInPendingSuspense && --suspense.deps === 0) {\n          suspense.resolve();\n        }\n      });\n    },\n    unmount(parentSuspense2, doRemove) {\n      suspense.isUnmounted = true;\n      if (suspense.activeBranch) {\n        unmount(\n          suspense.activeBranch,\n          parentComponent,\n          parentSuspense2,\n          doRemove\n        );\n      }\n      if (suspense.pendingBranch) {\n        unmount(\n          suspense.pendingBranch,\n          parentComponent,\n          parentSuspense2,\n          doRemove\n        );\n      }\n    }\n  };\n  return suspense;\n}\nfunction hydrateSuspense(node, vnode, parentComponent, parentSuspense, namespace, slotScopeIds, optimized, rendererInternals, hydrateNode) {\n  const suspense = vnode.suspense = createSuspenseBoundary(\n    vnode,\n    parentSuspense,\n    parentComponent,\n    node.parentNode,\n    // eslint-disable-next-line no-restricted-globals\n    document.createElement(\"div\"),\n    null,\n    namespace,\n    slotScopeIds,\n    optimized,\n    rendererInternals,\n    true\n  );\n  const result = hydrateNode(\n    node,\n    suspense.pendingBranch = vnode.ssContent,\n    parentComponent,\n    suspense,\n    slotScopeIds,\n    optimized\n  );\n  if (suspense.deps === 0) {\n    suspense.resolve(false, true);\n  }\n  return result;\n}\nfunction normalizeSuspenseChildren(vnode) {\n  const { shapeFlag, children } = vnode;\n  const isSlotChildren = shapeFlag & 32;\n  vnode.ssContent = normalizeSuspenseSlot(\n    isSlotChildren ? children.default : children\n  );\n  vnode.ssFallback = isSlotChildren ? normalizeSuspenseSlot(children.fallback) : createVNode(Comment);\n}\nfunction normalizeSuspenseSlot(s) {\n  let block;\n  if (isFunction(s)) {\n    const trackBlock = isBlockTreeEnabled && s._c;\n    if (trackBlock) {\n      s._d = false;\n      openBlock();\n    }\n    s = s();\n    if (trackBlock) {\n      s._d = true;\n      block = currentBlock;\n      closeBlock();\n    }\n  }\n  if (isArray(s)) {\n    const singleChild = filterSingleRoot(s);\n    if (!!(process.env.NODE_ENV !== \"production\") && !singleChild && s.filter((child) => child !== NULL_DYNAMIC_COMPONENT).length > 0) {\n      warn$1(`<Suspense> slots expect a single root node.`);\n    }\n    s = singleChild;\n  }\n  s = normalizeVNode(s);\n  if (block && !s.dynamicChildren) {\n    s.dynamicChildren = block.filter((c) => c !== s);\n  }\n  return s;\n}\nfunction queueEffectWithSuspense(fn, suspense) {\n  if (suspense && suspense.pendingBranch) {\n    if (isArray(fn)) {\n      suspense.effects.push(...fn);\n    } else {\n      suspense.effects.push(fn);\n    }\n  } else {\n    queuePostFlushCb(fn);\n  }\n}\nfunction setActiveBranch(suspense, branch) {\n  suspense.activeBranch = branch;\n  const { vnode, parentComponent } = suspense;\n  let el = branch.el;\n  while (!el && branch.component) {\n    branch = branch.component.subTree;\n    el = branch.el;\n  }\n  vnode.el = el;\n  if (parentComponent && parentComponent.subTree === vnode) {\n    parentComponent.vnode.el = el;\n    updateHOCHostEl(parentComponent, el);\n  }\n}\nfunction isVNodeSuspensible(vnode) {\n  var _a;\n  return ((_a = vnode.props) == null ? void 0 : _a.suspensible) != null && vnode.props.suspensible !== false;\n}\n\nconst ssrContextKey = Symbol.for(\"v-scx\");\nconst useSSRContext = () => {\n  {\n    const ctx = inject(ssrContextKey);\n    if (!ctx) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(\n        `Server rendering context not provided. Make sure to only call useSSRContext() conditionally in the server build.`\n      );\n    }\n    return ctx;\n  }\n};\n\nfunction watchEffect(effect, options) {\n  return doWatch(effect, null, options);\n}\nfunction watchPostEffect(effect, options) {\n  return doWatch(\n    effect,\n    null,\n    !!(process.env.NODE_ENV !== \"production\") ? extend({}, options, { flush: \"post\" }) : { flush: \"post\" }\n  );\n}\nfunction watchSyncEffect(effect, options) {\n  return doWatch(\n    effect,\n    null,\n    !!(process.env.NODE_ENV !== \"production\") ? extend({}, options, { flush: \"sync\" }) : { flush: \"sync\" }\n  );\n}\nconst INITIAL_WATCHER_VALUE = {};\nfunction watch(source, cb, options) {\n  if (!!(process.env.NODE_ENV !== \"production\") && !isFunction(cb)) {\n    warn$1(\n      `\\`watch(fn, options?)\\` signature has been moved to a separate API. Use \\`watchEffect(fn, options?)\\` instead. \\`watch\\` now only supports \\`watch(source, cb, options?) signature.`\n    );\n  }\n  return doWatch(source, cb, options);\n}\nfunction doWatch(source, cb, {\n  immediate,\n  deep,\n  flush,\n  once,\n  onTrack,\n  onTrigger\n} = EMPTY_OBJ) {\n  if (cb && once) {\n    const _cb = cb;\n    cb = (...args) => {\n      _cb(...args);\n      unwatch();\n    };\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && deep !== void 0 && typeof deep === \"number\") {\n    warn$1(\n      `watch() \"deep\" option with number value will be used as watch depth in future versions. Please use a boolean instead to avoid potential breakage.`\n    );\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && !cb) {\n    if (immediate !== void 0) {\n      warn$1(\n        `watch() \"immediate\" option is only respected when using the watch(source, callback, options?) signature.`\n      );\n    }\n    if (deep !== void 0) {\n      warn$1(\n        `watch() \"deep\" option is only respected when using the watch(source, callback, options?) signature.`\n      );\n    }\n    if (once !== void 0) {\n      warn$1(\n        `watch() \"once\" option is only respected when using the watch(source, callback, options?) signature.`\n      );\n    }\n  }\n  const warnInvalidSource = (s) => {\n    warn$1(\n      `Invalid watch source: `,\n      s,\n      `A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types.`\n    );\n  };\n  const instance = currentInstance;\n  const reactiveGetter = (source2) => deep === true ? source2 : (\n    // for deep: false, only traverse root-level properties\n    traverse(source2, deep === false ? 1 : void 0)\n  );\n  let getter;\n  let forceTrigger = false;\n  let isMultiSource = false;\n  if (isRef(source)) {\n    getter = () => source.value;\n    forceTrigger = isShallow$1(source);\n  } else if (isReactive(source)) {\n    getter = () => reactiveGetter(source);\n    forceTrigger = true;\n  } else if (isArray(source)) {\n    isMultiSource = true;\n    forceTrigger = source.some((s) => isReactive(s) || isShallow$1(s));\n    getter = () => source.map((s) => {\n      if (isRef(s)) {\n        return s.value;\n      } else if (isReactive(s)) {\n        return reactiveGetter(s);\n      } else if (isFunction(s)) {\n        return callWithErrorHandling(s, instance, 2);\n      } else {\n        !!(process.env.NODE_ENV !== \"production\") && warnInvalidSource(s);\n      }\n    });\n  } else if (isFunction(source)) {\n    if (cb) {\n      getter = () => callWithErrorHandling(source, instance, 2);\n    } else {\n      getter = () => {\n        if (cleanup) {\n          cleanup();\n        }\n        return callWithAsyncErrorHandling(\n          source,\n          instance,\n          3,\n          [onCleanup]\n        );\n      };\n    }\n  } else {\n    getter = NOOP;\n    !!(process.env.NODE_ENV !== \"production\") && warnInvalidSource(source);\n  }\n  if (cb && deep) {\n    const baseGetter = getter;\n    getter = () => traverse(baseGetter());\n  }\n  let cleanup;\n  let onCleanup = (fn) => {\n    cleanup = effect.onStop = () => {\n      callWithErrorHandling(fn, instance, 4);\n      cleanup = effect.onStop = void 0;\n    };\n  };\n  let ssrCleanup;\n  if (isInSSRComponentSetup) {\n    onCleanup = NOOP;\n    if (!cb) {\n      getter();\n    } else if (immediate) {\n      callWithAsyncErrorHandling(cb, instance, 3, [\n        getter(),\n        isMultiSource ? [] : void 0,\n        onCleanup\n      ]);\n    }\n    if (flush === \"sync\") {\n      const ctx = useSSRContext();\n      ssrCleanup = ctx.__watcherHandles || (ctx.__watcherHandles = []);\n    } else {\n      return NOOP;\n    }\n  }\n  let oldValue = isMultiSource ? new Array(source.length).fill(INITIAL_WATCHER_VALUE) : INITIAL_WATCHER_VALUE;\n  const job = () => {\n    if (!effect.active || !effect.dirty) {\n      return;\n    }\n    if (cb) {\n      const newValue = effect.run();\n      if (deep || forceTrigger || (isMultiSource ? newValue.some((v, i) => hasChanged(v, oldValue[i])) : hasChanged(newValue, oldValue)) || false) {\n        if (cleanup) {\n          cleanup();\n        }\n        callWithAsyncErrorHandling(cb, instance, 3, [\n          newValue,\n          // pass undefined as the old value when it's changed for the first time\n          oldValue === INITIAL_WATCHER_VALUE ? void 0 : isMultiSource && oldValue[0] === INITIAL_WATCHER_VALUE ? [] : oldValue,\n          onCleanup\n        ]);\n        oldValue = newValue;\n      }\n    } else {\n      effect.run();\n    }\n  };\n  job.allowRecurse = !!cb;\n  let scheduler;\n  if (flush === \"sync\") {\n    scheduler = job;\n  } else if (flush === \"post\") {\n    scheduler = () => queuePostRenderEffect(job, instance && instance.suspense);\n  } else {\n    job.pre = true;\n    if (instance)\n      job.id = instance.uid;\n    scheduler = () => queueJob(job);\n  }\n  const effect = new ReactiveEffect(getter, NOOP, scheduler);\n  const scope = getCurrentScope();\n  const unwatch = () => {\n    effect.stop();\n    if (scope) {\n      remove(scope.effects, effect);\n    }\n  };\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    effect.onTrack = onTrack;\n    effect.onTrigger = onTrigger;\n  }\n  if (cb) {\n    if (immediate) {\n      job();\n    } else {\n      oldValue = effect.run();\n    }\n  } else if (flush === \"post\") {\n    queuePostRenderEffect(\n      effect.run.bind(effect),\n      instance && instance.suspense\n    );\n  } else {\n    effect.run();\n  }\n  if (ssrCleanup)\n    ssrCleanup.push(unwatch);\n  return unwatch;\n}\nfunction instanceWatch(source, value, options) {\n  const publicThis = this.proxy;\n  const getter = isString(source) ? source.includes(\".\") ? createPathGetter(publicThis, source) : () => publicThis[source] : source.bind(publicThis, publicThis);\n  let cb;\n  if (isFunction(value)) {\n    cb = value;\n  } else {\n    cb = value.handler;\n    options = value;\n  }\n  const reset = setCurrentInstance(this);\n  const res = doWatch(getter, cb.bind(publicThis), options);\n  reset();\n  return res;\n}\nfunction createPathGetter(ctx, path) {\n  const segments = path.split(\".\");\n  return () => {\n    let cur = ctx;\n    for (let i = 0; i < segments.length && cur; i++) {\n      cur = cur[segments[i]];\n    }\n    return cur;\n  };\n}\nfunction traverse(value, depth, currentDepth = 0, seen) {\n  if (!isObject(value) || value[\"__v_skip\"]) {\n    return value;\n  }\n  if (depth && depth > 0) {\n    if (currentDepth >= depth) {\n      return value;\n    }\n    currentDepth++;\n  }\n  seen = seen || /* @__PURE__ */ new Set();\n  if (seen.has(value)) {\n    return value;\n  }\n  seen.add(value);\n  if (isRef(value)) {\n    traverse(value.value, depth, currentDepth, seen);\n  } else if (isArray(value)) {\n    for (let i = 0; i < value.length; i++) {\n      traverse(value[i], depth, currentDepth, seen);\n    }\n  } else if (isSet(value) || isMap(value)) {\n    value.forEach((v) => {\n      traverse(v, depth, currentDepth, seen);\n    });\n  } else if (isPlainObject(value)) {\n    for (const key in value) {\n      traverse(value[key], depth, currentDepth, seen);\n    }\n  }\n  return value;\n}\n\nfunction validateDirectiveName(name) {\n  if (isBuiltInDirective(name)) {\n    warn$1(\"Do not use built-in directive ids as custom directive id: \" + name);\n  }\n}\nfunction withDirectives(vnode, directives) {\n  if (currentRenderingInstance === null) {\n    !!(process.env.NODE_ENV !== \"production\") && warn$1(`withDirectives can only be used inside render functions.`);\n    return vnode;\n  }\n  const instance = getExposeProxy(currentRenderingInstance) || currentRenderingInstance.proxy;\n  const bindings = vnode.dirs || (vnode.dirs = []);\n  for (let i = 0; i < directives.length; i++) {\n    let [dir, value, arg, modifiers = EMPTY_OBJ] = directives[i];\n    if (dir) {\n      if (isFunction(dir)) {\n        dir = {\n          mounted: dir,\n          updated: dir\n        };\n      }\n      if (dir.deep) {\n        traverse(value);\n      }\n      bindings.push({\n        dir,\n        instance,\n        value,\n        oldValue: void 0,\n        arg,\n        modifiers\n      });\n    }\n  }\n  return vnode;\n}\nfunction invokeDirectiveHook(vnode, prevVNode, instance, name) {\n  const bindings = vnode.dirs;\n  const oldBindings = prevVNode && prevVNode.dirs;\n  for (let i = 0; i < bindings.length; i++) {\n    const binding = bindings[i];\n    if (oldBindings) {\n      binding.oldValue = oldBindings[i].value;\n    }\n    let hook = binding.dir[name];\n    if (hook) {\n      pauseTracking();\n      callWithAsyncErrorHandling(hook, instance, 8, [\n        vnode.el,\n        binding,\n        vnode,\n        prevVNode\n      ]);\n      resetTracking();\n    }\n  }\n}\n\nconst leaveCbKey = Symbol(\"_leaveCb\");\nconst enterCbKey = Symbol(\"_enterCb\");\nfunction useTransitionState() {\n  const state = {\n    isMounted: false,\n    isLeaving: false,\n    isUnmounting: false,\n    leavingVNodes: /* @__PURE__ */ new Map()\n  };\n  onMounted(() => {\n    state.isMounted = true;\n  });\n  onBeforeUnmount(() => {\n    state.isUnmounting = true;\n  });\n  return state;\n}\nconst TransitionHookValidator = [Function, Array];\nconst BaseTransitionPropsValidators = {\n  mode: String,\n  appear: Boolean,\n  persisted: Boolean,\n  // enter\n  onBeforeEnter: TransitionHookValidator,\n  onEnter: TransitionHookValidator,\n  onAfterEnter: TransitionHookValidator,\n  onEnterCancelled: TransitionHookValidator,\n  // leave\n  onBeforeLeave: TransitionHookValidator,\n  onLeave: TransitionHookValidator,\n  onAfterLeave: TransitionHookValidator,\n  onLeaveCancelled: TransitionHookValidator,\n  // appear\n  onBeforeAppear: TransitionHookValidator,\n  onAppear: TransitionHookValidator,\n  onAfterAppear: TransitionHookValidator,\n  onAppearCancelled: TransitionHookValidator\n};\nconst BaseTransitionImpl = {\n  name: `BaseTransition`,\n  props: BaseTransitionPropsValidators,\n  setup(props, { slots }) {\n    const instance = getCurrentInstance();\n    const state = useTransitionState();\n    let prevTransitionKey;\n    return () => {\n      const children = slots.default && getTransitionRawChildren(slots.default(), true);\n      if (!children || !children.length) {\n        return;\n      }\n      let child = children[0];\n      if (children.length > 1) {\n        let hasFound = false;\n        for (const c of children) {\n          if (c.type !== Comment) {\n            if (!!(process.env.NODE_ENV !== \"production\") && hasFound) {\n              warn$1(\n                \"<transition> can only be used on a single element or component. Use <transition-group> for lists.\"\n              );\n              break;\n            }\n            child = c;\n            hasFound = true;\n            if (!!!(process.env.NODE_ENV !== \"production\"))\n              break;\n          }\n        }\n      }\n      const rawProps = toRaw(props);\n      const { mode } = rawProps;\n      if (!!(process.env.NODE_ENV !== \"production\") && mode && mode !== \"in-out\" && mode !== \"out-in\" && mode !== \"default\") {\n        warn$1(`invalid <transition> mode: ${mode}`);\n      }\n      if (state.isLeaving) {\n        return emptyPlaceholder(child);\n      }\n      const innerChild = getKeepAliveChild(child);\n      if (!innerChild) {\n        return emptyPlaceholder(child);\n      }\n      const enterHooks = resolveTransitionHooks(\n        innerChild,\n        rawProps,\n        state,\n        instance\n      );\n      setTransitionHooks(innerChild, enterHooks);\n      const oldChild = instance.subTree;\n      const oldInnerChild = oldChild && getKeepAliveChild(oldChild);\n      let transitionKeyChanged = false;\n      const { getTransitionKey } = innerChild.type;\n      if (getTransitionKey) {\n        const key = getTransitionKey();\n        if (prevTransitionKey === void 0) {\n          prevTransitionKey = key;\n        } else if (key !== prevTransitionKey) {\n          prevTransitionKey = key;\n          transitionKeyChanged = true;\n        }\n      }\n      if (oldInnerChild && oldInnerChild.type !== Comment && (!isSameVNodeType(innerChild, oldInnerChild) || transitionKeyChanged)) {\n        const leavingHooks = resolveTransitionHooks(\n          oldInnerChild,\n          rawProps,\n          state,\n          instance\n        );\n        setTransitionHooks(oldInnerChild, leavingHooks);\n        if (mode === \"out-in\") {\n          state.isLeaving = true;\n          leavingHooks.afterLeave = () => {\n            state.isLeaving = false;\n            if (instance.update.active !== false) {\n              instance.effect.dirty = true;\n              instance.update();\n            }\n          };\n          return emptyPlaceholder(child);\n        } else if (mode === \"in-out\" && innerChild.type !== Comment) {\n          leavingHooks.delayLeave = (el, earlyRemove, delayedLeave) => {\n            const leavingVNodesCache = getLeavingNodesForType(\n              state,\n              oldInnerChild\n            );\n            leavingVNodesCache[String(oldInnerChild.key)] = oldInnerChild;\n            el[leaveCbKey] = () => {\n              earlyRemove();\n              el[leaveCbKey] = void 0;\n              delete enterHooks.delayedLeave;\n            };\n            enterHooks.delayedLeave = delayedLeave;\n          };\n        }\n      }\n      return child;\n    };\n  }\n};\nconst BaseTransition = BaseTransitionImpl;\nfunction getLeavingNodesForType(state, vnode) {\n  const { leavingVNodes } = state;\n  let leavingVNodesCache = leavingVNodes.get(vnode.type);\n  if (!leavingVNodesCache) {\n    leavingVNodesCache = /* @__PURE__ */ Object.create(null);\n    leavingVNodes.set(vnode.type, leavingVNodesCache);\n  }\n  return leavingVNodesCache;\n}\nfunction resolveTransitionHooks(vnode, props, state, instance) {\n  const {\n    appear,\n    mode,\n    persisted = false,\n    onBeforeEnter,\n    onEnter,\n    onAfterEnter,\n    onEnterCancelled,\n    onBeforeLeave,\n    onLeave,\n    onAfterLeave,\n    onLeaveCancelled,\n    onBeforeAppear,\n    onAppear,\n    onAfterAppear,\n    onAppearCancelled\n  } = props;\n  const key = String(vnode.key);\n  const leavingVNodesCache = getLeavingNodesForType(state, vnode);\n  const callHook = (hook, args) => {\n    hook && callWithAsyncErrorHandling(\n      hook,\n      instance,\n      9,\n      args\n    );\n  };\n  const callAsyncHook = (hook, args) => {\n    const done = args[1];\n    callHook(hook, args);\n    if (isArray(hook)) {\n      if (hook.every((hook2) => hook2.length <= 1))\n        done();\n    } else if (hook.length <= 1) {\n      done();\n    }\n  };\n  const hooks = {\n    mode,\n    persisted,\n    beforeEnter(el) {\n      let hook = onBeforeEnter;\n      if (!state.isMounted) {\n        if (appear) {\n          hook = onBeforeAppear || onBeforeEnter;\n        } else {\n          return;\n        }\n      }\n      if (el[leaveCbKey]) {\n        el[leaveCbKey](\n          true\n          /* cancelled */\n        );\n      }\n      const leavingVNode = leavingVNodesCache[key];\n      if (leavingVNode && isSameVNodeType(vnode, leavingVNode) && leavingVNode.el[leaveCbKey]) {\n        leavingVNode.el[leaveCbKey]();\n      }\n      callHook(hook, [el]);\n    },\n    enter(el) {\n      let hook = onEnter;\n      let afterHook = onAfterEnter;\n      let cancelHook = onEnterCancelled;\n      if (!state.isMounted) {\n        if (appear) {\n          hook = onAppear || onEnter;\n          afterHook = onAfterAppear || onAfterEnter;\n          cancelHook = onAppearCancelled || onEnterCancelled;\n        } else {\n          return;\n        }\n      }\n      let called = false;\n      const done = el[enterCbKey] = (cancelled) => {\n        if (called)\n          return;\n        called = true;\n        if (cancelled) {\n          callHook(cancelHook, [el]);\n        } else {\n          callHook(afterHook, [el]);\n        }\n        if (hooks.delayedLeave) {\n          hooks.delayedLeave();\n        }\n        el[enterCbKey] = void 0;\n      };\n      if (hook) {\n        callAsyncHook(hook, [el, done]);\n      } else {\n        done();\n      }\n    },\n    leave(el, remove) {\n      const key2 = String(vnode.key);\n      if (el[enterCbKey]) {\n        el[enterCbKey](\n          true\n          /* cancelled */\n        );\n      }\n      if (state.isUnmounting) {\n        return remove();\n      }\n      callHook(onBeforeLeave, [el]);\n      let called = false;\n      const done = el[leaveCbKey] = (cancelled) => {\n        if (called)\n          return;\n        called = true;\n        remove();\n        if (cancelled) {\n          callHook(onLeaveCancelled, [el]);\n        } else {\n          callHook(onAfterLeave, [el]);\n        }\n        el[leaveCbKey] = void 0;\n        if (leavingVNodesCache[key2] === vnode) {\n          delete leavingVNodesCache[key2];\n        }\n      };\n      leavingVNodesCache[key2] = vnode;\n      if (onLeave) {\n        callAsyncHook(onLeave, [el, done]);\n      } else {\n        done();\n      }\n    },\n    clone(vnode2) {\n      return resolveTransitionHooks(vnode2, props, state, instance);\n    }\n  };\n  return hooks;\n}\nfunction emptyPlaceholder(vnode) {\n  if (isKeepAlive(vnode)) {\n    vnode = cloneVNode(vnode);\n    vnode.children = null;\n    return vnode;\n  }\n}\nfunction getKeepAliveChild(vnode) {\n  return isKeepAlive(vnode) ? (\n    // #7121 ensure get the child component subtree in case\n    // it's been replaced during HMR\n    !!(process.env.NODE_ENV !== \"production\") && vnode.component ? vnode.component.subTree : vnode.children ? vnode.children[0] : void 0\n  ) : vnode;\n}\nfunction setTransitionHooks(vnode, hooks) {\n  if (vnode.shapeFlag & 6 && vnode.component) {\n    setTransitionHooks(vnode.component.subTree, hooks);\n  } else if (vnode.shapeFlag & 128) {\n    vnode.ssContent.transition = hooks.clone(vnode.ssContent);\n    vnode.ssFallback.transition = hooks.clone(vnode.ssFallback);\n  } else {\n    vnode.transition = hooks;\n  }\n}\nfunction getTransitionRawChildren(children, keepComment = false, parentKey) {\n  let ret = [];\n  let keyedFragmentCount = 0;\n  for (let i = 0; i < children.length; i++) {\n    let child = children[i];\n    const key = parentKey == null ? child.key : String(parentKey) + String(child.key != null ? child.key : i);\n    if (child.type === Fragment) {\n      if (child.patchFlag & 128)\n        keyedFragmentCount++;\n      ret = ret.concat(\n        getTransitionRawChildren(child.children, keepComment, key)\n      );\n    } else if (keepComment || child.type !== Comment) {\n      ret.push(key != null ? cloneVNode(child, { key }) : child);\n    }\n  }\n  if (keyedFragmentCount > 1) {\n    for (let i = 0; i < ret.length; i++) {\n      ret[i].patchFlag = -2;\n    }\n  }\n  return ret;\n}\n\n/*! #__NO_SIDE_EFFECTS__ */\n// @__NO_SIDE_EFFECTS__\nfunction defineComponent(options, extraOptions) {\n  return isFunction(options) ? (\n    // #8326: extend call and options.name access are considered side-effects\n    // by Rollup, so we have to wrap it in a pure-annotated IIFE.\n    /* @__PURE__ */ (() => extend({ name: options.name }, extraOptions, { setup: options }))()\n  ) : options;\n}\n\nconst isAsyncWrapper = (i) => !!i.type.__asyncLoader;\n/*! #__NO_SIDE_EFFECTS__ */\n// @__NO_SIDE_EFFECTS__\nfunction defineAsyncComponent(source) {\n  if (isFunction(source)) {\n    source = { loader: source };\n  }\n  const {\n    loader,\n    loadingComponent,\n    errorComponent,\n    delay = 200,\n    timeout,\n    // undefined = never times out\n    suspensible = true,\n    onError: userOnError\n  } = source;\n  let pendingRequest = null;\n  let resolvedComp;\n  let retries = 0;\n  const retry = () => {\n    retries++;\n    pendingRequest = null;\n    return load();\n  };\n  const load = () => {\n    let thisRequest;\n    return pendingRequest || (thisRequest = pendingRequest = loader().catch((err) => {\n      err = err instanceof Error ? err : new Error(String(err));\n      if (userOnError) {\n        return new Promise((resolve, reject) => {\n          const userRetry = () => resolve(retry());\n          const userFail = () => reject(err);\n          userOnError(err, userRetry, userFail, retries + 1);\n        });\n      } else {\n        throw err;\n      }\n    }).then((comp) => {\n      if (thisRequest !== pendingRequest && pendingRequest) {\n        return pendingRequest;\n      }\n      if (!!(process.env.NODE_ENV !== \"production\") && !comp) {\n        warn$1(\n          `Async component loader resolved to undefined. If you are using retry(), make sure to return its return value.`\n        );\n      }\n      if (comp && (comp.__esModule || comp[Symbol.toStringTag] === \"Module\")) {\n        comp = comp.default;\n      }\n      if (!!(process.env.NODE_ENV !== \"production\") && comp && !isObject(comp) && !isFunction(comp)) {\n        throw new Error(`Invalid async component load result: ${comp}`);\n      }\n      resolvedComp = comp;\n      return comp;\n    }));\n  };\n  return defineComponent({\n    name: \"AsyncComponentWrapper\",\n    __asyncLoader: load,\n    get __asyncResolved() {\n      return resolvedComp;\n    },\n    setup() {\n      const instance = currentInstance;\n      if (resolvedComp) {\n        return () => createInnerComp(resolvedComp, instance);\n      }\n      const onError = (err) => {\n        pendingRequest = null;\n        handleError(\n          err,\n          instance,\n          13,\n          !errorComponent\n        );\n      };\n      if (suspensible && instance.suspense || isInSSRComponentSetup) {\n        return load().then((comp) => {\n          return () => createInnerComp(comp, instance);\n        }).catch((err) => {\n          onError(err);\n          return () => errorComponent ? createVNode(errorComponent, {\n            error: err\n          }) : null;\n        });\n      }\n      const loaded = ref(false);\n      const error = ref();\n      const delayed = ref(!!delay);\n      if (delay) {\n        setTimeout(() => {\n          delayed.value = false;\n        }, delay);\n      }\n      if (timeout != null) {\n        setTimeout(() => {\n          if (!loaded.value && !error.value) {\n            const err = new Error(\n              `Async component timed out after ${timeout}ms.`\n            );\n            onError(err);\n            error.value = err;\n          }\n        }, timeout);\n      }\n      load().then(() => {\n        loaded.value = true;\n        if (instance.parent && isKeepAlive(instance.parent.vnode)) {\n          instance.parent.effect.dirty = true;\n          queueJob(instance.parent.update);\n        }\n      }).catch((err) => {\n        onError(err);\n        error.value = err;\n      });\n      return () => {\n        if (loaded.value && resolvedComp) {\n          return createInnerComp(resolvedComp, instance);\n        } else if (error.value && errorComponent) {\n          return createVNode(errorComponent, {\n            error: error.value\n          });\n        } else if (loadingComponent && !delayed.value) {\n          return createVNode(loadingComponent);\n        }\n      };\n    }\n  });\n}\nfunction createInnerComp(comp, parent) {\n  const { ref: ref2, props, children, ce } = parent.vnode;\n  const vnode = createVNode(comp, props, children);\n  vnode.ref = ref2;\n  vnode.ce = ce;\n  delete parent.vnode.ce;\n  return vnode;\n}\n\nconst isKeepAlive = (vnode) => vnode.type.__isKeepAlive;\nconst KeepAliveImpl = {\n  name: `KeepAlive`,\n  // Marker for special handling inside the renderer. We are not using a ===\n  // check directly on KeepAlive in the renderer, because importing it directly\n  // would prevent it from being tree-shaken.\n  __isKeepAlive: true,\n  props: {\n    include: [String, RegExp, Array],\n    exclude: [String, RegExp, Array],\n    max: [String, Number]\n  },\n  setup(props, { slots }) {\n    const instance = getCurrentInstance();\n    const sharedContext = instance.ctx;\n    if (!sharedContext.renderer) {\n      return () => {\n        const children = slots.default && slots.default();\n        return children && children.length === 1 ? children[0] : children;\n      };\n    }\n    const cache = /* @__PURE__ */ new Map();\n    const keys = /* @__PURE__ */ new Set();\n    let current = null;\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      instance.__v_cache = cache;\n    }\n    const parentSuspense = instance.suspense;\n    const {\n      renderer: {\n        p: patch,\n        m: move,\n        um: _unmount,\n        o: { createElement }\n      }\n    } = sharedContext;\n    const storageContainer = createElement(\"div\");\n    sharedContext.activate = (vnode, container, anchor, namespace, optimized) => {\n      const instance2 = vnode.component;\n      move(vnode, container, anchor, 0, parentSuspense);\n      patch(\n        instance2.vnode,\n        vnode,\n        container,\n        anchor,\n        instance2,\n        parentSuspense,\n        namespace,\n        vnode.slotScopeIds,\n        optimized\n      );\n      queuePostRenderEffect(() => {\n        instance2.isDeactivated = false;\n        if (instance2.a) {\n          invokeArrayFns(instance2.a);\n        }\n        const vnodeHook = vnode.props && vnode.props.onVnodeMounted;\n        if (vnodeHook) {\n          invokeVNodeHook(vnodeHook, instance2.parent, vnode);\n        }\n      }, parentSuspense);\n      if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n        devtoolsComponentAdded(instance2);\n      }\n    };\n    sharedContext.deactivate = (vnode) => {\n      const instance2 = vnode.component;\n      move(vnode, storageContainer, null, 1, parentSuspense);\n      queuePostRenderEffect(() => {\n        if (instance2.da) {\n          invokeArrayFns(instance2.da);\n        }\n        const vnodeHook = vnode.props && vnode.props.onVnodeUnmounted;\n        if (vnodeHook) {\n          invokeVNodeHook(vnodeHook, instance2.parent, vnode);\n        }\n        instance2.isDeactivated = true;\n      }, parentSuspense);\n      if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n        devtoolsComponentAdded(instance2);\n      }\n    };\n    function unmount(vnode) {\n      resetShapeFlag(vnode);\n      _unmount(vnode, instance, parentSuspense, true);\n    }\n    function pruneCache(filter) {\n      cache.forEach((vnode, key) => {\n        const name = getComponentName(vnode.type);\n        if (name && (!filter || !filter(name))) {\n          pruneCacheEntry(key);\n        }\n      });\n    }\n    function pruneCacheEntry(key) {\n      const cached = cache.get(key);\n      if (!current || !isSameVNodeType(cached, current)) {\n        unmount(cached);\n      } else if (current) {\n        resetShapeFlag(current);\n      }\n      cache.delete(key);\n      keys.delete(key);\n    }\n    watch(\n      () => [props.include, props.exclude],\n      ([include, exclude]) => {\n        include && pruneCache((name) => matches(include, name));\n        exclude && pruneCache((name) => !matches(exclude, name));\n      },\n      // prune post-render after `current` has been updated\n      { flush: \"post\", deep: true }\n    );\n    let pendingCacheKey = null;\n    const cacheSubtree = () => {\n      if (pendingCacheKey != null) {\n        cache.set(pendingCacheKey, getInnerChild(instance.subTree));\n      }\n    };\n    onMounted(cacheSubtree);\n    onUpdated(cacheSubtree);\n    onBeforeUnmount(() => {\n      cache.forEach((cached) => {\n        const { subTree, suspense } = instance;\n        const vnode = getInnerChild(subTree);\n        if (cached.type === vnode.type && cached.key === vnode.key) {\n          resetShapeFlag(vnode);\n          const da = vnode.component.da;\n          da && queuePostRenderEffect(da, suspense);\n          return;\n        }\n        unmount(cached);\n      });\n    });\n    return () => {\n      pendingCacheKey = null;\n      if (!slots.default) {\n        return null;\n      }\n      const children = slots.default();\n      const rawVNode = children[0];\n      if (children.length > 1) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(`KeepAlive should contain exactly one component child.`);\n        }\n        current = null;\n        return children;\n      } else if (!isVNode(rawVNode) || !(rawVNode.shapeFlag & 4) && !(rawVNode.shapeFlag & 128)) {\n        current = null;\n        return rawVNode;\n      }\n      let vnode = getInnerChild(rawVNode);\n      const comp = vnode.type;\n      const name = getComponentName(\n        isAsyncWrapper(vnode) ? vnode.type.__asyncResolved || {} : comp\n      );\n      const { include, exclude, max } = props;\n      if (include && (!name || !matches(include, name)) || exclude && name && matches(exclude, name)) {\n        current = vnode;\n        return rawVNode;\n      }\n      const key = vnode.key == null ? comp : vnode.key;\n      const cachedVNode = cache.get(key);\n      if (vnode.el) {\n        vnode = cloneVNode(vnode);\n        if (rawVNode.shapeFlag & 128) {\n          rawVNode.ssContent = vnode;\n        }\n      }\n      pendingCacheKey = key;\n      if (cachedVNode) {\n        vnode.el = cachedVNode.el;\n        vnode.component = cachedVNode.component;\n        if (vnode.transition) {\n          setTransitionHooks(vnode, vnode.transition);\n        }\n        vnode.shapeFlag |= 512;\n        keys.delete(key);\n        keys.add(key);\n      } else {\n        keys.add(key);\n        if (max && keys.size > parseInt(max, 10)) {\n          pruneCacheEntry(keys.values().next().value);\n        }\n      }\n      vnode.shapeFlag |= 256;\n      current = vnode;\n      return isSuspense(rawVNode.type) ? rawVNode : vnode;\n    };\n  }\n};\nconst KeepAlive = KeepAliveImpl;\nfunction matches(pattern, name) {\n  if (isArray(pattern)) {\n    return pattern.some((p) => matches(p, name));\n  } else if (isString(pattern)) {\n    return pattern.split(\",\").includes(name);\n  } else if (isRegExp(pattern)) {\n    return pattern.test(name);\n  }\n  return false;\n}\nfunction onActivated(hook, target) {\n  registerKeepAliveHook(hook, \"a\", target);\n}\nfunction onDeactivated(hook, target) {\n  registerKeepAliveHook(hook, \"da\", target);\n}\nfunction registerKeepAliveHook(hook, type, target = currentInstance) {\n  const wrappedHook = hook.__wdc || (hook.__wdc = () => {\n    let current = target;\n    while (current) {\n      if (current.isDeactivated) {\n        return;\n      }\n      current = current.parent;\n    }\n    return hook();\n  });\n  injectHook(type, wrappedHook, target);\n  if (target) {\n    let current = target.parent;\n    while (current && current.parent) {\n      if (isKeepAlive(current.parent.vnode)) {\n        injectToKeepAliveRoot(wrappedHook, type, target, current);\n      }\n      current = current.parent;\n    }\n  }\n}\nfunction injectToKeepAliveRoot(hook, type, target, keepAliveRoot) {\n  const injected = injectHook(\n    type,\n    hook,\n    keepAliveRoot,\n    true\n    /* prepend */\n  );\n  onUnmounted(() => {\n    remove(keepAliveRoot[type], injected);\n  }, target);\n}\nfunction resetShapeFlag(vnode) {\n  vnode.shapeFlag &= ~256;\n  vnode.shapeFlag &= ~512;\n}\nfunction getInnerChild(vnode) {\n  return vnode.shapeFlag & 128 ? vnode.ssContent : vnode;\n}\n\nfunction injectHook(type, hook, target = currentInstance, prepend = false) {\n  if (target) {\n    const hooks = target[type] || (target[type] = []);\n    const wrappedHook = hook.__weh || (hook.__weh = (...args) => {\n      if (target.isUnmounted) {\n        return;\n      }\n      pauseTracking();\n      const reset = setCurrentInstance(target);\n      const res = callWithAsyncErrorHandling(hook, target, type, args);\n      reset();\n      resetTracking();\n      return res;\n    });\n    if (prepend) {\n      hooks.unshift(wrappedHook);\n    } else {\n      hooks.push(wrappedHook);\n    }\n    return wrappedHook;\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    const apiName = toHandlerKey(ErrorTypeStrings$1[type].replace(/ hook$/, \"\"));\n    warn$1(\n      `${apiName} is called when there is no active component instance to be associated with. Lifecycle injection APIs can only be used during execution of setup().` + (` If you are using async setup(), make sure to register lifecycle hooks before the first await statement.` )\n    );\n  }\n}\nconst createHook = (lifecycle) => (hook, target = currentInstance) => (\n  // post-create lifecycle registrations are noops during SSR (except for serverPrefetch)\n  (!isInSSRComponentSetup || lifecycle === \"sp\") && injectHook(lifecycle, (...args) => hook(...args), target)\n);\nconst onBeforeMount = createHook(\"bm\");\nconst onMounted = createHook(\"m\");\nconst onBeforeUpdate = createHook(\"bu\");\nconst onUpdated = createHook(\"u\");\nconst onBeforeUnmount = createHook(\"bum\");\nconst onUnmounted = createHook(\"um\");\nconst onServerPrefetch = createHook(\"sp\");\nconst onRenderTriggered = createHook(\n  \"rtg\"\n);\nconst onRenderTracked = createHook(\n  \"rtc\"\n);\nfunction onErrorCaptured(hook, target = currentInstance) {\n  injectHook(\"ec\", hook, target);\n}\n\nfunction renderList(source, renderItem, cache, index) {\n  let ret;\n  const cached = cache && cache[index];\n  if (isArray(source) || isString(source)) {\n    ret = new Array(source.length);\n    for (let i = 0, l = source.length; i < l; i++) {\n      ret[i] = renderItem(source[i], i, void 0, cached && cached[i]);\n    }\n  } else if (typeof source === \"number\") {\n    if (!!(process.env.NODE_ENV !== \"production\") && !Number.isInteger(source)) {\n      warn$1(`The v-for range expect an integer value but got ${source}.`);\n    }\n    ret = new Array(source);\n    for (let i = 0; i < source; i++) {\n      ret[i] = renderItem(i + 1, i, void 0, cached && cached[i]);\n    }\n  } else if (isObject(source)) {\n    if (source[Symbol.iterator]) {\n      ret = Array.from(\n        source,\n        (item, i) => renderItem(item, i, void 0, cached && cached[i])\n      );\n    } else {\n      const keys = Object.keys(source);\n      ret = new Array(keys.length);\n      for (let i = 0, l = keys.length; i < l; i++) {\n        const key = keys[i];\n        ret[i] = renderItem(source[key], key, i, cached && cached[i]);\n      }\n    }\n  } else {\n    ret = [];\n  }\n  if (cache) {\n    cache[index] = ret;\n  }\n  return ret;\n}\n\nfunction createSlots(slots, dynamicSlots) {\n  for (let i = 0; i < dynamicSlots.length; i++) {\n    const slot = dynamicSlots[i];\n    if (isArray(slot)) {\n      for (let j = 0; j < slot.length; j++) {\n        slots[slot[j].name] = slot[j].fn;\n      }\n    } else if (slot) {\n      slots[slot.name] = slot.key ? (...args) => {\n        const res = slot.fn(...args);\n        if (res)\n          res.key = slot.key;\n        return res;\n      } : slot.fn;\n    }\n  }\n  return slots;\n}\n\nfunction renderSlot(slots, name, props = {}, fallback, noSlotted) {\n  if (currentRenderingInstance.isCE || currentRenderingInstance.parent && isAsyncWrapper(currentRenderingInstance.parent) && currentRenderingInstance.parent.isCE) {\n    if (name !== \"default\")\n      props.name = name;\n    return createVNode(\"slot\", props, fallback && fallback());\n  }\n  let slot = slots[name];\n  if (!!(process.env.NODE_ENV !== \"production\") && slot && slot.length > 1) {\n    warn$1(\n      `SSR-optimized slot function detected in a non-SSR-optimized render function. You need to mark this component with $dynamic-slots in the parent template.`\n    );\n    slot = () => [];\n  }\n  if (slot && slot._c) {\n    slot._d = false;\n  }\n  openBlock();\n  const validSlotContent = slot && ensureValidVNode(slot(props));\n  const rendered = createBlock(\n    Fragment,\n    {\n      key: props.key || // slot content array of a dynamic conditional slot may have a branch\n      // key attached in the `createSlots` helper, respect that\n      validSlotContent && validSlotContent.key || `_${name}`\n    },\n    validSlotContent || (fallback ? fallback() : []),\n    validSlotContent && slots._ === 1 ? 64 : -2\n  );\n  if (!noSlotted && rendered.scopeId) {\n    rendered.slotScopeIds = [rendered.scopeId + \"-s\"];\n  }\n  if (slot && slot._c) {\n    slot._d = true;\n  }\n  return rendered;\n}\nfunction ensureValidVNode(vnodes) {\n  return vnodes.some((child) => {\n    if (!isVNode(child))\n      return true;\n    if (child.type === Comment)\n      return false;\n    if (child.type === Fragment && !ensureValidVNode(child.children))\n      return false;\n    return true;\n  }) ? vnodes : null;\n}\n\nfunction toHandlers(obj, preserveCaseIfNecessary) {\n  const ret = {};\n  if (!!(process.env.NODE_ENV !== \"production\") && !isObject(obj)) {\n    warn$1(`v-on with no argument expects an object value.`);\n    return ret;\n  }\n  for (const key in obj) {\n    ret[preserveCaseIfNecessary && /[A-Z]/.test(key) ? `on:${key}` : toHandlerKey(key)] = obj[key];\n  }\n  return ret;\n}\n\nconst getPublicInstance = (i) => {\n  if (!i)\n    return null;\n  if (isStatefulComponent(i))\n    return getExposeProxy(i) || i.proxy;\n  return getPublicInstance(i.parent);\n};\nconst publicPropertiesMap = (\n  // Move PURE marker to new line to workaround compiler discarding it\n  // due to type annotation\n  /* @__PURE__ */ extend(/* @__PURE__ */ Object.create(null), {\n    $: (i) => i,\n    $el: (i) => i.vnode.el,\n    $data: (i) => i.data,\n    $props: (i) => !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(i.props) : i.props,\n    $attrs: (i) => !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(i.attrs) : i.attrs,\n    $slots: (i) => !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(i.slots) : i.slots,\n    $refs: (i) => !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(i.refs) : i.refs,\n    $parent: (i) => getPublicInstance(i.parent),\n    $root: (i) => getPublicInstance(i.root),\n    $emit: (i) => i.emit,\n    $options: (i) => __VUE_OPTIONS_API__ ? resolveMergedOptions(i) : i.type,\n    $forceUpdate: (i) => i.f || (i.f = () => {\n      i.effect.dirty = true;\n      queueJob(i.update);\n    }),\n    $nextTick: (i) => i.n || (i.n = nextTick.bind(i.proxy)),\n    $watch: (i) => __VUE_OPTIONS_API__ ? instanceWatch.bind(i) : NOOP\n  })\n);\nconst isReservedPrefix = (key) => key === \"_\" || key === \"$\";\nconst hasSetupBinding = (state, key) => state !== EMPTY_OBJ && !state.__isScriptSetup && hasOwn(state, key);\nconst PublicInstanceProxyHandlers = {\n  get({ _: instance }, key) {\n    const { ctx, setupState, data, props, accessCache, type, appContext } = instance;\n    if (!!(process.env.NODE_ENV !== \"production\") && key === \"__isVue\") {\n      return true;\n    }\n    let normalizedProps;\n    if (key[0] !== \"$\") {\n      const n = accessCache[key];\n      if (n !== void 0) {\n        switch (n) {\n          case 1 /* SETUP */:\n            return setupState[key];\n          case 2 /* DATA */:\n            return data[key];\n          case 4 /* CONTEXT */:\n            return ctx[key];\n          case 3 /* PROPS */:\n            return props[key];\n        }\n      } else if (hasSetupBinding(setupState, key)) {\n        accessCache[key] = 1 /* SETUP */;\n        return setupState[key];\n      } else if (data !== EMPTY_OBJ && hasOwn(data, key)) {\n        accessCache[key] = 2 /* DATA */;\n        return data[key];\n      } else if (\n        // only cache other properties when instance has declared (thus stable)\n        // props\n        (normalizedProps = instance.propsOptions[0]) && hasOwn(normalizedProps, key)\n      ) {\n        accessCache[key] = 3 /* PROPS */;\n        return props[key];\n      } else if (ctx !== EMPTY_OBJ && hasOwn(ctx, key)) {\n        accessCache[key] = 4 /* CONTEXT */;\n        return ctx[key];\n      } else if (!__VUE_OPTIONS_API__ || shouldCacheAccess) {\n        accessCache[key] = 0 /* OTHER */;\n      }\n    }\n    const publicGetter = publicPropertiesMap[key];\n    let cssModule, globalProperties;\n    if (publicGetter) {\n      if (key === \"$attrs\") {\n        track(instance, \"get\", key);\n        !!(process.env.NODE_ENV !== \"production\") && markAttrsAccessed();\n      } else if (!!(process.env.NODE_ENV !== \"production\") && key === \"$slots\") {\n        track(instance, \"get\", key);\n      }\n      return publicGetter(instance);\n    } else if (\n      // css module (injected by vue-loader)\n      (cssModule = type.__cssModules) && (cssModule = cssModule[key])\n    ) {\n      return cssModule;\n    } else if (ctx !== EMPTY_OBJ && hasOwn(ctx, key)) {\n      accessCache[key] = 4 /* CONTEXT */;\n      return ctx[key];\n    } else if (\n      // global properties\n      globalProperties = appContext.config.globalProperties, hasOwn(globalProperties, key)\n    ) {\n      {\n        return globalProperties[key];\n      }\n    } else if (!!(process.env.NODE_ENV !== \"production\") && currentRenderingInstance && (!isString(key) || // #1091 avoid internal isRef/isVNode checks on component instance leading\n    // to infinite warning loop\n    key.indexOf(\"__v\") !== 0)) {\n      if (data !== EMPTY_OBJ && isReservedPrefix(key[0]) && hasOwn(data, key)) {\n        warn$1(\n          `Property ${JSON.stringify(\n            key\n          )} must be accessed via $data because it starts with a reserved character (\"$\" or \"_\") and is not proxied on the render context.`\n        );\n      } else if (instance === currentRenderingInstance) {\n        warn$1(\n          `Property ${JSON.stringify(key)} was accessed during render but is not defined on instance.`\n        );\n      }\n    }\n  },\n  set({ _: instance }, key, value) {\n    const { data, setupState, ctx } = instance;\n    if (hasSetupBinding(setupState, key)) {\n      setupState[key] = value;\n      return true;\n    } else if (!!(process.env.NODE_ENV !== \"production\") && setupState.__isScriptSetup && hasOwn(setupState, key)) {\n      warn$1(`Cannot mutate <script setup> binding \"${key}\" from Options API.`);\n      return false;\n    } else if (data !== EMPTY_OBJ && hasOwn(data, key)) {\n      data[key] = value;\n      return true;\n    } else if (hasOwn(instance.props, key)) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(`Attempting to mutate prop \"${key}\". Props are readonly.`);\n      return false;\n    }\n    if (key[0] === \"$\" && key.slice(1) in instance) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(\n        `Attempting to mutate public property \"${key}\". Properties starting with $ are reserved and readonly.`\n      );\n      return false;\n    } else {\n      if (!!(process.env.NODE_ENV !== \"production\") && key in instance.appContext.config.globalProperties) {\n        Object.defineProperty(ctx, key, {\n          enumerable: true,\n          configurable: true,\n          value\n        });\n      } else {\n        ctx[key] = value;\n      }\n    }\n    return true;\n  },\n  has({\n    _: { data, setupState, accessCache, ctx, appContext, propsOptions }\n  }, key) {\n    let normalizedProps;\n    return !!accessCache[key] || data !== EMPTY_OBJ && hasOwn(data, key) || hasSetupBinding(setupState, key) || (normalizedProps = propsOptions[0]) && hasOwn(normalizedProps, key) || hasOwn(ctx, key) || hasOwn(publicPropertiesMap, key) || hasOwn(appContext.config.globalProperties, key);\n  },\n  defineProperty(target, key, descriptor) {\n    if (descriptor.get != null) {\n      target._.accessCache[key] = 0;\n    } else if (hasOwn(descriptor, \"value\")) {\n      this.set(target, key, descriptor.value, null);\n    }\n    return Reflect.defineProperty(target, key, descriptor);\n  }\n};\nif (!!(process.env.NODE_ENV !== \"production\") && true) {\n  PublicInstanceProxyHandlers.ownKeys = (target) => {\n    warn$1(\n      `Avoid app logic that relies on enumerating keys on a component instance. The keys will be empty in production mode to avoid performance overhead.`\n    );\n    return Reflect.ownKeys(target);\n  };\n}\nconst RuntimeCompiledPublicInstanceProxyHandlers = /* @__PURE__ */ extend(\n  {},\n  PublicInstanceProxyHandlers,\n  {\n    get(target, key) {\n      if (key === Symbol.unscopables) {\n        return;\n      }\n      return PublicInstanceProxyHandlers.get(target, key, target);\n    },\n    has(_, key) {\n      const has = key[0] !== \"_\" && !isGloballyAllowed(key);\n      if (!!(process.env.NODE_ENV !== \"production\") && !has && PublicInstanceProxyHandlers.has(_, key)) {\n        warn$1(\n          `Property ${JSON.stringify(\n            key\n          )} should not start with _ which is a reserved prefix for Vue internals.`\n        );\n      }\n      return has;\n    }\n  }\n);\nfunction createDevRenderContext(instance) {\n  const target = {};\n  Object.defineProperty(target, `_`, {\n    configurable: true,\n    enumerable: false,\n    get: () => instance\n  });\n  Object.keys(publicPropertiesMap).forEach((key) => {\n    Object.defineProperty(target, key, {\n      configurable: true,\n      enumerable: false,\n      get: () => publicPropertiesMap[key](instance),\n      // intercepted by the proxy so no need for implementation,\n      // but needed to prevent set errors\n      set: NOOP\n    });\n  });\n  return target;\n}\nfunction exposePropsOnRenderContext(instance) {\n  const {\n    ctx,\n    propsOptions: [propsOptions]\n  } = instance;\n  if (propsOptions) {\n    Object.keys(propsOptions).forEach((key) => {\n      Object.defineProperty(ctx, key, {\n        enumerable: true,\n        configurable: true,\n        get: () => instance.props[key],\n        set: NOOP\n      });\n    });\n  }\n}\nfunction exposeSetupStateOnRenderContext(instance) {\n  const { ctx, setupState } = instance;\n  Object.keys(toRaw(setupState)).forEach((key) => {\n    if (!setupState.__isScriptSetup) {\n      if (isReservedPrefix(key[0])) {\n        warn$1(\n          `setup() return property ${JSON.stringify(\n            key\n          )} should not start with \"$\" or \"_\" which are reserved prefixes for Vue internals.`\n        );\n        return;\n      }\n      Object.defineProperty(ctx, key, {\n        enumerable: true,\n        configurable: true,\n        get: () => setupState[key],\n        set: NOOP\n      });\n    }\n  });\n}\n\nconst warnRuntimeUsage = (method) => warn$1(\n  `${method}() is a compiler-hint helper that is only usable inside <script setup> of a single file component. Its arguments should be compiled away and passing it at runtime has no effect.`\n);\nfunction defineProps() {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`defineProps`);\n  }\n  return null;\n}\nfunction defineEmits() {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`defineEmits`);\n  }\n  return null;\n}\nfunction defineExpose(exposed) {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`defineExpose`);\n  }\n}\nfunction defineOptions(options) {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`defineOptions`);\n  }\n}\nfunction defineSlots() {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`defineSlots`);\n  }\n  return null;\n}\nfunction defineModel() {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(\"defineModel\");\n  }\n}\nfunction withDefaults(props, defaults) {\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    warnRuntimeUsage(`withDefaults`);\n  }\n  return null;\n}\nfunction useSlots() {\n  return getContext().slots;\n}\nfunction useAttrs() {\n  return getContext().attrs;\n}\nfunction getContext() {\n  const i = getCurrentInstance();\n  if (!!(process.env.NODE_ENV !== \"production\") && !i) {\n    warn$1(`useContext() called without active instance.`);\n  }\n  return i.setupContext || (i.setupContext = createSetupContext(i));\n}\nfunction normalizePropsOrEmits(props) {\n  return isArray(props) ? props.reduce(\n    (normalized, p) => (normalized[p] = null, normalized),\n    {}\n  ) : props;\n}\nfunction mergeDefaults(raw, defaults) {\n  const props = normalizePropsOrEmits(raw);\n  for (const key in defaults) {\n    if (key.startsWith(\"__skip\"))\n      continue;\n    let opt = props[key];\n    if (opt) {\n      if (isArray(opt) || isFunction(opt)) {\n        opt = props[key] = { type: opt, default: defaults[key] };\n      } else {\n        opt.default = defaults[key];\n      }\n    } else if (opt === null) {\n      opt = props[key] = { default: defaults[key] };\n    } else if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn$1(`props default key \"${key}\" has no corresponding declaration.`);\n    }\n    if (opt && defaults[`__skip_${key}`]) {\n      opt.skipFactory = true;\n    }\n  }\n  return props;\n}\nfunction mergeModels(a, b) {\n  if (!a || !b)\n    return a || b;\n  if (isArray(a) && isArray(b))\n    return a.concat(b);\n  return extend({}, normalizePropsOrEmits(a), normalizePropsOrEmits(b));\n}\nfunction createPropsRestProxy(props, excludedKeys) {\n  const ret = {};\n  for (const key in props) {\n    if (!excludedKeys.includes(key)) {\n      Object.defineProperty(ret, key, {\n        enumerable: true,\n        get: () => props[key]\n      });\n    }\n  }\n  return ret;\n}\nfunction withAsyncContext(getAwaitable) {\n  const ctx = getCurrentInstance();\n  if (!!(process.env.NODE_ENV !== \"production\") && !ctx) {\n    warn$1(\n      `withAsyncContext called without active current instance. This is likely a bug.`\n    );\n  }\n  let awaitable = getAwaitable();\n  unsetCurrentInstance();\n  if (isPromise(awaitable)) {\n    awaitable = awaitable.catch((e) => {\n      setCurrentInstance(ctx);\n      throw e;\n    });\n  }\n  return [awaitable, () => setCurrentInstance(ctx)];\n}\n\nfunction createDuplicateChecker() {\n  const cache = /* @__PURE__ */ Object.create(null);\n  return (type, key) => {\n    if (cache[key]) {\n      warn$1(`${type} property \"${key}\" is already defined in ${cache[key]}.`);\n    } else {\n      cache[key] = type;\n    }\n  };\n}\nlet shouldCacheAccess = true;\nfunction applyOptions(instance) {\n  const options = resolveMergedOptions(instance);\n  const publicThis = instance.proxy;\n  const ctx = instance.ctx;\n  shouldCacheAccess = false;\n  if (options.beforeCreate) {\n    callHook(options.beforeCreate, instance, \"bc\");\n  }\n  const {\n    // state\n    data: dataOptions,\n    computed: computedOptions,\n    methods,\n    watch: watchOptions,\n    provide: provideOptions,\n    inject: injectOptions,\n    // lifecycle\n    created,\n    beforeMount,\n    mounted,\n    beforeUpdate,\n    updated,\n    activated,\n    deactivated,\n    beforeDestroy,\n    beforeUnmount,\n    destroyed,\n    unmounted,\n    render,\n    renderTracked,\n    renderTriggered,\n    errorCaptured,\n    serverPrefetch,\n    // public API\n    expose,\n    inheritAttrs,\n    // assets\n    components,\n    directives,\n    filters\n  } = options;\n  const checkDuplicateProperties = !!(process.env.NODE_ENV !== \"production\") ? createDuplicateChecker() : null;\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    const [propsOptions] = instance.propsOptions;\n    if (propsOptions) {\n      for (const key in propsOptions) {\n        checkDuplicateProperties(\"Props\" /* PROPS */, key);\n      }\n    }\n  }\n  if (injectOptions) {\n    resolveInjections(injectOptions, ctx, checkDuplicateProperties);\n  }\n  if (methods) {\n    for (const key in methods) {\n      const methodHandler = methods[key];\n      if (isFunction(methodHandler)) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          Object.defineProperty(ctx, key, {\n            value: methodHandler.bind(publicThis),\n            configurable: true,\n            enumerable: true,\n            writable: true\n          });\n        } else {\n          ctx[key] = methodHandler.bind(publicThis);\n        }\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          checkDuplicateProperties(\"Methods\" /* METHODS */, key);\n        }\n      } else if (!!(process.env.NODE_ENV !== \"production\")) {\n        warn$1(\n          `Method \"${key}\" has type \"${typeof methodHandler}\" in the component definition. Did you reference the function correctly?`\n        );\n      }\n    }\n  }\n  if (dataOptions) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !isFunction(dataOptions)) {\n      warn$1(\n        `The data option must be a function. Plain object usage is no longer supported.`\n      );\n    }\n    const data = dataOptions.call(publicThis, publicThis);\n    if (!!(process.env.NODE_ENV !== \"production\") && isPromise(data)) {\n      warn$1(\n        `data() returned a Promise - note data() cannot be async; If you intend to perform data fetching before component renders, use async setup() + <Suspense>.`\n      );\n    }\n    if (!isObject(data)) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(`data() should return an object.`);\n    } else {\n      instance.data = reactive(data);\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        for (const key in data) {\n          checkDuplicateProperties(\"Data\" /* DATA */, key);\n          if (!isReservedPrefix(key[0])) {\n            Object.defineProperty(ctx, key, {\n              configurable: true,\n              enumerable: true,\n              get: () => data[key],\n              set: NOOP\n            });\n          }\n        }\n      }\n    }\n  }\n  shouldCacheAccess = true;\n  if (computedOptions) {\n    for (const key in computedOptions) {\n      const opt = computedOptions[key];\n      const get = isFunction(opt) ? opt.bind(publicThis, publicThis) : isFunction(opt.get) ? opt.get.bind(publicThis, publicThis) : NOOP;\n      if (!!(process.env.NODE_ENV !== \"production\") && get === NOOP) {\n        warn$1(`Computed property \"${key}\" has no getter.`);\n      }\n      const set = !isFunction(opt) && isFunction(opt.set) ? opt.set.bind(publicThis) : !!(process.env.NODE_ENV !== \"production\") ? () => {\n        warn$1(\n          `Write operation failed: computed property \"${key}\" is readonly.`\n        );\n      } : NOOP;\n      const c = computed({\n        get,\n        set\n      });\n      Object.defineProperty(ctx, key, {\n        enumerable: true,\n        configurable: true,\n        get: () => c.value,\n        set: (v) => c.value = v\n      });\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        checkDuplicateProperties(\"Computed\" /* COMPUTED */, key);\n      }\n    }\n  }\n  if (watchOptions) {\n    for (const key in watchOptions) {\n      createWatcher(watchOptions[key], ctx, publicThis, key);\n    }\n  }\n  if (provideOptions) {\n    const provides = isFunction(provideOptions) ? provideOptions.call(publicThis) : provideOptions;\n    Reflect.ownKeys(provides).forEach((key) => {\n      provide(key, provides[key]);\n    });\n  }\n  if (created) {\n    callHook(created, instance, \"c\");\n  }\n  function registerLifecycleHook(register, hook) {\n    if (isArray(hook)) {\n      hook.forEach((_hook) => register(_hook.bind(publicThis)));\n    } else if (hook) {\n      register(hook.bind(publicThis));\n    }\n  }\n  registerLifecycleHook(onBeforeMount, beforeMount);\n  registerLifecycleHook(onMounted, mounted);\n  registerLifecycleHook(onBeforeUpdate, beforeUpdate);\n  registerLifecycleHook(onUpdated, updated);\n  registerLifecycleHook(onActivated, activated);\n  registerLifecycleHook(onDeactivated, deactivated);\n  registerLifecycleHook(onErrorCaptured, errorCaptured);\n  registerLifecycleHook(onRenderTracked, renderTracked);\n  registerLifecycleHook(onRenderTriggered, renderTriggered);\n  registerLifecycleHook(onBeforeUnmount, beforeUnmount);\n  registerLifecycleHook(onUnmounted, unmounted);\n  registerLifecycleHook(onServerPrefetch, serverPrefetch);\n  if (isArray(expose)) {\n    if (expose.length) {\n      const exposed = instance.exposed || (instance.exposed = {});\n      expose.forEach((key) => {\n        Object.defineProperty(exposed, key, {\n          get: () => publicThis[key],\n          set: (val) => publicThis[key] = val\n        });\n      });\n    } else if (!instance.exposed) {\n      instance.exposed = {};\n    }\n  }\n  if (render && instance.render === NOOP) {\n    instance.render = render;\n  }\n  if (inheritAttrs != null) {\n    instance.inheritAttrs = inheritAttrs;\n  }\n  if (components)\n    instance.components = components;\n  if (directives)\n    instance.directives = directives;\n}\nfunction resolveInjections(injectOptions, ctx, checkDuplicateProperties = NOOP) {\n  if (isArray(injectOptions)) {\n    injectOptions = normalizeInject(injectOptions);\n  }\n  for (const key in injectOptions) {\n    const opt = injectOptions[key];\n    let injected;\n    if (isObject(opt)) {\n      if (\"default\" in opt) {\n        injected = inject(\n          opt.from || key,\n          opt.default,\n          true\n        );\n      } else {\n        injected = inject(opt.from || key);\n      }\n    } else {\n      injected = inject(opt);\n    }\n    if (isRef(injected)) {\n      Object.defineProperty(ctx, key, {\n        enumerable: true,\n        configurable: true,\n        get: () => injected.value,\n        set: (v) => injected.value = v\n      });\n    } else {\n      ctx[key] = injected;\n    }\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      checkDuplicateProperties(\"Inject\" /* INJECT */, key);\n    }\n  }\n}\nfunction callHook(hook, instance, type) {\n  callWithAsyncErrorHandling(\n    isArray(hook) ? hook.map((h) => h.bind(instance.proxy)) : hook.bind(instance.proxy),\n    instance,\n    type\n  );\n}\nfunction createWatcher(raw, ctx, publicThis, key) {\n  const getter = key.includes(\".\") ? createPathGetter(publicThis, key) : () => publicThis[key];\n  if (isString(raw)) {\n    const handler = ctx[raw];\n    if (isFunction(handler)) {\n      watch(getter, handler);\n    } else if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn$1(`Invalid watch handler specified by key \"${raw}\"`, handler);\n    }\n  } else if (isFunction(raw)) {\n    watch(getter, raw.bind(publicThis));\n  } else if (isObject(raw)) {\n    if (isArray(raw)) {\n      raw.forEach((r) => createWatcher(r, ctx, publicThis, key));\n    } else {\n      const handler = isFunction(raw.handler) ? raw.handler.bind(publicThis) : ctx[raw.handler];\n      if (isFunction(handler)) {\n        watch(getter, handler, raw);\n      } else if (!!(process.env.NODE_ENV !== \"production\")) {\n        warn$1(`Invalid watch handler specified by key \"${raw.handler}\"`, handler);\n      }\n    }\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    warn$1(`Invalid watch option: \"${key}\"`, raw);\n  }\n}\nfunction resolveMergedOptions(instance) {\n  const base = instance.type;\n  const { mixins, extends: extendsOptions } = base;\n  const {\n    mixins: globalMixins,\n    optionsCache: cache,\n    config: { optionMergeStrategies }\n  } = instance.appContext;\n  const cached = cache.get(base);\n  let resolved;\n  if (cached) {\n    resolved = cached;\n  } else if (!globalMixins.length && !mixins && !extendsOptions) {\n    {\n      resolved = base;\n    }\n  } else {\n    resolved = {};\n    if (globalMixins.length) {\n      globalMixins.forEach(\n        (m) => mergeOptions(resolved, m, optionMergeStrategies, true)\n      );\n    }\n    mergeOptions(resolved, base, optionMergeStrategies);\n  }\n  if (isObject(base)) {\n    cache.set(base, resolved);\n  }\n  return resolved;\n}\nfunction mergeOptions(to, from, strats, asMixin = false) {\n  const { mixins, extends: extendsOptions } = from;\n  if (extendsOptions) {\n    mergeOptions(to, extendsOptions, strats, true);\n  }\n  if (mixins) {\n    mixins.forEach(\n      (m) => mergeOptions(to, m, strats, true)\n    );\n  }\n  for (const key in from) {\n    if (asMixin && key === \"expose\") {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(\n        `\"expose\" option is ignored when declared in mixins or extends. It should only be declared in the base component itself.`\n      );\n    } else {\n      const strat = internalOptionMergeStrats[key] || strats && strats[key];\n      to[key] = strat ? strat(to[key], from[key]) : from[key];\n    }\n  }\n  return to;\n}\nconst internalOptionMergeStrats = {\n  data: mergeDataFn,\n  props: mergeEmitsOrPropsOptions,\n  emits: mergeEmitsOrPropsOptions,\n  // objects\n  methods: mergeObjectOptions,\n  computed: mergeObjectOptions,\n  // lifecycle\n  beforeCreate: mergeAsArray,\n  created: mergeAsArray,\n  beforeMount: mergeAsArray,\n  mounted: mergeAsArray,\n  beforeUpdate: mergeAsArray,\n  updated: mergeAsArray,\n  beforeDestroy: mergeAsArray,\n  beforeUnmount: mergeAsArray,\n  destroyed: mergeAsArray,\n  unmounted: mergeAsArray,\n  activated: mergeAsArray,\n  deactivated: mergeAsArray,\n  errorCaptured: mergeAsArray,\n  serverPrefetch: mergeAsArray,\n  // assets\n  components: mergeObjectOptions,\n  directives: mergeObjectOptions,\n  // watch\n  watch: mergeWatchOptions,\n  // provide / inject\n  provide: mergeDataFn,\n  inject: mergeInject\n};\nfunction mergeDataFn(to, from) {\n  if (!from) {\n    return to;\n  }\n  if (!to) {\n    return from;\n  }\n  return function mergedDataFn() {\n    return (extend)(\n      isFunction(to) ? to.call(this, this) : to,\n      isFunction(from) ? from.call(this, this) : from\n    );\n  };\n}\nfunction mergeInject(to, from) {\n  return mergeObjectOptions(normalizeInject(to), normalizeInject(from));\n}\nfunction normalizeInject(raw) {\n  if (isArray(raw)) {\n    const res = {};\n    for (let i = 0; i < raw.length; i++) {\n      res[raw[i]] = raw[i];\n    }\n    return res;\n  }\n  return raw;\n}\nfunction mergeAsArray(to, from) {\n  return to ? [...new Set([].concat(to, from))] : from;\n}\nfunction mergeObjectOptions(to, from) {\n  return to ? extend(/* @__PURE__ */ Object.create(null), to, from) : from;\n}\nfunction mergeEmitsOrPropsOptions(to, from) {\n  if (to) {\n    if (isArray(to) && isArray(from)) {\n      return [.../* @__PURE__ */ new Set([...to, ...from])];\n    }\n    return extend(\n      /* @__PURE__ */ Object.create(null),\n      normalizePropsOrEmits(to),\n      normalizePropsOrEmits(from != null ? from : {})\n    );\n  } else {\n    return from;\n  }\n}\nfunction mergeWatchOptions(to, from) {\n  if (!to)\n    return from;\n  if (!from)\n    return to;\n  const merged = extend(/* @__PURE__ */ Object.create(null), to);\n  for (const key in from) {\n    merged[key] = mergeAsArray(to[key], from[key]);\n  }\n  return merged;\n}\n\nfunction createAppContext() {\n  return {\n    app: null,\n    config: {\n      isNativeTag: NO,\n      performance: false,\n      globalProperties: {},\n      optionMergeStrategies: {},\n      errorHandler: void 0,\n      warnHandler: void 0,\n      compilerOptions: {}\n    },\n    mixins: [],\n    components: {},\n    directives: {},\n    provides: /* @__PURE__ */ Object.create(null),\n    optionsCache: /* @__PURE__ */ new WeakMap(),\n    propsCache: /* @__PURE__ */ new WeakMap(),\n    emitsCache: /* @__PURE__ */ new WeakMap()\n  };\n}\nlet uid$1 = 0;\nfunction createAppAPI(render, hydrate) {\n  return function createApp(rootComponent, rootProps = null) {\n    if (!isFunction(rootComponent)) {\n      rootComponent = extend({}, rootComponent);\n    }\n    if (rootProps != null && !isObject(rootProps)) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(`root props passed to app.mount() must be an object.`);\n      rootProps = null;\n    }\n    const context = createAppContext();\n    const installedPlugins = /* @__PURE__ */ new WeakSet();\n    let isMounted = false;\n    const app = context.app = {\n      _uid: uid$1++,\n      _component: rootComponent,\n      _props: rootProps,\n      _container: null,\n      _context: context,\n      _instance: null,\n      version,\n      get config() {\n        return context.config;\n      },\n      set config(v) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\n            `app.config cannot be replaced. Modify individual options instead.`\n          );\n        }\n      },\n      use(plugin, ...options) {\n        if (installedPlugins.has(plugin)) {\n          !!(process.env.NODE_ENV !== \"production\") && warn$1(`Plugin has already been applied to target app.`);\n        } else if (plugin && isFunction(plugin.install)) {\n          installedPlugins.add(plugin);\n          plugin.install(app, ...options);\n        } else if (isFunction(plugin)) {\n          installedPlugins.add(plugin);\n          plugin(app, ...options);\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\n            `A plugin must either be a function or an object with an \"install\" function.`\n          );\n        }\n        return app;\n      },\n      mixin(mixin) {\n        if (__VUE_OPTIONS_API__) {\n          if (!context.mixins.includes(mixin)) {\n            context.mixins.push(mixin);\n          } else if (!!(process.env.NODE_ENV !== \"production\")) {\n            warn$1(\n              \"Mixin has already been applied to target app\" + (mixin.name ? `: ${mixin.name}` : \"\")\n            );\n          }\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\"Mixins are only available in builds supporting Options API\");\n        }\n        return app;\n      },\n      component(name, component) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          validateComponentName(name, context.config);\n        }\n        if (!component) {\n          return context.components[name];\n        }\n        if (!!(process.env.NODE_ENV !== \"production\") && context.components[name]) {\n          warn$1(`Component \"${name}\" has already been registered in target app.`);\n        }\n        context.components[name] = component;\n        return app;\n      },\n      directive(name, directive) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          validateDirectiveName(name);\n        }\n        if (!directive) {\n          return context.directives[name];\n        }\n        if (!!(process.env.NODE_ENV !== \"production\") && context.directives[name]) {\n          warn$1(`Directive \"${name}\" has already been registered in target app.`);\n        }\n        context.directives[name] = directive;\n        return app;\n      },\n      mount(rootContainer, isHydrate, namespace) {\n        if (!isMounted) {\n          if (!!(process.env.NODE_ENV !== \"production\") && rootContainer.__vue_app__) {\n            warn$1(\n              `There is already an app instance mounted on the host container.\n If you want to mount another app on the same host container, you need to unmount the previous app by calling \\`app.unmount()\\` first.`\n            );\n          }\n          const vnode = createVNode(rootComponent, rootProps);\n          vnode.appContext = context;\n          if (namespace === true) {\n            namespace = \"svg\";\n          } else if (namespace === false) {\n            namespace = void 0;\n          }\n          if (!!(process.env.NODE_ENV !== \"production\")) {\n            context.reload = () => {\n              render(\n                cloneVNode(vnode),\n                rootContainer,\n                namespace\n              );\n            };\n          }\n          if (isHydrate && hydrate) {\n            hydrate(vnode, rootContainer);\n          } else {\n            render(vnode, rootContainer, namespace);\n          }\n          isMounted = true;\n          app._container = rootContainer;\n          rootContainer.__vue_app__ = app;\n          if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n            app._instance = vnode.component;\n            devtoolsInitApp(app, version);\n          }\n          return getExposeProxy(vnode.component) || vnode.component.proxy;\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\n            `App has already been mounted.\nIf you want to remount the same app, move your app creation logic into a factory function and create fresh app instances for each mount - e.g. \\`const createMyApp = () => createApp(App)\\``\n          );\n        }\n      },\n      unmount() {\n        if (isMounted) {\n          render(null, app._container);\n          if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n            app._instance = null;\n            devtoolsUnmountApp(app);\n          }\n          delete app._container.__vue_app__;\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(`Cannot unmount an app that is not mounted.`);\n        }\n      },\n      provide(key, value) {\n        if (!!(process.env.NODE_ENV !== \"production\") && key in context.provides) {\n          warn$1(\n            `App already provides property with key \"${String(key)}\". It will be overwritten with the new value.`\n          );\n        }\n        context.provides[key] = value;\n        return app;\n      },\n      runWithContext(fn) {\n        currentApp = app;\n        try {\n          return fn();\n        } finally {\n          currentApp = null;\n        }\n      }\n    };\n    return app;\n  };\n}\nlet currentApp = null;\n\nfunction provide(key, value) {\n  if (!currentInstance) {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn$1(`provide() can only be used inside setup().`);\n    }\n  } else {\n    let provides = currentInstance.provides;\n    const parentProvides = currentInstance.parent && currentInstance.parent.provides;\n    if (parentProvides === provides) {\n      provides = currentInstance.provides = Object.create(parentProvides);\n    }\n    provides[key] = value;\n  }\n}\nfunction inject(key, defaultValue, treatDefaultAsFactory = false) {\n  const instance = currentInstance || currentRenderingInstance;\n  if (instance || currentApp) {\n    const provides = instance ? instance.parent == null ? instance.vnode.appContext && instance.vnode.appContext.provides : instance.parent.provides : currentApp._context.provides;\n    if (provides && key in provides) {\n      return provides[key];\n    } else if (arguments.length > 1) {\n      return treatDefaultAsFactory && isFunction(defaultValue) ? defaultValue.call(instance && instance.proxy) : defaultValue;\n    } else if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn$1(`injection \"${String(key)}\" not found.`);\n    }\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    warn$1(`inject() can only be used inside setup() or functional components.`);\n  }\n}\nfunction hasInjectionContext() {\n  return !!(currentInstance || currentRenderingInstance || currentApp);\n}\n\nfunction initProps(instance, rawProps, isStateful, isSSR = false) {\n  const props = {};\n  const attrs = {};\n  def(attrs, InternalObjectKey, 1);\n  instance.propsDefaults = /* @__PURE__ */ Object.create(null);\n  setFullProps(instance, rawProps, props, attrs);\n  for (const key in instance.propsOptions[0]) {\n    if (!(key in props)) {\n      props[key] = void 0;\n    }\n  }\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    validateProps(rawProps || {}, props, instance);\n  }\n  if (isStateful) {\n    instance.props = isSSR ? props : shallowReactive(props);\n  } else {\n    if (!instance.type.props) {\n      instance.props = attrs;\n    } else {\n      instance.props = props;\n    }\n  }\n  instance.attrs = attrs;\n}\nfunction isInHmrContext(instance) {\n  while (instance) {\n    if (instance.type.__hmrId)\n      return true;\n    instance = instance.parent;\n  }\n}\nfunction updateProps(instance, rawProps, rawPrevProps, optimized) {\n  const {\n    props,\n    attrs,\n    vnode: { patchFlag }\n  } = instance;\n  const rawCurrentProps = toRaw(props);\n  const [options] = instance.propsOptions;\n  let hasAttrsChanged = false;\n  if (\n    // always force full diff in dev\n    // - #1942 if hmr is enabled with sfc component\n    // - vite#872 non-sfc component used by sfc component\n    !(!!(process.env.NODE_ENV !== \"production\") && isInHmrContext(instance)) && (optimized || patchFlag > 0) && !(patchFlag & 16)\n  ) {\n    if (patchFlag & 8) {\n      const propsToUpdate = instance.vnode.dynamicProps;\n      for (let i = 0; i < propsToUpdate.length; i++) {\n        let key = propsToUpdate[i];\n        if (isEmitListener(instance.emitsOptions, key)) {\n          continue;\n        }\n        const value = rawProps[key];\n        if (options) {\n          if (hasOwn(attrs, key)) {\n            if (value !== attrs[key]) {\n              attrs[key] = value;\n              hasAttrsChanged = true;\n            }\n          } else {\n            const camelizedKey = camelize(key);\n            props[camelizedKey] = resolvePropValue(\n              options,\n              rawCurrentProps,\n              camelizedKey,\n              value,\n              instance,\n              false\n            );\n          }\n        } else {\n          if (value !== attrs[key]) {\n            attrs[key] = value;\n            hasAttrsChanged = true;\n          }\n        }\n      }\n    }\n  } else {\n    if (setFullProps(instance, rawProps, props, attrs)) {\n      hasAttrsChanged = true;\n    }\n    let kebabKey;\n    for (const key in rawCurrentProps) {\n      if (!rawProps || // for camelCase\n      !hasOwn(rawProps, key) && // it's possible the original props was passed in as kebab-case\n      // and converted to camelCase (#955)\n      ((kebabKey = hyphenate(key)) === key || !hasOwn(rawProps, kebabKey))) {\n        if (options) {\n          if (rawPrevProps && // for camelCase\n          (rawPrevProps[key] !== void 0 || // for kebab-case\n          rawPrevProps[kebabKey] !== void 0)) {\n            props[key] = resolvePropValue(\n              options,\n              rawCurrentProps,\n              key,\n              void 0,\n              instance,\n              true\n            );\n          }\n        } else {\n          delete props[key];\n        }\n      }\n    }\n    if (attrs !== rawCurrentProps) {\n      for (const key in attrs) {\n        if (!rawProps || !hasOwn(rawProps, key) && true) {\n          delete attrs[key];\n          hasAttrsChanged = true;\n        }\n      }\n    }\n  }\n  if (hasAttrsChanged) {\n    trigger(instance, \"set\", \"$attrs\");\n  }\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    validateProps(rawProps || {}, props, instance);\n  }\n}\nfunction setFullProps(instance, rawProps, props, attrs) {\n  const [options, needCastKeys] = instance.propsOptions;\n  let hasAttrsChanged = false;\n  let rawCastValues;\n  if (rawProps) {\n    for (let key in rawProps) {\n      if (isReservedProp(key)) {\n        continue;\n      }\n      const value = rawProps[key];\n      let camelKey;\n      if (options && hasOwn(options, camelKey = camelize(key))) {\n        if (!needCastKeys || !needCastKeys.includes(camelKey)) {\n          props[camelKey] = value;\n        } else {\n          (rawCastValues || (rawCastValues = {}))[camelKey] = value;\n        }\n      } else if (!isEmitListener(instance.emitsOptions, key)) {\n        if (!(key in attrs) || value !== attrs[key]) {\n          attrs[key] = value;\n          hasAttrsChanged = true;\n        }\n      }\n    }\n  }\n  if (needCastKeys) {\n    const rawCurrentProps = toRaw(props);\n    const castValues = rawCastValues || EMPTY_OBJ;\n    for (let i = 0; i < needCastKeys.length; i++) {\n      const key = needCastKeys[i];\n      props[key] = resolvePropValue(\n        options,\n        rawCurrentProps,\n        key,\n        castValues[key],\n        instance,\n        !hasOwn(castValues, key)\n      );\n    }\n  }\n  return hasAttrsChanged;\n}\nfunction resolvePropValue(options, props, key, value, instance, isAbsent) {\n  const opt = options[key];\n  if (opt != null) {\n    const hasDefault = hasOwn(opt, \"default\");\n    if (hasDefault && value === void 0) {\n      const defaultValue = opt.default;\n      if (opt.type !== Function && !opt.skipFactory && isFunction(defaultValue)) {\n        const { propsDefaults } = instance;\n        if (key in propsDefaults) {\n          value = propsDefaults[key];\n        } else {\n          const reset = setCurrentInstance(instance);\n          value = propsDefaults[key] = defaultValue.call(\n            null,\n            props\n          );\n          reset();\n        }\n      } else {\n        value = defaultValue;\n      }\n    }\n    if (opt[0 /* shouldCast */]) {\n      if (isAbsent && !hasDefault) {\n        value = false;\n      } else if (opt[1 /* shouldCastTrue */] && (value === \"\" || value === hyphenate(key))) {\n        value = true;\n      }\n    }\n  }\n  return value;\n}\nfunction normalizePropsOptions(comp, appContext, asMixin = false) {\n  const cache = appContext.propsCache;\n  const cached = cache.get(comp);\n  if (cached) {\n    return cached;\n  }\n  const raw = comp.props;\n  const normalized = {};\n  const needCastKeys = [];\n  let hasExtends = false;\n  if (__VUE_OPTIONS_API__ && !isFunction(comp)) {\n    const extendProps = (raw2) => {\n      hasExtends = true;\n      const [props, keys] = normalizePropsOptions(raw2, appContext, true);\n      extend(normalized, props);\n      if (keys)\n        needCastKeys.push(...keys);\n    };\n    if (!asMixin && appContext.mixins.length) {\n      appContext.mixins.forEach(extendProps);\n    }\n    if (comp.extends) {\n      extendProps(comp.extends);\n    }\n    if (comp.mixins) {\n      comp.mixins.forEach(extendProps);\n    }\n  }\n  if (!raw && !hasExtends) {\n    if (isObject(comp)) {\n      cache.set(comp, EMPTY_ARR);\n    }\n    return EMPTY_ARR;\n  }\n  if (isArray(raw)) {\n    for (let i = 0; i < raw.length; i++) {\n      if (!!(process.env.NODE_ENV !== \"production\") && !isString(raw[i])) {\n        warn$1(`props must be strings when using array syntax.`, raw[i]);\n      }\n      const normalizedKey = camelize(raw[i]);\n      if (validatePropName(normalizedKey)) {\n        normalized[normalizedKey] = EMPTY_OBJ;\n      }\n    }\n  } else if (raw) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !isObject(raw)) {\n      warn$1(`invalid props options`, raw);\n    }\n    for (const key in raw) {\n      const normalizedKey = camelize(key);\n      if (validatePropName(normalizedKey)) {\n        const opt = raw[key];\n        const prop = normalized[normalizedKey] = isArray(opt) || isFunction(opt) ? { type: opt } : extend({}, opt);\n        if (prop) {\n          const booleanIndex = getTypeIndex(Boolean, prop.type);\n          const stringIndex = getTypeIndex(String, prop.type);\n          prop[0 /* shouldCast */] = booleanIndex > -1;\n          prop[1 /* shouldCastTrue */] = stringIndex < 0 || booleanIndex < stringIndex;\n          if (booleanIndex > -1 || hasOwn(prop, \"default\")) {\n            needCastKeys.push(normalizedKey);\n          }\n        }\n      }\n    }\n  }\n  const res = [normalized, needCastKeys];\n  if (isObject(comp)) {\n    cache.set(comp, res);\n  }\n  return res;\n}\nfunction validatePropName(key) {\n  if (key[0] !== \"$\") {\n    return true;\n  } else if (!!(process.env.NODE_ENV !== \"production\")) {\n    warn$1(`Invalid prop name: \"${key}\" is a reserved property.`);\n  }\n  return false;\n}\nfunction getType(ctor) {\n  const match = ctor && ctor.toString().match(/^\\s*(function|class) (\\w+)/);\n  return match ? match[2] : ctor === null ? \"null\" : \"\";\n}\nfunction isSameType(a, b) {\n  return getType(a) === getType(b);\n}\nfunction getTypeIndex(type, expectedTypes) {\n  if (isArray(expectedTypes)) {\n    return expectedTypes.findIndex((t) => isSameType(t, type));\n  } else if (isFunction(expectedTypes)) {\n    return isSameType(expectedTypes, type) ? 0 : -1;\n  }\n  return -1;\n}\nfunction validateProps(rawProps, props, instance) {\n  const resolvedValues = toRaw(props);\n  const options = instance.propsOptions[0];\n  for (const key in options) {\n    let opt = options[key];\n    if (opt == null)\n      continue;\n    validateProp(\n      key,\n      resolvedValues[key],\n      opt,\n      !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(resolvedValues) : resolvedValues,\n      !hasOwn(rawProps, key) && !hasOwn(rawProps, hyphenate(key))\n    );\n  }\n}\nfunction validateProp(name, value, prop, props, isAbsent) {\n  const { type, required, validator, skipCheck } = prop;\n  if (required && isAbsent) {\n    warn$1('Missing required prop: \"' + name + '\"');\n    return;\n  }\n  if (value == null && !required) {\n    return;\n  }\n  if (type != null && type !== true && !skipCheck) {\n    let isValid = false;\n    const types = isArray(type) ? type : [type];\n    const expectedTypes = [];\n    for (let i = 0; i < types.length && !isValid; i++) {\n      const { valid, expectedType } = assertType(value, types[i]);\n      expectedTypes.push(expectedType || \"\");\n      isValid = valid;\n    }\n    if (!isValid) {\n      warn$1(getInvalidTypeMessage(name, value, expectedTypes));\n      return;\n    }\n  }\n  if (validator && !validator(value, props)) {\n    warn$1('Invalid prop: custom validator check failed for prop \"' + name + '\".');\n  }\n}\nconst isSimpleType = /* @__PURE__ */ makeMap(\n  \"String,Number,Boolean,Function,Symbol,BigInt\"\n);\nfunction assertType(value, type) {\n  let valid;\n  const expectedType = getType(type);\n  if (isSimpleType(expectedType)) {\n    const t = typeof value;\n    valid = t === expectedType.toLowerCase();\n    if (!valid && t === \"object\") {\n      valid = value instanceof type;\n    }\n  } else if (expectedType === \"Object\") {\n    valid = isObject(value);\n  } else if (expectedType === \"Array\") {\n    valid = isArray(value);\n  } else if (expectedType === \"null\") {\n    valid = value === null;\n  } else {\n    valid = value instanceof type;\n  }\n  return {\n    valid,\n    expectedType\n  };\n}\nfunction getInvalidTypeMessage(name, value, expectedTypes) {\n  if (expectedTypes.length === 0) {\n    return `Prop type [] for prop \"${name}\" won't match anything. Did you mean to use type Array instead?`;\n  }\n  let message = `Invalid prop: type check failed for prop \"${name}\". Expected ${expectedTypes.map(capitalize).join(\" | \")}`;\n  const expectedType = expectedTypes[0];\n  const receivedType = toRawType(value);\n  const expectedValue = styleValue(value, expectedType);\n  const receivedValue = styleValue(value, receivedType);\n  if (expectedTypes.length === 1 && isExplicable(expectedType) && !isBoolean(expectedType, receivedType)) {\n    message += ` with value ${expectedValue}`;\n  }\n  message += `, got ${receivedType} `;\n  if (isExplicable(receivedType)) {\n    message += `with value ${receivedValue}.`;\n  }\n  return message;\n}\nfunction styleValue(value, type) {\n  if (type === \"String\") {\n    return `\"${value}\"`;\n  } else if (type === \"Number\") {\n    return `${Number(value)}`;\n  } else {\n    return `${value}`;\n  }\n}\nfunction isExplicable(type) {\n  const explicitTypes = [\"string\", \"number\", \"boolean\"];\n  return explicitTypes.some((elem) => type.toLowerCase() === elem);\n}\nfunction isBoolean(...args) {\n  return args.some((elem) => elem.toLowerCase() === \"boolean\");\n}\n\nconst isInternalKey = (key) => key[0] === \"_\" || key === \"$stable\";\nconst normalizeSlotValue = (value) => isArray(value) ? value.map(normalizeVNode) : [normalizeVNode(value)];\nconst normalizeSlot = (key, rawSlot, ctx) => {\n  if (rawSlot._n) {\n    return rawSlot;\n  }\n  const normalized = withCtx((...args) => {\n    if (!!(process.env.NODE_ENV !== \"production\") && currentInstance && (!ctx || ctx.root === currentInstance.root)) {\n      warn$1(\n        `Slot \"${key}\" invoked outside of the render function: this will not track dependencies used in the slot. Invoke the slot function inside the render function instead.`\n      );\n    }\n    return normalizeSlotValue(rawSlot(...args));\n  }, ctx);\n  normalized._c = false;\n  return normalized;\n};\nconst normalizeObjectSlots = (rawSlots, slots, instance) => {\n  const ctx = rawSlots._ctx;\n  for (const key in rawSlots) {\n    if (isInternalKey(key))\n      continue;\n    const value = rawSlots[key];\n    if (isFunction(value)) {\n      slots[key] = normalizeSlot(key, value, ctx);\n    } else if (value != null) {\n      if (!!(process.env.NODE_ENV !== \"production\") && true) {\n        warn$1(\n          `Non-function value encountered for slot \"${key}\". Prefer function slots for better performance.`\n        );\n      }\n      const normalized = normalizeSlotValue(value);\n      slots[key] = () => normalized;\n    }\n  }\n};\nconst normalizeVNodeSlots = (instance, children) => {\n  if (!!(process.env.NODE_ENV !== \"production\") && !isKeepAlive(instance.vnode) && true) {\n    warn$1(\n      `Non-function value encountered for default slot. Prefer function slots for better performance.`\n    );\n  }\n  const normalized = normalizeSlotValue(children);\n  instance.slots.default = () => normalized;\n};\nconst initSlots = (instance, children) => {\n  if (instance.vnode.shapeFlag & 32) {\n    const type = children._;\n    if (type) {\n      instance.slots = toRaw(children);\n      def(children, \"_\", type);\n    } else {\n      normalizeObjectSlots(\n        children,\n        instance.slots = {});\n    }\n  } else {\n    instance.slots = {};\n    if (children) {\n      normalizeVNodeSlots(instance, children);\n    }\n  }\n  def(instance.slots, InternalObjectKey, 1);\n};\nconst updateSlots = (instance, children, optimized) => {\n  const { vnode, slots } = instance;\n  let needDeletionCheck = true;\n  let deletionComparisonTarget = EMPTY_OBJ;\n  if (vnode.shapeFlag & 32) {\n    const type = children._;\n    if (type) {\n      if (!!(process.env.NODE_ENV !== \"production\") && isHmrUpdating) {\n        extend(slots, children);\n        trigger(instance, \"set\", \"$slots\");\n      } else if (optimized && type === 1) {\n        needDeletionCheck = false;\n      } else {\n        extend(slots, children);\n        if (!optimized && type === 1) {\n          delete slots._;\n        }\n      }\n    } else {\n      needDeletionCheck = !children.$stable;\n      normalizeObjectSlots(children, slots);\n    }\n    deletionComparisonTarget = children;\n  } else if (children) {\n    normalizeVNodeSlots(instance, children);\n    deletionComparisonTarget = { default: 1 };\n  }\n  if (needDeletionCheck) {\n    for (const key in slots) {\n      if (!isInternalKey(key) && deletionComparisonTarget[key] == null) {\n        delete slots[key];\n      }\n    }\n  }\n};\n\nfunction setRef(rawRef, oldRawRef, parentSuspense, vnode, isUnmount = false) {\n  if (isArray(rawRef)) {\n    rawRef.forEach(\n      (r, i) => setRef(\n        r,\n        oldRawRef && (isArray(oldRawRef) ? oldRawRef[i] : oldRawRef),\n        parentSuspense,\n        vnode,\n        isUnmount\n      )\n    );\n    return;\n  }\n  if (isAsyncWrapper(vnode) && !isUnmount) {\n    return;\n  }\n  const refValue = vnode.shapeFlag & 4 ? getExposeProxy(vnode.component) || vnode.component.proxy : vnode.el;\n  const value = isUnmount ? null : refValue;\n  const { i: owner, r: ref } = rawRef;\n  if (!!(process.env.NODE_ENV !== \"production\") && !owner) {\n    warn$1(\n      `Missing ref owner context. ref cannot be used on hoisted vnodes. A vnode with ref must be created inside the render function.`\n    );\n    return;\n  }\n  const oldRef = oldRawRef && oldRawRef.r;\n  const refs = owner.refs === EMPTY_OBJ ? owner.refs = {} : owner.refs;\n  const setupState = owner.setupState;\n  if (oldRef != null && oldRef !== ref) {\n    if (isString(oldRef)) {\n      refs[oldRef] = null;\n      if (hasOwn(setupState, oldRef)) {\n        setupState[oldRef] = null;\n      }\n    } else if (isRef(oldRef)) {\n      oldRef.value = null;\n    }\n  }\n  if (isFunction(ref)) {\n    callWithErrorHandling(ref, owner, 12, [value, refs]);\n  } else {\n    const _isString = isString(ref);\n    const _isRef = isRef(ref);\n    const isVFor = rawRef.f;\n    if (_isString || _isRef) {\n      const doSet = () => {\n        if (isVFor) {\n          const existing = _isString ? hasOwn(setupState, ref) ? setupState[ref] : refs[ref] : ref.value;\n          if (isUnmount) {\n            isArray(existing) && remove(existing, refValue);\n          } else {\n            if (!isArray(existing)) {\n              if (_isString) {\n                refs[ref] = [refValue];\n                if (hasOwn(setupState, ref)) {\n                  setupState[ref] = refs[ref];\n                }\n              } else {\n                ref.value = [refValue];\n                if (rawRef.k)\n                  refs[rawRef.k] = ref.value;\n              }\n            } else if (!existing.includes(refValue)) {\n              existing.push(refValue);\n            }\n          }\n        } else if (_isString) {\n          refs[ref] = value;\n          if (hasOwn(setupState, ref)) {\n            setupState[ref] = value;\n          }\n        } else if (_isRef) {\n          ref.value = value;\n          if (rawRef.k)\n            refs[rawRef.k] = value;\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\"Invalid template ref type:\", ref, `(${typeof ref})`);\n        }\n      };\n      if (isUnmount || isVFor) {\n        doSet();\n      } else {\n        doSet.id = -1;\n        queuePostRenderEffect(doSet, parentSuspense);\n      }\n    } else if (!!(process.env.NODE_ENV !== \"production\")) {\n      warn$1(\"Invalid template ref type:\", ref, `(${typeof ref})`);\n    }\n  }\n}\n\nlet hasMismatch = false;\nconst isSVGContainer = (container) => container.namespaceURI.includes(\"svg\") && container.tagName !== \"foreignObject\";\nconst isMathMLContainer = (container) => container.namespaceURI.includes(\"MathML\");\nconst getContainerType = (container) => {\n  if (isSVGContainer(container))\n    return \"svg\";\n  if (isMathMLContainer(container))\n    return \"mathml\";\n  return void 0;\n};\nconst isComment = (node) => node.nodeType === 8 /* COMMENT */;\nfunction createHydrationFunctions(rendererInternals) {\n  const {\n    mt: mountComponent,\n    p: patch,\n    o: {\n      patchProp,\n      createText,\n      nextSibling,\n      parentNode,\n      remove,\n      insert,\n      createComment\n    }\n  } = rendererInternals;\n  const hydrate = (vnode, container) => {\n    if (!container.hasChildNodes()) {\n      (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && warn$1(\n        `Attempting to hydrate existing markup but container is empty. Performing full mount instead.`\n      );\n      patch(null, vnode, container);\n      flushPostFlushCbs();\n      container._vnode = vnode;\n      return;\n    }\n    hasMismatch = false;\n    hydrateNode(container.firstChild, vnode, null, null, null);\n    flushPostFlushCbs();\n    container._vnode = vnode;\n    if (hasMismatch && true) {\n      console.error(`Hydration completed but contains mismatches.`);\n    }\n  };\n  const hydrateNode = (node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized = false) => {\n    const isFragmentStart = isComment(node) && node.data === \"[\";\n    const onMismatch = () => handleMismatch(\n      node,\n      vnode,\n      parentComponent,\n      parentSuspense,\n      slotScopeIds,\n      isFragmentStart\n    );\n    const { type, ref, shapeFlag, patchFlag } = vnode;\n    let domType = node.nodeType;\n    vnode.el = node;\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      if (!(\"__vnode\" in node)) {\n        Object.defineProperty(node, \"__vnode\", {\n          value: vnode,\n          enumerable: false\n        });\n      }\n      if (!(\"__vueParentComponent\" in node)) {\n        Object.defineProperty(node, \"__vueParentComponent\", {\n          value: parentComponent,\n          enumerable: false\n        });\n      }\n    }\n    if (patchFlag === -2) {\n      optimized = false;\n      vnode.dynamicChildren = null;\n    }\n    let nextNode = null;\n    switch (type) {\n      case Text:\n        if (domType !== 3 /* TEXT */) {\n          if (vnode.children === \"\") {\n            insert(vnode.el = createText(\"\"), parentNode(node), node);\n            nextNode = node;\n          } else {\n            nextNode = onMismatch();\n          }\n        } else {\n          if (node.data !== vnode.children) {\n            hasMismatch = true;\n            (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && warn$1(\n              `Hydration text mismatch in`,\n              node.parentNode,\n              `\n  - rendered on server: ${JSON.stringify(\n                node.data\n              )}\n  - expected on client: ${JSON.stringify(vnode.children)}`\n            );\n            node.data = vnode.children;\n          }\n          nextNode = nextSibling(node);\n        }\n        break;\n      case Comment:\n        if (isTemplateNode(node)) {\n          nextNode = nextSibling(node);\n          replaceNode(\n            vnode.el = node.content.firstChild,\n            node,\n            parentComponent\n          );\n        } else if (domType !== 8 /* COMMENT */ || isFragmentStart) {\n          nextNode = onMismatch();\n        } else {\n          nextNode = nextSibling(node);\n        }\n        break;\n      case Static:\n        if (isFragmentStart) {\n          node = nextSibling(node);\n          domType = node.nodeType;\n        }\n        if (domType === 1 /* ELEMENT */ || domType === 3 /* TEXT */) {\n          nextNode = node;\n          const needToAdoptContent = !vnode.children.length;\n          for (let i = 0; i < vnode.staticCount; i++) {\n            if (needToAdoptContent)\n              vnode.children += nextNode.nodeType === 1 /* ELEMENT */ ? nextNode.outerHTML : nextNode.data;\n            if (i === vnode.staticCount - 1) {\n              vnode.anchor = nextNode;\n            }\n            nextNode = nextSibling(nextNode);\n          }\n          return isFragmentStart ? nextSibling(nextNode) : nextNode;\n        } else {\n          onMismatch();\n        }\n        break;\n      case Fragment:\n        if (!isFragmentStart) {\n          nextNode = onMismatch();\n        } else {\n          nextNode = hydrateFragment(\n            node,\n            vnode,\n            parentComponent,\n            parentSuspense,\n            slotScopeIds,\n            optimized\n          );\n        }\n        break;\n      default:\n        if (shapeFlag & 1) {\n          if ((domType !== 1 /* ELEMENT */ || vnode.type.toLowerCase() !== node.tagName.toLowerCase()) && !isTemplateNode(node)) {\n            nextNode = onMismatch();\n          } else {\n            nextNode = hydrateElement(\n              node,\n              vnode,\n              parentComponent,\n              parentSuspense,\n              slotScopeIds,\n              optimized\n            );\n          }\n        } else if (shapeFlag & 6) {\n          vnode.slotScopeIds = slotScopeIds;\n          const container = parentNode(node);\n          if (isFragmentStart) {\n            nextNode = locateClosingAnchor(node);\n          } else if (isComment(node) && node.data === \"teleport start\") {\n            nextNode = locateClosingAnchor(node, node.data, \"teleport end\");\n          } else {\n            nextNode = nextSibling(node);\n          }\n          mountComponent(\n            vnode,\n            container,\n            null,\n            parentComponent,\n            parentSuspense,\n            getContainerType(container),\n            optimized\n          );\n          if (isAsyncWrapper(vnode)) {\n            let subTree;\n            if (isFragmentStart) {\n              subTree = createVNode(Fragment);\n              subTree.anchor = nextNode ? nextNode.previousSibling : container.lastChild;\n            } else {\n              subTree = node.nodeType === 3 ? createTextVNode(\"\") : createVNode(\"div\");\n            }\n            subTree.el = node;\n            vnode.component.subTree = subTree;\n          }\n        } else if (shapeFlag & 64) {\n          if (domType !== 8 /* COMMENT */) {\n            nextNode = onMismatch();\n          } else {\n            nextNode = vnode.type.hydrate(\n              node,\n              vnode,\n              parentComponent,\n              parentSuspense,\n              slotScopeIds,\n              optimized,\n              rendererInternals,\n              hydrateChildren\n            );\n          }\n        } else if (shapeFlag & 128) {\n          nextNode = vnode.type.hydrate(\n            node,\n            vnode,\n            parentComponent,\n            parentSuspense,\n            getContainerType(parentNode(node)),\n            slotScopeIds,\n            optimized,\n            rendererInternals,\n            hydrateNode\n          );\n        } else if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) {\n          warn$1(\"Invalid HostVNode type:\", type, `(${typeof type})`);\n        }\n    }\n    if (ref != null) {\n      setRef(ref, null, parentSuspense, vnode);\n    }\n    return nextNode;\n  };\n  const hydrateElement = (el, vnode, parentComponent, parentSuspense, slotScopeIds, optimized) => {\n    optimized = optimized || !!vnode.dynamicChildren;\n    const { type, props, patchFlag, shapeFlag, dirs, transition } = vnode;\n    const forcePatch = type === \"input\" || type === \"option\";\n    if (!!(process.env.NODE_ENV !== \"production\") || forcePatch || patchFlag !== -1) {\n      if (dirs) {\n        invokeDirectiveHook(vnode, null, parentComponent, \"created\");\n      }\n      let needCallTransitionHooks = false;\n      if (isTemplateNode(el)) {\n        needCallTransitionHooks = needTransition(parentSuspense, transition) && parentComponent && parentComponent.vnode.props && parentComponent.vnode.props.appear;\n        const content = el.content.firstChild;\n        if (needCallTransitionHooks) {\n          transition.beforeEnter(content);\n        }\n        replaceNode(content, el, parentComponent);\n        vnode.el = el = content;\n      }\n      if (shapeFlag & 16 && // skip if element has innerHTML / textContent\n      !(props && (props.innerHTML || props.textContent))) {\n        let next = hydrateChildren(\n          el.firstChild,\n          vnode,\n          el,\n          parentComponent,\n          parentSuspense,\n          slotScopeIds,\n          optimized\n        );\n        let hasWarned = false;\n        while (next) {\n          hasMismatch = true;\n          if ((!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && !hasWarned) {\n            warn$1(\n              `Hydration children mismatch on`,\n              el,\n              `\nServer rendered element contains more child nodes than client vdom.`\n            );\n            hasWarned = true;\n          }\n          const cur = next;\n          next = next.nextSibling;\n          remove(cur);\n        }\n      } else if (shapeFlag & 8) {\n        if (el.textContent !== vnode.children) {\n          hasMismatch = true;\n          (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && warn$1(\n            `Hydration text content mismatch on`,\n            el,\n            `\n  - rendered on server: ${el.textContent}\n  - expected on client: ${vnode.children}`\n          );\n          el.textContent = vnode.children;\n        }\n      }\n      if (props) {\n        if (!!(process.env.NODE_ENV !== \"production\") || forcePatch || !optimized || patchFlag & (16 | 32)) {\n          for (const key in props) {\n            if (!!(process.env.NODE_ENV !== \"production\") && propHasMismatch(el, key, props[key], vnode)) {\n              hasMismatch = true;\n            }\n            if (forcePatch && (key.endsWith(\"value\") || key === \"indeterminate\") || isOn(key) && !isReservedProp(key) || // force hydrate v-bind with .prop modifiers\n            key[0] === \".\") {\n              patchProp(\n                el,\n                key,\n                null,\n                props[key],\n                void 0,\n                void 0,\n                parentComponent\n              );\n            }\n          }\n        } else if (props.onClick) {\n          patchProp(\n            el,\n            \"onClick\",\n            null,\n            props.onClick,\n            void 0,\n            void 0,\n            parentComponent\n          );\n        }\n      }\n      let vnodeHooks;\n      if (vnodeHooks = props && props.onVnodeBeforeMount) {\n        invokeVNodeHook(vnodeHooks, parentComponent, vnode);\n      }\n      if (dirs) {\n        invokeDirectiveHook(vnode, null, parentComponent, \"beforeMount\");\n      }\n      if ((vnodeHooks = props && props.onVnodeMounted) || dirs || needCallTransitionHooks) {\n        queueEffectWithSuspense(() => {\n          vnodeHooks && invokeVNodeHook(vnodeHooks, parentComponent, vnode);\n          needCallTransitionHooks && transition.enter(el);\n          dirs && invokeDirectiveHook(vnode, null, parentComponent, \"mounted\");\n        }, parentSuspense);\n      }\n    }\n    return el.nextSibling;\n  };\n  const hydrateChildren = (node, parentVNode, container, parentComponent, parentSuspense, slotScopeIds, optimized) => {\n    optimized = optimized || !!parentVNode.dynamicChildren;\n    const children = parentVNode.children;\n    const l = children.length;\n    let hasWarned = false;\n    for (let i = 0; i < l; i++) {\n      const vnode = optimized ? children[i] : children[i] = normalizeVNode(children[i]);\n      if (node) {\n        node = hydrateNode(\n          node,\n          vnode,\n          parentComponent,\n          parentSuspense,\n          slotScopeIds,\n          optimized\n        );\n      } else if (vnode.type === Text && !vnode.children) {\n        continue;\n      } else {\n        hasMismatch = true;\n        if ((!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && !hasWarned) {\n          warn$1(\n            `Hydration children mismatch on`,\n            container,\n            `\nServer rendered element contains fewer child nodes than client vdom.`\n          );\n          hasWarned = true;\n        }\n        patch(\n          null,\n          vnode,\n          container,\n          null,\n          parentComponent,\n          parentSuspense,\n          getContainerType(container),\n          slotScopeIds\n        );\n      }\n    }\n    return node;\n  };\n  const hydrateFragment = (node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized) => {\n    const { slotScopeIds: fragmentSlotScopeIds } = vnode;\n    if (fragmentSlotScopeIds) {\n      slotScopeIds = slotScopeIds ? slotScopeIds.concat(fragmentSlotScopeIds) : fragmentSlotScopeIds;\n    }\n    const container = parentNode(node);\n    const next = hydrateChildren(\n      nextSibling(node),\n      vnode,\n      container,\n      parentComponent,\n      parentSuspense,\n      slotScopeIds,\n      optimized\n    );\n    if (next && isComment(next) && next.data === \"]\") {\n      return nextSibling(vnode.anchor = next);\n    } else {\n      hasMismatch = true;\n      insert(vnode.anchor = createComment(`]`), container, next);\n      return next;\n    }\n  };\n  const handleMismatch = (node, vnode, parentComponent, parentSuspense, slotScopeIds, isFragment) => {\n    hasMismatch = true;\n    (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_HYDRATION_MISMATCH_DETAILS__) && warn$1(\n      `Hydration node mismatch:\n- rendered on server:`,\n      node,\n      node.nodeType === 3 /* TEXT */ ? `(text)` : isComment(node) && node.data === \"[\" ? `(start of fragment)` : ``,\n      `\n- expected on client:`,\n      vnode.type\n    );\n    vnode.el = null;\n    if (isFragment) {\n      const end = locateClosingAnchor(node);\n      while (true) {\n        const next2 = nextSibling(node);\n        if (next2 && next2 !== end) {\n          remove(next2);\n        } else {\n          break;\n        }\n      }\n    }\n    const next = nextSibling(node);\n    const container = parentNode(node);\n    remove(node);\n    patch(\n      null,\n      vnode,\n      container,\n      next,\n      parentComponent,\n      parentSuspense,\n      getContainerType(container),\n      slotScopeIds\n    );\n    return next;\n  };\n  const locateClosingAnchor = (node, open = \"[\", close = \"]\") => {\n    let match = 0;\n    while (node) {\n      node = nextSibling(node);\n      if (node && isComment(node)) {\n        if (node.data === open)\n          match++;\n        if (node.data === close) {\n          if (match === 0) {\n            return nextSibling(node);\n          } else {\n            match--;\n          }\n        }\n      }\n    }\n    return node;\n  };\n  const replaceNode = (newNode, oldNode, parentComponent) => {\n    const parentNode2 = oldNode.parentNode;\n    if (parentNode2) {\n      parentNode2.replaceChild(newNode, oldNode);\n    }\n    let parent = parentComponent;\n    while (parent) {\n      if (parent.vnode.el === oldNode) {\n        parent.vnode.el = parent.subTree.el = newNode;\n      }\n      parent = parent.parent;\n    }\n  };\n  const isTemplateNode = (node) => {\n    return node.nodeType === 1 /* ELEMENT */ && node.tagName.toLowerCase() === \"template\";\n  };\n  return [hydrate, hydrateNode];\n}\nfunction propHasMismatch(el, key, clientValue, vnode) {\n  let mismatchType;\n  let mismatchKey;\n  let actual;\n  let expected;\n  if (key === \"class\") {\n    actual = el.getAttribute(\"class\");\n    expected = normalizeClass(clientValue);\n    if (!isSetEqual(toClassSet(actual || \"\"), toClassSet(expected))) {\n      mismatchType = mismatchKey = `class`;\n    }\n  } else if (key === \"style\") {\n    actual = el.getAttribute(\"style\");\n    expected = isString(clientValue) ? clientValue : stringifyStyle(normalizeStyle(clientValue));\n    const actualMap = toStyleMap(actual);\n    const expectedMap = toStyleMap(expected);\n    if (vnode.dirs) {\n      for (const { dir, value } of vnode.dirs) {\n        if (dir.name === \"show\" && !value) {\n          expectedMap.set(\"display\", \"none\");\n        }\n      }\n    }\n    if (!isMapEqual(actualMap, expectedMap)) {\n      mismatchType = mismatchKey = \"style\";\n    }\n  } else if (el instanceof SVGElement && isKnownSvgAttr(key) || el instanceof HTMLElement && (isBooleanAttr(key) || isKnownHtmlAttr(key))) {\n    if (isBooleanAttr(key)) {\n      actual = el.hasAttribute(key);\n      expected = includeBooleanAttr(clientValue);\n    } else if (clientValue == null) {\n      actual = el.hasAttribute(key);\n      expected = false;\n    } else {\n      if (el.hasAttribute(key)) {\n        actual = el.getAttribute(key);\n      } else if (key === \"value\" && el.tagName === \"TEXTAREA\") {\n        actual = el.value;\n      } else {\n        actual = false;\n      }\n      expected = isRenderableAttrValue(clientValue) ? String(clientValue) : false;\n    }\n    if (actual !== expected) {\n      mismatchType = `attribute`;\n      mismatchKey = key;\n    }\n  }\n  if (mismatchType) {\n    const format = (v) => v === false ? `(not rendered)` : `${mismatchKey}=\"${v}\"`;\n    const preSegment = `Hydration ${mismatchType} mismatch on`;\n    const postSegment = `\n  - rendered on server: ${format(actual)}\n  - expected on client: ${format(expected)}\n  Note: this mismatch is check-only. The DOM will not be rectified in production due to performance overhead.\n  You should fix the source of the mismatch.`;\n    {\n      warn$1(preSegment, el, postSegment);\n    }\n    return true;\n  }\n  return false;\n}\nfunction toClassSet(str) {\n  return new Set(str.trim().split(/\\s+/));\n}\nfunction isSetEqual(a, b) {\n  if (a.size !== b.size) {\n    return false;\n  }\n  for (const s of a) {\n    if (!b.has(s)) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction toStyleMap(str) {\n  const styleMap = /* @__PURE__ */ new Map();\n  for (const item of str.split(\";\")) {\n    let [key, value] = item.split(\":\");\n    key = key == null ? void 0 : key.trim();\n    value = value == null ? void 0 : value.trim();\n    if (key && value) {\n      styleMap.set(key, value);\n    }\n  }\n  return styleMap;\n}\nfunction isMapEqual(a, b) {\n  if (a.size !== b.size) {\n    return false;\n  }\n  for (const [key, value] of a) {\n    if (value !== b.get(key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nlet supported;\nlet perf;\nfunction startMeasure(instance, type) {\n  if (instance.appContext.config.performance && isSupported()) {\n    perf.mark(`vue-${type}-${instance.uid}`);\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n    devtoolsPerfStart(instance, type, isSupported() ? perf.now() : Date.now());\n  }\n}\nfunction endMeasure(instance, type) {\n  if (instance.appContext.config.performance && isSupported()) {\n    const startTag = `vue-${type}-${instance.uid}`;\n    const endTag = startTag + `:end`;\n    perf.mark(endTag);\n    perf.measure(\n      `<${formatComponentName(instance, instance.type)}> ${type}`,\n      startTag,\n      endTag\n    );\n    perf.clearMarks(startTag);\n    perf.clearMarks(endTag);\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n    devtoolsPerfEnd(instance, type, isSupported() ? perf.now() : Date.now());\n  }\n}\nfunction isSupported() {\n  if (supported !== void 0) {\n    return supported;\n  }\n  if (typeof window !== \"undefined\" && window.performance) {\n    supported = true;\n    perf = window.performance;\n  } else {\n    supported = false;\n  }\n  return supported;\n}\n\nfunction initFeatureFlags() {\n  const needWarn = [];\n  if (typeof __VUE_OPTIONS_API__ !== \"boolean\") {\n    !!(process.env.NODE_ENV !== \"production\") && needWarn.push(`__VUE_OPTIONS_API__`);\n    getGlobalThis().__VUE_OPTIONS_API__ = true;\n  }\n  if (typeof __VUE_PROD_DEVTOOLS__ !== \"boolean\") {\n    !!(process.env.NODE_ENV !== \"production\") && needWarn.push(`__VUE_PROD_DEVTOOLS__`);\n    getGlobalThis().__VUE_PROD_DEVTOOLS__ = false;\n  }\n  if (typeof __VUE_PROD_HYDRATION_MISMATCH_DETAILS__ !== \"boolean\") {\n    !!(process.env.NODE_ENV !== \"production\") && needWarn.push(`__VUE_PROD_HYDRATION_MISMATCH_DETAILS__`);\n    getGlobalThis().__VUE_PROD_HYDRATION_MISMATCH_DETAILS__ = false;\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && needWarn.length) {\n    const multi = needWarn.length > 1;\n    console.warn(\n      `Feature flag${multi ? `s` : ``} ${needWarn.join(\", \")} ${multi ? `are` : `is`} not explicitly defined. You are running the esm-bundler build of Vue, which expects these compile-time feature flags to be globally injected via the bundler config in order to get better tree-shaking in the production bundle.\n\nFor more details, see https://link.vuejs.org/feature-flags.`\n    );\n  }\n}\n\nconst queuePostRenderEffect = queueEffectWithSuspense ;\nfunction createRenderer(options) {\n  return baseCreateRenderer(options);\n}\nfunction createHydrationRenderer(options) {\n  return baseCreateRenderer(options, createHydrationFunctions);\n}\nfunction baseCreateRenderer(options, createHydrationFns) {\n  {\n    initFeatureFlags();\n  }\n  const target = getGlobalThis();\n  target.__VUE__ = true;\n  if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n    setDevtoolsHook$1(target.__VUE_DEVTOOLS_GLOBAL_HOOK__, target);\n  }\n  const {\n    insert: hostInsert,\n    remove: hostRemove,\n    patchProp: hostPatchProp,\n    createElement: hostCreateElement,\n    createText: hostCreateText,\n    createComment: hostCreateComment,\n    setText: hostSetText,\n    setElementText: hostSetElementText,\n    parentNode: hostParentNode,\n    nextSibling: hostNextSibling,\n    setScopeId: hostSetScopeId = NOOP,\n    insertStaticContent: hostInsertStaticContent\n  } = options;\n  const patch = (n1, n2, container, anchor = null, parentComponent = null, parentSuspense = null, namespace = void 0, slotScopeIds = null, optimized = !!(process.env.NODE_ENV !== \"production\") && isHmrUpdating ? false : !!n2.dynamicChildren) => {\n    if (n1 === n2) {\n      return;\n    }\n    if (n1 && !isSameVNodeType(n1, n2)) {\n      anchor = getNextHostNode(n1);\n      unmount(n1, parentComponent, parentSuspense, true);\n      n1 = null;\n    }\n    if (n2.patchFlag === -2) {\n      optimized = false;\n      n2.dynamicChildren = null;\n    }\n    const { type, ref, shapeFlag } = n2;\n    switch (type) {\n      case Text:\n        processText(n1, n2, container, anchor);\n        break;\n      case Comment:\n        processCommentNode(n1, n2, container, anchor);\n        break;\n      case Static:\n        if (n1 == null) {\n          mountStaticNode(n2, container, anchor, namespace);\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          patchStaticNode(n1, n2, container, namespace);\n        }\n        break;\n      case Fragment:\n        processFragment(\n          n1,\n          n2,\n          container,\n          anchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        break;\n      default:\n        if (shapeFlag & 1) {\n          processElement(\n            n1,\n            n2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        } else if (shapeFlag & 6) {\n          processComponent(\n            n1,\n            n2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        } else if (shapeFlag & 64) {\n          type.process(\n            n1,\n            n2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized,\n            internals\n          );\n        } else if (shapeFlag & 128) {\n          type.process(\n            n1,\n            n2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized,\n            internals\n          );\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn$1(\"Invalid VNode type:\", type, `(${typeof type})`);\n        }\n    }\n    if (ref != null && parentComponent) {\n      setRef(ref, n1 && n1.ref, parentSuspense, n2 || n1, !n2);\n    }\n  };\n  const processText = (n1, n2, container, anchor) => {\n    if (n1 == null) {\n      hostInsert(\n        n2.el = hostCreateText(n2.children),\n        container,\n        anchor\n      );\n    } else {\n      const el = n2.el = n1.el;\n      if (n2.children !== n1.children) {\n        hostSetText(el, n2.children);\n      }\n    }\n  };\n  const processCommentNode = (n1, n2, container, anchor) => {\n    if (n1 == null) {\n      hostInsert(\n        n2.el = hostCreateComment(n2.children || \"\"),\n        container,\n        anchor\n      );\n    } else {\n      n2.el = n1.el;\n    }\n  };\n  const mountStaticNode = (n2, container, anchor, namespace) => {\n    [n2.el, n2.anchor] = hostInsertStaticContent(\n      n2.children,\n      container,\n      anchor,\n      namespace,\n      n2.el,\n      n2.anchor\n    );\n  };\n  const patchStaticNode = (n1, n2, container, namespace) => {\n    if (n2.children !== n1.children) {\n      const anchor = hostNextSibling(n1.anchor);\n      removeStaticNode(n1);\n      [n2.el, n2.anchor] = hostInsertStaticContent(\n        n2.children,\n        container,\n        anchor,\n        namespace\n      );\n    } else {\n      n2.el = n1.el;\n      n2.anchor = n1.anchor;\n    }\n  };\n  const moveStaticNode = ({ el, anchor }, container, nextSibling) => {\n    let next;\n    while (el && el !== anchor) {\n      next = hostNextSibling(el);\n      hostInsert(el, container, nextSibling);\n      el = next;\n    }\n    hostInsert(anchor, container, nextSibling);\n  };\n  const removeStaticNode = ({ el, anchor }) => {\n    let next;\n    while (el && el !== anchor) {\n      next = hostNextSibling(el);\n      hostRemove(el);\n      el = next;\n    }\n    hostRemove(anchor);\n  };\n  const processElement = (n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    if (n2.type === \"svg\") {\n      namespace = \"svg\";\n    } else if (n2.type === \"math\") {\n      namespace = \"mathml\";\n    }\n    if (n1 == null) {\n      mountElement(\n        n2,\n        container,\n        anchor,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n    } else {\n      patchElement(\n        n1,\n        n2,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n    }\n  };\n  const mountElement = (vnode, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    let el;\n    let vnodeHook;\n    const { props, shapeFlag, transition, dirs } = vnode;\n    el = vnode.el = hostCreateElement(\n      vnode.type,\n      namespace,\n      props && props.is,\n      props\n    );\n    if (shapeFlag & 8) {\n      hostSetElementText(el, vnode.children);\n    } else if (shapeFlag & 16) {\n      mountChildren(\n        vnode.children,\n        el,\n        null,\n        parentComponent,\n        parentSuspense,\n        resolveChildrenNamespace(vnode, namespace),\n        slotScopeIds,\n        optimized\n      );\n    }\n    if (dirs) {\n      invokeDirectiveHook(vnode, null, parentComponent, \"created\");\n    }\n    setScopeId(el, vnode, vnode.scopeId, slotScopeIds, parentComponent);\n    if (props) {\n      for (const key in props) {\n        if (key !== \"value\" && !isReservedProp(key)) {\n          hostPatchProp(\n            el,\n            key,\n            null,\n            props[key],\n            namespace,\n            vnode.children,\n            parentComponent,\n            parentSuspense,\n            unmountChildren\n          );\n        }\n      }\n      if (\"value\" in props) {\n        hostPatchProp(el, \"value\", null, props.value, namespace);\n      }\n      if (vnodeHook = props.onVnodeBeforeMount) {\n        invokeVNodeHook(vnodeHook, parentComponent, vnode);\n      }\n    }\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      Object.defineProperty(el, \"__vnode\", {\n        value: vnode,\n        enumerable: false\n      });\n      Object.defineProperty(el, \"__vueParentComponent\", {\n        value: parentComponent,\n        enumerable: false\n      });\n    }\n    if (dirs) {\n      invokeDirectiveHook(vnode, null, parentComponent, \"beforeMount\");\n    }\n    const needCallTransitionHooks = needTransition(parentSuspense, transition);\n    if (needCallTransitionHooks) {\n      transition.beforeEnter(el);\n    }\n    hostInsert(el, container, anchor);\n    if ((vnodeHook = props && props.onVnodeMounted) || needCallTransitionHooks || dirs) {\n      queuePostRenderEffect(() => {\n        vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, vnode);\n        needCallTransitionHooks && transition.enter(el);\n        dirs && invokeDirectiveHook(vnode, null, parentComponent, \"mounted\");\n      }, parentSuspense);\n    }\n  };\n  const setScopeId = (el, vnode, scopeId, slotScopeIds, parentComponent) => {\n    if (scopeId) {\n      hostSetScopeId(el, scopeId);\n    }\n    if (slotScopeIds) {\n      for (let i = 0; i < slotScopeIds.length; i++) {\n        hostSetScopeId(el, slotScopeIds[i]);\n      }\n    }\n    if (parentComponent) {\n      let subTree = parentComponent.subTree;\n      if (!!(process.env.NODE_ENV !== \"production\") && subTree.patchFlag > 0 && subTree.patchFlag & 2048) {\n        subTree = filterSingleRoot(subTree.children) || subTree;\n      }\n      if (vnode === subTree) {\n        const parentVNode = parentComponent.vnode;\n        setScopeId(\n          el,\n          parentVNode,\n          parentVNode.scopeId,\n          parentVNode.slotScopeIds,\n          parentComponent.parent\n        );\n      }\n    }\n  };\n  const mountChildren = (children, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized, start = 0) => {\n    for (let i = start; i < children.length; i++) {\n      const child = children[i] = optimized ? cloneIfMounted(children[i]) : normalizeVNode(children[i]);\n      patch(\n        null,\n        child,\n        container,\n        anchor,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n    }\n  };\n  const patchElement = (n1, n2, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    const el = n2.el = n1.el;\n    let { patchFlag, dynamicChildren, dirs } = n2;\n    patchFlag |= n1.patchFlag & 16;\n    const oldProps = n1.props || EMPTY_OBJ;\n    const newProps = n2.props || EMPTY_OBJ;\n    let vnodeHook;\n    parentComponent && toggleRecurse(parentComponent, false);\n    if (vnodeHook = newProps.onVnodeBeforeUpdate) {\n      invokeVNodeHook(vnodeHook, parentComponent, n2, n1);\n    }\n    if (dirs) {\n      invokeDirectiveHook(n2, n1, parentComponent, \"beforeUpdate\");\n    }\n    parentComponent && toggleRecurse(parentComponent, true);\n    if (!!(process.env.NODE_ENV !== \"production\") && isHmrUpdating) {\n      patchFlag = 0;\n      optimized = false;\n      dynamicChildren = null;\n    }\n    if (dynamicChildren) {\n      patchBlockChildren(\n        n1.dynamicChildren,\n        dynamicChildren,\n        el,\n        parentComponent,\n        parentSuspense,\n        resolveChildrenNamespace(n2, namespace),\n        slotScopeIds\n      );\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        traverseStaticChildren(n1, n2);\n      }\n    } else if (!optimized) {\n      patchChildren(\n        n1,\n        n2,\n        el,\n        null,\n        parentComponent,\n        parentSuspense,\n        resolveChildrenNamespace(n2, namespace),\n        slotScopeIds,\n        false\n      );\n    }\n    if (patchFlag > 0) {\n      if (patchFlag & 16) {\n        patchProps(\n          el,\n          n2,\n          oldProps,\n          newProps,\n          parentComponent,\n          parentSuspense,\n          namespace\n        );\n      } else {\n        if (patchFlag & 2) {\n          if (oldProps.class !== newProps.class) {\n            hostPatchProp(el, \"class\", null, newProps.class, namespace);\n          }\n        }\n        if (patchFlag & 4) {\n          hostPatchProp(el, \"style\", oldProps.style, newProps.style, namespace);\n        }\n        if (patchFlag & 8) {\n          const propsToUpdate = n2.dynamicProps;\n          for (let i = 0; i < propsToUpdate.length; i++) {\n            const key = propsToUpdate[i];\n            const prev = oldProps[key];\n            const next = newProps[key];\n            if (next !== prev || key === \"value\") {\n              hostPatchProp(\n                el,\n                key,\n                prev,\n                next,\n                namespace,\n                n1.children,\n                parentComponent,\n                parentSuspense,\n                unmountChildren\n              );\n            }\n          }\n        }\n      }\n      if (patchFlag & 1) {\n        if (n1.children !== n2.children) {\n          hostSetElementText(el, n2.children);\n        }\n      }\n    } else if (!optimized && dynamicChildren == null) {\n      patchProps(\n        el,\n        n2,\n        oldProps,\n        newProps,\n        parentComponent,\n        parentSuspense,\n        namespace\n      );\n    }\n    if ((vnodeHook = newProps.onVnodeUpdated) || dirs) {\n      queuePostRenderEffect(() => {\n        vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, n2, n1);\n        dirs && invokeDirectiveHook(n2, n1, parentComponent, \"updated\");\n      }, parentSuspense);\n    }\n  };\n  const patchBlockChildren = (oldChildren, newChildren, fallbackContainer, parentComponent, parentSuspense, namespace, slotScopeIds) => {\n    for (let i = 0; i < newChildren.length; i++) {\n      const oldVNode = oldChildren[i];\n      const newVNode = newChildren[i];\n      const container = (\n        // oldVNode may be an errored async setup() component inside Suspense\n        // which will not have a mounted element\n        oldVNode.el && // - In the case of a Fragment, we need to provide the actual parent\n        // of the Fragment itself so it can move its children.\n        (oldVNode.type === Fragment || // - In the case of different nodes, there is going to be a replacement\n        // which also requires the correct parent container\n        !isSameVNodeType(oldVNode, newVNode) || // - In the case of a component, it could contain anything.\n        oldVNode.shapeFlag & (6 | 64)) ? hostParentNode(oldVNode.el) : (\n          // In other cases, the parent container is not actually used so we\n          // just pass the block element here to avoid a DOM parentNode call.\n          fallbackContainer\n        )\n      );\n      patch(\n        oldVNode,\n        newVNode,\n        container,\n        null,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        true\n      );\n    }\n  };\n  const patchProps = (el, vnode, oldProps, newProps, parentComponent, parentSuspense, namespace) => {\n    if (oldProps !== newProps) {\n      if (oldProps !== EMPTY_OBJ) {\n        for (const key in oldProps) {\n          if (!isReservedProp(key) && !(key in newProps)) {\n            hostPatchProp(\n              el,\n              key,\n              oldProps[key],\n              null,\n              namespace,\n              vnode.children,\n              parentComponent,\n              parentSuspense,\n              unmountChildren\n            );\n          }\n        }\n      }\n      for (const key in newProps) {\n        if (isReservedProp(key))\n          continue;\n        const next = newProps[key];\n        const prev = oldProps[key];\n        if (next !== prev && key !== \"value\") {\n          hostPatchProp(\n            el,\n            key,\n            prev,\n            next,\n            namespace,\n            vnode.children,\n            parentComponent,\n            parentSuspense,\n            unmountChildren\n          );\n        }\n      }\n      if (\"value\" in newProps) {\n        hostPatchProp(el, \"value\", oldProps.value, newProps.value, namespace);\n      }\n    }\n  };\n  const processFragment = (n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    const fragmentStartAnchor = n2.el = n1 ? n1.el : hostCreateText(\"\");\n    const fragmentEndAnchor = n2.anchor = n1 ? n1.anchor : hostCreateText(\"\");\n    let { patchFlag, dynamicChildren, slotScopeIds: fragmentSlotScopeIds } = n2;\n    if (!!(process.env.NODE_ENV !== \"production\") && // #5523 dev root fragment may inherit directives\n    (isHmrUpdating || patchFlag & 2048)) {\n      patchFlag = 0;\n      optimized = false;\n      dynamicChildren = null;\n    }\n    if (fragmentSlotScopeIds) {\n      slotScopeIds = slotScopeIds ? slotScopeIds.concat(fragmentSlotScopeIds) : fragmentSlotScopeIds;\n    }\n    if (n1 == null) {\n      hostInsert(fragmentStartAnchor, container, anchor);\n      hostInsert(fragmentEndAnchor, container, anchor);\n      mountChildren(\n        // #10007\n        // such fragment like `<></>` will be compiled into\n        // a fragment which doesn't have a children.\n        // In this case fallback to an empty array\n        n2.children || [],\n        container,\n        fragmentEndAnchor,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n    } else {\n      if (patchFlag > 0 && patchFlag & 64 && dynamicChildren && // #2715 the previous fragment could've been a BAILed one as a result\n      // of renderSlot() with no valid children\n      n1.dynamicChildren) {\n        patchBlockChildren(\n          n1.dynamicChildren,\n          dynamicChildren,\n          container,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds\n        );\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          traverseStaticChildren(n1, n2);\n        } else if (\n          // #2080 if the stable fragment has a key, it's a <template v-for> that may\n          //  get moved around. Make sure all root level vnodes inherit el.\n          // #2134 or if it's a component root, it may also get moved around\n          // as the component is being moved.\n          n2.key != null || parentComponent && n2 === parentComponent.subTree\n        ) {\n          traverseStaticChildren(\n            n1,\n            n2,\n            true\n            /* shallow */\n          );\n        }\n      } else {\n        patchChildren(\n          n1,\n          n2,\n          container,\n          fragmentEndAnchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n      }\n    }\n  };\n  const processComponent = (n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    n2.slotScopeIds = slotScopeIds;\n    if (n1 == null) {\n      if (n2.shapeFlag & 512) {\n        parentComponent.ctx.activate(\n          n2,\n          container,\n          anchor,\n          namespace,\n          optimized\n        );\n      } else {\n        mountComponent(\n          n2,\n          container,\n          anchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          optimized\n        );\n      }\n    } else {\n      updateComponent(n1, n2, optimized);\n    }\n  };\n  const mountComponent = (initialVNode, container, anchor, parentComponent, parentSuspense, namespace, optimized) => {\n    const instance = (initialVNode.component = createComponentInstance(\n      initialVNode,\n      parentComponent,\n      parentSuspense\n    ));\n    if (!!(process.env.NODE_ENV !== \"production\") && instance.type.__hmrId) {\n      registerHMR(instance);\n    }\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      pushWarningContext(initialVNode);\n      startMeasure(instance, `mount`);\n    }\n    if (isKeepAlive(initialVNode)) {\n      instance.ctx.renderer = internals;\n    }\n    {\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        startMeasure(instance, `init`);\n      }\n      setupComponent(instance);\n      if (!!(process.env.NODE_ENV !== \"production\")) {\n        endMeasure(instance, `init`);\n      }\n    }\n    if (instance.asyncDep) {\n      parentSuspense && parentSuspense.registerDep(instance, setupRenderEffect);\n      if (!initialVNode.el) {\n        const placeholder = instance.subTree = createVNode(Comment);\n        processCommentNode(null, placeholder, container, anchor);\n      }\n    } else {\n      setupRenderEffect(\n        instance,\n        initialVNode,\n        container,\n        anchor,\n        parentSuspense,\n        namespace,\n        optimized\n      );\n    }\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      popWarningContext();\n      endMeasure(instance, `mount`);\n    }\n  };\n  const updateComponent = (n1, n2, optimized) => {\n    const instance = n2.component = n1.component;\n    if (shouldUpdateComponent(n1, n2, optimized)) {\n      if (instance.asyncDep && !instance.asyncResolved) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          pushWarningContext(n2);\n        }\n        updateComponentPreRender(instance, n2, optimized);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          popWarningContext();\n        }\n        return;\n      } else {\n        instance.next = n2;\n        invalidateJob(instance.update);\n        instance.effect.dirty = true;\n        instance.update();\n      }\n    } else {\n      n2.el = n1.el;\n      instance.vnode = n2;\n    }\n  };\n  const setupRenderEffect = (instance, initialVNode, container, anchor, parentSuspense, namespace, optimized) => {\n    const componentUpdateFn = () => {\n      if (!instance.isMounted) {\n        let vnodeHook;\n        const { el, props } = initialVNode;\n        const { bm, m, parent } = instance;\n        const isAsyncWrapperVNode = isAsyncWrapper(initialVNode);\n        toggleRecurse(instance, false);\n        if (bm) {\n          invokeArrayFns(bm);\n        }\n        if (!isAsyncWrapperVNode && (vnodeHook = props && props.onVnodeBeforeMount)) {\n          invokeVNodeHook(vnodeHook, parent, initialVNode);\n        }\n        toggleRecurse(instance, true);\n        if (el && hydrateNode) {\n          const hydrateSubTree = () => {\n            if (!!(process.env.NODE_ENV !== \"production\")) {\n              startMeasure(instance, `render`);\n            }\n            instance.subTree = renderComponentRoot(instance);\n            if (!!(process.env.NODE_ENV !== \"production\")) {\n              endMeasure(instance, `render`);\n            }\n            if (!!(process.env.NODE_ENV !== \"production\")) {\n              startMeasure(instance, `hydrate`);\n            }\n            hydrateNode(\n              el,\n              instance.subTree,\n              instance,\n              parentSuspense,\n              null\n            );\n            if (!!(process.env.NODE_ENV !== \"production\")) {\n              endMeasure(instance, `hydrate`);\n            }\n          };\n          if (isAsyncWrapperVNode) {\n            initialVNode.type.__asyncLoader().then(\n              // note: we are moving the render call into an async callback,\n              // which means it won't track dependencies - but it's ok because\n              // a server-rendered async wrapper is already in resolved state\n              // and it will never need to change.\n              () => !instance.isUnmounted && hydrateSubTree()\n            );\n          } else {\n            hydrateSubTree();\n          }\n        } else {\n          if (!!(process.env.NODE_ENV !== \"production\")) {\n            startMeasure(instance, `render`);\n          }\n          const subTree = instance.subTree = renderComponentRoot(instance);\n          if (!!(process.env.NODE_ENV !== \"production\")) {\n            endMeasure(instance, `render`);\n          }\n          if (!!(process.env.NODE_ENV !== \"production\")) {\n            startMeasure(instance, `patch`);\n          }\n          patch(\n            null,\n            subTree,\n            container,\n            anchor,\n            instance,\n            parentSuspense,\n            namespace\n          );\n          if (!!(process.env.NODE_ENV !== \"production\")) {\n            endMeasure(instance, `patch`);\n          }\n          initialVNode.el = subTree.el;\n        }\n        if (m) {\n          queuePostRenderEffect(m, parentSuspense);\n        }\n        if (!isAsyncWrapperVNode && (vnodeHook = props && props.onVnodeMounted)) {\n          const scopedInitialVNode = initialVNode;\n          queuePostRenderEffect(\n            () => invokeVNodeHook(vnodeHook, parent, scopedInitialVNode),\n            parentSuspense\n          );\n        }\n        if (initialVNode.shapeFlag & 256 || parent && isAsyncWrapper(parent.vnode) && parent.vnode.shapeFlag & 256) {\n          instance.a && queuePostRenderEffect(instance.a, parentSuspense);\n        }\n        instance.isMounted = true;\n        if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n          devtoolsComponentAdded(instance);\n        }\n        initialVNode = container = anchor = null;\n      } else {\n        let { next, bu, u, parent, vnode } = instance;\n        {\n          const nonHydratedAsyncRoot = locateNonHydratedAsyncRoot(instance);\n          if (nonHydratedAsyncRoot) {\n            if (next) {\n              next.el = vnode.el;\n              updateComponentPreRender(instance, next, optimized);\n            }\n            nonHydratedAsyncRoot.asyncDep.then(() => {\n              if (!instance.isUnmounted) {\n                componentUpdateFn();\n              }\n            });\n            return;\n          }\n        }\n        let originNext = next;\n        let vnodeHook;\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          pushWarningContext(next || instance.vnode);\n        }\n        toggleRecurse(instance, false);\n        if (next) {\n          next.el = vnode.el;\n          updateComponentPreRender(instance, next, optimized);\n        } else {\n          next = vnode;\n        }\n        if (bu) {\n          invokeArrayFns(bu);\n        }\n        if (vnodeHook = next.props && next.props.onVnodeBeforeUpdate) {\n          invokeVNodeHook(vnodeHook, parent, next, vnode);\n        }\n        toggleRecurse(instance, true);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          startMeasure(instance, `render`);\n        }\n        const nextTree = renderComponentRoot(instance);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          endMeasure(instance, `render`);\n        }\n        const prevTree = instance.subTree;\n        instance.subTree = nextTree;\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          startMeasure(instance, `patch`);\n        }\n        patch(\n          prevTree,\n          nextTree,\n          // parent may have changed if it's in a teleport\n          hostParentNode(prevTree.el),\n          // anchor may have changed if it's in a fragment\n          getNextHostNode(prevTree),\n          instance,\n          parentSuspense,\n          namespace\n        );\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          endMeasure(instance, `patch`);\n        }\n        next.el = nextTree.el;\n        if (originNext === null) {\n          updateHOCHostEl(instance, nextTree.el);\n        }\n        if (u) {\n          queuePostRenderEffect(u, parentSuspense);\n        }\n        if (vnodeHook = next.props && next.props.onVnodeUpdated) {\n          queuePostRenderEffect(\n            () => invokeVNodeHook(vnodeHook, parent, next, vnode),\n            parentSuspense\n          );\n        }\n        if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n          devtoolsComponentUpdated(instance);\n        }\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          popWarningContext();\n        }\n      }\n    };\n    const effect = instance.effect = new ReactiveEffect(\n      componentUpdateFn,\n      NOOP,\n      () => queueJob(update),\n      instance.scope\n      // track it in component's effect scope\n    );\n    const update = instance.update = () => {\n      if (effect.dirty) {\n        effect.run();\n      }\n    };\n    update.id = instance.uid;\n    toggleRecurse(instance, true);\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      effect.onTrack = instance.rtc ? (e) => invokeArrayFns(instance.rtc, e) : void 0;\n      effect.onTrigger = instance.rtg ? (e) => invokeArrayFns(instance.rtg, e) : void 0;\n      update.ownerInstance = instance;\n    }\n    update();\n  };\n  const updateComponentPreRender = (instance, nextVNode, optimized) => {\n    nextVNode.component = instance;\n    const prevProps = instance.vnode.props;\n    instance.vnode = nextVNode;\n    instance.next = null;\n    updateProps(instance, nextVNode.props, prevProps, optimized);\n    updateSlots(instance, nextVNode.children, optimized);\n    pauseTracking();\n    flushPreFlushCbs(instance);\n    resetTracking();\n  };\n  const patchChildren = (n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized = false) => {\n    const c1 = n1 && n1.children;\n    const prevShapeFlag = n1 ? n1.shapeFlag : 0;\n    const c2 = n2.children;\n    const { patchFlag, shapeFlag } = n2;\n    if (patchFlag > 0) {\n      if (patchFlag & 128) {\n        patchKeyedChildren(\n          c1,\n          c2,\n          container,\n          anchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        return;\n      } else if (patchFlag & 256) {\n        patchUnkeyedChildren(\n          c1,\n          c2,\n          container,\n          anchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n        return;\n      }\n    }\n    if (shapeFlag & 8) {\n      if (prevShapeFlag & 16) {\n        unmountChildren(c1, parentComponent, parentSuspense);\n      }\n      if (c2 !== c1) {\n        hostSetElementText(container, c2);\n      }\n    } else {\n      if (prevShapeFlag & 16) {\n        if (shapeFlag & 16) {\n          patchKeyedChildren(\n            c1,\n            c2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        } else {\n          unmountChildren(c1, parentComponent, parentSuspense, true);\n        }\n      } else {\n        if (prevShapeFlag & 8) {\n          hostSetElementText(container, \"\");\n        }\n        if (shapeFlag & 16) {\n          mountChildren(\n            c2,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        }\n      }\n    }\n  };\n  const patchUnkeyedChildren = (c1, c2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    c1 = c1 || EMPTY_ARR;\n    c2 = c2 || EMPTY_ARR;\n    const oldLength = c1.length;\n    const newLength = c2.length;\n    const commonLength = Math.min(oldLength, newLength);\n    let i;\n    for (i = 0; i < commonLength; i++) {\n      const nextChild = c2[i] = optimized ? cloneIfMounted(c2[i]) : normalizeVNode(c2[i]);\n      patch(\n        c1[i],\n        nextChild,\n        container,\n        null,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized\n      );\n    }\n    if (oldLength > newLength) {\n      unmountChildren(\n        c1,\n        parentComponent,\n        parentSuspense,\n        true,\n        false,\n        commonLength\n      );\n    } else {\n      mountChildren(\n        c2,\n        container,\n        anchor,\n        parentComponent,\n        parentSuspense,\n        namespace,\n        slotScopeIds,\n        optimized,\n        commonLength\n      );\n    }\n  };\n  const patchKeyedChildren = (c1, c2, container, parentAnchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized) => {\n    let i = 0;\n    const l2 = c2.length;\n    let e1 = c1.length - 1;\n    let e2 = l2 - 1;\n    while (i <= e1 && i <= e2) {\n      const n1 = c1[i];\n      const n2 = c2[i] = optimized ? cloneIfMounted(c2[i]) : normalizeVNode(c2[i]);\n      if (isSameVNodeType(n1, n2)) {\n        patch(\n          n1,\n          n2,\n          container,\n          null,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n      } else {\n        break;\n      }\n      i++;\n    }\n    while (i <= e1 && i <= e2) {\n      const n1 = c1[e1];\n      const n2 = c2[e2] = optimized ? cloneIfMounted(c2[e2]) : normalizeVNode(c2[e2]);\n      if (isSameVNodeType(n1, n2)) {\n        patch(\n          n1,\n          n2,\n          container,\n          null,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          optimized\n        );\n      } else {\n        break;\n      }\n      e1--;\n      e2--;\n    }\n    if (i > e1) {\n      if (i <= e2) {\n        const nextPos = e2 + 1;\n        const anchor = nextPos < l2 ? c2[nextPos].el : parentAnchor;\n        while (i <= e2) {\n          patch(\n            null,\n            c2[i] = optimized ? cloneIfMounted(c2[i]) : normalizeVNode(c2[i]),\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n          i++;\n        }\n      }\n    } else if (i > e2) {\n      while (i <= e1) {\n        unmount(c1[i], parentComponent, parentSuspense, true);\n        i++;\n      }\n    } else {\n      const s1 = i;\n      const s2 = i;\n      const keyToNewIndexMap = /* @__PURE__ */ new Map();\n      for (i = s2; i <= e2; i++) {\n        const nextChild = c2[i] = optimized ? cloneIfMounted(c2[i]) : normalizeVNode(c2[i]);\n        if (nextChild.key != null) {\n          if (!!(process.env.NODE_ENV !== \"production\") && keyToNewIndexMap.has(nextChild.key)) {\n            warn$1(\n              `Duplicate keys found during update:`,\n              JSON.stringify(nextChild.key),\n              `Make sure keys are unique.`\n            );\n          }\n          keyToNewIndexMap.set(nextChild.key, i);\n        }\n      }\n      let j;\n      let patched = 0;\n      const toBePatched = e2 - s2 + 1;\n      let moved = false;\n      let maxNewIndexSoFar = 0;\n      const newIndexToOldIndexMap = new Array(toBePatched);\n      for (i = 0; i < toBePatched; i++)\n        newIndexToOldIndexMap[i] = 0;\n      for (i = s1; i <= e1; i++) {\n        const prevChild = c1[i];\n        if (patched >= toBePatched) {\n          unmount(prevChild, parentComponent, parentSuspense, true);\n          continue;\n        }\n        let newIndex;\n        if (prevChild.key != null) {\n          newIndex = keyToNewIndexMap.get(prevChild.key);\n        } else {\n          for (j = s2; j <= e2; j++) {\n            if (newIndexToOldIndexMap[j - s2] === 0 && isSameVNodeType(prevChild, c2[j])) {\n              newIndex = j;\n              break;\n            }\n          }\n        }\n        if (newIndex === void 0) {\n          unmount(prevChild, parentComponent, parentSuspense, true);\n        } else {\n          newIndexToOldIndexMap[newIndex - s2] = i + 1;\n          if (newIndex >= maxNewIndexSoFar) {\n            maxNewIndexSoFar = newIndex;\n          } else {\n            moved = true;\n          }\n          patch(\n            prevChild,\n            c2[newIndex],\n            container,\n            null,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n          patched++;\n        }\n      }\n      const increasingNewIndexSequence = moved ? getSequence(newIndexToOldIndexMap) : EMPTY_ARR;\n      j = increasingNewIndexSequence.length - 1;\n      for (i = toBePatched - 1; i >= 0; i--) {\n        const nextIndex = s2 + i;\n        const nextChild = c2[nextIndex];\n        const anchor = nextIndex + 1 < l2 ? c2[nextIndex + 1].el : parentAnchor;\n        if (newIndexToOldIndexMap[i] === 0) {\n          patch(\n            null,\n            nextChild,\n            container,\n            anchor,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        } else if (moved) {\n          if (j < 0 || i !== increasingNewIndexSequence[j]) {\n            move(nextChild, container, anchor, 2);\n          } else {\n            j--;\n          }\n        }\n      }\n    }\n  };\n  const move = (vnode, container, anchor, moveType, parentSuspense = null) => {\n    const { el, type, transition, children, shapeFlag } = vnode;\n    if (shapeFlag & 6) {\n      move(vnode.component.subTree, container, anchor, moveType);\n      return;\n    }\n    if (shapeFlag & 128) {\n      vnode.suspense.move(container, anchor, moveType);\n      return;\n    }\n    if (shapeFlag & 64) {\n      type.move(vnode, container, anchor, internals);\n      return;\n    }\n    if (type === Fragment) {\n      hostInsert(el, container, anchor);\n      for (let i = 0; i < children.length; i++) {\n        move(children[i], container, anchor, moveType);\n      }\n      hostInsert(vnode.anchor, container, anchor);\n      return;\n    }\n    if (type === Static) {\n      moveStaticNode(vnode, container, anchor);\n      return;\n    }\n    const needTransition2 = moveType !== 2 && shapeFlag & 1 && transition;\n    if (needTransition2) {\n      if (moveType === 0) {\n        transition.beforeEnter(el);\n        hostInsert(el, container, anchor);\n        queuePostRenderEffect(() => transition.enter(el), parentSuspense);\n      } else {\n        const { leave, delayLeave, afterLeave } = transition;\n        const remove2 = () => hostInsert(el, container, anchor);\n        const performLeave = () => {\n          leave(el, () => {\n            remove2();\n            afterLeave && afterLeave();\n          });\n        };\n        if (delayLeave) {\n          delayLeave(el, remove2, performLeave);\n        } else {\n          performLeave();\n        }\n      }\n    } else {\n      hostInsert(el, container, anchor);\n    }\n  };\n  const unmount = (vnode, parentComponent, parentSuspense, doRemove = false, optimized = false) => {\n    const {\n      type,\n      props,\n      ref,\n      children,\n      dynamicChildren,\n      shapeFlag,\n      patchFlag,\n      dirs\n    } = vnode;\n    if (ref != null) {\n      setRef(ref, null, parentSuspense, vnode, true);\n    }\n    if (shapeFlag & 256) {\n      parentComponent.ctx.deactivate(vnode);\n      return;\n    }\n    const shouldInvokeDirs = shapeFlag & 1 && dirs;\n    const shouldInvokeVnodeHook = !isAsyncWrapper(vnode);\n    let vnodeHook;\n    if (shouldInvokeVnodeHook && (vnodeHook = props && props.onVnodeBeforeUnmount)) {\n      invokeVNodeHook(vnodeHook, parentComponent, vnode);\n    }\n    if (shapeFlag & 6) {\n      unmountComponent(vnode.component, parentSuspense, doRemove);\n    } else {\n      if (shapeFlag & 128) {\n        vnode.suspense.unmount(parentSuspense, doRemove);\n        return;\n      }\n      if (shouldInvokeDirs) {\n        invokeDirectiveHook(vnode, null, parentComponent, \"beforeUnmount\");\n      }\n      if (shapeFlag & 64) {\n        vnode.type.remove(\n          vnode,\n          parentComponent,\n          parentSuspense,\n          optimized,\n          internals,\n          doRemove\n        );\n      } else if (dynamicChildren && // #1153: fast path should not be taken for non-stable (v-for) fragments\n      (type !== Fragment || patchFlag > 0 && patchFlag & 64)) {\n        unmountChildren(\n          dynamicChildren,\n          parentComponent,\n          parentSuspense,\n          false,\n          true\n        );\n      } else if (type === Fragment && patchFlag & (128 | 256) || !optimized && shapeFlag & 16) {\n        unmountChildren(children, parentComponent, parentSuspense);\n      }\n      if (doRemove) {\n        remove(vnode);\n      }\n    }\n    if (shouldInvokeVnodeHook && (vnodeHook = props && props.onVnodeUnmounted) || shouldInvokeDirs) {\n      queuePostRenderEffect(() => {\n        vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, vnode);\n        shouldInvokeDirs && invokeDirectiveHook(vnode, null, parentComponent, \"unmounted\");\n      }, parentSuspense);\n    }\n  };\n  const remove = (vnode) => {\n    const { type, el, anchor, transition } = vnode;\n    if (type === Fragment) {\n      if (!!(process.env.NODE_ENV !== \"production\") && vnode.patchFlag > 0 && vnode.patchFlag & 2048 && transition && !transition.persisted) {\n        vnode.children.forEach((child) => {\n          if (child.type === Comment) {\n            hostRemove(child.el);\n          } else {\n            remove(child);\n          }\n        });\n      } else {\n        removeFragment(el, anchor);\n      }\n      return;\n    }\n    if (type === Static) {\n      removeStaticNode(vnode);\n      return;\n    }\n    const performRemove = () => {\n      hostRemove(el);\n      if (transition && !transition.persisted && transition.afterLeave) {\n        transition.afterLeave();\n      }\n    };\n    if (vnode.shapeFlag & 1 && transition && !transition.persisted) {\n      const { leave, delayLeave } = transition;\n      const performLeave = () => leave(el, performRemove);\n      if (delayLeave) {\n        delayLeave(vnode.el, performRemove, performLeave);\n      } else {\n        performLeave();\n      }\n    } else {\n      performRemove();\n    }\n  };\n  const removeFragment = (cur, end) => {\n    let next;\n    while (cur !== end) {\n      next = hostNextSibling(cur);\n      hostRemove(cur);\n      cur = next;\n    }\n    hostRemove(end);\n  };\n  const unmountComponent = (instance, parentSuspense, doRemove) => {\n    if (!!(process.env.NODE_ENV !== \"production\") && instance.type.__hmrId) {\n      unregisterHMR(instance);\n    }\n    const { bum, scope, update, subTree, um } = instance;\n    if (bum) {\n      invokeArrayFns(bum);\n    }\n    scope.stop();\n    if (update) {\n      update.active = false;\n      unmount(subTree, instance, parentSuspense, doRemove);\n    }\n    if (um) {\n      queuePostRenderEffect(um, parentSuspense);\n    }\n    queuePostRenderEffect(() => {\n      instance.isUnmounted = true;\n    }, parentSuspense);\n    if (parentSuspense && parentSuspense.pendingBranch && !parentSuspense.isUnmounted && instance.asyncDep && !instance.asyncResolved && instance.suspenseId === parentSuspense.pendingId) {\n      parentSuspense.deps--;\n      if (parentSuspense.deps === 0) {\n        parentSuspense.resolve();\n      }\n    }\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      devtoolsComponentRemoved(instance);\n    }\n  };\n  const unmountChildren = (children, parentComponent, parentSuspense, doRemove = false, optimized = false, start = 0) => {\n    for (let i = start; i < children.length; i++) {\n      unmount(children[i], parentComponent, parentSuspense, doRemove, optimized);\n    }\n  };\n  const getNextHostNode = (vnode) => {\n    if (vnode.shapeFlag & 6) {\n      return getNextHostNode(vnode.component.subTree);\n    }\n    if (vnode.shapeFlag & 128) {\n      return vnode.suspense.next();\n    }\n    return hostNextSibling(vnode.anchor || vnode.el);\n  };\n  let isFlushing = false;\n  const render = (vnode, container, namespace) => {\n    if (vnode == null) {\n      if (container._vnode) {\n        unmount(container._vnode, null, null, true);\n      }\n    } else {\n      patch(\n        container._vnode || null,\n        vnode,\n        container,\n        null,\n        null,\n        null,\n        namespace\n      );\n    }\n    if (!isFlushing) {\n      isFlushing = true;\n      flushPreFlushCbs();\n      flushPostFlushCbs();\n      isFlushing = false;\n    }\n    container._vnode = vnode;\n  };\n  const internals = {\n    p: patch,\n    um: unmount,\n    m: move,\n    r: remove,\n    mt: mountComponent,\n    mc: mountChildren,\n    pc: patchChildren,\n    pbc: patchBlockChildren,\n    n: getNextHostNode,\n    o: options\n  };\n  let hydrate;\n  let hydrateNode;\n  if (createHydrationFns) {\n    [hydrate, hydrateNode] = createHydrationFns(\n      internals\n    );\n  }\n  return {\n    render,\n    hydrate,\n    createApp: createAppAPI(render, hydrate)\n  };\n}\nfunction resolveChildrenNamespace({ type, props }, currentNamespace) {\n  return currentNamespace === \"svg\" && type === \"foreignObject\" || currentNamespace === \"mathml\" && type === \"annotation-xml\" && props && props.encoding && props.encoding.includes(\"html\") ? void 0 : currentNamespace;\n}\nfunction toggleRecurse({ effect, update }, allowed) {\n  effect.allowRecurse = update.allowRecurse = allowed;\n}\nfunction needTransition(parentSuspense, transition) {\n  return (!parentSuspense || parentSuspense && !parentSuspense.pendingBranch) && transition && !transition.persisted;\n}\nfunction traverseStaticChildren(n1, n2, shallow = false) {\n  const ch1 = n1.children;\n  const ch2 = n2.children;\n  if (isArray(ch1) && isArray(ch2)) {\n    for (let i = 0; i < ch1.length; i++) {\n      const c1 = ch1[i];\n      let c2 = ch2[i];\n      if (c2.shapeFlag & 1 && !c2.dynamicChildren) {\n        if (c2.patchFlag <= 0 || c2.patchFlag === 32) {\n          c2 = ch2[i] = cloneIfMounted(ch2[i]);\n          c2.el = c1.el;\n        }\n        if (!shallow)\n          traverseStaticChildren(c1, c2);\n      }\n      if (c2.type === Text) {\n        c2.el = c1.el;\n      }\n      if (!!(process.env.NODE_ENV !== \"production\") && c2.type === Comment && !c2.el) {\n        c2.el = c1.el;\n      }\n    }\n  }\n}\nfunction getSequence(arr) {\n  const p = arr.slice();\n  const result = [0];\n  let i, j, u, v, c;\n  const len = arr.length;\n  for (i = 0; i < len; i++) {\n    const arrI = arr[i];\n    if (arrI !== 0) {\n      j = result[result.length - 1];\n      if (arr[j] < arrI) {\n        p[i] = j;\n        result.push(i);\n        continue;\n      }\n      u = 0;\n      v = result.length - 1;\n      while (u < v) {\n        c = u + v >> 1;\n        if (arr[result[c]] < arrI) {\n          u = c + 1;\n        } else {\n          v = c;\n        }\n      }\n      if (arrI < arr[result[u]]) {\n        if (u > 0) {\n          p[i] = result[u - 1];\n        }\n        result[u] = i;\n      }\n    }\n  }\n  u = result.length;\n  v = result[u - 1];\n  while (u-- > 0) {\n    result[u] = v;\n    v = p[v];\n  }\n  return result;\n}\nfunction locateNonHydratedAsyncRoot(instance) {\n  const subComponent = instance.subTree.component;\n  if (subComponent) {\n    if (subComponent.asyncDep && !subComponent.asyncResolved) {\n      return subComponent;\n    } else {\n      return locateNonHydratedAsyncRoot(subComponent);\n    }\n  }\n}\n\nconst isTeleport = (type) => type.__isTeleport;\nconst isTeleportDisabled = (props) => props && (props.disabled || props.disabled === \"\");\nconst isTargetSVG = (target) => typeof SVGElement !== \"undefined\" && target instanceof SVGElement;\nconst isTargetMathML = (target) => typeof MathMLElement === \"function\" && target instanceof MathMLElement;\nconst resolveTarget = (props, select) => {\n  const targetSelector = props && props.to;\n  if (isString(targetSelector)) {\n    if (!select) {\n      !!(process.env.NODE_ENV !== \"production\") && warn$1(\n        `Current renderer does not support string target for Teleports. (missing querySelector renderer option)`\n      );\n      return null;\n    } else {\n      const target = select(targetSelector);\n      if (!target) {\n        !!(process.env.NODE_ENV !== \"production\") && warn$1(\n          `Failed to locate Teleport target with selector \"${targetSelector}\". Note the target element must exist before the component is mounted - i.e. the target cannot be rendered by the component itself, and ideally should be outside of the entire Vue component tree.`\n        );\n      }\n      return target;\n    }\n  } else {\n    if (!!(process.env.NODE_ENV !== \"production\") && !targetSelector && !isTeleportDisabled(props)) {\n      warn$1(`Invalid Teleport target: ${targetSelector}`);\n    }\n    return targetSelector;\n  }\n};\nconst TeleportImpl = {\n  name: \"Teleport\",\n  __isTeleport: true,\n  process(n1, n2, container, anchor, parentComponent, parentSuspense, namespace, slotScopeIds, optimized, internals) {\n    const {\n      mc: mountChildren,\n      pc: patchChildren,\n      pbc: patchBlockChildren,\n      o: { insert, querySelector, createText, createComment }\n    } = internals;\n    const disabled = isTeleportDisabled(n2.props);\n    let { shapeFlag, children, dynamicChildren } = n2;\n    if (!!(process.env.NODE_ENV !== \"production\") && isHmrUpdating) {\n      optimized = false;\n      dynamicChildren = null;\n    }\n    if (n1 == null) {\n      const placeholder = n2.el = !!(process.env.NODE_ENV !== \"production\") ? createComment(\"teleport start\") : createText(\"\");\n      const mainAnchor = n2.anchor = !!(process.env.NODE_ENV !== \"production\") ? createComment(\"teleport end\") : createText(\"\");\n      insert(placeholder, container, anchor);\n      insert(mainAnchor, container, anchor);\n      const target = n2.target = resolveTarget(n2.props, querySelector);\n      const targetAnchor = n2.targetAnchor = createText(\"\");\n      if (target) {\n        insert(targetAnchor, target);\n        if (namespace === \"svg\" || isTargetSVG(target)) {\n          namespace = \"svg\";\n        } else if (namespace === \"mathml\" || isTargetMathML(target)) {\n          namespace = \"mathml\";\n        }\n      } else if (!!(process.env.NODE_ENV !== \"production\") && !disabled) {\n        warn$1(\"Invalid Teleport target on mount:\", target, `(${typeof target})`);\n      }\n      const mount = (container2, anchor2) => {\n        if (shapeFlag & 16) {\n          mountChildren(\n            children,\n            container2,\n            anchor2,\n            parentComponent,\n            parentSuspense,\n            namespace,\n            slotScopeIds,\n            optimized\n          );\n        }\n      };\n      if (disabled) {\n        mount(container, mainAnchor);\n      } else if (target) {\n        mount(target, targetAnchor);\n      }\n    } else {\n      n2.el = n1.el;\n      const mainAnchor = n2.anchor = n1.anchor;\n      const target = n2.target = n1.target;\n      const targetAnchor = n2.targetAnchor = n1.targetAnchor;\n      const wasDisabled = isTeleportDisabled(n1.props);\n      const currentContainer = wasDisabled ? container : target;\n      const currentAnchor = wasDisabled ? mainAnchor : targetAnchor;\n      if (namespace === \"svg\" || isTargetSVG(target)) {\n        namespace = \"svg\";\n      } else if (namespace === \"mathml\" || isTargetMathML(target)) {\n        namespace = \"mathml\";\n      }\n      if (dynamicChildren) {\n        patchBlockChildren(\n          n1.dynamicChildren,\n          dynamicChildren,\n          currentContainer,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds\n        );\n        traverseStaticChildren(n1, n2, true);\n      } else if (!optimized) {\n        patchChildren(\n          n1,\n          n2,\n          currentContainer,\n          currentAnchor,\n          parentComponent,\n          parentSuspense,\n          namespace,\n          slotScopeIds,\n          false\n        );\n      }\n      if (disabled) {\n        if (!wasDisabled) {\n          moveTeleport(\n            n2,\n            container,\n            mainAnchor,\n            internals,\n            1\n          );\n        } else {\n          if (n2.props && n1.props && n2.props.to !== n1.props.to) {\n            n2.props.to = n1.props.to;\n          }\n        }\n      } else {\n        if ((n2.props && n2.props.to) !== (n1.props && n1.props.to)) {\n          const nextTarget = n2.target = resolveTarget(\n            n2.props,\n            querySelector\n          );\n          if (nextTarget) {\n            moveTeleport(\n              n2,\n              nextTarget,\n              null,\n              internals,\n              0\n            );\n          } else if (!!(process.env.NODE_ENV !== \"production\")) {\n            warn$1(\n              \"Invalid Teleport target on update:\",\n              target,\n              `(${typeof target})`\n            );\n          }\n        } else if (wasDisabled) {\n          moveTeleport(\n            n2,\n            target,\n            targetAnchor,\n            internals,\n            1\n          );\n        }\n      }\n    }\n    updateCssVars(n2);\n  },\n  remove(vnode, parentComponent, parentSuspense, optimized, { um: unmount, o: { remove: hostRemove } }, doRemove) {\n    const { shapeFlag, children, anchor, targetAnchor, target, props } = vnode;\n    if (target) {\n      hostRemove(targetAnchor);\n    }\n    doRemove && hostRemove(anchor);\n    if (shapeFlag & 16) {\n      const shouldRemove = doRemove || !isTeleportDisabled(props);\n      for (let i = 0; i < children.length; i++) {\n        const child = children[i];\n        unmount(\n          child,\n          parentComponent,\n          parentSuspense,\n          shouldRemove,\n          !!child.dynamicChildren\n        );\n      }\n    }\n  },\n  move: moveTeleport,\n  hydrate: hydrateTeleport\n};\nfunction moveTeleport(vnode, container, parentAnchor, { o: { insert }, m: move }, moveType = 2) {\n  if (moveType === 0) {\n    insert(vnode.targetAnchor, container, parentAnchor);\n  }\n  const { el, anchor, shapeFlag, children, props } = vnode;\n  const isReorder = moveType === 2;\n  if (isReorder) {\n    insert(el, container, parentAnchor);\n  }\n  if (!isReorder || isTeleportDisabled(props)) {\n    if (shapeFlag & 16) {\n      for (let i = 0; i < children.length; i++) {\n        move(\n          children[i],\n          container,\n          parentAnchor,\n          2\n        );\n      }\n    }\n  }\n  if (isReorder) {\n    insert(anchor, container, parentAnchor);\n  }\n}\nfunction hydrateTeleport(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized, {\n  o: { nextSibling, parentNode, querySelector }\n}, hydrateChildren) {\n  const target = vnode.target = resolveTarget(\n    vnode.props,\n    querySelector\n  );\n  if (target) {\n    const targetNode = target._lpa || target.firstChild;\n    if (vnode.shapeFlag & 16) {\n      if (isTeleportDisabled(vnode.props)) {\n        vnode.anchor = hydrateChildren(\n          nextSibling(node),\n          vnode,\n          parentNode(node),\n          parentComponent,\n          parentSuspense,\n          slotScopeIds,\n          optimized\n        );\n        vnode.targetAnchor = targetNode;\n      } else {\n        vnode.anchor = nextSibling(node);\n        let targetAnchor = targetNode;\n        while (targetAnchor) {\n          targetAnchor = nextSibling(targetAnchor);\n          if (targetAnchor && targetAnchor.nodeType === 8 && targetAnchor.data === \"teleport anchor\") {\n            vnode.targetAnchor = targetAnchor;\n            target._lpa = vnode.targetAnchor && nextSibling(vnode.targetAnchor);\n            break;\n          }\n        }\n        hydrateChildren(\n          targetNode,\n          vnode,\n          target,\n          parentComponent,\n          parentSuspense,\n          slotScopeIds,\n          optimized\n        );\n      }\n    }\n    updateCssVars(vnode);\n  }\n  return vnode.anchor && nextSibling(vnode.anchor);\n}\nconst Teleport = TeleportImpl;\nfunction updateCssVars(vnode) {\n  const ctx = vnode.ctx;\n  if (ctx && ctx.ut) {\n    let node = vnode.children[0].el;\n    while (node && node !== vnode.targetAnchor) {\n      if (node.nodeType === 1)\n        node.setAttribute(\"data-v-owner\", ctx.uid);\n      node = node.nextSibling;\n    }\n    ctx.ut();\n  }\n}\n\nconst Fragment = Symbol.for(\"v-fgt\");\nconst Text = Symbol.for(\"v-txt\");\nconst Comment = Symbol.for(\"v-cmt\");\nconst Static = Symbol.for(\"v-stc\");\nconst blockStack = [];\nlet currentBlock = null;\nfunction openBlock(disableTracking = false) {\n  blockStack.push(currentBlock = disableTracking ? null : []);\n}\nfunction closeBlock() {\n  blockStack.pop();\n  currentBlock = blockStack[blockStack.length - 1] || null;\n}\nlet isBlockTreeEnabled = 1;\nfunction setBlockTracking(value) {\n  isBlockTreeEnabled += value;\n}\nfunction setupBlock(vnode) {\n  vnode.dynamicChildren = isBlockTreeEnabled > 0 ? currentBlock || EMPTY_ARR : null;\n  closeBlock();\n  if (isBlockTreeEnabled > 0 && currentBlock) {\n    currentBlock.push(vnode);\n  }\n  return vnode;\n}\nfunction createElementBlock(type, props, children, patchFlag, dynamicProps, shapeFlag) {\n  return setupBlock(\n    createBaseVNode(\n      type,\n      props,\n      children,\n      patchFlag,\n      dynamicProps,\n      shapeFlag,\n      true\n    )\n  );\n}\nfunction createBlock(type, props, children, patchFlag, dynamicProps) {\n  return setupBlock(\n    createVNode(\n      type,\n      props,\n      children,\n      patchFlag,\n      dynamicProps,\n      true\n    )\n  );\n}\nfunction isVNode(value) {\n  return value ? value.__v_isVNode === true : false;\n}\nfunction isSameVNodeType(n1, n2) {\n  if (!!(process.env.NODE_ENV !== \"production\") && n2.shapeFlag & 6 && hmrDirtyComponents.has(n2.type)) {\n    n1.shapeFlag &= ~256;\n    n2.shapeFlag &= ~512;\n    return false;\n  }\n  return n1.type === n2.type && n1.key === n2.key;\n}\nlet vnodeArgsTransformer;\nfunction transformVNodeArgs(transformer) {\n  vnodeArgsTransformer = transformer;\n}\nconst createVNodeWithArgsTransform = (...args) => {\n  return _createVNode(\n    ...vnodeArgsTransformer ? vnodeArgsTransformer(args, currentRenderingInstance) : args\n  );\n};\nconst InternalObjectKey = `__vInternal`;\nconst normalizeKey = ({ key }) => key != null ? key : null;\nconst normalizeRef = ({\n  ref,\n  ref_key,\n  ref_for\n}) => {\n  if (typeof ref === \"number\") {\n    ref = \"\" + ref;\n  }\n  return ref != null ? isString(ref) || isRef(ref) || isFunction(ref) ? { i: currentRenderingInstance, r: ref, k: ref_key, f: !!ref_for } : ref : null;\n};\nfunction createBaseVNode(type, props = null, children = null, patchFlag = 0, dynamicProps = null, shapeFlag = type === Fragment ? 0 : 1, isBlockNode = false, needFullChildrenNormalization = false) {\n  const vnode = {\n    __v_isVNode: true,\n    __v_skip: true,\n    type,\n    props,\n    key: props && normalizeKey(props),\n    ref: props && normalizeRef(props),\n    scopeId: currentScopeId,\n    slotScopeIds: null,\n    children,\n    component: null,\n    suspense: null,\n    ssContent: null,\n    ssFallback: null,\n    dirs: null,\n    transition: null,\n    el: null,\n    anchor: null,\n    target: null,\n    targetAnchor: null,\n    staticCount: 0,\n    shapeFlag,\n    patchFlag,\n    dynamicProps,\n    dynamicChildren: null,\n    appContext: null,\n    ctx: currentRenderingInstance\n  };\n  if (needFullChildrenNormalization) {\n    normalizeChildren(vnode, children);\n    if (shapeFlag & 128) {\n      type.normalize(vnode);\n    }\n  } else if (children) {\n    vnode.shapeFlag |= isString(children) ? 8 : 16;\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && vnode.key !== vnode.key) {\n    warn$1(`VNode created with invalid key (NaN). VNode type:`, vnode.type);\n  }\n  if (isBlockTreeEnabled > 0 && // avoid a block node from tracking itself\n  !isBlockNode && // has current parent block\n  currentBlock && // presence of a patch flag indicates this node needs patching on updates.\n  // component nodes also should always be patched, because even if the\n  // component doesn't need to update, it needs to persist the instance on to\n  // the next vnode so that it can be properly unmounted later.\n  (vnode.patchFlag > 0 || shapeFlag & 6) && // the EVENTS flag is only for hydration and if it is the only flag, the\n  // vnode should not be considered dynamic due to handler caching.\n  vnode.patchFlag !== 32) {\n    currentBlock.push(vnode);\n  }\n  return vnode;\n}\nconst createVNode = !!(process.env.NODE_ENV !== \"production\") ? createVNodeWithArgsTransform : _createVNode;\nfunction _createVNode(type, props = null, children = null, patchFlag = 0, dynamicProps = null, isBlockNode = false) {\n  if (!type || type === NULL_DYNAMIC_COMPONENT) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !type) {\n      warn$1(`Invalid vnode type when creating vnode: ${type}.`);\n    }\n    type = Comment;\n  }\n  if (isVNode(type)) {\n    const cloned = cloneVNode(\n      type,\n      props,\n      true\n      /* mergeRef: true */\n    );\n    if (children) {\n      normalizeChildren(cloned, children);\n    }\n    if (isBlockTreeEnabled > 0 && !isBlockNode && currentBlock) {\n      if (cloned.shapeFlag & 6) {\n        currentBlock[currentBlock.indexOf(type)] = cloned;\n      } else {\n        currentBlock.push(cloned);\n      }\n    }\n    cloned.patchFlag |= -2;\n    return cloned;\n  }\n  if (isClassComponent(type)) {\n    type = type.__vccOpts;\n  }\n  if (props) {\n    props = guardReactiveProps(props);\n    let { class: klass, style } = props;\n    if (klass && !isString(klass)) {\n      props.class = normalizeClass(klass);\n    }\n    if (isObject(style)) {\n      if (isProxy(style) && !isArray(style)) {\n        style = extend({}, style);\n      }\n      props.style = normalizeStyle(style);\n    }\n  }\n  const shapeFlag = isString(type) ? 1 : isSuspense(type) ? 128 : isTeleport(type) ? 64 : isObject(type) ? 4 : isFunction(type) ? 2 : 0;\n  if (!!(process.env.NODE_ENV !== \"production\") && shapeFlag & 4 && isProxy(type)) {\n    type = toRaw(type);\n    warn$1(\n      `Vue received a Component that was made a reactive object. This can lead to unnecessary performance overhead and should be avoided by marking the component with \\`markRaw\\` or using \\`shallowRef\\` instead of \\`ref\\`.`,\n      `\nComponent that was made reactive: `,\n      type\n    );\n  }\n  return createBaseVNode(\n    type,\n    props,\n    children,\n    patchFlag,\n    dynamicProps,\n    shapeFlag,\n    isBlockNode,\n    true\n  );\n}\nfunction guardReactiveProps(props) {\n  if (!props)\n    return null;\n  return isProxy(props) || InternalObjectKey in props ? extend({}, props) : props;\n}\nfunction cloneVNode(vnode, extraProps, mergeRef = false) {\n  const { props, ref, patchFlag, children } = vnode;\n  const mergedProps = extraProps ? mergeProps(props || {}, extraProps) : props;\n  const cloned = {\n    __v_isVNode: true,\n    __v_skip: true,\n    type: vnode.type,\n    props: mergedProps,\n    key: mergedProps && normalizeKey(mergedProps),\n    ref: extraProps && extraProps.ref ? (\n      // #2078 in the case of <component :is=\"vnode\" ref=\"extra\"/>\n      // if the vnode itself already has a ref, cloneVNode will need to merge\n      // the refs so the single vnode can be set on multiple refs\n      mergeRef && ref ? isArray(ref) ? ref.concat(normalizeRef(extraProps)) : [ref, normalizeRef(extraProps)] : normalizeRef(extraProps)\n    ) : ref,\n    scopeId: vnode.scopeId,\n    slotScopeIds: vnode.slotScopeIds,\n    children: !!(process.env.NODE_ENV !== \"production\") && patchFlag === -1 && isArray(children) ? children.map(deepCloneVNode) : children,\n    target: vnode.target,\n    targetAnchor: vnode.targetAnchor,\n    staticCount: vnode.staticCount,\n    shapeFlag: vnode.shapeFlag,\n    // if the vnode is cloned with extra props, we can no longer assume its\n    // existing patch flag to be reliable and need to add the FULL_PROPS flag.\n    // note: preserve flag for fragments since they use the flag for children\n    // fast paths only.\n    patchFlag: extraProps && vnode.type !== Fragment ? patchFlag === -1 ? 16 : patchFlag | 16 : patchFlag,\n    dynamicProps: vnode.dynamicProps,\n    dynamicChildren: vnode.dynamicChildren,\n    appContext: vnode.appContext,\n    dirs: vnode.dirs,\n    transition: vnode.transition,\n    // These should technically only be non-null on mounted VNodes. However,\n    // they *should* be copied for kept-alive vnodes. So we just always copy\n    // them since them being non-null during a mount doesn't affect the logic as\n    // they will simply be overwritten.\n    component: vnode.component,\n    suspense: vnode.suspense,\n    ssContent: vnode.ssContent && cloneVNode(vnode.ssContent),\n    ssFallback: vnode.ssFallback && cloneVNode(vnode.ssFallback),\n    el: vnode.el,\n    anchor: vnode.anchor,\n    ctx: vnode.ctx,\n    ce: vnode.ce\n  };\n  return cloned;\n}\nfunction deepCloneVNode(vnode) {\n  const cloned = cloneVNode(vnode);\n  if (isArray(vnode.children)) {\n    cloned.children = vnode.children.map(deepCloneVNode);\n  }\n  return cloned;\n}\nfunction createTextVNode(text = \" \", flag = 0) {\n  return createVNode(Text, null, text, flag);\n}\nfunction createStaticVNode(content, numberOfNodes) {\n  const vnode = createVNode(Static, null, content);\n  vnode.staticCount = numberOfNodes;\n  return vnode;\n}\nfunction createCommentVNode(text = \"\", asBlock = false) {\n  return asBlock ? (openBlock(), createBlock(Comment, null, text)) : createVNode(Comment, null, text);\n}\nfunction normalizeVNode(child) {\n  if (child == null || typeof child === \"boolean\") {\n    return createVNode(Comment);\n  } else if (isArray(child)) {\n    return createVNode(\n      Fragment,\n      null,\n      // #3666, avoid reference pollution when reusing vnode\n      child.slice()\n    );\n  } else if (typeof child === \"object\") {\n    return cloneIfMounted(child);\n  } else {\n    return createVNode(Text, null, String(child));\n  }\n}\nfunction cloneIfMounted(child) {\n  return child.el === null && child.patchFlag !== -1 || child.memo ? child : cloneVNode(child);\n}\nfunction normalizeChildren(vnode, children) {\n  let type = 0;\n  const { shapeFlag } = vnode;\n  if (children == null) {\n    children = null;\n  } else if (isArray(children)) {\n    type = 16;\n  } else if (typeof children === \"object\") {\n    if (shapeFlag & (1 | 64)) {\n      const slot = children.default;\n      if (slot) {\n        slot._c && (slot._d = false);\n        normalizeChildren(vnode, slot());\n        slot._c && (slot._d = true);\n      }\n      return;\n    } else {\n      type = 32;\n      const slotFlag = children._;\n      if (!slotFlag && !(InternalObjectKey in children)) {\n        children._ctx = currentRenderingInstance;\n      } else if (slotFlag === 3 && currentRenderingInstance) {\n        if (currentRenderingInstance.slots._ === 1) {\n          children._ = 1;\n        } else {\n          children._ = 2;\n          vnode.patchFlag |= 1024;\n        }\n      }\n    }\n  } else if (isFunction(children)) {\n    children = { default: children, _ctx: currentRenderingInstance };\n    type = 32;\n  } else {\n    children = String(children);\n    if (shapeFlag & 64) {\n      type = 16;\n      children = [createTextVNode(children)];\n    } else {\n      type = 8;\n    }\n  }\n  vnode.children = children;\n  vnode.shapeFlag |= type;\n}\nfunction mergeProps(...args) {\n  const ret = {};\n  for (let i = 0; i < args.length; i++) {\n    const toMerge = args[i];\n    for (const key in toMerge) {\n      if (key === \"class\") {\n        if (ret.class !== toMerge.class) {\n          ret.class = normalizeClass([ret.class, toMerge.class]);\n        }\n      } else if (key === \"style\") {\n        ret.style = normalizeStyle([ret.style, toMerge.style]);\n      } else if (isOn(key)) {\n        const existing = ret[key];\n        const incoming = toMerge[key];\n        if (incoming && existing !== incoming && !(isArray(existing) && existing.includes(incoming))) {\n          ret[key] = existing ? [].concat(existing, incoming) : incoming;\n        }\n      } else if (key !== \"\") {\n        ret[key] = toMerge[key];\n      }\n    }\n  }\n  return ret;\n}\nfunction invokeVNodeHook(hook, instance, vnode, prevVNode = null) {\n  callWithAsyncErrorHandling(hook, instance, 7, [\n    vnode,\n    prevVNode\n  ]);\n}\n\nconst emptyAppContext = createAppContext();\nlet uid = 0;\nfunction createComponentInstance(vnode, parent, suspense) {\n  const type = vnode.type;\n  const appContext = (parent ? parent.appContext : vnode.appContext) || emptyAppContext;\n  const instance = {\n    uid: uid++,\n    vnode,\n    type,\n    parent,\n    appContext,\n    root: null,\n    // to be immediately set\n    next: null,\n    subTree: null,\n    // will be set synchronously right after creation\n    effect: null,\n    update: null,\n    // will be set synchronously right after creation\n    scope: new EffectScope(\n      true\n      /* detached */\n    ),\n    render: null,\n    proxy: null,\n    exposed: null,\n    exposeProxy: null,\n    withProxy: null,\n    provides: parent ? parent.provides : Object.create(appContext.provides),\n    accessCache: null,\n    renderCache: [],\n    // local resolved assets\n    components: null,\n    directives: null,\n    // resolved props and emits options\n    propsOptions: normalizePropsOptions(type, appContext),\n    emitsOptions: normalizeEmitsOptions(type, appContext),\n    // emit\n    emit: null,\n    // to be set immediately\n    emitted: null,\n    // props default value\n    propsDefaults: EMPTY_OBJ,\n    // inheritAttrs\n    inheritAttrs: type.inheritAttrs,\n    // state\n    ctx: EMPTY_OBJ,\n    data: EMPTY_OBJ,\n    props: EMPTY_OBJ,\n    attrs: EMPTY_OBJ,\n    slots: EMPTY_OBJ,\n    refs: EMPTY_OBJ,\n    setupState: EMPTY_OBJ,\n    setupContext: null,\n    attrsProxy: null,\n    slotsProxy: null,\n    // suspense related\n    suspense,\n    suspenseId: suspense ? suspense.pendingId : 0,\n    asyncDep: null,\n    asyncResolved: false,\n    // lifecycle hooks\n    // not using enums here because it results in computed properties\n    isMounted: false,\n    isUnmounted: false,\n    isDeactivated: false,\n    bc: null,\n    c: null,\n    bm: null,\n    m: null,\n    bu: null,\n    u: null,\n    um: null,\n    bum: null,\n    da: null,\n    a: null,\n    rtg: null,\n    rtc: null,\n    ec: null,\n    sp: null\n  };\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    instance.ctx = createDevRenderContext(instance);\n  } else {\n    instance.ctx = { _: instance };\n  }\n  instance.root = parent ? parent.root : instance;\n  instance.emit = emit.bind(null, instance);\n  if (vnode.ce) {\n    vnode.ce(instance);\n  }\n  return instance;\n}\nlet currentInstance = null;\nconst getCurrentInstance = () => currentInstance || currentRenderingInstance;\nlet internalSetCurrentInstance;\nlet setInSSRSetupState;\n{\n  const g = getGlobalThis();\n  const registerGlobalSetter = (key, setter) => {\n    let setters;\n    if (!(setters = g[key]))\n      setters = g[key] = [];\n    setters.push(setter);\n    return (v) => {\n      if (setters.length > 1)\n        setters.forEach((set) => set(v));\n      else\n        setters[0](v);\n    };\n  };\n  internalSetCurrentInstance = registerGlobalSetter(\n    `__VUE_INSTANCE_SETTERS__`,\n    (v) => currentInstance = v\n  );\n  setInSSRSetupState = registerGlobalSetter(\n    `__VUE_SSR_SETTERS__`,\n    (v) => isInSSRComponentSetup = v\n  );\n}\nconst setCurrentInstance = (instance) => {\n  const prev = currentInstance;\n  internalSetCurrentInstance(instance);\n  instance.scope.on();\n  return () => {\n    instance.scope.off();\n    internalSetCurrentInstance(prev);\n  };\n};\nconst unsetCurrentInstance = () => {\n  currentInstance && currentInstance.scope.off();\n  internalSetCurrentInstance(null);\n};\nconst isBuiltInTag = /* @__PURE__ */ makeMap(\"slot,component\");\nfunction validateComponentName(name, config) {\n  const appIsNativeTag = config.isNativeTag || NO;\n  if (isBuiltInTag(name) || appIsNativeTag(name)) {\n    warn$1(\n      \"Do not use built-in or reserved HTML elements as component id: \" + name\n    );\n  }\n}\nfunction isStatefulComponent(instance) {\n  return instance.vnode.shapeFlag & 4;\n}\nlet isInSSRComponentSetup = false;\nfunction setupComponent(instance, isSSR = false) {\n  isSSR && setInSSRSetupState(isSSR);\n  const { props, children } = instance.vnode;\n  const isStateful = isStatefulComponent(instance);\n  initProps(instance, props, isStateful, isSSR);\n  initSlots(instance, children);\n  const setupResult = isStateful ? setupStatefulComponent(instance, isSSR) : void 0;\n  isSSR && setInSSRSetupState(false);\n  return setupResult;\n}\nfunction setupStatefulComponent(instance, isSSR) {\n  var _a;\n  const Component = instance.type;\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    if (Component.name) {\n      validateComponentName(Component.name, instance.appContext.config);\n    }\n    if (Component.components) {\n      const names = Object.keys(Component.components);\n      for (let i = 0; i < names.length; i++) {\n        validateComponentName(names[i], instance.appContext.config);\n      }\n    }\n    if (Component.directives) {\n      const names = Object.keys(Component.directives);\n      for (let i = 0; i < names.length; i++) {\n        validateDirectiveName(names[i]);\n      }\n    }\n    if (Component.compilerOptions && isRuntimeOnly()) {\n      warn$1(\n        `\"compilerOptions\" is only supported when using a build of Vue that includes the runtime compiler. Since you are using a runtime-only build, the options should be passed via your build tool config instead.`\n      );\n    }\n  }\n  instance.accessCache = /* @__PURE__ */ Object.create(null);\n  instance.proxy = markRaw(new Proxy(instance.ctx, PublicInstanceProxyHandlers));\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    exposePropsOnRenderContext(instance);\n  }\n  const { setup } = Component;\n  if (setup) {\n    const setupContext = instance.setupContext = setup.length > 1 ? createSetupContext(instance) : null;\n    const reset = setCurrentInstance(instance);\n    pauseTracking();\n    const setupResult = callWithErrorHandling(\n      setup,\n      instance,\n      0,\n      [\n        !!(process.env.NODE_ENV !== \"production\") ? shallowReadonly(instance.props) : instance.props,\n        setupContext\n      ]\n    );\n    resetTracking();\n    reset();\n    if (isPromise(setupResult)) {\n      setupResult.then(unsetCurrentInstance, unsetCurrentInstance);\n      if (isSSR) {\n        return setupResult.then((resolvedResult) => {\n          handleSetupResult(instance, resolvedResult, isSSR);\n        }).catch((e) => {\n          handleError(e, instance, 0);\n        });\n      } else {\n        instance.asyncDep = setupResult;\n        if (!!(process.env.NODE_ENV !== \"production\") && !instance.suspense) {\n          const name = (_a = Component.name) != null ? _a : \"Anonymous\";\n          warn$1(\n            `Component <${name}>: setup function returned a promise, but no <Suspense> boundary was found in the parent component tree. A component with async setup() must be nested in a <Suspense> in order to be rendered.`\n          );\n        }\n      }\n    } else {\n      handleSetupResult(instance, setupResult, isSSR);\n    }\n  } else {\n    finishComponentSetup(instance, isSSR);\n  }\n}\nfunction handleSetupResult(instance, setupResult, isSSR) {\n  if (isFunction(setupResult)) {\n    if (instance.type.__ssrInlineRender) {\n      instance.ssrRender = setupResult;\n    } else {\n      instance.render = setupResult;\n    }\n  } else if (isObject(setupResult)) {\n    if (!!(process.env.NODE_ENV !== \"production\") && isVNode(setupResult)) {\n      warn$1(\n        `setup() should not return VNodes directly - return a render function instead.`\n      );\n    }\n    if (!!(process.env.NODE_ENV !== \"production\") || __VUE_PROD_DEVTOOLS__) {\n      instance.devtoolsRawSetupState = setupResult;\n    }\n    instance.setupState = proxyRefs(setupResult);\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      exposeSetupStateOnRenderContext(instance);\n    }\n  } else if (!!(process.env.NODE_ENV !== \"production\") && setupResult !== void 0) {\n    warn$1(\n      `setup() should return an object. Received: ${setupResult === null ? \"null\" : typeof setupResult}`\n    );\n  }\n  finishComponentSetup(instance, isSSR);\n}\nlet compile;\nlet installWithProxy;\nfunction registerRuntimeCompiler(_compile) {\n  compile = _compile;\n  installWithProxy = (i) => {\n    if (i.render._rc) {\n      i.withProxy = new Proxy(i.ctx, RuntimeCompiledPublicInstanceProxyHandlers);\n    }\n  };\n}\nconst isRuntimeOnly = () => !compile;\nfunction finishComponentSetup(instance, isSSR, skipOptions) {\n  const Component = instance.type;\n  if (!instance.render) {\n    if (!isSSR && compile && !Component.render) {\n      const template = Component.template || resolveMergedOptions(instance).template;\n      if (template) {\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          startMeasure(instance, `compile`);\n        }\n        const { isCustomElement, compilerOptions } = instance.appContext.config;\n        const { delimiters, compilerOptions: componentCompilerOptions } = Component;\n        const finalCompilerOptions = extend(\n          extend(\n            {\n              isCustomElement,\n              delimiters\n            },\n            compilerOptions\n          ),\n          componentCompilerOptions\n        );\n        Component.render = compile(template, finalCompilerOptions);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          endMeasure(instance, `compile`);\n        }\n      }\n    }\n    instance.render = Component.render || NOOP;\n    if (installWithProxy) {\n      installWithProxy(instance);\n    }\n  }\n  if (__VUE_OPTIONS_API__ && true) {\n    const reset = setCurrentInstance(instance);\n    pauseTracking();\n    try {\n      applyOptions(instance);\n    } finally {\n      resetTracking();\n      reset();\n    }\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && !Component.render && instance.render === NOOP && !isSSR) {\n    if (!compile && Component.template) {\n      warn$1(\n        `Component provided template option but runtime compilation is not supported in this build of Vue.` + (` Configure your bundler to alias \"vue\" to \"vue/dist/vue.esm-bundler.js\".` )\n      );\n    } else {\n      warn$1(`Component is missing template or render function.`);\n    }\n  }\n}\nfunction getAttrsProxy(instance) {\n  return instance.attrsProxy || (instance.attrsProxy = new Proxy(\n    instance.attrs,\n    !!(process.env.NODE_ENV !== \"production\") ? {\n      get(target, key) {\n        markAttrsAccessed();\n        track(instance, \"get\", \"$attrs\");\n        return target[key];\n      },\n      set() {\n        warn$1(`setupContext.attrs is readonly.`);\n        return false;\n      },\n      deleteProperty() {\n        warn$1(`setupContext.attrs is readonly.`);\n        return false;\n      }\n    } : {\n      get(target, key) {\n        track(instance, \"get\", \"$attrs\");\n        return target[key];\n      }\n    }\n  ));\n}\nfunction getSlotsProxy(instance) {\n  return instance.slotsProxy || (instance.slotsProxy = new Proxy(instance.slots, {\n    get(target, key) {\n      track(instance, \"get\", \"$slots\");\n      return target[key];\n    }\n  }));\n}\nfunction createSetupContext(instance) {\n  const expose = (exposed) => {\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      if (instance.exposed) {\n        warn$1(`expose() should be called only once per setup().`);\n      }\n      if (exposed != null) {\n        let exposedType = typeof exposed;\n        if (exposedType === \"object\") {\n          if (isArray(exposed)) {\n            exposedType = \"array\";\n          } else if (isRef(exposed)) {\n            exposedType = \"ref\";\n          }\n        }\n        if (exposedType !== \"object\") {\n          warn$1(\n            `expose() should be passed a plain object, received ${exposedType}.`\n          );\n        }\n      }\n    }\n    instance.exposed = exposed || {};\n  };\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    return Object.freeze({\n      get attrs() {\n        return getAttrsProxy(instance);\n      },\n      get slots() {\n        return getSlotsProxy(instance);\n      },\n      get emit() {\n        return (event, ...args) => instance.emit(event, ...args);\n      },\n      expose\n    });\n  } else {\n    return {\n      get attrs() {\n        return getAttrsProxy(instance);\n      },\n      slots: instance.slots,\n      emit: instance.emit,\n      expose\n    };\n  }\n}\nfunction getExposeProxy(instance) {\n  if (instance.exposed) {\n    return instance.exposeProxy || (instance.exposeProxy = new Proxy(proxyRefs(markRaw(instance.exposed)), {\n      get(target, key) {\n        if (key in target) {\n          return target[key];\n        } else if (key in publicPropertiesMap) {\n          return publicPropertiesMap[key](instance);\n        }\n      },\n      has(target, key) {\n        return key in target || key in publicPropertiesMap;\n      }\n    }));\n  }\n}\nconst classifyRE = /(?:^|[-_])(\\w)/g;\nconst classify = (str) => str.replace(classifyRE, (c) => c.toUpperCase()).replace(/[-_]/g, \"\");\nfunction getComponentName(Component, includeInferred = true) {\n  return isFunction(Component) ? Component.displayName || Component.name : Component.name || includeInferred && Component.__name;\n}\nfunction formatComponentName(instance, Component, isRoot = false) {\n  let name = getComponentName(Component);\n  if (!name && Component.__file) {\n    const match = Component.__file.match(/([^/\\\\]+)\\.\\w+$/);\n    if (match) {\n      name = match[1];\n    }\n  }\n  if (!name && instance && instance.parent) {\n    const inferFromRegistry = (registry) => {\n      for (const key in registry) {\n        if (registry[key] === Component) {\n          return key;\n        }\n      }\n    };\n    name = inferFromRegistry(\n      instance.components || instance.parent.type.components\n    ) || inferFromRegistry(instance.appContext.components);\n  }\n  return name ? classify(name) : isRoot ? `App` : `Anonymous`;\n}\nfunction isClassComponent(value) {\n  return isFunction(value) && \"__vccOpts\" in value;\n}\n\nconst computed = (getterOrOptions, debugOptions) => {\n  return computed$1(getterOrOptions, debugOptions, isInSSRComponentSetup);\n};\n\nfunction useModel(props, name, options = EMPTY_OBJ) {\n  const i = getCurrentInstance();\n  if (!!(process.env.NODE_ENV !== \"production\") && !i) {\n    warn$1(`useModel() called without active instance.`);\n    return ref();\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && !i.propsOptions[0][name]) {\n    warn$1(`useModel() called with prop \"${name}\" which is not declared.`);\n    return ref();\n  }\n  const camelizedName = camelize(name);\n  const hyphenatedName = hyphenate(name);\n  const res = customRef((track, trigger) => {\n    let localValue;\n    watchSyncEffect(() => {\n      const propValue = props[name];\n      if (hasChanged(localValue, propValue)) {\n        localValue = propValue;\n        trigger();\n      }\n    });\n    return {\n      get() {\n        track();\n        return options.get ? options.get(localValue) : localValue;\n      },\n      set(value) {\n        const rawProps = i.vnode.props;\n        if (!(rawProps && // check if parent has passed v-model\n        (name in rawProps || camelizedName in rawProps || hyphenatedName in rawProps) && (`onUpdate:${name}` in rawProps || `onUpdate:${camelizedName}` in rawProps || `onUpdate:${hyphenatedName}` in rawProps)) && hasChanged(value, localValue)) {\n          localValue = value;\n          trigger();\n        }\n        i.emit(`update:${name}`, options.set ? options.set(value) : value);\n      }\n    };\n  });\n  const modifierKey = name === \"modelValue\" ? \"modelModifiers\" : `${name}Modifiers`;\n  res[Symbol.iterator] = () => {\n    let i2 = 0;\n    return {\n      next() {\n        if (i2 < 2) {\n          return { value: i2++ ? props[modifierKey] || {} : res, done: false };\n        } else {\n          return { done: true };\n        }\n      }\n    };\n  };\n  return res;\n}\n\nfunction h(type, propsOrChildren, children) {\n  const l = arguments.length;\n  if (l === 2) {\n    if (isObject(propsOrChildren) && !isArray(propsOrChildren)) {\n      if (isVNode(propsOrChildren)) {\n        return createVNode(type, null, [propsOrChildren]);\n      }\n      return createVNode(type, propsOrChildren);\n    } else {\n      return createVNode(type, null, propsOrChildren);\n    }\n  } else {\n    if (l > 3) {\n      children = Array.prototype.slice.call(arguments, 2);\n    } else if (l === 3 && isVNode(children)) {\n      children = [children];\n    }\n    return createVNode(type, propsOrChildren, children);\n  }\n}\n\nfunction isShallow(value) {\n  return !!(value && value[\"__v_isShallow\"]);\n}\n\nfunction initCustomFormatter() {\n  if (!!!(process.env.NODE_ENV !== \"production\") || typeof window === \"undefined\") {\n    return;\n  }\n  const vueStyle = { style: \"color:#3ba776\" };\n  const numberStyle = { style: \"color:#1677ff\" };\n  const stringStyle = { style: \"color:#f5222d\" };\n  const keywordStyle = { style: \"color:#eb2f96\" };\n  const formatter = {\n    header(obj) {\n      if (!isObject(obj)) {\n        return null;\n      }\n      if (obj.__isVue) {\n        return [\"div\", vueStyle, `VueInstance`];\n      } else if (isRef(obj)) {\n        return [\n          \"div\",\n          {},\n          [\"span\", vueStyle, genRefFlag(obj)],\n          \"<\",\n          formatValue(obj.value),\n          `>`\n        ];\n      } else if (isReactive(obj)) {\n        return [\n          \"div\",\n          {},\n          [\"span\", vueStyle, isShallow(obj) ? \"ShallowReactive\" : \"Reactive\"],\n          \"<\",\n          formatValue(obj),\n          `>${isReadonly(obj) ? ` (readonly)` : ``}`\n        ];\n      } else if (isReadonly(obj)) {\n        return [\n          \"div\",\n          {},\n          [\"span\", vueStyle, isShallow(obj) ? \"ShallowReadonly\" : \"Readonly\"],\n          \"<\",\n          formatValue(obj),\n          \">\"\n        ];\n      }\n      return null;\n    },\n    hasBody(obj) {\n      return obj && obj.__isVue;\n    },\n    body(obj) {\n      if (obj && obj.__isVue) {\n        return [\n          \"div\",\n          {},\n          ...formatInstance(obj.$)\n        ];\n      }\n    }\n  };\n  function formatInstance(instance) {\n    const blocks = [];\n    if (instance.type.props && instance.props) {\n      blocks.push(createInstanceBlock(\"props\", toRaw(instance.props)));\n    }\n    if (instance.setupState !== EMPTY_OBJ) {\n      blocks.push(createInstanceBlock(\"setup\", instance.setupState));\n    }\n    if (instance.data !== EMPTY_OBJ) {\n      blocks.push(createInstanceBlock(\"data\", toRaw(instance.data)));\n    }\n    const computed = extractKeys(instance, \"computed\");\n    if (computed) {\n      blocks.push(createInstanceBlock(\"computed\", computed));\n    }\n    const injected = extractKeys(instance, \"inject\");\n    if (injected) {\n      blocks.push(createInstanceBlock(\"injected\", injected));\n    }\n    blocks.push([\n      \"div\",\n      {},\n      [\n        \"span\",\n        {\n          style: keywordStyle.style + \";opacity:0.66\"\n        },\n        \"$ (internal): \"\n      ],\n      [\"object\", { object: instance }]\n    ]);\n    return blocks;\n  }\n  function createInstanceBlock(type, target) {\n    target = extend({}, target);\n    if (!Object.keys(target).length) {\n      return [\"span\", {}];\n    }\n    return [\n      \"div\",\n      { style: \"line-height:1.25em;margin-bottom:0.6em\" },\n      [\n        \"div\",\n        {\n          style: \"color:#476582\"\n        },\n        type\n      ],\n      [\n        \"div\",\n        {\n          style: \"padding-left:1.25em\"\n        },\n        ...Object.keys(target).map((key) => {\n          return [\n            \"div\",\n            {},\n            [\"span\", keywordStyle, key + \": \"],\n            formatValue(target[key], false)\n          ];\n        })\n      ]\n    ];\n  }\n  function formatValue(v, asRaw = true) {\n    if (typeof v === \"number\") {\n      return [\"span\", numberStyle, v];\n    } else if (typeof v === \"string\") {\n      return [\"span\", stringStyle, JSON.stringify(v)];\n    } else if (typeof v === \"boolean\") {\n      return [\"span\", keywordStyle, v];\n    } else if (isObject(v)) {\n      return [\"object\", { object: asRaw ? toRaw(v) : v }];\n    } else {\n      return [\"span\", stringStyle, String(v)];\n    }\n  }\n  function extractKeys(instance, type) {\n    const Comp = instance.type;\n    if (isFunction(Comp)) {\n      return;\n    }\n    const extracted = {};\n    for (const key in instance.ctx) {\n      if (isKeyOfType(Comp, key, type)) {\n        extracted[key] = instance.ctx[key];\n      }\n    }\n    return extracted;\n  }\n  function isKeyOfType(Comp, key, type) {\n    const opts = Comp[type];\n    if (isArray(opts) && opts.includes(key) || isObject(opts) && key in opts) {\n      return true;\n    }\n    if (Comp.extends && isKeyOfType(Comp.extends, key, type)) {\n      return true;\n    }\n    if (Comp.mixins && Comp.mixins.some((m) => isKeyOfType(m, key, type))) {\n      return true;\n    }\n  }\n  function genRefFlag(v) {\n    if (isShallow(v)) {\n      return `ShallowRef`;\n    }\n    if (v.effect) {\n      return `ComputedRef`;\n    }\n    return `Ref`;\n  }\n  if (window.devtoolsFormatters) {\n    window.devtoolsFormatters.push(formatter);\n  } else {\n    window.devtoolsFormatters = [formatter];\n  }\n}\n\nfunction withMemo(memo, render, cache, index) {\n  const cached = cache[index];\n  if (cached && isMemoSame(cached, memo)) {\n    return cached;\n  }\n  const ret = render();\n  ret.memo = memo.slice();\n  return cache[index] = ret;\n}\nfunction isMemoSame(cached, memo) {\n  const prev = cached.memo;\n  if (prev.length != memo.length) {\n    return false;\n  }\n  for (let i = 0; i < prev.length; i++) {\n    if (hasChanged(prev[i], memo[i])) {\n      return false;\n    }\n  }\n  if (isBlockTreeEnabled > 0 && currentBlock) {\n    currentBlock.push(cached);\n  }\n  return true;\n}\n\nconst version = \"3.4.15\";\nconst warn = !!(process.env.NODE_ENV !== \"production\") ? warn$1 : NOOP;\nconst ErrorTypeStrings = ErrorTypeStrings$1 ;\nconst devtools = !!(process.env.NODE_ENV !== \"production\") || true ? devtools$1 : void 0;\nconst setDevtoolsHook = !!(process.env.NODE_ENV !== \"production\") || true ? setDevtoolsHook$1 : NOOP;\nconst _ssrUtils = {\n  createComponentInstance,\n  setupComponent,\n  renderComponentRoot,\n  setCurrentRenderingInstance,\n  isVNode: isVNode,\n  normalizeVNode\n};\nconst ssrUtils = _ssrUtils ;\nconst resolveFilter = null;\nconst compatUtils = null;\nconst DeprecationTypes = null;\n\nexport { BaseTransition, BaseTransitionPropsValidators, Comment, DeprecationTypes, ErrorCodes, ErrorTypeStrings, Fragment, KeepAlive, Static, Suspense, Teleport, Text, assertNumber, callWithAsyncErrorHandling, callWithErrorHandling, cloneVNode, compatUtils, computed, createBlock, createCommentVNode, createElementBlock, createBaseVNode as createElementVNode, createHydrationRenderer, createPropsRestProxy, createRenderer, createSlots, createStaticVNode, createTextVNode, createVNode, defineAsyncComponent, defineComponent, defineEmits, defineExpose, defineModel, defineOptions, defineProps, defineSlots, devtools, getCurrentInstance, getTransitionRawChildren, guardReactiveProps, h, handleError, hasInjectionContext, initCustomFormatter, inject, isMemoSame, isRuntimeOnly, isVNode, mergeDefaults, mergeModels, mergeProps, nextTick, onActivated, onBeforeMount, onBeforeUnmount, onBeforeUpdate, onDeactivated, onErrorCaptured, onMounted, onRenderTracked, onRenderTriggered, onServerPrefetch, onUnmounted, onUpdated, openBlock, popScopeId, provide, pushScopeId, queuePostFlushCb, registerRuntimeCompiler, renderList, renderSlot, resolveComponent, resolveDirective, resolveDynamicComponent, resolveFilter, resolveTransitionHooks, setBlockTracking, setDevtoolsHook, setTransitionHooks, ssrContextKey, ssrUtils, toHandlers, transformVNodeArgs, useAttrs, useModel, useSSRContext, useSlots, useTransitionState, version, warn, watch, watchEffect, watchPostEffect, watchSyncEffect, withAsyncContext, withCtx, withDefaults, withDirectives, withMemo, withScopeId };\n","/**\n* @vue/runtime-dom v3.4.15\n* (c) 2018-present Yuxi (Evan) You and Vue contributors\n* @license MIT\n**/\nimport { h, BaseTransition, BaseTransitionPropsValidators, assertNumber, getCurrentInstance, warn, watchPostEffect, onMounted, onUnmounted, Fragment, Static, camelize, callWithAsyncErrorHandling, defineComponent, nextTick, createVNode, useTransitionState, onUpdated, toRaw, getTransitionRawChildren, setTransitionHooks, resolveTransitionHooks, isRuntimeOnly, createRenderer, createHydrationRenderer } from '@vue/runtime-core';\nexport * from '@vue/runtime-core';\nimport { extend, isObject, toNumber, isArray, isString, hyphenate, capitalize, isSpecialBooleanAttr, includeBooleanAttr, isOn, isModelListener, isFunction, camelize as camelize$1, EMPTY_OBJ, looseToNumber, looseIndexOf, isSet, looseEqual, invokeArrayFns, isHTMLTag, isSVGTag, isMathMLTag } from '@vue/shared';\n\nconst svgNS = \"http://www.w3.org/2000/svg\";\nconst mathmlNS = \"http://www.w3.org/1998/Math/MathML\";\nconst doc = typeof document !== \"undefined\" ? document : null;\nconst templateContainer = doc && /* @__PURE__ */ doc.createElement(\"template\");\nconst nodeOps = {\n  insert: (child, parent, anchor) => {\n    parent.insertBefore(child, anchor || null);\n  },\n  remove: (child) => {\n    const parent = child.parentNode;\n    if (parent) {\n      parent.removeChild(child);\n    }\n  },\n  createElement: (tag, namespace, is, props) => {\n    const el = namespace === \"svg\" ? doc.createElementNS(svgNS, tag) : namespace === \"mathml\" ? doc.createElementNS(mathmlNS, tag) : doc.createElement(tag, is ? { is } : void 0);\n    if (tag === \"select\" && props && props.multiple != null) {\n      el.setAttribute(\"multiple\", props.multiple);\n    }\n    return el;\n  },\n  createText: (text) => doc.createTextNode(text),\n  createComment: (text) => doc.createComment(text),\n  setText: (node, text) => {\n    node.nodeValue = text;\n  },\n  setElementText: (el, text) => {\n    el.textContent = text;\n  },\n  parentNode: (node) => node.parentNode,\n  nextSibling: (node) => node.nextSibling,\n  querySelector: (selector) => doc.querySelector(selector),\n  setScopeId(el, id) {\n    el.setAttribute(id, \"\");\n  },\n  // __UNSAFE__\n  // Reason: innerHTML.\n  // Static content here can only come from compiled templates.\n  // As long as the user only uses trusted templates, this is safe.\n  insertStaticContent(content, parent, anchor, namespace, start, end) {\n    const before = anchor ? anchor.previousSibling : parent.lastChild;\n    if (start && (start === end || start.nextSibling)) {\n      while (true) {\n        parent.insertBefore(start.cloneNode(true), anchor);\n        if (start === end || !(start = start.nextSibling))\n          break;\n      }\n    } else {\n      templateContainer.innerHTML = namespace === \"svg\" ? `<svg>${content}</svg>` : namespace === \"mathml\" ? `<math>${content}</math>` : content;\n      const template = templateContainer.content;\n      if (namespace === \"svg\" || namespace === \"mathml\") {\n        const wrapper = template.firstChild;\n        while (wrapper.firstChild) {\n          template.appendChild(wrapper.firstChild);\n        }\n        template.removeChild(wrapper);\n      }\n      parent.insertBefore(template, anchor);\n    }\n    return [\n      // first\n      before ? before.nextSibling : parent.firstChild,\n      // last\n      anchor ? anchor.previousSibling : parent.lastChild\n    ];\n  }\n};\n\nconst TRANSITION = \"transition\";\nconst ANIMATION = \"animation\";\nconst vtcKey = Symbol(\"_vtc\");\nconst Transition = (props, { slots }) => h(BaseTransition, resolveTransitionProps(props), slots);\nTransition.displayName = \"Transition\";\nconst DOMTransitionPropsValidators = {\n  name: String,\n  type: String,\n  css: {\n    type: Boolean,\n    default: true\n  },\n  duration: [String, Number, Object],\n  enterFromClass: String,\n  enterActiveClass: String,\n  enterToClass: String,\n  appearFromClass: String,\n  appearActiveClass: String,\n  appearToClass: String,\n  leaveFromClass: String,\n  leaveActiveClass: String,\n  leaveToClass: String\n};\nconst TransitionPropsValidators = Transition.props = /* @__PURE__ */ extend(\n  {},\n  BaseTransitionPropsValidators,\n  DOMTransitionPropsValidators\n);\nconst callHook = (hook, args = []) => {\n  if (isArray(hook)) {\n    hook.forEach((h2) => h2(...args));\n  } else if (hook) {\n    hook(...args);\n  }\n};\nconst hasExplicitCallback = (hook) => {\n  return hook ? isArray(hook) ? hook.some((h2) => h2.length > 1) : hook.length > 1 : false;\n};\nfunction resolveTransitionProps(rawProps) {\n  const baseProps = {};\n  for (const key in rawProps) {\n    if (!(key in DOMTransitionPropsValidators)) {\n      baseProps[key] = rawProps[key];\n    }\n  }\n  if (rawProps.css === false) {\n    return baseProps;\n  }\n  const {\n    name = \"v\",\n    type,\n    duration,\n    enterFromClass = `${name}-enter-from`,\n    enterActiveClass = `${name}-enter-active`,\n    enterToClass = `${name}-enter-to`,\n    appearFromClass = enterFromClass,\n    appearActiveClass = enterActiveClass,\n    appearToClass = enterToClass,\n    leaveFromClass = `${name}-leave-from`,\n    leaveActiveClass = `${name}-leave-active`,\n    leaveToClass = `${name}-leave-to`\n  } = rawProps;\n  const durations = normalizeDuration(duration);\n  const enterDuration = durations && durations[0];\n  const leaveDuration = durations && durations[1];\n  const {\n    onBeforeEnter,\n    onEnter,\n    onEnterCancelled,\n    onLeave,\n    onLeaveCancelled,\n    onBeforeAppear = onBeforeEnter,\n    onAppear = onEnter,\n    onAppearCancelled = onEnterCancelled\n  } = baseProps;\n  const finishEnter = (el, isAppear, done) => {\n    removeTransitionClass(el, isAppear ? appearToClass : enterToClass);\n    removeTransitionClass(el, isAppear ? appearActiveClass : enterActiveClass);\n    done && done();\n  };\n  const finishLeave = (el, done) => {\n    el._isLeaving = false;\n    removeTransitionClass(el, leaveFromClass);\n    removeTransitionClass(el, leaveToClass);\n    removeTransitionClass(el, leaveActiveClass);\n    done && done();\n  };\n  const makeEnterHook = (isAppear) => {\n    return (el, done) => {\n      const hook = isAppear ? onAppear : onEnter;\n      const resolve = () => finishEnter(el, isAppear, done);\n      callHook(hook, [el, resolve]);\n      nextFrame(() => {\n        removeTransitionClass(el, isAppear ? appearFromClass : enterFromClass);\n        addTransitionClass(el, isAppear ? appearToClass : enterToClass);\n        if (!hasExplicitCallback(hook)) {\n          whenTransitionEnds(el, type, enterDuration, resolve);\n        }\n      });\n    };\n  };\n  return extend(baseProps, {\n    onBeforeEnter(el) {\n      callHook(onBeforeEnter, [el]);\n      addTransitionClass(el, enterFromClass);\n      addTransitionClass(el, enterActiveClass);\n    },\n    onBeforeAppear(el) {\n      callHook(onBeforeAppear, [el]);\n      addTransitionClass(el, appearFromClass);\n      addTransitionClass(el, appearActiveClass);\n    },\n    onEnter: makeEnterHook(false),\n    onAppear: makeEnterHook(true),\n    onLeave(el, done) {\n      el._isLeaving = true;\n      const resolve = () => finishLeave(el, done);\n      addTransitionClass(el, leaveFromClass);\n      forceReflow();\n      addTransitionClass(el, leaveActiveClass);\n      nextFrame(() => {\n        if (!el._isLeaving) {\n          return;\n        }\n        removeTransitionClass(el, leaveFromClass);\n        addTransitionClass(el, leaveToClass);\n        if (!hasExplicitCallback(onLeave)) {\n          whenTransitionEnds(el, type, leaveDuration, resolve);\n        }\n      });\n      callHook(onLeave, [el, resolve]);\n    },\n    onEnterCancelled(el) {\n      finishEnter(el, false);\n      callHook(onEnterCancelled, [el]);\n    },\n    onAppearCancelled(el) {\n      finishEnter(el, true);\n      callHook(onAppearCancelled, [el]);\n    },\n    onLeaveCancelled(el) {\n      finishLeave(el);\n      callHook(onLeaveCancelled, [el]);\n    }\n  });\n}\nfunction normalizeDuration(duration) {\n  if (duration == null) {\n    return null;\n  } else if (isObject(duration)) {\n    return [NumberOf(duration.enter), NumberOf(duration.leave)];\n  } else {\n    const n = NumberOf(duration);\n    return [n, n];\n  }\n}\nfunction NumberOf(val) {\n  const res = toNumber(val);\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    assertNumber(res, \"<transition> explicit duration\");\n  }\n  return res;\n}\nfunction addTransitionClass(el, cls) {\n  cls.split(/\\s+/).forEach((c) => c && el.classList.add(c));\n  (el[vtcKey] || (el[vtcKey] = /* @__PURE__ */ new Set())).add(cls);\n}\nfunction removeTransitionClass(el, cls) {\n  cls.split(/\\s+/).forEach((c) => c && el.classList.remove(c));\n  const _vtc = el[vtcKey];\n  if (_vtc) {\n    _vtc.delete(cls);\n    if (!_vtc.size) {\n      el[vtcKey] = void 0;\n    }\n  }\n}\nfunction nextFrame(cb) {\n  requestAnimationFrame(() => {\n    requestAnimationFrame(cb);\n  });\n}\nlet endId = 0;\nfunction whenTransitionEnds(el, expectedType, explicitTimeout, resolve) {\n  const id = el._endId = ++endId;\n  const resolveIfNotStale = () => {\n    if (id === el._endId) {\n      resolve();\n    }\n  };\n  if (explicitTimeout) {\n    return setTimeout(resolveIfNotStale, explicitTimeout);\n  }\n  const { type, timeout, propCount } = getTransitionInfo(el, expectedType);\n  if (!type) {\n    return resolve();\n  }\n  const endEvent = type + \"end\";\n  let ended = 0;\n  const end = () => {\n    el.removeEventListener(endEvent, onEnd);\n    resolveIfNotStale();\n  };\n  const onEnd = (e) => {\n    if (e.target === el && ++ended >= propCount) {\n      end();\n    }\n  };\n  setTimeout(() => {\n    if (ended < propCount) {\n      end();\n    }\n  }, timeout + 1);\n  el.addEventListener(endEvent, onEnd);\n}\nfunction getTransitionInfo(el, expectedType) {\n  const styles = window.getComputedStyle(el);\n  const getStyleProperties = (key) => (styles[key] || \"\").split(\", \");\n  const transitionDelays = getStyleProperties(`${TRANSITION}Delay`);\n  const transitionDurations = getStyleProperties(`${TRANSITION}Duration`);\n  const transitionTimeout = getTimeout(transitionDelays, transitionDurations);\n  const animationDelays = getStyleProperties(`${ANIMATION}Delay`);\n  const animationDurations = getStyleProperties(`${ANIMATION}Duration`);\n  const animationTimeout = getTimeout(animationDelays, animationDurations);\n  let type = null;\n  let timeout = 0;\n  let propCount = 0;\n  if (expectedType === TRANSITION) {\n    if (transitionTimeout > 0) {\n      type = TRANSITION;\n      timeout = transitionTimeout;\n      propCount = transitionDurations.length;\n    }\n  } else if (expectedType === ANIMATION) {\n    if (animationTimeout > 0) {\n      type = ANIMATION;\n      timeout = animationTimeout;\n      propCount = animationDurations.length;\n    }\n  } else {\n    timeout = Math.max(transitionTimeout, animationTimeout);\n    type = timeout > 0 ? transitionTimeout > animationTimeout ? TRANSITION : ANIMATION : null;\n    propCount = type ? type === TRANSITION ? transitionDurations.length : animationDurations.length : 0;\n  }\n  const hasTransform = type === TRANSITION && /\\b(transform|all)(,|$)/.test(\n    getStyleProperties(`${TRANSITION}Property`).toString()\n  );\n  return {\n    type,\n    timeout,\n    propCount,\n    hasTransform\n  };\n}\nfunction getTimeout(delays, durations) {\n  while (delays.length < durations.length) {\n    delays = delays.concat(delays);\n  }\n  return Math.max(...durations.map((d, i) => toMs(d) + toMs(delays[i])));\n}\nfunction toMs(s) {\n  if (s === \"auto\")\n    return 0;\n  return Number(s.slice(0, -1).replace(\",\", \".\")) * 1e3;\n}\nfunction forceReflow() {\n  return document.body.offsetHeight;\n}\n\nfunction patchClass(el, value, isSVG) {\n  const transitionClasses = el[vtcKey];\n  if (transitionClasses) {\n    value = (value ? [value, ...transitionClasses] : [...transitionClasses]).join(\" \");\n  }\n  if (value == null) {\n    el.removeAttribute(\"class\");\n  } else if (isSVG) {\n    el.setAttribute(\"class\", value);\n  } else {\n    el.className = value;\n  }\n}\n\nconst vShowOldKey = Symbol(\"_vod\");\nconst vShow = {\n  beforeMount(el, { value }, { transition }) {\n    el[vShowOldKey] = el.style.display === \"none\" ? \"\" : el.style.display;\n    if (transition && value) {\n      transition.beforeEnter(el);\n    } else {\n      setDisplay(el, value);\n    }\n  },\n  mounted(el, { value }, { transition }) {\n    if (transition && value) {\n      transition.enter(el);\n    }\n  },\n  updated(el, { value, oldValue }, { transition }) {\n    if (!value === !oldValue)\n      return;\n    if (transition) {\n      if (value) {\n        transition.beforeEnter(el);\n        setDisplay(el, true);\n        transition.enter(el);\n      } else {\n        transition.leave(el, () => {\n          setDisplay(el, false);\n        });\n      }\n    } else {\n      setDisplay(el, value);\n    }\n  },\n  beforeUnmount(el, { value }) {\n    setDisplay(el, value);\n  }\n};\nif (!!(process.env.NODE_ENV !== \"production\")) {\n  vShow.name = \"show\";\n}\nfunction setDisplay(el, value) {\n  el.style.display = value ? el[vShowOldKey] : \"none\";\n}\nfunction initVShowForSSR() {\n  vShow.getSSRProps = ({ value }) => {\n    if (!value) {\n      return { style: { display: \"none\" } };\n    }\n  };\n}\n\nconst CSS_VAR_TEXT = Symbol(!!(process.env.NODE_ENV !== \"production\") ? \"CSS_VAR_TEXT\" : \"\");\nfunction useCssVars(getter) {\n  const instance = getCurrentInstance();\n  if (!instance) {\n    !!(process.env.NODE_ENV !== \"production\") && warn(`useCssVars is called without current active component instance.`);\n    return;\n  }\n  const updateTeleports = instance.ut = (vars = getter(instance.proxy)) => {\n    Array.from(\n      document.querySelectorAll(`[data-v-owner=\"${instance.uid}\"]`)\n    ).forEach((node) => setVarsOnNode(node, vars));\n  };\n  const setVars = () => {\n    const vars = getter(instance.proxy);\n    setVarsOnVNode(instance.subTree, vars);\n    updateTeleports(vars);\n  };\n  watchPostEffect(setVars);\n  onMounted(() => {\n    const ob = new MutationObserver(setVars);\n    ob.observe(instance.subTree.el.parentNode, { childList: true });\n    onUnmounted(() => ob.disconnect());\n  });\n}\nfunction setVarsOnVNode(vnode, vars) {\n  if (vnode.shapeFlag & 128) {\n    const suspense = vnode.suspense;\n    vnode = suspense.activeBranch;\n    if (suspense.pendingBranch && !suspense.isHydrating) {\n      suspense.effects.push(() => {\n        setVarsOnVNode(suspense.activeBranch, vars);\n      });\n    }\n  }\n  while (vnode.component) {\n    vnode = vnode.component.subTree;\n  }\n  if (vnode.shapeFlag & 1 && vnode.el) {\n    setVarsOnNode(vnode.el, vars);\n  } else if (vnode.type === Fragment) {\n    vnode.children.forEach((c) => setVarsOnVNode(c, vars));\n  } else if (vnode.type === Static) {\n    let { el, anchor } = vnode;\n    while (el) {\n      setVarsOnNode(el, vars);\n      if (el === anchor)\n        break;\n      el = el.nextSibling;\n    }\n  }\n}\nfunction setVarsOnNode(el, vars) {\n  if (el.nodeType === 1) {\n    const style = el.style;\n    let cssText = \"\";\n    for (const key in vars) {\n      style.setProperty(`--${key}`, vars[key]);\n      cssText += `--${key}: ${vars[key]};`;\n    }\n    style[CSS_VAR_TEXT] = cssText;\n  }\n}\n\nfunction patchStyle(el, prev, next) {\n  const style = el.style;\n  const currentDisplay = style.display;\n  const isCssString = isString(next);\n  if (next && !isCssString) {\n    if (prev && !isString(prev)) {\n      for (const key in prev) {\n        if (next[key] == null) {\n          setStyle(style, key, \"\");\n        }\n      }\n    }\n    for (const key in next) {\n      setStyle(style, key, next[key]);\n    }\n  } else {\n    if (isCssString) {\n      if (prev !== next) {\n        const cssVarText = style[CSS_VAR_TEXT];\n        if (cssVarText) {\n          next += \";\" + cssVarText;\n        }\n        style.cssText = next;\n      }\n    } else if (prev) {\n      el.removeAttribute(\"style\");\n    }\n  }\n  if (vShowOldKey in el) {\n    style.display = currentDisplay;\n  }\n}\nconst semicolonRE = /[^\\\\];\\s*$/;\nconst importantRE = /\\s*!important$/;\nfunction setStyle(style, name, val) {\n  if (isArray(val)) {\n    val.forEach((v) => setStyle(style, name, v));\n  } else {\n    if (val == null)\n      val = \"\";\n    if (!!(process.env.NODE_ENV !== \"production\")) {\n      if (semicolonRE.test(val)) {\n        warn(\n          `Unexpected semicolon at the end of '${name}' style value: '${val}'`\n        );\n      }\n    }\n    if (name.startsWith(\"--\")) {\n      style.setProperty(name, val);\n    } else {\n      const prefixed = autoPrefix(style, name);\n      if (importantRE.test(val)) {\n        style.setProperty(\n          hyphenate(prefixed),\n          val.replace(importantRE, \"\"),\n          \"important\"\n        );\n      } else {\n        style[prefixed] = val;\n      }\n    }\n  }\n}\nconst prefixes = [\"Webkit\", \"Moz\", \"ms\"];\nconst prefixCache = {};\nfunction autoPrefix(style, rawName) {\n  const cached = prefixCache[rawName];\n  if (cached) {\n    return cached;\n  }\n  let name = camelize(rawName);\n  if (name !== \"filter\" && name in style) {\n    return prefixCache[rawName] = name;\n  }\n  name = capitalize(name);\n  for (let i = 0; i < prefixes.length; i++) {\n    const prefixed = prefixes[i] + name;\n    if (prefixed in style) {\n      return prefixCache[rawName] = prefixed;\n    }\n  }\n  return rawName;\n}\n\nconst xlinkNS = \"http://www.w3.org/1999/xlink\";\nfunction patchAttr(el, key, value, isSVG, instance) {\n  if (isSVG && key.startsWith(\"xlink:\")) {\n    if (value == null) {\n      el.removeAttributeNS(xlinkNS, key.slice(6, key.length));\n    } else {\n      el.setAttributeNS(xlinkNS, key, value);\n    }\n  } else {\n    const isBoolean = isSpecialBooleanAttr(key);\n    if (value == null || isBoolean && !includeBooleanAttr(value)) {\n      el.removeAttribute(key);\n    } else {\n      el.setAttribute(key, isBoolean ? \"\" : value);\n    }\n  }\n}\n\nfunction patchDOMProp(el, key, value, prevChildren, parentComponent, parentSuspense, unmountChildren) {\n  if (key === \"innerHTML\" || key === \"textContent\") {\n    if (prevChildren) {\n      unmountChildren(prevChildren, parentComponent, parentSuspense);\n    }\n    el[key] = value == null ? \"\" : value;\n    return;\n  }\n  const tag = el.tagName;\n  if (key === \"value\" && tag !== \"PROGRESS\" && // custom elements may use _value internally\n  !tag.includes(\"-\")) {\n    el._value = value;\n    const oldValue = tag === \"OPTION\" ? el.getAttribute(\"value\") : el.value;\n    const newValue = value == null ? \"\" : value;\n    if (oldValue !== newValue) {\n      el.value = newValue;\n    }\n    if (value == null) {\n      el.removeAttribute(key);\n    }\n    return;\n  }\n  let needRemove = false;\n  if (value === \"\" || value == null) {\n    const type = typeof el[key];\n    if (type === \"boolean\") {\n      value = includeBooleanAttr(value);\n    } else if (value == null && type === \"string\") {\n      value = \"\";\n      needRemove = true;\n    } else if (type === \"number\") {\n      value = 0;\n      needRemove = true;\n    }\n  }\n  try {\n    el[key] = value;\n  } catch (e) {\n    if (!!(process.env.NODE_ENV !== \"production\") && !needRemove) {\n      warn(\n        `Failed setting prop \"${key}\" on <${tag.toLowerCase()}>: value ${value} is invalid.`,\n        e\n      );\n    }\n  }\n  needRemove && el.removeAttribute(key);\n}\n\nfunction addEventListener(el, event, handler, options) {\n  el.addEventListener(event, handler, options);\n}\nfunction removeEventListener(el, event, handler, options) {\n  el.removeEventListener(event, handler, options);\n}\nconst veiKey = Symbol(\"_vei\");\nfunction patchEvent(el, rawName, prevValue, nextValue, instance = null) {\n  const invokers = el[veiKey] || (el[veiKey] = {});\n  const existingInvoker = invokers[rawName];\n  if (nextValue && existingInvoker) {\n    existingInvoker.value = nextValue;\n  } else {\n    const [name, options] = parseName(rawName);\n    if (nextValue) {\n      const invoker = invokers[rawName] = createInvoker(nextValue, instance);\n      addEventListener(el, name, invoker, options);\n    } else if (existingInvoker) {\n      removeEventListener(el, name, existingInvoker, options);\n      invokers[rawName] = void 0;\n    }\n  }\n}\nconst optionsModifierRE = /(?:Once|Passive|Capture)$/;\nfunction parseName(name) {\n  let options;\n  if (optionsModifierRE.test(name)) {\n    options = {};\n    let m;\n    while (m = name.match(optionsModifierRE)) {\n      name = name.slice(0, name.length - m[0].length);\n      options[m[0].toLowerCase()] = true;\n    }\n  }\n  const event = name[2] === \":\" ? name.slice(3) : hyphenate(name.slice(2));\n  return [event, options];\n}\nlet cachedNow = 0;\nconst p = /* @__PURE__ */ Promise.resolve();\nconst getNow = () => cachedNow || (p.then(() => cachedNow = 0), cachedNow = Date.now());\nfunction createInvoker(initialValue, instance) {\n  const invoker = (e) => {\n    if (!e._vts) {\n      e._vts = Date.now();\n    } else if (e._vts <= invoker.attached) {\n      return;\n    }\n    callWithAsyncErrorHandling(\n      patchStopImmediatePropagation(e, invoker.value),\n      instance,\n      5,\n      [e]\n    );\n  };\n  invoker.value = initialValue;\n  invoker.attached = getNow();\n  return invoker;\n}\nfunction patchStopImmediatePropagation(e, value) {\n  if (isArray(value)) {\n    const originalStop = e.stopImmediatePropagation;\n    e.stopImmediatePropagation = () => {\n      originalStop.call(e);\n      e._stopped = true;\n    };\n    return value.map((fn) => (e2) => !e2._stopped && fn && fn(e2));\n  } else {\n    return value;\n  }\n}\n\nconst isNativeOn = (key) => key.charCodeAt(0) === 111 && key.charCodeAt(1) === 110 && // lowercase letter\nkey.charCodeAt(2) > 96 && key.charCodeAt(2) < 123;\nconst patchProp = (el, key, prevValue, nextValue, namespace, prevChildren, parentComponent, parentSuspense, unmountChildren) => {\n  const isSVG = namespace === \"svg\";\n  if (key === \"class\") {\n    patchClass(el, nextValue, isSVG);\n  } else if (key === \"style\") {\n    patchStyle(el, prevValue, nextValue);\n  } else if (isOn(key)) {\n    if (!isModelListener(key)) {\n      patchEvent(el, key, prevValue, nextValue, parentComponent);\n    }\n  } else if (key[0] === \".\" ? (key = key.slice(1), true) : key[0] === \"^\" ? (key = key.slice(1), false) : shouldSetAsProp(el, key, nextValue, isSVG)) {\n    patchDOMProp(\n      el,\n      key,\n      nextValue,\n      prevChildren,\n      parentComponent,\n      parentSuspense,\n      unmountChildren\n    );\n  } else {\n    if (key === \"true-value\") {\n      el._trueValue = nextValue;\n    } else if (key === \"false-value\") {\n      el._falseValue = nextValue;\n    }\n    patchAttr(el, key, nextValue, isSVG);\n  }\n};\nfunction shouldSetAsProp(el, key, value, isSVG) {\n  if (isSVG) {\n    if (key === \"innerHTML\" || key === \"textContent\") {\n      return true;\n    }\n    if (key in el && isNativeOn(key) && isFunction(value)) {\n      return true;\n    }\n    return false;\n  }\n  if (key === \"spellcheck\" || key === \"draggable\" || key === \"translate\") {\n    return false;\n  }\n  if (key === \"form\") {\n    return false;\n  }\n  if (key === \"list\" && el.tagName === \"INPUT\") {\n    return false;\n  }\n  if (key === \"type\" && el.tagName === \"TEXTAREA\") {\n    return false;\n  }\n  if (key === \"width\" || key === \"height\") {\n    const tag = el.tagName;\n    if (tag === \"IMG\" || tag === \"VIDEO\" || tag === \"CANVAS\" || tag === \"SOURCE\") {\n      return false;\n    }\n  }\n  if (isNativeOn(key) && isString(value)) {\n    return false;\n  }\n  return key in el;\n}\n\n/*! #__NO_SIDE_EFFECTS__ */\n// @__NO_SIDE_EFFECTS__\nfunction defineCustomElement(options, hydrate2) {\n  const Comp = defineComponent(options);\n  class VueCustomElement extends VueElement {\n    constructor(initialProps) {\n      super(Comp, initialProps, hydrate2);\n    }\n  }\n  VueCustomElement.def = Comp;\n  return VueCustomElement;\n}\n/*! #__NO_SIDE_EFFECTS__ */\nconst defineSSRCustomElement = /* @__NO_SIDE_EFFECTS__ */ (options) => {\n  return /* @__PURE__ */ defineCustomElement(options, hydrate);\n};\nconst BaseClass = typeof HTMLElement !== \"undefined\" ? HTMLElement : class {\n};\nclass VueElement extends BaseClass {\n  constructor(_def, _props = {}, hydrate2) {\n    super();\n    this._def = _def;\n    this._props = _props;\n    /**\n     * @internal\n     */\n    this._instance = null;\n    this._connected = false;\n    this._resolved = false;\n    this._numberProps = null;\n    this._ob = null;\n    if (this.shadowRoot && hydrate2) {\n      hydrate2(this._createVNode(), this.shadowRoot);\n    } else {\n      if (!!(process.env.NODE_ENV !== \"production\") && this.shadowRoot) {\n        warn(\n          `Custom element has pre-rendered declarative shadow root but is not defined as hydratable. Use \\`defineSSRCustomElement\\`.`\n        );\n      }\n      this.attachShadow({ mode: \"open\" });\n      if (!this._def.__asyncLoader) {\n        this._resolveProps(this._def);\n      }\n    }\n  }\n  connectedCallback() {\n    this._connected = true;\n    if (!this._instance) {\n      if (this._resolved) {\n        this._update();\n      } else {\n        this._resolveDef();\n      }\n    }\n  }\n  disconnectedCallback() {\n    this._connected = false;\n    if (this._ob) {\n      this._ob.disconnect();\n      this._ob = null;\n    }\n    nextTick(() => {\n      if (!this._connected) {\n        render(null, this.shadowRoot);\n        this._instance = null;\n      }\n    });\n  }\n  /**\n   * resolve inner component definition (handle possible async component)\n   */\n  _resolveDef() {\n    this._resolved = true;\n    for (let i = 0; i < this.attributes.length; i++) {\n      this._setAttr(this.attributes[i].name);\n    }\n    this._ob = new MutationObserver((mutations) => {\n      for (const m of mutations) {\n        this._setAttr(m.attributeName);\n      }\n    });\n    this._ob.observe(this, { attributes: true });\n    const resolve = (def, isAsync = false) => {\n      const { props, styles } = def;\n      let numberProps;\n      if (props && !isArray(props)) {\n        for (const key in props) {\n          const opt = props[key];\n          if (opt === Number || opt && opt.type === Number) {\n            if (key in this._props) {\n              this._props[key] = toNumber(this._props[key]);\n            }\n            (numberProps || (numberProps = /* @__PURE__ */ Object.create(null)))[camelize$1(key)] = true;\n          }\n        }\n      }\n      this._numberProps = numberProps;\n      if (isAsync) {\n        this._resolveProps(def);\n      }\n      this._applyStyles(styles);\n      this._update();\n    };\n    const asyncDef = this._def.__asyncLoader;\n    if (asyncDef) {\n      asyncDef().then((def) => resolve(def, true));\n    } else {\n      resolve(this._def);\n    }\n  }\n  _resolveProps(def) {\n    const { props } = def;\n    const declaredPropKeys = isArray(props) ? props : Object.keys(props || {});\n    for (const key of Object.keys(this)) {\n      if (key[0] !== \"_\" && declaredPropKeys.includes(key)) {\n        this._setProp(key, this[key], true, false);\n      }\n    }\n    for (const key of declaredPropKeys.map(camelize$1)) {\n      Object.defineProperty(this, key, {\n        get() {\n          return this._getProp(key);\n        },\n        set(val) {\n          this._setProp(key, val);\n        }\n      });\n    }\n  }\n  _setAttr(key) {\n    let value = this.getAttribute(key);\n    const camelKey = camelize$1(key);\n    if (this._numberProps && this._numberProps[camelKey]) {\n      value = toNumber(value);\n    }\n    this._setProp(camelKey, value, false);\n  }\n  /**\n   * @internal\n   */\n  _getProp(key) {\n    return this._props[key];\n  }\n  /**\n   * @internal\n   */\n  _setProp(key, val, shouldReflect = true, shouldUpdate = true) {\n    if (val !== this._props[key]) {\n      this._props[key] = val;\n      if (shouldUpdate && this._instance) {\n        this._update();\n      }\n      if (shouldReflect) {\n        if (val === true) {\n          this.setAttribute(hyphenate(key), \"\");\n        } else if (typeof val === \"string\" || typeof val === \"number\") {\n          this.setAttribute(hyphenate(key), val + \"\");\n        } else if (!val) {\n          this.removeAttribute(hyphenate(key));\n        }\n      }\n    }\n  }\n  _update() {\n    render(this._createVNode(), this.shadowRoot);\n  }\n  _createVNode() {\n    const vnode = createVNode(this._def, extend({}, this._props));\n    if (!this._instance) {\n      vnode.ce = (instance) => {\n        this._instance = instance;\n        instance.isCE = true;\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          instance.ceReload = (newStyles) => {\n            if (this._styles) {\n              this._styles.forEach((s) => this.shadowRoot.removeChild(s));\n              this._styles.length = 0;\n            }\n            this._applyStyles(newStyles);\n            this._instance = null;\n            this._update();\n          };\n        }\n        const dispatch = (event, args) => {\n          this.dispatchEvent(\n            new CustomEvent(event, {\n              detail: args\n            })\n          );\n        };\n        instance.emit = (event, ...args) => {\n          dispatch(event, args);\n          if (hyphenate(event) !== event) {\n            dispatch(hyphenate(event), args);\n          }\n        };\n        let parent = this;\n        while (parent = parent && (parent.parentNode || parent.host)) {\n          if (parent instanceof VueElement) {\n            instance.parent = parent._instance;\n            instance.provides = parent._instance.provides;\n            break;\n          }\n        }\n      };\n    }\n    return vnode;\n  }\n  _applyStyles(styles) {\n    if (styles) {\n      styles.forEach((css) => {\n        const s = document.createElement(\"style\");\n        s.textContent = css;\n        this.shadowRoot.appendChild(s);\n        if (!!(process.env.NODE_ENV !== \"production\")) {\n          (this._styles || (this._styles = [])).push(s);\n        }\n      });\n    }\n  }\n}\n\nfunction useCssModule(name = \"$style\") {\n  {\n    const instance = getCurrentInstance();\n    if (!instance) {\n      !!(process.env.NODE_ENV !== \"production\") && warn(`useCssModule must be called inside setup()`);\n      return EMPTY_OBJ;\n    }\n    const modules = instance.type.__cssModules;\n    if (!modules) {\n      !!(process.env.NODE_ENV !== \"production\") && warn(`Current instance does not have CSS modules injected.`);\n      return EMPTY_OBJ;\n    }\n    const mod = modules[name];\n    if (!mod) {\n      !!(process.env.NODE_ENV !== \"production\") && warn(`Current instance does not have CSS module named \"${name}\".`);\n      return EMPTY_OBJ;\n    }\n    return mod;\n  }\n}\n\nconst positionMap = /* @__PURE__ */ new WeakMap();\nconst newPositionMap = /* @__PURE__ */ new WeakMap();\nconst moveCbKey = Symbol(\"_moveCb\");\nconst enterCbKey = Symbol(\"_enterCb\");\nconst TransitionGroupImpl = {\n  name: \"TransitionGroup\",\n  props: /* @__PURE__ */ extend({}, TransitionPropsValidators, {\n    tag: String,\n    moveClass: String\n  }),\n  setup(props, { slots }) {\n    const instance = getCurrentInstance();\n    const state = useTransitionState();\n    let prevChildren;\n    let children;\n    onUpdated(() => {\n      if (!prevChildren.length) {\n        return;\n      }\n      const moveClass = props.moveClass || `${props.name || \"v\"}-move`;\n      if (!hasCSSTransform(\n        prevChildren[0].el,\n        instance.vnode.el,\n        moveClass\n      )) {\n        return;\n      }\n      prevChildren.forEach(callPendingCbs);\n      prevChildren.forEach(recordPosition);\n      const movedChildren = prevChildren.filter(applyTranslation);\n      forceReflow();\n      movedChildren.forEach((c) => {\n        const el = c.el;\n        const style = el.style;\n        addTransitionClass(el, moveClass);\n        style.transform = style.webkitTransform = style.transitionDuration = \"\";\n        const cb = el[moveCbKey] = (e) => {\n          if (e && e.target !== el) {\n            return;\n          }\n          if (!e || /transform$/.test(e.propertyName)) {\n            el.removeEventListener(\"transitionend\", cb);\n            el[moveCbKey] = null;\n            removeTransitionClass(el, moveClass);\n          }\n        };\n        el.addEventListener(\"transitionend\", cb);\n      });\n    });\n    return () => {\n      const rawProps = toRaw(props);\n      const cssTransitionProps = resolveTransitionProps(rawProps);\n      let tag = rawProps.tag || Fragment;\n      prevChildren = children;\n      children = slots.default ? getTransitionRawChildren(slots.default()) : [];\n      for (let i = 0; i < children.length; i++) {\n        const child = children[i];\n        if (child.key != null) {\n          setTransitionHooks(\n            child,\n            resolveTransitionHooks(child, cssTransitionProps, state, instance)\n          );\n        } else if (!!(process.env.NODE_ENV !== \"production\")) {\n          warn(`<TransitionGroup> children must be keyed.`);\n        }\n      }\n      if (prevChildren) {\n        for (let i = 0; i < prevChildren.length; i++) {\n          const child = prevChildren[i];\n          setTransitionHooks(\n            child,\n            resolveTransitionHooks(child, cssTransitionProps, state, instance)\n          );\n          positionMap.set(child, child.el.getBoundingClientRect());\n        }\n      }\n      return createVNode(tag, null, children);\n    };\n  }\n};\nconst removeMode = (props) => delete props.mode;\n/* @__PURE__ */ removeMode(TransitionGroupImpl.props);\nconst TransitionGroup = TransitionGroupImpl;\nfunction callPendingCbs(c) {\n  const el = c.el;\n  if (el[moveCbKey]) {\n    el[moveCbKey]();\n  }\n  if (el[enterCbKey]) {\n    el[enterCbKey]();\n  }\n}\nfunction recordPosition(c) {\n  newPositionMap.set(c, c.el.getBoundingClientRect());\n}\nfunction applyTranslation(c) {\n  const oldPos = positionMap.get(c);\n  const newPos = newPositionMap.get(c);\n  const dx = oldPos.left - newPos.left;\n  const dy = oldPos.top - newPos.top;\n  if (dx || dy) {\n    const s = c.el.style;\n    s.transform = s.webkitTransform = `translate(${dx}px,${dy}px)`;\n    s.transitionDuration = \"0s\";\n    return c;\n  }\n}\nfunction hasCSSTransform(el, root, moveClass) {\n  const clone = el.cloneNode();\n  const _vtc = el[vtcKey];\n  if (_vtc) {\n    _vtc.forEach((cls) => {\n      cls.split(/\\s+/).forEach((c) => c && clone.classList.remove(c));\n    });\n  }\n  moveClass.split(/\\s+/).forEach((c) => c && clone.classList.add(c));\n  clone.style.display = \"none\";\n  const container = root.nodeType === 1 ? root : root.parentNode;\n  container.appendChild(clone);\n  const { hasTransform } = getTransitionInfo(clone);\n  container.removeChild(clone);\n  return hasTransform;\n}\n\nconst getModelAssigner = (vnode) => {\n  const fn = vnode.props[\"onUpdate:modelValue\"] || false;\n  return isArray(fn) ? (value) => invokeArrayFns(fn, value) : fn;\n};\nfunction onCompositionStart(e) {\n  e.target.composing = true;\n}\nfunction onCompositionEnd(e) {\n  const target = e.target;\n  if (target.composing) {\n    target.composing = false;\n    target.dispatchEvent(new Event(\"input\"));\n  }\n}\nconst assignKey = Symbol(\"_assign\");\nconst vModelText = {\n  created(el, { modifiers: { lazy, trim, number } }, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n    const castToNumber = number || vnode.props && vnode.props.type === \"number\";\n    addEventListener(el, lazy ? \"change\" : \"input\", (e) => {\n      if (e.target.composing)\n        return;\n      let domValue = el.value;\n      if (trim) {\n        domValue = domValue.trim();\n      }\n      if (castToNumber) {\n        domValue = looseToNumber(domValue);\n      }\n      el[assignKey](domValue);\n    });\n    if (trim) {\n      addEventListener(el, \"change\", () => {\n        el.value = el.value.trim();\n      });\n    }\n    if (!lazy) {\n      addEventListener(el, \"compositionstart\", onCompositionStart);\n      addEventListener(el, \"compositionend\", onCompositionEnd);\n      addEventListener(el, \"change\", onCompositionEnd);\n    }\n  },\n  // set value on mounted so it's after min/max for type=\"range\"\n  mounted(el, { value }) {\n    el.value = value == null ? \"\" : value;\n  },\n  beforeUpdate(el, { value, modifiers: { lazy, trim, number } }, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n    if (el.composing)\n      return;\n    const elValue = number || el.type === \"number\" ? looseToNumber(el.value) : el.value;\n    const newValue = value == null ? \"\" : value;\n    if (elValue === newValue) {\n      return;\n    }\n    if (document.activeElement === el && el.type !== \"range\") {\n      if (lazy) {\n        return;\n      }\n      if (trim && el.value.trim() === newValue) {\n        return;\n      }\n    }\n    el.value = newValue;\n  }\n};\nconst vModelCheckbox = {\n  // #4096 array checkboxes need to be deep traversed\n  deep: true,\n  created(el, _, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n    addEventListener(el, \"change\", () => {\n      const modelValue = el._modelValue;\n      const elementValue = getValue(el);\n      const checked = el.checked;\n      const assign = el[assignKey];\n      if (isArray(modelValue)) {\n        const index = looseIndexOf(modelValue, elementValue);\n        const found = index !== -1;\n        if (checked && !found) {\n          assign(modelValue.concat(elementValue));\n        } else if (!checked && found) {\n          const filtered = [...modelValue];\n          filtered.splice(index, 1);\n          assign(filtered);\n        }\n      } else if (isSet(modelValue)) {\n        const cloned = new Set(modelValue);\n        if (checked) {\n          cloned.add(elementValue);\n        } else {\n          cloned.delete(elementValue);\n        }\n        assign(cloned);\n      } else {\n        assign(getCheckboxValue(el, checked));\n      }\n    });\n  },\n  // set initial checked on mount to wait for true-value/false-value\n  mounted: setChecked,\n  beforeUpdate(el, binding, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n    setChecked(el, binding, vnode);\n  }\n};\nfunction setChecked(el, { value, oldValue }, vnode) {\n  el._modelValue = value;\n  if (isArray(value)) {\n    el.checked = looseIndexOf(value, vnode.props.value) > -1;\n  } else if (isSet(value)) {\n    el.checked = value.has(vnode.props.value);\n  } else if (value !== oldValue) {\n    el.checked = looseEqual(value, getCheckboxValue(el, true));\n  }\n}\nconst vModelRadio = {\n  created(el, { value }, vnode) {\n    el.checked = looseEqual(value, vnode.props.value);\n    el[assignKey] = getModelAssigner(vnode);\n    addEventListener(el, \"change\", () => {\n      el[assignKey](getValue(el));\n    });\n  },\n  beforeUpdate(el, { value, oldValue }, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n    if (value !== oldValue) {\n      el.checked = looseEqual(value, vnode.props.value);\n    }\n  }\n};\nconst vModelSelect = {\n  // <select multiple> value need to be deep traversed\n  deep: true,\n  created(el, { value, modifiers: { number } }, vnode) {\n    const isSetModel = isSet(value);\n    addEventListener(el, \"change\", () => {\n      const selectedVal = Array.prototype.filter.call(el.options, (o) => o.selected).map(\n        (o) => number ? looseToNumber(getValue(o)) : getValue(o)\n      );\n      el[assignKey](\n        el.multiple ? isSetModel ? new Set(selectedVal) : selectedVal : selectedVal[0]\n      );\n      el._assigning = true;\n      nextTick(() => {\n        el._assigning = false;\n      });\n    });\n    el[assignKey] = getModelAssigner(vnode);\n  },\n  // set value in mounted & updated because <select> relies on its children\n  // <option>s.\n  mounted(el, { value, oldValue, modifiers: { number } }) {\n    setSelected(el, value, oldValue, number);\n  },\n  beforeUpdate(el, _binding, vnode) {\n    el[assignKey] = getModelAssigner(vnode);\n  },\n  updated(el, { value, oldValue, modifiers: { number } }) {\n    if (!el._assigning) {\n      setSelected(el, value, oldValue, number);\n    }\n  }\n};\nfunction setSelected(el, value, oldValue, number) {\n  const isMultiple = el.multiple;\n  const isArrayValue = isArray(value);\n  if (isMultiple && !isArrayValue && !isSet(value)) {\n    !!(process.env.NODE_ENV !== \"production\") && warn(\n      `<select multiple v-model> expects an Array or Set value for its binding, but got ${Object.prototype.toString.call(value).slice(8, -1)}.`\n    );\n    return;\n  }\n  if (isArrayValue && looseEqual(value, oldValue)) {\n    return;\n  }\n  for (let i = 0, l = el.options.length; i < l; i++) {\n    const option = el.options[i];\n    const optionValue = getValue(option);\n    if (isMultiple) {\n      if (isArrayValue) {\n        const optionType = typeof optionValue;\n        if (optionType === \"string\" || optionType === \"number\") {\n          option.selected = value.includes(\n            number ? looseToNumber(optionValue) : optionValue\n          );\n        } else {\n          option.selected = looseIndexOf(value, optionValue) > -1;\n        }\n      } else {\n        option.selected = value.has(optionValue);\n      }\n    } else {\n      if (looseEqual(getValue(option), value)) {\n        if (el.selectedIndex !== i)\n          el.selectedIndex = i;\n        return;\n      }\n    }\n  }\n  if (!isMultiple && el.selectedIndex !== -1) {\n    el.selectedIndex = -1;\n  }\n}\nfunction getValue(el) {\n  return \"_value\" in el ? el._value : el.value;\n}\nfunction getCheckboxValue(el, checked) {\n  const key = checked ? \"_trueValue\" : \"_falseValue\";\n  return key in el ? el[key] : checked;\n}\nconst vModelDynamic = {\n  created(el, binding, vnode) {\n    callModelHook(el, binding, vnode, null, \"created\");\n  },\n  mounted(el, binding, vnode) {\n    callModelHook(el, binding, vnode, null, \"mounted\");\n  },\n  beforeUpdate(el, binding, vnode, prevVNode) {\n    callModelHook(el, binding, vnode, prevVNode, \"beforeUpdate\");\n  },\n  updated(el, binding, vnode, prevVNode) {\n    callModelHook(el, binding, vnode, prevVNode, \"updated\");\n  }\n};\nfunction resolveDynamicModel(tagName, type) {\n  switch (tagName) {\n    case \"SELECT\":\n      return vModelSelect;\n    case \"TEXTAREA\":\n      return vModelText;\n    default:\n      switch (type) {\n        case \"checkbox\":\n          return vModelCheckbox;\n        case \"radio\":\n          return vModelRadio;\n        default:\n          return vModelText;\n      }\n  }\n}\nfunction callModelHook(el, binding, vnode, prevVNode, hook) {\n  const modelToUse = resolveDynamicModel(\n    el.tagName,\n    vnode.props && vnode.props.type\n  );\n  const fn = modelToUse[hook];\n  fn && fn(el, binding, vnode, prevVNode);\n}\nfunction initVModelForSSR() {\n  vModelText.getSSRProps = ({ value }) => ({ value });\n  vModelRadio.getSSRProps = ({ value }, vnode) => {\n    if (vnode.props && looseEqual(vnode.props.value, value)) {\n      return { checked: true };\n    }\n  };\n  vModelCheckbox.getSSRProps = ({ value }, vnode) => {\n    if (isArray(value)) {\n      if (vnode.props && looseIndexOf(value, vnode.props.value) > -1) {\n        return { checked: true };\n      }\n    } else if (isSet(value)) {\n      if (vnode.props && value.has(vnode.props.value)) {\n        return { checked: true };\n      }\n    } else if (value) {\n      return { checked: true };\n    }\n  };\n  vModelDynamic.getSSRProps = (binding, vnode) => {\n    if (typeof vnode.type !== \"string\") {\n      return;\n    }\n    const modelToUse = resolveDynamicModel(\n      // resolveDynamicModel expects an uppercase tag name, but vnode.type is lowercase\n      vnode.type.toUpperCase(),\n      vnode.props && vnode.props.type\n    );\n    if (modelToUse.getSSRProps) {\n      return modelToUse.getSSRProps(binding, vnode);\n    }\n  };\n}\n\nconst systemModifiers = [\"ctrl\", \"shift\", \"alt\", \"meta\"];\nconst modifierGuards = {\n  stop: (e) => e.stopPropagation(),\n  prevent: (e) => e.preventDefault(),\n  self: (e) => e.target !== e.currentTarget,\n  ctrl: (e) => !e.ctrlKey,\n  shift: (e) => !e.shiftKey,\n  alt: (e) => !e.altKey,\n  meta: (e) => !e.metaKey,\n  left: (e) => \"button\" in e && e.button !== 0,\n  middle: (e) => \"button\" in e && e.button !== 1,\n  right: (e) => \"button\" in e && e.button !== 2,\n  exact: (e, modifiers) => systemModifiers.some((m) => e[`${m}Key`] && !modifiers.includes(m))\n};\nconst withModifiers = (fn, modifiers) => {\n  const cache = fn._withMods || (fn._withMods = {});\n  const cacheKey = modifiers.join(\".\");\n  return cache[cacheKey] || (cache[cacheKey] = (event, ...args) => {\n    for (let i = 0; i < modifiers.length; i++) {\n      const guard = modifierGuards[modifiers[i]];\n      if (guard && guard(event, modifiers))\n        return;\n    }\n    return fn(event, ...args);\n  });\n};\nconst keyNames = {\n  esc: \"escape\",\n  space: \" \",\n  up: \"arrow-up\",\n  left: \"arrow-left\",\n  right: \"arrow-right\",\n  down: \"arrow-down\",\n  delete: \"backspace\"\n};\nconst withKeys = (fn, modifiers) => {\n  const cache = fn._withKeys || (fn._withKeys = {});\n  const cacheKey = modifiers.join(\".\");\n  return cache[cacheKey] || (cache[cacheKey] = (event) => {\n    if (!(\"key\" in event)) {\n      return;\n    }\n    const eventKey = hyphenate(event.key);\n    if (modifiers.some((k) => k === eventKey || keyNames[k] === eventKey)) {\n      return fn(event);\n    }\n  });\n};\n\nconst rendererOptions = /* @__PURE__ */ extend({ patchProp }, nodeOps);\nlet renderer;\nlet enabledHydration = false;\nfunction ensureRenderer() {\n  return renderer || (renderer = createRenderer(rendererOptions));\n}\nfunction ensureHydrationRenderer() {\n  renderer = enabledHydration ? renderer : createHydrationRenderer(rendererOptions);\n  enabledHydration = true;\n  return renderer;\n}\nconst render = (...args) => {\n  ensureRenderer().render(...args);\n};\nconst hydrate = (...args) => {\n  ensureHydrationRenderer().hydrate(...args);\n};\nconst createApp = (...args) => {\n  const app = ensureRenderer().createApp(...args);\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    injectNativeTagCheck(app);\n    injectCompilerOptionsCheck(app);\n  }\n  const { mount } = app;\n  app.mount = (containerOrSelector) => {\n    const container = normalizeContainer(containerOrSelector);\n    if (!container)\n      return;\n    const component = app._component;\n    if (!isFunction(component) && !component.render && !component.template) {\n      component.template = container.innerHTML;\n    }\n    container.innerHTML = \"\";\n    const proxy = mount(container, false, resolveRootNamespace(container));\n    if (container instanceof Element) {\n      container.removeAttribute(\"v-cloak\");\n      container.setAttribute(\"data-v-app\", \"\");\n    }\n    return proxy;\n  };\n  return app;\n};\nconst createSSRApp = (...args) => {\n  const app = ensureHydrationRenderer().createApp(...args);\n  if (!!(process.env.NODE_ENV !== \"production\")) {\n    injectNativeTagCheck(app);\n    injectCompilerOptionsCheck(app);\n  }\n  const { mount } = app;\n  app.mount = (containerOrSelector) => {\n    const container = normalizeContainer(containerOrSelector);\n    if (container) {\n      return mount(container, true, resolveRootNamespace(container));\n    }\n  };\n  return app;\n};\nfunction resolveRootNamespace(container) {\n  if (container instanceof SVGElement) {\n    return \"svg\";\n  }\n  if (typeof MathMLElement === \"function\" && container instanceof MathMLElement) {\n    return \"mathml\";\n  }\n}\nfunction injectNativeTagCheck(app) {\n  Object.defineProperty(app.config, \"isNativeTag\", {\n    value: (tag) => isHTMLTag(tag) || isSVGTag(tag) || isMathMLTag(tag),\n    writable: false\n  });\n}\nfunction injectCompilerOptionsCheck(app) {\n  if (isRuntimeOnly()) {\n    const isCustomElement = app.config.isCustomElement;\n    Object.defineProperty(app.config, \"isCustomElement\", {\n      get() {\n        return isCustomElement;\n      },\n      set() {\n        warn(\n          `The \\`isCustomElement\\` config option is deprecated. Use \\`compilerOptions.isCustomElement\\` instead.`\n        );\n      }\n    });\n    const compilerOptions = app.config.compilerOptions;\n    const msg = `The \\`compilerOptions\\` config option is only respected when using a build of Vue.js that includes the runtime compiler (aka \"full build\"). Since you are using the runtime-only build, \\`compilerOptions\\` must be passed to \\`@vue/compiler-dom\\` in the build setup instead.\n- For vue-loader: pass it via vue-loader's \\`compilerOptions\\` loader option.\n- For vue-cli: see https://cli.vuejs.org/guide/webpack.html#modifying-options-of-a-loader\n- For vite: pass it via @vitejs/plugin-vue options. See https://github.com/vitejs/vite-plugin-vue/tree/main/packages/plugin-vue#example-for-passing-options-to-vuecompiler-sfc`;\n    Object.defineProperty(app.config, \"compilerOptions\", {\n      get() {\n        warn(msg);\n        return compilerOptions;\n      },\n      set() {\n        warn(msg);\n      }\n    });\n  }\n}\nfunction normalizeContainer(container) {\n  if (isString(container)) {\n    const res = document.querySelector(container);\n    if (!!(process.env.NODE_ENV !== \"production\") && !res) {\n      warn(\n        `Failed to mount app: mount target selector \"${container}\" returned null.`\n      );\n    }\n    return res;\n  }\n  if (!!(process.env.NODE_ENV !== \"production\") && window.ShadowRoot && container instanceof window.ShadowRoot && container.mode === \"closed\") {\n    warn(\n      `mounting on a ShadowRoot with \\`{mode: \"closed\"}\\` may lead to unpredictable bugs`\n    );\n  }\n  return container;\n}\nlet ssrDirectiveInitialized = false;\nconst initDirectivesForSSR = () => {\n  if (!ssrDirectiveInitialized) {\n    ssrDirectiveInitialized = true;\n    initVModelForSSR();\n    initVShowForSSR();\n  }\n} ;\n\nexport { Transition, TransitionGroup, VueElement, createApp, createSSRApp, defineCustomElement, defineSSRCustomElement, hydrate, initDirectivesForSSR, render, useCssModule, useCssVars, vModelCheckbox, vModelDynamic, vModelRadio, vModelSelect, vModelText, vShow, withKeys, withModifiers };\n","/**\n* @vue/shared v3.4.15\n* (c) 2018-present Yuxi (Evan) You and Vue contributors\n* @license MIT\n**/\nfunction makeMap(str, expectsLowerCase) {\n  const set = new Set(str.split(\",\"));\n  return expectsLowerCase ? (val) => set.has(val.toLowerCase()) : (val) => set.has(val);\n}\n\nconst EMPTY_OBJ = !!(process.env.NODE_ENV !== \"production\") ? Object.freeze({}) : {};\nconst EMPTY_ARR = !!(process.env.NODE_ENV !== \"production\") ? Object.freeze([]) : [];\nconst NOOP = () => {\n};\nconst NO = () => false;\nconst isOn = (key) => key.charCodeAt(0) === 111 && key.charCodeAt(1) === 110 && // uppercase letter\n(key.charCodeAt(2) > 122 || key.charCodeAt(2) < 97);\nconst isModelListener = (key) => key.startsWith(\"onUpdate:\");\nconst extend = Object.assign;\nconst remove = (arr, el) => {\n  const i = arr.indexOf(el);\n  if (i > -1) {\n    arr.splice(i, 1);\n  }\n};\nconst hasOwnProperty = Object.prototype.hasOwnProperty;\nconst hasOwn = (val, key) => hasOwnProperty.call(val, key);\nconst isArray = Array.isArray;\nconst isMap = (val) => toTypeString(val) === \"[object Map]\";\nconst isSet = (val) => toTypeString(val) === \"[object Set]\";\nconst isDate = (val) => toTypeString(val) === \"[object Date]\";\nconst isRegExp = (val) => toTypeString(val) === \"[object RegExp]\";\nconst isFunction = (val) => typeof val === \"function\";\nconst isString = (val) => typeof val === \"string\";\nconst isSymbol = (val) => typeof val === \"symbol\";\nconst isObject = (val) => val !== null && typeof val === \"object\";\nconst isPromise = (val) => {\n  return (isObject(val) || isFunction(val)) && isFunction(val.then) && isFunction(val.catch);\n};\nconst objectToString = Object.prototype.toString;\nconst toTypeString = (value) => objectToString.call(value);\nconst toRawType = (value) => {\n  return toTypeString(value).slice(8, -1);\n};\nconst isPlainObject = (val) => toTypeString(val) === \"[object Object]\";\nconst isIntegerKey = (key) => isString(key) && key !== \"NaN\" && key[0] !== \"-\" && \"\" + parseInt(key, 10) === key;\nconst isReservedProp = /* @__PURE__ */ makeMap(\n  // the leading comma is intentional so empty string \"\" is also included\n  \",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted\"\n);\nconst isBuiltInDirective = /* @__PURE__ */ makeMap(\n  \"bind,cloak,else-if,else,for,html,if,model,on,once,pre,show,slot,text,memo\"\n);\nconst cacheStringFunction = (fn) => {\n  const cache = /* @__PURE__ */ Object.create(null);\n  return (str) => {\n    const hit = cache[str];\n    return hit || (cache[str] = fn(str));\n  };\n};\nconst camelizeRE = /-(\\w)/g;\nconst camelize = cacheStringFunction((str) => {\n  return str.replace(camelizeRE, (_, c) => c ? c.toUpperCase() : \"\");\n});\nconst hyphenateRE = /\\B([A-Z])/g;\nconst hyphenate = cacheStringFunction(\n  (str) => str.replace(hyphenateRE, \"-$1\").toLowerCase()\n);\nconst capitalize = cacheStringFunction((str) => {\n  return str.charAt(0).toUpperCase() + str.slice(1);\n});\nconst toHandlerKey = cacheStringFunction((str) => {\n  const s = str ? `on${capitalize(str)}` : ``;\n  return s;\n});\nconst hasChanged = (value, oldValue) => !Object.is(value, oldValue);\nconst invokeArrayFns = (fns, arg) => {\n  for (let i = 0; i < fns.length; i++) {\n    fns[i](arg);\n  }\n};\nconst def = (obj, key, value) => {\n  Object.defineProperty(obj, key, {\n    configurable: true,\n    enumerable: false,\n    value\n  });\n};\nconst looseToNumber = (val) => {\n  const n = parseFloat(val);\n  return isNaN(n) ? val : n;\n};\nconst toNumber = (val) => {\n  const n = isString(val) ? Number(val) : NaN;\n  return isNaN(n) ? val : n;\n};\nlet _globalThis;\nconst getGlobalThis = () => {\n  return _globalThis || (_globalThis = typeof globalThis !== \"undefined\" ? globalThis : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : typeof global !== \"undefined\" ? global : {});\n};\nconst identRE = /^[_$a-zA-Z\\xA0-\\uFFFF][_$a-zA-Z0-9\\xA0-\\uFFFF]*$/;\nfunction genPropsAccessExp(name) {\n  return identRE.test(name) ? `__props.${name}` : `__props[${JSON.stringify(name)}]`;\n}\n\nconst PatchFlags = {\n  \"TEXT\": 1,\n  \"1\": \"TEXT\",\n  \"CLASS\": 2,\n  \"2\": \"CLASS\",\n  \"STYLE\": 4,\n  \"4\": \"STYLE\",\n  \"PROPS\": 8,\n  \"8\": \"PROPS\",\n  \"FULL_PROPS\": 16,\n  \"16\": \"FULL_PROPS\",\n  \"NEED_HYDRATION\": 32,\n  \"32\": \"NEED_HYDRATION\",\n  \"STABLE_FRAGMENT\": 64,\n  \"64\": \"STABLE_FRAGMENT\",\n  \"KEYED_FRAGMENT\": 128,\n  \"128\": \"KEYED_FRAGMENT\",\n  \"UNKEYED_FRAGMENT\": 256,\n  \"256\": \"UNKEYED_FRAGMENT\",\n  \"NEED_PATCH\": 512,\n  \"512\": \"NEED_PATCH\",\n  \"DYNAMIC_SLOTS\": 1024,\n  \"1024\": \"DYNAMIC_SLOTS\",\n  \"DEV_ROOT_FRAGMENT\": 2048,\n  \"2048\": \"DEV_ROOT_FRAGMENT\",\n  \"HOISTED\": -1,\n  \"-1\": \"HOISTED\",\n  \"BAIL\": -2,\n  \"-2\": \"BAIL\"\n};\nconst PatchFlagNames = {\n  [1]: `TEXT`,\n  [2]: `CLASS`,\n  [4]: `STYLE`,\n  [8]: `PROPS`,\n  [16]: `FULL_PROPS`,\n  [32]: `NEED_HYDRATION`,\n  [64]: `STABLE_FRAGMENT`,\n  [128]: `KEYED_FRAGMENT`,\n  [256]: `UNKEYED_FRAGMENT`,\n  [512]: `NEED_PATCH`,\n  [1024]: `DYNAMIC_SLOTS`,\n  [2048]: `DEV_ROOT_FRAGMENT`,\n  [-1]: `HOISTED`,\n  [-2]: `BAIL`\n};\n\nconst ShapeFlags = {\n  \"ELEMENT\": 1,\n  \"1\": \"ELEMENT\",\n  \"FUNCTIONAL_COMPONENT\": 2,\n  \"2\": \"FUNCTIONAL_COMPONENT\",\n  \"STATEFUL_COMPONENT\": 4,\n  \"4\": \"STATEFUL_COMPONENT\",\n  \"TEXT_CHILDREN\": 8,\n  \"8\": \"TEXT_CHILDREN\",\n  \"ARRAY_CHILDREN\": 16,\n  \"16\": \"ARRAY_CHILDREN\",\n  \"SLOTS_CHILDREN\": 32,\n  \"32\": \"SLOTS_CHILDREN\",\n  \"TELEPORT\": 64,\n  \"64\": \"TELEPORT\",\n  \"SUSPENSE\": 128,\n  \"128\": \"SUSPENSE\",\n  \"COMPONENT_SHOULD_KEEP_ALIVE\": 256,\n  \"256\": \"COMPONENT_SHOULD_KEEP_ALIVE\",\n  \"COMPONENT_KEPT_ALIVE\": 512,\n  \"512\": \"COMPONENT_KEPT_ALIVE\",\n  \"COMPONENT\": 6,\n  \"6\": \"COMPONENT\"\n};\n\nconst SlotFlags = {\n  \"STABLE\": 1,\n  \"1\": \"STABLE\",\n  \"DYNAMIC\": 2,\n  \"2\": \"DYNAMIC\",\n  \"FORWARDED\": 3,\n  \"3\": \"FORWARDED\"\n};\nconst slotFlagsText = {\n  [1]: \"STABLE\",\n  [2]: \"DYNAMIC\",\n  [3]: \"FORWARDED\"\n};\n\nconst GLOBALS_ALLOWED = \"Infinity,undefined,NaN,isFinite,isNaN,parseFloat,parseInt,decodeURI,decodeURIComponent,encodeURI,encodeURIComponent,Math,Number,Date,Array,Object,Boolean,String,RegExp,Map,Set,JSON,Intl,BigInt,console,Error\";\nconst isGloballyAllowed = /* @__PURE__ */ makeMap(GLOBALS_ALLOWED);\nconst isGloballyWhitelisted = isGloballyAllowed;\n\nconst range = 2;\nfunction generateCodeFrame(source, start = 0, end = source.length) {\n  let lines = source.split(/(\\r?\\n)/);\n  const newlineSequences = lines.filter((_, idx) => idx % 2 === 1);\n  lines = lines.filter((_, idx) => idx % 2 === 0);\n  let count = 0;\n  const res = [];\n  for (let i = 0; i < lines.length; i++) {\n    count += lines[i].length + (newlineSequences[i] && newlineSequences[i].length || 0);\n    if (count >= start) {\n      for (let j = i - range; j <= i + range || end > count; j++) {\n        if (j < 0 || j >= lines.length)\n          continue;\n        const line = j + 1;\n        res.push(\n          `${line}${\" \".repeat(Math.max(3 - String(line).length, 0))}|  ${lines[j]}`\n        );\n        const lineLength = lines[j].length;\n        const newLineSeqLength = newlineSequences[j] && newlineSequences[j].length || 0;\n        if (j === i) {\n          const pad = start - (count - (lineLength + newLineSeqLength));\n          const length = Math.max(\n            1,\n            end > count ? lineLength - pad : end - start\n          );\n          res.push(`   |  ` + \" \".repeat(pad) + \"^\".repeat(length));\n        } else if (j > i) {\n          if (end > count) {\n            const length = Math.max(Math.min(end - count, lineLength), 1);\n            res.push(`   |  ` + \"^\".repeat(length));\n          }\n          count += lineLength + newLineSeqLength;\n        }\n      }\n      break;\n    }\n  }\n  return res.join(\"\\n\");\n}\n\nfunction normalizeStyle(value) {\n  if (isArray(value)) {\n    const res = {};\n    for (let i = 0; i < value.length; i++) {\n      const item = value[i];\n      const normalized = isString(item) ? parseStringStyle(item) : normalizeStyle(item);\n      if (normalized) {\n        for (const key in normalized) {\n          res[key] = normalized[key];\n        }\n      }\n    }\n    return res;\n  } else if (isString(value) || isObject(value)) {\n    return value;\n  }\n}\nconst listDelimiterRE = /;(?![^(]*\\))/g;\nconst propertyDelimiterRE = /:([^]+)/;\nconst styleCommentRE = /\\/\\*[^]*?\\*\\//g;\nfunction parseStringStyle(cssText) {\n  const ret = {};\n  cssText.replace(styleCommentRE, \"\").split(listDelimiterRE).forEach((item) => {\n    if (item) {\n      const tmp = item.split(propertyDelimiterRE);\n      tmp.length > 1 && (ret[tmp[0].trim()] = tmp[1].trim());\n    }\n  });\n  return ret;\n}\nfunction stringifyStyle(styles) {\n  let ret = \"\";\n  if (!styles || isString(styles)) {\n    return ret;\n  }\n  for (const key in styles) {\n    const value = styles[key];\n    const normalizedKey = key.startsWith(`--`) ? key : hyphenate(key);\n    if (isString(value) || typeof value === \"number\") {\n      ret += `${normalizedKey}:${value};`;\n    }\n  }\n  return ret;\n}\nfunction normalizeClass(value) {\n  let res = \"\";\n  if (isString(value)) {\n    res = value;\n  } else if (isArray(value)) {\n    for (let i = 0; i < value.length; i++) {\n      const normalized = normalizeClass(value[i]);\n      if (normalized) {\n        res += normalized + \" \";\n      }\n    }\n  } else if (isObject(value)) {\n    for (const name in value) {\n      if (value[name]) {\n        res += name + \" \";\n      }\n    }\n  }\n  return res.trim();\n}\nfunction normalizeProps(props) {\n  if (!props)\n    return null;\n  let { class: klass, style } = props;\n  if (klass && !isString(klass)) {\n    props.class = normalizeClass(klass);\n  }\n  if (style) {\n    props.style = normalizeStyle(style);\n  }\n  return props;\n}\n\nconst HTML_TAGS = \"html,body,base,head,link,meta,style,title,address,article,aside,footer,header,hgroup,h1,h2,h3,h4,h5,h6,nav,section,div,dd,dl,dt,figcaption,figure,picture,hr,img,li,main,ol,p,pre,ul,a,b,abbr,bdi,bdo,br,cite,code,data,dfn,em,i,kbd,mark,q,rp,rt,ruby,s,samp,small,span,strong,sub,sup,time,u,var,wbr,area,audio,map,track,video,embed,object,param,source,canvas,script,noscript,del,ins,caption,col,colgroup,table,thead,tbody,td,th,tr,button,datalist,fieldset,form,input,label,legend,meter,optgroup,option,output,progress,select,textarea,details,dialog,menu,summary,template,blockquote,iframe,tfoot\";\nconst SVG_TAGS = \"svg,animate,animateMotion,animateTransform,circle,clipPath,color-profile,defs,desc,discard,ellipse,feBlend,feColorMatrix,feComponentTransfer,feComposite,feConvolveMatrix,feDiffuseLighting,feDisplacementMap,feDistantLight,feDropShadow,feFlood,feFuncA,feFuncB,feFuncG,feFuncR,feGaussianBlur,feImage,feMerge,feMergeNode,feMorphology,feOffset,fePointLight,feSpecularLighting,feSpotLight,feTile,feTurbulence,filter,foreignObject,g,hatch,hatchpath,image,line,linearGradient,marker,mask,mesh,meshgradient,meshpatch,meshrow,metadata,mpath,path,pattern,polygon,polyline,radialGradient,rect,set,solidcolor,stop,switch,symbol,text,textPath,title,tspan,unknown,use,view\";\nconst MATH_TAGS = \"annotation,annotation-xml,maction,maligngroup,malignmark,math,menclose,merror,mfenced,mfrac,mfraction,mglyph,mi,mlabeledtr,mlongdiv,mmultiscripts,mn,mo,mover,mpadded,mphantom,mprescripts,mroot,mrow,ms,mscarries,mscarry,msgroup,msline,mspace,msqrt,msrow,mstack,mstyle,msub,msubsup,msup,mtable,mtd,mtext,mtr,munder,munderover,none,semantics\";\nconst VOID_TAGS = \"area,base,br,col,embed,hr,img,input,link,meta,param,source,track,wbr\";\nconst isHTMLTag = /* @__PURE__ */ makeMap(HTML_TAGS);\nconst isSVGTag = /* @__PURE__ */ makeMap(SVG_TAGS);\nconst isMathMLTag = /* @__PURE__ */ makeMap(MATH_TAGS);\nconst isVoidTag = /* @__PURE__ */ makeMap(VOID_TAGS);\n\nconst specialBooleanAttrs = `itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly`;\nconst isSpecialBooleanAttr = /* @__PURE__ */ makeMap(specialBooleanAttrs);\nconst isBooleanAttr = /* @__PURE__ */ makeMap(\n  specialBooleanAttrs + `,async,autofocus,autoplay,controls,default,defer,disabled,hidden,inert,loop,open,required,reversed,scoped,seamless,checked,muted,multiple,selected`\n);\nfunction includeBooleanAttr(value) {\n  return !!value || value === \"\";\n}\nconst unsafeAttrCharRE = /[>/=\"'\\u0009\\u000a\\u000c\\u0020]/;\nconst attrValidationCache = {};\nfunction isSSRSafeAttrName(name) {\n  if (attrValidationCache.hasOwnProperty(name)) {\n    return attrValidationCache[name];\n  }\n  const isUnsafe = unsafeAttrCharRE.test(name);\n  if (isUnsafe) {\n    console.error(`unsafe attribute name: ${name}`);\n  }\n  return attrValidationCache[name] = !isUnsafe;\n}\nconst propsToAttrMap = {\n  acceptCharset: \"accept-charset\",\n  className: \"class\",\n  htmlFor: \"for\",\n  httpEquiv: \"http-equiv\"\n};\nconst isKnownHtmlAttr = /* @__PURE__ */ makeMap(\n  `accept,accept-charset,accesskey,action,align,allow,alt,async,autocapitalize,autocomplete,autofocus,autoplay,background,bgcolor,border,buffered,capture,challenge,charset,checked,cite,class,code,codebase,color,cols,colspan,content,contenteditable,contextmenu,controls,coords,crossorigin,csp,data,datetime,decoding,default,defer,dir,dirname,disabled,download,draggable,dropzone,enctype,enterkeyhint,for,form,formaction,formenctype,formmethod,formnovalidate,formtarget,headers,height,hidden,high,href,hreflang,http-equiv,icon,id,importance,inert,integrity,ismap,itemprop,keytype,kind,label,lang,language,loading,list,loop,low,manifest,max,maxlength,minlength,media,min,multiple,muted,name,novalidate,open,optimum,pattern,ping,placeholder,poster,preload,radiogroup,readonly,referrerpolicy,rel,required,reversed,rows,rowspan,sandbox,scope,scoped,selected,shape,size,sizes,slot,span,spellcheck,src,srcdoc,srclang,srcset,start,step,style,summary,tabindex,target,title,translate,type,usemap,value,width,wrap`\n);\nconst isKnownSvgAttr = /* @__PURE__ */ makeMap(\n  `xmlns,accent-height,accumulate,additive,alignment-baseline,alphabetic,amplitude,arabic-form,ascent,attributeName,attributeType,azimuth,baseFrequency,baseline-shift,baseProfile,bbox,begin,bias,by,calcMode,cap-height,class,clip,clipPathUnits,clip-path,clip-rule,color,color-interpolation,color-interpolation-filters,color-profile,color-rendering,contentScriptType,contentStyleType,crossorigin,cursor,cx,cy,d,decelerate,descent,diffuseConstant,direction,display,divisor,dominant-baseline,dur,dx,dy,edgeMode,elevation,enable-background,end,exponent,fill,fill-opacity,fill-rule,filter,filterRes,filterUnits,flood-color,flood-opacity,font-family,font-size,font-size-adjust,font-stretch,font-style,font-variant,font-weight,format,from,fr,fx,fy,g1,g2,glyph-name,glyph-orientation-horizontal,glyph-orientation-vertical,glyphRef,gradientTransform,gradientUnits,hanging,height,href,hreflang,horiz-adv-x,horiz-origin-x,id,ideographic,image-rendering,in,in2,intercept,k,k1,k2,k3,k4,kernelMatrix,kernelUnitLength,kerning,keyPoints,keySplines,keyTimes,lang,lengthAdjust,letter-spacing,lighting-color,limitingConeAngle,local,marker-end,marker-mid,marker-start,markerHeight,markerUnits,markerWidth,mask,maskContentUnits,maskUnits,mathematical,max,media,method,min,mode,name,numOctaves,offset,opacity,operator,order,orient,orientation,origin,overflow,overline-position,overline-thickness,panose-1,paint-order,path,pathLength,patternContentUnits,patternTransform,patternUnits,ping,pointer-events,points,pointsAtX,pointsAtY,pointsAtZ,preserveAlpha,preserveAspectRatio,primitiveUnits,r,radius,referrerPolicy,refX,refY,rel,rendering-intent,repeatCount,repeatDur,requiredExtensions,requiredFeatures,restart,result,rotate,rx,ry,scale,seed,shape-rendering,slope,spacing,specularConstant,specularExponent,speed,spreadMethod,startOffset,stdDeviation,stemh,stemv,stitchTiles,stop-color,stop-opacity,strikethrough-position,strikethrough-thickness,string,stroke,stroke-dasharray,stroke-dashoffset,stroke-linecap,stroke-linejoin,stroke-miterlimit,stroke-opacity,stroke-width,style,surfaceScale,systemLanguage,tabindex,tableValues,target,targetX,targetY,text-anchor,text-decoration,text-rendering,textLength,to,transform,transform-origin,type,u1,u2,underline-position,underline-thickness,unicode,unicode-bidi,unicode-range,units-per-em,v-alphabetic,v-hanging,v-ideographic,v-mathematical,values,vector-effect,version,vert-adv-y,vert-origin-x,vert-origin-y,viewBox,viewTarget,visibility,width,widths,word-spacing,writing-mode,x,x-height,x1,x2,xChannelSelector,xlink:actuate,xlink:arcrole,xlink:href,xlink:role,xlink:show,xlink:title,xlink:type,xmlns:xlink,xml:base,xml:lang,xml:space,y,y1,y2,yChannelSelector,z,zoomAndPan`\n);\nfunction isRenderableAttrValue(value) {\n  if (value == null) {\n    return false;\n  }\n  const type = typeof value;\n  return type === \"string\" || type === \"number\" || type === \"boolean\";\n}\n\nconst escapeRE = /[\"'&<>]/;\nfunction escapeHtml(string) {\n  const str = \"\" + string;\n  const match = escapeRE.exec(str);\n  if (!match) {\n    return str;\n  }\n  let html = \"\";\n  let escaped;\n  let index;\n  let lastIndex = 0;\n  for (index = match.index; index < str.length; index++) {\n    switch (str.charCodeAt(index)) {\n      case 34:\n        escaped = \"&quot;\";\n        break;\n      case 38:\n        escaped = \"&amp;\";\n        break;\n      case 39:\n        escaped = \"&#39;\";\n        break;\n      case 60:\n        escaped = \"&lt;\";\n        break;\n      case 62:\n        escaped = \"&gt;\";\n        break;\n      default:\n        continue;\n    }\n    if (lastIndex !== index) {\n      html += str.slice(lastIndex, index);\n    }\n    lastIndex = index + 1;\n    html += escaped;\n  }\n  return lastIndex !== index ? html + str.slice(lastIndex, index) : html;\n}\nconst commentStripRE = /^-?>|<!--|-->|--!>|<!-$/g;\nfunction escapeHtmlComment(src) {\n  return src.replace(commentStripRE, \"\");\n}\n\nfunction looseCompareArrays(a, b) {\n  if (a.length !== b.length)\n    return false;\n  let equal = true;\n  for (let i = 0; equal && i < a.length; i++) {\n    equal = looseEqual(a[i], b[i]);\n  }\n  return equal;\n}\nfunction looseEqual(a, b) {\n  if (a === b)\n    return true;\n  let aValidType = isDate(a);\n  let bValidType = isDate(b);\n  if (aValidType || bValidType) {\n    return aValidType && bValidType ? a.getTime() === b.getTime() : false;\n  }\n  aValidType = isSymbol(a);\n  bValidType = isSymbol(b);\n  if (aValidType || bValidType) {\n    return a === b;\n  }\n  aValidType = isArray(a);\n  bValidType = isArray(b);\n  if (aValidType || bValidType) {\n    return aValidType && bValidType ? looseCompareArrays(a, b) : false;\n  }\n  aValidType = isObject(a);\n  bValidType = isObject(b);\n  if (aValidType || bValidType) {\n    if (!aValidType || !bValidType) {\n      return false;\n    }\n    const aKeysCount = Object.keys(a).length;\n    const bKeysCount = Object.keys(b).length;\n    if (aKeysCount !== bKeysCount) {\n      return false;\n    }\n    for (const key in a) {\n      const aHasKey = a.hasOwnProperty(key);\n      const bHasKey = b.hasOwnProperty(key);\n      if (aHasKey && !bHasKey || !aHasKey && bHasKey || !looseEqual(a[key], b[key])) {\n        return false;\n      }\n    }\n  }\n  return String(a) === String(b);\n}\nfunction looseIndexOf(arr, val) {\n  return arr.findIndex((item) => looseEqual(item, val));\n}\n\nconst toDisplayString = (val) => {\n  return isString(val) ? val : val == null ? \"\" : isArray(val) || isObject(val) && (val.toString === objectToString || !isFunction(val.toString)) ? JSON.stringify(val, replacer, 2) : String(val);\n};\nconst replacer = (_key, val) => {\n  if (val && val.__v_isRef) {\n    return replacer(_key, val.value);\n  } else if (isMap(val)) {\n    return {\n      [`Map(${val.size})`]: [...val.entries()].reduce(\n        (entries, [key, val2], i) => {\n          entries[stringifySymbol(key, i) + \" =>\"] = val2;\n          return entries;\n        },\n        {}\n      )\n    };\n  } else if (isSet(val)) {\n    return {\n      [`Set(${val.size})`]: [...val.values()].map((v) => stringifySymbol(v))\n    };\n  } else if (isSymbol(val)) {\n    return stringifySymbol(val);\n  } else if (isObject(val) && !isArray(val) && !isPlainObject(val)) {\n    return String(val);\n  }\n  return val;\n};\nconst stringifySymbol = (v, i = \"\") => {\n  var _a;\n  return isSymbol(v) ? `Symbol(${(_a = v.description) != null ? _a : i})` : v;\n};\n\nexport { EMPTY_ARR, EMPTY_OBJ, NO, NOOP, PatchFlagNames, PatchFlags, ShapeFlags, SlotFlags, camelize, capitalize, def, escapeHtml, escapeHtmlComment, extend, genPropsAccessExp, generateCodeFrame, getGlobalThis, hasChanged, hasOwn, hyphenate, includeBooleanAttr, invokeArrayFns, isArray, isBooleanAttr, isBuiltInDirective, isDate, isFunction, isGloballyAllowed, isGloballyWhitelisted, isHTMLTag, isIntegerKey, isKnownHtmlAttr, isKnownSvgAttr, isMap, isMathMLTag, isModelListener, isObject, isOn, isPlainObject, isPromise, isRegExp, isRenderableAttrValue, isReservedProp, isSSRSafeAttrName, isSVGTag, isSet, isSpecialBooleanAttr, isString, isSymbol, isVoidTag, looseEqual, looseIndexOf, looseToNumber, makeMap, normalizeClass, normalizeProps, normalizeStyle, objectToString, parseStringStyle, propsToAttrMap, remove, slotFlagsText, stringifyStyle, toDisplayString, toHandlerKey, toNumber, toRawType, toTypeString };\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// runtime helper for setting properties on components\n// in a tree-shakable way\nexports.default = (sfc, props) => {\n    const target = sfc.__vccOpts || sfc;\n    for (const [key, val] of props) {\n        target[key] = val;\n    }\n    return target;\n};\n","'use strict';\nvar isCallable = require('../internals/is-callable');\nvar tryToString = require('../internals/try-to-string');\n\nvar $TypeError = TypeError;\n\n// `Assert: IsCallable(argument) is true`\nmodule.exports = function (argument) {\n  if (isCallable(argument)) return argument;\n  throw new $TypeError(tryToString(argument) + ' is not a function');\n};\n","'use strict';\nvar isPossiblePrototype = require('../internals/is-possible-prototype');\n\nvar $String = String;\nvar $TypeError = TypeError;\n\nmodule.exports = function (argument) {\n  if (isPossiblePrototype(argument)) return argument;\n  throw new $TypeError(\"Can't set \" + $String(argument) + ' as a prototype');\n};\n","'use strict';\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\n\nvar $TypeError = TypeError;\n\nmodule.exports = function (it, Prototype) {\n  if (isPrototypeOf(Prototype, it)) return it;\n  throw new $TypeError('Incorrect invocation');\n};\n","'use strict';\nvar isObject = require('../internals/is-object');\n\nvar $String = String;\nvar $TypeError = TypeError;\n\n// `Assert: Type(argument) is Object`\nmodule.exports = function (argument) {\n  if (isObject(argument)) return argument;\n  throw new $TypeError($String(argument) + ' is not an object');\n};\n","'use strict';\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = lengthOfArrayLike(O);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (IS_INCLUDES && el !== el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare -- NaN check\n      if (value !== value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.es/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.es/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar isArray = require('../internals/is-array');\n\nvar $TypeError = TypeError;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Safari < 13 does not throw an error in this case\nvar SILENT_ON_NON_WRITABLE_LENGTH_SET = DESCRIPTORS && !function () {\n  // makes no sense without proper strict mode support\n  if (this !== undefined) return true;\n  try {\n    // eslint-disable-next-line es/no-object-defineproperty -- safe\n    Object.defineProperty([], 'length', { writable: false }).length = 1;\n  } catch (error) {\n    return error instanceof TypeError;\n  }\n}();\n\nmodule.exports = SILENT_ON_NON_WRITABLE_LENGTH_SET ? function (O, length) {\n  if (isArray(O) && !getOwnPropertyDescriptor(O, 'length').writable) {\n    throw new $TypeError('Cannot set read only .length');\n  } return O.length = length;\n} : function (O, length) {\n  return O.length = length;\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\n\nvar toString = uncurryThis({}.toString);\nvar stringSlice = uncurryThis(''.slice);\n\nmodule.exports = function (it) {\n  return stringSlice(toString(it), 8, -1);\n};\n","'use strict';\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar isCallable = require('../internals/is-callable');\nvar classofRaw = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar $Object = Object;\n\n// ES3 wrong here\nvar CORRECT_ARGUMENTS = classofRaw(function () { return arguments; }()) === 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (error) { /* empty */ }\n};\n\n// getting tag from ES6+ `Object.prototype.toString`\nmodule.exports = TO_STRING_TAG_SUPPORT ? classofRaw : function (it) {\n  var O, tag, result;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (tag = tryGet(O = $Object(it), TO_STRING_TAG)) == 'string' ? tag\n    // builtinTag case\n    : CORRECT_ARGUMENTS ? classofRaw(O)\n    // ES3 arguments fallback\n    : (result = classofRaw(O)) === 'Object' && isCallable(O.callee) ? 'Arguments' : result;\n};\n","'use strict';\nvar hasOwn = require('../internals/has-own-property');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source, exceptions) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!hasOwn(target, key) && !(exceptions && hasOwn(exceptions, key))) {\n      defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n    }\n  }\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","'use strict';\nmodule.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","'use strict';\nvar isCallable = require('../internals/is-callable');\nvar definePropertyModule = require('../internals/object-define-property');\nvar makeBuiltIn = require('../internals/make-built-in');\nvar defineGlobalProperty = require('../internals/define-global-property');\n\nmodule.exports = function (O, key, value, options) {\n  if (!options) options = {};\n  var simple = options.enumerable;\n  var name = options.name !== undefined ? options.name : key;\n  if (isCallable(value)) makeBuiltIn(value, name, options);\n  if (options.global) {\n    if (simple) O[key] = value;\n    else defineGlobalProperty(key, value);\n  } else {\n    try {\n      if (!options.unsafe) delete O[key];\n      else if (O[key]) simple = true;\n    } catch (error) { /* empty */ }\n    if (simple) O[key] = value;\n    else definePropertyModule.f(O, key, {\n      value: value,\n      enumerable: false,\n      configurable: !options.nonConfigurable,\n      writable: !options.nonWritable\n    });\n  } return O;\n};\n","'use strict';\nvar global = require('../internals/global');\n\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar defineProperty = Object.defineProperty;\n\nmodule.exports = function (key, value) {\n  try {\n    defineProperty(global, key, { value: value, configurable: true, writable: true });\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","'use strict';\nvar fails = require('../internals/fails');\n\n// Detect IE8's incomplete defineProperty implementation\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] !== 7;\n});\n","'use strict';\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","'use strict';\nvar $TypeError = TypeError;\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF; // 2 ** 53 - 1 == 9007199254740991\n\nmodule.exports = function (it) {\n  if (it > MAX_SAFE_INTEGER) throw $TypeError('Maximum allowed index exceeded');\n  return it;\n};\n","'use strict';\nmodule.exports = {\n  IndexSizeError: { s: 'INDEX_SIZE_ERR', c: 1, m: 1 },\n  DOMStringSizeError: { s: 'DOMSTRING_SIZE_ERR', c: 2, m: 0 },\n  HierarchyRequestError: { s: 'HIERARCHY_REQUEST_ERR', c: 3, m: 1 },\n  WrongDocumentError: { s: 'WRONG_DOCUMENT_ERR', c: 4, m: 1 },\n  InvalidCharacterError: { s: 'INVALID_CHARACTER_ERR', c: 5, m: 1 },\n  NoDataAllowedError: { s: 'NO_DATA_ALLOWED_ERR', c: 6, m: 0 },\n  NoModificationAllowedError: { s: 'NO_MODIFICATION_ALLOWED_ERR', c: 7, m: 1 },\n  NotFoundError: { s: 'NOT_FOUND_ERR', c: 8, m: 1 },\n  NotSupportedError: { s: 'NOT_SUPPORTED_ERR', c: 9, m: 1 },\n  InUseAttributeError: { s: 'INUSE_ATTRIBUTE_ERR', c: 10, m: 1 },\n  InvalidStateError: { s: 'INVALID_STATE_ERR', c: 11, m: 1 },\n  SyntaxError: { s: 'SYNTAX_ERR', c: 12, m: 1 },\n  InvalidModificationError: { s: 'INVALID_MODIFICATION_ERR', c: 13, m: 1 },\n  NamespaceError: { s: 'NAMESPACE_ERR', c: 14, m: 1 },\n  InvalidAccessError: { s: 'INVALID_ACCESS_ERR', c: 15, m: 1 },\n  ValidationError: { s: 'VALIDATION_ERR', c: 16, m: 0 },\n  TypeMismatchError: { s: 'TYPE_MISMATCH_ERR', c: 17, m: 1 },\n  SecurityError: { s: 'SECURITY_ERR', c: 18, m: 1 },\n  NetworkError: { s: 'NETWORK_ERR', c: 19, m: 1 },\n  AbortError: { s: 'ABORT_ERR', c: 20, m: 1 },\n  URLMismatchError: { s: 'URL_MISMATCH_ERR', c: 21, m: 1 },\n  QuotaExceededError: { s: 'QUOTA_EXCEEDED_ERR', c: 22, m: 1 },\n  TimeoutError: { s: 'TIMEOUT_ERR', c: 23, m: 1 },\n  InvalidNodeTypeError: { s: 'INVALID_NODE_TYPE_ERR', c: 24, m: 1 },\n  DataCloneError: { s: 'DATA_CLONE_ERR', c: 25, m: 1 }\n};\n","'use strict';\nmodule.exports = typeof navigator != 'undefined' && String(navigator.userAgent) || '';\n","'use strict';\nvar global = require('../internals/global');\nvar userAgent = require('../internals/engine-user-agent');\n\nvar process = global.process;\nvar Deno = global.Deno;\nvar versions = process && process.versions || Deno && Deno.version;\nvar v8 = versions && versions.v8;\nvar match, version;\n\nif (v8) {\n  match = v8.split('.');\n  // in old Chrome, versions of V8 isn't V8 = Chrome / 10\n  // but their correct versions are not interesting for us\n  version = match[0] > 0 && match[0] < 4 ? 1 : +(match[0] + match[1]);\n}\n\n// BrowserFS NodeJS `process` polyfill incorrectly set `.v8` to `0.0`\n// so check `userAgent` even if `.v8` exists, but 0\nif (!version && userAgent) {\n  match = userAgent.match(/Edge\\/(\\d+)/);\n  if (!match || match[1] >= 74) {\n    match = userAgent.match(/Chrome\\/(\\d+)/);\n    if (match) version = +match[1];\n  }\n}\n\nmodule.exports = version;\n","'use strict';\n// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\n\nvar $Error = Error;\nvar replace = uncurryThis(''.replace);\n\nvar TEST = (function (arg) { return String(new $Error(arg).stack); })('zxcasd');\n// eslint-disable-next-line redos/no-vulnerable -- safe\nvar V8_OR_CHAKRA_STACK_ENTRY = /\\n\\s*at [^:]*:[^\\n]*/;\nvar IS_V8_OR_CHAKRA_STACK = V8_OR_CHAKRA_STACK_ENTRY.test(TEST);\n\nmodule.exports = function (stack, dropEntries) {\n  if (IS_V8_OR_CHAKRA_STACK && typeof stack == 'string' && !$Error.prepareStackTrace) {\n    while (dropEntries--) stack = replace(stack, V8_OR_CHAKRA_STACK_ENTRY, '');\n  } return stack;\n};\n","'use strict';\nvar global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar defineBuiltIn = require('../internals/define-built-in');\nvar defineGlobalProperty = require('../internals/define-global-property');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target         - name of the target object\n  options.global         - target is the global object\n  options.stat           - export as static methods of target\n  options.proto          - export as prototype methods of target\n  options.real           - real prototype method for the `pure` version\n  options.forced         - export even if the native feature is available\n  options.bind           - bind methods to the target, required for the `pure` version\n  options.wrap           - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe         - use the simple assignment of property instead of delete + defineProperty\n  options.sham           - add a flag to not completely full polyfills\n  options.enumerable     - export as enumerable property\n  options.dontCallGetSet - prevent calling a getter on target\n  options.name           - the .name of the function if it does not match the key\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || defineGlobalProperty(TARGET, {});\n  } else {\n    target = global[TARGET] && global[TARGET].prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.dontCallGetSet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty == typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    defineBuiltIn(target, key, sourceProperty, options);\n  }\n};\n","'use strict';\nmodule.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","'use strict';\nvar fails = require('../internals/fails');\n\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-function-prototype-bind -- safe\n  var test = (function () { /* empty */ }).bind();\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return typeof test != 'function' || test.hasOwnProperty('prototype');\n});\n","'use strict';\nvar NATIVE_BIND = require('../internals/function-bind-native');\n\nvar call = Function.prototype.call;\n\nmodule.exports = NATIVE_BIND ? call.bind(call) : function () {\n  return call.apply(call, arguments);\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar hasOwn = require('../internals/has-own-property');\n\nvar FunctionPrototype = Function.prototype;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getDescriptor = DESCRIPTORS && Object.getOwnPropertyDescriptor;\n\nvar EXISTS = hasOwn(FunctionPrototype, 'name');\n// additional protection from minified / mangled / dropped function names\nvar PROPER = EXISTS && (function something() { /* empty */ }).name === 'something';\nvar CONFIGURABLE = EXISTS && (!DESCRIPTORS || (DESCRIPTORS && getDescriptor(FunctionPrototype, 'name').configurable));\n\nmodule.exports = {\n  EXISTS: EXISTS,\n  PROPER: PROPER,\n  CONFIGURABLE: CONFIGURABLE\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar aCallable = require('../internals/a-callable');\n\nmodule.exports = function (object, key, method) {\n  try {\n    // eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\n    return uncurryThis(aCallable(Object.getOwnPropertyDescriptor(object, key)[method]));\n  } catch (error) { /* empty */ }\n};\n","'use strict';\nvar NATIVE_BIND = require('../internals/function-bind-native');\n\nvar FunctionPrototype = Function.prototype;\nvar call = FunctionPrototype.call;\nvar uncurryThisWithBind = NATIVE_BIND && FunctionPrototype.bind.bind(call, call);\n\nmodule.exports = NATIVE_BIND ? uncurryThisWithBind : function (fn) {\n  return function () {\n    return call.apply(fn, arguments);\n  };\n};\n","'use strict';\nvar global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar aFunction = function (argument) {\n  return isCallable(argument) ? argument : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(global[namespace]) : global[namespace] && global[namespace][method];\n};\n","'use strict';\nvar aCallable = require('../internals/a-callable');\nvar isNullOrUndefined = require('../internals/is-null-or-undefined');\n\n// `GetMethod` abstract operation\n// https://tc39.es/ecma262/#sec-getmethod\nmodule.exports = function (V, P) {\n  var func = V[P];\n  return isNullOrUndefined(func) ? undefined : aCallable(func);\n};\n","'use strict';\nvar check = function (it) {\n  return it && it.Math === Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line es/no-global-this -- safe\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  // eslint-disable-next-line no-restricted-globals -- safe\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  check(typeof this == 'object' && this) ||\n  // eslint-disable-next-line no-new-func -- fallback\n  (function () { return this; })() || Function('return this')();\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar toObject = require('../internals/to-object');\n\nvar hasOwnProperty = uncurryThis({}.hasOwnProperty);\n\n// `HasOwnProperty` abstract operation\n// https://tc39.es/ecma262/#sec-hasownproperty\n// eslint-disable-next-line es/no-object-hasown -- safe\nmodule.exports = Object.hasOwn || function hasOwn(it, key) {\n  return hasOwnProperty(toObject(it), key);\n};\n","'use strict';\nmodule.exports = {};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thanks to IE8 for its funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a !== 7;\n});\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar $Object = Object;\nvar split = uncurryThis(''.split);\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return !$Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) === 'String' ? split(it, '') : $Object(it);\n} : $Object;\n","'use strict';\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    isCallable(NewTarget = dummy.constructor) &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isCallable = require('../internals/is-callable');\nvar store = require('../internals/shared-store');\n\nvar functionToString = uncurryThis(Function.toString);\n\n// this helper broken in `core-js@3.4.1-3.4.4`, so we can't use `shared` helper\nif (!isCallable(store.inspectSource)) {\n  store.inspectSource = function (it) {\n    return functionToString(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","'use strict';\nvar NATIVE_WEAK_MAP = require('../internals/weak-map-basic-detection');\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar hasOwn = require('../internals/has-own-property');\nvar shared = require('../internals/shared-store');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar OBJECT_ALREADY_INITIALIZED = 'Object already initialized';\nvar TypeError = global.TypeError;\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw new TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP || shared.state) {\n  var store = shared.state || (shared.state = new WeakMap());\n  /* eslint-disable no-self-assign -- prototype methods protection */\n  store.get = store.get;\n  store.has = store.has;\n  store.set = store.set;\n  /* eslint-enable no-self-assign -- prototype methods protection */\n  set = function (it, metadata) {\n    if (store.has(it)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    store.set(it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return store.get(it) || {};\n  };\n  has = function (it) {\n    return store.has(it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    if (hasOwn(it, STATE)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return hasOwn(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return hasOwn(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","'use strict';\nvar classof = require('../internals/classof-raw');\n\n// `IsArray` abstract operation\n// https://tc39.es/ecma262/#sec-isarray\n// eslint-disable-next-line es/no-array-isarray -- safe\nmodule.exports = Array.isArray || function isArray(argument) {\n  return classof(argument) === 'Array';\n};\n","'use strict';\n// https://tc39.es/ecma262/#sec-IsHTMLDDA-internal-slot\nvar documentAll = typeof document == 'object' && document.all;\n\n// `IsCallable` abstract operation\n// https://tc39.es/ecma262/#sec-iscallable\n// eslint-disable-next-line unicorn/no-typeof-undefined -- required for testing\nmodule.exports = typeof documentAll == 'undefined' && documentAll !== undefined ? function (argument) {\n  return typeof argument == 'function' || argument === documentAll;\n} : function (argument) {\n  return typeof argument == 'function';\n};\n","'use strict';\nvar fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value === POLYFILL ? true\n    : value === NATIVE ? false\n    : isCallable(detection) ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","'use strict';\n// we can't use just `it == null` since of `document.all` special case\n// https://tc39.es/ecma262/#sec-IsHTMLDDA-internal-slot-aec\nmodule.exports = function (it) {\n  return it === null || it === undefined;\n};\n","'use strict';\nvar isCallable = require('../internals/is-callable');\n\nmodule.exports = function (it) {\n  return typeof it == 'object' ? it !== null : isCallable(it);\n};\n","'use strict';\nvar isObject = require('../internals/is-object');\n\nmodule.exports = function (argument) {\n  return isObject(argument) || argument === null;\n};\n","'use strict';\nmodule.exports = false;\n","'use strict';\nvar getBuiltIn = require('../internals/get-built-in');\nvar isCallable = require('../internals/is-callable');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar $Object = Object;\n\nmodule.exports = USE_SYMBOL_AS_UID ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  var $Symbol = getBuiltIn('Symbol');\n  return isCallable($Symbol) && isPrototypeOf($Symbol.prototype, $Object(it));\n};\n","'use strict';\nvar toLength = require('../internals/to-length');\n\n// `LengthOfArrayLike` abstract operation\n// https://tc39.es/ecma262/#sec-lengthofarraylike\nmodule.exports = function (obj) {\n  return toLength(obj.length);\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\nvar hasOwn = require('../internals/has-own-property');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar CONFIGURABLE_FUNCTION_NAME = require('../internals/function-name').CONFIGURABLE;\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar enforceInternalState = InternalStateModule.enforce;\nvar getInternalState = InternalStateModule.get;\nvar $String = String;\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar defineProperty = Object.defineProperty;\nvar stringSlice = uncurryThis(''.slice);\nvar replace = uncurryThis(''.replace);\nvar join = uncurryThis([].join);\n\nvar CONFIGURABLE_LENGTH = DESCRIPTORS && !fails(function () {\n  return defineProperty(function () { /* empty */ }, 'length', { value: 8 }).length !== 8;\n});\n\nvar TEMPLATE = String(String).split('String');\n\nvar makeBuiltIn = module.exports = function (value, name, options) {\n  if (stringSlice($String(name), 0, 7) === 'Symbol(') {\n    name = '[' + replace($String(name), /^Symbol\\(([^)]*)\\).*$/, '$1') + ']';\n  }\n  if (options && options.getter) name = 'get ' + name;\n  if (options && options.setter) name = 'set ' + name;\n  if (!hasOwn(value, 'name') || (CONFIGURABLE_FUNCTION_NAME && value.name !== name)) {\n    if (DESCRIPTORS) defineProperty(value, 'name', { value: name, configurable: true });\n    else value.name = name;\n  }\n  if (CONFIGURABLE_LENGTH && options && hasOwn(options, 'arity') && value.length !== options.arity) {\n    defineProperty(value, 'length', { value: options.arity });\n  }\n  try {\n    if (options && hasOwn(options, 'constructor') && options.constructor) {\n      if (DESCRIPTORS) defineProperty(value, 'prototype', { writable: false });\n    // in V8 ~ Chrome 53, prototypes of some methods, like `Array.prototype.values`, are non-writable\n    } else if (value.prototype) value.prototype = undefined;\n  } catch (error) { /* empty */ }\n  var state = enforceInternalState(value);\n  if (!hasOwn(state, 'source')) {\n    state.source = join(TEMPLATE, typeof name == 'string' ? name : '');\n  } return value;\n};\n\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n// eslint-disable-next-line no-extend-native -- required\nFunction.prototype.toString = makeBuiltIn(function toString() {\n  return isCallable(this) && getInternalState(this).source || inspectSource(this);\n}, 'toString');\n","'use strict';\nvar ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `Math.trunc` method\n// https://tc39.es/ecma262/#sec-math.trunc\n// eslint-disable-next-line es/no-math-trunc -- safe\nmodule.exports = Math.trunc || function trunc(x) {\n  var n = +x;\n  return (n > 0 ? floor : ceil)(n);\n};\n","'use strict';\nvar toString = require('../internals/to-string');\n\nmodule.exports = function (argument, $default) {\n  return argument === undefined ? arguments.length < 2 ? '' : $default : toString(argument);\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar V8_PROTOTYPE_DEFINE_BUG = require('../internals/v8-prototype-define-bug');\nvar anObject = require('../internals/an-object');\nvar toPropertyKey = require('../internals/to-property-key');\n\nvar $TypeError = TypeError;\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar $defineProperty = Object.defineProperty;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\nvar ENUMERABLE = 'enumerable';\nvar CONFIGURABLE = 'configurable';\nvar WRITABLE = 'writable';\n\n// `Object.defineProperty` method\n// https://tc39.es/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? V8_PROTOTYPE_DEFINE_BUG ? function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPropertyKey(P);\n  anObject(Attributes);\n  if (typeof O === 'function' && P === 'prototype' && 'value' in Attributes && WRITABLE in Attributes && !Attributes[WRITABLE]) {\n    var current = $getOwnPropertyDescriptor(O, P);\n    if (current && current[WRITABLE]) {\n      O[P] = Attributes.value;\n      Attributes = {\n        configurable: CONFIGURABLE in Attributes ? Attributes[CONFIGURABLE] : current[CONFIGURABLE],\n        enumerable: ENUMERABLE in Attributes ? Attributes[ENUMERABLE] : current[ENUMERABLE],\n        writable: false\n      };\n    }\n  } return $defineProperty(O, P, Attributes);\n} : $defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPropertyKey(P);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return $defineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw new $TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar call = require('../internals/function-call');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPropertyKey = require('../internals/to-property-key');\nvar hasOwn = require('../internals/has-own-property');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? $getOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPropertyKey(P);\n  if (IE8_DOM_DEFINE) try {\n    return $getOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (hasOwn(O, P)) return createPropertyDescriptor(!call(propertyIsEnumerableModule.f, O, P), O[P]);\n};\n","'use strict';\nvar internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.es/ecma262/#sec-object.getownpropertynames\n// eslint-disable-next-line es/no-object-getownpropertynames -- safe\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","'use strict';\n// eslint-disable-next-line es/no-object-getownpropertysymbols -- safe\nexports.f = Object.getOwnPropertySymbols;\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\n\nmodule.exports = uncurryThis({}.isPrototypeOf);\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar hasOwn = require('../internals/has-own-property');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar push = uncurryThis([].push);\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !hasOwn(hiddenKeys, key) && hasOwn(O, key) && push(result, key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (hasOwn(O, key = names[i++])) {\n    ~indexOf(result, key) || push(result, key);\n  }\n  return result;\n};\n","'use strict';\nvar $propertyIsEnumerable = {}.propertyIsEnumerable;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !$propertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : $propertyIsEnumerable;\n","'use strict';\n/* eslint-disable no-proto -- safe */\nvar uncurryThisAccessor = require('../internals/function-uncurry-this-accessor');\nvar anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n// eslint-disable-next-line es/no-object-setprototypeof -- safe\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    setter = uncurryThisAccessor(Object.prototype, '__proto__', 'set');\n    setter(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","'use strict';\nvar call = require('../internals/function-call');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\n\nvar $TypeError = TypeError;\n\n// `OrdinaryToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-ordinarytoprimitive\nmodule.exports = function (input, pref) {\n  var fn, val;\n  if (pref === 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  if (isCallable(fn = input.valueOf) && !isObject(val = call(fn, input))) return val;\n  if (pref !== 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  throw new $TypeError(\"Can't convert object to primitive value\");\n};\n","'use strict';\nvar getBuiltIn = require('../internals/get-built-in');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\nvar concat = uncurryThis([].concat);\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? concat(keys, getOwnPropertySymbols(it)) : keys;\n};\n","'use strict';\nvar isNullOrUndefined = require('../internals/is-null-or-undefined');\n\nvar $TypeError = TypeError;\n\n// `RequireObjectCoercible` abstract operation\n// https://tc39.es/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (isNullOrUndefined(it)) throw new $TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","'use strict';\nvar shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","'use strict';\nvar global = require('../internals/global');\nvar defineGlobalProperty = require('../internals/define-global-property');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || defineGlobalProperty(SHARED, {});\n\nmodule.exports = store;\n","'use strict';\nvar IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.35.1',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2014-2024 Denis Pushkarev (zloirock.ru)',\n  license: 'https://github.com/zloirock/core-js/blob/v3.35.1/LICENSE',\n  source: 'https://github.com/zloirock/core-js'\n});\n","'use strict';\n/* eslint-disable es/no-symbol -- required for testing */\nvar V8_VERSION = require('../internals/engine-v8-version');\nvar fails = require('../internals/fails');\nvar global = require('../internals/global');\n\nvar $String = global.String;\n\n// eslint-disable-next-line es/no-object-getownpropertysymbols -- required for testing\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  var symbol = Symbol('symbol detection');\n  // Chrome 38 Symbol has incorrect toString conversion\n  // `get-own-property-symbols` polyfill symbols converted to object are not Symbol instances\n  // nb: Do not call `String` directly to avoid this being optimized out to `symbol+''` which will,\n  // of course, fail.\n  return !$String(symbol) || !(Object(symbol) instanceof Symbol) ||\n    // Chrome 38-40 symbols are not inherited from DOM collections prototypes to instances\n    !Symbol.sham && V8_VERSION && V8_VERSION < 41;\n});\n","'use strict';\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toIntegerOrInfinity(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","'use strict';\n// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","'use strict';\nvar trunc = require('../internals/math-trunc');\n\n// `ToIntegerOrInfinity` abstract operation\n// https://tc39.es/ecma262/#sec-tointegerorinfinity\nmodule.exports = function (argument) {\n  var number = +argument;\n  // eslint-disable-next-line no-self-compare -- NaN check\n  return number !== number || number === 0 ? 0 : trunc(number);\n};\n","'use strict';\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.es/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  var len = toIntegerOrInfinity(argument);\n  return len > 0 ? min(len, 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","'use strict';\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar $Object = Object;\n\n// `ToObject` abstract operation\n// https://tc39.es/ecma262/#sec-toobject\nmodule.exports = function (argument) {\n  return $Object(requireObjectCoercible(argument));\n};\n","'use strict';\nvar call = require('../internals/function-call');\nvar isObject = require('../internals/is-object');\nvar isSymbol = require('../internals/is-symbol');\nvar getMethod = require('../internals/get-method');\nvar ordinaryToPrimitive = require('../internals/ordinary-to-primitive');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar $TypeError = TypeError;\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\n\n// `ToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-toprimitive\nmodule.exports = function (input, pref) {\n  if (!isObject(input) || isSymbol(input)) return input;\n  var exoticToPrim = getMethod(input, TO_PRIMITIVE);\n  var result;\n  if (exoticToPrim) {\n    if (pref === undefined) pref = 'default';\n    result = call(exoticToPrim, input, pref);\n    if (!isObject(result) || isSymbol(result)) return result;\n    throw new $TypeError(\"Can't convert object to primitive value\");\n  }\n  if (pref === undefined) pref = 'number';\n  return ordinaryToPrimitive(input, pref);\n};\n","'use strict';\nvar toPrimitive = require('../internals/to-primitive');\nvar isSymbol = require('../internals/is-symbol');\n\n// `ToPropertyKey` abstract operation\n// https://tc39.es/ecma262/#sec-topropertykey\nmodule.exports = function (argument) {\n  var key = toPrimitive(argument, 'string');\n  return isSymbol(key) ? key : key + '';\n};\n","'use strict';\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar test = {};\n\ntest[TO_STRING_TAG] = 'z';\n\nmodule.exports = String(test) === '[object z]';\n","'use strict';\nvar classof = require('../internals/classof');\n\nvar $String = String;\n\nmodule.exports = function (argument) {\n  if (classof(argument) === 'Symbol') throw new TypeError('Cannot convert a Symbol value to a string');\n  return $String(argument);\n};\n","'use strict';\nvar $String = String;\n\nmodule.exports = function (argument) {\n  try {\n    return $String(argument);\n  } catch (error) {\n    return 'Object';\n  }\n};\n","'use strict';\nvar uncurryThis = require('../internals/function-uncurry-this');\n\nvar id = 0;\nvar postfix = Math.random();\nvar toString = uncurryThis(1.0.toString);\n\nmodule.exports = function (key) {\n  return 'Symbol(' + (key === undefined ? '' : key) + ')_' + toString(++id + postfix, 36);\n};\n","'use strict';\n/* eslint-disable es/no-symbol -- required for testing */\nvar NATIVE_SYMBOL = require('../internals/symbol-constructor-detection');\n\nmodule.exports = NATIVE_SYMBOL\n  && !Symbol.sham\n  && typeof Symbol.iterator == 'symbol';\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\n\n// V8 ~ Chrome 36-\n// https://bugs.chromium.org/p/v8/issues/detail?id=3334\nmodule.exports = DESCRIPTORS && fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty(function () { /* empty */ }, 'prototype', {\n    value: 42,\n    writable: false\n  }).prototype !== 42;\n});\n","'use strict';\nvar global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = isCallable(WeakMap) && /native code/.test(String(WeakMap));\n","'use strict';\nvar global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar hasOwn = require('../internals/has-own-property');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/symbol-constructor-detection');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar Symbol = global.Symbol;\nvar WellKnownSymbolsStore = shared('wks');\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol['for'] || Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!hasOwn(WellKnownSymbolsStore, name)) {\n    WellKnownSymbolsStore[name] = NATIVE_SYMBOL && hasOwn(Symbol, name)\n      ? Symbol[name]\n      : createWellKnownSymbol('Symbol.' + name);\n  } return WellKnownSymbolsStore[name];\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar toObject = require('../internals/to-object');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar setArrayLength = require('../internals/array-set-length');\nvar doesNotExceedSafeInteger = require('../internals/does-not-exceed-safe-integer');\nvar fails = require('../internals/fails');\n\nvar INCORRECT_TO_LENGTH = fails(function () {\n  return [].push.call({ length: 0x100000000 }, 1) !== 4294967297;\n});\n\n// V8 <= 121 and Safari <= 15.4; FF < 23 throws InternalError\n// https://bugs.chromium.org/p/v8/issues/detail?id=12681\nvar properErrorOnNonWritableLength = function () {\n  try {\n    // eslint-disable-next-line es/no-object-defineproperty -- safe\n    Object.defineProperty([], 'length', { writable: false }).push();\n  } catch (error) {\n    return error instanceof TypeError;\n  }\n};\n\nvar FORCED = INCORRECT_TO_LENGTH || !properErrorOnNonWritableLength();\n\n// `Array.prototype.push` method\n// https://tc39.es/ecma262/#sec-array.prototype.push\n$({ target: 'Array', proto: true, arity: 1, forced: FORCED }, {\n  // eslint-disable-next-line no-unused-vars -- required for `.length`\n  push: function push(item) {\n    var O = toObject(this);\n    var len = lengthOfArrayLike(O);\n    var argCount = arguments.length;\n    doesNotExceedSafeInteger(len + argCount);\n    for (var i = 0; i < argCount; i++) {\n      O[len] = arguments[i];\n      len++;\n    }\n    setArrayLength(O, len);\n    return len;\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar defineProperty = require('../internals/object-define-property').f;\nvar hasOwn = require('../internals/has-own-property');\nvar anInstance = require('../internals/an-instance');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar normalizeStringArgument = require('../internals/normalize-string-argument');\nvar DOMExceptionConstants = require('../internals/dom-exception-constants');\nvar clearErrorStack = require('../internals/error-stack-clear');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar IS_PURE = require('../internals/is-pure');\n\nvar DOM_EXCEPTION = 'DOMException';\nvar Error = getBuiltIn('Error');\nvar NativeDOMException = getBuiltIn(DOM_EXCEPTION);\n\nvar $DOMException = function DOMException() {\n  anInstance(this, DOMExceptionPrototype);\n  var argumentsLength = arguments.length;\n  var message = normalizeStringArgument(argumentsLength < 1 ? undefined : arguments[0]);\n  var name = normalizeStringArgument(argumentsLength < 2 ? undefined : arguments[1], 'Error');\n  var that = new NativeDOMException(message, name);\n  var error = new Error(message);\n  error.name = DOM_EXCEPTION;\n  defineProperty(that, 'stack', createPropertyDescriptor(1, clearErrorStack(error.stack, 1)));\n  inheritIfRequired(that, this, $DOMException);\n  return that;\n};\n\nvar DOMExceptionPrototype = $DOMException.prototype = NativeDOMException.prototype;\n\nvar ERROR_HAS_STACK = 'stack' in new Error(DOM_EXCEPTION);\nvar DOM_EXCEPTION_HAS_STACK = 'stack' in new NativeDOMException(1, 2);\n\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar descriptor = NativeDOMException && DESCRIPTORS && Object.getOwnPropertyDescriptor(global, DOM_EXCEPTION);\n\n// Bun ~ 0.1.1 DOMException have incorrect descriptor and we can't redefine it\n// https://github.com/Jarred-Sumner/bun/issues/399\nvar BUGGY_DESCRIPTOR = !!descriptor && !(descriptor.writable && descriptor.configurable);\n\nvar FORCED_CONSTRUCTOR = ERROR_HAS_STACK && !BUGGY_DESCRIPTOR && !DOM_EXCEPTION_HAS_STACK;\n\n// `DOMException` constructor patch for `.stack` where it's required\n// https://webidl.spec.whatwg.org/#es-DOMException-specialness\n$({ global: true, constructor: true, forced: IS_PURE || FORCED_CONSTRUCTOR }, { // TODO: fix export logic\n  DOMException: FORCED_CONSTRUCTOR ? $DOMException : NativeDOMException\n});\n\nvar PolyfilledDOMException = getBuiltIn(DOM_EXCEPTION);\nvar PolyfilledDOMExceptionPrototype = PolyfilledDOMException.prototype;\n\nif (PolyfilledDOMExceptionPrototype.constructor !== PolyfilledDOMException) {\n  if (!IS_PURE) {\n    defineProperty(PolyfilledDOMExceptionPrototype, 'constructor', createPropertyDescriptor(1, PolyfilledDOMException));\n  }\n\n  for (var key in DOMExceptionConstants) if (hasOwn(DOMExceptionConstants, key)) {\n    var constant = DOMExceptionConstants[key];\n    var constantName = constant.s;\n    if (!hasOwn(PolyfilledDOMException, constantName)) {\n      defineProperty(PolyfilledDOMException, constantName, createPropertyDescriptor(6, constant.c));\n    }\n  }\n}\n","const instanceOfAny = (object, constructors) => constructors.some((c) => object instanceof c);\n\nlet idbProxyableTypes;\nlet cursorAdvanceMethods;\n// This is a function to prevent it throwing up in node environments.\nfunction getIdbProxyableTypes() {\n    return (idbProxyableTypes ||\n        (idbProxyableTypes = [\n            IDBDatabase,\n            IDBObjectStore,\n            IDBIndex,\n            IDBCursor,\n            IDBTransaction,\n        ]));\n}\n// This is a function to prevent it throwing up in node environments.\nfunction getCursorAdvanceMethods() {\n    return (cursorAdvanceMethods ||\n        (cursorAdvanceMethods = [\n            IDBCursor.prototype.advance,\n            IDBCursor.prototype.continue,\n            IDBCursor.prototype.continuePrimaryKey,\n        ]));\n}\nconst cursorRequestMap = new WeakMap();\nconst transactionDoneMap = new WeakMap();\nconst transactionStoreNamesMap = new WeakMap();\nconst transformCache = new WeakMap();\nconst reverseTransformCache = new WeakMap();\nfunction promisifyRequest(request) {\n    const promise = new Promise((resolve, reject) => {\n        const unlisten = () => {\n            request.removeEventListener('success', success);\n            request.removeEventListener('error', error);\n        };\n        const success = () => {\n            resolve(wrap(request.result));\n            unlisten();\n        };\n        const error = () => {\n            reject(request.error);\n            unlisten();\n        };\n        request.addEventListener('success', success);\n        request.addEventListener('error', error);\n    });\n    promise\n        .then((value) => {\n        // Since cursoring reuses the IDBRequest (*sigh*), we cache it for later retrieval\n        // (see wrapFunction).\n        if (value instanceof IDBCursor) {\n            cursorRequestMap.set(value, request);\n        }\n        // Catching to avoid \"Uncaught Promise exceptions\"\n    })\n        .catch(() => { });\n    // This mapping exists in reverseTransformCache but doesn't doesn't exist in transformCache. This\n    // is because we create many promises from a single IDBRequest.\n    reverseTransformCache.set(promise, request);\n    return promise;\n}\nfunction cacheDonePromiseForTransaction(tx) {\n    // Early bail if we've already created a done promise for this transaction.\n    if (transactionDoneMap.has(tx))\n        return;\n    const done = new Promise((resolve, reject) => {\n        const unlisten = () => {\n            tx.removeEventListener('complete', complete);\n            tx.removeEventListener('error', error);\n            tx.removeEventListener('abort', error);\n        };\n        const complete = () => {\n            resolve();\n            unlisten();\n        };\n        const error = () => {\n            reject(tx.error || new DOMException('AbortError', 'AbortError'));\n            unlisten();\n        };\n        tx.addEventListener('complete', complete);\n        tx.addEventListener('error', error);\n        tx.addEventListener('abort', error);\n    });\n    // Cache it for later retrieval.\n    transactionDoneMap.set(tx, done);\n}\nlet idbProxyTraps = {\n    get(target, prop, receiver) {\n        if (target instanceof IDBTransaction) {\n            // Special handling for transaction.done.\n            if (prop === 'done')\n                return transactionDoneMap.get(target);\n            // Polyfill for objectStoreNames because of Edge.\n            if (prop === 'objectStoreNames') {\n                return target.objectStoreNames || transactionStoreNamesMap.get(target);\n            }\n            // Make tx.store return the only store in the transaction, or undefined if there are many.\n            if (prop === 'store') {\n                return receiver.objectStoreNames[1]\n                    ? undefined\n                    : receiver.objectStore(receiver.objectStoreNames[0]);\n            }\n        }\n        // Else transform whatever we get back.\n        return wrap(target[prop]);\n    },\n    set(target, prop, value) {\n        target[prop] = value;\n        return true;\n    },\n    has(target, prop) {\n        if (target instanceof IDBTransaction &&\n            (prop === 'done' || prop === 'store')) {\n            return true;\n        }\n        return prop in target;\n    },\n};\nfunction replaceTraps(callback) {\n    idbProxyTraps = callback(idbProxyTraps);\n}\nfunction wrapFunction(func) {\n    // Due to expected object equality (which is enforced by the caching in `wrap`), we\n    // only create one new func per func.\n    // Edge doesn't support objectStoreNames (booo), so we polyfill it here.\n    if (func === IDBDatabase.prototype.transaction &&\n        !('objectStoreNames' in IDBTransaction.prototype)) {\n        return function (storeNames, ...args) {\n            const tx = func.call(unwrap(this), storeNames, ...args);\n            transactionStoreNamesMap.set(tx, storeNames.sort ? storeNames.sort() : [storeNames]);\n            return wrap(tx);\n        };\n    }\n    // Cursor methods are special, as the behaviour is a little more different to standard IDB. In\n    // IDB, you advance the cursor and wait for a new 'success' on the IDBRequest that gave you the\n    // cursor. It's kinda like a promise that can resolve with many values. That doesn't make sense\n    // with real promises, so each advance methods returns a new promise for the cursor object, or\n    // undefined if the end of the cursor has been reached.\n    if (getCursorAdvanceMethods().includes(func)) {\n        return function (...args) {\n            // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n            // the original object.\n            func.apply(unwrap(this), args);\n            return wrap(cursorRequestMap.get(this));\n        };\n    }\n    return function (...args) {\n        // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n        // the original object.\n        return wrap(func.apply(unwrap(this), args));\n    };\n}\nfunction transformCachableValue(value) {\n    if (typeof value === 'function')\n        return wrapFunction(value);\n    // This doesn't return, it just creates a 'done' promise for the transaction,\n    // which is later returned for transaction.done (see idbObjectHandler).\n    if (value instanceof IDBTransaction)\n        cacheDonePromiseForTransaction(value);\n    if (instanceOfAny(value, getIdbProxyableTypes()))\n        return new Proxy(value, idbProxyTraps);\n    // Return the same value back if we're not going to transform it.\n    return value;\n}\nfunction wrap(value) {\n    // We sometimes generate multiple promises from a single IDBRequest (eg when cursoring), because\n    // IDB is weird and a single IDBRequest can yield many responses, so these can't be cached.\n    if (value instanceof IDBRequest)\n        return promisifyRequest(value);\n    // If we've already transformed this value before, reuse the transformed value.\n    // This is faster, but it also provides object equality.\n    if (transformCache.has(value))\n        return transformCache.get(value);\n    const newValue = transformCachableValue(value);\n    // Not all types are transformed.\n    // These may be primitive types, so they can't be WeakMap keys.\n    if (newValue !== value) {\n        transformCache.set(value, newValue);\n        reverseTransformCache.set(newValue, value);\n    }\n    return newValue;\n}\nconst unwrap = (value) => reverseTransformCache.get(value);\n\nexport { reverseTransformCache as a, instanceOfAny as i, replaceTraps as r, unwrap as u, wrap as w };\n","import { w as wrap, r as replaceTraps } from './wrap-idb-value.js';\nexport { u as unwrap, w as wrap } from './wrap-idb-value.js';\n\n/**\n * Open a database.\n *\n * @param name Name of the database.\n * @param version Schema version.\n * @param callbacks Additional callbacks.\n */\nfunction openDB(name, version, { blocked, upgrade, blocking, terminated } = {}) {\n    const request = indexedDB.open(name, version);\n    const openPromise = wrap(request);\n    if (upgrade) {\n        request.addEventListener('upgradeneeded', (event) => {\n            upgrade(wrap(request.result), event.oldVersion, event.newVersion, wrap(request.transaction), event);\n        });\n    }\n    if (blocked) {\n        request.addEventListener('blocked', (event) => blocked(\n        // Casting due to https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/1405\n        event.oldVersion, event.newVersion, event));\n    }\n    openPromise\n        .then((db) => {\n        if (terminated)\n            db.addEventListener('close', () => terminated());\n        if (blocking) {\n            db.addEventListener('versionchange', (event) => blocking(event.oldVersion, event.newVersion, event));\n        }\n    })\n        .catch(() => { });\n    return openPromise;\n}\n/**\n * Delete a database.\n *\n * @param name Name of the database.\n */\nfunction deleteDB(name, { blocked } = {}) {\n    const request = indexedDB.deleteDatabase(name);\n    if (blocked) {\n        request.addEventListener('blocked', (event) => blocked(\n        // Casting due to https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/1405\n        event.oldVersion, event));\n    }\n    return wrap(request).then(() => undefined);\n}\n\nconst readMethods = ['get', 'getKey', 'getAll', 'getAllKeys', 'count'];\nconst writeMethods = ['put', 'add', 'delete', 'clear'];\nconst cachedMethods = new Map();\nfunction getMethod(target, prop) {\n    if (!(target instanceof IDBDatabase &&\n        !(prop in target) &&\n        typeof prop === 'string')) {\n        return;\n    }\n    if (cachedMethods.get(prop))\n        return cachedMethods.get(prop);\n    const targetFuncName = prop.replace(/FromIndex$/, '');\n    const useIndex = prop !== targetFuncName;\n    const isWrite = writeMethods.includes(targetFuncName);\n    if (\n    // Bail if the target doesn't exist on the target. Eg, getAll isn't in Edge.\n    !(targetFuncName in (useIndex ? IDBIndex : IDBObjectStore).prototype) ||\n        !(isWrite || readMethods.includes(targetFuncName))) {\n        return;\n    }\n    const method = async function (storeName, ...args) {\n        // isWrite ? 'readwrite' : undefined gzipps better, but fails in Edge :(\n        const tx = this.transaction(storeName, isWrite ? 'readwrite' : 'readonly');\n        let target = tx.store;\n        if (useIndex)\n            target = target.index(args.shift());\n        // Must reject if op rejects.\n        // If it's a write operation, must reject if tx.done rejects.\n        // Must reject with op rejection first.\n        // Must resolve with op value.\n        // Must handle both promises (no unhandled rejections)\n        return (await Promise.all([\n            target[targetFuncName](...args),\n            isWrite && tx.done,\n        ]))[0];\n    };\n    cachedMethods.set(prop, method);\n    return method;\n}\nreplaceTraps((oldTraps) => ({\n    ...oldTraps,\n    get: (target, prop, receiver) => getMethod(target, prop) || oldTraps.get(target, prop, receiver),\n    has: (target, prop) => !!getMethod(target, prop) || oldTraps.has(target, prop),\n}));\n\nexport { deleteDB, openDB };\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  ComponentContainer,\n  ComponentType,\n  Provider,\n  Name\n} from '@firebase/component';\nimport { PlatformLoggerService, VersionService } from './types';\n\nexport class PlatformLoggerServiceImpl implements PlatformLoggerService {\n  constructor(private readonly container: ComponentContainer) {}\n  // In initial implementation, this will be called by installations on\n  // auth token refresh, and installations will send this string.\n  getPlatformInfoString(): string {\n    const providers = this.container.getProviders();\n    // Loop through providers and get library/version pairs from any that are\n    // version components.\n    return providers\n      .map(provider => {\n        if (isVersionServiceProvider(provider)) {\n          const service = provider.getImmediate() as VersionService;\n          return `${service.library}/${service.version}`;\n        } else {\n          return null;\n        }\n      })\n      .filter(logString => logString)\n      .join(' ');\n  }\n}\n/**\n *\n * @param provider check if this provider provides a VersionService\n *\n * NOTE: Using Provider<'app-version'> is a hack to indicate that the provider\n * provides VersionService. The provider is not necessarily a 'app-version'\n * provider.\n */\nfunction isVersionServiceProvider(provider: Provider<Name>): boolean {\n  const component = provider.getComponent();\n  return component?.type === ComponentType.VERSION;\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Logger } from '@firebase/logger';\n\nexport const logger = new Logger('@firebase/app');\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { name as appName } from '../package.json';\nimport { name as appCompatName } from '../../app-compat/package.json';\nimport { name as analyticsCompatName } from '../../../packages/analytics-compat/package.json';\nimport { name as analyticsName } from '../../../packages/analytics/package.json';\nimport { name as appCheckCompatName } from '../../../packages/app-check-compat/package.json';\nimport { name as appCheckName } from '../../../packages/app-check/package.json';\nimport { name as authName } from '../../../packages/auth/package.json';\nimport { name as authCompatName } from '../../../packages/auth-compat/package.json';\nimport { name as databaseName } from '../../../packages/database/package.json';\nimport { name as databaseCompatName } from '../../../packages/database-compat/package.json';\nimport { name as functionsName } from '../../../packages/functions/package.json';\nimport { name as functionsCompatName } from '../../../packages/functions-compat/package.json';\nimport { name as installationsName } from '../../../packages/installations/package.json';\nimport { name as installationsCompatName } from '../../../packages/installations-compat/package.json';\nimport { name as messagingName } from '../../../packages/messaging/package.json';\nimport { name as messagingCompatName } from '../../../packages/messaging-compat/package.json';\nimport { name as performanceName } from '../../../packages/performance/package.json';\nimport { name as performanceCompatName } from '../../../packages/performance-compat/package.json';\nimport { name as remoteConfigName } from '../../../packages/remote-config/package.json';\nimport { name as remoteConfigCompatName } from '../../../packages/remote-config-compat/package.json';\nimport { name as storageName } from '../../../packages/storage/package.json';\nimport { name as storageCompatName } from '../../../packages/storage-compat/package.json';\nimport { name as firestoreName } from '../../../packages/firestore/package.json';\nimport { name as vertexName } from '../../../packages/vertexai/package.json';\nimport { name as firestoreCompatName } from '../../../packages/firestore-compat/package.json';\nimport { name as packageName } from '../../../packages/firebase/package.json';\n\n/**\n * The default app name\n *\n * @internal\n */\nexport const DEFAULT_ENTRY_NAME = '[DEFAULT]';\n\nexport const PLATFORM_LOG_STRING = {\n  [appName]: 'fire-core',\n  [appCompatName]: 'fire-core-compat',\n  [analyticsName]: 'fire-analytics',\n  [analyticsCompatName]: 'fire-analytics-compat',\n  [appCheckName]: 'fire-app-check',\n  [appCheckCompatName]: 'fire-app-check-compat',\n  [authName]: 'fire-auth',\n  [authCompatName]: 'fire-auth-compat',\n  [databaseName]: 'fire-rtdb',\n  [databaseCompatName]: 'fire-rtdb-compat',\n  [functionsName]: 'fire-fn',\n  [functionsCompatName]: 'fire-fn-compat',\n  [installationsName]: 'fire-iid',\n  [installationsCompatName]: 'fire-iid-compat',\n  [messagingName]: 'fire-fcm',\n  [messagingCompatName]: 'fire-fcm-compat',\n  [performanceName]: 'fire-perf',\n  [performanceCompatName]: 'fire-perf-compat',\n  [remoteConfigName]: 'fire-rc',\n  [remoteConfigCompatName]: 'fire-rc-compat',\n  [storageName]: 'fire-gcs',\n  [storageCompatName]: 'fire-gcs-compat',\n  [firestoreName]: 'fire-fst',\n  [firestoreCompatName]: 'fire-fst-compat',\n  [vertexName]: 'fire-vertex',\n  'fire-js': 'fire-js', // Platform identifier for JS SDK.\n  [packageName]: 'fire-js-all'\n} as const;\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  FirebaseApp,\n  FirebaseOptions,\n  FirebaseServerApp\n} from './public-types';\nimport { Component, Provider, Name } from '@firebase/component';\nimport { logger } from './logger';\nimport { DEFAULT_ENTRY_NAME } from './constants';\nimport { FirebaseAppImpl } from './firebaseApp';\nimport { FirebaseServerAppImpl } from './firebaseServerApp';\n\n/**\n * @internal\n */\nexport const _apps = new Map<string, FirebaseApp>();\n\n/**\n * @internal\n */\nexport const _serverApps = new Map<string, FirebaseServerApp>();\n\n/**\n * Registered components.\n *\n * @internal\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport const _components = new Map<string, Component<any>>();\n\n/**\n * @param component - the component being added to this app's container\n *\n * @internal\n */\nexport function _addComponent<T extends Name>(\n  app: FirebaseApp,\n  component: Component<T>\n): void {\n  try {\n    (app as FirebaseAppImpl).container.addComponent(component);\n  } catch (e) {\n    logger.debug(\n      `Component ${component.name} failed to register with FirebaseApp ${app.name}`,\n      e\n    );\n  }\n}\n\n/**\n *\n * @internal\n */\nexport function _addOrOverwriteComponent(\n  app: FirebaseApp,\n  component: Component\n): void {\n  (app as FirebaseAppImpl).container.addOrOverwriteComponent(component);\n}\n\n/**\n *\n * @param component - the component to register\n * @returns whether or not the component is registered successfully\n *\n * @internal\n */\nexport function _registerComponent<T extends Name>(\n  component: Component<T>\n): boolean {\n  const componentName = component.name;\n  if (_components.has(componentName)) {\n    logger.debug(\n      `There were multiple attempts to register component ${componentName}.`\n    );\n\n    return false;\n  }\n\n  _components.set(componentName, component);\n\n  // add the component to existing app instances\n  for (const app of _apps.values()) {\n    _addComponent(app as FirebaseAppImpl, component);\n  }\n\n  for (const serverApp of _serverApps.values()) {\n    _addComponent(serverApp as FirebaseServerAppImpl, component);\n  }\n\n  return true;\n}\n\n/**\n *\n * @param app - FirebaseApp instance\n * @param name - service name\n *\n * @returns the provider for the service with the matching name\n *\n * @internal\n */\nexport function _getProvider<T extends Name>(\n  app: FirebaseApp,\n  name: T\n): Provider<T> {\n  const heartbeatController = (app as FirebaseAppImpl).container\n    .getProvider('heartbeat')\n    .getImmediate({ optional: true });\n  if (heartbeatController) {\n    void heartbeatController.triggerHeartbeat();\n  }\n  return (app as FirebaseAppImpl).container.getProvider(name);\n}\n\n/**\n *\n * @param app - FirebaseApp instance\n * @param name - service name\n * @param instanceIdentifier - service instance identifier in case the service supports multiple instances\n *\n * @internal\n */\nexport function _removeServiceInstance<T extends Name>(\n  app: FirebaseApp,\n  name: T,\n  instanceIdentifier: string = DEFAULT_ENTRY_NAME\n): void {\n  _getProvider(app, name).clearInstance(instanceIdentifier);\n}\n\n/**\n *\n * @param obj - an object of type FirebaseApp or FirebaseOptions.\n *\n * @returns true if the provide object is of type FirebaseApp.\n *\n * @internal\n */\nexport function _isFirebaseApp(\n  obj: FirebaseApp | FirebaseOptions\n): obj is FirebaseApp {\n  return (obj as FirebaseApp).options !== undefined;\n}\n\n/**\n *\n * @param obj - an object of type FirebaseApp.\n *\n * @returns true if the provided object is of type FirebaseServerAppImpl.\n *\n * @internal\n */\nexport function _isFirebaseServerApp(\n  obj: FirebaseApp | FirebaseServerApp\n): obj is FirebaseServerApp {\n  return (obj as FirebaseServerApp).settings !== undefined;\n}\n\n/**\n * Test only\n *\n * @internal\n */\nexport function _clearComponents(): void {\n  _components.clear();\n}\n\n/**\n * Exported in order to be used in app-compat package\n */\nexport { DEFAULT_ENTRY_NAME as _DEFAULT_ENTRY_NAME };\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ErrorFactory, ErrorMap } from '@firebase/util';\n\nexport const enum AppError {\n  NO_APP = 'no-app',\n  BAD_APP_NAME = 'bad-app-name',\n  DUPLICATE_APP = 'duplicate-app',\n  APP_DELETED = 'app-deleted',\n  SERVER_APP_DELETED = 'server-app-deleted',\n  NO_OPTIONS = 'no-options',\n  INVALID_APP_ARGUMENT = 'invalid-app-argument',\n  INVALID_LOG_ARGUMENT = 'invalid-log-argument',\n  IDB_OPEN = 'idb-open',\n  IDB_GET = 'idb-get',\n  IDB_WRITE = 'idb-set',\n  IDB_DELETE = 'idb-delete',\n  FINALIZATION_REGISTRY_NOT_SUPPORTED = 'finalization-registry-not-supported',\n  INVALID_SERVER_APP_ENVIRONMENT = 'invalid-server-app-environment'\n}\n\nconst ERRORS: ErrorMap<AppError> = {\n  [AppError.NO_APP]:\n    \"No Firebase App '{$appName}' has been created - \" +\n    'call initializeApp() first',\n  [AppError.BAD_APP_NAME]: \"Illegal App name: '{$appName}'\",\n  [AppError.DUPLICATE_APP]:\n    \"Firebase App named '{$appName}' already exists with different options or config\",\n  [AppError.APP_DELETED]: \"Firebase App named '{$appName}' already deleted\",\n  [AppError.SERVER_APP_DELETED]: 'Firebase Server App has been deleted',\n  [AppError.NO_OPTIONS]:\n    'Need to provide options, when not being deployed to hosting via source.',\n  [AppError.INVALID_APP_ARGUMENT]:\n    'firebase.{$appName}() takes either no argument or a ' +\n    'Firebase App instance.',\n  [AppError.INVALID_LOG_ARGUMENT]:\n    'First argument to `onLog` must be null or a function.',\n  [AppError.IDB_OPEN]:\n    'Error thrown when opening IndexedDB. Original error: {$originalErrorMessage}.',\n  [AppError.IDB_GET]:\n    'Error thrown when reading from IndexedDB. Original error: {$originalErrorMessage}.',\n  [AppError.IDB_WRITE]:\n    'Error thrown when writing to IndexedDB. Original error: {$originalErrorMessage}.',\n  [AppError.IDB_DELETE]:\n    'Error thrown when deleting from IndexedDB. Original error: {$originalErrorMessage}.',\n  [AppError.FINALIZATION_REGISTRY_NOT_SUPPORTED]:\n    'FirebaseServerApp deleteOnDeref field defined but the JS runtime does not support FinalizationRegistry.',\n  [AppError.INVALID_SERVER_APP_ENVIRONMENT]:\n    'FirebaseServerApp is not for use in browser environments.'\n};\n\ninterface ErrorParams {\n  [AppError.NO_APP]: { appName: string };\n  [AppError.BAD_APP_NAME]: { appName: string };\n  [AppError.DUPLICATE_APP]: { appName: string };\n  [AppError.APP_DELETED]: { appName: string };\n  [AppError.INVALID_APP_ARGUMENT]: { appName: string };\n  [AppError.IDB_OPEN]: { originalErrorMessage?: string };\n  [AppError.IDB_GET]: { originalErrorMessage?: string };\n  [AppError.IDB_WRITE]: { originalErrorMessage?: string };\n  [AppError.IDB_DELETE]: { originalErrorMessage?: string };\n  [AppError.FINALIZATION_REGISTRY_NOT_SUPPORTED]: { appName?: string };\n}\n\nexport const ERROR_FACTORY = new ErrorFactory<AppError, ErrorParams>(\n  'app',\n  'Firebase',\n  ERRORS\n);\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  FirebaseApp,\n  FirebaseOptions,\n  FirebaseAppSettings\n} from './public-types';\nimport {\n  ComponentContainer,\n  Component,\n  ComponentType\n} from '@firebase/component';\nimport { ERROR_FACTORY, AppError } from './errors';\n\nexport class FirebaseAppImpl implements FirebaseApp {\n  protected readonly _options: FirebaseOptions;\n  protected readonly _name: string;\n  /**\n   * Original config values passed in as a constructor parameter.\n   * It is only used to compare with another config object to support idempotent initializeApp().\n   *\n   * Updating automaticDataCollectionEnabled on the App instance will not change its value in _config.\n   */\n  private readonly _config: Required<FirebaseAppSettings>;\n  private _automaticDataCollectionEnabled: boolean;\n  protected _isDeleted = false;\n  private readonly _container: ComponentContainer;\n\n  constructor(\n    options: FirebaseOptions,\n    config: Required<FirebaseAppSettings>,\n    container: ComponentContainer\n  ) {\n    this._options = { ...options };\n    this._config = { ...config };\n    this._name = config.name;\n    this._automaticDataCollectionEnabled =\n      config.automaticDataCollectionEnabled;\n    this._container = container;\n    this.container.addComponent(\n      new Component('app', () => this, ComponentType.PUBLIC)\n    );\n  }\n\n  get automaticDataCollectionEnabled(): boolean {\n    this.checkDestroyed();\n    return this._automaticDataCollectionEnabled;\n  }\n\n  set automaticDataCollectionEnabled(val: boolean) {\n    this.checkDestroyed();\n    this._automaticDataCollectionEnabled = val;\n  }\n\n  get name(): string {\n    this.checkDestroyed();\n    return this._name;\n  }\n\n  get options(): FirebaseOptions {\n    this.checkDestroyed();\n    return this._options;\n  }\n\n  get config(): Required<FirebaseAppSettings> {\n    this.checkDestroyed();\n    return this._config;\n  }\n\n  get container(): ComponentContainer {\n    return this._container;\n  }\n\n  get isDeleted(): boolean {\n    return this._isDeleted;\n  }\n\n  set isDeleted(val: boolean) {\n    this._isDeleted = val;\n  }\n\n  /**\n   * This function will throw an Error if the App has already been deleted -\n   * use before performing API actions on the App.\n   */\n  protected checkDestroyed(): void {\n    if (this.isDeleted) {\n      throw ERROR_FACTORY.create(AppError.APP_DELETED, { appName: this._name });\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  FirebaseApp,\n  FirebaseServerApp,\n  FirebaseOptions,\n  FirebaseAppSettings,\n  FirebaseServerAppSettings\n} from './public-types';\nimport { DEFAULT_ENTRY_NAME, PLATFORM_LOG_STRING } from './constants';\nimport { ERROR_FACTORY, AppError } from './errors';\nimport {\n  ComponentContainer,\n  Component,\n  Name,\n  ComponentType\n} from '@firebase/component';\nimport { version } from '../../firebase/package.json';\nimport { FirebaseAppImpl } from './firebaseApp';\nimport { FirebaseServerAppImpl } from './firebaseServerApp';\nimport {\n  _apps,\n  _components,\n  _isFirebaseApp,\n  _registerComponent,\n  _serverApps\n} from './internal';\nimport { logger } from './logger';\nimport {\n  LogLevelString,\n  setLogLevel as setLogLevelImpl,\n  LogCallback,\n  LogOptions,\n  setUserLogHandler\n} from '@firebase/logger';\nimport {\n  deepEqual,\n  getDefaultAppConfig,\n  isBrowser,\n  isWebWorker\n} from '@firebase/util';\n\nexport { FirebaseError } from '@firebase/util';\n\n/**\n * The current SDK version.\n *\n * @public\n */\nexport const SDK_VERSION = version;\n\n/**\n * Creates and initializes a {@link @firebase/app#FirebaseApp} instance.\n *\n * See\n * {@link\n *   https://firebase.google.com/docs/web/setup#add_firebase_to_your_app\n *   | Add Firebase to your app} and\n * {@link\n *   https://firebase.google.com/docs/web/setup#multiple-projects\n *   | Initialize multiple projects} for detailed documentation.\n *\n * @example\n * ```javascript\n *\n * // Initialize default app\n * // Retrieve your own options values by adding a web app on\n * // https://console.firebase.google.com\n * initializeApp({\n *   apiKey: \"AIza....\",                             // Auth / General Use\n *   authDomain: \"YOUR_APP.firebaseapp.com\",         // Auth with popup/redirect\n *   databaseURL: \"https://YOUR_APP.firebaseio.com\", // Realtime Database\n *   storageBucket: \"YOUR_APP.appspot.com\",          // Storage\n *   messagingSenderId: \"123456789\"                  // Cloud Messaging\n * });\n * ```\n *\n * @example\n * ```javascript\n *\n * // Initialize another app\n * const otherApp = initializeApp({\n *   databaseURL: \"https://<OTHER_DATABASE_NAME>.firebaseio.com\",\n *   storageBucket: \"<OTHER_STORAGE_BUCKET>.appspot.com\"\n * }, \"otherApp\");\n * ```\n *\n * @param options - Options to configure the app's services.\n * @param name - Optional name of the app to initialize. If no name\n *   is provided, the default is `\"[DEFAULT]\"`.\n *\n * @returns The initialized app.\n *\n * @public\n */\nexport function initializeApp(\n  options: FirebaseOptions,\n  name?: string\n): FirebaseApp;\n/**\n * Creates and initializes a FirebaseApp instance.\n *\n * @param options - Options to configure the app's services.\n * @param config - FirebaseApp Configuration\n *\n * @public\n */\nexport function initializeApp(\n  options: FirebaseOptions,\n  config?: FirebaseAppSettings\n): FirebaseApp;\n/**\n * Creates and initializes a FirebaseApp instance.\n *\n * @public\n */\nexport function initializeApp(): FirebaseApp;\nexport function initializeApp(\n  _options?: FirebaseOptions,\n  rawConfig = {}\n): FirebaseApp {\n  let options = _options;\n\n  if (typeof rawConfig !== 'object') {\n    const name = rawConfig;\n    rawConfig = { name };\n  }\n\n  const config: Required<FirebaseAppSettings> = {\n    name: DEFAULT_ENTRY_NAME,\n    automaticDataCollectionEnabled: false,\n    ...rawConfig\n  };\n  const name = config.name;\n\n  if (typeof name !== 'string' || !name) {\n    throw ERROR_FACTORY.create(AppError.BAD_APP_NAME, {\n      appName: String(name)\n    });\n  }\n\n  options ||= getDefaultAppConfig();\n\n  if (!options) {\n    throw ERROR_FACTORY.create(AppError.NO_OPTIONS);\n  }\n\n  const existingApp = _apps.get(name) as FirebaseAppImpl;\n  if (existingApp) {\n    // return the existing app if options and config deep equal the ones in the existing app.\n    if (\n      deepEqual(options, existingApp.options) &&\n      deepEqual(config, existingApp.config)\n    ) {\n      return existingApp;\n    } else {\n      throw ERROR_FACTORY.create(AppError.DUPLICATE_APP, { appName: name });\n    }\n  }\n\n  const container = new ComponentContainer(name);\n  for (const component of _components.values()) {\n    container.addComponent(component);\n  }\n\n  const newApp = new FirebaseAppImpl(options, config, container);\n\n  _apps.set(name, newApp);\n\n  return newApp;\n}\n\n/**\n * Creates and initializes a {@link @firebase/app#FirebaseServerApp} instance.\n *\n * The `FirebaseServerApp` is similar to `FirebaseApp`, but is intended for execution in\n * server side rendering environments only. Initialization will fail if invoked from a\n * browser environment.\n *\n * See\n * {@link\n *   https://firebase.google.com/docs/web/setup#add_firebase_to_your_app\n *   | Add Firebase to your app} and\n * {@link\n *   https://firebase.google.com/docs/web/setup#multiple-projects\n *   | Initialize multiple projects} for detailed documentation.\n *\n * @example\n * ```javascript\n *\n * // Initialize an instance of `FirebaseServerApp`.\n * // Retrieve your own options values by adding a web app on\n * // https://console.firebase.google.com\n * initializeServerApp({\n *     apiKey: \"AIza....\",                             // Auth / General Use\n *     authDomain: \"YOUR_APP.firebaseapp.com\",         // Auth with popup/redirect\n *     databaseURL: \"https://YOUR_APP.firebaseio.com\", // Realtime Database\n *     storageBucket: \"YOUR_APP.appspot.com\",          // Storage\n *     messagingSenderId: \"123456789\"                  // Cloud Messaging\n *   },\n *   {\n *    authIdToken: \"Your Auth ID Token\"\n *   });\n * ```\n *\n * @param options - `Firebase.AppOptions` to configure the app's services, or a\n *   a `FirebaseApp` instance which contains the `AppOptions` within.\n * @param config - `FirebaseServerApp` configuration.\n *\n * @returns The initialized `FirebaseServerApp`.\n *\n * @public\n */\nexport function initializeServerApp(\n  options: FirebaseOptions | FirebaseApp,\n  config: FirebaseServerAppSettings\n): FirebaseServerApp;\n\nexport function initializeServerApp(\n  _options: FirebaseOptions | FirebaseApp,\n  _serverAppConfig: FirebaseServerAppSettings\n): FirebaseServerApp {\n  if (isBrowser() && !isWebWorker()) {\n    // FirebaseServerApp isn't designed to be run in browsers.\n    throw ERROR_FACTORY.create(AppError.INVALID_SERVER_APP_ENVIRONMENT);\n  }\n\n  if (_serverAppConfig.automaticDataCollectionEnabled === undefined) {\n    _serverAppConfig.automaticDataCollectionEnabled = false;\n  }\n\n  let appOptions: FirebaseOptions;\n  if (_isFirebaseApp(_options)) {\n    appOptions = _options.options;\n  } else {\n    appOptions = _options;\n  }\n\n  // Build an app name based on a hash of the configuration options.\n  const nameObj = {\n    ..._serverAppConfig,\n    ...appOptions\n  };\n\n  // However, Do not mangle the name based on releaseOnDeref, since it will vary between the\n  // construction of FirebaseServerApp instances. For example, if the object is the request headers.\n  if (nameObj.releaseOnDeref !== undefined) {\n    delete nameObj.releaseOnDeref;\n  }\n\n  const hashCode = (s: string): number => {\n    return [...s].reduce(\n      (hash, c) => (Math.imul(31, hash) + c.charCodeAt(0)) | 0,\n      0\n    );\n  };\n\n  if (_serverAppConfig.releaseOnDeref !== undefined) {\n    if (typeof FinalizationRegistry === 'undefined') {\n      throw ERROR_FACTORY.create(\n        AppError.FINALIZATION_REGISTRY_NOT_SUPPORTED,\n        {}\n      );\n    }\n  }\n\n  const nameString = '' + hashCode(JSON.stringify(nameObj));\n  const existingApp = _serverApps.get(nameString) as FirebaseServerApp;\n  if (existingApp) {\n    (existingApp as FirebaseServerAppImpl).incRefCount(\n      _serverAppConfig.releaseOnDeref\n    );\n    return existingApp;\n  }\n\n  const container = new ComponentContainer(nameString);\n  for (const component of _components.values()) {\n    container.addComponent(component);\n  }\n\n  const newApp = new FirebaseServerAppImpl(\n    appOptions,\n    _serverAppConfig,\n    nameString,\n    container\n  );\n\n  _serverApps.set(nameString, newApp);\n\n  return newApp;\n}\n\n/**\n * Retrieves a {@link @firebase/app#FirebaseApp} instance.\n *\n * When called with no arguments, the default app is returned. When an app name\n * is provided, the app corresponding to that name is returned.\n *\n * An exception is thrown if the app being retrieved has not yet been\n * initialized.\n *\n * @example\n * ```javascript\n * // Return the default app\n * const app = getApp();\n * ```\n *\n * @example\n * ```javascript\n * // Return a named app\n * const otherApp = getApp(\"otherApp\");\n * ```\n *\n * @param name - Optional name of the app to return. If no name is\n *   provided, the default is `\"[DEFAULT]\"`.\n *\n * @returns The app corresponding to the provided app name.\n *   If no app name is provided, the default app is returned.\n *\n * @public\n */\nexport function getApp(name: string = DEFAULT_ENTRY_NAME): FirebaseApp {\n  const app = _apps.get(name);\n  if (!app && name === DEFAULT_ENTRY_NAME && getDefaultAppConfig()) {\n    return initializeApp();\n  }\n  if (!app) {\n    throw ERROR_FACTORY.create(AppError.NO_APP, { appName: name });\n  }\n\n  return app;\n}\n\n/**\n * A (read-only) array of all initialized apps.\n * @public\n */\nexport function getApps(): FirebaseApp[] {\n  return Array.from(_apps.values());\n}\n\n/**\n * Renders this app unusable and frees the resources of all associated\n * services.\n *\n * @example\n * ```javascript\n * deleteApp(app)\n *   .then(function() {\n *     console.log(\"App deleted successfully\");\n *   })\n *   .catch(function(error) {\n *     console.log(\"Error deleting app:\", error);\n *   });\n * ```\n *\n * @public\n */\nexport async function deleteApp(app: FirebaseApp): Promise<void> {\n  let cleanupProviders = false;\n  const name = app.name;\n  if (_apps.has(name)) {\n    cleanupProviders = true;\n    _apps.delete(name);\n  } else if (_serverApps.has(name)) {\n    const firebaseServerApp = app as FirebaseServerAppImpl;\n    if (firebaseServerApp.decRefCount() <= 0) {\n      _serverApps.delete(name);\n      cleanupProviders = true;\n    }\n  }\n\n  if (cleanupProviders) {\n    await Promise.all(\n      (app as FirebaseAppImpl).container\n        .getProviders()\n        .map(provider => provider.delete())\n    );\n    (app as FirebaseAppImpl).isDeleted = true;\n  }\n}\n\n/**\n * Registers a library's name and version for platform logging purposes.\n * @param library - Name of 1p or 3p library (e.g. firestore, angularfire)\n * @param version - Current version of that library.\n * @param variant - Bundle variant, e.g., node, rn, etc.\n *\n * @public\n */\nexport function registerVersion(\n  libraryKeyOrName: string,\n  version: string,\n  variant?: string\n): void {\n  // TODO: We can use this check to whitelist strings when/if we set up\n  // a good whitelist system.\n  let library = PLATFORM_LOG_STRING[libraryKeyOrName] ?? libraryKeyOrName;\n  if (variant) {\n    library += `-${variant}`;\n  }\n  const libraryMismatch = library.match(/\\s|\\//);\n  const versionMismatch = version.match(/\\s|\\//);\n  if (libraryMismatch || versionMismatch) {\n    const warning = [\n      `Unable to register library \"${library}\" with version \"${version}\":`\n    ];\n    if (libraryMismatch) {\n      warning.push(\n        `library name \"${library}\" contains illegal characters (whitespace or \"/\")`\n      );\n    }\n    if (libraryMismatch && versionMismatch) {\n      warning.push('and');\n    }\n    if (versionMismatch) {\n      warning.push(\n        `version name \"${version}\" contains illegal characters (whitespace or \"/\")`\n      );\n    }\n    logger.warn(warning.join(' '));\n    return;\n  }\n  _registerComponent(\n    new Component(\n      `${library}-version` as Name,\n      () => ({ library, version }),\n      ComponentType.VERSION\n    )\n  );\n}\n\n/**\n * Sets log handler for all Firebase SDKs.\n * @param logCallback - An optional custom log handler that executes user code whenever\n * the Firebase SDK makes a logging call.\n *\n * @public\n */\nexport function onLog(\n  logCallback: LogCallback | null,\n  options?: LogOptions\n): void {\n  if (logCallback !== null && typeof logCallback !== 'function') {\n    throw ERROR_FACTORY.create(AppError.INVALID_LOG_ARGUMENT);\n  }\n  setUserLogHandler(logCallback, options);\n}\n\n/**\n * Sets log level for all Firebase SDKs.\n *\n * All of the log types above the current log level are captured (i.e. if\n * you set the log level to `info`, errors are logged, but `debug` and\n * `verbose` logs are not).\n *\n * @public\n */\nexport function setLogLevel(logLevel: LogLevelString): void {\n  setLogLevelImpl(logLevel);\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseError } from '@firebase/util';\nimport { DBSchema, openDB, IDBPDatabase } from 'idb';\nimport { AppError, ERROR_FACTORY } from './errors';\nimport { FirebaseApp } from './public-types';\nimport { HeartbeatsInIndexedDB } from './types';\nimport { logger } from './logger';\n\nconst DB_NAME = 'firebase-heartbeat-database';\nconst DB_VERSION = 1;\nconst STORE_NAME = 'firebase-heartbeat-store';\n\ninterface AppDB extends DBSchema {\n  'firebase-heartbeat-store': {\n    key: string;\n    value: HeartbeatsInIndexedDB;\n  };\n}\n\nlet dbPromise: Promise<IDBPDatabase<AppDB>> | null = null;\nfunction getDbPromise(): Promise<IDBPDatabase<AppDB>> {\n  if (!dbPromise) {\n    dbPromise = openDB<AppDB>(DB_NAME, DB_VERSION, {\n      upgrade: (db, oldVersion) => {\n        // We don't use 'break' in this switch statement, the fall-through\n        // behavior is what we want, because if there are multiple versions between\n        // the old version and the current version, we want ALL the migrations\n        // that correspond to those versions to run, not only the last one.\n        // eslint-disable-next-line default-case\n        switch (oldVersion) {\n          case 0:\n            try {\n              db.createObjectStore(STORE_NAME);\n            } catch (e) {\n              // Safari/iOS browsers throw occasional exceptions on\n              // db.createObjectStore() that may be a bug. Avoid blocking\n              // the rest of the app functionality.\n              console.warn(e);\n            }\n        }\n      }\n    }).catch(e => {\n      throw ERROR_FACTORY.create(AppError.IDB_OPEN, {\n        originalErrorMessage: e.message\n      });\n    });\n  }\n  return dbPromise;\n}\n\nexport async function readHeartbeatsFromIndexedDB(\n  app: FirebaseApp\n): Promise<HeartbeatsInIndexedDB | undefined> {\n  try {\n    const db = await getDbPromise();\n    const tx = db.transaction(STORE_NAME);\n    const result = await tx.objectStore(STORE_NAME).get(computeKey(app));\n    // We already have the value but tx.done can throw,\n    // so we need to await it here to catch errors\n    await tx.done;\n    return result;\n  } catch (e) {\n    if (e instanceof FirebaseError) {\n      logger.warn(e.message);\n    } else {\n      const idbGetError = ERROR_FACTORY.create(AppError.IDB_GET, {\n        originalErrorMessage: (e as Error)?.message\n      });\n      logger.warn(idbGetError.message);\n    }\n  }\n}\n\nexport async function writeHeartbeatsToIndexedDB(\n  app: FirebaseApp,\n  heartbeatObject: HeartbeatsInIndexedDB\n): Promise<void> {\n  try {\n    const db = await getDbPromise();\n    const tx = db.transaction(STORE_NAME, 'readwrite');\n    const objectStore = tx.objectStore(STORE_NAME);\n    await objectStore.put(heartbeatObject, computeKey(app));\n    await tx.done;\n  } catch (e) {\n    if (e instanceof FirebaseError) {\n      logger.warn(e.message);\n    } else {\n      const idbGetError = ERROR_FACTORY.create(AppError.IDB_WRITE, {\n        originalErrorMessage: (e as Error)?.message\n      });\n      logger.warn(idbGetError.message);\n    }\n  }\n}\n\nfunction computeKey(app: FirebaseApp): string {\n  return `${app.name}!${app.options.appId}`;\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ComponentContainer } from '@firebase/component';\nimport {\n  base64urlEncodeWithoutPadding,\n  isIndexedDBAvailable,\n  validateIndexedDBOpenable\n} from '@firebase/util';\nimport {\n  readHeartbeatsFromIndexedDB,\n  writeHeartbeatsToIndexedDB\n} from './indexeddb';\nimport { FirebaseApp } from './public-types';\nimport {\n  HeartbeatsByUserAgent,\n  HeartbeatService,\n  HeartbeatsInIndexedDB,\n  HeartbeatStorage,\n  SingleDateHeartbeat\n} from './types';\nimport { logger } from './logger';\n\nconst MAX_HEADER_BYTES = 1024;\n// 30 days\nconst STORED_HEARTBEAT_RETENTION_MAX_MILLIS = 30 * 24 * 60 * 60 * 1000;\n\nexport class HeartbeatServiceImpl implements HeartbeatService {\n  /**\n   * The persistence layer for heartbeats\n   * Leave public for easier testing.\n   */\n  _storage: HeartbeatStorageImpl;\n\n  /**\n   * In-memory cache for heartbeats, used by getHeartbeatsHeader() to generate\n   * the header string.\n   * Stores one record per date. This will be consolidated into the standard\n   * format of one record per user agent string before being sent as a header.\n   * Populated from indexedDB when the controller is instantiated and should\n   * be kept in sync with indexedDB.\n   * Leave public for easier testing.\n   */\n  _heartbeatsCache: HeartbeatsInIndexedDB | null = null;\n\n  /**\n   * the initialization promise for populating heartbeatCache.\n   * If getHeartbeatsHeader() is called before the promise resolves\n   * (heartbeatsCache == null), it should wait for this promise\n   * Leave public for easier testing.\n   */\n  _heartbeatsCachePromise: Promise<HeartbeatsInIndexedDB>;\n  constructor(private readonly container: ComponentContainer) {\n    const app = this.container.getProvider('app').getImmediate();\n    this._storage = new HeartbeatStorageImpl(app);\n    this._heartbeatsCachePromise = this._storage.read().then(result => {\n      this._heartbeatsCache = result;\n      return result;\n    });\n  }\n\n  /**\n   * Called to report a heartbeat. The function will generate\n   * a HeartbeatsByUserAgent object, update heartbeatsCache, and persist it\n   * to IndexedDB.\n   * Note that we only store one heartbeat per day. So if a heartbeat for today is\n   * already logged, subsequent calls to this function in the same day will be ignored.\n   */\n  async triggerHeartbeat(): Promise<void> {\n    try {\n      const platformLogger = this.container\n        .getProvider('platform-logger')\n        .getImmediate();\n\n      // This is the \"Firebase user agent\" string from the platform logger\n      // service, not the browser user agent.\n      const agent = platformLogger.getPlatformInfoString();\n      const date = getUTCDateString();\n      if (this._heartbeatsCache?.heartbeats == null) {\n        this._heartbeatsCache = await this._heartbeatsCachePromise;\n        // If we failed to construct a heartbeats cache, then return immediately.\n        if (this._heartbeatsCache?.heartbeats == null) {\n          return;\n        }\n      }\n      // Do not store a heartbeat if one is already stored for this day\n      // or if a header has already been sent today.\n      if (\n        this._heartbeatsCache.lastSentHeartbeatDate === date ||\n        this._heartbeatsCache.heartbeats.some(\n          singleDateHeartbeat => singleDateHeartbeat.date === date\n        )\n      ) {\n        return;\n      } else {\n        // There is no entry for this date. Create one.\n        this._heartbeatsCache.heartbeats.push({ date, agent });\n      }\n      // Remove entries older than 30 days.\n      this._heartbeatsCache.heartbeats =\n        this._heartbeatsCache.heartbeats.filter(singleDateHeartbeat => {\n          const hbTimestamp = new Date(singleDateHeartbeat.date).valueOf();\n          const now = Date.now();\n          return now - hbTimestamp <= STORED_HEARTBEAT_RETENTION_MAX_MILLIS;\n        });\n      return this._storage.overwrite(this._heartbeatsCache);\n    } catch (e) {\n      logger.warn(e);\n    }\n  }\n\n  /**\n   * Returns a base64 encoded string which can be attached to the heartbeat-specific header directly.\n   * It also clears all heartbeats from memory as well as in IndexedDB.\n   *\n   * NOTE: Consuming product SDKs should not send the header if this method\n   * returns an empty string.\n   */\n  async getHeartbeatsHeader(): Promise<string> {\n    try {\n      if (this._heartbeatsCache === null) {\n        await this._heartbeatsCachePromise;\n      }\n      // If it's still null or the array is empty, there is no data to send.\n      if (\n        this._heartbeatsCache?.heartbeats == null ||\n        this._heartbeatsCache.heartbeats.length === 0\n      ) {\n        return '';\n      }\n      const date = getUTCDateString();\n      // Extract as many heartbeats from the cache as will fit under the size limit.\n      const { heartbeatsToSend, unsentEntries } = extractHeartbeatsForHeader(\n        this._heartbeatsCache.heartbeats\n      );\n      const headerString = base64urlEncodeWithoutPadding(\n        JSON.stringify({ version: 2, heartbeats: heartbeatsToSend })\n      );\n      // Store last sent date to prevent another being logged/sent for the same day.\n      this._heartbeatsCache.lastSentHeartbeatDate = date;\n      if (unsentEntries.length > 0) {\n        // Store any unsent entries if they exist.\n        this._heartbeatsCache.heartbeats = unsentEntries;\n        // This seems more likely than emptying the array (below) to lead to some odd state\n        // since the cache isn't empty and this will be called again on the next request,\n        // and is probably safest if we await it.\n        await this._storage.overwrite(this._heartbeatsCache);\n      } else {\n        this._heartbeatsCache.heartbeats = [];\n        // Do not wait for this, to reduce latency.\n        void this._storage.overwrite(this._heartbeatsCache);\n      }\n      return headerString;\n    } catch (e) {\n      logger.warn(e);\n      return '';\n    }\n  }\n}\n\nfunction getUTCDateString(): string {\n  const today = new Date();\n  // Returns date format 'YYYY-MM-DD'\n  return today.toISOString().substring(0, 10);\n}\n\nexport function extractHeartbeatsForHeader(\n  heartbeatsCache: SingleDateHeartbeat[],\n  maxSize = MAX_HEADER_BYTES\n): {\n  heartbeatsToSend: HeartbeatsByUserAgent[];\n  unsentEntries: SingleDateHeartbeat[];\n} {\n  // Heartbeats grouped by user agent in the standard format to be sent in\n  // the header.\n  const heartbeatsToSend: HeartbeatsByUserAgent[] = [];\n  // Single date format heartbeats that are not sent.\n  let unsentEntries = heartbeatsCache.slice();\n  for (const singleDateHeartbeat of heartbeatsCache) {\n    // Look for an existing entry with the same user agent.\n    const heartbeatEntry = heartbeatsToSend.find(\n      hb => hb.agent === singleDateHeartbeat.agent\n    );\n    if (!heartbeatEntry) {\n      // If no entry for this user agent exists, create one.\n      heartbeatsToSend.push({\n        agent: singleDateHeartbeat.agent,\n        dates: [singleDateHeartbeat.date]\n      });\n      if (countBytes(heartbeatsToSend) > maxSize) {\n        // If the header would exceed max size, remove the added heartbeat\n        // entry and stop adding to the header.\n        heartbeatsToSend.pop();\n        break;\n      }\n    } else {\n      heartbeatEntry.dates.push(singleDateHeartbeat.date);\n      // If the header would exceed max size, remove the added date\n      // and stop adding to the header.\n      if (countBytes(heartbeatsToSend) > maxSize) {\n        heartbeatEntry.dates.pop();\n        break;\n      }\n    }\n    // Pop unsent entry from queue. (Skipped if adding the entry exceeded\n    // quota and the loop breaks early.)\n    unsentEntries = unsentEntries.slice(1);\n  }\n  return {\n    heartbeatsToSend,\n    unsentEntries\n  };\n}\n\nexport class HeartbeatStorageImpl implements HeartbeatStorage {\n  private _canUseIndexedDBPromise: Promise<boolean>;\n  constructor(public app: FirebaseApp) {\n    this._canUseIndexedDBPromise = this.runIndexedDBEnvironmentCheck();\n  }\n  async runIndexedDBEnvironmentCheck(): Promise<boolean> {\n    if (!isIndexedDBAvailable()) {\n      return false;\n    } else {\n      return validateIndexedDBOpenable()\n        .then(() => true)\n        .catch(() => false);\n    }\n  }\n  /**\n   * Read all heartbeats.\n   */\n  async read(): Promise<HeartbeatsInIndexedDB> {\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return { heartbeats: [] };\n    } else {\n      const idbHeartbeatObject = await readHeartbeatsFromIndexedDB(this.app);\n      if (idbHeartbeatObject?.heartbeats) {\n        return idbHeartbeatObject;\n      } else {\n        return { heartbeats: [] };\n      }\n    }\n  }\n  // overwrite the storage with the provided heartbeats\n  async overwrite(heartbeatsObject: HeartbeatsInIndexedDB): Promise<void> {\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return;\n    } else {\n      const existingHeartbeatsObject = await this.read();\n      return writeHeartbeatsToIndexedDB(this.app, {\n        lastSentHeartbeatDate:\n          heartbeatsObject.lastSentHeartbeatDate ??\n          existingHeartbeatsObject.lastSentHeartbeatDate,\n        heartbeats: heartbeatsObject.heartbeats\n      });\n    }\n  }\n  // add heartbeats\n  async add(heartbeatsObject: HeartbeatsInIndexedDB): Promise<void> {\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return;\n    } else {\n      const existingHeartbeatsObject = await this.read();\n      return writeHeartbeatsToIndexedDB(this.app, {\n        lastSentHeartbeatDate:\n          heartbeatsObject.lastSentHeartbeatDate ??\n          existingHeartbeatsObject.lastSentHeartbeatDate,\n        heartbeats: [\n          ...existingHeartbeatsObject.heartbeats,\n          ...heartbeatsObject.heartbeats\n        ]\n      });\n    }\n  }\n}\n\n/**\n * Calculate bytes of a HeartbeatsByUserAgent array after being wrapped\n * in a platform logging header JSON object, stringified, and converted\n * to base 64.\n */\nexport function countBytes(heartbeatsCache: HeartbeatsByUserAgent[]): number {\n  // base64 has a restricted set of characters, all of which should be 1 byte.\n  return base64urlEncodeWithoutPadding(\n    // heartbeatsCache wrapper properties\n    JSON.stringify({ version: 2, heartbeats: heartbeatsCache })\n  ).length;\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Component, ComponentType } from '@firebase/component';\nimport { PlatformLoggerServiceImpl } from './platformLoggerService';\nimport { name, version } from '../package.json';\nimport { _registerComponent } from './internal';\nimport { registerVersion } from './api';\nimport { HeartbeatServiceImpl } from './heartbeatService';\n\nexport function registerCoreComponents(variant?: string): void {\n  _registerComponent(\n    new Component(\n      'platform-logger',\n      container => new PlatformLoggerServiceImpl(container),\n      ComponentType.PRIVATE\n    )\n  );\n  _registerComponent(\n    new Component(\n      'heartbeat',\n      container => new HeartbeatServiceImpl(container),\n      ComponentType.PRIVATE\n    )\n  );\n\n  // Register `app` package.\n  registerVersion(name, version, variant);\n  // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation\n  registerVersion(name, version, '__BUILD_TARGET__');\n  // Register platform SDK identifier (no version).\n  registerVersion('fire-js', '');\n}\n","/**\n * Firebase App\n *\n * @remarks This package coordinates the communication between the different Firebase components\n * @packageDocumentation\n */\n\n/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { registerCoreComponents } from './registerCoreComponents';\n\nexport * from './api';\nexport * from './internal';\nexport * from './public-types';\n\nregisterCoreComponents('__RUNTIME_ENV__');\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport {\n  InstantiationMode,\n  InstanceFactory,\n  ComponentType,\n  Dictionary,\n  Name,\n  onInstanceCreatedCallback\n} from './types';\n\n/**\n * Component for service name T, e.g. `auth`, `auth-internal`\n */\nexport class Component<T extends Name = Name> {\n  multipleInstances = false;\n  /**\n   * Properties to be added to the service namespace\n   */\n  serviceProps: Dictionary = {};\n\n  instantiationMode = InstantiationMode.LAZY;\n\n  onInstanceCreated: onInstanceCreatedCallback<T> | null = null;\n\n  /**\n   *\n   * @param name The public service name, e.g. app, auth, firestore, database\n   * @param instanceFactory Service factory responsible for creating the public interface\n   * @param type whether the service provided by the component is public or private\n   */\n  constructor(\n    readonly name: T,\n    readonly instanceFactory: InstanceFactory<T>,\n    readonly type: ComponentType\n  ) {}\n\n  setInstantiationMode(mode: InstantiationMode): this {\n    this.instantiationMode = mode;\n    return this;\n  }\n\n  setMultipleInstances(multipleInstances: boolean): this {\n    this.multipleInstances = multipleInstances;\n    return this;\n  }\n\n  setServiceProps(props: Dictionary): this {\n    this.serviceProps = props;\n    return this;\n  }\n\n  setInstanceCreatedCallback(callback: onInstanceCreatedCallback<T>): this {\n    this.onInstanceCreated = callback;\n    return this;\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Deferred } from '@firebase/util';\nimport { ComponentContainer } from './component_container';\nimport { DEFAULT_ENTRY_NAME } from './constants';\nimport {\n  InitializeOptions,\n  InstantiationMode,\n  Name,\n  NameServiceMapping,\n  OnInitCallBack\n} from './types';\nimport { Component } from './component';\n\n/**\n * Provider for instance for service name T, e.g. 'auth', 'auth-internal'\n * NameServiceMapping[T] is an alias for the type of the instance\n */\nexport class Provider<T extends Name> {\n  private component: Component<T> | null = null;\n  private readonly instances: Map<string, NameServiceMapping[T]> = new Map();\n  private readonly instancesDeferred: Map<\n    string,\n    Deferred<NameServiceMapping[T]>\n  > = new Map();\n  private readonly instancesOptions: Map<string, Record<string, unknown>> =\n    new Map();\n  private onInitCallbacks: Map<string, Set<OnInitCallBack<T>>> = new Map();\n\n  constructor(\n    private readonly name: T,\n    private readonly container: ComponentContainer\n  ) {}\n\n  /**\n   * @param identifier A provider can provide multiple instances of a service\n   * if this.component.multipleInstances is true.\n   */\n  get(identifier?: string): Promise<NameServiceMapping[T]> {\n    // if multipleInstances is not supported, use the default name\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(identifier);\n\n    if (!this.instancesDeferred.has(normalizedIdentifier)) {\n      const deferred = new Deferred<NameServiceMapping[T]>();\n      this.instancesDeferred.set(normalizedIdentifier, deferred);\n\n      if (\n        this.isInitialized(normalizedIdentifier) ||\n        this.shouldAutoInitialize()\n      ) {\n        // initialize the service if it can be auto-initialized\n        try {\n          const instance = this.getOrInitializeService({\n            instanceIdentifier: normalizedIdentifier\n          });\n          if (instance) {\n            deferred.resolve(instance);\n          }\n        } catch (e) {\n          // when the instance factory throws an exception during get(), it should not cause\n          // a fatal error. We just return the unresolved promise in this case.\n        }\n      }\n    }\n\n    return this.instancesDeferred.get(normalizedIdentifier)!.promise;\n  }\n\n  /**\n   *\n   * @param options.identifier A provider can provide multiple instances of a service\n   * if this.component.multipleInstances is true.\n   * @param options.optional If optional is false or not provided, the method throws an error when\n   * the service is not immediately available.\n   * If optional is true, the method returns null if the service is not immediately available.\n   */\n  getImmediate(options: {\n    identifier?: string;\n    optional: true;\n  }): NameServiceMapping[T] | null;\n  getImmediate(options?: {\n    identifier?: string;\n    optional?: false;\n  }): NameServiceMapping[T];\n  getImmediate(options?: {\n    identifier?: string;\n    optional?: boolean;\n  }): NameServiceMapping[T] | null {\n    // if multipleInstances is not supported, use the default name\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(\n      options?.identifier\n    );\n    const optional = options?.optional ?? false;\n\n    if (\n      this.isInitialized(normalizedIdentifier) ||\n      this.shouldAutoInitialize()\n    ) {\n      try {\n        return this.getOrInitializeService({\n          instanceIdentifier: normalizedIdentifier\n        });\n      } catch (e) {\n        if (optional) {\n          return null;\n        } else {\n          throw e;\n        }\n      }\n    } else {\n      // In case a component is not initialized and should/cannot be auto-initialized at the moment, return null if the optional flag is set, or throw\n      if (optional) {\n        return null;\n      } else {\n        throw Error(`Service ${this.name} is not available`);\n      }\n    }\n  }\n\n  getComponent(): Component<T> | null {\n    return this.component;\n  }\n\n  setComponent(component: Component<T>): void {\n    if (component.name !== this.name) {\n      throw Error(\n        `Mismatching Component ${component.name} for Provider ${this.name}.`\n      );\n    }\n\n    if (this.component) {\n      throw Error(`Component for ${this.name} has already been provided`);\n    }\n\n    this.component = component;\n\n    // return early without attempting to initialize the component if the component requires explicit initialization (calling `Provider.initialize()`)\n    if (!this.shouldAutoInitialize()) {\n      return;\n    }\n\n    // if the service is eager, initialize the default instance\n    if (isComponentEager(component)) {\n      try {\n        this.getOrInitializeService({ instanceIdentifier: DEFAULT_ENTRY_NAME });\n      } catch (e) {\n        // when the instance factory for an eager Component throws an exception during the eager\n        // initialization, it should not cause a fatal error.\n        // TODO: Investigate if we need to make it configurable, because some component may want to cause\n        // a fatal error in this case?\n      }\n    }\n\n    // Create service instances for the pending promises and resolve them\n    // NOTE: if this.multipleInstances is false, only the default instance will be created\n    // and all promises with resolve with it regardless of the identifier.\n    for (const [\n      instanceIdentifier,\n      instanceDeferred\n    ] of this.instancesDeferred.entries()) {\n      const normalizedIdentifier =\n        this.normalizeInstanceIdentifier(instanceIdentifier);\n\n      try {\n        // `getOrInitializeService()` should always return a valid instance since a component is guaranteed. use ! to make typescript happy.\n        const instance = this.getOrInitializeService({\n          instanceIdentifier: normalizedIdentifier\n        })!;\n        instanceDeferred.resolve(instance);\n      } catch (e) {\n        // when the instance factory throws an exception, it should not cause\n        // a fatal error. We just leave the promise unresolved.\n      }\n    }\n  }\n\n  clearInstance(identifier: string = DEFAULT_ENTRY_NAME): void {\n    this.instancesDeferred.delete(identifier);\n    this.instancesOptions.delete(identifier);\n    this.instances.delete(identifier);\n  }\n\n  // app.delete() will call this method on every provider to delete the services\n  // TODO: should we mark the provider as deleted?\n  async delete(): Promise<void> {\n    const services = Array.from(this.instances.values());\n\n    await Promise.all([\n      ...services\n        .filter(service => 'INTERNAL' in service) // legacy services\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        .map(service => (service as any).INTERNAL!.delete()),\n      ...services\n        .filter(service => '_delete' in service) // modularized services\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        .map(service => (service as any)._delete())\n    ]);\n  }\n\n  isComponentSet(): boolean {\n    return this.component != null;\n  }\n\n  isInitialized(identifier: string = DEFAULT_ENTRY_NAME): boolean {\n    return this.instances.has(identifier);\n  }\n\n  getOptions(identifier: string = DEFAULT_ENTRY_NAME): Record<string, unknown> {\n    return this.instancesOptions.get(identifier) || {};\n  }\n\n  initialize(opts: InitializeOptions = {}): NameServiceMapping[T] {\n    const { options = {} } = opts;\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(\n      opts.instanceIdentifier\n    );\n    if (this.isInitialized(normalizedIdentifier)) {\n      throw Error(\n        `${this.name}(${normalizedIdentifier}) has already been initialized`\n      );\n    }\n\n    if (!this.isComponentSet()) {\n      throw Error(`Component ${this.name} has not been registered yet`);\n    }\n\n    const instance = this.getOrInitializeService({\n      instanceIdentifier: normalizedIdentifier,\n      options\n    })!;\n\n    // resolve any pending promise waiting for the service instance\n    for (const [\n      instanceIdentifier,\n      instanceDeferred\n    ] of this.instancesDeferred.entries()) {\n      const normalizedDeferredIdentifier =\n        this.normalizeInstanceIdentifier(instanceIdentifier);\n      if (normalizedIdentifier === normalizedDeferredIdentifier) {\n        instanceDeferred.resolve(instance);\n      }\n    }\n\n    return instance;\n  }\n\n  /**\n   *\n   * @param callback - a function that will be invoked  after the provider has been initialized by calling provider.initialize().\n   * The function is invoked SYNCHRONOUSLY, so it should not execute any longrunning tasks in order to not block the program.\n   *\n   * @param identifier An optional instance identifier\n   * @returns a function to unregister the callback\n   */\n  onInit(callback: OnInitCallBack<T>, identifier?: string): () => void {\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(identifier);\n    const existingCallbacks =\n      this.onInitCallbacks.get(normalizedIdentifier) ??\n      new Set<OnInitCallBack<T>>();\n    existingCallbacks.add(callback);\n    this.onInitCallbacks.set(normalizedIdentifier, existingCallbacks);\n\n    const existingInstance = this.instances.get(normalizedIdentifier);\n    if (existingInstance) {\n      callback(existingInstance, normalizedIdentifier);\n    }\n\n    return () => {\n      existingCallbacks.delete(callback);\n    };\n  }\n\n  /**\n   * Invoke onInit callbacks synchronously\n   * @param instance the service instance`\n   */\n  private invokeOnInitCallbacks(\n    instance: NameServiceMapping[T],\n    identifier: string\n  ): void {\n    const callbacks = this.onInitCallbacks.get(identifier);\n    if (!callbacks) {\n      return;\n    }\n    for (const callback of callbacks) {\n      try {\n        callback(instance, identifier);\n      } catch {\n        // ignore errors in the onInit callback\n      }\n    }\n  }\n\n  private getOrInitializeService({\n    instanceIdentifier,\n    options = {}\n  }: {\n    instanceIdentifier: string;\n    options?: Record<string, unknown>;\n  }): NameServiceMapping[T] | null {\n    let instance = this.instances.get(instanceIdentifier);\n    if (!instance && this.component) {\n      instance = this.component.instanceFactory(this.container, {\n        instanceIdentifier: normalizeIdentifierForFactory(instanceIdentifier),\n        options\n      });\n      this.instances.set(instanceIdentifier, instance);\n      this.instancesOptions.set(instanceIdentifier, options);\n\n      /**\n       * Invoke onInit listeners.\n       * Note this.component.onInstanceCreated is different, which is used by the component creator,\n       * while onInit listeners are registered by consumers of the provider.\n       */\n      this.invokeOnInitCallbacks(instance, instanceIdentifier);\n\n      /**\n       * Order is important\n       * onInstanceCreated() should be called after this.instances.set(instanceIdentifier, instance); which\n       * makes `isInitialized()` return true.\n       */\n      if (this.component.onInstanceCreated) {\n        try {\n          this.component.onInstanceCreated(\n            this.container,\n            instanceIdentifier,\n            instance\n          );\n        } catch {\n          // ignore errors in the onInstanceCreatedCallback\n        }\n      }\n    }\n\n    return instance || null;\n  }\n\n  private normalizeInstanceIdentifier(\n    identifier: string = DEFAULT_ENTRY_NAME\n  ): string {\n    if (this.component) {\n      return this.component.multipleInstances ? identifier : DEFAULT_ENTRY_NAME;\n    } else {\n      return identifier; // assume multiple instances are supported before the component is provided.\n    }\n  }\n\n  private shouldAutoInitialize(): boolean {\n    return (\n      !!this.component &&\n      this.component.instantiationMode !== InstantiationMode.EXPLICIT\n    );\n  }\n}\n\n// undefined should be passed to the service factory for the default instance\nfunction normalizeIdentifierForFactory(identifier: string): string | undefined {\n  return identifier === DEFAULT_ENTRY_NAME ? undefined : identifier;\n}\n\nfunction isComponentEager<T extends Name>(component: Component<T>): boolean {\n  return component.instantiationMode === InstantiationMode.EAGER;\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Provider } from './provider';\nimport { Component } from './component';\nimport { Name } from './types';\n\n/**\n * ComponentContainer that provides Providers for service name T, e.g. `auth`, `auth-internal`\n */\nexport class ComponentContainer {\n  private readonly providers = new Map<string, Provider<Name>>();\n\n  constructor(private readonly name: string) {}\n\n  /**\n   *\n   * @param component Component being added\n   * @param overwrite When a component with the same name has already been registered,\n   * if overwrite is true: overwrite the existing component with the new component and create a new\n   * provider with the new component. It can be useful in tests where you want to use different mocks\n   * for different tests.\n   * if overwrite is false: throw an exception\n   */\n  addComponent<T extends Name>(component: Component<T>): void {\n    const provider = this.getProvider(component.name);\n    if (provider.isComponentSet()) {\n      throw new Error(\n        `Component ${component.name} has already been registered with ${this.name}`\n      );\n    }\n\n    provider.setComponent(component);\n  }\n\n  addOrOverwriteComponent<T extends Name>(component: Component<T>): void {\n    const provider = this.getProvider(component.name);\n    if (provider.isComponentSet()) {\n      // delete the existing provider from the container, so we can register the new component\n      this.providers.delete(component.name);\n    }\n\n    this.addComponent(component);\n  }\n\n  /**\n   * getProvider provides a type safe interface where it can only be called with a field name\n   * present in NameServiceMapping interface.\n   *\n   * Firebase SDKs providing services should extend NameServiceMapping interface to register\n   * themselves.\n   */\n  getProvider<T extends Name>(name: T): Provider<T> {\n    if (this.providers.has(name)) {\n      return this.providers.get(name) as unknown as Provider<T>;\n    }\n\n    // create a Provider for a service that hasn't registered with Firebase\n    const provider = new Provider<T>(name, this);\n    this.providers.set(name, provider as unknown as Provider<Name>);\n\n    return provider as Provider<T>;\n  }\n\n  getProviders(): Array<Provider<Name>> {\n    return Array.from(this.providers.values());\n  }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport { registerVersion } from '@firebase/app';\nimport { name, version } from '../package.json';\n\nregisterVersion(name, version, 'app');\nexport * from '@firebase/app';\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** The semver (www.semver.org) version of the SDK. */\nexport let SDK_VERSION = '';\n\n/**\n * SDK_VERSION should be set before any database instance is created\n * @internal\n */\nexport function setSDKVersion(version: string): void {\n  SDK_VERSION = version;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { jsonEval, stringify } from '@firebase/util';\n\n/**\n * Wraps a DOM Storage object and:\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\n *\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\n * and one for localStorage.\n *\n */\nexport class DOMStorageWrapper {\n  // Use a prefix to avoid collisions with other stuff saved by the app.\n  private prefix_ = 'firebase:';\n\n  /**\n   * @param domStorage_ - The underlying storage object (e.g. localStorage or sessionStorage)\n   */\n  constructor(private domStorage_: Storage) {}\n\n  /**\n   * @param key - The key to save the value under\n   * @param value - The value being stored, or null to remove the key.\n   */\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      this.domStorage_.removeItem(this.prefixedName_(key));\n    } else {\n      this.domStorage_.setItem(this.prefixedName_(key), stringify(value));\n    }\n  }\n\n  /**\n   * @returns The value that was stored under this key, or null\n   */\n  get(key: string): unknown {\n    const storedVal = this.domStorage_.getItem(this.prefixedName_(key));\n    if (storedVal == null) {\n      return null;\n    } else {\n      return jsonEval(storedVal);\n    }\n  }\n\n  remove(key: string) {\n    this.domStorage_.removeItem(this.prefixedName_(key));\n  }\n\n  isInMemoryStorage: boolean;\n\n  prefixedName_(name: string): string {\n    return this.prefix_ + name;\n  }\n\n  toString(): string {\n    return this.domStorage_.toString();\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains } from '@firebase/util';\n\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n */\nexport class MemoryStorage {\n  private cache_: { [k: string]: unknown } = {};\n\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      delete this.cache_[key];\n    } else {\n      this.cache_[key] = value;\n    }\n  }\n\n  get(key: string): unknown {\n    if (contains(this.cache_, key)) {\n      return this.cache_[key];\n    }\n    return null;\n  }\n\n  remove(key: string) {\n    delete this.cache_[key];\n  }\n\n  isInMemoryStorage = true;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DOMStorageWrapper } from './DOMStorageWrapper';\nimport { MemoryStorage } from './MemoryStorage';\n\ndeclare const window: Window;\n\n/**\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\n * to reflect this type\n *\n * @param domStorageName - Name of the underlying storage object\n *   (e.g. 'localStorage' or 'sessionStorage').\n * @returns Turning off type information until a common interface is defined.\n */\nconst createStoragefor = function (\n  domStorageName: string\n): DOMStorageWrapper | MemoryStorage {\n  try {\n    // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\n    // so it must be inside the try/catch.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window[domStorageName] !== 'undefined'\n    ) {\n      // Need to test cache. Just because it's here doesn't mean it works\n      const domStorage = window[domStorageName];\n      domStorage.setItem('firebase:sentinel', 'cache');\n      domStorage.removeItem('firebase:sentinel');\n      return new DOMStorageWrapper(domStorage);\n    }\n  } catch (e) {}\n\n  // Failed to create wrapper.  Just return in-memory storage.\n  // TODO: log?\n  return new MemoryStorage();\n};\n\n/** A storage object that lasts across sessions */\nexport const PersistentStorage = createStoragefor('localStorage');\n\n/** A storage object that only lasts one session */\nexport const SessionStorage = createStoragefor('sessionStorage');\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Logger, LogLevel } from '@firebase/logger';\nimport {\n  assert,\n  base64,\n  Sha1,\n  stringToByteArray,\n  stringify,\n  isNodeSdk\n} from '@firebase/util';\n\nimport { SessionStorage } from '../storage/storage';\nimport { QueryContext } from '../view/EventRegistration';\n\ndeclare const window: Window;\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const Windows: any;\n\nconst logClient = new Logger('@firebase/database');\n\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n */\nexport const LUIDGenerator: () => number = (function () {\n  let id = 1;\n  return function () {\n    return id++;\n  };\n})();\n\n/**\n * Sha1 hash of the input string\n * @param str - The string to hash\n * @returns {!string} The resulting hash\n */\nexport const sha1 = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  const sha1 = new Sha1();\n  sha1.update(utf8Bytes);\n  const sha1Bytes = sha1.digest();\n  return base64.encodeByteArray(sha1Bytes);\n};\n\nconst buildLogMessage_ = function (...varArgs: unknown[]): string {\n  let message = '';\n  for (let i = 0; i < varArgs.length; i++) {\n    const arg = varArgs[i];\n    if (\n      Array.isArray(arg) ||\n      (arg &&\n        typeof arg === 'object' &&\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        typeof (arg as any).length === 'number')\n    ) {\n      message += buildLogMessage_.apply(null, arg);\n    } else if (typeof arg === 'object') {\n      message += stringify(arg);\n    } else {\n      message += arg;\n    }\n    message += ' ';\n  }\n\n  return message;\n};\n\n/**\n * Use this for all debug messages in Firebase.\n */\nexport let logger: ((a: string) => void) | null = null;\n\n/**\n * Flag to check for log availability on first log message\n */\nlet firstLog_ = true;\n\n/**\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\n * @param logger_ - A flag to turn on logging, or a custom logger\n * @param persistent - Whether or not to persist logging settings across refreshes\n */\nexport const enableLogging = function (\n  logger_?: boolean | ((a: string) => void) | null,\n  persistent?: boolean\n) {\n  assert(\n    !persistent || logger_ === true || logger_ === false,\n    \"Can't turn on custom loggers persistently.\"\n  );\n  if (logger_ === true) {\n    logClient.logLevel = LogLevel.VERBOSE;\n    logger = logClient.log.bind(logClient);\n    if (persistent) {\n      SessionStorage.set('logging_enabled', true);\n    }\n  } else if (typeof logger_ === 'function') {\n    logger = logger_;\n  } else {\n    logger = null;\n    SessionStorage.remove('logging_enabled');\n  }\n};\n\nexport const log = function (...varArgs: unknown[]) {\n  if (firstLog_ === true) {\n    firstLog_ = false;\n    if (logger === null && SessionStorage.get('logging_enabled') === true) {\n      enableLogging(true);\n    }\n  }\n\n  if (logger) {\n    const message = buildLogMessage_.apply(null, varArgs);\n    logger(message);\n  }\n};\n\nexport const logWrapper = function (\n  prefix: string\n): (...varArgs: unknown[]) => void {\n  return function (...varArgs: unknown[]) {\n    log(prefix, ...varArgs);\n  };\n};\n\nexport const error = function (...varArgs: string[]) {\n  const message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_(...varArgs);\n  logClient.error(message);\n};\n\nexport const fatal = function (...varArgs: string[]) {\n  const message = `FIREBASE FATAL ERROR: ${buildLogMessage_(...varArgs)}`;\n  logClient.error(message);\n  throw new Error(message);\n};\n\nexport const warn = function (...varArgs: unknown[]) {\n  const message = 'FIREBASE WARNING: ' + buildLogMessage_(...varArgs);\n  logClient.warn(message);\n};\n\n/**\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\n * does not use https.\n */\nexport const warnIfPageIsSecure = function () {\n  // Be very careful accessing browser globals. Who knows what may or may not exist.\n  if (\n    typeof window !== 'undefined' &&\n    window.location &&\n    window.location.protocol &&\n    window.location.protocol.indexOf('https:') !== -1\n  ) {\n    warn(\n      'Insecure Firebase access from a secure page. ' +\n        'Please use https in calls to new Firebase().'\n    );\n  }\n};\n\nexport const warnAboutUnsupportedMethod = function (methodName: string) {\n  warn(\n    methodName +\n      ' is unsupported and will likely change soon.  ' +\n      'Please do not use.'\n  );\n};\n\n/**\n * Returns true if data is NaN, or +/- Infinity.\n */\nexport const isInvalidJSONNumber = function (data: unknown): boolean {\n  return (\n    typeof data === 'number' &&\n    (data !== data || // NaN\n      data === Number.POSITIVE_INFINITY ||\n      data === Number.NEGATIVE_INFINITY)\n  );\n};\n\nexport const executeWhenDOMReady = function (fn: () => void) {\n  if (isNodeSdk() || document.readyState === 'complete') {\n    fn();\n  } else {\n    // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\n    // fire before onload), but fall back to onload.\n\n    let called = false;\n    const wrappedFn = function () {\n      if (!document.body) {\n        setTimeout(wrappedFn, Math.floor(10));\n        return;\n      }\n\n      if (!called) {\n        called = true;\n        fn();\n      }\n    };\n\n    if (document.addEventListener) {\n      document.addEventListener('DOMContentLoaded', wrappedFn, false);\n      // fallback to onload.\n      window.addEventListener('load', wrappedFn, false);\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((document as any).attachEvent) {\n      // IE.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (document as any).attachEvent('onreadystatechange', () => {\n        if (document.readyState === 'complete') {\n          wrappedFn();\n        }\n      });\n      // fallback to onload.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (window as any).attachEvent('onload', wrappedFn);\n\n      // jQuery has an extra hack for IE that we could employ (based on\n      // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\n      // I'm hoping we don't need it.\n    }\n  }\n};\n\n/**\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n */\nexport const MIN_NAME = '[MIN_NAME]';\n\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n */\nexport const MAX_NAME = '[MAX_NAME]';\n\n/**\n * Compares valid Firebase key names, plus min and max name\n */\nexport const nameCompare = function (a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a === MIN_NAME || b === MAX_NAME) {\n    return -1;\n  } else if (b === MIN_NAME || a === MAX_NAME) {\n    return 1;\n  } else {\n    const aAsInt = tryParseInt(a),\n      bAsInt = tryParseInt(b);\n\n    if (aAsInt !== null) {\n      if (bAsInt !== null) {\n        return aAsInt - bAsInt === 0 ? a.length - b.length : aAsInt - bAsInt;\n      } else {\n        return -1;\n      }\n    } else if (bAsInt !== null) {\n      return 1;\n    } else {\n      return a < b ? -1 : 1;\n    }\n  }\n};\n\n/**\n * @returns {!number} comparison result.\n */\nexport const stringCompare = function (a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 1;\n  }\n};\n\nexport const requireKey = function (\n  key: string,\n  obj: { [k: string]: unknown }\n): unknown {\n  if (obj && key in obj) {\n    return obj[key];\n  } else {\n    throw new Error(\n      'Missing required key (' + key + ') in object: ' + stringify(obj)\n    );\n  }\n};\n\nexport const ObjectToUniqueKey = function (obj: unknown): string {\n  if (typeof obj !== 'object' || obj === null) {\n    return stringify(obj);\n  }\n\n  const keys = [];\n  // eslint-disable-next-line guard-for-in\n  for (const k in obj) {\n    keys.push(k);\n  }\n\n  // Export as json, but with the keys sorted.\n  keys.sort();\n  let key = '{';\n  for (let i = 0; i < keys.length; i++) {\n    if (i !== 0) {\n      key += ',';\n    }\n    key += stringify(keys[i]);\n    key += ':';\n    key += ObjectToUniqueKey(obj[keys[i]]);\n  }\n\n  key += '}';\n  return key;\n};\n\n/**\n * Splits a string into a number of smaller segments of maximum size\n * @param str - The string\n * @param segsize - The maximum number of chars in the string.\n * @returns The string, split into appropriately-sized chunks\n */\nexport const splitStringBySize = function (\n  str: string,\n  segsize: number\n): string[] {\n  const len = str.length;\n\n  if (len <= segsize) {\n    return [str];\n  }\n\n  const dataSegs = [];\n  for (let c = 0; c < len; c += segsize) {\n    if (c + segsize > len) {\n      dataSegs.push(str.substring(c, len));\n    } else {\n      dataSegs.push(str.substring(c, c + segsize));\n    }\n  }\n  return dataSegs;\n};\n\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param obj - The object or array to iterate over\n * @param fn - The function to apply\n */\nexport function each(obj: object, fn: (k: string, v: unknown) => void) {\n  for (const key in obj) {\n    if (obj.hasOwnProperty(key)) {\n      fn(key, obj[key]);\n    }\n  }\n}\n\n/**\n * Like goog.bind, but doesn't bother to create a closure if opt_context is null/undefined.\n * @param callback - Callback function.\n * @param context - Optional context to bind to.\n *\n */\nexport const bindCallback = function (\n  callback: (a: unknown) => void,\n  context?: object | null\n): (a: unknown) => void {\n  return context ? callback.bind(context) : callback;\n};\n\n/**\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\n * I made one modification at the end and removed the NaN / Infinity\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\n * @param v - A double\n *\n */\nexport const doubleToIEEE754String = function (v: number): string {\n  assert(!isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n\n  const ebits = 11,\n    fbits = 52;\n  const bias = (1 << (ebits - 1)) - 1;\n  let s, e, f, ln, i;\n\n  // Compute sign, exponent, fraction\n  // Skip NaN / Infinity handling --MJL.\n  if (v === 0) {\n    e = 0;\n    f = 0;\n    s = 1 / v === -Infinity ? 1 : 0;\n  } else {\n    s = v < 0;\n    v = Math.abs(v);\n\n    if (v >= Math.pow(2, 1 - bias)) {\n      // Normalized\n      ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\n      e = ln + bias;\n      f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\n    } else {\n      // Denormalized\n      e = 0;\n      f = Math.round(v / Math.pow(2, 1 - bias - fbits));\n    }\n  }\n\n  // Pack sign, exponent, fraction\n  const bits = [];\n  for (i = fbits; i; i -= 1) {\n    bits.push(f % 2 ? 1 : 0);\n    f = Math.floor(f / 2);\n  }\n  for (i = ebits; i; i -= 1) {\n    bits.push(e % 2 ? 1 : 0);\n    e = Math.floor(e / 2);\n  }\n  bits.push(s ? 1 : 0);\n  bits.reverse();\n  const str = bits.join('');\n\n  // Return the data as a hex string. --MJL\n  let hexByteString = '';\n  for (i = 0; i < 64; i += 8) {\n    let hexByte = parseInt(str.substr(i, 8), 2).toString(16);\n    if (hexByte.length === 1) {\n      hexByte = '0' + hexByte;\n    }\n    hexByteString = hexByteString + hexByte;\n  }\n  return hexByteString.toLowerCase();\n};\n\n/**\n * Used to detect if we're in a Chrome content script (which executes in an\n * isolated environment where long-polling doesn't work).\n */\nexport const isChromeExtensionContentScript = function (): boolean {\n  return !!(\n    typeof window === 'object' &&\n    window['chrome'] &&\n    window['chrome']['extension'] &&\n    !/^chrome/.test(window.location.href)\n  );\n};\n\n/**\n * Used to detect if we're in a Windows 8 Store app.\n */\nexport const isWindowsStoreApp = function (): boolean {\n  // Check for the presence of a couple WinRT globals\n  return typeof Windows === 'object' && typeof Windows.UI === 'object';\n};\n\n/**\n * Converts a server error code to a JavaScript Error\n */\nexport function errorForServerCode(code: string, query: QueryContext): Error {\n  let reason = 'Unknown Error';\n  if (code === 'too_big') {\n    reason =\n      'The data requested exceeds the maximum size ' +\n      'that can be accessed with a single request.';\n  } else if (code === 'permission_denied') {\n    reason = \"Client doesn't have permission to access the desired data.\";\n  } else if (code === 'unavailable') {\n    reason = 'The service is unavailable';\n  }\n\n  const error = new Error(\n    code + ' at ' + query._path.toString() + ': ' + reason\n  );\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  (error as any).code = code.toUpperCase();\n  return error;\n}\n\n/**\n * Used to test for integer-looking strings\n */\nexport const INTEGER_REGEXP_ = new RegExp('^-?(0*)\\\\d{1,10}$');\n\n/**\n * For use in keys, the minimum possible 32-bit integer.\n */\nexport const INTEGER_32_MIN = -2147483648;\n\n/**\n * For use in keys, the maximum possible 32-bit integer.\n */\nexport const INTEGER_32_MAX = 2147483647;\n\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n */\nexport const tryParseInt = function (str: string): number | null {\n  if (INTEGER_REGEXP_.test(str)) {\n    const intVal = Number(str);\n    if (intVal >= INTEGER_32_MIN && intVal <= INTEGER_32_MAX) {\n      return intVal;\n    }\n  }\n  return null;\n};\n\n/**\n * Helper to run some code but catch any exceptions and re-throw them later.\n * Useful for preventing user callbacks from breaking internal code.\n *\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\n * convenient (we don't have to try to figure out when is a safe point to\n * re-throw it), and the behavior seems reasonable:\n *\n * * If you aren't pausing on exceptions, you get an error in the console with\n *   the correct stack trace.\n * * If you're pausing on all exceptions, the debugger will pause on your\n *   exception and then again when we rethrow it.\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\n *   on us re-throwing it.\n *\n * @param fn - The code to guard.\n */\nexport const exceptionGuard = function (fn: () => void) {\n  try {\n    fn();\n  } catch (e) {\n    // Re-throw exception when it's safe.\n    setTimeout(() => {\n      // It used to be that \"throw e\" would result in a good console error with\n      // relevant context, but as of Chrome 39, you just get the firebase.js\n      // file/line number where we re-throw it, which is useless. So we log\n      // e.stack explicitly.\n      const stack = e.stack || '';\n      warn('Exception was thrown by user callback.', stack);\n      throw e;\n    }, Math.floor(0));\n  }\n};\n\n/**\n * Helper function to safely call opt_callback with the specified arguments.  It:\n * 1. Turns into a no-op if opt_callback is null or undefined.\n * 2. Wraps the call inside exceptionGuard to prevent exceptions from breaking our state.\n *\n * @param callback - Optional onComplete callback.\n * @param varArgs - Arbitrary args to be passed to opt_onComplete\n */\nexport const callUserCallback = function (\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  callback?: Function | null,\n  ...varArgs: unknown[]\n) {\n  if (typeof callback === 'function') {\n    exceptionGuard(() => {\n      callback(...varArgs);\n    });\n  }\n};\n\n/**\n * @returns {boolean} true if we think we're currently being crawled.\n */\nexport const beingCrawled = function (): boolean {\n  const userAgent =\n    (typeof window === 'object' &&\n      window['navigator'] &&\n      window['navigator']['userAgent']) ||\n    '';\n\n  // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\n  // believe to support JavaScript/AJAX rendering.\n  // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\n  // would have seen the page\" is flaky if we don't treat it as a crawler.\n  return (\n    userAgent.search(\n      /googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i\n    ) >= 0\n  );\n};\n\n/**\n * Export a property of an object using a getter function.\n */\nexport const exportPropGetter = function (\n  object: object,\n  name: string,\n  fnGet: () => unknown\n) {\n  Object.defineProperty(object, name, { get: fnGet });\n};\n\n/**\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\n *\n * It is removed with clearTimeout() as normal.\n *\n * @param fn - Function to run.\n * @param time - Milliseconds to wait before running.\n * @returns The setTimeout() return value.\n */\nexport const setTimeoutNonBlocking = function (\n  fn: () => void,\n  time: number\n): number | object {\n  const timeout: number | object = setTimeout(fn, time);\n  // Note: at the time of this comment, unrefTimer is under the unstable set of APIs. Run with --unstable to enable the API.\n  if (\n    typeof timeout === 'number' &&\n    // @ts-ignore Is only defined in Deno environments.\n    typeof Deno !== 'undefined' &&\n    // @ts-ignore Deno and unrefTimer are only defined in Deno environments.\n    Deno['unrefTimer']\n  ) {\n    // @ts-ignore Deno and unrefTimer are only defined in Deno environments.\n    Deno.unrefTimer(timeout);\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  } else if (typeof timeout === 'object' && (timeout as any)['unref']) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (timeout as any)['unref']();\n  }\n\n  return timeout;\n};\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  AppCheckInternalComponentName,\n  AppCheckTokenListener,\n  AppCheckTokenResult,\n  FirebaseAppCheckInternal\n} from '@firebase/app-check-interop-types';\nimport { Provider } from '@firebase/component';\n\nimport { warn } from './util/util';\n\n/**\n * Abstraction around AppCheck's token fetching capabilities.\n */\nexport class AppCheckTokenProvider {\n  private appCheck?: FirebaseAppCheckInternal;\n  constructor(\n    private appName_: string,\n    private appCheckProvider?: Provider<AppCheckInternalComponentName>\n  ) {\n    this.appCheck = appCheckProvider?.getImmediate({ optional: true });\n    if (!this.appCheck) {\n      appCheckProvider?.get().then(appCheck => (this.appCheck = appCheck));\n    }\n  }\n\n  getToken(forceRefresh?: boolean): Promise<AppCheckTokenResult> {\n    if (!this.appCheck) {\n      return new Promise<AppCheckTokenResult>((resolve, reject) => {\n        // Support delayed initialization of FirebaseAppCheck. This allows our\n        // customers to initialize the RTDB SDK before initializing Firebase\n        // AppCheck and ensures that all requests are authenticated if a token\n        // becomes available before the timeout below expires.\n        setTimeout(() => {\n          if (this.appCheck) {\n            this.getToken(forceRefresh).then(resolve, reject);\n          } else {\n            resolve(null);\n          }\n        }, 0);\n      });\n    }\n    return this.appCheck.getToken(forceRefresh);\n  }\n\n  addTokenChangeListener(listener: AppCheckTokenListener) {\n    this.appCheckProvider\n      ?.get()\n      .then(appCheck => appCheck.addTokenListener(listener));\n  }\n\n  notifyForInvalidToken(): void {\n    warn(\n      `Provided AppCheck credentials for the app named \"${this.appName_}\" ` +\n        'are invalid. This usually indicates your app was not initialized correctly.'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseAuthTokenData } from '@firebase/app-types/private';\nimport {\n  FirebaseAuthInternal,\n  FirebaseAuthInternalName\n} from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\n\nimport { log, warn } from './util/util';\n\nexport interface AuthTokenProvider {\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData>;\n  addTokenChangeListener(listener: (token: string | null) => void): void;\n  removeTokenChangeListener(listener: (token: string | null) => void): void;\n  notifyForInvalidToken(): void;\n}\n\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nexport class FirebaseAuthTokenProvider implements AuthTokenProvider {\n  private auth_: FirebaseAuthInternal | null = null;\n\n  constructor(\n    private appName_: string,\n    private firebaseOptions_: object,\n    private authProvider_: Provider<FirebaseAuthInternalName>\n  ) {\n    this.auth_ = authProvider_.getImmediate({ optional: true });\n    if (!this.auth_) {\n      authProvider_.onInit(auth => (this.auth_ = auth));\n    }\n  }\n\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    if (!this.auth_) {\n      return new Promise<FirebaseAuthTokenData>((resolve, reject) => {\n        // Support delayed initialization of FirebaseAuth. This allows our\n        // customers to initialize the RTDB SDK before initializing Firebase\n        // Auth and ensures that all requests are authenticated if a token\n        // becomes available before the timeout below expires.\n        setTimeout(() => {\n          if (this.auth_) {\n            this.getToken(forceRefresh).then(resolve, reject);\n          } else {\n            resolve(null);\n          }\n        }, 0);\n      });\n    }\n\n    return this.auth_.getToken(forceRefresh).catch(error => {\n      // TODO: Need to figure out all the cases this is raised and whether\n      // this makes sense.\n      if (error && error.code === 'auth/token-not-initialized') {\n        log('Got auth/token-not-initialized error.  Treating as null token.');\n        return null;\n      } else {\n        return Promise.reject(error);\n      }\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void): void {\n    // TODO: We might want to wrap the listener and call it with no args to\n    // avoid a leaky abstraction, but that makes removing the listener harder.\n    if (this.auth_) {\n      this.auth_.addAuthTokenListener(listener);\n    } else {\n      this.authProvider_\n        .get()\n        .then(auth => auth.addAuthTokenListener(listener));\n    }\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void): void {\n    this.authProvider_\n      .get()\n      .then(auth => auth.removeAuthTokenListener(listener));\n  }\n\n  notifyForInvalidToken(): void {\n    let errorMessage =\n      'Provided authentication credentials for the app named \"' +\n      this.appName_ +\n      '\" are invalid. This usually indicates your app was not ' +\n      'initialized correctly. ';\n    if ('credential' in this.firebaseOptions_) {\n      errorMessage +=\n        'Make sure the \"credential\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else if ('serviceAccount' in this.firebaseOptions_) {\n      errorMessage +=\n        'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else {\n      errorMessage +=\n        'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\n        'initializeApp() match the values provided for your app at ' +\n        'https://console.firebase.google.com/.';\n    }\n    warn(errorMessage);\n  }\n}\n\n/* AuthTokenProvider that supplies a constant token. Used by Admin SDK or mockUserToken with emulators. */\nexport class EmulatorTokenProvider implements AuthTokenProvider {\n  /** A string that is treated as an admin access token by the RTDB emulator. Used by Admin SDK. */\n  static OWNER = 'owner';\n\n  constructor(private accessToken: string) {}\n\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    return Promise.resolve({\n      accessToken: this.accessToken\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void): void {\n    // Invoke the listener immediately to match the behavior in Firebase Auth\n    // (see packages/auth/src/auth.js#L1807)\n    listener(this.accessToken);\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void): void {}\n\n  notifyForInvalidToken(): void {}\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport const PROTOCOL_VERSION = '5';\n\nexport const VERSION_PARAM = 'v';\n\nexport const TRANSPORT_SESSION_PARAM = 's';\n\nexport const REFERER_PARAM = 'r';\n\nexport const FORGE_REF = 'f';\n\n// Matches console.firebase.google.com, firebase-console-*.corp.google.com and\n// firebase.corp.google.com\nexport const FORGE_DOMAIN_RE =\n  /(console\\.firebase|firebase-console-\\w+\\.corp|firebase\\.corp)\\.google\\.com/;\n\nexport const LAST_SESSION_PARAM = 'ls';\n\nexport const APPLICATION_ID_PARAM = 'p';\n\nexport const APP_CHECK_TOKEN_PARAM = 'ac';\n\nexport const WEBSOCKET = 'websocket';\n\nexport const LONG_POLLING = 'long_polling';\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { LONG_POLLING, WEBSOCKET } from '../realtime/Constants';\n\nimport { PersistentStorage } from './storage/storage';\nimport { each } from './util/util';\n\n/**\n * A class that holds metadata about a Repo object\n */\nexport class RepoInfo {\n  private _host: string;\n  private _domain: string;\n  internalHost: string;\n\n  /**\n   * @param host - Hostname portion of the url for the repo\n   * @param secure - Whether or not this repo is accessed over ssl\n   * @param namespace - The namespace represented by the repo\n   * @param webSocketOnly - Whether to prefer websockets over all other transports (used by Nest).\n   * @param nodeAdmin - Whether this instance uses Admin SDK credentials\n   * @param persistenceKey - Override the default session persistence storage key\n   */\n  constructor(\n    host: string,\n    public readonly secure: boolean,\n    public readonly namespace: string,\n    public readonly webSocketOnly: boolean,\n    public readonly nodeAdmin: boolean = false,\n    public readonly persistenceKey: string = '',\n    public readonly includeNamespaceInQueryParams: boolean = false,\n    public readonly isUsingEmulator: boolean = false\n  ) {\n    this._host = host.toLowerCase();\n    this._domain = this._host.substr(this._host.indexOf('.') + 1);\n    this.internalHost =\n      (PersistentStorage.get('host:' + host) as string) || this._host;\n  }\n\n  isCacheableHost(): boolean {\n    return this.internalHost.substr(0, 2) === 's-';\n  }\n\n  isCustomHost() {\n    return (\n      this._domain !== 'firebaseio.com' &&\n      this._domain !== 'firebaseio-demo.com'\n    );\n  }\n\n  get host() {\n    return this._host;\n  }\n\n  set host(newHost: string) {\n    if (newHost !== this.internalHost) {\n      this.internalHost = newHost;\n      if (this.isCacheableHost()) {\n        PersistentStorage.set('host:' + this._host, this.internalHost);\n      }\n    }\n  }\n\n  toString(): string {\n    let str = this.toURLString();\n    if (this.persistenceKey) {\n      str += '<' + this.persistenceKey + '>';\n    }\n    return str;\n  }\n\n  toURLString(): string {\n    const protocol = this.secure ? 'https://' : 'http://';\n    const query = this.includeNamespaceInQueryParams\n      ? `?ns=${this.namespace}`\n      : '';\n    return `${protocol}${this.host}/${query}`;\n  }\n}\n\nfunction repoInfoNeedsQueryParam(repoInfo: RepoInfo): boolean {\n  return (\n    repoInfo.host !== repoInfo.internalHost ||\n    repoInfo.isCustomHost() ||\n    repoInfo.includeNamespaceInQueryParams\n  );\n}\n\n/**\n * Returns the websocket URL for this repo\n * @param repoInfo - RepoInfo object\n * @param type - of connection\n * @param params - list\n * @returns The URL for this repo\n */\nexport function repoInfoConnectionURL(\n  repoInfo: RepoInfo,\n  type: string,\n  params: { [k: string]: string }\n): string {\n  assert(typeof type === 'string', 'typeof type must == string');\n  assert(typeof params === 'object', 'typeof params must == object');\n\n  let connURL: string;\n  if (type === WEBSOCKET) {\n    connURL =\n      (repoInfo.secure ? 'wss://' : 'ws://') + repoInfo.internalHost + '/.ws?';\n  } else if (type === LONG_POLLING) {\n    connURL =\n      (repoInfo.secure ? 'https://' : 'http://') +\n      repoInfo.internalHost +\n      '/.lp?';\n  } else {\n    throw new Error('Unknown connection type: ' + type);\n  }\n  if (repoInfoNeedsQueryParam(repoInfo)) {\n    params['ns'] = repoInfo.namespace;\n  }\n\n  const pairs: string[] = [];\n\n  each(params, (key: string, value: string) => {\n    pairs.push(key + '=' + value);\n  });\n\n  return connURL + pairs.join('&');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { deepCopy, contains } from '@firebase/util';\n\n/**\n * Tracks a collection of stats.\n */\nexport class StatsCollection {\n  private counters_: { [k: string]: number } = {};\n\n  incrementCounter(name: string, amount: number = 1) {\n    if (!contains(this.counters_, name)) {\n      this.counters_[name] = 0;\n    }\n\n    this.counters_[name] += amount;\n  }\n\n  get() {\n    return deepCopy(this.counters_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../RepoInfo';\n\nimport { StatsCollection } from './StatsCollection';\n\nconst collections: { [k: string]: StatsCollection } = {};\nconst reporters: { [k: string]: unknown } = {};\n\nexport function statsManagerGetCollection(repoInfo: RepoInfo): StatsCollection {\n  const hashString = repoInfo.toString();\n\n  if (!collections[hashString]) {\n    collections[hashString] = new StatsCollection();\n  }\n\n  return collections[hashString];\n}\n\nexport function statsManagerGetOrCreateReporter<T>(\n  repoInfo: RepoInfo,\n  creatorFunction: () => T\n): T {\n  const hashString = repoInfo.toString();\n\n  if (!reporters[hashString]) {\n    reporters[hashString] = creatorFunction();\n  }\n\n  return reporters[hashString] as T;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { exceptionGuard } from '../../core/util/util';\n\n/**\n * This class ensures the packets from the server arrive in order\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\n */\nexport class PacketReceiver {\n  pendingResponses: unknown[] = [];\n  currentResponseNum = 0;\n  closeAfterResponse = -1;\n  onClose: (() => void) | null = null;\n\n  /**\n   * @param onMessage_\n   */\n  constructor(private onMessage_: (a: {}) => void) {}\n\n  closeAfter(responseNum: number, callback: () => void) {\n    this.closeAfterResponse = responseNum;\n    this.onClose = callback;\n    if (this.closeAfterResponse < this.currentResponseNum) {\n      this.onClose();\n      this.onClose = null;\n    }\n  }\n\n  /**\n   * Each message from the server comes with a response number, and an array of data. The responseNumber\n   * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\n   * browsers will respond in the same order as the requests we sent\n   */\n  handleResponse(requestNum: number, data: unknown[]) {\n    this.pendingResponses[requestNum] = data;\n    while (this.pendingResponses[this.currentResponseNum]) {\n      const toProcess = this.pendingResponses[\n        this.currentResponseNum\n      ] as unknown[];\n      delete this.pendingResponses[this.currentResponseNum];\n      for (let i = 0; i < toProcess.length; ++i) {\n        if (toProcess[i]) {\n          exceptionGuard(() => {\n            this.onMessage_(toProcess[i]);\n          });\n        }\n      }\n      if (this.currentResponseNum === this.closeAfterResponse) {\n        if (this.onClose) {\n          this.onClose();\n          this.onClose = null;\n        }\n        break;\n      }\n      this.currentResponseNum++;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Encode, isNodeSdk, stringify } from '@firebase/util';\n\nimport { RepoInfo, repoInfoConnectionURL } from '../core/RepoInfo';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { statsManagerGetCollection } from '../core/stats/StatsManager';\nimport {\n  executeWhenDOMReady,\n  isChromeExtensionContentScript,\n  isWindowsStoreApp,\n  log,\n  logWrapper,\n  LUIDGenerator,\n  splitStringBySize\n} from '../core/util/util';\n\nimport {\n  APP_CHECK_TOKEN_PARAM,\n  APPLICATION_ID_PARAM,\n  FORGE_DOMAIN_RE,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  LONG_POLLING,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM\n} from './Constants';\nimport { PacketReceiver } from './polling/PacketReceiver';\nimport { Transport } from './Transport';\n\n// URL query parameters associated with longpolling\nexport const FIREBASE_LONGPOLL_START_PARAM = 'start';\nexport const FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nexport const FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nexport const FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nexport const FIREBASE_LONGPOLL_ID_PARAM = 'id';\nexport const FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nexport const FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nexport const FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nexport const FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nexport const FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nexport const FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\n\n//Data size constants.\n//TODO: Perf: the maximum length actually differs from browser to browser.\n// We should check what browser we're on and set accordingly.\nconst MAX_URL_DATA_SIZE = 1870;\nconst SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\nconst MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\n\n/**\n * Keepalive period\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\n * length of 30 seconds that we can't exceed.\n */\nconst KEEPALIVE_REQUEST_INTERVAL = 25000;\n\n/**\n * How long to wait before aborting a long-polling connection attempt.\n */\nconst LP_CONNECT_TIMEOUT = 30000;\n\n/**\n * This class manages a single long-polling connection.\n */\nexport class BrowserPollConnection implements Transport {\n  bytesSent = 0;\n  bytesReceived = 0;\n  urlFn: (params: object) => string;\n  scriptTagHolder: FirebaseIFrameScriptHolder;\n  myDisconnFrame: HTMLIFrameElement;\n  curSegmentNum: number;\n  myPacketOrderer: PacketReceiver;\n  id: string;\n  password: string;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_ = false;\n  private isClosed_: boolean;\n  private connectTimeoutTimer_: number | null;\n  private onDisconnect_: ((a?: boolean) => void) | null;\n\n  /**\n   * @param connId An identifier for this connection, used for logging\n   * @param repoInfo The info for the endpoint to send data to.\n   * @param applicationId The Firebase App ID for this project.\n   * @param appCheckToken The AppCheck token for this client.\n   * @param authToken The AuthToken to use for this connection.\n   * @param transportSessionId Optional transportSessionid if we are\n   * reconnecting for an existing transport session\n   * @param lastSessionId Optional lastSessionId if the PersistentConnection has\n   * already created a connection previously\n   */\n  constructor(\n    public connId: string,\n    public repoInfo: RepoInfo,\n    private applicationId?: string,\n    private appCheckToken?: string,\n    private authToken?: string,\n    public transportSessionId?: string,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(connId);\n    this.stats_ = statsManagerGetCollection(repoInfo);\n    this.urlFn = (params: { [k: string]: string }) => {\n      // Always add the token if we have one.\n      if (this.appCheckToken) {\n        params[APP_CHECK_TOKEN_PARAM] = this.appCheckToken;\n      }\n      return repoInfoConnectionURL(repoInfo, LONG_POLLING, params);\n    };\n  }\n\n  /**\n   * @param onMessage - Callback when messages arrive\n   * @param onDisconnect - Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.curSegmentNum = 0;\n    this.onDisconnect_ = onDisconnect;\n    this.myPacketOrderer = new PacketReceiver(onMessage);\n    this.isClosed_ = false;\n\n    this.connectTimeoutTimer_ = setTimeout(() => {\n      this.log_('Timed out trying to connect.');\n      // Make sure we clear the host cache\n      this.onClosed_();\n      this.connectTimeoutTimer_ = null;\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(LP_CONNECT_TIMEOUT)) as any;\n\n    // Ensure we delay the creation of the iframe until the DOM is loaded.\n    executeWhenDOMReady(() => {\n      if (this.isClosed_) {\n        return;\n      }\n\n      //Set up a callback that gets triggered once a connection is set up.\n      this.scriptTagHolder = new FirebaseIFrameScriptHolder(\n        (...args) => {\n          const [command, arg1, arg2, arg3, arg4] = args;\n          this.incrementIncomingBytes_(args);\n          if (!this.scriptTagHolder) {\n            return; // we closed the connection.\n          }\n\n          if (this.connectTimeoutTimer_) {\n            clearTimeout(this.connectTimeoutTimer_);\n            this.connectTimeoutTimer_ = null;\n          }\n          this.everConnected_ = true;\n          if (command === FIREBASE_LONGPOLL_START_PARAM) {\n            this.id = arg1 as string;\n            this.password = arg2 as string;\n          } else if (command === FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n            // Don't clear the host cache. We got a response from the server, so we know it's reachable\n            if (arg1) {\n              // We aren't expecting any more data (other than what the server's already in the process of sending us\n              // through our already open polls), so don't send any more.\n              this.scriptTagHolder.sendNewPolls = false;\n\n              // arg1 in this case is the last response number sent by the server. We should try to receive\n              // all of the responses up to this one before closing\n              this.myPacketOrderer.closeAfter(arg1 as number, () => {\n                this.onClosed_();\n              });\n            } else {\n              this.onClosed_();\n            }\n          } else {\n            throw new Error('Unrecognized command received: ' + command);\n          }\n        },\n        (...args) => {\n          const [pN, data] = args;\n          this.incrementIncomingBytes_(args);\n          this.myPacketOrderer.handleResponse(pN as number, data as unknown[]);\n        },\n        () => {\n          this.onClosed_();\n        },\n        this.urlFn\n      );\n\n      //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\n      //from cache.\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_START_PARAM] = 't';\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(\n        Math.random() * 100000000\n      );\n      if (this.scriptTagHolder.uniqueCallbackIdentifier) {\n        urlParams[FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] =\n          this.scriptTagHolder.uniqueCallbackIdentifier;\n      }\n      urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n      if (this.transportSessionId) {\n        urlParams[TRANSPORT_SESSION_PARAM] = this.transportSessionId;\n      }\n      if (this.lastSessionId) {\n        urlParams[LAST_SESSION_PARAM] = this.lastSessionId;\n      }\n      if (this.applicationId) {\n        urlParams[APPLICATION_ID_PARAM] = this.applicationId;\n      }\n      if (this.appCheckToken) {\n        urlParams[APP_CHECK_TOKEN_PARAM] = this.appCheckToken;\n      }\n      if (\n        typeof location !== 'undefined' &&\n        location.hostname &&\n        FORGE_DOMAIN_RE.test(location.hostname)\n      ) {\n        urlParams[REFERER_PARAM] = FORGE_REF;\n      }\n      const connectURL = this.urlFn(urlParams);\n      this.log_('Connecting via long-poll to ' + connectURL);\n      this.scriptTagHolder.addTag(connectURL, () => {\n        /* do nothing */\n      });\n    });\n  }\n\n  /**\n   * Call this when a handshake has completed successfully and we want to consider the connection established\n   */\n  start() {\n    this.scriptTagHolder.startLongPoll(this.id, this.password);\n    this.addDisconnectPingFrame(this.id, this.password);\n  }\n\n  static forceAllow_: boolean;\n\n  /**\n   * Forces long polling to be considered as a potential transport\n   */\n  static forceAllow() {\n    BrowserPollConnection.forceAllow_ = true;\n  }\n\n  static forceDisallow_: boolean;\n\n  /**\n   * Forces longpolling to not be considered as a potential transport\n   */\n  static forceDisallow() {\n    BrowserPollConnection.forceDisallow_ = true;\n  }\n\n  // Static method, use string literal so it can be accessed in a generic way\n  static isAvailable() {\n    if (isNodeSdk()) {\n      return false;\n    } else if (BrowserPollConnection.forceAllow_) {\n      return true;\n    } else {\n      // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\n      // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\n      return (\n        !BrowserPollConnection.forceDisallow_ &&\n        typeof document !== 'undefined' &&\n        document.createElement != null &&\n        !isChromeExtensionContentScript() &&\n        !isWindowsStoreApp()\n      );\n    }\n  }\n\n  /**\n   * No-op for polling\n   */\n  markConnectionHealthy() {}\n\n  /**\n   * Stops polling and cleans up the iframe\n   */\n  private shutdown_() {\n    this.isClosed_ = true;\n\n    if (this.scriptTagHolder) {\n      this.scriptTagHolder.close();\n      this.scriptTagHolder = null;\n    }\n\n    //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\n    if (this.myDisconnFrame) {\n      document.body.removeChild(this.myDisconnFrame);\n      this.myDisconnFrame = null;\n    }\n\n    if (this.connectTimeoutTimer_) {\n      clearTimeout(this.connectTimeoutTimer_);\n      this.connectTimeoutTimer_ = null;\n    }\n  }\n\n  /**\n   * Triggered when this transport is closed\n   */\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is closing itself');\n      this.shutdown_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_(this.everConnected_);\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\n   * that we've left.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is being closed.');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\n   * broken into chunks (since URLs have a small maximum length).\n   * @param data - The JSON data to transmit.\n   */\n  send(data: {}) {\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //first, lets get the base64-encoded data\n    const base64data = base64Encode(dataStr);\n\n    //We can only fit a certain amount in each URL, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n    const dataSegs = splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\n\n    //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\n    //of segments so that we can reassemble the packet on the server.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.scriptTagHolder.enqueueSegment(\n        this.curSegmentNum,\n        dataSegs.length,\n        dataSegs[i]\n      );\n      this.curSegmentNum++;\n    }\n  }\n\n  /**\n   * This is how we notify the server that we're leaving.\n   * We aren't able to send requests with DHTML on a window close event, but we can\n   * trigger XHR requests in some browsers (everything but Opera basically).\n   */\n  addDisconnectPingFrame(id: string, pw: string) {\n    if (isNodeSdk()) {\n      return;\n    }\n    this.myDisconnFrame = document.createElement('iframe');\n    const urlParams: { [k: string]: string } = {};\n    urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\n    urlParams[FIREBASE_LONGPOLL_ID_PARAM] = id;\n    urlParams[FIREBASE_LONGPOLL_PW_PARAM] = pw;\n    this.myDisconnFrame.src = this.urlFn(urlParams);\n    this.myDisconnFrame.style.display = 'none';\n\n    document.body.appendChild(this.myDisconnFrame);\n  }\n\n  /**\n   * Used to track the bytes received by this client\n   */\n  private incrementIncomingBytes_(args: unknown) {\n    // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\n    const bytesReceived = stringify(args).length;\n    this.bytesReceived += bytesReceived;\n    this.stats_.incrementCounter('bytes_received', bytesReceived);\n  }\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface IFrameElement extends HTMLIFrameElement {\n  doc: Document;\n}\n\n/*********************************************************************************************\n * A wrapper around an iframe that is used as a long-polling script holder.\n *********************************************************************************************/\nexport class FirebaseIFrameScriptHolder {\n  //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\n  //problems in some browsers.\n  outstandingRequests = new Set<number>();\n\n  //A queue of the pending segments waiting for transmission to the server.\n  pendingSegs: Array<{ seg: number; ts: number; d: unknown }> = [];\n\n  //A serial number. We use this for two things:\n  // 1) A way to ensure the browser doesn't cache responses to polls\n  // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\n  //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\n  //    JSONP code in the order it was added to the iframe.\n  currentSerial = Math.floor(Math.random() * 100000000);\n\n  // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\n  // incoming data from the server that we're waiting for).\n  sendNewPolls = true;\n\n  uniqueCallbackIdentifier: number;\n  myIFrame: IFrameElement;\n  alive: boolean;\n  myID: string;\n  myPW: string;\n  commandCB: (command: string, ...args: unknown[]) => void;\n  onMessageCB: (...args: unknown[]) => void;\n\n  /**\n   * @param commandCB - The callback to be called when control commands are received from the server.\n   * @param onMessageCB - The callback to be triggered when responses arrive from the server.\n   * @param onDisconnect - The callback to be triggered when this tag holder is closed\n   * @param urlFn - A function that provides the URL of the endpoint to send data to.\n   */\n  constructor(\n    commandCB: (command: string, ...args: unknown[]) => void,\n    onMessageCB: (...args: unknown[]) => void,\n    public onDisconnect: () => void,\n    public urlFn: (a: object) => string\n  ) {\n    if (!isNodeSdk()) {\n      //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\n      //iframes where we put the long-polling script tags. We have two callbacks:\n      //   1) Command Callback - Triggered for control issues, like starting a connection.\n      //   2) Message Callback - Triggered when new data arrives.\n      this.uniqueCallbackIdentifier = LUIDGenerator();\n      window[\n        FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier\n      ] = commandCB;\n      window[FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] =\n        onMessageCB;\n\n      //Create an iframe for us to add script tags to.\n      this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\n\n      // Set the iframe's contents.\n      let script = '';\n      // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\n      // for ie9, but ie8 needs to do it again in the document itself.\n      if (\n        this.myIFrame.src &&\n        this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:'\n      ) {\n        const currentDomain = document.domain;\n        script = '<script>document.domain=\"' + currentDomain + '\";</script>';\n      }\n      const iframeContents = '<html><body>' + script + '</body></html>';\n      try {\n        this.myIFrame.doc.open();\n        this.myIFrame.doc.write(iframeContents);\n        this.myIFrame.doc.close();\n      } catch (e) {\n        log('frame writing exception');\n        if (e.stack) {\n          log(e.stack);\n        }\n        log(e);\n      }\n    } else {\n      this.commandCB = commandCB;\n      this.onMessageCB = onMessageCB;\n    }\n  }\n\n  /**\n   * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n   * actually use.\n   */\n  private static createIFrame_(): IFrameElement {\n    const iframe = document.createElement('iframe') as IFrameElement;\n    iframe.style.display = 'none';\n\n    // This is necessary in order to initialize the document inside the iframe\n    if (document.body) {\n      document.body.appendChild(iframe);\n      try {\n        // If document.domain has been modified in IE, this will throw an error, and we need to set the\n        // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n        // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n        const a = iframe.contentWindow.document;\n        if (!a) {\n          // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n          log('No IE domain setting required');\n        }\n      } catch (e) {\n        const domain = document.domain;\n        iframe.src =\n          \"javascript:void((function(){document.open();document.domain='\" +\n          domain +\n          \"';document.close();})())\";\n      }\n    } else {\n      // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n      // never gets hit.\n      throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n    }\n\n    // Get the document of the iframe in a browser-specific way.\n    if (iframe.contentDocument) {\n      iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\n    } else if (iframe.contentWindow) {\n      iframe.doc = iframe.contentWindow.document; // Internet Explorer\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((iframe as any).document) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      iframe.doc = (iframe as any).document; //others?\n    }\n\n    return iframe;\n  }\n\n  /**\n   * Cancel all outstanding queries and remove the frame.\n   */\n  close() {\n    //Mark this iframe as dead, so no new requests are sent.\n    this.alive = false;\n\n    if (this.myIFrame) {\n      //We have to actually remove all of the html inside this iframe before removing it from the\n      //window, or IE will continue loading and executing the script tags we've already added, which\n      //can lead to some errors being thrown. Setting textContent seems to be the safest way to do this.\n      this.myIFrame.doc.body.textContent = '';\n      setTimeout(() => {\n        if (this.myIFrame !== null) {\n          document.body.removeChild(this.myIFrame);\n          this.myIFrame = null;\n        }\n      }, Math.floor(0));\n    }\n\n    // Protect from being called recursively.\n    const onDisconnect = this.onDisconnect;\n    if (onDisconnect) {\n      this.onDisconnect = null;\n      onDisconnect();\n    }\n  }\n\n  /**\n   * Actually start the long-polling session by adding the first script tag(s) to the iframe.\n   * @param id - The ID of this connection\n   * @param pw - The password for this connection\n   */\n  startLongPoll(id: string, pw: string) {\n    this.myID = id;\n    this.myPW = pw;\n    this.alive = true;\n\n    //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\n    while (this.newRequest_()) {}\n  }\n\n  /**\n   * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\n   * too many outstanding requests and we are still alive.\n   *\n   * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\n   * needed.\n   */\n  private newRequest_() {\n    // We keep one outstanding request open all the time to receive data, but if we need to send data\n    // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\n    // close the old request.\n    if (\n      this.alive &&\n      this.sendNewPolls &&\n      this.outstandingRequests.size < (this.pendingSegs.length > 0 ? 2 : 1)\n    ) {\n      //construct our url\n      this.currentSerial++;\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n      urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\n      let theURL = this.urlFn(urlParams);\n      //Now add as much data as we can.\n      let curDataString = '';\n      let i = 0;\n\n      while (this.pendingSegs.length > 0) {\n        //first, lets see if the next segment will fit.\n        const nextSeg = this.pendingSegs[0];\n        if (\n          (nextSeg.d as unknown[]).length +\n            SEG_HEADER_SIZE +\n            curDataString.length <=\n          MAX_URL_DATA_SIZE\n        ) {\n          //great, the segment will fit. Lets append it.\n          const theSeg = this.pendingSegs.shift();\n          curDataString =\n            curDataString +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM +\n            i +\n            '=' +\n            theSeg.seg +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET +\n            i +\n            '=' +\n            theSeg.ts +\n            '&' +\n            FIREBASE_LONGPOLL_DATA_PARAM +\n            i +\n            '=' +\n            theSeg.d;\n          i++;\n        } else {\n          break;\n        }\n      }\n\n      theURL = theURL + curDataString;\n      this.addLongPollTag_(theURL, this.currentSerial);\n\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  /**\n   * Queue a packet for transmission to the server.\n   * @param segnum - A sequential id for this packet segment used for reassembly\n   * @param totalsegs - The total number of segments in this packet\n   * @param data - The data for this segment.\n   */\n  enqueueSegment(segnum: number, totalsegs: number, data: unknown) {\n    //add this to the queue of segments to send.\n    this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\n\n    //send the data immediately if there isn't already data being transmitted, unless\n    //startLongPoll hasn't been called yet.\n    if (this.alive) {\n      this.newRequest_();\n    }\n  }\n\n  /**\n   * Add a script tag for a regular long-poll request.\n   * @param url - The URL of the script tag.\n   * @param serial - The serial number of the request.\n   */\n  private addLongPollTag_(url: string, serial: number) {\n    //remember that we sent this request.\n    this.outstandingRequests.add(serial);\n\n    const doNewRequest = () => {\n      this.outstandingRequests.delete(serial);\n      this.newRequest_();\n    };\n\n    // If this request doesn't return on its own accord (by the server sending us some data), we'll\n    // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\n    const keepaliveTimeout = setTimeout(\n      doNewRequest,\n      Math.floor(KEEPALIVE_REQUEST_INTERVAL)\n    );\n\n    const readyStateCB = () => {\n      // Request completed.  Cancel the keepalive.\n      clearTimeout(keepaliveTimeout);\n\n      // Trigger a new request so we can continue receiving data.\n      doNewRequest();\n    };\n\n    this.addTag(url, readyStateCB);\n  }\n\n  /**\n   * Add an arbitrary script tag to the iframe.\n   * @param url - The URL for the script tag source.\n   * @param loadCB - A callback to be triggered once the script has loaded.\n   */\n  addTag(url: string, loadCB: () => void) {\n    if (isNodeSdk()) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (this as any).doNodeLongPoll(url, loadCB);\n    } else {\n      setTimeout(() => {\n        try {\n          // if we're already closed, don't add this poll\n          if (!this.sendNewPolls) {\n            return;\n          }\n          const newScript = this.myIFrame.doc.createElement('script');\n          newScript.type = 'text/javascript';\n          newScript.async = true;\n          newScript.src = url;\n          // eslint-disable-next-line @typescript-eslint/no-explicit-any\n          newScript.onload = (newScript as any).onreadystatechange =\n            function () {\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              const rstate = (newScript as any).readyState;\n              if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n                // eslint-disable-next-line @typescript-eslint/no-explicit-any\n                newScript.onload = (newScript as any).onreadystatechange = null;\n                if (newScript.parentNode) {\n                  newScript.parentNode.removeChild(newScript);\n                }\n                loadCB();\n              }\n            };\n          newScript.onerror = () => {\n            log('Long-poll script failed to load: ' + url);\n            this.sendNewPolls = false;\n            this.close();\n          };\n          this.myIFrame.doc.body.appendChild(newScript);\n        } catch (e) {\n          // TODO: we should make this error visible somehow\n        }\n      }, Math.floor(1));\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, isNodeSdk, jsonEval, stringify } from '@firebase/util';\n\nimport { RepoInfo, repoInfoConnectionURL } from '../core/RepoInfo';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { statsManagerGetCollection } from '../core/stats/StatsManager';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { logWrapper, splitStringBySize } from '../core/util/util';\nimport { SDK_VERSION } from '../core/version';\n\nimport {\n  APPLICATION_ID_PARAM,\n  APP_CHECK_TOKEN_PARAM,\n  FORGE_DOMAIN_RE,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM,\n  WEBSOCKET\n} from './Constants';\nimport { Transport } from './Transport';\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const MozWebSocket: any;\n\nconst WEBSOCKET_MAX_FRAME_SIZE = 16384;\nconst WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\n\nlet WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n  WebSocketImpl = MozWebSocket;\n} else if (typeof WebSocket !== 'undefined') {\n  WebSocketImpl = WebSocket;\n}\n\nexport function setWebSocketImpl(impl) {\n  WebSocketImpl = impl;\n}\n\n/**\n * Create a new websocket connection with the given callbacks.\n */\nexport class WebSocketConnection implements Transport {\n  keepaliveTimer: number | null = null;\n  frames: string[] | null = null;\n  totalFrames = 0;\n  bytesSent = 0;\n  bytesReceived = 0;\n  connURL: string;\n  onDisconnect: (a?: boolean) => void;\n  onMessage: (msg: {}) => void;\n  mySock: WebSocket | null;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_: boolean;\n  private isClosed_: boolean;\n  private nodeAdmin: boolean;\n\n  /**\n   * @param connId identifier for this transport\n   * @param repoInfo The info for the websocket endpoint.\n   * @param applicationId The Firebase App ID for this project.\n   * @param appCheckToken The App Check Token for this client.\n   * @param authToken The Auth Token for this client.\n   * @param transportSessionId Optional transportSessionId if this is connecting\n   * to an existing transport session\n   * @param lastSessionId Optional lastSessionId if there was a previous\n   * connection\n   */\n  constructor(\n    public connId: string,\n    repoInfo: RepoInfo,\n    private applicationId?: string,\n    private appCheckToken?: string,\n    private authToken?: string,\n    transportSessionId?: string,\n    lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(this.connId);\n    this.stats_ = statsManagerGetCollection(repoInfo);\n    this.connURL = WebSocketConnection.connectionURL_(\n      repoInfo,\n      transportSessionId,\n      lastSessionId,\n      appCheckToken,\n      applicationId\n    );\n    this.nodeAdmin = repoInfo.nodeAdmin;\n  }\n\n  /**\n   * @param repoInfo - The info for the websocket endpoint.\n   * @param transportSessionId - Optional transportSessionId if this is connecting to an existing transport\n   *                                         session\n   * @param lastSessionId - Optional lastSessionId if there was a previous connection\n   * @returns connection url\n   */\n  private static connectionURL_(\n    repoInfo: RepoInfo,\n    transportSessionId?: string,\n    lastSessionId?: string,\n    appCheckToken?: string,\n    applicationId?: string\n  ): string {\n    const urlParams: { [k: string]: string } = {};\n    urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n\n    if (\n      !isNodeSdk() &&\n      typeof location !== 'undefined' &&\n      location.hostname &&\n      FORGE_DOMAIN_RE.test(location.hostname)\n    ) {\n      urlParams[REFERER_PARAM] = FORGE_REF;\n    }\n    if (transportSessionId) {\n      urlParams[TRANSPORT_SESSION_PARAM] = transportSessionId;\n    }\n    if (lastSessionId) {\n      urlParams[LAST_SESSION_PARAM] = lastSessionId;\n    }\n    if (appCheckToken) {\n      urlParams[APP_CHECK_TOKEN_PARAM] = appCheckToken;\n    }\n    if (applicationId) {\n      urlParams[APPLICATION_ID_PARAM] = applicationId;\n    }\n\n    return repoInfoConnectionURL(repoInfo, WEBSOCKET, urlParams);\n  }\n\n  /**\n   * @param onMessage - Callback when messages arrive\n   * @param onDisconnect - Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.onDisconnect = onDisconnect;\n    this.onMessage = onMessage;\n\n    this.log_('Websocket connecting to ' + this.connURL);\n\n    this.everConnected_ = false;\n    // Assume failure until proven otherwise.\n    PersistentStorage.set('previous_websocket_failure', true);\n\n    try {\n      let options: { [k: string]: object };\n      if (isNodeSdk()) {\n        const device = this.nodeAdmin ? 'AdminNode' : 'Node';\n        // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\n        options = {\n          headers: {\n            'User-Agent': `Firebase/${PROTOCOL_VERSION}/${SDK_VERSION}/${process.platform}/${device}`,\n            'X-Firebase-GMPID': this.applicationId || ''\n          }\n        };\n\n        // If using Node with admin creds, AppCheck-related checks are unnecessary.\n        // Note that we send the credentials here even if they aren't admin credentials, which is\n        // not a problem.\n        // Note that this header is just used to bypass appcheck, and the token should still be sent\n        // through the websocket connection once it is established.\n        if (this.authToken) {\n          options.headers['Authorization'] = `Bearer ${this.authToken}`;\n        }\n        if (this.appCheckToken) {\n          options.headers['X-Firebase-AppCheck'] = this.appCheckToken;\n        }\n\n        // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n        const env = process['env'];\n        const proxy =\n          this.connURL.indexOf('wss://') === 0\n            ? env['HTTPS_PROXY'] || env['https_proxy']\n            : env['HTTP_PROXY'] || env['http_proxy'];\n\n        if (proxy) {\n          options['proxy'] = { origin: proxy };\n        }\n      }\n      this.mySock = new WebSocketImpl(this.connURL, [], options);\n    } catch (e) {\n      this.log_('Error instantiating WebSocket.');\n      const error = e.message || e.data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n      return;\n    }\n\n    this.mySock.onopen = () => {\n      this.log_('Websocket connected.');\n      this.everConnected_ = true;\n    };\n\n    this.mySock.onclose = () => {\n      this.log_('Websocket connection was disconnected.');\n      this.mySock = null;\n      this.onClosed_();\n    };\n\n    this.mySock.onmessage = m => {\n      this.handleIncomingFrame(m as {});\n    };\n\n    this.mySock.onerror = e => {\n      this.log_('WebSocket error.  Closing connection.');\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const error = (e as any).message || (e as any).data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n    };\n  }\n\n  /**\n   * No-op for websockets, we don't need to do anything once the connection is confirmed as open\n   */\n  start() {}\n\n  static forceDisallow_: boolean;\n\n  static forceDisallow() {\n    WebSocketConnection.forceDisallow_ = true;\n  }\n\n  static isAvailable(): boolean {\n    let isOldAndroid = false;\n    if (typeof navigator !== 'undefined' && navigator.userAgent) {\n      const oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\n      const oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\n      if (oldAndroidMatch && oldAndroidMatch.length > 1) {\n        if (parseFloat(oldAndroidMatch[1]) < 4.4) {\n          isOldAndroid = true;\n        }\n      }\n    }\n\n    return (\n      !isOldAndroid &&\n      WebSocketImpl !== null &&\n      !WebSocketConnection.forceDisallow_\n    );\n  }\n\n  /**\n   * Number of response before we consider the connection \"healthy.\"\n   */\n  static responsesRequiredToBeHealthy = 2;\n\n  /**\n   * Time to wait for the connection te become healthy before giving up.\n   */\n  static healthyTimeout = 30000;\n\n  /**\n   * Returns true if we previously failed to connect with this transport.\n   */\n  static previouslyFailed(): boolean {\n    // If our persistent storage is actually only in-memory storage,\n    // we default to assuming that it previously failed to be safe.\n    return (\n      PersistentStorage.isInMemoryStorage ||\n      PersistentStorage.get('previous_websocket_failure') === true\n    );\n  }\n\n  markConnectionHealthy() {\n    PersistentStorage.remove('previous_websocket_failure');\n  }\n\n  private appendFrame_(data: string) {\n    this.frames.push(data);\n    if (this.frames.length === this.totalFrames) {\n      const fullMess = this.frames.join('');\n      this.frames = null;\n      const jsonMess = jsonEval(fullMess) as object;\n\n      //handle the message\n      this.onMessage(jsonMess);\n    }\n  }\n\n  /**\n   * @param frameCount - The number of frames we are expecting from the server\n   */\n  private handleNewFrameCount_(frameCount: number) {\n    this.totalFrames = frameCount;\n    this.frames = [];\n  }\n\n  /**\n   * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\n   * @returns Any remaining data to be process, or null if there is none\n   */\n  private extractFrameCount_(data: string): string | null {\n    assert(this.frames === null, 'We already have a frame buffer');\n    // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\n    // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\n    if (data.length <= 6) {\n      const frameCount = Number(data);\n      if (!isNaN(frameCount)) {\n        this.handleNewFrameCount_(frameCount);\n        return null;\n      }\n    }\n    this.handleNewFrameCount_(1);\n    return data;\n  }\n\n  /**\n   * Process a websocket frame that has arrived from the server.\n   * @param mess - The frame data\n   */\n  handleIncomingFrame(mess: { [k: string]: unknown }) {\n    if (this.mySock === null) {\n      return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\n    }\n    const data = mess['data'] as string;\n    this.bytesReceived += data.length;\n    this.stats_.incrementCounter('bytes_received', data.length);\n\n    this.resetKeepAlive();\n\n    if (this.frames !== null) {\n      // we're buffering\n      this.appendFrame_(data);\n    } else {\n      // try to parse out a frame count, otherwise, assume 1 and process it\n      const remainingData = this.extractFrameCount_(data);\n      if (remainingData !== null) {\n        this.appendFrame_(remainingData);\n      }\n    }\n  }\n\n  /**\n   * Send a message to the server\n   * @param data - The JSON object to transmit\n   */\n  send(data: {}) {\n    this.resetKeepAlive();\n\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //We can only fit a certain amount in each websocket frame, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n\n    const dataSegs = splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n\n    //Send the length header\n    if (dataSegs.length > 1) {\n      this.sendString_(String(dataSegs.length));\n    }\n\n    //Send the actual data in segments.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.sendString_(dataSegs[i]);\n    }\n  }\n\n  private shutdown_() {\n    this.isClosed_ = true;\n    if (this.keepaliveTimer) {\n      clearInterval(this.keepaliveTimer);\n      this.keepaliveTimer = null;\n    }\n\n    if (this.mySock) {\n      this.mySock.close();\n      this.mySock = null;\n    }\n  }\n\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is closing itself');\n      this.shutdown_();\n\n      // since this is an internal close, trigger the close listener\n      if (this.onDisconnect) {\n        this.onDisconnect(this.everConnected_);\n        this.onDisconnect = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler.\n   * Close the websocket and kill the connection.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is being closed');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\n   * the last activity.\n   */\n  resetKeepAlive() {\n    clearInterval(this.keepaliveTimer);\n    this.keepaliveTimer = setInterval(() => {\n      //If there has been no websocket activity for a while, send a no-op\n      if (this.mySock) {\n        this.sendString_('0');\n      }\n      this.resetKeepAlive();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL)) as any;\n  }\n\n  /**\n   * Send a string over the websocket.\n   *\n   * @param str - String to send.\n   */\n  private sendString_(str: string) {\n    // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\n    // calls for some unknown reason.  We treat these as an error and disconnect.\n    // See https://app.asana.com/0/58926111402292/68021340250410\n    try {\n      this.mySock.send(str);\n    } catch (e) {\n      this.log_(\n        'Exception thrown from WebSocket.send():',\n        e.message || e.data,\n        'Closing connection.'\n      );\n      setTimeout(this.onClosed_.bind(this), 0);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../core/RepoInfo';\nimport { warn } from '../core/util/util';\n\nimport { BrowserPollConnection } from './BrowserPollConnection';\nimport { TransportConstructor } from './Transport';\nimport { WebSocketConnection } from './WebSocketConnection';\n\n/**\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\n * lifecycle.\n *\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\n * they are available.\n */\nexport class TransportManager {\n  private transports_: TransportConstructor[];\n\n  // Keeps track of whether the TransportManager has already chosen a transport to use\n  static globalTransportInitialized_ = false;\n\n  static get ALL_TRANSPORTS() {\n    return [BrowserPollConnection, WebSocketConnection];\n  }\n\n  /**\n   * Returns whether transport has been selected to ensure WebSocketConnection or BrowserPollConnection are not called after\n   * TransportManager has already set up transports_\n   */\n  static get IS_TRANSPORT_INITIALIZED() {\n    return this.globalTransportInitialized_;\n  }\n\n  /**\n   * @param repoInfo - Metadata around the namespace we're connecting to\n   */\n  constructor(repoInfo: RepoInfo) {\n    this.initTransports_(repoInfo);\n  }\n\n  private initTransports_(repoInfo: RepoInfo) {\n    const isWebSocketsAvailable: boolean =\n      WebSocketConnection && WebSocketConnection['isAvailable']();\n    let isSkipPollConnection =\n      isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\n\n    if (repoInfo.webSocketOnly) {\n      if (!isWebSocketsAvailable) {\n        warn(\n          \"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\"\n        );\n      }\n\n      isSkipPollConnection = true;\n    }\n\n    if (isSkipPollConnection) {\n      this.transports_ = [WebSocketConnection];\n    } else {\n      const transports = (this.transports_ = [] as TransportConstructor[]);\n      for (const transport of TransportManager.ALL_TRANSPORTS) {\n        if (transport && transport['isAvailable']()) {\n          transports.push(transport);\n        }\n      }\n      TransportManager.globalTransportInitialized_ = true;\n    }\n  }\n\n  /**\n   * @returns The constructor for the initial transport to use\n   */\n  initialTransport(): TransportConstructor {\n    if (this.transports_.length > 0) {\n      return this.transports_[0];\n    } else {\n      throw new Error('No transports available');\n    }\n  }\n\n  /**\n   * @returns The constructor for the next transport, or null\n   */\n  upgradeTransport(): TransportConstructor | null {\n    if (this.transports_.length > 1) {\n      return this.transports_[1];\n    } else {\n      return null;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../core/RepoInfo';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { Indexable } from '../core/util/misc';\nimport {\n  error,\n  logWrapper,\n  requireKey,\n  setTimeoutNonBlocking,\n  warn\n} from '../core/util/util';\n\nimport { PROTOCOL_VERSION } from './Constants';\nimport { Transport, TransportConstructor } from './Transport';\nimport { TransportManager } from './TransportManager';\n\n// Abort upgrade attempt if it takes longer than 60s.\nconst UPGRADE_TIMEOUT = 60000;\n\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\nconst DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\n\n// If the initial data sent triggers a lot of bandwidth (i.e. it's a large put or a listen for a large amount of data)\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\n// but we've sent/received enough bytes, we don't cancel the connection.\nconst BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\nconst BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\n\nconst enum RealtimeState {\n  CONNECTING,\n  CONNECTED,\n  DISCONNECTED\n}\n\nconst MESSAGE_TYPE = 't';\nconst MESSAGE_DATA = 'd';\nconst CONTROL_SHUTDOWN = 's';\nconst CONTROL_RESET = 'r';\nconst CONTROL_ERROR = 'e';\nconst CONTROL_PONG = 'o';\nconst SWITCH_ACK = 'a';\nconst END_TRANSMISSION = 'n';\nconst PING = 'p';\n\nconst SERVER_HELLO = 'h';\n\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n */\nexport class Connection {\n  connectionCount = 0;\n  pendingDataMessages: unknown[] = [];\n  sessionId: string;\n\n  private conn_: Transport;\n  private healthyTimeout_: number;\n  private isHealthy_: boolean;\n  private log_: (...args: unknown[]) => void;\n  private primaryResponsesRequired_: number;\n  private rx_: Transport;\n  private secondaryConn_: Transport;\n  private secondaryResponsesRequired_: number;\n  private state_ = RealtimeState.CONNECTING;\n  private transportManager_: TransportManager;\n  private tx_: Transport;\n\n  /**\n   * @param id - an id for this connection\n   * @param repoInfo_ - the info for the endpoint to connect to\n   * @param applicationId_ - the Firebase App ID for this project\n   * @param appCheckToken_ - The App Check Token for this device.\n   * @param authToken_ - The auth token for this session.\n   * @param onMessage_ - the callback to be triggered when a server-push message arrives\n   * @param onReady_ - the callback to be triggered when this connection is ready to send messages.\n   * @param onDisconnect_ - the callback to be triggered when a connection was lost\n   * @param onKill_ - the callback to be triggered when this connection has permanently shut down.\n   * @param lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n   */\n  constructor(\n    public id: string,\n    private repoInfo_: RepoInfo,\n    private applicationId_: string | undefined,\n    private appCheckToken_: string | undefined,\n    private authToken_: string | undefined,\n    private onMessage_: (a: {}) => void,\n    private onReady_: (a: number, b: string) => void,\n    private onDisconnect_: () => void,\n    private onKill_: (a: string) => void,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper('c:' + this.id + ':');\n    this.transportManager_ = new TransportManager(repoInfo_);\n    this.log_('Connection created');\n    this.start_();\n  }\n\n  /**\n   * Starts a connection attempt\n   */\n  private start_(): void {\n    const conn = this.transportManager_.initialTransport();\n    this.conn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      this.applicationId_,\n      this.appCheckToken_,\n      this.authToken_,\n      null,\n      this.lastSessionId\n    );\n\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessageReceived = this.connReceiver_(this.conn_);\n    const onConnectionLost = this.disconnReceiver_(this.conn_);\n    this.tx_ = this.conn_;\n    this.rx_ = this.conn_;\n    this.secondaryConn_ = null;\n    this.isHealthy_ = false;\n\n    /*\n     * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n     * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n     * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n     * still have the context of your originating frame.\n     */\n    setTimeout(() => {\n      // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n      this.conn_ && this.conn_.open(onMessageReceived, onConnectionLost);\n    }, Math.floor(0));\n\n    const healthyTimeoutMS = conn['healthyTimeout'] || 0;\n    if (healthyTimeoutMS > 0) {\n      this.healthyTimeout_ = setTimeoutNonBlocking(() => {\n        this.healthyTimeout_ = null;\n        if (!this.isHealthy_) {\n          if (\n            this.conn_ &&\n            this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has received ' +\n                this.conn_.bytesReceived +\n                ' bytes.  Marking connection healthy.'\n            );\n            this.isHealthy_ = true;\n            this.conn_.markConnectionHealthy();\n          } else if (\n            this.conn_ &&\n            this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has sent ' +\n                this.conn_.bytesSent +\n                ' bytes.  Leaving connection alive.'\n            );\n            // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\n            // the server.\n          } else {\n            this.log_('Closing unhealthy connection after timeout.');\n            this.close();\n          }\n        }\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      }, Math.floor(healthyTimeoutMS)) as any;\n    }\n  }\n\n  private nextTransportId_(): string {\n    return 'c:' + this.id + ':' + this.connectionCount++;\n  }\n\n  private disconnReceiver_(conn) {\n    return everConnected => {\n      if (conn === this.conn_) {\n        this.onConnectionLost_(everConnected);\n      } else if (conn === this.secondaryConn_) {\n        this.log_('Secondary connection lost.');\n        this.onSecondaryConnectionLost_();\n      } else {\n        this.log_('closing an old connection');\n      }\n    };\n  }\n\n  private connReceiver_(conn: Transport) {\n    return (message: Indexable) => {\n      if (this.state_ !== RealtimeState.DISCONNECTED) {\n        if (conn === this.rx_) {\n          this.onPrimaryMessageReceived_(message);\n        } else if (conn === this.secondaryConn_) {\n          this.onSecondaryMessageReceived_(message);\n        } else {\n          this.log_('message on old connection');\n        }\n      }\n    };\n  }\n\n  /**\n   * @param dataMsg - An arbitrary data message to be sent to the server\n   */\n  sendRequest(dataMsg: object) {\n    // wrap in a data message envelope and send it on\n    const msg = { t: 'd', d: dataMsg };\n    this.sendData_(msg);\n  }\n\n  tryCleanupConnection() {\n    if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n      this.log_(\n        'cleaning up and promoting a connection: ' + this.secondaryConn_.connId\n      );\n      this.conn_ = this.secondaryConn_;\n      this.secondaryConn_ = null;\n      // the server will shutdown the old connection\n    }\n  }\n\n  private onSecondaryControl_(controlData: { [k: string]: unknown }) {\n    if (MESSAGE_TYPE in controlData) {\n      const cmd = controlData[MESSAGE_TYPE] as string;\n      if (cmd === SWITCH_ACK) {\n        this.upgradeIfSecondaryHealthy_();\n      } else if (cmd === CONTROL_RESET) {\n        // Most likely the session wasn't valid. Abandon the switch attempt\n        this.log_('Got a reset on secondary, closing it');\n        this.secondaryConn_.close();\n        // If we were already using this connection for something, than we need to fully close\n        if (\n          this.tx_ === this.secondaryConn_ ||\n          this.rx_ === this.secondaryConn_\n        ) {\n          this.close();\n        }\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on secondary.');\n        this.secondaryResponsesRequired_--;\n        this.upgradeIfSecondaryHealthy_();\n      }\n    }\n  }\n\n  private onSecondaryMessageReceived_(parsedData: Indexable) {\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onSecondaryControl_(data as Indexable);\n    } else if (layer === 'd') {\n      // got a data message, but we're still second connection. Need to buffer it up\n      this.pendingDataMessages.push(data);\n    } else {\n      throw new Error('Unknown protocol layer: ' + layer);\n    }\n  }\n\n  private upgradeIfSecondaryHealthy_() {\n    if (this.secondaryResponsesRequired_ <= 0) {\n      this.log_('Secondary connection is healthy.');\n      this.isHealthy_ = true;\n      this.secondaryConn_.markConnectionHealthy();\n      this.proceedWithUpgrade_();\n    } else {\n      // Send a ping to make sure the connection is healthy.\n      this.log_('sending ping on secondary.');\n      this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private proceedWithUpgrade_() {\n    // tell this connection to consider itself open\n    this.secondaryConn_.start();\n    // send ack\n    this.log_('sending client ack on secondary');\n    this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\n\n    // send end packet on primary transport, switch to sending on this one\n    // can receive on this one, buffer responses until end received on primary transport\n    this.log_('Ending transmission on primary');\n    this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\n    this.tx_ = this.secondaryConn_;\n\n    this.tryCleanupConnection();\n  }\n\n  private onPrimaryMessageReceived_(parsedData: { [k: string]: unknown }) {\n    // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onControl_(data as { [k: string]: unknown });\n    } else if (layer === 'd') {\n      this.onDataMessage_(data);\n    }\n  }\n\n  private onDataMessage_(message: unknown) {\n    this.onPrimaryResponse_();\n\n    // We don't do anything with data messages, just kick them up a level\n    this.onMessage_(message);\n  }\n\n  private onPrimaryResponse_() {\n    if (!this.isHealthy_) {\n      this.primaryResponsesRequired_--;\n      if (this.primaryResponsesRequired_ <= 0) {\n        this.log_('Primary connection is healthy.');\n        this.isHealthy_ = true;\n        this.conn_.markConnectionHealthy();\n      }\n    }\n  }\n\n  private onControl_(controlData: { [k: string]: unknown }) {\n    const cmd: string = requireKey(MESSAGE_TYPE, controlData) as string;\n    if (MESSAGE_DATA in controlData) {\n      const payload = controlData[MESSAGE_DATA];\n      if (cmd === SERVER_HELLO) {\n        const handshakePayload = {\n          ...(payload as {\n            ts: number;\n            v: string;\n            h: string;\n            s: string;\n          })\n        };\n        if (this.repoInfo_.isUsingEmulator) {\n          // Upon connecting, the emulator will pass the hostname that it's aware of, but we prefer the user's set hostname via `connectDatabaseEmulator` over what the emulator passes.\n          handshakePayload.h = this.repoInfo_.host;\n        }\n        this.onHandshake_(handshakePayload);\n      } else if (cmd === END_TRANSMISSION) {\n        this.log_('recvd end transmission on primary');\n        this.rx_ = this.secondaryConn_;\n        for (let i = 0; i < this.pendingDataMessages.length; ++i) {\n          this.onDataMessage_(this.pendingDataMessages[i]);\n        }\n        this.pendingDataMessages = [];\n        this.tryCleanupConnection();\n      } else if (cmd === CONTROL_SHUTDOWN) {\n        // This was previously the 'onKill' callback passed to the lower-level connection\n        // payload in this case is the reason for the shutdown. Generally a human-readable error\n        this.onConnectionShutdown_(payload as string);\n      } else if (cmd === CONTROL_RESET) {\n        // payload in this case is the host we should contact\n        this.onReset_(payload as string);\n      } else if (cmd === CONTROL_ERROR) {\n        error('Server Error: ' + payload);\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on primary.');\n        this.onPrimaryResponse_();\n        this.sendPingOnPrimaryIfNecessary_();\n      } else {\n        error('Unknown control packet command: ' + cmd);\n      }\n    }\n  }\n\n  /**\n   * @param handshake - The handshake data returned from the server\n   */\n  private onHandshake_(handshake: {\n    ts: number;\n    v: string;\n    h: string;\n    s: string;\n  }): void {\n    const timestamp = handshake.ts;\n    const version = handshake.v;\n    const host = handshake.h;\n    this.sessionId = handshake.s;\n    this.repoInfo_.host = host;\n    // if we've already closed the connection, then don't bother trying to progress further\n    if (this.state_ === RealtimeState.CONNECTING) {\n      this.conn_.start();\n      this.onConnectionEstablished_(this.conn_, timestamp);\n      if (PROTOCOL_VERSION !== version) {\n        warn('Protocol version mismatch detected');\n      }\n      // TODO: do we want to upgrade? when? maybe a delay?\n      this.tryStartUpgrade_();\n    }\n  }\n\n  private tryStartUpgrade_() {\n    const conn = this.transportManager_.upgradeTransport();\n    if (conn) {\n      this.startUpgrade_(conn);\n    }\n  }\n\n  private startUpgrade_(conn: TransportConstructor) {\n    this.secondaryConn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      this.applicationId_,\n      this.appCheckToken_,\n      this.authToken_,\n      this.sessionId\n    );\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.secondaryResponsesRequired_ =\n      conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessage = this.connReceiver_(this.secondaryConn_);\n    const onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n    this.secondaryConn_.open(onMessage, onDisconnect);\n\n    // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n    setTimeoutNonBlocking(() => {\n      if (this.secondaryConn_) {\n        this.log_('Timed out trying to upgrade.');\n        this.secondaryConn_.close();\n      }\n    }, Math.floor(UPGRADE_TIMEOUT));\n  }\n\n  private onReset_(host: string) {\n    this.log_('Reset packet received.  New host: ' + host);\n    this.repoInfo_.host = host;\n    // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n    // We don't currently support resets after the connection has already been established\n    if (this.state_ === RealtimeState.CONNECTED) {\n      this.close();\n    } else {\n      // Close whatever connections we have open and start again.\n      this.closeConnections_();\n      this.start_();\n    }\n  }\n\n  private onConnectionEstablished_(conn: Transport, timestamp: number) {\n    this.log_('Realtime connection established.');\n    this.conn_ = conn;\n    this.state_ = RealtimeState.CONNECTED;\n\n    if (this.onReady_) {\n      this.onReady_(timestamp, this.sessionId);\n      this.onReady_ = null;\n    }\n\n    // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n    // send some pings.\n    if (this.primaryResponsesRequired_ === 0) {\n      this.log_('Primary connection is healthy.');\n      this.isHealthy_ = true;\n    } else {\n      setTimeoutNonBlocking(() => {\n        this.sendPingOnPrimaryIfNecessary_();\n      }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n    }\n  }\n\n  private sendPingOnPrimaryIfNecessary_() {\n    // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n    if (!this.isHealthy_ && this.state_ === RealtimeState.CONNECTED) {\n      this.log_('sending ping on primary.');\n      this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private onSecondaryConnectionLost_() {\n    const conn = this.secondaryConn_;\n    this.secondaryConn_ = null;\n    if (this.tx_ === conn || this.rx_ === conn) {\n      // we are relying on this connection already in some capacity. Therefore, a failure is real\n      this.close();\n    }\n  }\n\n  /**\n   * @param everConnected - Whether or not the connection ever reached a server. Used to determine if\n   * we should flush the host cache\n   */\n  private onConnectionLost_(everConnected: boolean) {\n    this.conn_ = null;\n\n    // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n    // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\n    if (!everConnected && this.state_ === RealtimeState.CONNECTING) {\n      this.log_('Realtime connection failed.');\n      // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n      if (this.repoInfo_.isCacheableHost()) {\n        PersistentStorage.remove('host:' + this.repoInfo_.host);\n        // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\n        this.repoInfo_.internalHost = this.repoInfo_.host;\n      }\n    } else if (this.state_ === RealtimeState.CONNECTED) {\n      this.log_('Realtime connection lost.');\n    }\n\n    this.close();\n  }\n\n  private onConnectionShutdown_(reason: string) {\n    this.log_('Connection shutdown command received. Shutting down...');\n\n    if (this.onKill_) {\n      this.onKill_(reason);\n      this.onKill_ = null;\n    }\n\n    // We intentionally don't want to fire onDisconnect (kill is a different case),\n    // so clear the callback.\n    this.onDisconnect_ = null;\n\n    this.close();\n  }\n\n  private sendData_(data: object) {\n    if (this.state_ !== RealtimeState.CONNECTED) {\n      throw 'Connection is not connected';\n    } else {\n      this.tx_.send(data);\n    }\n  }\n\n  /**\n   * Cleans up this connection, calling the appropriate callbacks\n   */\n  close() {\n    if (this.state_ !== RealtimeState.DISCONNECTED) {\n      this.log_('Closing realtime connection.');\n      this.state_ = RealtimeState.DISCONNECTED;\n\n      this.closeConnections_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_();\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  private closeConnections_() {\n    this.log_('Shutting down all connections');\n    if (this.conn_) {\n      this.conn_.close();\n      this.conn_ = null;\n    }\n\n    if (this.secondaryConn_) {\n      this.secondaryConn_.close();\n      this.secondaryConn_ = null;\n    }\n\n    if (this.healthyTimeout_) {\n      clearTimeout(this.healthyTimeout_);\n      this.healthyTimeout_ = null;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { QueryContext } from './view/EventRegistration';\n\n/**\n * Interface defining the set of actions that can be performed against the Firebase server\n * (basically corresponds to our wire protocol).\n *\n * @interface\n */\nexport abstract class ServerActions {\n  abstract listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ): void;\n\n  /**\n   * Remove a listen.\n   */\n  abstract unlisten(query: QueryContext, tag: number | null): void;\n\n  /**\n   * Get the server value satisfying this query.\n   */\n  abstract get(query: QueryContext): Promise<string>;\n\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {}\n\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {}\n\n  /**\n   * Refreshes the auth token for the current connection.\n   * @param token - The authentication token\n   */\n  refreshAuthToken(token: string) {}\n\n  /**\n   * Refreshes the app check token for the current connection.\n   * @param token The app check token\n   */\n  refreshAppCheckToken(token: string) {}\n\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  reportStats(stats: { [k: string]: unknown }) {}\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\n/**\n * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nexport abstract class EventEmitter {\n  private listeners_: {\n    [eventType: string]: Array<{\n      callback(...args: unknown[]): void;\n      context: unknown;\n    }>;\n  } = {};\n\n  constructor(private allowedEvents_: string[]) {\n    assert(\n      Array.isArray(allowedEvents_) && allowedEvents_.length > 0,\n      'Requires a non-empty array'\n    );\n  }\n\n  /**\n   * To be overridden by derived classes in order to fire an initial event when\n   * somebody subscribes for data.\n   *\n   * @returns {Array.<*>} Array of parameters to trigger initial event with.\n   */\n  abstract getInitialEvent(eventType: string): unknown[];\n\n  /**\n   * To be called by derived classes to trigger events.\n   */\n  protected trigger(eventType: string, ...varArgs: unknown[]) {\n    if (Array.isArray(this.listeners_[eventType])) {\n      // Clone the list, since callbacks could add/remove listeners.\n      const listeners = [...this.listeners_[eventType]];\n\n      for (let i = 0; i < listeners.length; i++) {\n        listeners[i].callback.apply(listeners[i].context, varArgs);\n      }\n    }\n  }\n\n  on(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    this.listeners_[eventType] = this.listeners_[eventType] || [];\n    this.listeners_[eventType].push({ callback, context });\n\n    const eventData = this.getInitialEvent(eventType);\n    if (eventData) {\n      callback.apply(context, eventData);\n    }\n  }\n\n  off(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    const listeners = this.listeners_[eventType] || [];\n    for (let i = 0; i < listeners.length; i++) {\n      if (\n        listeners[i].callback === callback &&\n        (!context || context === listeners[i].context)\n      ) {\n        listeners.splice(i, 1);\n        return;\n      }\n    }\n  }\n\n  private validateEventType_(eventType: string) {\n    assert(\n      this.allowedEvents_.find(et => {\n        return et === eventType;\n      }),\n      'Unknown event: ' + eventType\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, isMobileCordova } from '@firebase/util';\n\nimport { EventEmitter } from './EventEmitter';\n\n/**\n * Monitors online state (as reported by window.online/offline events).\n *\n * The expectation is that this could have many false positives (thinks we are online\n * when we're not), but no false negatives.  So we can safely use it to determine when\n * we definitely cannot reach the internet.\n */\nexport class OnlineMonitor extends EventEmitter {\n  private online_ = true;\n\n  static getInstance() {\n    return new OnlineMonitor();\n  }\n\n  constructor() {\n    super(['online']);\n\n    // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\n    // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\n    // It would seem that the 'online' event does not always fire consistently. So we disable it\n    // for Cordova.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window.addEventListener !== 'undefined' &&\n      !isMobileCordova()\n    ) {\n      window.addEventListener(\n        'online',\n        () => {\n          if (!this.online_) {\n            this.online_ = true;\n            this.trigger('online', true);\n          }\n        },\n        false\n      );\n\n      window.addEventListener(\n        'offline',\n        () => {\n          if (this.online_) {\n            this.online_ = false;\n            this.trigger('online', false);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'online', 'Unknown event type: ' + eventType);\n    return [this.online_];\n  }\n\n  currentlyOnline(): boolean {\n    return this.online_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { stringLength } from '@firebase/util';\n\nimport { nameCompare } from './util';\n\n/** Maximum key depth. */\nconst MAX_PATH_DEPTH = 32;\n\n/** Maximum number of (UTF8) bytes in a Firebase path. */\nconst MAX_PATH_LENGTH_BYTES = 768;\n\n/**\n * An immutable object representing a parsed path.  It's immutable so that you\n * can pass them around to other functions without worrying about them changing\n * it.\n */\n\nexport class Path {\n  pieces_: string[];\n  pieceNum_: number;\n\n  /**\n   * @param pathOrString - Path string to parse, or another path, or the raw\n   * tokens array\n   */\n  constructor(pathOrString: string | string[], pieceNum?: number) {\n    if (pieceNum === void 0) {\n      this.pieces_ = (pathOrString as string).split('/');\n\n      // Remove empty pieces.\n      let copyTo = 0;\n      for (let i = 0; i < this.pieces_.length; i++) {\n        if (this.pieces_[i].length > 0) {\n          this.pieces_[copyTo] = this.pieces_[i];\n          copyTo++;\n        }\n      }\n      this.pieces_.length = copyTo;\n\n      this.pieceNum_ = 0;\n    } else {\n      this.pieces_ = pathOrString as string[];\n      this.pieceNum_ = pieceNum;\n    }\n  }\n\n  toString(): string {\n    let pathString = '';\n    for (let i = this.pieceNum_; i < this.pieces_.length; i++) {\n      if (this.pieces_[i] !== '') {\n        pathString += '/' + this.pieces_[i];\n      }\n    }\n\n    return pathString || '/';\n  }\n}\n\nexport function newEmptyPath(): Path {\n  return new Path('');\n}\n\nexport function pathGetFront(path: Path): string | null {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n\n  return path.pieces_[path.pieceNum_];\n}\n\n/**\n * @returns The number of segments in this path\n */\nexport function pathGetLength(path: Path): number {\n  return path.pieces_.length - path.pieceNum_;\n}\n\nexport function pathPopFront(path: Path): Path {\n  let pieceNum = path.pieceNum_;\n  if (pieceNum < path.pieces_.length) {\n    pieceNum++;\n  }\n  return new Path(path.pieces_, pieceNum);\n}\n\nexport function pathGetBack(path: Path): string | null {\n  if (path.pieceNum_ < path.pieces_.length) {\n    return path.pieces_[path.pieces_.length - 1];\n  }\n\n  return null;\n}\n\nexport function pathToUrlEncodedString(path: Path): string {\n  let pathString = '';\n  for (let i = path.pieceNum_; i < path.pieces_.length; i++) {\n    if (path.pieces_[i] !== '') {\n      pathString += '/' + encodeURIComponent(String(path.pieces_[i]));\n    }\n  }\n\n  return pathString || '/';\n}\n\n/**\n * Shallow copy of the parts of the path.\n *\n */\nexport function pathSlice(path: Path, begin: number = 0): string[] {\n  return path.pieces_.slice(path.pieceNum_ + begin);\n}\n\nexport function pathParent(path: Path): Path | null {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length - 1; i++) {\n    pieces.push(path.pieces_[i]);\n  }\n\n  return new Path(pieces, 0);\n}\n\nexport function pathChild(path: Path, childPathObj: string | Path): Path {\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length; i++) {\n    pieces.push(path.pieces_[i]);\n  }\n\n  if (childPathObj instanceof Path) {\n    for (let i = childPathObj.pieceNum_; i < childPathObj.pieces_.length; i++) {\n      pieces.push(childPathObj.pieces_[i]);\n    }\n  } else {\n    const childPieces = childPathObj.split('/');\n    for (let i = 0; i < childPieces.length; i++) {\n      if (childPieces[i].length > 0) {\n        pieces.push(childPieces[i]);\n      }\n    }\n  }\n\n  return new Path(pieces, 0);\n}\n\n/**\n * @returns True if there are no segments in this path\n */\nexport function pathIsEmpty(path: Path): boolean {\n  return path.pieceNum_ >= path.pieces_.length;\n}\n\n/**\n * @returns The path from outerPath to innerPath\n */\nexport function newRelativePath(outerPath: Path, innerPath: Path): Path {\n  const outer = pathGetFront(outerPath),\n    inner = pathGetFront(innerPath);\n  if (outer === null) {\n    return innerPath;\n  } else if (outer === inner) {\n    return newRelativePath(pathPopFront(outerPath), pathPopFront(innerPath));\n  } else {\n    throw new Error(\n      'INTERNAL ERROR: innerPath (' +\n        innerPath +\n        ') is not within ' +\n        'outerPath (' +\n        outerPath +\n        ')'\n    );\n  }\n}\n\n/**\n * @returns -1, 0, 1 if left is less, equal, or greater than the right.\n */\nexport function pathCompare(left: Path, right: Path): number {\n  const leftKeys = pathSlice(left, 0);\n  const rightKeys = pathSlice(right, 0);\n  for (let i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\n    const cmp = nameCompare(leftKeys[i], rightKeys[i]);\n    if (cmp !== 0) {\n      return cmp;\n    }\n  }\n  if (leftKeys.length === rightKeys.length) {\n    return 0;\n  }\n  return leftKeys.length < rightKeys.length ? -1 : 1;\n}\n\n/**\n * @returns true if paths are the same.\n */\nexport function pathEquals(path: Path, other: Path): boolean {\n  if (pathGetLength(path) !== pathGetLength(other)) {\n    return false;\n  }\n\n  for (\n    let i = path.pieceNum_, j = other.pieceNum_;\n    i <= path.pieces_.length;\n    i++, j++\n  ) {\n    if (path.pieces_[i] !== other.pieces_[j]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * @returns True if this path is a parent of (or the same as) other\n */\nexport function pathContains(path: Path, other: Path): boolean {\n  let i = path.pieceNum_;\n  let j = other.pieceNum_;\n  if (pathGetLength(path) > pathGetLength(other)) {\n    return false;\n  }\n  while (i < path.pieces_.length) {\n    if (path.pieces_[i] !== other.pieces_[j]) {\n      return false;\n    }\n    ++i;\n    ++j;\n  }\n  return true;\n}\n\n/**\n * Dynamic (mutable) path used to count path lengths.\n *\n * This class is used to efficiently check paths for valid\n * length (in UTF8 bytes) and depth (used in path validation).\n *\n * Throws Error exception if path is ever invalid.\n *\n * The definition of a path always begins with '/'.\n */\nexport class ValidationPath {\n  parts_: string[];\n  /** Initialize to number of '/' chars needed in path. */\n  byteLength_: number;\n\n  /**\n   * @param path - Initial Path.\n   * @param errorPrefix_ - Prefix for any error messages.\n   */\n  constructor(path: Path, public errorPrefix_: string) {\n    this.parts_ = pathSlice(path, 0);\n    /** Initialize to number of '/' chars needed in path. */\n    this.byteLength_ = Math.max(1, this.parts_.length);\n\n    for (let i = 0; i < this.parts_.length; i++) {\n      this.byteLength_ += stringLength(this.parts_[i]);\n    }\n    validationPathCheckValid(this);\n  }\n}\n\nexport function validationPathPush(\n  validationPath: ValidationPath,\n  child: string\n): void {\n  // Count the needed '/'\n  if (validationPath.parts_.length > 0) {\n    validationPath.byteLength_ += 1;\n  }\n  validationPath.parts_.push(child);\n  validationPath.byteLength_ += stringLength(child);\n  validationPathCheckValid(validationPath);\n}\n\nexport function validationPathPop(validationPath: ValidationPath): void {\n  const last = validationPath.parts_.pop();\n  validationPath.byteLength_ -= stringLength(last);\n  // Un-count the previous '/'\n  if (validationPath.parts_.length > 0) {\n    validationPath.byteLength_ -= 1;\n  }\n}\n\nfunction validationPathCheckValid(validationPath: ValidationPath): void {\n  if (validationPath.byteLength_ > MAX_PATH_LENGTH_BYTES) {\n    throw new Error(\n      validationPath.errorPrefix_ +\n        'has a key path longer than ' +\n        MAX_PATH_LENGTH_BYTES +\n        ' bytes (' +\n        validationPath.byteLength_ +\n        ').'\n    );\n  }\n  if (validationPath.parts_.length > MAX_PATH_DEPTH) {\n    throw new Error(\n      validationPath.errorPrefix_ +\n        'path specified exceeds the maximum depth that can be written (' +\n        MAX_PATH_DEPTH +\n        ') or object contains a cycle ' +\n        validationPathToErrorString(validationPath)\n    );\n  }\n}\n\n/**\n * String for use in error messages - uses '.' notation for path.\n */\nexport function validationPathToErrorString(\n  validationPath: ValidationPath\n): string {\n  if (validationPath.parts_.length === 0) {\n    return '';\n  }\n  return \"in property '\" + validationPath.parts_.join('.') + \"'\";\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { EventEmitter } from './EventEmitter';\n\ndeclare const document: Document;\n\nexport class VisibilityMonitor extends EventEmitter {\n  private visible_: boolean;\n\n  static getInstance() {\n    return new VisibilityMonitor();\n  }\n\n  constructor() {\n    super(['visible']);\n    let hidden: string;\n    let visibilityChange: string;\n    if (\n      typeof document !== 'undefined' &&\n      typeof document.addEventListener !== 'undefined'\n    ) {\n      if (typeof document['hidden'] !== 'undefined') {\n        // Opera 12.10 and Firefox 18 and later support\n        visibilityChange = 'visibilitychange';\n        hidden = 'hidden';\n      } else if (typeof document['mozHidden'] !== 'undefined') {\n        visibilityChange = 'mozvisibilitychange';\n        hidden = 'mozHidden';\n      } else if (typeof document['msHidden'] !== 'undefined') {\n        visibilityChange = 'msvisibilitychange';\n        hidden = 'msHidden';\n      } else if (typeof document['webkitHidden'] !== 'undefined') {\n        visibilityChange = 'webkitvisibilitychange';\n        hidden = 'webkitHidden';\n      }\n    }\n\n    // Initially, we always assume we are visible. This ensures that in browsers\n    // without page visibility support or in cases where we are never visible\n    // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\n    // reconnects\n    this.visible_ = true;\n\n    if (visibilityChange) {\n      document.addEventListener(\n        visibilityChange,\n        () => {\n          const visible = !document[hidden];\n          if (visible !== this.visible_) {\n            this.visible_ = visible;\n            this.trigger('visible', visible);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n    return [this.visible_];\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  assert,\n  contains,\n  Deferred,\n  isEmpty,\n  isMobileCordova,\n  isNodeSdk,\n  isReactNative,\n  isValidFormat,\n  safeGet,\n  stringify,\n  isAdmin\n} from '@firebase/util';\n\nimport { Connection } from '../realtime/Connection';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { OnlineMonitor } from './util/OnlineMonitor';\nimport { Path } from './util/Path';\nimport { error, log, logWrapper, warn, ObjectToUniqueKey } from './util/util';\nimport { VisibilityMonitor } from './util/VisibilityMonitor';\nimport { SDK_VERSION } from './version';\nimport { QueryContext } from './view/EventRegistration';\n\nconst RECONNECT_MIN_DELAY = 1000;\nconst RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\nconst RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\nconst RECONNECT_DELAY_MULTIPLIER = 1.3;\nconst RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\nconst SERVER_KILL_INTERRUPT_REASON = 'server_kill';\n\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nconst INVALID_TOKEN_THRESHOLD = 3;\n\ninterface ListenSpec {\n  onComplete(s: string, p?: unknown): void;\n\n  hashFn(): string;\n\n  query: QueryContext;\n  tag: number | null;\n}\n\ninterface OnDisconnectRequest {\n  pathString: string;\n  action: string;\n  data: unknown;\n  onComplete?: (a: string, b: string) => void;\n}\n\ninterface OutstandingPut {\n  action: string;\n  request: object;\n  queued?: boolean;\n  onComplete: (a: string, b?: string) => void;\n}\n\ninterface OutstandingGet {\n  request: object;\n  onComplete: (response: { [k: string]: unknown }) => void;\n}\n\n/**\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\n *\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\n * in quotes to make sure the closure compiler does not minify them.\n */\nexport class PersistentConnection extends ServerActions {\n  // Used for diagnostic logging.\n  id = PersistentConnection.nextPersistentConnectionId_++;\n  private log_ = logWrapper('p:' + this.id + ':');\n\n  private interruptReasons_: { [reason: string]: boolean } = {};\n  private readonly listens: Map<\n    /* path */ string,\n    Map</* queryId */ string, ListenSpec>\n  > = new Map();\n  private outstandingPuts_: OutstandingPut[] = [];\n  private outstandingGets_: OutstandingGet[] = [];\n  private outstandingPutCount_ = 0;\n  private outstandingGetCount_ = 0;\n  private onDisconnectRequestQueue_: OnDisconnectRequest[] = [];\n  private connected_ = false;\n  private reconnectDelay_ = RECONNECT_MIN_DELAY;\n  private maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n  private securityDebugCallback_: ((a: object) => void) | null = null;\n  lastSessionId: string | null = null;\n\n  private establishConnectionTimer_: number | null = null;\n\n  private visible_: boolean = false;\n\n  // Before we get connected, we keep a queue of pending messages to send.\n  private requestCBHash_: { [k: number]: (a: unknown) => void } = {};\n  private requestNumber_ = 0;\n\n  private realtime_: {\n    sendRequest(a: object): void;\n    close(): void;\n  } | null = null;\n\n  private authToken_: string | null = null;\n  private appCheckToken_: string | null = null;\n  private forceTokenRefresh_ = false;\n  private invalidAuthTokenCount_ = 0;\n  private invalidAppCheckTokenCount_ = 0;\n\n  private firstConnection_ = true;\n  private lastConnectionAttemptTime_: number | null = null;\n  private lastConnectionEstablishedTime_: number | null = null;\n\n  private static nextPersistentConnectionId_ = 0;\n\n  /**\n   * Counter for number of connections created. Mainly used for tagging in the logs\n   */\n  private static nextConnectionId_ = 0;\n\n  /**\n   * @param repoInfo_ - Data about the namespace we are connecting to\n   * @param applicationId_ - The Firebase App ID for this project\n   * @param onDataUpdate_ - A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private applicationId_: string,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private onConnectStatus_: (a: boolean) => void,\n    private onServerInfoUpdate_: (a: unknown) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private appCheckTokenProvider_: AppCheckTokenProvider,\n    private authOverride_?: object | null\n  ) {\n    super();\n\n    if (authOverride_ && !isNodeSdk()) {\n      throw new Error(\n        'Auth override specified in options, but not supported on non Node.js platforms'\n      );\n    }\n\n    VisibilityMonitor.getInstance().on('visible', this.onVisible_, this);\n\n    if (repoInfo_.host.indexOf('fblocal') === -1) {\n      OnlineMonitor.getInstance().on('online', this.onOnline_, this);\n    }\n  }\n\n  protected sendRequest(\n    action: string,\n    body: unknown,\n    onResponse?: (a: unknown) => void\n  ) {\n    const curReqNum = ++this.requestNumber_;\n\n    const msg = { r: curReqNum, a: action, b: body };\n    this.log_(stringify(msg));\n    assert(\n      this.connected_,\n      \"sendRequest call when we're not connected not allowed.\"\n    );\n    this.realtime_.sendRequest(msg);\n    if (onResponse) {\n      this.requestCBHash_[curReqNum] = onResponse;\n    }\n  }\n\n  get(query: QueryContext): Promise<string> {\n    this.initConnection_();\n\n    const deferred = new Deferred<string>();\n    const request = {\n      p: query._path.toString(),\n      q: query._queryObject\n    };\n    const outstandingGet = {\n      action: 'g',\n      request,\n      onComplete: (message: { [k: string]: unknown }) => {\n        const payload = message['d'] as string;\n        if (message['s'] === 'ok') {\n          deferred.resolve(payload);\n        } else {\n          deferred.reject(payload);\n        }\n      }\n    };\n    this.outstandingGets_.push(outstandingGet);\n    this.outstandingGetCount_++;\n    const index = this.outstandingGets_.length - 1;\n\n    if (this.connected_) {\n      this.sendGet_(index);\n    }\n\n    return deferred.promise;\n  }\n\n  listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    this.initConnection_();\n\n    const queryId = query._queryIdentifier;\n    const pathString = query._path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + queryId);\n    if (!this.listens.has(pathString)) {\n      this.listens.set(pathString, new Map());\n    }\n    assert(\n      query._queryParams.isDefault() || !query._queryParams.loadsAllData(),\n      'listen() called for non-default but complete query'\n    );\n    assert(\n      !this.listens.get(pathString)!.has(queryId),\n      `listen() called twice for same path/queryId.`\n    );\n    const listenSpec: ListenSpec = {\n      onComplete,\n      hashFn: currentHashFn,\n      query,\n      tag\n    };\n    this.listens.get(pathString)!.set(queryId, listenSpec);\n\n    if (this.connected_) {\n      this.sendListen_(listenSpec);\n    }\n  }\n\n  private sendGet_(index: number) {\n    const get = this.outstandingGets_[index];\n    this.sendRequest('g', get.request, (message: { [k: string]: unknown }) => {\n      delete this.outstandingGets_[index];\n      this.outstandingGetCount_--;\n      if (this.outstandingGetCount_ === 0) {\n        this.outstandingGets_ = [];\n      }\n      if (get.onComplete) {\n        get.onComplete(message);\n      }\n    });\n  }\n\n  private sendListen_(listenSpec: ListenSpec) {\n    const query = listenSpec.query;\n    const pathString = query._path.toString();\n    const queryId = query._queryIdentifier;\n    this.log_('Listen on ' + pathString + ' for ' + queryId);\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n\n    const action = 'q';\n\n    // Only bother to send query if it's non-default.\n    if (listenSpec.tag) {\n      req['q'] = query._queryObject;\n      req['t'] = listenSpec.tag;\n    }\n\n    req[/*hash*/ 'h'] = listenSpec.hashFn();\n\n    this.sendRequest(action, req, (message: { [k: string]: unknown }) => {\n      const payload: unknown = message[/*data*/ 'd'];\n      const status = message[/*status*/ 's'] as string;\n\n      // print warnings in any case...\n      PersistentConnection.warnOnListenWarnings_(payload, query);\n\n      const currentListenSpec =\n        this.listens.get(pathString) &&\n        this.listens.get(pathString)!.get(queryId);\n      // only trigger actions if the listen hasn't been removed and readded\n      if (currentListenSpec === listenSpec) {\n        this.log_('listen response', message);\n\n        if (status !== 'ok') {\n          this.removeListen_(pathString, queryId);\n        }\n\n        if (listenSpec.onComplete) {\n          listenSpec.onComplete(status, payload);\n        }\n      }\n    });\n  }\n\n  private static warnOnListenWarnings_(payload: unknown, query: QueryContext) {\n    if (payload && typeof payload === 'object' && contains(payload, 'w')) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const warnings = safeGet(payload as any, 'w');\n      if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n        const indexSpec =\n          '\".indexOn\": \"' + query._queryParams.getIndex().toString() + '\"';\n        const indexPath = query._path.toString();\n        warn(\n          `Using an unspecified index. Your data will be downloaded and ` +\n            `filtered on the client. Consider adding ${indexSpec} at ` +\n            `${indexPath} to your security rules for better performance.`\n        );\n      }\n    }\n  }\n\n  refreshAuthToken(token: string) {\n    this.authToken_ = token;\n    this.log_('Auth token refreshed');\n    if (this.authToken_) {\n      this.tryAuth();\n    } else {\n      //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n      //the credential so we dont become authenticated next time we connect.\n      if (this.connected_) {\n        this.sendRequest('unauth', {}, () => {});\n      }\n    }\n\n    this.reduceReconnectDelayIfAdminCredential_(token);\n  }\n\n  private reduceReconnectDelayIfAdminCredential_(credential: string) {\n    // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n    // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n    const isFirebaseSecret = credential && credential.length === 40;\n    if (isFirebaseSecret || isAdmin(credential)) {\n      this.log_(\n        'Admin auth credential detected.  Reducing max reconnect time.'\n      );\n      this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n    }\n  }\n\n  refreshAppCheckToken(token: string | null) {\n    this.appCheckToken_ = token;\n    this.log_('App check token refreshed');\n    if (this.appCheckToken_) {\n      this.tryAppCheck();\n    } else {\n      //If we're connected we want to let the server know to unauthenticate us.\n      //If we're not connected, simply delete the credential so we dont become\n      // authenticated next time we connect.\n      if (this.connected_) {\n        this.sendRequest('unappeck', {}, () => {});\n      }\n    }\n  }\n\n  /**\n   * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n   * a auth revoked (the connection is closed).\n   */\n  tryAuth() {\n    if (this.connected_ && this.authToken_) {\n      const token = this.authToken_;\n      const authMethod = isValidFormat(token) ? 'auth' : 'gauth';\n      const requestData: { [k: string]: unknown } = { cred: token };\n      if (this.authOverride_ === null) {\n        requestData['noauth'] = true;\n      } else if (typeof this.authOverride_ === 'object') {\n        requestData['authvar'] = this.authOverride_;\n      }\n      this.sendRequest(\n        authMethod,\n        requestData,\n        (res: { [k: string]: unknown }) => {\n          const status = res[/*status*/ 's'] as string;\n          const data = (res[/*data*/ 'd'] as string) || 'error';\n\n          if (this.authToken_ === token) {\n            if (status === 'ok') {\n              this.invalidAuthTokenCount_ = 0;\n            } else {\n              // Triggers reconnect and force refresh for auth token\n              this.onAuthRevoked_(status, data);\n            }\n          }\n        }\n      );\n    }\n  }\n\n  /**\n   * Attempts to authenticate with the given token. If the authentication\n   * attempt fails, it's triggered like the token was revoked (the connection is\n   * closed).\n   */\n  tryAppCheck() {\n    if (this.connected_ && this.appCheckToken_) {\n      this.sendRequest(\n        'appcheck',\n        { 'token': this.appCheckToken_ },\n        (res: { [k: string]: unknown }) => {\n          const status = res[/*status*/ 's'] as string;\n          const data = (res[/*data*/ 'd'] as string) || 'error';\n          if (status === 'ok') {\n            this.invalidAppCheckTokenCount_ = 0;\n          } else {\n            this.onAppCheckRevoked_(status, data);\n          }\n        }\n      );\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  unlisten(query: QueryContext, tag: number | null) {\n    const pathString = query._path.toString();\n    const queryId = query._queryIdentifier;\n\n    this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n\n    assert(\n      query._queryParams.isDefault() || !query._queryParams.loadsAllData(),\n      'unlisten() called for non-default but complete query'\n    );\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && this.connected_) {\n      this.sendUnlisten_(pathString, queryId, query._queryObject, tag);\n    }\n  }\n\n  private sendUnlisten_(\n    pathString: string,\n    queryId: string,\n    queryObj: object,\n    tag: number | null\n  ) {\n    this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n    const action = 'n';\n    // Only bother sending queryId if it's non-default.\n    if (tag) {\n      req['q'] = queryObj;\n      req['t'] = tag;\n    }\n\n    this.sendRequest(action, req);\n  }\n\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('o', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'o',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('om', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'om',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('oc', pathString, null, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'oc',\n        data: null,\n        onComplete\n      });\n    }\n  }\n\n  private sendOnDisconnect_(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string) => void\n  ) {\n    const request = { /*path*/ p: pathString, /*data*/ d: data };\n    this.log_('onDisconnect ' + action, request);\n    this.sendRequest(action, request, (response: { [k: string]: unknown }) => {\n      if (onComplete) {\n        setTimeout(() => {\n          onComplete(\n            response[/*status*/ 's'] as string,\n            response[/* data */ 'd'] as string\n          );\n        }, Math.floor(0));\n      }\n    });\n  }\n\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {\n    this.putInternal('p', pathString, data, onComplete, hash);\n  }\n\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    this.putInternal('m', pathString, data, onComplete, hash);\n  }\n\n  putInternal(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    this.initConnection_();\n\n    const request: { [k: string]: unknown } = {\n      /*path*/ p: pathString,\n      /*data*/ d: data\n    };\n\n    if (hash !== undefined) {\n      request[/*hash*/ 'h'] = hash;\n    }\n\n    // TODO: Only keep track of the most recent put for a given path?\n    this.outstandingPuts_.push({\n      action,\n      request,\n      onComplete\n    });\n\n    this.outstandingPutCount_++;\n    const index = this.outstandingPuts_.length - 1;\n\n    if (this.connected_) {\n      this.sendPut_(index);\n    } else {\n      this.log_('Buffering put: ' + pathString);\n    }\n  }\n\n  private sendPut_(index: number) {\n    const action = this.outstandingPuts_[index].action;\n    const request = this.outstandingPuts_[index].request;\n    const onComplete = this.outstandingPuts_[index].onComplete;\n    this.outstandingPuts_[index].queued = this.connected_;\n\n    this.sendRequest(action, request, (message: { [k: string]: unknown }) => {\n      this.log_(action + ' response', message);\n\n      delete this.outstandingPuts_[index];\n      this.outstandingPutCount_--;\n\n      // Clean up array occasionally.\n      if (this.outstandingPutCount_ === 0) {\n        this.outstandingPuts_ = [];\n      }\n\n      if (onComplete) {\n        onComplete(\n          message[/*status*/ 's'] as string,\n          message[/* data */ 'd'] as string\n        );\n      }\n    });\n  }\n\n  reportStats(stats: { [k: string]: unknown }) {\n    // If we're not connected, we just drop the stats.\n    if (this.connected_) {\n      const request = { /*counters*/ c: stats };\n      this.log_('reportStats', request);\n\n      this.sendRequest(/*stats*/ 's', request, result => {\n        const status = result[/*status*/ 's'];\n        if (status !== 'ok') {\n          const errorReason = result[/* data */ 'd'];\n          this.log_('reportStats', 'Error sending stats: ' + errorReason);\n        }\n      });\n    }\n  }\n\n  private onDataMessage_(message: { [k: string]: unknown }) {\n    if ('r' in message) {\n      // this is a response\n      this.log_('from server: ' + stringify(message));\n      const reqNum = message['r'] as string;\n      const onResponse = this.requestCBHash_[reqNum];\n      if (onResponse) {\n        delete this.requestCBHash_[reqNum];\n        onResponse(message[/*body*/ 'b']);\n      }\n    } else if ('error' in message) {\n      throw 'A server-side error has occurred: ' + message['error'];\n    } else if ('a' in message) {\n      // a and b are action and body, respectively\n      this.onDataPush_(message['a'] as string, message['b'] as {});\n    }\n  }\n\n  private onDataPush_(action: string, body: { [k: string]: unknown }) {\n    this.log_('handleServerMessage', action, body);\n    if (action === 'd') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge*/ false,\n        body['t'] as number\n      );\n    } else if (action === 'm') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge=*/ true,\n        body['t'] as number\n      );\n    } else if (action === 'c') {\n      this.onListenRevoked_(\n        body[/*path*/ 'p'] as string,\n        body[/*query*/ 'q'] as unknown[]\n      );\n    } else if (action === 'ac') {\n      this.onAuthRevoked_(\n        body[/*status code*/ 's'] as string,\n        body[/* explanation */ 'd'] as string\n      );\n    } else if (action === 'apc') {\n      this.onAppCheckRevoked_(\n        body[/*status code*/ 's'] as string,\n        body[/* explanation */ 'd'] as string\n      );\n    } else if (action === 'sd') {\n      this.onSecurityDebugPacket_(body);\n    } else {\n      error(\n        'Unrecognized action received from server: ' +\n          stringify(action) +\n          '\\nAre you using the latest client?'\n      );\n    }\n  }\n\n  private onReady_(timestamp: number, sessionId: string) {\n    this.log_('connection ready');\n    this.connected_ = true;\n    this.lastConnectionEstablishedTime_ = new Date().getTime();\n    this.handleTimestamp_(timestamp);\n    this.lastSessionId = sessionId;\n    if (this.firstConnection_) {\n      this.sendConnectStats_();\n    }\n    this.restoreState_();\n    this.firstConnection_ = false;\n    this.onConnectStatus_(true);\n  }\n\n  private scheduleConnect_(timeout: number) {\n    assert(\n      !this.realtime_,\n      \"Scheduling a connect when we're already connected/ing?\"\n    );\n\n    if (this.establishConnectionTimer_) {\n      clearTimeout(this.establishConnectionTimer_);\n    }\n\n    // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\n    // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\n\n    this.establishConnectionTimer_ = setTimeout(() => {\n      this.establishConnectionTimer_ = null;\n      this.establishConnection_();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(timeout)) as any;\n  }\n\n  private initConnection_() {\n    if (!this.realtime_ && this.firstConnection_) {\n      this.scheduleConnect_(0);\n    }\n  }\n\n  private onVisible_(visible: boolean) {\n    // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n    if (\n      visible &&\n      !this.visible_ &&\n      this.reconnectDelay_ === this.maxReconnectDelay_\n    ) {\n      this.log_('Window became visible.  Reducing delay.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n    this.visible_ = visible;\n  }\n\n  private onOnline_(online: boolean) {\n    if (online) {\n      this.log_('Browser went online.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    } else {\n      this.log_('Browser went offline.  Killing connection.');\n      if (this.realtime_) {\n        this.realtime_.close();\n      }\n    }\n  }\n\n  private onRealtimeDisconnect_() {\n    this.log_('data client disconnected');\n    this.connected_ = false;\n    this.realtime_ = null;\n\n    // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n    this.cancelSentTransactions_();\n\n    // Clear out the pending requests.\n    this.requestCBHash_ = {};\n\n    if (this.shouldReconnect_()) {\n      if (!this.visible_) {\n        this.log_(\"Window isn't visible.  Delaying reconnect.\");\n        this.reconnectDelay_ = this.maxReconnectDelay_;\n        this.lastConnectionAttemptTime_ = new Date().getTime();\n      } else if (this.lastConnectionEstablishedTime_) {\n        // If we've been connected long enough, reset reconnect delay to minimum.\n        const timeSinceLastConnectSucceeded =\n          new Date().getTime() - this.lastConnectionEstablishedTime_;\n        if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT) {\n          this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        }\n        this.lastConnectionEstablishedTime_ = null;\n      }\n\n      const timeSinceLastConnectAttempt =\n        new Date().getTime() - this.lastConnectionAttemptTime_;\n      let reconnectDelay = Math.max(\n        0,\n        this.reconnectDelay_ - timeSinceLastConnectAttempt\n      );\n      reconnectDelay = Math.random() * reconnectDelay;\n\n      this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n      this.scheduleConnect_(reconnectDelay);\n\n      // Adjust reconnect delay for next time.\n      this.reconnectDelay_ = Math.min(\n        this.maxReconnectDelay_,\n        this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER\n      );\n    }\n    this.onConnectStatus_(false);\n  }\n\n  private async establishConnection_() {\n    if (this.shouldReconnect_()) {\n      this.log_('Making a connection attempt');\n      this.lastConnectionAttemptTime_ = new Date().getTime();\n      this.lastConnectionEstablishedTime_ = null;\n      const onDataMessage = this.onDataMessage_.bind(this);\n      const onReady = this.onReady_.bind(this);\n      const onDisconnect = this.onRealtimeDisconnect_.bind(this);\n      const connId = this.id + ':' + PersistentConnection.nextConnectionId_++;\n      const lastSessionId = this.lastSessionId;\n      let canceled = false;\n      let connection: Connection | null = null;\n      const closeFn = function () {\n        if (connection) {\n          connection.close();\n        } else {\n          canceled = true;\n          onDisconnect();\n        }\n      };\n      const sendRequestFn = function (msg: object) {\n        assert(\n          connection,\n          \"sendRequest call when we're not connected not allowed.\"\n        );\n        connection.sendRequest(msg);\n      };\n\n      this.realtime_ = {\n        close: closeFn,\n        sendRequest: sendRequestFn\n      };\n\n      const forceRefresh = this.forceTokenRefresh_;\n      this.forceTokenRefresh_ = false;\n\n      try {\n        // First fetch auth and app check token, and establish connection after\n        // fetching the token was successful\n        const [authToken, appCheckToken] = await Promise.all([\n          this.authTokenProvider_.getToken(forceRefresh),\n          this.appCheckTokenProvider_.getToken(forceRefresh)\n        ]);\n\n        if (!canceled) {\n          log('getToken() completed. Creating connection.');\n          this.authToken_ = authToken && authToken.accessToken;\n          this.appCheckToken_ = appCheckToken && appCheckToken.token;\n          connection = new Connection(\n            connId,\n            this.repoInfo_,\n            this.applicationId_,\n            this.appCheckToken_,\n            this.authToken_,\n            onDataMessage,\n            onReady,\n            onDisconnect,\n            /* onKill= */ reason => {\n              warn(reason + ' (' + this.repoInfo_.toString() + ')');\n              this.interrupt(SERVER_KILL_INTERRUPT_REASON);\n            },\n            lastSessionId\n          );\n        } else {\n          log('getToken() completed but was canceled');\n        }\n      } catch (error) {\n        this.log_('Failed to get token: ' + error);\n        if (!canceled) {\n          if (this.repoInfo_.nodeAdmin) {\n            // This may be a critical error for the Admin Node.js SDK, so log a warning.\n            // But getToken() may also just have temporarily failed, so we still want to\n            // continue retrying.\n            warn(error);\n          }\n          closeFn();\n        }\n      }\n    }\n  }\n\n  interrupt(reason: string) {\n    log('Interrupting connection for reason: ' + reason);\n    this.interruptReasons_[reason] = true;\n    if (this.realtime_) {\n      this.realtime_.close();\n    } else {\n      if (this.establishConnectionTimer_) {\n        clearTimeout(this.establishConnectionTimer_);\n        this.establishConnectionTimer_ = null;\n      }\n      if (this.connected_) {\n        this.onRealtimeDisconnect_();\n      }\n    }\n  }\n\n  resume(reason: string) {\n    log('Resuming connection for reason: ' + reason);\n    delete this.interruptReasons_[reason];\n    if (isEmpty(this.interruptReasons_)) {\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n  }\n\n  private handleTimestamp_(timestamp: number) {\n    const delta = timestamp - new Date().getTime();\n    this.onServerInfoUpdate_({ serverTimeOffset: delta });\n  }\n\n  private cancelSentTransactions_() {\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      const put = this.outstandingPuts_[i];\n      if (put && /*hash*/ 'h' in put.request && put.queued) {\n        if (put.onComplete) {\n          put.onComplete('disconnect');\n        }\n\n        delete this.outstandingPuts_[i];\n        this.outstandingPutCount_--;\n      }\n    }\n\n    // Clean up array occasionally.\n    if (this.outstandingPutCount_ === 0) {\n      this.outstandingPuts_ = [];\n    }\n  }\n\n  private onListenRevoked_(pathString: string, query?: unknown[]) {\n    // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\n    let queryId;\n    if (!query) {\n      queryId = 'default';\n    } else {\n      queryId = query.map(q => ObjectToUniqueKey(q)).join('$');\n    }\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && listen.onComplete) {\n      listen.onComplete('permission_denied');\n    }\n  }\n\n  private removeListen_(pathString: string, queryId: string): ListenSpec {\n    const normalizedPathString = new Path(pathString).toString(); // normalize path.\n    let listen;\n    if (this.listens.has(normalizedPathString)) {\n      const map = this.listens.get(normalizedPathString)!;\n      listen = map.get(queryId);\n      map.delete(queryId);\n      if (map.size === 0) {\n        this.listens.delete(normalizedPathString);\n      }\n    } else {\n      // all listens for this path has already been removed\n      listen = undefined;\n    }\n    return listen;\n  }\n\n  private onAuthRevoked_(statusCode: string, explanation: string) {\n    log('Auth token revoked: ' + statusCode + '/' + explanation);\n    this.authToken_ = null;\n    this.forceTokenRefresh_ = true;\n    this.realtime_.close();\n    if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n      // We'll wait a couple times before logging the warning / increasing the\n      // retry period since oauth tokens will report as \"invalid\" if they're\n      // just expired. Plus there may be transient issues that resolve themselves.\n      this.invalidAuthTokenCount_++;\n      if (this.invalidAuthTokenCount_ >= INVALID_TOKEN_THRESHOLD) {\n        // Set a long reconnect delay because recovery is unlikely\n        this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n\n        // Notify the auth token provider that the token is invalid, which will log\n        // a warning\n        this.authTokenProvider_.notifyForInvalidToken();\n      }\n    }\n  }\n\n  private onAppCheckRevoked_(statusCode: string, explanation: string) {\n    log('App check token revoked: ' + statusCode + '/' + explanation);\n    this.appCheckToken_ = null;\n    this.forceTokenRefresh_ = true;\n    // Note: We don't close the connection as the developer may not have\n    // enforcement enabled. The backend closes connections with enforcements.\n    if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n      // We'll wait a couple times before logging the warning / increasing the\n      // retry period since oauth tokens will report as \"invalid\" if they're\n      // just expired. Plus there may be transient issues that resolve themselves.\n      this.invalidAppCheckTokenCount_++;\n      if (this.invalidAppCheckTokenCount_ >= INVALID_TOKEN_THRESHOLD) {\n        this.appCheckTokenProvider_.notifyForInvalidToken();\n      }\n    }\n  }\n\n  private onSecurityDebugPacket_(body: { [k: string]: unknown }) {\n    if (this.securityDebugCallback_) {\n      this.securityDebugCallback_(body);\n    } else {\n      if ('msg' in body) {\n        console.log(\n          'FIREBASE: ' + (body['msg'] as string).replace('\\n', '\\nFIREBASE: ')\n        );\n      }\n    }\n  }\n\n  private restoreState_() {\n    //Re-authenticate ourselves if we have a credential stored.\n    this.tryAuth();\n    this.tryAppCheck();\n\n    // Puts depend on having received the corresponding data update from the server before they complete, so we must\n    // make sure to send listens before puts.\n    for (const queries of this.listens.values()) {\n      for (const listenSpec of queries.values()) {\n        this.sendListen_(listenSpec);\n      }\n    }\n\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      if (this.outstandingPuts_[i]) {\n        this.sendPut_(i);\n      }\n    }\n\n    while (this.onDisconnectRequestQueue_.length) {\n      const request = this.onDisconnectRequestQueue_.shift();\n      this.sendOnDisconnect_(\n        request.action,\n        request.pathString,\n        request.data,\n        request.onComplete\n      );\n    }\n\n    for (let i = 0; i < this.outstandingGets_.length; i++) {\n      if (this.outstandingGets_[i]) {\n        this.sendGet_(i);\n      }\n    }\n  }\n\n  /**\n   * Sends client stats for first connection\n   */\n  private sendConnectStats_() {\n    const stats: { [k: string]: number } = {};\n\n    let clientName = 'js';\n    if (isNodeSdk()) {\n      if (this.repoInfo_.nodeAdmin) {\n        clientName = 'admin_node';\n      } else {\n        clientName = 'node';\n      }\n    }\n\n    stats['sdk.' + clientName + '.' + SDK_VERSION.replace(/\\./g, '-')] = 1;\n\n    if (isMobileCordova()) {\n      stats['framework.cordova'] = 1;\n    } else if (isReactNative()) {\n      stats['framework.reactnative'] = 1;\n    }\n    this.reportStats(stats);\n  }\n\n  private shouldReconnect_(): boolean {\n    const online = OnlineMonitor.getInstance().currentlyOnline();\n    return isEmpty(this.interruptReasons_) && online;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../util/Path';\n\nimport { Index } from './indexes/Index';\n\n/**\n * Node is an interface defining the common functionality for nodes in\n * a DataSnapshot.\n *\n * @interface\n */\nexport interface Node {\n  /**\n   * Whether this node is a leaf node.\n   * @returns Whether this is a leaf node.\n   */\n  isLeafNode(): boolean;\n\n  /**\n   * Gets the priority of the node.\n   * @returns The priority of the node.\n   */\n  getPriority(): Node;\n\n  /**\n   * Returns a duplicate node with the new priority.\n   * @param newPriorityNode - New priority to set for the node.\n   * @returns Node with new priority.\n   */\n  updatePriority(newPriorityNode: Node): Node;\n\n  /**\n   * Returns the specified immediate child, or null if it doesn't exist.\n   * @param childName - The name of the child to retrieve.\n   * @returns The retrieved child, or an empty node.\n   */\n  getImmediateChild(childName: string): Node;\n\n  /**\n   * Returns a child by path, or null if it doesn't exist.\n   * @param path - The path of the child to retrieve.\n   * @returns The retrieved child or an empty node.\n   */\n  getChild(path: Path): Node;\n\n  /**\n   * Returns the name of the child immediately prior to the specified childNode, or null.\n   * @param childName - The name of the child to find the predecessor of.\n   * @param childNode - The node to find the predecessor of.\n   * @param index - The index to use to determine the predecessor\n   * @returns The name of the predecessor child, or null if childNode is the first child.\n   */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string | null;\n\n  /**\n   * Returns a duplicate node, with the specified immediate child updated.\n   * Any value in the node will be removed.\n   * @param childName - The name of the child to update.\n   * @param newChildNode - The new child node\n   * @returns The updated node.\n   */\n  updateImmediateChild(childName: string, newChildNode: Node): Node;\n\n  /**\n   * Returns a duplicate node, with the specified child updated.  Any value will\n   * be removed.\n   * @param path - The path of the child to update.\n   * @param newChildNode - The new child node, which may be an empty node\n   * @returns The updated node.\n   */\n  updateChild(path: Path, newChildNode: Node): Node;\n\n  /**\n   * True if the immediate child specified exists\n   */\n  hasChild(childName: string): boolean;\n\n  /**\n   * @returns True if this node has no value or children.\n   */\n  isEmpty(): boolean;\n\n  /**\n   * @returns The number of children of this node.\n   */\n  numChildren(): number;\n\n  /**\n   * Calls action for each child.\n   * @param action - Action to be called for\n   * each child.  It's passed the child name and the child node.\n   * @returns The first truthy value return by action, or the last falsey one\n   */\n  forEachChild(index: Index, action: (a: string, b: Node) => void): unknown;\n\n  /**\n   * @param exportFormat - True for export format (also wire protocol format).\n   * @returns Value of this node as JSON.\n   */\n  val(exportFormat?: boolean): unknown;\n\n  /**\n   * @returns hash representing the node contents.\n   */\n  hash(): string;\n\n  /**\n   * @param other - Another node\n   * @returns -1 for less than, 0 for equal, 1 for greater than other\n   */\n  compareTo(other: Node): number;\n\n  /**\n   * @returns Whether or not this snapshot equals other\n   */\n  equals(other: Node): boolean;\n\n  /**\n   * @returns This node, with the specified index now available\n   */\n  withIndex(indexDefinition: Index): Node;\n\n  isIndexed(indexDefinition: Index): boolean;\n}\n\nexport class NamedNode {\n  constructor(public name: string, public node: Node) {}\n\n  static Wrap(name: string, node: Node) {\n    return new NamedNode(name, node);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Comparator } from '../../util/SortedMap';\nimport { MIN_NAME } from '../../util/util';\nimport { Node, NamedNode } from '../Node';\n\nexport abstract class Index {\n  abstract compare(a: NamedNode, b: NamedNode): number;\n\n  abstract isDefinedOn(node: Node): boolean;\n\n  /**\n   * @returns A standalone comparison function for\n   * this index\n   */\n  getCompare(): Comparator<NamedNode> {\n    return this.compare.bind(this);\n  }\n\n  /**\n   * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n   * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n   *\n   *\n   * @returns True if the portion of the snapshot being indexed changed between oldNode and newNode\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    const oldWrapped = new NamedNode(MIN_NAME, oldNode);\n    const newWrapped = new NamedNode(MIN_NAME, newNode);\n    return this.compare(oldWrapped, newWrapped) !== 0;\n  }\n\n  /**\n   * @returns a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @returns a node wrapper that will sort greater than or equal to\n   * any other node wrapper, using this index\n   */\n  abstract maxPost(): NamedNode;\n\n  abstract makePost(indexValue: unknown, name: string): NamedNode;\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  abstract toString(): string;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, assertionError } from '@firebase/util';\n\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { ChildrenNode } from '../ChildrenNode';\nimport { Node, NamedNode } from '../Node';\n\nimport { Index } from './Index';\n\nlet __EMPTY_NODE: ChildrenNode;\n\nexport class KeyIndex extends Index {\n  static get __EMPTY_NODE() {\n    return __EMPTY_NODE;\n  }\n\n  static set __EMPTY_NODE(val) {\n    __EMPTY_NODE = val;\n  }\n  compare(a: NamedNode, b: NamedNode): number {\n    return nameCompare(a.name, b.name);\n  }\n  isDefinedOn(node: Node): boolean {\n    // We could probably return true here (since every node has a key), but it's never called\n    // so just leaving unimplemented for now.\n    throw assertionError('KeyIndex.isDefinedOn not expected to be called.');\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return false; // The key for a node never changes.\n  }\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    // TODO: This should really be created once and cached in a static property, but\n    // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\n    return new NamedNode(MAX_NAME, __EMPTY_NODE);\n  }\n\n  makePost(indexValue: string, name: string): NamedNode {\n    assert(\n      typeof indexValue === 'string',\n      'KeyIndex indexValue must always be a string.'\n    );\n    // We just use empty node, but it'll never be compared, since our comparator only looks at name.\n    return new NamedNode(indexValue, __EMPTY_NODE);\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.key';\n  }\n}\n\nexport const KEY_INDEX = new KeyIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview Implementation of an immutable SortedMap using a Left-leaning\n * Red-Black Tree, adapted from the implementation in Mugs\n * (http://mads379.github.com/mugs/) by Mads Hartmann Jensen\n * (mads379\\@gmail.com).\n *\n * Original paper on Left-leaning Red-Black Trees:\n *   http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf\n *\n * Invariant 1: No red node has a red child\n * Invariant 2: Every leaf path has the same number of black nodes\n * Invariant 3: Only the left child can be red (left leaning)\n */\n\n// TODO: There are some improvements I'd like to make to improve memory / perf:\n//  * Create two prototypes, LLRedNode and LLBlackNode, instead of storing a\n//    color property in every node.\n// TODO: It would also be good (and possibly necessary) to create a base\n// interface for LLRBNode and LLRBEmptyNode.\n\nexport type Comparator<K> = (key1: K, key2: K) => number;\n\n/**\n * An iterator over an LLRBNode.\n */\nexport class SortedMapIterator<K, V, T> {\n  private nodeStack_: Array<LLRBNode<K, V> | LLRBEmptyNode<K, V>> = [];\n\n  /**\n   * @param node - Node to iterate.\n   * @param isReverse_ - Whether or not to iterate in reverse\n   */\n  constructor(\n    node: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n    startKey: K | null,\n    comparator: Comparator<K>,\n    private isReverse_: boolean,\n    private resultGenerator_: ((k: K, v: V) => T) | null = null\n  ) {\n    let cmp = 1;\n    while (!node.isEmpty()) {\n      node = node as LLRBNode<K, V>;\n      cmp = startKey ? comparator(node.key, startKey) : 1;\n      // flip the comparison if we're going in reverse\n      if (isReverse_) {\n        cmp *= -1;\n      }\n\n      if (cmp < 0) {\n        // This node is less than our start key. ignore it\n        if (this.isReverse_) {\n          node = node.left;\n        } else {\n          node = node.right;\n        }\n      } else if (cmp === 0) {\n        // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n        this.nodeStack_.push(node);\n        break;\n      } else {\n        // This node is greater than our start key, add it to the stack and move to the next one\n        this.nodeStack_.push(node);\n        if (this.isReverse_) {\n          node = node.right;\n        } else {\n          node = node.left;\n        }\n      }\n    }\n  }\n\n  getNext(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    let node = this.nodeStack_.pop();\n    let result: T;\n    if (this.resultGenerator_) {\n      result = this.resultGenerator_(node.key, node.value);\n    } else {\n      result = { key: node.key, value: node.value } as unknown as T;\n    }\n\n    if (this.isReverse_) {\n      node = node.left;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.right;\n      }\n    } else {\n      node = node.right;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.left;\n      }\n    }\n\n    return result;\n  }\n\n  hasNext(): boolean {\n    return this.nodeStack_.length > 0;\n  }\n\n  peek(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    const node = this.nodeStack_[this.nodeStack_.length - 1];\n    if (this.resultGenerator_) {\n      return this.resultGenerator_(node.key, node.value);\n    } else {\n      return { key: node.key, value: node.value } as unknown as T;\n    }\n  }\n}\n\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nexport class LLRBNode<K, V> {\n  color: boolean;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n\n  /**\n   * @param key - Key associated with this node.\n   * @param value - Value associated with this node.\n   * @param color - Whether this node is red.\n   * @param left - Left child.\n   * @param right - Right child.\n   */\n  constructor(\n    public key: K,\n    public value: V,\n    color: boolean | null,\n    left?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ) {\n    this.color = color != null ? color : LLRBNode.RED;\n    this.left =\n      left != null ? left : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n    this.right =\n      right != null ? right : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n  }\n\n  static RED = true;\n  static BLACK = false;\n\n  /**\n   * Returns a copy of the current node, optionally replacing pieces of it.\n   *\n   * @param key - New key for the node, or null.\n   * @param value - New value for the node, or null.\n   * @param color - New color for the node, or null.\n   * @param left - New left child for the node, or null.\n   * @param right - New right child for the node, or null.\n   * @returns The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBNode<K, V> {\n    return new LLRBNode(\n      key != null ? key : this.key,\n      value != null ? value : this.value,\n      color != null ? color : this.color,\n      left != null ? left : this.left,\n      right != null ? right : this.right\n    );\n  }\n\n  /**\n   * @returns The total number of nodes in the tree.\n   */\n  count(): number {\n    return this.left.count() + 1 + this.right.count();\n  }\n\n  /**\n   * @returns True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   *   node.  If it returns true, traversal is aborted.\n   * @returns The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return (\n      this.left.inorderTraversal(action) ||\n      !!action(this.key, this.value) ||\n      this.right.inorderTraversal(action)\n    );\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return (\n      this.right.reverseTraversal(action) ||\n      action(this.key, this.value) ||\n      this.left.reverseTraversal(action)\n    );\n  }\n\n  /**\n   * @returns The minimum node in the tree.\n   */\n  private min_(): LLRBNode<K, V> {\n    if (this.left.isEmpty()) {\n      return this;\n    } else {\n      return (this.left as LLRBNode<K, V>).min_();\n    }\n  }\n\n  /**\n   * @returns The maximum key in the tree.\n   */\n  minKey(): K {\n    return this.min_().key;\n  }\n\n  /**\n   * @returns The maximum key in the tree.\n   */\n  maxKey(): K {\n    if (this.right.isEmpty()) {\n      return this.key;\n    } else {\n      return this.right.maxKey();\n    }\n  }\n\n  /**\n   * @param key - Key to insert.\n   * @param value - Value to insert.\n   * @param comparator - Comparator.\n   * @returns New tree, with the key/value added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    const cmp = comparator(key, n.key);\n    if (cmp < 0) {\n      n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n    } else if (cmp === 0) {\n      n = n.copy(null, value, null, null, null);\n    } else {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        n.right.insert(key, value, comparator)\n      );\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @returns New tree, with the minimum key removed.\n   */\n  private removeMin_(): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    if (this.left.isEmpty()) {\n      return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n    }\n    let n: LLRBNode<K, V> = this;\n    if (!n.left.isRed_() && !n.left.left.isRed_()) {\n      n = n.moveRedLeft_();\n    }\n    n = n.copy(null, null, null, (n.left as LLRBNode<K, V>).removeMin_(), null);\n    return n.fixUp_();\n  }\n\n  /**\n   * @param key - The key of the item to remove.\n   * @param comparator - Comparator.\n   * @returns New tree, with the specified item removed.\n   */\n  remove(\n    key: K,\n    comparator: Comparator<K>\n  ): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    let n, smallest;\n    n = this;\n    if (comparator(key, n.key) < 0) {\n      if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n        n = n.moveRedLeft_();\n      }\n      n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n    } else {\n      if (n.left.isRed_()) {\n        n = n.rotateRight_();\n      }\n      if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\n        n = n.moveRedRight_();\n      }\n      if (comparator(key, n.key) === 0) {\n        if (n.right.isEmpty()) {\n          return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n        } else {\n          smallest = (n.right as LLRBNode<K, V>).min_();\n          n = n.copy(\n            smallest.key,\n            smallest.value,\n            null,\n            null,\n            (n.right as LLRBNode<K, V>).removeMin_()\n          );\n        }\n      }\n      n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @returns Whether this is a RED node.\n   */\n  isRed_(): boolean {\n    return this.color;\n  }\n\n  /**\n   * @returns New tree after performing any needed rotations.\n   */\n  private fixUp_(): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    if (n.right.isRed_() && !n.left.isRed_()) {\n      n = n.rotateLeft_();\n    }\n    if (n.left.isRed_() && n.left.left.isRed_()) {\n      n = n.rotateRight_();\n    }\n    if (n.left.isRed_() && n.right.isRed_()) {\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after moveRedLeft.\n   */\n  private moveRedLeft_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.right.left.isRed_()) {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        (n.right as LLRBNode<K, V>).rotateRight_()\n      );\n      n = n.rotateLeft_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after moveRedRight.\n   */\n  private moveRedRight_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.left.left.isRed_()) {\n      n = n.rotateRight_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after rotateLeft.\n   */\n  private rotateLeft_(): LLRBNode<K, V> {\n    const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n    return this.right.copy(null, null, this.color, nl, null) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @returns New tree, after rotateRight.\n   */\n  private rotateRight_(): LLRBNode<K, V> {\n    const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n    return this.left.copy(null, null, this.color, null, nr) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @returns Newt ree, after colorFlip.\n   */\n  private colorFlip_(): LLRBNode<K, V> {\n    const left = this.left.copy(null, null, !this.left.color, null, null);\n    const right = this.right.copy(null, null, !this.right.color, null, null);\n    return this.copy(null, null, !this.color, left, right);\n  }\n\n  /**\n   * For testing.\n   *\n   * @returns True if all is well.\n   */\n  private checkMaxDepth_(): boolean {\n    const blackDepth = this.check_();\n    return Math.pow(2.0, blackDepth) <= this.count() + 1;\n  }\n\n  check_(): number {\n    if (this.isRed_() && this.left.isRed_()) {\n      throw new Error(\n        'Red node has red child(' + this.key + ',' + this.value + ')'\n      );\n    }\n    if (this.right.isRed_()) {\n      throw new Error(\n        'Right child of (' + this.key + ',' + this.value + ') is red'\n      );\n    }\n    const blackDepth = this.left.check_();\n    if (blackDepth !== this.right.check_()) {\n      throw new Error('Black depths differ');\n    } else {\n      return blackDepth + (this.isRed_() ? 0 : 1);\n    }\n  }\n}\n\n/**\n * Represents an empty node (a leaf node in the Red-Black Tree).\n */\nexport class LLRBEmptyNode<K, V> {\n  key: K;\n  value: V;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  color: boolean;\n\n  /**\n   * Returns a copy of the current node.\n   *\n   * @returns The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key/value added.\n   *\n   * @param key - Key to be added.\n   * @param value - Value to be added.\n   * @param comparator - Comparator.\n   * @returns New tree, with item added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    return new LLRBNode(key, value, null);\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key removed.\n   *\n   * @param key - The key to remove.\n   * @param comparator - Comparator.\n   * @returns New tree, with item removed.\n   */\n  remove(key: K, comparator: Comparator<K>): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * @returns The total number of nodes in the tree.\n   */\n  count(): number {\n    return 0;\n  }\n\n  /**\n   * @returns True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return true;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return false;\n  }\n\n  minKey(): null {\n    return null;\n  }\n\n  maxKey(): null {\n    return null;\n  }\n\n  check_(): number {\n    return 0;\n  }\n\n  /**\n   * @returns Whether this node is red.\n   */\n  isRed_() {\n    return false;\n  }\n}\n\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nexport class SortedMap<K, V> {\n  /**\n   * Always use the same empty node, to reduce memory.\n   */\n  static EMPTY_NODE = new LLRBEmptyNode();\n\n  /**\n   * @param comparator_ - Key comparator.\n   * @param root_ - Optional root node for the map.\n   */\n  constructor(\n    private comparator_: Comparator<K>,\n    private root_:\n      | LLRBNode<K, V>\n      | LLRBEmptyNode<K, V> = SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>\n  ) {}\n\n  /**\n   * Returns a copy of the map, with the specified key/value added or replaced.\n   * (TODO: We should perhaps rename this method to 'put')\n   *\n   * @param key - Key to be added.\n   * @param value - Value to be added.\n   * @returns New map, with item added.\n   */\n  insert(key: K, value: V): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .insert(key, value, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns a copy of the map, with the specified key removed.\n   *\n   * @param key - The key to remove.\n   * @returns New map, with item removed.\n   */\n  remove(key: K): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .remove(key, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns the value of the node with the given key, or null.\n   *\n   * @param key - The key to look up.\n   * @returns The value of the node with the given key, or null if the\n   * key doesn't exist.\n   */\n  get(key: K): V | null {\n    let cmp;\n    let node = this.root_;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        return node.value;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        node = node.right;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Returns the key of the item *before* the specified key, or null if key is the first item.\n   * @param key - The key to find the predecessor of\n   * @returns The predecessor key.\n   */\n  getPredecessorKey(key: K): K | null {\n    let cmp,\n      node = this.root_,\n      rightParent = null;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        if (!node.left.isEmpty()) {\n          node = node.left;\n          while (!node.right.isEmpty()) {\n            node = node.right;\n          }\n          return node.key;\n        } else if (rightParent) {\n          return rightParent.key;\n        } else {\n          return null; // first item.\n        }\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        rightParent = node;\n        node = node.right;\n      }\n    }\n\n    throw new Error(\n      'Attempted to find predecessor key for a nonexistent key.  What gives?'\n    );\n  }\n\n  /**\n   * @returns True if the map is empty.\n   */\n  isEmpty(): boolean {\n    return this.root_.isEmpty();\n  }\n\n  /**\n   * @returns The total number of nodes in the map.\n   */\n  count(): number {\n    return this.root_.count();\n  }\n\n  /**\n   * @returns The minimum key in the map.\n   */\n  minKey(): K | null {\n    return this.root_.minKey();\n  }\n\n  /**\n   * @returns The maximum key in the map.\n   */\n  maxKey(): K | null {\n    return this.root_.maxKey();\n  }\n\n  /**\n   * Traverses the map in key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param action - Callback function to be called\n   * for each key/value pair.  If action returns true, traversal is aborted.\n   * @returns The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return this.root_.inorderTraversal(action);\n  }\n\n  /**\n   * Traverses the map in reverse key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param action - Callback function to be called\n   * for each key/value pair.  If action returns true, traversal is aborted.\n   * @returns True if the traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return this.root_.reverseTraversal(action);\n  }\n\n  /**\n   * Returns an iterator over the SortedMap.\n   * @returns The iterator.\n   */\n  getIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getReverseIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n\n  getReverseIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { nameCompare } from '../util/util';\n\nimport { NamedNode } from './Node';\n\nexport function NAME_ONLY_COMPARATOR(left: NamedNode, right: NamedNode) {\n  return nameCompare(left.name, right.name);\n}\n\nexport function NAME_COMPARATOR(left: string, right: string) {\n  return nameCompare(left, right);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport { doubleToIEEE754String } from '../util/util';\n\nimport { Node } from './Node';\n\nlet MAX_NODE: Node;\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\nexport const priorityHashText = function (priority: string | number): string {\n  if (typeof priority === 'number') {\n    return 'number:' + doubleToIEEE754String(priority);\n  } else {\n    return 'string:' + priority;\n  }\n};\n\n/**\n * Validates that a priority snapshot Node is valid.\n */\nexport const validatePriorityNode = function (priorityNode: Node) {\n  if (priorityNode.isLeafNode()) {\n    const val = priorityNode.val();\n    assert(\n      typeof val === 'string' ||\n        typeof val === 'number' ||\n        (typeof val === 'object' && contains(val as Indexable, '.sv')),\n      'Priority must be a string or number.'\n    );\n  } else {\n    assert(\n      priorityNode === MAX_NODE || priorityNode.isEmpty(),\n      'priority of unexpected type.'\n    );\n  }\n  // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n  assert(\n    priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(),\n    \"Priority nodes can't have a priority of their own.\"\n  );\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport {\n  Path,\n  pathGetFront,\n  pathGetLength,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\nimport { doubleToIEEE754String, sha1 } from '../util/util';\n\nimport { ChildrenNodeConstructor } from './ChildrenNode';\nimport { Index } from './indexes/Index';\nimport { Node } from './Node';\nimport { priorityHashText, validatePriorityNode } from './snap';\n\nlet __childrenNodeConstructor: ChildrenNodeConstructor;\n\n/**\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\n * implements Node and stores the value of the node (a string,\n * number, or boolean) accessible via getValue().\n */\nexport class LeafNode implements Node {\n  static set __childrenNodeConstructor(val: ChildrenNodeConstructor) {\n    __childrenNodeConstructor = val;\n  }\n\n  static get __childrenNodeConstructor() {\n    return __childrenNodeConstructor;\n  }\n\n  /**\n   * The sort order for comparing leaf nodes of different types. If two leaf nodes have\n   * the same type, the comparison falls back to their value\n   */\n  static VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n\n  private lazyHash_: string | null = null;\n\n  /**\n   * @param value_ - The value to store in this leaf node. The object type is\n   * possible in the event of a deferred value\n   * @param priorityNode_ - The priority of this node.\n   */\n  constructor(\n    private readonly value_: string | number | boolean | Indexable,\n    private priorityNode_: Node = LeafNode.__childrenNodeConstructor.EMPTY_NODE\n  ) {\n    assert(\n      this.value_ !== undefined && this.value_ !== null,\n      \"LeafNode shouldn't be created with null/undefined value.\"\n    );\n\n    validatePriorityNode(this.priorityNode_);\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return true;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    return new LeafNode(this.value_, newPriorityNode);\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    if (pathIsEmpty(path)) {\n      return this;\n    } else if (pathGetFront(path) === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n  hasChild(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(childName: string, childNode: Node): null {\n    return null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else if (newChildNode.isEmpty() && childName !== '.priority') {\n      return this;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateImmediateChild(\n        childName,\n        newChildNode\n      ).updatePriority(this.priorityNode_);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return newChildNode;\n    } else if (newChildNode.isEmpty() && front !== '.priority') {\n      return this;\n    } else {\n      assert(\n        front !== '.priority' || pathGetLength(path) === 1,\n        '.priority must be the last token in a path'\n      );\n\n      return this.updateImmediateChild(\n        front,\n        LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(\n          pathPopFront(path),\n          newChildNode\n        )\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return 0;\n  }\n\n  /** @inheritDoc */\n  forEachChild(index: Index, action: (s: string, n: Node) => void): boolean {\n    return false;\n  }\n  val(exportFormat?: boolean): {} {\n    if (exportFormat && !this.getPriority().isEmpty()) {\n      return {\n        '.value': this.getValue(),\n        '.priority': this.getPriority().val()\n      };\n    } else {\n      return this.getValue();\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.priorityNode_.isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.priorityNode_.val() as number | string) +\n          ':';\n      }\n\n      const type = typeof this.value_;\n      toHash += type + ':';\n      if (type === 'number') {\n        toHash += doubleToIEEE754String(this.value_ as number);\n      } else {\n        toHash += this.value_;\n      }\n      this.lazyHash_ = sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /**\n   * Returns the value of the leaf node.\n   * @returns The value of the node.\n   */\n  getValue(): Indexable | string | number | boolean {\n    return this.value_;\n  }\n  compareTo(other: Node): number {\n    if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n      return 1;\n    } else if (other instanceof LeafNode.__childrenNodeConstructor) {\n      return -1;\n    } else {\n      assert(other.isLeafNode(), 'Unknown node type');\n      return this.compareToLeafNode_(other as LeafNode);\n    }\n  }\n\n  /**\n   * Comparison specifically for two leaf nodes\n   */\n  private compareToLeafNode_(otherLeaf: LeafNode): number {\n    const otherLeafType = typeof otherLeaf.value_;\n    const thisLeafType = typeof this.value_;\n    const otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\n    const thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\n    assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\n    assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\n    if (otherIndex === thisIndex) {\n      // Same type, compare values\n      if (thisLeafType === 'object') {\n        // Deferred value nodes are all equal, but we should also never get to this point...\n        return 0;\n      } else {\n        // Note that this works because true > false, all others are number or string comparisons\n        if (this.value_ < otherLeaf.value_) {\n          return -1;\n        } else if (this.value_ === otherLeaf.value_) {\n          return 0;\n        } else {\n          return 1;\n        }\n      }\n    } else {\n      return thisIndex - otherIndex;\n    }\n  }\n  withIndex(): Node {\n    return this;\n  }\n  isIndexed(): boolean {\n    return true;\n  }\n  equals(other: Node): boolean {\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      const otherLeaf = other as LeafNode;\n      return (\n        this.value_ === otherLeaf.value_ &&\n        this.priorityNode_.equals(otherLeaf.priorityNode_)\n      );\n    } else {\n      return false;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { LeafNode } from '../LeafNode';\nimport { NamedNode, Node } from '../Node';\n\nimport { Index } from './Index';\n\nlet nodeFromJSON: (a: unknown) => Node;\nlet MAX_NODE: Node;\n\nexport function setNodeFromJSON(val: (a: unknown) => Node) {\n  nodeFromJSON = val;\n}\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\nexport class PriorityIndex extends Index {\n  compare(a: NamedNode, b: NamedNode): number {\n    const aPriority = a.node.getPriority();\n    const bPriority = b.node.getPriority();\n    const indexCmp = aPriority.compareTo(bPriority);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  isDefinedOn(node: Node): boolean {\n    return !node.getPriority().isEmpty();\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.getPriority().equals(newNode.getPriority());\n  }\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    return new NamedNode(MAX_NAME, new LeafNode('[PRIORITY-POST]', MAX_NODE));\n  }\n\n  makePost(indexValue: unknown, name: string): NamedNode {\n    const priorityNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, new LeafNode('[PRIORITY-POST]', priorityNode));\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.priority';\n  }\n}\n\nexport const PRIORITY_INDEX = new PriorityIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { LLRBNode, SortedMap } from '../util/SortedMap';\n\nimport { NamedNode } from './Node';\n\nconst LOG_2 = Math.log(2);\n\nclass Base12Num {\n  count: number;\n  private current_: number;\n  private bits_: number;\n\n  constructor(length: number) {\n    const logBase2 = (num: number) =>\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      parseInt((Math.log(num) / LOG_2) as any, 10);\n    const bitMask = (bits: number) => parseInt(Array(bits + 1).join('1'), 2);\n    this.count = logBase2(length + 1);\n    this.current_ = this.count - 1;\n    const mask = bitMask(this.count);\n    this.bits_ = (length + 1) & mask;\n  }\n\n  nextBitIsOne(): boolean {\n    //noinspection JSBitwiseOperatorUsage\n    const result = !(this.bits_ & (0x1 << this.current_));\n    this.current_--;\n    return result;\n  }\n}\n\n/**\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\n * function\n *\n * Uses the algorithm described in the paper linked here:\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\n *\n * @param childList - Unsorted list of children\n * @param cmp - The comparison method to be used\n * @param keyFn - An optional function to extract K from a node wrapper, if K's\n * type is not NamedNode\n * @param mapSortFn - An optional override for comparator used by the generated sorted map\n */\nexport const buildChildSet = function <K, V>(\n  childList: NamedNode[],\n  cmp: (a: NamedNode, b: NamedNode) => number,\n  keyFn?: (a: NamedNode) => K,\n  mapSortFn?: (a: K, b: K) => number\n): SortedMap<K, V> {\n  childList.sort(cmp);\n\n  const buildBalancedTree = function (\n    low: number,\n    high: number\n  ): LLRBNode<K, V> | null {\n    const length = high - low;\n    let namedNode: NamedNode;\n    let key: K;\n    if (length === 0) {\n      return null;\n    } else if (length === 1) {\n      namedNode = childList[low];\n      key = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      return new LLRBNode(\n        key,\n        namedNode.node as unknown as V,\n        LLRBNode.BLACK,\n        null,\n        null\n      );\n    } else {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const middle = parseInt((length / 2) as any, 10) + low;\n      const left = buildBalancedTree(low, middle);\n      const right = buildBalancedTree(middle + 1, high);\n      namedNode = childList[middle];\n      key = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      return new LLRBNode(\n        key,\n        namedNode.node as unknown as V,\n        LLRBNode.BLACK,\n        left,\n        right\n      );\n    }\n  };\n\n  const buildFrom12Array = function (base12: Base12Num): LLRBNode<K, V> {\n    let node: LLRBNode<K, V> = null;\n    let root = null;\n    let index = childList.length;\n\n    const buildPennant = function (chunkSize: number, color: boolean) {\n      const low = index - chunkSize;\n      const high = index;\n      index -= chunkSize;\n      const childTree = buildBalancedTree(low + 1, high);\n      const namedNode = childList[low];\n      const key: K = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      attachPennant(\n        new LLRBNode(\n          key,\n          namedNode.node as unknown as V,\n          color,\n          null,\n          childTree\n        )\n      );\n    };\n\n    const attachPennant = function (pennant: LLRBNode<K, V>) {\n      if (node) {\n        node.left = pennant;\n        node = pennant;\n      } else {\n        root = pennant;\n        node = pennant;\n      }\n    };\n\n    for (let i = 0; i < base12.count; ++i) {\n      const isOne = base12.nextBitIsOne();\n      // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n      const chunkSize = Math.pow(2, base12.count - (i + 1));\n      if (isOne) {\n        buildPennant(chunkSize, LLRBNode.BLACK);\n      } else {\n        // current == 2\n        buildPennant(chunkSize, LLRBNode.BLACK);\n        buildPennant(chunkSize, LLRBNode.RED);\n      }\n    }\n    return root;\n  };\n\n  const base12 = new Base12Num(childList.length);\n  const root = buildFrom12Array(base12);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  return new SortedMap<K, V>(mapSortFn || (cmp as any), root);\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains, map, safeGet } from '@firebase/util';\n\nimport { SortedMap } from '../util/SortedMap';\n\nimport { buildChildSet } from './childSet';\nimport { Index } from './indexes/Index';\nimport { KEY_INDEX } from './indexes/KeyIndex';\nimport { PRIORITY_INDEX } from './indexes/PriorityIndex';\nimport { NamedNode, Node } from './Node';\n\nlet _defaultIndexMap: IndexMap;\n\nconst fallbackObject = {};\n\nexport class IndexMap {\n  /**\n   * The default IndexMap for nodes without a priority\n   */\n  static get Default(): IndexMap {\n    assert(\n      fallbackObject && PRIORITY_INDEX,\n      'ChildrenNode.ts has not been loaded'\n    );\n    _defaultIndexMap =\n      _defaultIndexMap ||\n      new IndexMap(\n        { '.priority': fallbackObject },\n        { '.priority': PRIORITY_INDEX }\n      );\n    return _defaultIndexMap;\n  }\n\n  constructor(\n    private indexes_: {\n      [k: string]: SortedMap<NamedNode, Node> | /*FallbackType*/ object;\n    },\n    private indexSet_: { [k: string]: Index }\n  ) {}\n\n  get(indexKey: string): SortedMap<NamedNode, Node> | null {\n    const sortedMap = safeGet(this.indexes_, indexKey);\n    if (!sortedMap) {\n      throw new Error('No index defined for ' + indexKey);\n    }\n\n    if (sortedMap instanceof SortedMap) {\n      return sortedMap;\n    } else {\n      // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n      // regular child map\n      return null;\n    }\n  }\n\n  hasIndex(indexDefinition: Index): boolean {\n    return contains(this.indexSet_, indexDefinition.toString());\n  }\n\n  addIndex(\n    indexDefinition: Index,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    assert(\n      indexDefinition !== KEY_INDEX,\n      \"KeyIndex always exists and isn't meant to be added to the IndexMap.\"\n    );\n    const childList = [];\n    let sawIndexedValue = false;\n    const iter = existingChildren.getIterator(NamedNode.Wrap);\n    let next = iter.getNext();\n    while (next) {\n      sawIndexedValue =\n        sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n      childList.push(next);\n      next = iter.getNext();\n    }\n    let newIndex;\n    if (sawIndexedValue) {\n      newIndex = buildChildSet(childList, indexDefinition.getCompare());\n    } else {\n      newIndex = fallbackObject;\n    }\n    const indexName = indexDefinition.toString();\n    const newIndexSet = { ...this.indexSet_ };\n    newIndexSet[indexName] = indexDefinition;\n    const newIndexes = { ...this.indexes_ };\n    newIndexes[indexName] = newIndex;\n    return new IndexMap(newIndexes, newIndexSet);\n  }\n\n  /**\n   * Ensure that this node is properly tracked in any indexes that we're maintaining\n   */\n  addToIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>, indexName: string) => {\n        const index = safeGet(this.indexSet_, indexName);\n        assert(index, 'Missing index implementation for ' + indexName);\n        if (indexedChildren === fallbackObject) {\n          // Check to see if we need to index everything\n          if (index.isDefinedOn(namedNode.node)) {\n            // We need to build this index\n            const childList = [];\n            const iter = existingChildren.getIterator(NamedNode.Wrap);\n            let next = iter.getNext();\n            while (next) {\n              if (next.name !== namedNode.name) {\n                childList.push(next);\n              }\n              next = iter.getNext();\n            }\n            childList.push(namedNode);\n            return buildChildSet(childList, index.getCompare());\n          } else {\n            // No change, this remains a fallback\n            return fallbackObject;\n          }\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          let newChildren = indexedChildren;\n          if (existingSnap) {\n            newChildren = newChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          }\n          return newChildren.insert(namedNode, namedNode.node);\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n\n  /**\n   * Create a new IndexMap instance with the given value removed\n   */\n  removeFromIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>) => {\n        if (indexedChildren === fallbackObject) {\n          // This is the fallback. Just return it, nothing to do in this case\n          return indexedChildren;\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          if (existingSnap) {\n            return indexedChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          } else {\n            // No record of this child\n            return indexedChildren;\n          }\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { Path, pathGetFront, pathGetLength, pathPopFront } from '../util/Path';\nimport { SortedMap, SortedMapIterator } from '../util/SortedMap';\nimport { MAX_NAME, MIN_NAME, sha1 } from '../util/util';\n\nimport { NAME_COMPARATOR } from './comparators';\nimport { Index } from './indexes/Index';\nimport { KEY_INDEX, KeyIndex } from './indexes/KeyIndex';\nimport {\n  PRIORITY_INDEX,\n  setMaxNode as setPriorityMaxNode\n} from './indexes/PriorityIndex';\nimport { IndexMap } from './IndexMap';\nimport { LeafNode } from './LeafNode';\nimport { NamedNode, Node } from './Node';\nimport { priorityHashText, setMaxNode, validatePriorityNode } from './snap';\n\nexport interface ChildrenNodeConstructor {\n  new (\n    children_: SortedMap<string, Node>,\n    priorityNode_: Node | null,\n    indexMap_: IndexMap\n  ): ChildrenNode;\n  EMPTY_NODE: ChildrenNode;\n}\n\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\n\nlet EMPTY_NODE: ChildrenNode;\n\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n */\nexport class ChildrenNode implements Node {\n  private lazyHash_: string | null = null;\n\n  static get EMPTY_NODE(): ChildrenNode {\n    return (\n      EMPTY_NODE ||\n      (EMPTY_NODE = new ChildrenNode(\n        new SortedMap<string, Node>(NAME_COMPARATOR),\n        null,\n        IndexMap.Default\n      ))\n    );\n  }\n\n  /**\n   * @param children_ - List of children of this node..\n   * @param priorityNode_ - The priority of this node (as a snapshot node).\n   */\n  constructor(\n    private readonly children_: SortedMap<string, Node>,\n    private readonly priorityNode_: Node | null,\n    private indexMap_: IndexMap\n  ) {\n    /**\n     * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n     * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n     * class instead of an empty ChildrenNode.\n     */\n    if (this.priorityNode_) {\n      validatePriorityNode(this.priorityNode_);\n    }\n\n    if (this.children_.isEmpty()) {\n      assert(\n        !this.priorityNode_ || this.priorityNode_.isEmpty(),\n        'An empty node cannot have a priority'\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_ || EMPTY_NODE;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    if (this.children_.isEmpty()) {\n      // Don't allow priorities on empty nodes\n      return this;\n    } else {\n      return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n    }\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.getPriority();\n    } else {\n      const child = this.children_.get(childName);\n      return child === null ? EMPTY_NODE : child;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return this;\n    }\n\n    return this.getImmediateChild(front).getChild(pathPopFront(path));\n  }\n\n  /** @inheritDoc */\n  hasChild(childName: string): boolean {\n    return this.children_.get(childName) !== null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    assert(newChildNode, 'We should always be passing snapshot nodes');\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else {\n      const namedNode = new NamedNode(childName, newChildNode);\n      let newChildren, newIndexMap;\n      if (newChildNode.isEmpty()) {\n        newChildren = this.children_.remove(childName);\n        newIndexMap = this.indexMap_.removeFromIndexes(\n          namedNode,\n          this.children_\n        );\n      } else {\n        newChildren = this.children_.insert(childName, newChildNode);\n        newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n      }\n\n      const newPriority = newChildren.isEmpty()\n        ? EMPTY_NODE\n        : this.priorityNode_;\n      return new ChildrenNode(newChildren, newPriority, newIndexMap);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return newChildNode;\n    } else {\n      assert(\n        pathGetFront(path) !== '.priority' || pathGetLength(path) === 1,\n        '.priority must be the last token in a path'\n      );\n      const newImmediateChild = this.getImmediateChild(front).updateChild(\n        pathPopFront(path),\n        newChildNode\n      );\n      return this.updateImmediateChild(front, newImmediateChild);\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return this.children_.isEmpty();\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return this.children_.count();\n  }\n\n  private static INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n\n  /** @inheritDoc */\n  val(exportFormat?: boolean): object {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const obj: { [k: string]: unknown } = {};\n    let numKeys = 0,\n      maxKey = 0,\n      allIntegerKeys = true;\n    this.forEachChild(PRIORITY_INDEX, (key: string, childNode: Node) => {\n      obj[key] = childNode.val(exportFormat);\n\n      numKeys++;\n      if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\n        maxKey = Math.max(maxKey, Number(key));\n      } else {\n        allIntegerKeys = false;\n      }\n    });\n\n    if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n      // convert to array.\n      const array: unknown[] = [];\n      // eslint-disable-next-line guard-for-in\n      for (const key in obj) {\n        array[key as unknown as number] = obj[key];\n      }\n\n      return array;\n    } else {\n      if (exportFormat && !this.getPriority().isEmpty()) {\n        obj['.priority'] = this.getPriority().val();\n      }\n      return obj;\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.getPriority().isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.getPriority().val() as string | number) +\n          ':';\n      }\n\n      this.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n        const childHash = childNode.hash();\n        if (childHash !== '') {\n          toHash += ':' + key + ':' + childHash;\n        }\n      });\n\n      this.lazyHash_ = toHash === '' ? '' : sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      const predecessor = idx.getPredecessorKey(\n        new NamedNode(childName, childNode)\n      );\n      return predecessor ? predecessor.name : null;\n    } else {\n      return this.children_.getPredecessorKey(childName);\n    }\n  }\n\n  getFirstChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const minKey = idx.minKey();\n      return minKey && minKey.name;\n    } else {\n      return this.children_.minKey();\n    }\n  }\n\n  getFirstChild(indexDefinition: Index): NamedNode | null {\n    const minKey = this.getFirstChildName(indexDefinition);\n    if (minKey) {\n      return new NamedNode(minKey, this.children_.get(minKey));\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Given an index, return the key name of the largest value we have, according to that index\n   */\n  getLastChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const maxKey = idx.maxKey();\n      return maxKey && maxKey.name;\n    } else {\n      return this.children_.maxKey();\n    }\n  }\n\n  getLastChild(indexDefinition: Index): NamedNode | null {\n    const maxKey = this.getLastChildName(indexDefinition);\n    if (maxKey) {\n      return new NamedNode(maxKey, this.children_.get(maxKey));\n    } else {\n      return null;\n    }\n  }\n  forEachChild(\n    index: Index,\n    action: (key: string, node: Node) => boolean | void\n  ): boolean {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      return idx.inorderTraversal(wrappedNode => {\n        return action(wrappedNode.name, wrappedNode.node);\n      });\n    } else {\n      return this.children_.inorderTraversal(action);\n    }\n  }\n\n  getIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n  }\n\n  getIteratorFrom(\n    startPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getIteratorFrom(startPost, key => key);\n    } else {\n      const iterator = this.children_.getIteratorFrom(\n        startPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, startPost) < 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n\n  getReverseIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getReverseIteratorFrom(\n      indexDefinition.maxPost(),\n      indexDefinition\n    );\n  }\n\n  getReverseIteratorFrom(\n    endPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getReverseIteratorFrom(endPost, key => {\n        return key;\n      });\n    } else {\n      const iterator = this.children_.getReverseIteratorFrom(\n        endPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, endPost) > 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n  compareTo(other: ChildrenNode): number {\n    if (this.isEmpty()) {\n      if (other.isEmpty()) {\n        return 0;\n      } else {\n        return -1;\n      }\n    } else if (other.isLeafNode() || other.isEmpty()) {\n      return 1;\n    } else if (other === MAX_NODE) {\n      return -1;\n    } else {\n      // Must be another node with children.\n      return 0;\n    }\n  }\n  withIndex(indexDefinition: Index): Node {\n    if (\n      indexDefinition === KEY_INDEX ||\n      this.indexMap_.hasIndex(indexDefinition)\n    ) {\n      return this;\n    } else {\n      const newIndexMap = this.indexMap_.addIndex(\n        indexDefinition,\n        this.children_\n      );\n      return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n    }\n  }\n  isIndexed(index: Index): boolean {\n    return index === KEY_INDEX || this.indexMap_.hasIndex(index);\n  }\n  equals(other: Node): boolean {\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      return false;\n    } else {\n      const otherChildrenNode = other as ChildrenNode;\n      if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n        return false;\n      } else if (\n        this.children_.count() === otherChildrenNode.children_.count()\n      ) {\n        const thisIter = this.getIterator(PRIORITY_INDEX);\n        const otherIter = otherChildrenNode.getIterator(PRIORITY_INDEX);\n        let thisCurrent = thisIter.getNext();\n        let otherCurrent = otherIter.getNext();\n        while (thisCurrent && otherCurrent) {\n          if (\n            thisCurrent.name !== otherCurrent.name ||\n            !thisCurrent.node.equals(otherCurrent.node)\n          ) {\n            return false;\n          }\n          thisCurrent = thisIter.getNext();\n          otherCurrent = otherIter.getNext();\n        }\n        return thisCurrent === null && otherCurrent === null;\n      } else {\n        return false;\n      }\n    }\n  }\n\n  /**\n   * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n   * instead.\n   *\n   */\n  private resolveIndex_(\n    indexDefinition: Index\n  ): SortedMap<NamedNode, Node> | null {\n    if (indexDefinition === KEY_INDEX) {\n      return null;\n    } else {\n      return this.indexMap_.get(indexDefinition.toString());\n    }\n  }\n}\n\nexport class MaxNode extends ChildrenNode {\n  constructor() {\n    super(\n      new SortedMap<string, Node>(NAME_COMPARATOR),\n      ChildrenNode.EMPTY_NODE,\n      IndexMap.Default\n    );\n  }\n\n  compareTo(other: Node): number {\n    if (other === this) {\n      return 0;\n    } else {\n      return 1;\n    }\n  }\n\n  equals(other: Node): boolean {\n    // Not that we every compare it, but MAX_NODE is only ever equal to itself\n    return other === this;\n  }\n\n  getPriority(): MaxNode {\n    return this;\n  }\n\n  getImmediateChild(childName: string): ChildrenNode {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  isEmpty(): boolean {\n    return false;\n  }\n}\n\n/**\n * Marker that will sort higher than any other snapshot.\n */\nexport const MAX_NODE = new MaxNode();\n\n/**\n * Document NamedNode extensions\n */\ndeclare module './Node' {\n  interface NamedNode {\n    MIN: NamedNode;\n    MAX: NamedNode;\n  }\n}\n\nObject.defineProperties(NamedNode, {\n  MIN: {\n    value: new NamedNode(MIN_NAME, ChildrenNode.EMPTY_NODE)\n  },\n  MAX: {\n    value: new NamedNode(MAX_NAME, MAX_NODE)\n  }\n});\n\n/**\n * Reference Extensions\n */\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode.__childrenNodeConstructor = ChildrenNode;\nsetMaxNode(MAX_NODE);\nsetPriorityMaxNode(MAX_NODE);\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains, assert } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport { SortedMap } from '../util/SortedMap';\nimport { each } from '../util/util';\n\nimport { ChildrenNode } from './ChildrenNode';\nimport { buildChildSet } from './childSet';\nimport { NAME_COMPARATOR, NAME_ONLY_COMPARATOR } from './comparators';\nimport { PRIORITY_INDEX, setNodeFromJSON } from './indexes/PriorityIndex';\nimport { IndexMap } from './IndexMap';\nimport { LeafNode } from './LeafNode';\nimport { NamedNode, Node } from './Node';\n\nconst USE_HINZE = true;\n\n/**\n * Constructs a snapshot node representing the passed JSON and returns it.\n * @param json - JSON to create a node for.\n * @param priority - Optional priority to use.  This will be ignored if the\n * passed JSON contains a .priority property.\n */\nexport function nodeFromJSON(\n  json: unknown | null,\n  priority: unknown = null\n): Node {\n  if (json === null) {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  if (typeof json === 'object' && '.priority' in json) {\n    priority = json['.priority'];\n  }\n\n  assert(\n    priority === null ||\n      typeof priority === 'string' ||\n      typeof priority === 'number' ||\n      (typeof priority === 'object' && '.sv' in (priority as object)),\n    'Invalid priority type found: ' + typeof priority\n  );\n\n  if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\n    json = json['.value'];\n  }\n\n  // Valid leaf nodes include non-objects or server-value wrapper objects\n  if (typeof json !== 'object' || '.sv' in json) {\n    const jsonLeaf = json as string | number | boolean | Indexable;\n    return new LeafNode(jsonLeaf, nodeFromJSON(priority));\n  }\n\n  if (!(json instanceof Array) && USE_HINZE) {\n    const children: NamedNode[] = [];\n    let childrenHavePriority = false;\n    const hinzeJsonObj = json;\n    each(hinzeJsonObj, (key, child) => {\n      if (key.substring(0, 1) !== '.') {\n        // Ignore metadata nodes\n        const childNode = nodeFromJSON(child);\n        if (!childNode.isEmpty()) {\n          childrenHavePriority =\n            childrenHavePriority || !childNode.getPriority().isEmpty();\n          children.push(new NamedNode(key, childNode));\n        }\n      }\n    });\n\n    if (children.length === 0) {\n      return ChildrenNode.EMPTY_NODE;\n    }\n\n    const childSet = buildChildSet(\n      children,\n      NAME_ONLY_COMPARATOR,\n      namedNode => namedNode.name,\n      NAME_COMPARATOR\n    ) as SortedMap<string, Node>;\n    if (childrenHavePriority) {\n      const sortedChildSet = buildChildSet(\n        children,\n        PRIORITY_INDEX.getCompare()\n      );\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        new IndexMap(\n          { '.priority': sortedChildSet },\n          { '.priority': PRIORITY_INDEX }\n        )\n      );\n    } else {\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        IndexMap.Default\n      );\n    }\n  } else {\n    let node: Node = ChildrenNode.EMPTY_NODE;\n    each(json, (key: string, childData: unknown) => {\n      if (contains(json as object, key)) {\n        if (key.substring(0, 1) !== '.') {\n          // ignore metadata nodes.\n          const childNode = nodeFromJSON(childData);\n          if (childNode.isLeafNode() || !childNode.isEmpty()) {\n            node = node.updateImmediateChild(key, childNode);\n          }\n        }\n      }\n    });\n\n    return node.updatePriority(nodeFromJSON(priority));\n  }\n}\n\nsetNodeFromJSON(nodeFromJSON);\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { Path, pathGetFront, pathIsEmpty, pathSlice } from '../../util/Path';\nimport { MAX_NAME, nameCompare } from '../../util/util';\nimport { ChildrenNode, MAX_NODE } from '../ChildrenNode';\nimport { NamedNode, Node } from '../Node';\nimport { nodeFromJSON } from '../nodeFromJSON';\n\nimport { Index } from './Index';\n\nexport class PathIndex extends Index {\n  constructor(private indexPath_: Path) {\n    super();\n\n    assert(\n      !pathIsEmpty(indexPath_) && pathGetFront(indexPath_) !== '.priority',\n      \"Can't create PathIndex with empty path or .priority key\"\n    );\n  }\n\n  protected extractChild(snap: Node): Node {\n    return snap.getChild(this.indexPath_);\n  }\n  isDefinedOn(node: Node): boolean {\n    return !node.getChild(this.indexPath_).isEmpty();\n  }\n  compare(a: NamedNode, b: NamedNode): number {\n    const aChild = this.extractChild(a.node);\n    const bChild = this.extractChild(b.node);\n    const indexCmp = aChild.compareTo(bChild);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    const node = ChildrenNode.EMPTY_NODE.updateChild(\n      this.indexPath_,\n      valueNode\n    );\n    return new NamedNode(name, node);\n  }\n  maxPost(): NamedNode {\n    const node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, MAX_NODE);\n    return new NamedNode(MAX_NAME, node);\n  }\n  toString(): string {\n    return pathSlice(this.indexPath_, 0).join('/');\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { nameCompare } from '../../util/util';\nimport { NamedNode, Node } from '../Node';\nimport { nodeFromJSON } from '../nodeFromJSON';\n\nimport { Index } from './Index';\n\nexport class ValueIndex extends Index {\n  compare(a: NamedNode, b: NamedNode): number {\n    const indexCmp = a.node.compareTo(b.node);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  isDefinedOn(node: Node): boolean {\n    return true;\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.equals(newNode);\n  }\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MAX;\n  }\n\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, valueNode);\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.value';\n  }\n}\n\nexport const VALUE_INDEX = new ValueIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node } from '../snap/Node';\n\nexport const enum ChangeType {\n  /** Event type for a child added */\n  CHILD_ADDED = 'child_added',\n  /** Event type for a child removed */\n  CHILD_REMOVED = 'child_removed',\n  /** Event type for a child changed */\n  CHILD_CHANGED = 'child_changed',\n  /** Event type for a child moved */\n  CHILD_MOVED = 'child_moved',\n  /** Event type for a value change */\n  VALUE = 'value'\n}\n\nexport interface Change {\n  /** @param type - The event type */\n  type: ChangeType;\n  /** @param snapshotNode - The data */\n  snapshotNode: Node;\n  /** @param childName - The name for this child, if it's a child even */\n  childName?: string;\n  /** @param oldSnap - Used for intermediate processing of child changed events */\n  oldSnap?: Node;\n  /**  * @param prevName - The name for the previous child, if applicable */\n  prevName?: string | null;\n}\n\nexport function changeValue(snapshotNode: Node): Change {\n  return { type: ChangeType.VALUE, snapshotNode };\n}\n\nexport function changeChildAdded(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_ADDED, snapshotNode, childName };\n}\n\nexport function changeChildRemoved(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_REMOVED, snapshotNode, childName };\n}\n\nexport function changeChildChanged(\n  childName: string,\n  snapshotNode: Node,\n  oldSnap: Node\n): Change {\n  return {\n    type: ChangeType.CHILD_CHANGED,\n    snapshotNode,\n    childName,\n    oldSnap\n  };\n}\n\nexport function changeChildMoved(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_MOVED, snapshotNode, childName };\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { Node } from '../../snap/Node';\nimport { Path } from '../../util/Path';\nimport {\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from '../Change';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\n\nimport { NodeFilter } from './NodeFilter';\n\n/**\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n */\nexport class IndexedFilter implements NodeFilter {\n  constructor(private readonly index_: Index) {}\n\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    assert(\n      snap.isIndexed(this.index_),\n      'A node must be indexed if only a child is updated'\n    );\n    const oldChild = snap.getImmediateChild(key);\n    // Check if anything actually changed.\n    if (\n      oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))\n    ) {\n      // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\n      // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\n      // to avoid treating these cases as \"nothing changed.\"\n      if (oldChild.isEmpty() === newChild.isEmpty()) {\n        // Nothing changed.\n\n        // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\n        //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\n        return snap;\n      }\n    }\n\n    if (optChangeAccumulator != null) {\n      if (newChild.isEmpty()) {\n        if (snap.hasChild(key)) {\n          optChangeAccumulator.trackChildChange(\n            changeChildRemoved(key, oldChild)\n          );\n        } else {\n          assert(\n            snap.isLeafNode(),\n            'A child remove without an old child only makes sense on a leaf node'\n          );\n        }\n      } else if (oldChild.isEmpty()) {\n        optChangeAccumulator.trackChildChange(changeChildAdded(key, newChild));\n      } else {\n        optChangeAccumulator.trackChildChange(\n          changeChildChanged(key, newChild, oldChild)\n        );\n      }\n    }\n    if (snap.isLeafNode() && newChild.isEmpty()) {\n      return snap;\n    } else {\n      // Make sure the node is indexed\n      return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\n    }\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (optChangeAccumulator != null) {\n      if (!oldSnap.isLeafNode()) {\n        oldSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (!newSnap.hasChild(key)) {\n            optChangeAccumulator.trackChildChange(\n              changeChildRemoved(key, childNode)\n            );\n          }\n        });\n      }\n      if (!newSnap.isLeafNode()) {\n        newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (oldSnap.hasChild(key)) {\n            const oldChild = oldSnap.getImmediateChild(key);\n            if (!oldChild.equals(childNode)) {\n              optChangeAccumulator.trackChildChange(\n                changeChildChanged(key, childNode, oldChild)\n              );\n            }\n          } else {\n            optChangeAccumulator.trackChildChange(\n              changeChildAdded(key, childNode)\n            );\n          }\n        });\n      }\n    }\n    return newSnap.withIndex(this.index_);\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    if (oldSnap.isEmpty()) {\n      return ChildrenNode.EMPTY_NODE;\n    } else {\n      return oldSnap.updatePriority(newPriority);\n    }\n  }\n  filtersNodes(): boolean {\n    return false;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this;\n  }\n  getIndex(): Index {\n    return this.index_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { NamedNode, Node } from '../../../core/snap/Node';\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { Path } from '../../util/Path';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { QueryParams } from '../QueryParams';\n\nimport { IndexedFilter } from './IndexedFilter';\nimport { NodeFilter } from './NodeFilter';\n\n/**\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n */\nexport class RangedFilter implements NodeFilter {\n  private indexedFilter_: IndexedFilter;\n\n  private index_: Index;\n\n  private startPost_: NamedNode;\n\n  private endPost_: NamedNode;\n\n  private startIsInclusive_: boolean;\n\n  private endIsInclusive_: boolean;\n\n  constructor(params: QueryParams) {\n    this.indexedFilter_ = new IndexedFilter(params.getIndex());\n    this.index_ = params.getIndex();\n    this.startPost_ = RangedFilter.getStartPost_(params);\n    this.endPost_ = RangedFilter.getEndPost_(params);\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n\n  getStartPost(): NamedNode {\n    return this.startPost_;\n  }\n\n  getEndPost(): NamedNode {\n    return this.endPost_;\n  }\n\n  matches(node: NamedNode): boolean {\n    const isWithinStart = this.startIsInclusive_\n      ? this.index_.compare(this.getStartPost(), node) <= 0\n      : this.index_.compare(this.getStartPost(), node) < 0;\n    const isWithinEnd = this.endIsInclusive_\n      ? this.index_.compare(node, this.getEndPost()) <= 0\n      : this.index_.compare(node, this.getEndPost()) < 0;\n    return isWithinStart && isWithinEnd;\n  }\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    return this.indexedFilter_.updateChild(\n      snap,\n      key,\n      newChild,\n      affectedPath,\n      source,\n      optChangeAccumulator\n    );\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (newSnap.isLeafNode()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      newSnap = ChildrenNode.EMPTY_NODE;\n    }\n    let filtered = newSnap.withIndex(this.index_);\n    // Don't support priorities on queries\n    filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\n    const self = this;\n    newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n      if (!self.matches(new NamedNode(key, childNode))) {\n        filtered = filtered.updateImmediateChild(key, ChildrenNode.EMPTY_NODE);\n      }\n    });\n    return this.indexedFilter_.updateFullNode(\n      oldSnap,\n      filtered,\n      optChangeAccumulator\n    );\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes(): boolean {\n    return true;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this.indexedFilter_;\n  }\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  private static getStartPost_(params: QueryParams): NamedNode {\n    if (params.hasStart()) {\n      const startName = params.getIndexStartName();\n      return params.getIndex().makePost(params.getIndexStartValue(), startName);\n    } else {\n      return params.getIndex().minPost();\n    }\n  }\n\n  private static getEndPost_(params: QueryParams): NamedNode {\n    if (params.hasEnd()) {\n      const endName = params.getIndexEndName();\n      return params.getIndex().makePost(params.getIndexEndValue(), endName);\n    } else {\n      return params.getIndex().maxPost();\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { NamedNode, Node } from '../../snap/Node';\nimport { Path } from '../../util/Path';\nimport {\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from '../Change';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { QueryParams } from '../QueryParams';\n\nimport { IndexedFilter } from './IndexedFilter';\nimport { NodeFilter } from './NodeFilter';\nimport { RangedFilter } from './RangedFilter';\n\n/**\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n */\nexport class LimitedFilter implements NodeFilter {\n  private readonly rangedFilter_: RangedFilter;\n\n  private readonly index_: Index;\n\n  private readonly limit_: number;\n\n  private readonly reverse_: boolean;\n\n  private readonly startIsInclusive_: boolean;\n\n  private readonly endIsInclusive_: boolean;\n\n  constructor(params: QueryParams) {\n    this.rangedFilter_ = new RangedFilter(params);\n    this.index_ = params.getIndex();\n    this.limit_ = params.getLimit();\n    this.reverse_ = !params.isViewFromLeft();\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.rangedFilter_.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    if (snap.getImmediateChild(key).equals(newChild)) {\n      // No change\n      return snap;\n    } else if (snap.numChildren() < this.limit_) {\n      return this.rangedFilter_\n        .getIndexedFilter()\n        .updateChild(\n          snap,\n          key,\n          newChild,\n          affectedPath,\n          source,\n          optChangeAccumulator\n        );\n    } else {\n      return this.fullLimitUpdateChild_(\n        snap,\n        key,\n        newChild,\n        source,\n        optChangeAccumulator\n      );\n    }\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    let filtered;\n    if (newSnap.isLeafNode() || newSnap.isEmpty()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n    } else {\n      if (\n        this.limit_ * 2 < newSnap.numChildren() &&\n        newSnap.isIndexed(this.index_)\n      ) {\n        // Easier to build up a snapshot, since what we're given has more than twice the elements we want\n        filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n        // anchor to the startPost, endPost, or last element as appropriate\n        let iterator;\n        if (this.reverse_) {\n          iterator = (newSnap as ChildrenNode).getReverseIteratorFrom(\n            this.rangedFilter_.getEndPost(),\n            this.index_\n          );\n        } else {\n          iterator = (newSnap as ChildrenNode).getIteratorFrom(\n            this.rangedFilter_.getStartPost(),\n            this.index_\n          );\n        }\n        let count = 0;\n        while (iterator.hasNext() && count < this.limit_) {\n          const next = iterator.getNext();\n          if (!this.withinDirectionalStart(next)) {\n            // if we have not reached the start, skip to the next element\n            continue;\n          } else if (!this.withinDirectionalEnd(next)) {\n            // if we have reached the end, stop adding elements\n            break;\n          } else {\n            filtered = filtered.updateImmediateChild(next.name, next.node);\n            count++;\n          }\n        }\n      } else {\n        // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n        filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(\n          ChildrenNode.EMPTY_NODE\n        ) as ChildrenNode;\n\n        let iterator;\n        if (this.reverse_) {\n          iterator = filtered.getReverseIterator(this.index_);\n        } else {\n          iterator = filtered.getIterator(this.index_);\n        }\n\n        let count = 0;\n        while (iterator.hasNext()) {\n          const next = iterator.getNext();\n          const inRange =\n            count < this.limit_ &&\n            this.withinDirectionalStart(next) &&\n            this.withinDirectionalEnd(next);\n          if (inRange) {\n            count++;\n          } else {\n            filtered = filtered.updateImmediateChild(\n              next.name,\n              ChildrenNode.EMPTY_NODE\n            );\n          }\n        }\n      }\n    }\n    return this.rangedFilter_\n      .getIndexedFilter()\n      .updateFullNode(oldSnap, filtered, optChangeAccumulator);\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes(): boolean {\n    return true;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this.rangedFilter_.getIndexedFilter();\n  }\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  private fullLimitUpdateChild_(\n    snap: Node,\n    childKey: string,\n    childSnap: Node,\n    source: CompleteChildSource,\n    changeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    // TODO: rename all cache stuff etc to general snap terminology\n    let cmp;\n    if (this.reverse_) {\n      const indexCmp = this.index_.getCompare();\n      cmp = (a: NamedNode, b: NamedNode) => indexCmp(b, a);\n    } else {\n      cmp = this.index_.getCompare();\n    }\n    const oldEventCache = snap as ChildrenNode;\n    assert(oldEventCache.numChildren() === this.limit_, '');\n    const newChildNamedNode = new NamedNode(childKey, childSnap);\n    const windowBoundary = this.reverse_\n      ? oldEventCache.getFirstChild(this.index_)\n      : (oldEventCache.getLastChild(this.index_) as NamedNode);\n    const inRange = this.rangedFilter_.matches(newChildNamedNode);\n    if (oldEventCache.hasChild(childKey)) {\n      const oldChildSnap = oldEventCache.getImmediateChild(childKey);\n      let nextChild = source.getChildAfterChild(\n        this.index_,\n        windowBoundary,\n        this.reverse_\n      );\n      while (\n        nextChild != null &&\n        (nextChild.name === childKey || oldEventCache.hasChild(nextChild.name))\n      ) {\n        // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\n        // been applied to the limited filter yet. Ignore this next child which will be updated later in\n        // the limited filter...\n        nextChild = source.getChildAfterChild(\n          this.index_,\n          nextChild,\n          this.reverse_\n        );\n      }\n      const compareNext =\n        nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n      const remainsInWindow =\n        inRange && !childSnap.isEmpty() && compareNext >= 0;\n      if (remainsInWindow) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildChanged(childKey, childSnap, oldChildSnap)\n          );\n        }\n        return oldEventCache.updateImmediateChild(childKey, childSnap);\n      } else {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildRemoved(childKey, oldChildSnap)\n          );\n        }\n        const newEventCache = oldEventCache.updateImmediateChild(\n          childKey,\n          ChildrenNode.EMPTY_NODE\n        );\n        const nextChildInRange =\n          nextChild != null && this.rangedFilter_.matches(nextChild);\n        if (nextChildInRange) {\n          if (changeAccumulator != null) {\n            changeAccumulator.trackChildChange(\n              changeChildAdded(nextChild.name, nextChild.node)\n            );\n          }\n          return newEventCache.updateImmediateChild(\n            nextChild.name,\n            nextChild.node\n          );\n        } else {\n          return newEventCache;\n        }\n      }\n    } else if (childSnap.isEmpty()) {\n      // we're deleting a node, but it was not in the window, so ignore it\n      return snap;\n    } else if (inRange) {\n      if (cmp(windowBoundary, newChildNamedNode) >= 0) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildRemoved(windowBoundary.name, windowBoundary.node)\n          );\n          changeAccumulator.trackChildChange(\n            changeChildAdded(childKey, childSnap)\n          );\n        }\n        return oldEventCache\n          .updateImmediateChild(childKey, childSnap)\n          .updateImmediateChild(windowBoundary.name, ChildrenNode.EMPTY_NODE);\n      } else {\n        return snap;\n      }\n    } else {\n      return snap;\n    }\n  }\n\n  private withinDirectionalStart = (node: NamedNode) =>\n    this.reverse_ ? this.withinEndPost(node) : this.withinStartPost(node);\n\n  private withinDirectionalEnd = (node: NamedNode) =>\n    this.reverse_ ? this.withinStartPost(node) : this.withinEndPost(node);\n\n  private withinStartPost = (node: NamedNode) => {\n    const compareRes = this.index_.compare(\n      this.rangedFilter_.getStartPost(),\n      node\n    );\n    return this.startIsInclusive_ ? compareRes <= 0 : compareRes < 0;\n  };\n\n  private withinEndPost = (node: NamedNode) => {\n    const compareRes = this.index_.compare(\n      node,\n      this.rangedFilter_.getEndPost()\n    );\n    return this.endIsInclusive_ ? compareRes <= 0 : compareRes < 0;\n  };\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, stringify } from '@firebase/util';\n\nimport { Index } from '../snap/indexes/Index';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { PathIndex } from '../snap/indexes/PathIndex';\nimport { PRIORITY_INDEX, PriorityIndex } from '../snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../snap/indexes/ValueIndex';\nimport { MAX_NAME, MIN_NAME } from '../util/util';\n\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { LimitedFilter } from './filter/LimitedFilter';\nimport { NodeFilter } from './filter/NodeFilter';\nimport { RangedFilter } from './filter/RangedFilter';\n\n/**\n * Wire Protocol Constants\n */\nconst enum WIRE_PROTOCOL_CONSTANTS {\n  INDEX_START_VALUE = 'sp',\n  INDEX_START_NAME = 'sn',\n  INDEX_START_IS_INCLUSIVE = 'sin',\n  INDEX_END_VALUE = 'ep',\n  INDEX_END_NAME = 'en',\n  INDEX_END_IS_INCLUSIVE = 'ein',\n  LIMIT = 'l',\n  VIEW_FROM = 'vf',\n  VIEW_FROM_LEFT = 'l',\n  VIEW_FROM_RIGHT = 'r',\n  INDEX = 'i'\n}\n\n/**\n * REST Query Constants\n */\nconst enum REST_QUERY_CONSTANTS {\n  ORDER_BY = 'orderBy',\n  PRIORITY_INDEX = '$priority',\n  VALUE_INDEX = '$value',\n  KEY_INDEX = '$key',\n  START_AFTER = 'startAfter',\n  START_AT = 'startAt',\n  END_AT = 'endAt',\n  END_BEFORE = 'endBefore',\n  LIMIT_TO_FIRST = 'limitToFirst',\n  LIMIT_TO_LAST = 'limitToLast'\n}\n\n/**\n * This class is an immutable-from-the-public-api struct containing a set of query parameters defining a\n * range to be returned for a particular location. It is assumed that validation of parameters is done at the\n * user-facing API level, so it is not done here.\n *\n * @internal\n */\nexport class QueryParams {\n  limitSet_ = false;\n  startSet_ = false;\n  startNameSet_ = false;\n  startAfterSet_ = false; // can only be true if startSet_ is true\n  endSet_ = false;\n  endNameSet_ = false;\n  endBeforeSet_ = false; // can only be true if endSet_ is true\n  limit_ = 0;\n  viewFrom_ = '';\n  indexStartValue_: unknown | null = null;\n  indexStartName_ = '';\n  indexEndValue_: unknown | null = null;\n  indexEndName_ = '';\n  index_: PriorityIndex = PRIORITY_INDEX;\n\n  hasStart(): boolean {\n    return this.startSet_;\n  }\n\n  /**\n   * @returns True if it would return from left.\n   */\n  isViewFromLeft(): boolean {\n    if (this.viewFrom_ === '') {\n      // limit(), rather than limitToFirst or limitToLast was called.\n      // This means that only one of startSet_ and endSet_ is true. Use them\n      // to calculate which side of the view to anchor to. If neither is set,\n      // anchor to the end.\n      return this.startSet_;\n    } else {\n      return this.viewFrom_ === WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n    }\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true\n   */\n  getIndexStartValue(): unknown {\n    assert(this.startSet_, 'Only valid if start has been set');\n    return this.indexStartValue_;\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true.\n   * Returns the starting key name for the range defined by these query parameters\n   */\n  getIndexStartName(): string {\n    assert(this.startSet_, 'Only valid if start has been set');\n    if (this.startNameSet_) {\n      return this.indexStartName_;\n    } else {\n      return MIN_NAME;\n    }\n  }\n\n  hasEnd(): boolean {\n    return this.endSet_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   */\n  getIndexEndValue(): unknown {\n    assert(this.endSet_, 'Only valid if end has been set');\n    return this.indexEndValue_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   * Returns the end key name for the range defined by these query parameters\n   */\n  getIndexEndName(): string {\n    assert(this.endSet_, 'Only valid if end has been set');\n    if (this.endNameSet_) {\n      return this.indexEndName_;\n    } else {\n      return MAX_NAME;\n    }\n  }\n\n  hasLimit(): boolean {\n    return this.limitSet_;\n  }\n\n  /**\n   * @returns True if a limit has been set and it has been explicitly anchored\n   */\n  hasAnchoredLimit(): boolean {\n    return this.limitSet_ && this.viewFrom_ !== '';\n  }\n\n  /**\n   * Only valid to call if hasLimit() returns true\n   */\n  getLimit(): number {\n    assert(this.limitSet_, 'Only valid if limit has been set');\n    return this.limit_;\n  }\n\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  loadsAllData(): boolean {\n    return !(this.startSet_ || this.endSet_ || this.limitSet_);\n  }\n\n  isDefault(): boolean {\n    return this.loadsAllData() && this.index_ === PRIORITY_INDEX;\n  }\n\n  copy(): QueryParams {\n    const copy = new QueryParams();\n    copy.limitSet_ = this.limitSet_;\n    copy.limit_ = this.limit_;\n    copy.startSet_ = this.startSet_;\n    copy.startAfterSet_ = this.startAfterSet_;\n    copy.indexStartValue_ = this.indexStartValue_;\n    copy.startNameSet_ = this.startNameSet_;\n    copy.indexStartName_ = this.indexStartName_;\n    copy.endSet_ = this.endSet_;\n    copy.endBeforeSet_ = this.endBeforeSet_;\n    copy.indexEndValue_ = this.indexEndValue_;\n    copy.endNameSet_ = this.endNameSet_;\n    copy.indexEndName_ = this.indexEndName_;\n    copy.index_ = this.index_;\n    copy.viewFrom_ = this.viewFrom_;\n    return copy;\n  }\n}\n\nexport function queryParamsGetNodeFilter(queryParams: QueryParams): NodeFilter {\n  if (queryParams.loadsAllData()) {\n    return new IndexedFilter(queryParams.getIndex());\n  } else if (queryParams.hasLimit()) {\n    return new LimitedFilter(queryParams);\n  } else {\n    return new RangedFilter(queryParams);\n  }\n}\n\nexport function queryParamsLimit(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = '';\n  return newParams;\n}\n\nexport function queryParamsLimitToFirst(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n  return newParams;\n}\n\nexport function queryParamsLimitToLast(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n  return newParams;\n}\n\nexport function queryParamsStartAt(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.startSet_ = true;\n  if (indexValue === undefined) {\n    indexValue = null;\n  }\n  newParams.indexStartValue_ = indexValue;\n  if (key != null) {\n    newParams.startNameSet_ = true;\n    newParams.indexStartName_ = key;\n  } else {\n    newParams.startNameSet_ = false;\n    newParams.indexStartName_ = '';\n  }\n  return newParams;\n}\n\nexport function queryParamsStartAfter(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  let params: QueryParams;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsStartAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsStartAt(queryParams, indexValue, MAX_NAME);\n  }\n  params.startAfterSet_ = true;\n  return params;\n}\n\nexport function queryParamsEndAt(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.endSet_ = true;\n  if (indexValue === undefined) {\n    indexValue = null;\n  }\n  newParams.indexEndValue_ = indexValue;\n  if (key !== undefined) {\n    newParams.endNameSet_ = true;\n    newParams.indexEndName_ = key;\n  } else {\n    newParams.endNameSet_ = false;\n    newParams.indexEndName_ = '';\n  }\n  return newParams;\n}\n\nexport function queryParamsEndBefore(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  let params: QueryParams;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsEndAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsEndAt(queryParams, indexValue, MIN_NAME);\n  }\n  params.endBeforeSet_ = true;\n  return params;\n}\n\nexport function queryParamsOrderBy(\n  queryParams: QueryParams,\n  index: Index\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.index_ = index;\n  return newParams;\n}\n\n/**\n * Returns a set of REST query string parameters representing this query.\n *\n * @returns query string parameters\n */\nexport function queryParamsToRestQueryStringParameters(\n  queryParams: QueryParams\n): Record<string, string | number> {\n  const qs: Record<string, string | number> = {};\n\n  if (queryParams.isDefault()) {\n    return qs;\n  }\n\n  let orderBy;\n  if (queryParams.index_ === PRIORITY_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.PRIORITY_INDEX;\n  } else if (queryParams.index_ === VALUE_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.VALUE_INDEX;\n  } else if (queryParams.index_ === KEY_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.KEY_INDEX;\n  } else {\n    assert(queryParams.index_ instanceof PathIndex, 'Unrecognized index type!');\n    orderBy = queryParams.index_.toString();\n  }\n  qs[REST_QUERY_CONSTANTS.ORDER_BY] = stringify(orderBy);\n\n  if (queryParams.startSet_) {\n    const startParam = queryParams.startAfterSet_\n      ? REST_QUERY_CONSTANTS.START_AFTER\n      : REST_QUERY_CONSTANTS.START_AT;\n    qs[startParam] = stringify(queryParams.indexStartValue_);\n    if (queryParams.startNameSet_) {\n      qs[startParam] += ',' + stringify(queryParams.indexStartName_);\n    }\n  }\n\n  if (queryParams.endSet_) {\n    const endParam = queryParams.endBeforeSet_\n      ? REST_QUERY_CONSTANTS.END_BEFORE\n      : REST_QUERY_CONSTANTS.END_AT;\n    qs[endParam] = stringify(queryParams.indexEndValue_);\n    if (queryParams.endNameSet_) {\n      qs[endParam] += ',' + stringify(queryParams.indexEndName_);\n    }\n  }\n\n  if (queryParams.limitSet_) {\n    if (queryParams.isViewFromLeft()) {\n      qs[REST_QUERY_CONSTANTS.LIMIT_TO_FIRST] = queryParams.limit_;\n    } else {\n      qs[REST_QUERY_CONSTANTS.LIMIT_TO_LAST] = queryParams.limit_;\n    }\n  }\n\n  return qs;\n}\n\nexport function queryParamsGetQueryObject(\n  queryParams: QueryParams\n): Record<string, unknown> {\n  const obj: Record<string, unknown> = {};\n  if (queryParams.startSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] =\n      queryParams.indexStartValue_;\n    if (queryParams.startNameSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] =\n        queryParams.indexStartName_;\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_IS_INCLUSIVE] =\n      !queryParams.startAfterSet_;\n  }\n  if (queryParams.endSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = queryParams.indexEndValue_;\n    if (queryParams.endNameSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = queryParams.indexEndName_;\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_IS_INCLUSIVE] =\n      !queryParams.endBeforeSet_;\n  }\n  if (queryParams.limitSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = queryParams.limit_;\n    let viewFrom = queryParams.viewFrom_;\n    if (viewFrom === '') {\n      if (queryParams.isViewFromLeft()) {\n        viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n      } else {\n        viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n      }\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\n  }\n  // For now, priority index is the default, so we only specify if it's some other index\n  if (queryParams.index_ !== PRIORITY_INDEX) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = queryParams.index_.toString();\n  }\n  return obj;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  assert,\n  jsonEval,\n  safeGet,\n  querystring,\n  Deferred\n} from '@firebase/util';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { logWrapper, warn } from './util/util';\nimport { QueryContext } from './view/EventRegistration';\nimport { queryParamsToRestQueryStringParameters } from './view/QueryParams';\n\n/**\n * An implementation of ServerActions that communicates with the server via REST requests.\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\n * persistent connection (using WebSockets or long-polling)\n */\nexport class ReadonlyRestClient extends ServerActions {\n  reportStats(stats: { [k: string]: unknown }): void {\n    throw new Error('Method not implemented.');\n  }\n\n  /** @private {function(...[*])} */\n  private log_: (...args: unknown[]) => void = logWrapper('p:rest:');\n\n  /**\n   * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\n   * that's been removed. :-/\n   */\n  private listens_: { [k: string]: object } = {};\n\n  static getListenId_(query: QueryContext, tag?: number | null): string {\n    if (tag !== undefined) {\n      return 'tag$' + tag;\n    } else {\n      assert(\n        query._queryParams.isDefault(),\n        \"should have a tag if it's not a default query.\"\n      );\n      return query._path.toString();\n    }\n  }\n\n  /**\n   * @param repoInfo_ - Data about the namespace we are connecting to\n   * @param onDataUpdate_ - A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private appCheckTokenProvider_: AppCheckTokenProvider\n  ) {\n    super();\n  }\n\n  /** @inheritDoc */\n  listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    const pathString = query._path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + query._queryIdentifier);\n\n    // Mark this listener so we can tell if it's removed.\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    const thisListen = {};\n    this.listens_[listenId] = thisListen;\n\n    const queryStringParameters = queryParamsToRestQueryStringParameters(\n      query._queryParams\n    );\n\n    this.restRequest_(\n      pathString + '.json',\n      queryStringParameters,\n      (error, result) => {\n        let data = result;\n\n        if (error === 404) {\n          data = null;\n          error = null;\n        }\n\n        if (error === null) {\n          this.onDataUpdate_(pathString, data, /*isMerge=*/ false, tag);\n        }\n\n        if (safeGet(this.listens_, listenId) === thisListen) {\n          let status;\n          if (!error) {\n            status = 'ok';\n          } else if (error === 401) {\n            status = 'permission_denied';\n          } else {\n            status = 'rest_error:' + error;\n          }\n\n          onComplete(status, null);\n        }\n      }\n    );\n  }\n\n  /** @inheritDoc */\n  unlisten(query: QueryContext, tag: number | null) {\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    delete this.listens_[listenId];\n  }\n\n  get(query: QueryContext): Promise<string> {\n    const queryStringParameters = queryParamsToRestQueryStringParameters(\n      query._queryParams\n    );\n\n    const pathString = query._path.toString();\n\n    const deferred = new Deferred<string>();\n\n    this.restRequest_(\n      pathString + '.json',\n      queryStringParameters,\n      (error, result) => {\n        let data = result;\n\n        if (error === 404) {\n          data = null;\n          error = null;\n        }\n\n        if (error === null) {\n          this.onDataUpdate_(\n            pathString,\n            data,\n            /*isMerge=*/ false,\n            /*tag=*/ null\n          );\n          deferred.resolve(data as string);\n        } else {\n          deferred.reject(new Error(data as string));\n        }\n      }\n    );\n    return deferred.promise;\n  }\n\n  /** @inheritDoc */\n  refreshAuthToken(token: string) {\n    // no-op since we just always call getToken.\n  }\n\n  /**\n   * Performs a REST request to the given path, with the provided query string parameters,\n   * and any auth credentials we have.\n   */\n  private restRequest_(\n    pathString: string,\n    queryStringParameters: { [k: string]: string | number } = {},\n    callback: ((a: number | null, b?: unknown) => void) | null\n  ) {\n    queryStringParameters['format'] = 'export';\n\n    return Promise.all([\n      this.authTokenProvider_.getToken(/*forceRefresh=*/ false),\n      this.appCheckTokenProvider_.getToken(/*forceRefresh=*/ false)\n    ]).then(([authToken, appCheckToken]) => {\n      if (authToken && authToken.accessToken) {\n        queryStringParameters['auth'] = authToken.accessToken;\n      }\n      if (appCheckToken && appCheckToken.token) {\n        queryStringParameters['ac'] = appCheckToken.token;\n      }\n\n      const url =\n        (this.repoInfo_.secure ? 'https://' : 'http://') +\n        this.repoInfo_.host +\n        pathString +\n        '?' +\n        'ns=' +\n        this.repoInfo_.namespace +\n        querystring(queryStringParameters);\n\n      this.log_('Sending REST request for ' + url);\n      const xhr = new XMLHttpRequest();\n      xhr.onreadystatechange = () => {\n        if (callback && xhr.readyState === 4) {\n          this.log_(\n            'REST Response for ' + url + ' received. status:',\n            xhr.status,\n            'response:',\n            xhr.responseText\n          );\n          let res = null;\n          if (xhr.status >= 200 && xhr.status < 300) {\n            try {\n              res = jsonEval(xhr.responseText);\n            } catch (e) {\n              warn(\n                'Failed to parse JSON response for ' +\n                  url +\n                  ': ' +\n                  xhr.responseText\n              );\n            }\n            callback(null, res);\n          } else {\n            // 401 and 404 are expected.\n            if (xhr.status !== 401 && xhr.status !== 404) {\n              warn(\n                'Got unsuccessful REST response for ' +\n                  url +\n                  ' Status: ' +\n                  xhr.status\n              );\n            }\n            callback(xhr.status);\n          }\n          callback = null;\n        }\n      };\n\n      xhr.open('GET', url, /*asynchronous=*/ true);\n      xhr.send();\n    });\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { Path } from './util/Path';\n\n/**\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n */\nexport class SnapshotHolder {\n  private rootNode_: Node = ChildrenNode.EMPTY_NODE;\n\n  getNode(path: Path): Node {\n    return this.rootNode_.getChild(path);\n  }\n\n  updateSnapshot(path: Path, newSnapshotNode: Node) {\n    this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { Node } from './snap/Node';\nimport { Path, pathGetFront, pathIsEmpty, pathPopFront } from './util/Path';\n\n/**\n * Helper class to store a sparse set of snapshots.\n */\nexport interface SparseSnapshotTree {\n  value: Node | null;\n  readonly children: Map<string, SparseSnapshotTree>;\n}\n\nexport function newSparseSnapshotTree(): SparseSnapshotTree {\n  return {\n    value: null,\n    children: new Map()\n  };\n}\n\n/**\n * Gets the node stored at the given path if one exists.\n * Only seems to be used in tests.\n *\n * @param path - Path to look up snapshot for.\n * @returns The retrieved node, or null.\n */\nexport function sparseSnapshotTreeFind(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path\n): Node | null {\n  if (sparseSnapshotTree.value != null) {\n    return sparseSnapshotTree.value.getChild(path);\n  } else if (!pathIsEmpty(path) && sparseSnapshotTree.children.size > 0) {\n    const childKey = pathGetFront(path);\n    path = pathPopFront(path);\n    if (sparseSnapshotTree.children.has(childKey)) {\n      const childTree = sparseSnapshotTree.children.get(childKey);\n      return sparseSnapshotTreeFind(childTree, path);\n    } else {\n      return null;\n    }\n  } else {\n    return null;\n  }\n}\n\n/**\n * Stores the given node at the specified path. If there is already a node\n * at a shallower path, it merges the new data into that snapshot node.\n *\n * @param path - Path to look up snapshot for.\n * @param data - The new data, or null.\n */\nexport function sparseSnapshotTreeRemember(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path,\n  data: Node\n): void {\n  if (pathIsEmpty(path)) {\n    sparseSnapshotTree.value = data;\n    sparseSnapshotTree.children.clear();\n  } else if (sparseSnapshotTree.value !== null) {\n    sparseSnapshotTree.value = sparseSnapshotTree.value.updateChild(path, data);\n  } else {\n    const childKey = pathGetFront(path);\n    if (!sparseSnapshotTree.children.has(childKey)) {\n      sparseSnapshotTree.children.set(childKey, newSparseSnapshotTree());\n    }\n\n    const child = sparseSnapshotTree.children.get(childKey);\n    path = pathPopFront(path);\n    sparseSnapshotTreeRemember(child, path, data);\n  }\n}\n\n/**\n * Purge the data at path from the cache.\n *\n * @param path - Path to look up snapshot for.\n * @returns True if this node should now be removed.\n */\nexport function sparseSnapshotTreeForget(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path\n): boolean {\n  if (pathIsEmpty(path)) {\n    sparseSnapshotTree.value = null;\n    sparseSnapshotTree.children.clear();\n    return true;\n  } else {\n    if (sparseSnapshotTree.value !== null) {\n      if (sparseSnapshotTree.value.isLeafNode()) {\n        // We're trying to forget a node that doesn't exist\n        return false;\n      } else {\n        const value = sparseSnapshotTree.value;\n        sparseSnapshotTree.value = null;\n\n        value.forEachChild(PRIORITY_INDEX, (key, tree) => {\n          sparseSnapshotTreeRemember(sparseSnapshotTree, new Path(key), tree);\n        });\n\n        return sparseSnapshotTreeForget(sparseSnapshotTree, path);\n      }\n    } else if (sparseSnapshotTree.children.size > 0) {\n      const childKey = pathGetFront(path);\n      path = pathPopFront(path);\n      if (sparseSnapshotTree.children.has(childKey)) {\n        const safeToRemove = sparseSnapshotTreeForget(\n          sparseSnapshotTree.children.get(childKey),\n          path\n        );\n        if (safeToRemove) {\n          sparseSnapshotTree.children.delete(childKey);\n        }\n      }\n\n      return sparseSnapshotTree.children.size === 0;\n    } else {\n      return true;\n    }\n  }\n}\n\n/**\n * Recursively iterates through all of the stored tree and calls the\n * callback on each one.\n *\n * @param prefixPath - Path to look up node for.\n * @param func - The function to invoke for each tree.\n */\nexport function sparseSnapshotTreeForEachTree(\n  sparseSnapshotTree: SparseSnapshotTree,\n  prefixPath: Path,\n  func: (a: Path, b: Node) => unknown\n): void {\n  if (sparseSnapshotTree.value !== null) {\n    func(prefixPath, sparseSnapshotTree.value);\n  } else {\n    sparseSnapshotTreeForEachChild(sparseSnapshotTree, (key, tree) => {\n      const path = new Path(prefixPath.toString() + '/' + key);\n      sparseSnapshotTreeForEachTree(tree, path, func);\n    });\n  }\n}\n\n/**\n * Iterates through each immediate child and triggers the callback.\n * Only seems to be used in tests.\n *\n * @param func - The function to invoke for each child.\n */\nexport function sparseSnapshotTreeForEachChild(\n  sparseSnapshotTree: SparseSnapshotTree,\n  func: (a: string, b: SparseSnapshotTree) => void\n): void {\n  sparseSnapshotTree.children.forEach((tree, key) => {\n    func(key, tree);\n  });\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { each } from '../util/util';\n\nimport { StatsCollection } from './StatsCollection';\n\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ - The collection to \"listen\" to.\n */\nexport class StatsListener {\n  private last_: { [k: string]: number } | null = null;\n\n  constructor(private collection_: StatsCollection) {}\n\n  get(): { [k: string]: number } {\n    const newStats = this.collection_.get();\n\n    const delta = { ...newStats };\n    if (this.last_) {\n      each(this.last_, (stat: string, value: number) => {\n        delta[stat] = delta[stat] - value;\n      });\n    }\n    this.last_ = newStats;\n\n    return delta;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains } from '@firebase/util';\n\nimport { ServerActions } from '../ServerActions';\nimport { setTimeoutNonBlocking, each } from '../util/util';\n\nimport { StatsCollection } from './StatsCollection';\nimport { StatsListener } from './StatsListener';\n\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\n// seconds to try to ensure the Firebase connection is established / settled.\nconst FIRST_STATS_MIN_TIME = 10 * 1000;\nconst FIRST_STATS_MAX_TIME = 30 * 1000;\n\n// We'll continue to report stats on average every 5 minutes.\nconst REPORT_STATS_INTERVAL = 5 * 60 * 1000;\n\nexport class StatsReporter {\n  private statsListener_: StatsListener;\n  statsToReport_: { [k: string]: boolean } = {};\n\n  constructor(collection: StatsCollection, private server_: ServerActions) {\n    this.statsListener_ = new StatsListener(collection);\n\n    const timeout =\n      FIRST_STATS_MIN_TIME +\n      (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n    setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n  }\n\n  private reportStats_() {\n    const stats = this.statsListener_.get();\n    const reportedStats: typeof stats = {};\n    let haveStatsToReport = false;\n\n    each(stats, (stat: string, value: number) => {\n      if (value > 0 && contains(this.statsToReport_, stat)) {\n        reportedStats[stat] = value;\n        haveStatsToReport = true;\n      }\n    });\n\n    if (haveStatsToReport) {\n      this.server_.reportStats(reportedStats);\n    }\n\n    // queue our next run.\n    setTimeoutNonBlocking(\n      this.reportStats_.bind(this),\n      Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL)\n    );\n  }\n}\n\nexport function statsReporterIncludeStat(\n  reporter: StatsReporter,\n  stat: string\n) {\n  reporter.statsToReport_[stat] = true;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../util/Path';\n\n/**\n *\n * @enum\n */\nexport enum OperationType {\n  OVERWRITE,\n  MERGE,\n  ACK_USER_WRITE,\n  LISTEN_COMPLETE\n}\n\n/**\n * @interface\n */\nexport interface Operation {\n  source: OperationSource;\n\n  type: OperationType;\n\n  path: Path;\n\n  operationForChild(childName: string): Operation | null;\n}\n\nexport interface OperationSource {\n  fromUser: boolean;\n  fromServer: boolean;\n  queryId: string | null;\n  tagged: boolean;\n}\n\nexport function newOperationSourceUser(): OperationSource {\n  return {\n    fromUser: true,\n    fromServer: false,\n    queryId: null,\n    tagged: false\n  };\n}\n\nexport function newOperationSourceServer(): OperationSource {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId: null,\n    tagged: false\n  };\n}\n\nexport function newOperationSourceServerTaggedQuery(\n  queryId: string\n): OperationSource {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId,\n    tagged: true\n  };\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\n\nimport { newOperationSourceUser, Operation, OperationType } from './Operation';\n\nexport class AckUserWrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.ACK_USER_WRITE;\n\n  /** @inheritDoc */\n  source = newOperationSourceUser();\n\n  /**\n   * @param affectedTree - A tree containing true for each affected path. Affected paths can't overlap.\n   */\n  constructor(\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public affectedTree: ImmutableTree<boolean>,\n    /** @inheritDoc */ public revert: boolean\n  ) {}\n  operationForChild(childName: string): AckUserWrite {\n    if (!pathIsEmpty(this.path)) {\n      assert(\n        pathGetFront(this.path) === childName,\n        'operationForChild called for unrelated child.'\n      );\n      return new AckUserWrite(\n        pathPopFront(this.path),\n        this.affectedTree,\n        this.revert\n      );\n    } else if (this.affectedTree.value != null) {\n      assert(\n        this.affectedTree.children.isEmpty(),\n        'affectedTree should not have overlapping affected paths.'\n      );\n      // All child locations are affected as well; just return same operation.\n      return this;\n    } else {\n      const childTree = this.affectedTree.subtree(new Path(childName));\n      return new AckUserWrite(newEmptyPath(), childTree, this.revert);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { newEmptyPath, Path, pathIsEmpty, pathPopFront } from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\n\nexport class ListenComplete implements Operation {\n  /** @inheritDoc */\n  type = OperationType.LISTEN_COMPLETE;\n\n  constructor(public source: OperationSource, public path: Path) {}\n\n  operationForChild(childName: string): ListenComplete {\n    if (pathIsEmpty(this.path)) {\n      return new ListenComplete(this.source, newEmptyPath());\n    } else {\n      return new ListenComplete(this.source, pathPopFront(this.path));\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node } from '../snap/Node';\nimport { newEmptyPath, Path, pathIsEmpty, pathPopFront } from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\n\nexport class Overwrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.OVERWRITE;\n\n  constructor(\n    public source: OperationSource,\n    public path: Path,\n    public snap: Node\n  ) {}\n\n  operationForChild(childName: string): Overwrite {\n    if (pathIsEmpty(this.path)) {\n      return new Overwrite(\n        this.source,\n        newEmptyPath(),\n        this.snap.getImmediateChild(childName)\n      );\n    } else {\n      return new Overwrite(this.source, pathPopFront(this.path), this.snap);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { Node } from '../snap/Node';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\nimport { Overwrite } from './Overwrite';\n\nexport class Merge implements Operation {\n  /** @inheritDoc */\n  type = OperationType.MERGE;\n\n  constructor(\n    /** @inheritDoc */ public source: OperationSource,\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public children: ImmutableTree<Node>\n  ) {}\n  operationForChild(childName: string): Operation {\n    if (pathIsEmpty(this.path)) {\n      const childTree = this.children.subtree(new Path(childName));\n      if (childTree.isEmpty()) {\n        // This child is unaffected\n        return null;\n      } else if (childTree.value) {\n        // We have a snapshot for the child in question.  This becomes an overwrite of the child.\n        return new Overwrite(this.source, newEmptyPath(), childTree.value);\n      } else {\n        // This is a merge at a deeper level\n        return new Merge(this.source, newEmptyPath(), childTree);\n      }\n    } else {\n      assert(\n        pathGetFront(this.path) === childName,\n        \"Can't get a merge for a child not on the path of the operation\"\n      );\n      return new Merge(this.source, pathPopFront(this.path), this.children);\n    }\n  }\n  toString(): string {\n    return (\n      'Operation(' +\n      this.path +\n      ': ' +\n      this.source.toString() +\n      ' merge: ' +\n      this.children.toString() +\n      ')'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node } from '../snap/Node';\nimport { Path, pathGetFront, pathIsEmpty } from '../util/Path';\n\n/**\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\n * whether a node potentially had children removed due to a filter.\n */\nexport class CacheNode {\n  constructor(\n    private node_: Node,\n    private fullyInitialized_: boolean,\n    private filtered_: boolean\n  ) {}\n\n  /**\n   * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n   */\n  isFullyInitialized(): boolean {\n    return this.fullyInitialized_;\n  }\n\n  /**\n   * Returns whether this node is potentially missing children due to a filter applied to the node\n   */\n  isFiltered(): boolean {\n    return this.filtered_;\n  }\n\n  isCompleteForPath(path: Path): boolean {\n    if (pathIsEmpty(path)) {\n      return this.isFullyInitialized() && !this.filtered_;\n    }\n\n    const childKey = pathGetFront(path);\n    return this.isCompleteForChild(childKey);\n  }\n\n  isCompleteForChild(key: string): boolean {\n    return (\n      (this.isFullyInitialized() && !this.filtered_) || this.node_.hasChild(key)\n    );\n  }\n\n  getNode(): Node {\n    return this.node_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assertionError } from '@firebase/util';\n\nimport { Index } from '../snap/indexes/Index';\nimport { NamedNode, Node } from '../snap/Node';\n\nimport { Change, ChangeType, changeChildMoved } from './Change';\nimport { Event } from './Event';\nimport { EventRegistration, QueryContext } from './EventRegistration';\n\n/**\n * An EventGenerator is used to convert \"raw\" changes (Change) as computed by the\n * CacheDiffer into actual events (Event) that can be raised.  See generateEventsForChanges()\n * for details.\n *\n */\nexport class EventGenerator {\n  index_: Index;\n\n  constructor(public query_: QueryContext) {\n    this.index_ = this.query_._queryParams.getIndex();\n  }\n}\n\n/**\n * Given a set of raw changes (no moved events and prevName not specified yet), and a set of\n * EventRegistrations that should be notified of these changes, generate the actual events to be raised.\n *\n * Notes:\n *  - child_moved events will be synthesized at this time for any child_changed events that affect\n *    our index.\n *  - prevName will be calculated based on the index ordering.\n */\nexport function eventGeneratorGenerateEventsForChanges(\n  eventGenerator: EventGenerator,\n  changes: Change[],\n  eventCache: Node,\n  eventRegistrations: EventRegistration[]\n): Event[] {\n  const events: Event[] = [];\n  const moves: Change[] = [];\n\n  changes.forEach(change => {\n    if (\n      change.type === ChangeType.CHILD_CHANGED &&\n      eventGenerator.index_.indexedValueChanged(\n        change.oldSnap as Node,\n        change.snapshotNode\n      )\n    ) {\n      moves.push(changeChildMoved(change.childName, change.snapshotNode));\n    }\n  });\n\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_REMOVED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_ADDED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_MOVED,\n    moves,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_CHANGED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.VALUE,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n\n  return events;\n}\n\n/**\n * Given changes of a single change type, generate the corresponding events.\n */\nfunction eventGeneratorGenerateEventsForType(\n  eventGenerator: EventGenerator,\n  events: Event[],\n  eventType: string,\n  changes: Change[],\n  registrations: EventRegistration[],\n  eventCache: Node\n) {\n  const filteredChanges = changes.filter(change => change.type === eventType);\n\n  filteredChanges.sort((a, b) =>\n    eventGeneratorCompareChanges(eventGenerator, a, b)\n  );\n  filteredChanges.forEach(change => {\n    const materializedChange = eventGeneratorMaterializeSingleChange(\n      eventGenerator,\n      change,\n      eventCache\n    );\n    registrations.forEach(registration => {\n      if (registration.respondsTo(change.type)) {\n        events.push(\n          registration.createEvent(materializedChange, eventGenerator.query_)\n        );\n      }\n    });\n  });\n}\n\nfunction eventGeneratorMaterializeSingleChange(\n  eventGenerator: EventGenerator,\n  change: Change,\n  eventCache: Node\n): Change {\n  if (change.type === 'value' || change.type === 'child_removed') {\n    return change;\n  } else {\n    change.prevName = eventCache.getPredecessorChildName(\n      change.childName,\n      change.snapshotNode,\n      eventGenerator.index_\n    );\n    return change;\n  }\n}\n\nfunction eventGeneratorCompareChanges(\n  eventGenerator: EventGenerator,\n  a: Change,\n  b: Change\n) {\n  if (a.childName == null || b.childName == null) {\n    throw assertionError('Should only compare child_ events.');\n  }\n  const aWrapped = new NamedNode(a.childName, a.snapshotNode);\n  const bWrapped = new NamedNode(b.childName, b.snapshotNode);\n  return eventGenerator.index_.compare(aWrapped, bWrapped);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node } from '../snap/Node';\n\nimport { CacheNode } from './CacheNode';\n\n/**\n * Stores the data we have cached for a view.\n *\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\n */\nexport interface ViewCache {\n  readonly eventCache: CacheNode;\n  readonly serverCache: CacheNode;\n}\n\nexport function newViewCache(\n  eventCache: CacheNode,\n  serverCache: CacheNode\n): ViewCache {\n  return { eventCache, serverCache };\n}\n\nexport function viewCacheUpdateEventSnap(\n  viewCache: ViewCache,\n  eventSnap: Node,\n  complete: boolean,\n  filtered: boolean\n): ViewCache {\n  return newViewCache(\n    new CacheNode(eventSnap, complete, filtered),\n    viewCache.serverCache\n  );\n}\n\nexport function viewCacheUpdateServerSnap(\n  viewCache: ViewCache,\n  serverSnap: Node,\n  complete: boolean,\n  filtered: boolean\n): ViewCache {\n  return newViewCache(\n    viewCache.eventCache,\n    new CacheNode(serverSnap, complete, filtered)\n  );\n}\n\nexport function viewCacheGetCompleteEventSnap(\n  viewCache: ViewCache\n): Node | null {\n  return viewCache.eventCache.isFullyInitialized()\n    ? viewCache.eventCache.getNode()\n    : null;\n}\n\nexport function viewCacheGetCompleteServerSnap(\n  viewCache: ViewCache\n): Node | null {\n  return viewCache.serverCache.isFullyInitialized()\n    ? viewCache.serverCache.getNode()\n    : null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  newEmptyPath,\n  Path,\n  pathChild,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from './Path';\nimport { SortedMap } from './SortedMap';\nimport { each, stringCompare } from './util';\n\nlet emptyChildrenSingleton: SortedMap<string, ImmutableTree<null>>;\n\n/**\n * Singleton empty children collection.\n *\n */\nconst EmptyChildren = (): SortedMap<string, ImmutableTree<null>> => {\n  if (!emptyChildrenSingleton) {\n    emptyChildrenSingleton = new SortedMap<string, ImmutableTree<null>>(\n      stringCompare\n    );\n  }\n  return emptyChildrenSingleton;\n};\n\n/**\n * A tree with immutable elements.\n */\nexport class ImmutableTree<T> {\n  static fromObject<T>(obj: { [k: string]: T }): ImmutableTree<T> {\n    let tree: ImmutableTree<T> = new ImmutableTree<T>(null);\n    each(obj, (childPath: string, childSnap: T) => {\n      tree = tree.set(new Path(childPath), childSnap);\n    });\n    return tree;\n  }\n\n  constructor(\n    public readonly value: T | null,\n    public readonly children: SortedMap<\n      string,\n      ImmutableTree<T>\n    > = EmptyChildren()\n  ) {}\n\n  /**\n   * True if the value is empty and there are no children\n   */\n  isEmpty(): boolean {\n    return this.value === null && this.children.isEmpty();\n  }\n\n  /**\n   * Given a path and predicate, return the first node and the path to that node\n   * where the predicate returns true.\n   *\n   * TODO Do a perf test -- If we're creating a bunch of `{path: value:}`\n   * objects on the way back out, it may be better to pass down a pathSoFar obj.\n   *\n   * @param relativePath - The remainder of the path\n   * @param predicate - The predicate to satisfy to return a node\n   */\n  findRootMostMatchingPathAndValue(\n    relativePath: Path,\n    predicate: (a: T) => boolean\n  ): { path: Path; value: T } | null {\n    if (this.value != null && predicate(this.value)) {\n      return { path: newEmptyPath(), value: this.value };\n    } else {\n      if (pathIsEmpty(relativePath)) {\n        return null;\n      } else {\n        const front = pathGetFront(relativePath);\n        const child = this.children.get(front);\n        if (child !== null) {\n          const childExistingPathAndValue =\n            child.findRootMostMatchingPathAndValue(\n              pathPopFront(relativePath),\n              predicate\n            );\n          if (childExistingPathAndValue != null) {\n            const fullPath = pathChild(\n              new Path(front),\n              childExistingPathAndValue.path\n            );\n            return { path: fullPath, value: childExistingPathAndValue.value };\n          } else {\n            return null;\n          }\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   * Find, if it exists, the shortest subpath of the given path that points a defined\n   * value in the tree\n   */\n  findRootMostValueAndPath(\n    relativePath: Path\n  ): { path: Path; value: T } | null {\n    return this.findRootMostMatchingPathAndValue(relativePath, () => true);\n  }\n\n  /**\n   * @returns The subtree at the given path\n   */\n  subtree(relativePath: Path): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return this;\n    } else {\n      const front = pathGetFront(relativePath);\n      const childTree = this.children.get(front);\n      if (childTree !== null) {\n        return childTree.subtree(pathPopFront(relativePath));\n      } else {\n        return new ImmutableTree<T>(null);\n      }\n    }\n  }\n\n  /**\n   * Sets a value at the specified path.\n   *\n   * @param relativePath - Path to set value at.\n   * @param toSet - Value to set.\n   * @returns Resulting tree.\n   */\n  set(relativePath: Path, toSet: T | null): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return new ImmutableTree(toSet, this.children);\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front) || new ImmutableTree<T>(null);\n      const newChild = child.set(pathPopFront(relativePath), toSet);\n      const newChildren = this.children.insert(front, newChild);\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Removes the value at the specified path.\n   *\n   * @param relativePath - Path to value to remove.\n   * @returns Resulting tree.\n   */\n  remove(relativePath: Path): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      if (this.children.isEmpty()) {\n        return new ImmutableTree<T>(null);\n      } else {\n        return new ImmutableTree(null, this.children);\n      }\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front);\n      if (child) {\n        const newChild = child.remove(pathPopFront(relativePath));\n        let newChildren;\n        if (newChild.isEmpty()) {\n          newChildren = this.children.remove(front);\n        } else {\n          newChildren = this.children.insert(front, newChild);\n        }\n        if (this.value === null && newChildren.isEmpty()) {\n          return new ImmutableTree<T>(null);\n        } else {\n          return new ImmutableTree(this.value, newChildren);\n        }\n      } else {\n        return this;\n      }\n    }\n  }\n\n  /**\n   * Gets a value from the tree.\n   *\n   * @param relativePath - Path to get value for.\n   * @returns Value at path, or null.\n   */\n  get(relativePath: Path): T | null {\n    if (pathIsEmpty(relativePath)) {\n      return this.value;\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front);\n      if (child) {\n        return child.get(pathPopFront(relativePath));\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Replace the subtree at the specified path with the given new tree.\n   *\n   * @param relativePath - Path to replace subtree for.\n   * @param newTree - New tree.\n   * @returns Resulting tree.\n   */\n  setTree(relativePath: Path, newTree: ImmutableTree<T>): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return newTree;\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front) || new ImmutableTree<T>(null);\n      const newChild = child.setTree(pathPopFront(relativePath), newTree);\n      let newChildren;\n      if (newChild.isEmpty()) {\n        newChildren = this.children.remove(front);\n      } else {\n        newChildren = this.children.insert(front, newChild);\n      }\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Performs a depth first fold on this tree. Transforms a tree into a single\n   * value, given a function that operates on the path to a node, an optional\n   * current value, and a map of child names to folded subtrees\n   */\n  fold<V>(fn: (path: Path, value: T, children: { [k: string]: V }) => V): V {\n    return this.fold_(newEmptyPath(), fn);\n  }\n\n  /**\n   * Recursive helper for public-facing fold() method\n   */\n  private fold_<V>(\n    pathSoFar: Path,\n    fn: (path: Path, value: T | null, children: { [k: string]: V }) => V\n  ): V {\n    const accum: { [k: string]: V } = {};\n    this.children.inorderTraversal(\n      (childKey: string, childTree: ImmutableTree<T>) => {\n        accum[childKey] = childTree.fold_(pathChild(pathSoFar, childKey), fn);\n      }\n    );\n    return fn(pathSoFar, this.value, accum);\n  }\n\n  /**\n   * Find the first matching value on the given path. Return the result of applying f to it.\n   */\n  findOnPath<V>(path: Path, f: (path: Path, value: T) => V | null): V | null {\n    return this.findOnPath_(path, newEmptyPath(), f);\n  }\n\n  private findOnPath_<V>(\n    pathToFollow: Path,\n    pathSoFar: Path,\n    f: (path: Path, value: T) => V | null\n  ): V | null {\n    const result = this.value ? f(pathSoFar, this.value) : false;\n    if (result) {\n      return result;\n    } else {\n      if (pathIsEmpty(pathToFollow)) {\n        return null;\n      } else {\n        const front = pathGetFront(pathToFollow)!;\n        const nextChild = this.children.get(front);\n        if (nextChild) {\n          return nextChild.findOnPath_(\n            pathPopFront(pathToFollow),\n            pathChild(pathSoFar, front),\n            f\n          );\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  foreachOnPath(\n    path: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    return this.foreachOnPath_(path, newEmptyPath(), f);\n  }\n\n  private foreachOnPath_(\n    pathToFollow: Path,\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    if (pathIsEmpty(pathToFollow)) {\n      return this;\n    } else {\n      if (this.value) {\n        f(currentRelativePath, this.value);\n      }\n      const front = pathGetFront(pathToFollow);\n      const nextChild = this.children.get(front);\n      if (nextChild) {\n        return nextChild.foreachOnPath_(\n          pathPopFront(pathToFollow),\n          pathChild(currentRelativePath, front),\n          f\n        );\n      } else {\n        return new ImmutableTree<T>(null);\n      }\n    }\n  }\n\n  /**\n   * Calls the given function for each node in the tree that has a value.\n   *\n   * @param f - A function to be called with the path from the root of the tree to\n   * a node, and the value at that node. Called in depth-first order.\n   */\n  foreach(f: (path: Path, value: T) => void) {\n    this.foreach_(newEmptyPath(), f);\n  }\n\n  private foreach_(\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ) {\n    this.children.inorderTraversal((childName, childTree) => {\n      childTree.foreach_(pathChild(currentRelativePath, childName), f);\n    });\n    if (this.value) {\n      f(currentRelativePath, this.value);\n    }\n  }\n\n  foreachChild(f: (name: string, value: T) => void) {\n    this.children.inorderTraversal(\n      (childName: string, childTree: ImmutableTree<T>) => {\n        if (childTree.value) {\n          f(childName, childTree.value);\n        }\n      }\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { NamedNode, Node } from './snap/Node';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathIsEmpty\n} from './util/Path';\nimport { each } from './util/util';\n\n/**\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\n * to reflect the write added.\n */\nexport class CompoundWrite {\n  constructor(public writeTree_: ImmutableTree<Node>) {}\n\n  static empty(): CompoundWrite {\n    return new CompoundWrite(new ImmutableTree(null));\n  }\n}\n\nexport function compoundWriteAddWrite(\n  compoundWrite: CompoundWrite,\n  path: Path,\n  node: Node\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return new CompoundWrite(new ImmutableTree(node));\n  } else {\n    const rootmost = compoundWrite.writeTree_.findRootMostValueAndPath(path);\n    if (rootmost != null) {\n      const rootMostPath = rootmost.path;\n      let value = rootmost.value;\n      const relativePath = newRelativePath(rootMostPath, path);\n      value = value.updateChild(relativePath, node);\n      return new CompoundWrite(\n        compoundWrite.writeTree_.set(rootMostPath, value)\n      );\n    } else {\n      const subtree = new ImmutableTree(node);\n      const newWriteTree = compoundWrite.writeTree_.setTree(path, subtree);\n      return new CompoundWrite(newWriteTree);\n    }\n  }\n}\n\nexport function compoundWriteAddWrites(\n  compoundWrite: CompoundWrite,\n  path: Path,\n  updates: { [name: string]: Node }\n): CompoundWrite {\n  let newWrite = compoundWrite;\n  each(updates, (childKey: string, node: Node) => {\n    newWrite = compoundWriteAddWrite(newWrite, pathChild(path, childKey), node);\n  });\n  return newWrite;\n}\n\n/**\n * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\n * location, which must be removed by calling this method with that path.\n *\n * @param compoundWrite - The CompoundWrite to remove.\n * @param path - The path at which a write and all deeper writes should be removed\n * @returns The new CompoundWrite with the removed path\n */\nexport function compoundWriteRemoveWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return CompoundWrite.empty();\n  } else {\n    const newWriteTree = compoundWrite.writeTree_.setTree(\n      path,\n      new ImmutableTree<Node>(null)\n    );\n    return new CompoundWrite(newWriteTree);\n  }\n}\n\n/**\n * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\n * considered \"complete\".\n *\n * @param compoundWrite - The CompoundWrite to check.\n * @param path - The path to check for\n * @returns Whether there is a complete write at that path\n */\nexport function compoundWriteHasCompleteWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): boolean {\n  return compoundWriteGetCompleteNode(compoundWrite, path) != null;\n}\n\n/**\n * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\n * writes from deeper paths, but will return child nodes from a more shallow path.\n *\n * @param compoundWrite - The CompoundWrite to get the node from.\n * @param path - The path to get a complete write\n * @returns The node if complete at that path, or null otherwise.\n */\nexport function compoundWriteGetCompleteNode(\n  compoundWrite: CompoundWrite,\n  path: Path\n): Node | null {\n  const rootmost = compoundWrite.writeTree_.findRootMostValueAndPath(path);\n  if (rootmost != null) {\n    return compoundWrite.writeTree_\n      .get(rootmost.path)\n      .getChild(newRelativePath(rootmost.path, path));\n  } else {\n    return null;\n  }\n}\n\n/**\n * Returns all children that are guaranteed to be a complete overwrite.\n *\n * @param compoundWrite - The CompoundWrite to get children from.\n * @returns A list of all complete children.\n */\nexport function compoundWriteGetCompleteChildren(\n  compoundWrite: CompoundWrite\n): NamedNode[] {\n  const children: NamedNode[] = [];\n  const node = compoundWrite.writeTree_.value;\n  if (node != null) {\n    // If it's a leaf node, it has no children; so nothing to do.\n    if (!node.isLeafNode()) {\n      (node as ChildrenNode).forEachChild(\n        PRIORITY_INDEX,\n        (childName, childNode) => {\n          children.push(new NamedNode(childName, childNode));\n        }\n      );\n    }\n  } else {\n    compoundWrite.writeTree_.children.inorderTraversal(\n      (childName, childTree) => {\n        if (childTree.value != null) {\n          children.push(new NamedNode(childName, childTree.value));\n        }\n      }\n    );\n  }\n  return children;\n}\n\nexport function compoundWriteChildCompoundWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return compoundWrite;\n  } else {\n    const shadowingNode = compoundWriteGetCompleteNode(compoundWrite, path);\n    if (shadowingNode != null) {\n      return new CompoundWrite(new ImmutableTree(shadowingNode));\n    } else {\n      return new CompoundWrite(compoundWrite.writeTree_.subtree(path));\n    }\n  }\n}\n\n/**\n * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n * @returns Whether this CompoundWrite is empty\n */\nexport function compoundWriteIsEmpty(compoundWrite: CompoundWrite): boolean {\n  return compoundWrite.writeTree_.isEmpty();\n}\n\n/**\n * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\n * node\n * @param node - The node to apply this CompoundWrite to\n * @returns The node with all writes applied\n */\nexport function compoundWriteApply(\n  compoundWrite: CompoundWrite,\n  node: Node\n): Node {\n  return applySubtreeWrite(newEmptyPath(), compoundWrite.writeTree_, node);\n}\n\nfunction applySubtreeWrite(\n  relativePath: Path,\n  writeTree: ImmutableTree<Node>,\n  node: Node\n): Node {\n  if (writeTree.value != null) {\n    // Since there a write is always a leaf, we're done here\n    return node.updateChild(relativePath, writeTree.value);\n  } else {\n    let priorityWrite = null;\n    writeTree.children.inorderTraversal((childKey, childTree) => {\n      if (childKey === '.priority') {\n        // Apply priorities at the end so we don't update priorities for either empty nodes or forget\n        // to apply priorities to empty nodes that are later filled\n        assert(\n          childTree.value !== null,\n          'Priority writes must always be leaf nodes'\n        );\n        priorityWrite = childTree.value;\n      } else {\n        node = applySubtreeWrite(\n          pathChild(relativePath, childKey),\n          childTree,\n          node\n        );\n      }\n    });\n    // If there was a priority write, we only apply it if the node is not empty\n    if (!node.getChild(relativePath).isEmpty() && priorityWrite !== null) {\n      node = node.updateChild(\n        pathChild(relativePath, '.priority'),\n        priorityWrite\n      );\n    }\n    return node;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, assertionError, safeGet } from '@firebase/util';\n\nimport {\n  CompoundWrite,\n  compoundWriteAddWrite,\n  compoundWriteAddWrites,\n  compoundWriteApply,\n  compoundWriteChildCompoundWrite,\n  compoundWriteGetCompleteChildren,\n  compoundWriteGetCompleteNode,\n  compoundWriteHasCompleteWrite,\n  compoundWriteIsEmpty,\n  compoundWriteRemoveWrite\n} from './CompoundWrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Index } from './snap/indexes/Index';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { NamedNode, Node } from './snap/Node';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathContains,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from './util/Path';\nimport { each } from './util/util';\nimport { CacheNode } from './view/CacheNode';\n\n/**\n * Defines a single user-initiated write operation. May be the result of a set(), transaction(), or update() call. In\n * the case of a set() or transaction, snap will be non-null.  In the case of an update(), children will be non-null.\n */\nexport interface WriteRecord {\n  writeId: number;\n  path: Path;\n  snap?: Node | null;\n  children?: { [k: string]: Node } | null;\n  visible: boolean;\n}\n\n/**\n * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n *\n */\nexport function writeTreeChildWrites(\n  writeTree: WriteTree,\n  path: Path\n): WriteTreeRef {\n  return newWriteTreeRef(path, writeTree);\n}\n\n/**\n * Record a new overwrite from user code.\n *\n * @param visible - This is set to false by some transactions. It should be excluded from event caches\n */\nexport function writeTreeAddOverwrite(\n  writeTree: WriteTree,\n  path: Path,\n  snap: Node,\n  writeId: number,\n  visible?: boolean\n) {\n  assert(\n    writeId > writeTree.lastWriteId,\n    'Stacking an older write on top of newer ones'\n  );\n  if (visible === undefined) {\n    visible = true;\n  }\n  writeTree.allWrites.push({\n    path,\n    snap,\n    writeId,\n    visible\n  });\n\n  if (visible) {\n    writeTree.visibleWrites = compoundWriteAddWrite(\n      writeTree.visibleWrites,\n      path,\n      snap\n    );\n  }\n  writeTree.lastWriteId = writeId;\n}\n\n/**\n * Record a new merge from user code.\n */\nexport function writeTreeAddMerge(\n  writeTree: WriteTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  writeId: number\n) {\n  assert(\n    writeId > writeTree.lastWriteId,\n    'Stacking an older merge on top of newer ones'\n  );\n  writeTree.allWrites.push({\n    path,\n    children: changedChildren,\n    writeId,\n    visible: true\n  });\n\n  writeTree.visibleWrites = compoundWriteAddWrites(\n    writeTree.visibleWrites,\n    path,\n    changedChildren\n  );\n  writeTree.lastWriteId = writeId;\n}\n\nexport function writeTreeGetWrite(\n  writeTree: WriteTree,\n  writeId: number\n): WriteRecord | null {\n  for (let i = 0; i < writeTree.allWrites.length; i++) {\n    const record = writeTree.allWrites[i];\n    if (record.writeId === writeId) {\n      return record;\n    }\n  }\n  return null;\n}\n\n/**\n * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\n * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\n *\n * @returns true if the write may have been visible (meaning we'll need to reevaluate / raise\n * events as a result).\n */\nexport function writeTreeRemoveWrite(\n  writeTree: WriteTree,\n  writeId: number\n): boolean {\n  // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\n  // out of order.\n  //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\n  //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\n\n  const idx = writeTree.allWrites.findIndex(s => {\n    return s.writeId === writeId;\n  });\n  assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\n  const writeToRemove = writeTree.allWrites[idx];\n  writeTree.allWrites.splice(idx, 1);\n\n  let removedWriteWasVisible = writeToRemove.visible;\n  let removedWriteOverlapsWithOtherWrites = false;\n\n  let i = writeTree.allWrites.length - 1;\n\n  while (removedWriteWasVisible && i >= 0) {\n    const currentWrite = writeTree.allWrites[i];\n    if (currentWrite.visible) {\n      if (\n        i >= idx &&\n        writeTreeRecordContainsPath_(currentWrite, writeToRemove.path)\n      ) {\n        // The removed write was completely shadowed by a subsequent write.\n        removedWriteWasVisible = false;\n      } else if (pathContains(writeToRemove.path, currentWrite.path)) {\n        // Either we're covering some writes or they're covering part of us (depending on which came first).\n        removedWriteOverlapsWithOtherWrites = true;\n      }\n    }\n    i--;\n  }\n\n  if (!removedWriteWasVisible) {\n    return false;\n  } else if (removedWriteOverlapsWithOtherWrites) {\n    // There's some shadowing going on. Just rebuild the visible writes from scratch.\n    writeTreeResetTree_(writeTree);\n    return true;\n  } else {\n    // There's no shadowing.  We can safely just remove the write(s) from visibleWrites.\n    if (writeToRemove.snap) {\n      writeTree.visibleWrites = compoundWriteRemoveWrite(\n        writeTree.visibleWrites,\n        writeToRemove.path\n      );\n    } else {\n      const children = writeToRemove.children;\n      each(children, (childName: string) => {\n        writeTree.visibleWrites = compoundWriteRemoveWrite(\n          writeTree.visibleWrites,\n          pathChild(writeToRemove.path, childName)\n        );\n      });\n    }\n    return true;\n  }\n}\n\nfunction writeTreeRecordContainsPath_(\n  writeRecord: WriteRecord,\n  path: Path\n): boolean {\n  if (writeRecord.snap) {\n    return pathContains(writeRecord.path, path);\n  } else {\n    for (const childName in writeRecord.children) {\n      if (\n        writeRecord.children.hasOwnProperty(childName) &&\n        pathContains(pathChild(writeRecord.path, childName), path)\n      ) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n\n/**\n * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n */\nfunction writeTreeResetTree_(writeTree: WriteTree) {\n  writeTree.visibleWrites = writeTreeLayerTree_(\n    writeTree.allWrites,\n    writeTreeDefaultFilter_,\n    newEmptyPath()\n  );\n  if (writeTree.allWrites.length > 0) {\n    writeTree.lastWriteId =\n      writeTree.allWrites[writeTree.allWrites.length - 1].writeId;\n  } else {\n    writeTree.lastWriteId = -1;\n  }\n}\n\n/**\n * The default filter used when constructing the tree. Keep everything that's visible.\n */\nfunction writeTreeDefaultFilter_(write: WriteRecord) {\n  return write.visible;\n}\n\n/**\n * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\n * event data at that path.\n */\nfunction writeTreeLayerTree_(\n  writes: WriteRecord[],\n  filter: (w: WriteRecord) => boolean,\n  treeRoot: Path\n): CompoundWrite {\n  let compoundWrite = CompoundWrite.empty();\n  for (let i = 0; i < writes.length; ++i) {\n    const write = writes[i];\n    // Theory, a later set will either:\n    // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n    // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n    if (filter(write)) {\n      const writePath = write.path;\n      let relativePath: Path;\n      if (write.snap) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrite(\n            compoundWrite,\n            relativePath,\n            write.snap\n          );\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          compoundWrite = compoundWriteAddWrite(\n            compoundWrite,\n            newEmptyPath(),\n            write.snap.getChild(relativePath)\n          );\n        } else {\n          // There is no overlap between root path and write path, ignore write\n        }\n      } else if (write.children) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrites(\n            compoundWrite,\n            relativePath,\n            write.children\n          );\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          if (pathIsEmpty(relativePath)) {\n            compoundWrite = compoundWriteAddWrites(\n              compoundWrite,\n              newEmptyPath(),\n              write.children\n            );\n          } else {\n            const child = safeGet(write.children, pathGetFront(relativePath));\n            if (child) {\n              // There exists a child in this node that matches the root path\n              const deepNode = child.getChild(pathPopFront(relativePath));\n              compoundWrite = compoundWriteAddWrite(\n                compoundWrite,\n                newEmptyPath(),\n                deepNode\n              );\n            }\n          }\n        } else {\n          // There is no overlap between root path and write path, ignore write\n        }\n      } else {\n        throw assertionError('WriteRecord should have .snap or .children');\n      }\n    }\n  }\n  return compoundWrite;\n}\n\n/**\n * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n * No server data is considered.\n *\n */\nexport function writeTreeGetCompleteWriteData(\n  writeTree: WriteTree,\n  path: Path\n): Node | null {\n  return compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\n}\n\n/**\n * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n * writes), attempt to calculate a complete snapshot for the given path\n *\n * @param writeIdsToExclude - An optional set to be excluded\n * @param includeHiddenWrites - Defaults to false, whether or not to layer on writes with visible set to false\n */\nexport function writeTreeCalcCompleteEventCache(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerCache: Node | null,\n  writeIdsToExclude?: number[],\n  includeHiddenWrites?: boolean\n): Node | null {\n  if (!writeIdsToExclude && !includeHiddenWrites) {\n    const shadowingNode = compoundWriteGetCompleteNode(\n      writeTree.visibleWrites,\n      treePath\n    );\n    if (shadowingNode != null) {\n      return shadowingNode;\n    } else {\n      const subMerge = compoundWriteChildCompoundWrite(\n        writeTree.visibleWrites,\n        treePath\n      );\n      if (compoundWriteIsEmpty(subMerge)) {\n        return completeServerCache;\n      } else if (\n        completeServerCache == null &&\n        !compoundWriteHasCompleteWrite(subMerge, newEmptyPath())\n      ) {\n        // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n        return null;\n      } else {\n        const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n        return compoundWriteApply(subMerge, layeredCache);\n      }\n    }\n  } else {\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    if (!includeHiddenWrites && compoundWriteIsEmpty(merge)) {\n      return completeServerCache;\n    } else {\n      // If the server cache is null, and we don't have a complete cache, we need to return null\n      if (\n        !includeHiddenWrites &&\n        completeServerCache == null &&\n        !compoundWriteHasCompleteWrite(merge, newEmptyPath())\n      ) {\n        return null;\n      } else {\n        const filter = function (write: WriteRecord) {\n          return (\n            (write.visible || includeHiddenWrites) &&\n            (!writeIdsToExclude ||\n              !~writeIdsToExclude.indexOf(write.writeId)) &&\n            (pathContains(write.path, treePath) ||\n              pathContains(treePath, write.path))\n          );\n        };\n        const mergeAtPath = writeTreeLayerTree_(\n          writeTree.allWrites,\n          filter,\n          treePath\n        );\n        const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n        return compoundWriteApply(mergeAtPath, layeredCache);\n      }\n    }\n  }\n}\n\n/**\n * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n * Used when creating new views, to pre-fill their complete event children snapshot.\n */\nexport function writeTreeCalcCompleteEventChildren(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerChildren: ChildrenNode | null\n) {\n  let completeChildren = ChildrenNode.EMPTY_NODE as Node;\n  const topLevelSet = compoundWriteGetCompleteNode(\n    writeTree.visibleWrites,\n    treePath\n  );\n  if (topLevelSet) {\n    if (!topLevelSet.isLeafNode()) {\n      // we're shadowing everything. Return the children.\n      topLevelSet.forEachChild(PRIORITY_INDEX, (childName, childSnap) => {\n        completeChildren = completeChildren.updateImmediateChild(\n          childName,\n          childSnap\n        );\n      });\n    }\n    return completeChildren;\n  } else if (completeServerChildren) {\n    // Layer any children we have on top of this\n    // We know we don't have a top-level set, so just enumerate existing children\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    completeServerChildren.forEachChild(\n      PRIORITY_INDEX,\n      (childName, childNode) => {\n        const node = compoundWriteApply(\n          compoundWriteChildCompoundWrite(merge, new Path(childName)),\n          childNode\n        );\n        completeChildren = completeChildren.updateImmediateChild(\n          childName,\n          node\n        );\n      }\n    );\n    // Add any complete children we have from the set\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(\n        namedNode.name,\n        namedNode.node\n      );\n    });\n    return completeChildren;\n  } else {\n    // We don't have anything to layer on top of. Layer on any children we have\n    // Note that we can return an empty snap if we have a defined delete\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(\n        namedNode.name,\n        namedNode.node\n      );\n    });\n    return completeChildren;\n  }\n}\n\n/**\n * Given that the underlying server data has updated, determine what, if anything, needs to be\n * applied to the event cache.\n *\n * Possibilities:\n *\n * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n *\n * 2. Some write is completely shadowing. No events to be raised\n *\n * 3. Is partially shadowed. Events\n *\n * Either existingEventSnap or existingServerSnap must exist\n */\nexport function writeTreeCalcEventCacheAfterServerOverwrite(\n  writeTree: WriteTree,\n  treePath: Path,\n  childPath: Path,\n  existingEventSnap: Node | null,\n  existingServerSnap: Node | null\n): Node | null {\n  assert(\n    existingEventSnap || existingServerSnap,\n    'Either existingEventSnap or existingServerSnap must exist'\n  );\n  const path = pathChild(treePath, childPath);\n  if (compoundWriteHasCompleteWrite(writeTree.visibleWrites, path)) {\n    // At this point we can probably guarantee that we're in case 2, meaning no events\n    // May need to check visibility while doing the findRootMostValueAndPath call\n    return null;\n  } else {\n    // No complete shadowing. We're either partially shadowing or not shadowing at all.\n    const childMerge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      path\n    );\n    if (compoundWriteIsEmpty(childMerge)) {\n      // We're not shadowing at all. Case 1\n      return existingServerSnap.getChild(childPath);\n    } else {\n      // This could be more efficient if the serverNode + updates doesn't change the eventSnap\n      // However this is tricky to find out, since user updates don't necessary change the server\n      // snap, e.g. priority updates on empty nodes, or deep deletes. Another special case is if the server\n      // adds nodes, but doesn't change any existing writes. It is therefore not enough to\n      // only check if the updates change the serverNode.\n      // Maybe check if the merge tree contains these special cases and only do a full overwrite in that case?\n      return compoundWriteApply(\n        childMerge,\n        existingServerSnap.getChild(childPath)\n      );\n    }\n  }\n}\n\n/**\n * Returns a complete child for a given server snap after applying all user writes or null if there is no\n * complete child for this ChildKey.\n */\nexport function writeTreeCalcCompleteChild(\n  writeTree: WriteTree,\n  treePath: Path,\n  childKey: string,\n  existingServerSnap: CacheNode\n): Node | null {\n  const path = pathChild(treePath, childKey);\n  const shadowingNode = compoundWriteGetCompleteNode(\n    writeTree.visibleWrites,\n    path\n  );\n  if (shadowingNode != null) {\n    return shadowingNode;\n  } else {\n    if (existingServerSnap.isCompleteForChild(childKey)) {\n      const childMerge = compoundWriteChildCompoundWrite(\n        writeTree.visibleWrites,\n        path\n      );\n      return compoundWriteApply(\n        childMerge,\n        existingServerSnap.getNode().getImmediateChild(childKey)\n      );\n    } else {\n      return null;\n    }\n  }\n}\n\n/**\n * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n * a higher path, this will return the child of that write relative to the write and this path.\n * Returns null if there is no write at this path.\n */\nexport function writeTreeShadowingWrite(\n  writeTree: WriteTree,\n  path: Path\n): Node | null {\n  return compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\n}\n\n/**\n * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n * the window, but may now be in the window.\n */\nexport function writeTreeCalcIndexedSlice(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerData: Node | null,\n  startPost: NamedNode,\n  count: number,\n  reverse: boolean,\n  index: Index\n): NamedNode[] {\n  let toIterate: Node;\n  const merge = compoundWriteChildCompoundWrite(\n    writeTree.visibleWrites,\n    treePath\n  );\n  const shadowingNode = compoundWriteGetCompleteNode(merge, newEmptyPath());\n  if (shadowingNode != null) {\n    toIterate = shadowingNode;\n  } else if (completeServerData != null) {\n    toIterate = compoundWriteApply(merge, completeServerData);\n  } else {\n    // no children to iterate on\n    return [];\n  }\n  toIterate = toIterate.withIndex(index);\n  if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\n    const nodes = [];\n    const cmp = index.getCompare();\n    const iter = reverse\n      ? (toIterate as ChildrenNode).getReverseIteratorFrom(startPost, index)\n      : (toIterate as ChildrenNode).getIteratorFrom(startPost, index);\n    let next = iter.getNext();\n    while (next && nodes.length < count) {\n      if (cmp(next, startPost) !== 0) {\n        nodes.push(next);\n      }\n      next = iter.getNext();\n    }\n    return nodes;\n  } else {\n    return [];\n  }\n}\n\nexport function newWriteTree(): WriteTree {\n  return {\n    visibleWrites: CompoundWrite.empty(),\n    allWrites: [],\n    lastWriteId: -1\n  };\n}\n\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n */\nexport interface WriteTree {\n  /**\n   * A tree tracking the result of applying all visible writes.  This does not include transactions with\n   * applyLocally=false or writes that are completely shadowed by other writes.\n   */\n  visibleWrites: CompoundWrite;\n\n  /**\n   * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n   * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n   * used by transactions).\n   */\n  allWrites: WriteRecord[];\n\n  lastWriteId: number;\n}\n\n/**\n * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\n * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\n * can lead to a more expensive calculation.\n *\n * @param writeIdsToExclude - Optional writes to exclude.\n * @param includeHiddenWrites - Defaults to false, whether or not to layer on writes with visible set to false\n */\nexport function writeTreeRefCalcCompleteEventCache(\n  writeTreeRef: WriteTreeRef,\n  completeServerCache: Node | null,\n  writeIdsToExclude?: number[],\n  includeHiddenWrites?: boolean\n): Node | null {\n  return writeTreeCalcCompleteEventCache(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerCache,\n    writeIdsToExclude,\n    includeHiddenWrites\n  );\n}\n\n/**\n * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n * mix of the given server data and write data.\n *\n */\nexport function writeTreeRefCalcCompleteEventChildren(\n  writeTreeRef: WriteTreeRef,\n  completeServerChildren: ChildrenNode | null\n): ChildrenNode {\n  return writeTreeCalcCompleteEventChildren(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerChildren\n  ) as ChildrenNode;\n}\n\n/**\n * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n * if anything, needs to be applied to the event cache.\n *\n * Possibilities:\n *\n * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n *\n * 2. Some write is completely shadowing. No events to be raised\n *\n * 3. Is partially shadowed. Events should be raised\n *\n * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n *\n *\n */\nexport function writeTreeRefCalcEventCacheAfterServerOverwrite(\n  writeTreeRef: WriteTreeRef,\n  path: Path,\n  existingEventSnap: Node | null,\n  existingServerSnap: Node | null\n): Node | null {\n  return writeTreeCalcEventCacheAfterServerOverwrite(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    path,\n    existingEventSnap,\n    existingServerSnap\n  );\n}\n\n/**\n * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n * a higher path, this will return the child of that write relative to the write and this path.\n * Returns null if there is no write at this path.\n *\n */\nexport function writeTreeRefShadowingWrite(\n  writeTreeRef: WriteTreeRef,\n  path: Path\n): Node | null {\n  return writeTreeShadowingWrite(\n    writeTreeRef.writeTree,\n    pathChild(writeTreeRef.treePath, path)\n  );\n}\n\n/**\n * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n * the window, but may now be in the window\n */\nexport function writeTreeRefCalcIndexedSlice(\n  writeTreeRef: WriteTreeRef,\n  completeServerData: Node | null,\n  startPost: NamedNode,\n  count: number,\n  reverse: boolean,\n  index: Index\n): NamedNode[] {\n  return writeTreeCalcIndexedSlice(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerData,\n    startPost,\n    count,\n    reverse,\n    index\n  );\n}\n\n/**\n * Returns a complete child for a given server snap after applying all user writes or null if there is no\n * complete child for this ChildKey.\n */\nexport function writeTreeRefCalcCompleteChild(\n  writeTreeRef: WriteTreeRef,\n  childKey: string,\n  existingServerCache: CacheNode\n): Node | null {\n  return writeTreeCalcCompleteChild(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    childKey,\n    existingServerCache\n  );\n}\n\n/**\n * Return a WriteTreeRef for a child.\n */\nexport function writeTreeRefChild(\n  writeTreeRef: WriteTreeRef,\n  childName: string\n): WriteTreeRef {\n  return newWriteTreeRef(\n    pathChild(writeTreeRef.treePath, childName),\n    writeTreeRef.writeTree\n  );\n}\n\nexport function newWriteTreeRef(\n  path: Path,\n  writeTree: WriteTree\n): WriteTreeRef {\n  return {\n    treePath: path,\n    writeTree\n  };\n}\n\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n */\nexport interface WriteTreeRef {\n  /**\n   * The path to this particular write tree ref. Used for calling methods on writeTree_ while exposing a simpler\n   * interface to callers.\n   */\n  readonly treePath: Path;\n\n  /**\n   * * A reference to the actual tree of write data. All methods are pass-through to the tree, but with the appropriate\n   * path prefixed.\n   *\n   * This lets us make cheap references to points in the tree for sync points without having to copy and maintain all of\n   * the data.\n   */\n  readonly writeTree: WriteTree;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, assertionError } from '@firebase/util';\n\nimport {\n  Change,\n  ChangeType,\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from './Change';\n\nexport class ChildChangeAccumulator {\n  private readonly changeMap: Map<string, Change> = new Map();\n\n  trackChildChange(change: Change) {\n    const type = change.type;\n    const childKey = change.childName!;\n    assert(\n      type === ChangeType.CHILD_ADDED ||\n        type === ChangeType.CHILD_CHANGED ||\n        type === ChangeType.CHILD_REMOVED,\n      'Only child changes supported for tracking'\n    );\n    assert(\n      childKey !== '.priority',\n      'Only non-priority child changes can be tracked.'\n    );\n    const oldChange = this.changeMap.get(childKey);\n    if (oldChange) {\n      const oldType = oldChange.type;\n      if (\n        type === ChangeType.CHILD_ADDED &&\n        oldType === ChangeType.CHILD_REMOVED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildChanged(\n            childKey,\n            change.snapshotNode,\n            oldChange.snapshotNode\n          )\n        );\n      } else if (\n        type === ChangeType.CHILD_REMOVED &&\n        oldType === ChangeType.CHILD_ADDED\n      ) {\n        this.changeMap.delete(childKey);\n      } else if (\n        type === ChangeType.CHILD_REMOVED &&\n        oldType === ChangeType.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildRemoved(childKey, oldChange.oldSnap)\n        );\n      } else if (\n        type === ChangeType.CHILD_CHANGED &&\n        oldType === ChangeType.CHILD_ADDED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildAdded(childKey, change.snapshotNode)\n        );\n      } else if (\n        type === ChangeType.CHILD_CHANGED &&\n        oldType === ChangeType.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildChanged(childKey, change.snapshotNode, oldChange.oldSnap)\n        );\n      } else {\n        throw assertionError(\n          'Illegal combination of changes: ' +\n            change +\n            ' occurred after ' +\n            oldChange\n        );\n      }\n    } else {\n      this.changeMap.set(childKey, change);\n    }\n  }\n\n  getChanges(): Change[] {\n    return Array.from(this.changeMap.values());\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Index } from '../snap/indexes/Index';\nimport { NamedNode, Node } from '../snap/Node';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteChild,\n  writeTreeRefCalcIndexedSlice\n} from '../WriteTree';\n\nimport { CacheNode } from './CacheNode';\nimport { ViewCache, viewCacheGetCompleteServerSnap } from './ViewCache';\n\n/**\n * Since updates to filtered nodes might require nodes to be pulled in from \"outside\" the node, this interface\n * can help to get complete children that can be pulled in.\n * A class implementing this interface takes potentially multiple sources (e.g. user writes, server data from\n * other views etc.) to try it's best to get a complete child that might be useful in pulling into the view.\n *\n * @interface\n */\nexport interface CompleteChildSource {\n  getCompleteChild(childKey: string): Node | null;\n\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null;\n}\n\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport class NoCompleteChildSource_ implements CompleteChildSource {\n  getCompleteChild(childKey?: string): Node | null {\n    return null;\n  }\n  getChildAfterChild(\n    index?: Index,\n    child?: NamedNode,\n    reverse?: boolean\n  ): NamedNode | null {\n    return null;\n  }\n}\n\n/**\n * Singleton instance.\n */\nexport const NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\n\n/**\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\n * old event caches available to calculate complete children.\n */\nexport class WriteTreeCompleteChildSource implements CompleteChildSource {\n  constructor(\n    private writes_: WriteTreeRef,\n    private viewCache_: ViewCache,\n    private optCompleteServerCache_: Node | null = null\n  ) {}\n  getCompleteChild(childKey: string): Node | null {\n    const node = this.viewCache_.eventCache;\n    if (node.isCompleteForChild(childKey)) {\n      return node.getNode().getImmediateChild(childKey);\n    } else {\n      const serverNode =\n        this.optCompleteServerCache_ != null\n          ? new CacheNode(this.optCompleteServerCache_, true, false)\n          : this.viewCache_.serverCache;\n      return writeTreeRefCalcCompleteChild(this.writes_, childKey, serverNode);\n    }\n  }\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null {\n    const completeServerData =\n      this.optCompleteServerCache_ != null\n        ? this.optCompleteServerCache_\n        : viewCacheGetCompleteServerSnap(this.viewCache_);\n    const nodes = writeTreeRefCalcIndexedSlice(\n      this.writes_,\n      completeServerData,\n      child,\n      1,\n      reverse,\n      index\n    );\n    if (nodes.length === 0) {\n      return null;\n    } else {\n      return nodes[0];\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, assertionError } from '@firebase/util';\n\nimport { AckUserWrite } from '../operation/AckUserWrite';\nimport { Merge } from '../operation/Merge';\nimport { Operation, OperationType } from '../operation/Operation';\nimport { Overwrite } from '../operation/Overwrite';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { Node } from '../snap/Node';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathChild,\n  pathGetBack,\n  pathGetFront,\n  pathGetLength,\n  pathIsEmpty,\n  pathParent,\n  pathPopFront\n} from '../util/Path';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteChild,\n  writeTreeRefCalcCompleteEventCache,\n  writeTreeRefCalcCompleteEventChildren,\n  writeTreeRefCalcEventCacheAfterServerOverwrite,\n  writeTreeRefShadowingWrite\n} from '../WriteTree';\n\nimport { Change, changeValue } from './Change';\nimport { ChildChangeAccumulator } from './ChildChangeAccumulator';\nimport {\n  CompleteChildSource,\n  NO_COMPLETE_CHILD_SOURCE,\n  WriteTreeCompleteChildSource\n} from './CompleteChildSource';\nimport { NodeFilter } from './filter/NodeFilter';\nimport {\n  ViewCache,\n  viewCacheGetCompleteEventSnap,\n  viewCacheGetCompleteServerSnap,\n  viewCacheUpdateEventSnap,\n  viewCacheUpdateServerSnap\n} from './ViewCache';\n\nexport interface ProcessorResult {\n  readonly viewCache: ViewCache;\n  readonly changes: Change[];\n}\n\nexport interface ViewProcessor {\n  readonly filter: NodeFilter;\n}\n\nexport function newViewProcessor(filter: NodeFilter): ViewProcessor {\n  return { filter };\n}\n\nexport function viewProcessorAssertIndexed(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache\n): void {\n  assert(\n    viewCache.eventCache.getNode().isIndexed(viewProcessor.filter.getIndex()),\n    'Event snap not indexed'\n  );\n  assert(\n    viewCache.serverCache.getNode().isIndexed(viewProcessor.filter.getIndex()),\n    'Server snap not indexed'\n  );\n}\n\nexport function viewProcessorApplyOperation(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null\n): ProcessorResult {\n  const accumulator = new ChildChangeAccumulator();\n  let newViewCache, filterServerNode;\n  if (operation.type === OperationType.OVERWRITE) {\n    const overwrite = operation as Overwrite;\n    if (overwrite.source.fromUser) {\n      newViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        oldViewCache,\n        overwrite.path,\n        overwrite.snap,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      assert(overwrite.source.fromServer, 'Unknown source.');\n      // We filter the node if it's a tagged update or the node has been previously filtered  and the\n      // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n      // again\n      filterServerNode =\n        overwrite.source.tagged ||\n        (oldViewCache.serverCache.isFiltered() && !pathIsEmpty(overwrite.path));\n      newViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        oldViewCache,\n        overwrite.path,\n        overwrite.snap,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.MERGE) {\n    const merge = operation as Merge;\n    if (merge.source.fromUser) {\n      newViewCache = viewProcessorApplyUserMerge(\n        viewProcessor,\n        oldViewCache,\n        merge.path,\n        merge.children,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      assert(merge.source.fromServer, 'Unknown source.');\n      // We filter the node if it's a tagged update or the node has been previously filtered\n      filterServerNode =\n        merge.source.tagged || oldViewCache.serverCache.isFiltered();\n      newViewCache = viewProcessorApplyServerMerge(\n        viewProcessor,\n        oldViewCache,\n        merge.path,\n        merge.children,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.ACK_USER_WRITE) {\n    const ackUserWrite = operation as AckUserWrite;\n    if (!ackUserWrite.revert) {\n      newViewCache = viewProcessorAckUserWrite(\n        viewProcessor,\n        oldViewCache,\n        ackUserWrite.path,\n        ackUserWrite.affectedTree,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      newViewCache = viewProcessorRevertUserWrite(\n        viewProcessor,\n        oldViewCache,\n        ackUserWrite.path,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n    newViewCache = viewProcessorListenComplete(\n      viewProcessor,\n      oldViewCache,\n      operation.path,\n      writesCache,\n      accumulator\n    );\n  } else {\n    throw assertionError('Unknown operation type: ' + operation.type);\n  }\n  const changes = accumulator.getChanges();\n  viewProcessorMaybeAddValueEvent(oldViewCache, newViewCache, changes);\n  return { viewCache: newViewCache, changes };\n}\n\nfunction viewProcessorMaybeAddValueEvent(\n  oldViewCache: ViewCache,\n  newViewCache: ViewCache,\n  accumulator: Change[]\n): void {\n  const eventSnap = newViewCache.eventCache;\n  if (eventSnap.isFullyInitialized()) {\n    const isLeafOrEmpty =\n      eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n    const oldCompleteSnap = viewCacheGetCompleteEventSnap(oldViewCache);\n    if (\n      accumulator.length > 0 ||\n      !oldViewCache.eventCache.isFullyInitialized() ||\n      (isLeafOrEmpty && !eventSnap.getNode().equals(oldCompleteSnap)) ||\n      !eventSnap.getNode().getPriority().equals(oldCompleteSnap.getPriority())\n    ) {\n      accumulator.push(\n        changeValue(viewCacheGetCompleteEventSnap(newViewCache))\n      );\n    }\n  }\n}\n\nfunction viewProcessorGenerateEventCacheAfterServerEvent(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  changePath: Path,\n  writesCache: WriteTreeRef,\n  source: CompleteChildSource,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldEventSnap = viewCache.eventCache;\n  if (writeTreeRefShadowingWrite(writesCache, changePath) != null) {\n    // we have a shadowing write, ignore changes\n    return viewCache;\n  } else {\n    let newEventCache, serverNode;\n    if (pathIsEmpty(changePath)) {\n      // TODO: figure out how this plays with \"sliding ack windows\"\n      assert(\n        viewCache.serverCache.isFullyInitialized(),\n        'If change path is empty, we must have complete server data'\n      );\n      if (viewCache.serverCache.isFiltered()) {\n        // We need to special case this, because we need to only apply writes to complete children, or\n        // we might end up raising events for incomplete children. If the server data is filtered deep\n        // writes cannot be guaranteed to be complete\n        const serverCache = viewCacheGetCompleteServerSnap(viewCache);\n        const completeChildren =\n          serverCache instanceof ChildrenNode\n            ? serverCache\n            : ChildrenNode.EMPTY_NODE;\n        const completeEventChildren = writeTreeRefCalcCompleteEventChildren(\n          writesCache,\n          completeChildren\n        );\n        newEventCache = viewProcessor.filter.updateFullNode(\n          viewCache.eventCache.getNode(),\n          completeEventChildren,\n          accumulator\n        );\n      } else {\n        const completeNode = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n        newEventCache = viewProcessor.filter.updateFullNode(\n          viewCache.eventCache.getNode(),\n          completeNode,\n          accumulator\n        );\n      }\n    } else {\n      const childKey = pathGetFront(changePath);\n      if (childKey === '.priority') {\n        assert(\n          pathGetLength(changePath) === 1,\n          \"Can't have a priority with additional path components\"\n        );\n        const oldEventNode = oldEventSnap.getNode();\n        serverNode = viewCache.serverCache.getNode();\n        // we might have overwrites for this priority\n        const updatedPriority = writeTreeRefCalcEventCacheAfterServerOverwrite(\n          writesCache,\n          changePath,\n          oldEventNode,\n          serverNode\n        );\n        if (updatedPriority != null) {\n          newEventCache = viewProcessor.filter.updatePriority(\n            oldEventNode,\n            updatedPriority\n          );\n        } else {\n          // priority didn't change, keep old node\n          newEventCache = oldEventSnap.getNode();\n        }\n      } else {\n        const childChangePath = pathPopFront(changePath);\n        // update child\n        let newEventChild;\n        if (oldEventSnap.isCompleteForChild(childKey)) {\n          serverNode = viewCache.serverCache.getNode();\n          const eventChildUpdate =\n            writeTreeRefCalcEventCacheAfterServerOverwrite(\n              writesCache,\n              changePath,\n              oldEventSnap.getNode(),\n              serverNode\n            );\n          if (eventChildUpdate != null) {\n            newEventChild = oldEventSnap\n              .getNode()\n              .getImmediateChild(childKey)\n              .updateChild(childChangePath, eventChildUpdate);\n          } else {\n            // Nothing changed, just keep the old child\n            newEventChild = oldEventSnap.getNode().getImmediateChild(childKey);\n          }\n        } else {\n          newEventChild = writeTreeRefCalcCompleteChild(\n            writesCache,\n            childKey,\n            viewCache.serverCache\n          );\n        }\n        if (newEventChild != null) {\n          newEventCache = viewProcessor.filter.updateChild(\n            oldEventSnap.getNode(),\n            childKey,\n            newEventChild,\n            childChangePath,\n            source,\n            accumulator\n          );\n        } else {\n          // no complete child available or no change\n          newEventCache = oldEventSnap.getNode();\n        }\n      }\n    }\n    return viewCacheUpdateEventSnap(\n      viewCache,\n      newEventCache,\n      oldEventSnap.isFullyInitialized() || pathIsEmpty(changePath),\n      viewProcessor.filter.filtersNodes()\n    );\n  }\n}\n\nfunction viewProcessorApplyServerOverwrite(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  changePath: Path,\n  changedSnap: Node,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  filterServerNode: boolean,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldServerSnap = oldViewCache.serverCache;\n  let newServerCache;\n  const serverFilter = filterServerNode\n    ? viewProcessor.filter\n    : viewProcessor.filter.getIndexedFilter();\n  if (pathIsEmpty(changePath)) {\n    newServerCache = serverFilter.updateFullNode(\n      oldServerSnap.getNode(),\n      changedSnap,\n      null\n    );\n  } else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n    // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n    const newServerNode = oldServerSnap\n      .getNode()\n      .updateChild(changePath, changedSnap);\n    newServerCache = serverFilter.updateFullNode(\n      oldServerSnap.getNode(),\n      newServerNode,\n      null\n    );\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (\n      !oldServerSnap.isCompleteForPath(changePath) &&\n      pathGetLength(changePath) > 1\n    ) {\n      // We don't update incomplete nodes with updates intended for other listeners\n      return oldViewCache;\n    }\n    const childChangePath = pathPopFront(changePath);\n    const childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n    const newChildNode = childNode.updateChild(childChangePath, changedSnap);\n    if (childKey === '.priority') {\n      newServerCache = serverFilter.updatePriority(\n        oldServerSnap.getNode(),\n        newChildNode\n      );\n    } else {\n      newServerCache = serverFilter.updateChild(\n        oldServerSnap.getNode(),\n        childKey,\n        newChildNode,\n        childChangePath,\n        NO_COMPLETE_CHILD_SOURCE,\n        null\n      );\n    }\n  }\n  const newViewCache = viewCacheUpdateServerSnap(\n    oldViewCache,\n    newServerCache,\n    oldServerSnap.isFullyInitialized() || pathIsEmpty(changePath),\n    serverFilter.filtersNodes()\n  );\n  const source = new WriteTreeCompleteChildSource(\n    writesCache,\n    newViewCache,\n    completeCache\n  );\n  return viewProcessorGenerateEventCacheAfterServerEvent(\n    viewProcessor,\n    newViewCache,\n    changePath,\n    writesCache,\n    source,\n    accumulator\n  );\n}\n\nfunction viewProcessorApplyUserOverwrite(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  changePath: Path,\n  changedSnap: Node,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldEventSnap = oldViewCache.eventCache;\n  let newViewCache, newEventCache;\n  const source = new WriteTreeCompleteChildSource(\n    writesCache,\n    oldViewCache,\n    completeCache\n  );\n  if (pathIsEmpty(changePath)) {\n    newEventCache = viewProcessor.filter.updateFullNode(\n      oldViewCache.eventCache.getNode(),\n      changedSnap,\n      accumulator\n    );\n    newViewCache = viewCacheUpdateEventSnap(\n      oldViewCache,\n      newEventCache,\n      true,\n      viewProcessor.filter.filtersNodes()\n    );\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (childKey === '.priority') {\n      newEventCache = viewProcessor.filter.updatePriority(\n        oldViewCache.eventCache.getNode(),\n        changedSnap\n      );\n      newViewCache = viewCacheUpdateEventSnap(\n        oldViewCache,\n        newEventCache,\n        oldEventSnap.isFullyInitialized(),\n        oldEventSnap.isFiltered()\n      );\n    } else {\n      const childChangePath = pathPopFront(changePath);\n      const oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n      let newChild;\n      if (pathIsEmpty(childChangePath)) {\n        // Child overwrite, we can replace the child\n        newChild = changedSnap;\n      } else {\n        const childNode = source.getCompleteChild(childKey);\n        if (childNode != null) {\n          if (\n            pathGetBack(childChangePath) === '.priority' &&\n            childNode.getChild(pathParent(childChangePath)).isEmpty()\n          ) {\n            // This is a priority update on an empty node. If this node exists on the server, the\n            // server will send down the priority in the update, so ignore for now\n            newChild = childNode;\n          } else {\n            newChild = childNode.updateChild(childChangePath, changedSnap);\n          }\n        } else {\n          // There is no complete child node available\n          newChild = ChildrenNode.EMPTY_NODE;\n        }\n      }\n      if (!oldChild.equals(newChild)) {\n        const newEventSnap = viewProcessor.filter.updateChild(\n          oldEventSnap.getNode(),\n          childKey,\n          newChild,\n          childChangePath,\n          source,\n          accumulator\n        );\n        newViewCache = viewCacheUpdateEventSnap(\n          oldViewCache,\n          newEventSnap,\n          oldEventSnap.isFullyInitialized(),\n          viewProcessor.filter.filtersNodes()\n        );\n      } else {\n        newViewCache = oldViewCache;\n      }\n    }\n  }\n  return newViewCache;\n}\n\nfunction viewProcessorCacheHasChild(\n  viewCache: ViewCache,\n  childKey: string\n): boolean {\n  return viewCache.eventCache.isCompleteForChild(childKey);\n}\n\nfunction viewProcessorApplyUserMerge(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  changedChildren: ImmutableTree<Node>,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  // HACK: In the case of a limit query, there may be some changes that bump things out of the\n  // window leaving room for new items.  It's important we process these changes first, so we\n  // iterate the changes twice, first processing any that affect items currently in view.\n  // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n  // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n  // not the other.\n  let curViewCache = viewCache;\n  changedChildren.foreach((relativePath, childNode) => {\n    const writePath = pathChild(path, relativePath);\n    if (viewProcessorCacheHasChild(viewCache, pathGetFront(writePath))) {\n      curViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        curViewCache,\n        writePath,\n        childNode,\n        writesCache,\n        serverCache,\n        accumulator\n      );\n    }\n  });\n\n  changedChildren.foreach((relativePath, childNode) => {\n    const writePath = pathChild(path, relativePath);\n    if (!viewProcessorCacheHasChild(viewCache, pathGetFront(writePath))) {\n      curViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        curViewCache,\n        writePath,\n        childNode,\n        writesCache,\n        serverCache,\n        accumulator\n      );\n    }\n  });\n\n  return curViewCache;\n}\n\nfunction viewProcessorApplyMerge(\n  viewProcessor: ViewProcessor,\n  node: Node,\n  merge: ImmutableTree<Node>\n): Node {\n  merge.foreach((relativePath, childNode) => {\n    node = node.updateChild(relativePath, childNode);\n  });\n  return node;\n}\n\nfunction viewProcessorApplyServerMerge(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  changedChildren: ImmutableTree<Node>,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  filterServerNode: boolean,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n  // wait for the complete data update coming soon.\n  if (\n    viewCache.serverCache.getNode().isEmpty() &&\n    !viewCache.serverCache.isFullyInitialized()\n  ) {\n    return viewCache;\n  }\n\n  // HACK: In the case of a limit query, there may be some changes that bump things out of the\n  // window leaving room for new items.  It's important we process these changes first, so we\n  // iterate the changes twice, first processing any that affect items currently in view.\n  // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n  // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n  // not the other.\n  let curViewCache = viewCache;\n  let viewMergeTree: ImmutableTree<Node>;\n  if (pathIsEmpty(path)) {\n    viewMergeTree = changedChildren;\n  } else {\n    viewMergeTree = new ImmutableTree<Node>(null).setTree(\n      path,\n      changedChildren\n    );\n  }\n  const serverNode = viewCache.serverCache.getNode();\n  viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n    if (serverNode.hasChild(childKey)) {\n      const serverChild = viewCache.serverCache\n        .getNode()\n        .getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(\n        viewProcessor,\n        serverChild,\n        childTree\n      );\n      curViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        curViewCache,\n        new Path(childKey),\n        newChild,\n        writesCache,\n        serverCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  });\n  viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n    const isUnknownDeepMerge =\n      !viewCache.serverCache.isCompleteForChild(childKey) &&\n      childMergeTree.value === null;\n    if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n      const serverChild = viewCache.serverCache\n        .getNode()\n        .getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(\n        viewProcessor,\n        serverChild,\n        childMergeTree\n      );\n      curViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        curViewCache,\n        new Path(childKey),\n        newChild,\n        writesCache,\n        serverCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  });\n\n  return curViewCache;\n}\n\nfunction viewProcessorAckUserWrite(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  ackPath: Path,\n  affectedTree: ImmutableTree<boolean>,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  if (writeTreeRefShadowingWrite(writesCache, ackPath) != null) {\n    return viewCache;\n  }\n\n  // Only filter server node if it is currently filtered\n  const filterServerNode = viewCache.serverCache.isFiltered();\n\n  // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n  // now that it won't be shadowed.\n  const serverCache = viewCache.serverCache;\n  if (affectedTree.value != null) {\n    // This is an overwrite.\n    if (\n      (pathIsEmpty(ackPath) && serverCache.isFullyInitialized()) ||\n      serverCache.isCompleteForPath(ackPath)\n    ) {\n      return viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        viewCache,\n        ackPath,\n        serverCache.getNode().getChild(ackPath),\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    } else if (pathIsEmpty(ackPath)) {\n      // This is a goofy edge case where we are acking data at this location but don't have full data.  We\n      // should just re-apply whatever we have in our cache as a merge.\n      let changedChildren = new ImmutableTree<Node>(null);\n      serverCache.getNode().forEachChild(KEY_INDEX, (name, node) => {\n        changedChildren = changedChildren.set(new Path(name), node);\n      });\n      return viewProcessorApplyServerMerge(\n        viewProcessor,\n        viewCache,\n        ackPath,\n        changedChildren,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    } else {\n      return viewCache;\n    }\n  } else {\n    // This is a merge.\n    let changedChildren = new ImmutableTree<Node>(null);\n    affectedTree.foreach((mergePath, value) => {\n      const serverCachePath = pathChild(ackPath, mergePath);\n      if (serverCache.isCompleteForPath(serverCachePath)) {\n        changedChildren = changedChildren.set(\n          mergePath,\n          serverCache.getNode().getChild(serverCachePath)\n        );\n      }\n    });\n    return viewProcessorApplyServerMerge(\n      viewProcessor,\n      viewCache,\n      ackPath,\n      changedChildren,\n      writesCache,\n      completeCache,\n      filterServerNode,\n      accumulator\n    );\n  }\n}\n\nfunction viewProcessorListenComplete(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  writesCache: WriteTreeRef,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldServerNode = viewCache.serverCache;\n  const newViewCache = viewCacheUpdateServerSnap(\n    viewCache,\n    oldServerNode.getNode(),\n    oldServerNode.isFullyInitialized() || pathIsEmpty(path),\n    oldServerNode.isFiltered()\n  );\n  return viewProcessorGenerateEventCacheAfterServerEvent(\n    viewProcessor,\n    newViewCache,\n    path,\n    writesCache,\n    NO_COMPLETE_CHILD_SOURCE,\n    accumulator\n  );\n}\n\nfunction viewProcessorRevertUserWrite(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  writesCache: WriteTreeRef,\n  completeServerCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  let complete;\n  if (writeTreeRefShadowingWrite(writesCache, path) != null) {\n    return viewCache;\n  } else {\n    const source = new WriteTreeCompleteChildSource(\n      writesCache,\n      viewCache,\n      completeServerCache\n    );\n    const oldEventCache = viewCache.eventCache.getNode();\n    let newEventCache;\n    if (pathIsEmpty(path) || pathGetFront(path) === '.priority') {\n      let newNode;\n      if (viewCache.serverCache.isFullyInitialized()) {\n        newNode = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n      } else {\n        const serverChildren = viewCache.serverCache.getNode();\n        assert(\n          serverChildren instanceof ChildrenNode,\n          'serverChildren would be complete if leaf node'\n        );\n        newNode = writeTreeRefCalcCompleteEventChildren(\n          writesCache,\n          serverChildren as ChildrenNode\n        );\n      }\n      newNode = newNode as Node;\n      newEventCache = viewProcessor.filter.updateFullNode(\n        oldEventCache,\n        newNode,\n        accumulator\n      );\n    } else {\n      const childKey = pathGetFront(path);\n      let newChild = writeTreeRefCalcCompleteChild(\n        writesCache,\n        childKey,\n        viewCache.serverCache\n      );\n      if (\n        newChild == null &&\n        viewCache.serverCache.isCompleteForChild(childKey)\n      ) {\n        newChild = oldEventCache.getImmediateChild(childKey);\n      }\n      if (newChild != null) {\n        newEventCache = viewProcessor.filter.updateChild(\n          oldEventCache,\n          childKey,\n          newChild,\n          pathPopFront(path),\n          source,\n          accumulator\n        );\n      } else if (viewCache.eventCache.getNode().hasChild(childKey)) {\n        // No complete child available, delete the existing one, if any\n        newEventCache = viewProcessor.filter.updateChild(\n          oldEventCache,\n          childKey,\n          ChildrenNode.EMPTY_NODE,\n          pathPopFront(path),\n          source,\n          accumulator\n        );\n      } else {\n        newEventCache = oldEventCache;\n      }\n      if (\n        newEventCache.isEmpty() &&\n        viewCache.serverCache.isFullyInitialized()\n      ) {\n        // We might have reverted all child writes. Maybe the old event was a leaf node\n        complete = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n        if (complete.isLeafNode()) {\n          newEventCache = viewProcessor.filter.updateFullNode(\n            newEventCache,\n            complete,\n            accumulator\n          );\n        }\n      }\n    }\n    complete =\n      viewCache.serverCache.isFullyInitialized() ||\n      writeTreeRefShadowingWrite(writesCache, newEmptyPath()) != null;\n    return viewCacheUpdateEventSnap(\n      viewCache,\n      newEventCache,\n      complete,\n      viewProcessor.filter.filtersNodes()\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { Operation, OperationType } from '../operation/Operation';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { Node } from '../snap/Node';\nimport { Path, pathGetFront, pathIsEmpty } from '../util/Path';\nimport { WriteTreeRef } from '../WriteTree';\n\nimport { CacheNode } from './CacheNode';\nimport { Change, changeChildAdded, changeValue } from './Change';\nimport { CancelEvent, Event } from './Event';\nimport {\n  EventGenerator,\n  eventGeneratorGenerateEventsForChanges\n} from './EventGenerator';\nimport { EventRegistration, QueryContext } from './EventRegistration';\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { queryParamsGetNodeFilter } from './QueryParams';\nimport {\n  newViewCache,\n  ViewCache,\n  viewCacheGetCompleteEventSnap,\n  viewCacheGetCompleteServerSnap\n} from './ViewCache';\nimport {\n  newViewProcessor,\n  ViewProcessor,\n  viewProcessorApplyOperation,\n  viewProcessorAssertIndexed\n} from './ViewProcessor';\n\n/**\n * A view represents a specific location and query that has 1 or more event registrations.\n *\n * It does several things:\n *  - Maintains the list of event registrations for this location/query.\n *  - Maintains a cache of the data visible for this location/query.\n *  - Applies new operations (via applyOperation), updates the cache, and based on the event\n *    registrations returns the set of events to be raised.\n */\nexport class View {\n  processor_: ViewProcessor;\n  viewCache_: ViewCache;\n  eventRegistrations_: EventRegistration[] = [];\n  eventGenerator_: EventGenerator;\n\n  constructor(private query_: QueryContext, initialViewCache: ViewCache) {\n    const params = this.query_._queryParams;\n\n    const indexFilter = new IndexedFilter(params.getIndex());\n    const filter = queryParamsGetNodeFilter(params);\n\n    this.processor_ = newViewProcessor(filter);\n\n    const initialServerCache = initialViewCache.serverCache;\n    const initialEventCache = initialViewCache.eventCache;\n\n    // Don't filter server node with other filter than index, wait for tagged listen\n    const serverSnap = indexFilter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialServerCache.getNode(),\n      null\n    );\n    const eventSnap = filter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialEventCache.getNode(),\n      null\n    );\n    const newServerCache = new CacheNode(\n      serverSnap,\n      initialServerCache.isFullyInitialized(),\n      indexFilter.filtersNodes()\n    );\n    const newEventCache = new CacheNode(\n      eventSnap,\n      initialEventCache.isFullyInitialized(),\n      filter.filtersNodes()\n    );\n\n    this.viewCache_ = newViewCache(newEventCache, newServerCache);\n    this.eventGenerator_ = new EventGenerator(this.query_);\n  }\n\n  get query(): QueryContext {\n    return this.query_;\n  }\n}\n\nexport function viewGetServerCache(view: View): Node | null {\n  return view.viewCache_.serverCache.getNode();\n}\n\nexport function viewGetCompleteNode(view: View): Node | null {\n  return viewCacheGetCompleteEventSnap(view.viewCache_);\n}\n\nexport function viewGetCompleteServerCache(\n  view: View,\n  path: Path\n): Node | null {\n  const cache = viewCacheGetCompleteServerSnap(view.viewCache_);\n  if (cache) {\n    // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\n    // we need to see if it contains the child we're interested in.\n    if (\n      view.query._queryParams.loadsAllData() ||\n      (!pathIsEmpty(path) &&\n        !cache.getImmediateChild(pathGetFront(path)).isEmpty())\n    ) {\n      return cache.getChild(path);\n    }\n  }\n  return null;\n}\n\nexport function viewIsEmpty(view: View): boolean {\n  return view.eventRegistrations_.length === 0;\n}\n\nexport function viewAddEventRegistration(\n  view: View,\n  eventRegistration: EventRegistration\n) {\n  view.eventRegistrations_.push(eventRegistration);\n}\n\n/**\n * @param eventRegistration - If null, remove all callbacks.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @returns Cancel events, if cancelError was provided.\n */\nexport function viewRemoveEventRegistration(\n  view: View,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error\n): Event[] {\n  const cancelEvents: CancelEvent[] = [];\n  if (cancelError) {\n    assert(\n      eventRegistration == null,\n      'A cancel should cancel all event registrations.'\n    );\n    const path = view.query._path;\n    view.eventRegistrations_.forEach(registration => {\n      const maybeEvent = registration.createCancelEvent(cancelError, path);\n      if (maybeEvent) {\n        cancelEvents.push(maybeEvent);\n      }\n    });\n  }\n\n  if (eventRegistration) {\n    let remaining = [];\n    for (let i = 0; i < view.eventRegistrations_.length; ++i) {\n      const existing = view.eventRegistrations_[i];\n      if (!existing.matches(eventRegistration)) {\n        remaining.push(existing);\n      } else if (eventRegistration.hasAnyCallback()) {\n        // We're removing just this one\n        remaining = remaining.concat(view.eventRegistrations_.slice(i + 1));\n        break;\n      }\n    }\n    view.eventRegistrations_ = remaining;\n  } else {\n    view.eventRegistrations_ = [];\n  }\n  return cancelEvents;\n}\n\n/**\n * Applies the given Operation, updates our cache, and returns the appropriate events.\n */\nexport function viewApplyOperation(\n  view: View,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  completeServerCache: Node | null\n): Event[] {\n  if (\n    operation.type === OperationType.MERGE &&\n    operation.source.queryId !== null\n  ) {\n    assert(\n      viewCacheGetCompleteServerSnap(view.viewCache_),\n      'We should always have a full cache before handling merges'\n    );\n    assert(\n      viewCacheGetCompleteEventSnap(view.viewCache_),\n      'Missing event cache, even though we have a server cache'\n    );\n  }\n\n  const oldViewCache = view.viewCache_;\n  const result = viewProcessorApplyOperation(\n    view.processor_,\n    oldViewCache,\n    operation,\n    writesCache,\n    completeServerCache\n  );\n  viewProcessorAssertIndexed(view.processor_, result.viewCache);\n\n  assert(\n    result.viewCache.serverCache.isFullyInitialized() ||\n      !oldViewCache.serverCache.isFullyInitialized(),\n    'Once a server snap is complete, it should never go back'\n  );\n\n  view.viewCache_ = result.viewCache;\n\n  return viewGenerateEventsForChanges_(\n    view,\n    result.changes,\n    result.viewCache.eventCache.getNode(),\n    null\n  );\n}\n\nexport function viewGetInitialEvents(\n  view: View,\n  registration: EventRegistration\n): Event[] {\n  const eventSnap = view.viewCache_.eventCache;\n  const initialChanges: Change[] = [];\n  if (!eventSnap.getNode().isLeafNode()) {\n    const eventNode = eventSnap.getNode() as ChildrenNode;\n    eventNode.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n      initialChanges.push(changeChildAdded(key, childNode));\n    });\n  }\n  if (eventSnap.isFullyInitialized()) {\n    initialChanges.push(changeValue(eventSnap.getNode()));\n  }\n  return viewGenerateEventsForChanges_(\n    view,\n    initialChanges,\n    eventSnap.getNode(),\n    registration\n  );\n}\n\nfunction viewGenerateEventsForChanges_(\n  view: View,\n  changes: Change[],\n  eventCache: Node,\n  eventRegistration?: EventRegistration\n): Event[] {\n  const registrations = eventRegistration\n    ? [eventRegistration]\n    : view.eventRegistrations_;\n  return eventGeneratorGenerateEventsForChanges(\n    view.eventGenerator_,\n    changes,\n    eventCache,\n    registrations\n  );\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ReferenceConstructor } from '../api/Reference';\n\nimport { Operation } from './operation/Operation';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { Path } from './util/Path';\nimport { CacheNode } from './view/CacheNode';\nimport { Event } from './view/Event';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\nimport {\n  View,\n  viewAddEventRegistration,\n  viewApplyOperation,\n  viewGetCompleteServerCache,\n  viewGetInitialEvents,\n  viewIsEmpty,\n  viewRemoveEventRegistration\n} from './view/View';\nimport { newViewCache } from './view/ViewCache';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteEventCache,\n  writeTreeRefCalcCompleteEventChildren\n} from './WriteTree';\n\nlet referenceConstructor: ReferenceConstructor;\n\n/**\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\n * and user writes (set, transaction, update).\n *\n * It's responsible for:\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\n *    applyUserOverwrite, etc.)\n */\nexport class SyncPoint {\n  /**\n   * The Views being tracked at this location in the tree, stored as a map where the key is a\n   * queryId and the value is the View for that query.\n   *\n   * NOTE: This list will be quite small (usually 1, but perhaps 2 or 3; any more is an odd use case).\n   */\n  readonly views: Map<string, View> = new Map();\n}\n\nexport function syncPointSetReferenceConstructor(\n  val: ReferenceConstructor\n): void {\n  assert(\n    !referenceConstructor,\n    '__referenceConstructor has already been defined'\n  );\n  referenceConstructor = val;\n}\n\nfunction syncPointGetReferenceConstructor(): ReferenceConstructor {\n  assert(referenceConstructor, 'Reference.ts has not been loaded');\n  return referenceConstructor;\n}\n\nexport function syncPointIsEmpty(syncPoint: SyncPoint): boolean {\n  return syncPoint.views.size === 0;\n}\n\nexport function syncPointApplyOperation(\n  syncPoint: SyncPoint,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  optCompleteServerCache: Node | null\n): Event[] {\n  const queryId = operation.source.queryId;\n  if (queryId !== null) {\n    const view = syncPoint.views.get(queryId);\n    assert(view != null, 'SyncTree gave us an op for an invalid query.');\n    return viewApplyOperation(\n      view,\n      operation,\n      writesCache,\n      optCompleteServerCache\n    );\n  } else {\n    let events: Event[] = [];\n\n    for (const view of syncPoint.views.values()) {\n      events = events.concat(\n        viewApplyOperation(view, operation, writesCache, optCompleteServerCache)\n      );\n    }\n\n    return events;\n  }\n}\n\n/**\n * Get a view for the specified query.\n *\n * @param query - The query to return a view for\n * @param writesCache\n * @param serverCache\n * @param serverCacheComplete\n * @returns Events to raise.\n */\nexport function syncPointGetView(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  serverCacheComplete: boolean\n): View {\n  const queryId = query._queryIdentifier;\n  const view = syncPoint.views.get(queryId);\n  if (!view) {\n    // TODO: make writesCache take flag for complete server node\n    let eventCache = writeTreeRefCalcCompleteEventCache(\n      writesCache,\n      serverCacheComplete ? serverCache : null\n    );\n    let eventCacheComplete = false;\n    if (eventCache) {\n      eventCacheComplete = true;\n    } else if (serverCache instanceof ChildrenNode) {\n      eventCache = writeTreeRefCalcCompleteEventChildren(\n        writesCache,\n        serverCache\n      );\n      eventCacheComplete = false;\n    } else {\n      eventCache = ChildrenNode.EMPTY_NODE;\n      eventCacheComplete = false;\n    }\n    const viewCache = newViewCache(\n      new CacheNode(eventCache, eventCacheComplete, false),\n      new CacheNode(serverCache, serverCacheComplete, false)\n    );\n    return new View(query, viewCache);\n  }\n  return view;\n}\n\n/**\n * Add an event callback for the specified query.\n *\n * @param query\n * @param eventRegistration\n * @param writesCache\n * @param serverCache - Complete server cache, if we have it.\n * @param serverCacheComplete\n * @returns Events to raise.\n */\nexport function syncPointAddEventRegistration(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  eventRegistration: EventRegistration,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  serverCacheComplete: boolean\n): Event[] {\n  const view = syncPointGetView(\n    syncPoint,\n    query,\n    writesCache,\n    serverCache,\n    serverCacheComplete\n  );\n  if (!syncPoint.views.has(query._queryIdentifier)) {\n    syncPoint.views.set(query._queryIdentifier, view);\n  }\n  // This is guaranteed to exist now, we just created anything that was missing\n  viewAddEventRegistration(view, eventRegistration);\n  return viewGetInitialEvents(view, eventRegistration);\n}\n\n/**\n * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n *\n * If query is the default query, we'll check all views for the specified eventRegistration.\n * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n *\n * @param eventRegistration - If null, remove all callbacks.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @returns removed queries and any cancel events\n */\nexport function syncPointRemoveEventRegistration(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error\n): { removed: QueryContext[]; events: Event[] } {\n  const queryId = query._queryIdentifier;\n  const removed: QueryContext[] = [];\n  let cancelEvents: Event[] = [];\n  const hadCompleteView = syncPointHasCompleteView(syncPoint);\n  if (queryId === 'default') {\n    // When you do ref.off(...), we search all views for the registration to remove.\n    for (const [viewQueryId, view] of syncPoint.views.entries()) {\n      cancelEvents = cancelEvents.concat(\n        viewRemoveEventRegistration(view, eventRegistration, cancelError)\n      );\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(viewQueryId);\n\n        // We'll deal with complete views later.\n        if (!view.query._queryParams.loadsAllData()) {\n          removed.push(view.query);\n        }\n      }\n    }\n  } else {\n    // remove the callback from the specific view.\n    const view = syncPoint.views.get(queryId);\n    if (view) {\n      cancelEvents = cancelEvents.concat(\n        viewRemoveEventRegistration(view, eventRegistration, cancelError)\n      );\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(queryId);\n\n        // We'll deal with complete views later.\n        if (!view.query._queryParams.loadsAllData()) {\n          removed.push(view.query);\n        }\n      }\n    }\n  }\n\n  if (hadCompleteView && !syncPointHasCompleteView(syncPoint)) {\n    // We removed our last complete view.\n    removed.push(\n      new (syncPointGetReferenceConstructor())(query._repo, query._path)\n    );\n  }\n\n  return { removed, events: cancelEvents };\n}\n\nexport function syncPointGetQueryViews(syncPoint: SyncPoint): View[] {\n  const result = [];\n  for (const view of syncPoint.views.values()) {\n    if (!view.query._queryParams.loadsAllData()) {\n      result.push(view);\n    }\n  }\n  return result;\n}\n\n/**\n * @param path - The path to the desired complete snapshot\n * @returns A complete cache, if it exists\n */\nexport function syncPointGetCompleteServerCache(\n  syncPoint: SyncPoint,\n  path: Path\n): Node | null {\n  let serverCache: Node | null = null;\n  for (const view of syncPoint.views.values()) {\n    serverCache = serverCache || viewGetCompleteServerCache(view, path);\n  }\n  return serverCache;\n}\n\nexport function syncPointViewForQuery(\n  syncPoint: SyncPoint,\n  query: QueryContext\n): View | null {\n  const params = query._queryParams;\n  if (params.loadsAllData()) {\n    return syncPointGetCompleteView(syncPoint);\n  } else {\n    const queryId = query._queryIdentifier;\n    return syncPoint.views.get(queryId);\n  }\n}\n\nexport function syncPointViewExistsForQuery(\n  syncPoint: SyncPoint,\n  query: QueryContext\n): boolean {\n  return syncPointViewForQuery(syncPoint, query) != null;\n}\n\nexport function syncPointHasCompleteView(syncPoint: SyncPoint): boolean {\n  return syncPointGetCompleteView(syncPoint) != null;\n}\n\nexport function syncPointGetCompleteView(syncPoint: SyncPoint): View | null {\n  for (const view of syncPoint.views.values()) {\n    if (view.query._queryParams.loadsAllData()) {\n      return view;\n    }\n  }\n  return null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ReferenceConstructor } from '../api/Reference';\n\nimport { AckUserWrite } from './operation/AckUserWrite';\nimport { ListenComplete } from './operation/ListenComplete';\nimport { Merge } from './operation/Merge';\nimport {\n  newOperationSourceServer,\n  newOperationSourceServerTaggedQuery,\n  newOperationSourceUser,\n  Operation\n} from './operation/Operation';\nimport { Overwrite } from './operation/Overwrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport {\n  SyncPoint,\n  syncPointAddEventRegistration,\n  syncPointApplyOperation,\n  syncPointGetCompleteServerCache,\n  syncPointGetCompleteView,\n  syncPointGetQueryViews,\n  syncPointGetView,\n  syncPointHasCompleteView,\n  syncPointIsEmpty,\n  syncPointRemoveEventRegistration,\n  syncPointViewExistsForQuery,\n  syncPointViewForQuery\n} from './SyncPoint';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathGetFront,\n  pathIsEmpty\n} from './util/Path';\nimport { each, errorForServerCode } from './util/util';\nimport { CacheNode } from './view/CacheNode';\nimport { Event } from './view/Event';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\nimport { View, viewGetCompleteNode, viewGetServerCache } from './view/View';\nimport {\n  newWriteTree,\n  WriteTree,\n  writeTreeAddMerge,\n  writeTreeAddOverwrite,\n  writeTreeCalcCompleteEventCache,\n  writeTreeChildWrites,\n  writeTreeGetWrite,\n  WriteTreeRef,\n  writeTreeRefChild,\n  writeTreeRemoveWrite\n} from './WriteTree';\n\nlet referenceConstructor: ReferenceConstructor;\n\nexport function syncTreeSetReferenceConstructor(\n  val: ReferenceConstructor\n): void {\n  assert(\n    !referenceConstructor,\n    '__referenceConstructor has already been defined'\n  );\n  referenceConstructor = val;\n}\n\nfunction syncTreeGetReferenceConstructor(): ReferenceConstructor {\n  assert(referenceConstructor, 'Reference.ts has not been loaded');\n  return referenceConstructor;\n}\n\nexport interface ListenProvider {\n  startListening(\n    query: QueryContext,\n    tag: number | null,\n    hashFn: () => string,\n    onComplete: (a: string, b?: unknown) => Event[]\n  ): Event[];\n\n  stopListening(a: QueryContext, b: number | null): void;\n}\n\n/**\n * Static tracker for next query tag.\n */\nlet syncTreeNextQueryTag_ = 1;\n\nexport function resetSyncTreeTag() {\n  syncTreeNextQueryTag_ = 1;\n}\n\n/**\n * SyncTree is the central class for managing event callback registration, data caching, views\n * (query processing), and event generation.  There are typically two SyncTree instances for\n * each Repo, one for the normal Firebase data, and one for the .info data.\n *\n * It has a number of responsibilities, including:\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\n *    (applyUserOverwrite(), applyUserMerge()).\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\n *    applyServerMerge()).\n *  - Generating user-facing events for server and user changes (all of the apply* methods\n *    return the set of events that need to be raised as a result).\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\n *    to the correct set of paths and queries to satisfy the current set of user event\n *    callbacks (listens are started/stopped using the provided listenProvider).\n *\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\n * events are returned to the caller rather than raised synchronously.\n *\n */\nexport class SyncTree {\n  /**\n   * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n   */\n  syncPointTree_: ImmutableTree<SyncPoint> = new ImmutableTree<SyncPoint>(null);\n\n  /**\n   * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n   */\n  pendingWriteTree_: WriteTree = newWriteTree();\n\n  readonly tagToQueryMap: Map<number, string> = new Map();\n  readonly queryToTagMap: Map<string, number> = new Map();\n\n  /**\n   * @param listenProvider_ - Used by SyncTree to start / stop listening\n   *   to server data.\n   */\n  constructor(public listenProvider_: ListenProvider) {}\n}\n\n/**\n * Apply the data changes for a user-generated set() or transaction() call.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyUserOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  newData: Node,\n  writeId: number,\n  visible?: boolean\n): Event[] {\n  // Record pending write.\n  writeTreeAddOverwrite(\n    syncTree.pendingWriteTree_,\n    path,\n    newData,\n    writeId,\n    visible\n  );\n\n  if (!visible) {\n    return [];\n  } else {\n    return syncTreeApplyOperationToSyncPoints_(\n      syncTree,\n      new Overwrite(newOperationSourceUser(), path, newData)\n    );\n  }\n}\n\n/**\n * Apply the data from a user-generated update() call\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyUserMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  writeId: number\n): Event[] {\n  // Record pending merge.\n  writeTreeAddMerge(syncTree.pendingWriteTree_, path, changedChildren, writeId);\n\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Merge(newOperationSourceUser(), path, changeTree)\n  );\n}\n\n/**\n * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\n *\n * @param revert - True if the given write failed and needs to be reverted\n * @returns Events to raise.\n */\nexport function syncTreeAckUserWrite(\n  syncTree: SyncTree,\n  writeId: number,\n  revert: boolean = false\n) {\n  const write = writeTreeGetWrite(syncTree.pendingWriteTree_, writeId);\n  const needToReevaluate = writeTreeRemoveWrite(\n    syncTree.pendingWriteTree_,\n    writeId\n  );\n  if (!needToReevaluate) {\n    return [];\n  } else {\n    let affectedTree = new ImmutableTree<boolean>(null);\n    if (write.snap != null) {\n      // overwrite\n      affectedTree = affectedTree.set(newEmptyPath(), true);\n    } else {\n      each(write.children, (pathString: string) => {\n        affectedTree = affectedTree.set(new Path(pathString), true);\n      });\n    }\n    return syncTreeApplyOperationToSyncPoints_(\n      syncTree,\n      new AckUserWrite(write.path, affectedTree, revert)\n    );\n  }\n}\n\n/**\n * Apply new server data for the specified path..\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyServerOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  newData: Node\n): Event[] {\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Overwrite(newOperationSourceServer(), path, newData)\n  );\n}\n\n/**\n * Apply new server data to be merged in at the specified path.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyServerMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node }\n): Event[] {\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Merge(newOperationSourceServer(), path, changeTree)\n  );\n}\n\n/**\n * Apply a listen complete for a query\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyListenComplete(\n  syncTree: SyncTree,\n  path: Path\n): Event[] {\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new ListenComplete(newOperationSourceServer(), path)\n  );\n}\n\n/**\n * Apply a listen complete for a tagged query\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedListenComplete(\n  syncTree: SyncTree,\n  path: Path,\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const op = new ListenComplete(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // We've already removed the query. No big deal, ignore the update\n    return [];\n  }\n}\n\n/**\n * Remove event callback(s).\n *\n * If query is the default query, we'll check all queries for the specified eventRegistration.\n * If eventRegistration is null, we'll remove all callbacks for the specified query/queries.\n *\n * @param eventRegistration - If null, all callbacks are removed.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @param skipListenerDedup - When performing a `get()`, we don't add any new listeners, so no\n *  deduping needs to take place. This flag allows toggling of that behavior\n * @returns Cancel events, if cancelError was provided.\n */\nexport function syncTreeRemoveEventRegistration(\n  syncTree: SyncTree,\n  query: QueryContext,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error,\n  skipListenerDedup = false\n): Event[] {\n  // Find the syncPoint first. Then deal with whether or not it has matching listeners\n  const path = query._path;\n  const maybeSyncPoint = syncTree.syncPointTree_.get(path);\n  let cancelEvents: Event[] = [];\n  // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n  // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n  // not loadsAllData().\n  if (\n    maybeSyncPoint &&\n    (query._queryIdentifier === 'default' ||\n      syncPointViewExistsForQuery(maybeSyncPoint, query))\n  ) {\n    const removedAndEvents = syncPointRemoveEventRegistration(\n      maybeSyncPoint,\n      query,\n      eventRegistration,\n      cancelError\n    );\n    if (syncPointIsEmpty(maybeSyncPoint)) {\n      syncTree.syncPointTree_ = syncTree.syncPointTree_.remove(path);\n    }\n\n    const removed = removedAndEvents.removed;\n    cancelEvents = removedAndEvents.events;\n\n    if (!skipListenerDedup) {\n      /**\n       * We may have just removed one of many listeners and can short-circuit this whole process\n       * We may also not have removed a default listener, in which case all of the descendant listeners should already be\n       * properly set up.\n       */\n\n      // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n      // queryId === 'default'\n      const removingDefault =\n        -1 !==\n        removed.findIndex(query => {\n          return query._queryParams.loadsAllData();\n        });\n      const covered = syncTree.syncPointTree_.findOnPath(\n        path,\n        (relativePath, parentSyncPoint) =>\n          syncPointHasCompleteView(parentSyncPoint)\n      );\n\n      if (removingDefault && !covered) {\n        const subtree = syncTree.syncPointTree_.subtree(path);\n        // There are potentially child listeners. Determine what if any listens we need to send before executing the\n        // removal\n        if (!subtree.isEmpty()) {\n          // We need to fold over our subtree and collect the listeners to send\n          const newViews = syncTreeCollectDistinctViewsForSubTree_(subtree);\n\n          // Ok, we've collected all the listens we need. Set them up.\n          for (let i = 0; i < newViews.length; ++i) {\n            const view = newViews[i],\n              newQuery = view.query;\n            const listener = syncTreeCreateListenerForView_(syncTree, view);\n            syncTree.listenProvider_.startListening(\n              syncTreeQueryForListening_(newQuery),\n              syncTreeTagForQuery(syncTree, newQuery),\n              listener.hashFn,\n              listener.onComplete\n            );\n          }\n        }\n        // Otherwise there's nothing below us, so nothing we need to start listening on\n      }\n      // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\n      // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\n      // Also, note that if we have a cancelError, it's already been removed at the provider level.\n      if (!covered && removed.length > 0 && !cancelError) {\n        // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\n        // default. Otherwise, we need to iterate through and cancel each individual query\n        if (removingDefault) {\n          // We don't tag default listeners\n          const defaultTag: number | null = null;\n          syncTree.listenProvider_.stopListening(\n            syncTreeQueryForListening_(query),\n            defaultTag\n          );\n        } else {\n          removed.forEach((queryToRemove: QueryContext) => {\n            const tagToRemove = syncTree.queryToTagMap.get(\n              syncTreeMakeQueryKey_(queryToRemove)\n            );\n            syncTree.listenProvider_.stopListening(\n              syncTreeQueryForListening_(queryToRemove),\n              tagToRemove\n            );\n          });\n        }\n      }\n    }\n    // Now, clear all of the tags we're tracking for the removed listens\n    syncTreeRemoveTags_(syncTree, removed);\n  } else {\n    // No-op, this listener must've been already removed\n  }\n  return cancelEvents;\n}\n\n/**\n * Apply new server data for the specified tagged query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedQueryOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  snap: Node,\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey != null) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const op = new Overwrite(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath,\n      snap\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // Query must have been removed already\n    return [];\n  }\n}\n\n/**\n * Apply server data to be merged in for the specified tagged query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedQueryMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const changeTree = ImmutableTree.fromObject(changedChildren);\n    const op = new Merge(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath,\n      changeTree\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // We've already removed the query. No big deal, ignore the update\n    return [];\n  }\n}\n\n/**\n * Add an event callback for the specified query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeAddEventRegistration(\n  syncTree: SyncTree,\n  query: QueryContext,\n  eventRegistration: EventRegistration,\n  skipSetupListener = false\n): Event[] {\n  const path = query._path;\n\n  let serverCache: Node | null = null;\n  let foundAncestorDefaultView = false;\n  // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n  // Consider optimizing this once there's a better understanding of what actual behavior will be.\n  syncTree.syncPointTree_.foreachOnPath(path, (pathToSyncPoint, sp) => {\n    const relativePath = newRelativePath(pathToSyncPoint, path);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(sp, relativePath);\n    foundAncestorDefaultView =\n      foundAncestorDefaultView || syncPointHasCompleteView(sp);\n  });\n  let syncPoint = syncTree.syncPointTree_.get(path);\n  if (!syncPoint) {\n    syncPoint = new SyncPoint();\n    syncTree.syncPointTree_ = syncTree.syncPointTree_.set(path, syncPoint);\n  } else {\n    foundAncestorDefaultView =\n      foundAncestorDefaultView || syncPointHasCompleteView(syncPoint);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n\n  let serverCacheComplete;\n  if (serverCache != null) {\n    serverCacheComplete = true;\n  } else {\n    serverCacheComplete = false;\n    serverCache = ChildrenNode.EMPTY_NODE;\n    const subtree = syncTree.syncPointTree_.subtree(path);\n    subtree.foreachChild((childName, childSyncPoint) => {\n      const completeCache = syncPointGetCompleteServerCache(\n        childSyncPoint,\n        newEmptyPath()\n      );\n      if (completeCache) {\n        serverCache = serverCache.updateImmediateChild(\n          childName,\n          completeCache\n        );\n      }\n    });\n  }\n\n  const viewAlreadyExists = syncPointViewExistsForQuery(syncPoint, query);\n  if (!viewAlreadyExists && !query._queryParams.loadsAllData()) {\n    // We need to track a tag for this query\n    const queryKey = syncTreeMakeQueryKey_(query);\n    assert(\n      !syncTree.queryToTagMap.has(queryKey),\n      'View does not exist, but we have a tag'\n    );\n    const tag = syncTreeGetNextQueryTag_();\n    syncTree.queryToTagMap.set(queryKey, tag);\n    syncTree.tagToQueryMap.set(tag, queryKey);\n  }\n  const writesCache = writeTreeChildWrites(syncTree.pendingWriteTree_, path);\n  let events = syncPointAddEventRegistration(\n    syncPoint,\n    query,\n    eventRegistration,\n    writesCache,\n    serverCache,\n    serverCacheComplete\n  );\n  if (!viewAlreadyExists && !foundAncestorDefaultView && !skipSetupListener) {\n    const view = syncPointViewForQuery(syncPoint, query);\n    events = events.concat(syncTreeSetupListener_(syncTree, query, view));\n  }\n  return events;\n}\n\n/**\n * Returns a complete cache, if we have one, of the data at a particular path. If the location does not have a\n * listener above it, we will get a false \"null\". This shouldn't be a problem because transactions will always\n * have a listener above, and atomic operations would correctly show a jitter of <increment value> ->\n *     <incremented total> as the write is applied locally and then acknowledged at the server.\n *\n * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\n *\n * @param path - The path to the data we want\n * @param writeIdsToExclude - A specific set to be excluded\n */\nexport function syncTreeCalcCompleteEventCache(\n  syncTree: SyncTree,\n  path: Path,\n  writeIdsToExclude?: number[]\n): Node {\n  const includeHiddenSets = true;\n  const writeTree = syncTree.pendingWriteTree_;\n  const serverCache = syncTree.syncPointTree_.findOnPath(\n    path,\n    (pathSoFar, syncPoint) => {\n      const relativePath = newRelativePath(pathSoFar, path);\n      const serverCache = syncPointGetCompleteServerCache(\n        syncPoint,\n        relativePath\n      );\n      if (serverCache) {\n        return serverCache;\n      }\n    }\n  );\n  return writeTreeCalcCompleteEventCache(\n    writeTree,\n    path,\n    serverCache,\n    writeIdsToExclude,\n    includeHiddenSets\n  );\n}\n\nexport function syncTreeGetServerValue(\n  syncTree: SyncTree,\n  query: QueryContext\n): Node | null {\n  const path = query._path;\n  let serverCache: Node | null = null;\n  // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n  // Consider optimizing this once there's a better understanding of what actual behavior will be.\n  syncTree.syncPointTree_.foreachOnPath(path, (pathToSyncPoint, sp) => {\n    const relativePath = newRelativePath(pathToSyncPoint, path);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(sp, relativePath);\n  });\n  let syncPoint = syncTree.syncPointTree_.get(path);\n  if (!syncPoint) {\n    syncPoint = new SyncPoint();\n    syncTree.syncPointTree_ = syncTree.syncPointTree_.set(path, syncPoint);\n  } else {\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n  const serverCacheComplete = serverCache != null;\n  const serverCacheNode: CacheNode | null = serverCacheComplete\n    ? new CacheNode(serverCache, true, false)\n    : null;\n  const writesCache: WriteTreeRef | null = writeTreeChildWrites(\n    syncTree.pendingWriteTree_,\n    query._path\n  );\n  const view: View = syncPointGetView(\n    syncPoint,\n    query,\n    writesCache,\n    serverCacheComplete ? serverCacheNode.getNode() : ChildrenNode.EMPTY_NODE,\n    serverCacheComplete\n  );\n  return viewGetCompleteNode(view);\n}\n\n/**\n * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\n *\n * NOTES:\n * - Descendant SyncPoints will be visited first (since we raise events depth-first).\n *\n * - We call applyOperation() on each SyncPoint passing three things:\n *   1. A version of the Operation that has been made relative to the SyncPoint location.\n *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\n *   3. A snapshot Node with cached server data, if we have it.\n *\n * - We concatenate all of the events returned by each SyncPoint and return the result.\n */\nfunction syncTreeApplyOperationToSyncPoints_(\n  syncTree: SyncTree,\n  operation: Operation\n): Event[] {\n  return syncTreeApplyOperationHelper_(\n    operation,\n    syncTree.syncPointTree_,\n    /*serverCache=*/ null,\n    writeTreeChildWrites(syncTree.pendingWriteTree_, newEmptyPath())\n  );\n}\n\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationHelper_(\n  operation: Operation,\n  syncPointTree: ImmutableTree<SyncPoint>,\n  serverCache: Node | null,\n  writesCache: WriteTreeRef\n): Event[] {\n  if (pathIsEmpty(operation.path)) {\n    return syncTreeApplyOperationDescendantsHelper_(\n      operation,\n      syncPointTree,\n      serverCache,\n      writesCache\n    );\n  } else {\n    const syncPoint = syncPointTree.get(newEmptyPath());\n\n    // If we don't have cached server data, see if we can get it from this SyncPoint.\n    if (serverCache == null && syncPoint != null) {\n      serverCache = syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n    }\n\n    let events: Event[] = [];\n    const childName = pathGetFront(operation.path);\n    const childOperation = operation.operationForChild(childName);\n    const childTree = syncPointTree.children.get(childName);\n    if (childTree && childOperation) {\n      const childServerCache = serverCache\n        ? serverCache.getImmediateChild(childName)\n        : null;\n      const childWritesCache = writeTreeRefChild(writesCache, childName);\n      events = events.concat(\n        syncTreeApplyOperationHelper_(\n          childOperation,\n          childTree,\n          childServerCache,\n          childWritesCache\n        )\n      );\n    }\n\n    if (syncPoint) {\n      events = events.concat(\n        syncPointApplyOperation(syncPoint, operation, writesCache, serverCache)\n      );\n    }\n\n    return events;\n  }\n}\n\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationDescendantsHelper_(\n  operation: Operation,\n  syncPointTree: ImmutableTree<SyncPoint>,\n  serverCache: Node | null,\n  writesCache: WriteTreeRef\n): Event[] {\n  const syncPoint = syncPointTree.get(newEmptyPath());\n\n  // If we don't have cached server data, see if we can get it from this SyncPoint.\n  if (serverCache == null && syncPoint != null) {\n    serverCache = syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n\n  let events: Event[] = [];\n  syncPointTree.children.inorderTraversal((childName, childTree) => {\n    const childServerCache = serverCache\n      ? serverCache.getImmediateChild(childName)\n      : null;\n    const childWritesCache = writeTreeRefChild(writesCache, childName);\n    const childOperation = operation.operationForChild(childName);\n    if (childOperation) {\n      events = events.concat(\n        syncTreeApplyOperationDescendantsHelper_(\n          childOperation,\n          childTree,\n          childServerCache,\n          childWritesCache\n        )\n      );\n    }\n  });\n\n  if (syncPoint) {\n    events = events.concat(\n      syncPointApplyOperation(syncPoint, operation, writesCache, serverCache)\n    );\n  }\n\n  return events;\n}\n\nfunction syncTreeCreateListenerForView_(\n  syncTree: SyncTree,\n  view: View\n): { hashFn(): string; onComplete(a: string, b?: unknown): Event[] } {\n  const query = view.query;\n  const tag = syncTreeTagForQuery(syncTree, query);\n\n  return {\n    hashFn: () => {\n      const cache = viewGetServerCache(view) || ChildrenNode.EMPTY_NODE;\n      return cache.hash();\n    },\n    onComplete: (status: string): Event[] => {\n      if (status === 'ok') {\n        if (tag) {\n          return syncTreeApplyTaggedListenComplete(syncTree, query._path, tag);\n        } else {\n          return syncTreeApplyListenComplete(syncTree, query._path);\n        }\n      } else {\n        // If a listen failed, kill all of the listeners here, not just the one that triggered the error.\n        // Note that this may need to be scoped to just this listener if we change permissions on filtered children\n        const error = errorForServerCode(status, query);\n        return syncTreeRemoveEventRegistration(\n          syncTree,\n          query,\n          /*eventRegistration*/ null,\n          error\n        );\n      }\n    }\n  };\n}\n\n/**\n * Return the tag associated with the given query.\n */\nexport function syncTreeTagForQuery(\n  syncTree: SyncTree,\n  query: QueryContext\n): number | null {\n  const queryKey = syncTreeMakeQueryKey_(query);\n  return syncTree.queryToTagMap.get(queryKey);\n}\n\n/**\n * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n */\nfunction syncTreeMakeQueryKey_(query: QueryContext): string {\n  return query._path.toString() + '$' + query._queryIdentifier;\n}\n\n/**\n * Return the query associated with the given tag, if we have one\n */\nfunction syncTreeQueryKeyForTag_(\n  syncTree: SyncTree,\n  tag: number\n): string | null {\n  return syncTree.tagToQueryMap.get(tag);\n}\n\n/**\n * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n */\nfunction syncTreeParseQueryKey_(queryKey: string): {\n  queryId: string;\n  path: Path;\n} {\n  const splitIndex = queryKey.indexOf('$');\n  assert(\n    splitIndex !== -1 && splitIndex < queryKey.length - 1,\n    'Bad queryKey.'\n  );\n  return {\n    queryId: queryKey.substr(splitIndex + 1),\n    path: new Path(queryKey.substr(0, splitIndex))\n  };\n}\n\n/**\n * A helper method to apply tagged operations\n */\nfunction syncTreeApplyTaggedOperation_(\n  syncTree: SyncTree,\n  queryPath: Path,\n  operation: Operation\n): Event[] {\n  const syncPoint = syncTree.syncPointTree_.get(queryPath);\n  assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n  const writesCache = writeTreeChildWrites(\n    syncTree.pendingWriteTree_,\n    queryPath\n  );\n  return syncPointApplyOperation(syncPoint, operation, writesCache, null);\n}\n\n/**\n * This collapses multiple unfiltered views into a single view, since we only need a single\n * listener for them.\n */\nfunction syncTreeCollectDistinctViewsForSubTree_(\n  subtree: ImmutableTree<SyncPoint>\n): View[] {\n  return subtree.fold<View[]>((relativePath, maybeChildSyncPoint, childMap) => {\n    if (maybeChildSyncPoint && syncPointHasCompleteView(maybeChildSyncPoint)) {\n      const completeView = syncPointGetCompleteView(maybeChildSyncPoint);\n      return [completeView];\n    } else {\n      // No complete view here, flatten any deeper listens into an array\n      let views: View[] = [];\n      if (maybeChildSyncPoint) {\n        views = syncPointGetQueryViews(maybeChildSyncPoint);\n      }\n      each(childMap, (_key: string, childViews: View[]) => {\n        views = views.concat(childViews);\n      });\n      return views;\n    }\n  });\n}\n\n/**\n * Normalizes a query to a query we send the server for listening\n *\n * @returns The normalized query\n */\nfunction syncTreeQueryForListening_(query: QueryContext): QueryContext {\n  if (query._queryParams.loadsAllData() && !query._queryParams.isDefault()) {\n    // We treat queries that load all data as default queries\n    // Cast is necessary because ref() technically returns Firebase which is actually fb.api.Firebase which inherits\n    // from Query\n    return new (syncTreeGetReferenceConstructor())(query._repo, query._path);\n  } else {\n    return query;\n  }\n}\n\nfunction syncTreeRemoveTags_(syncTree: SyncTree, queries: QueryContext[]) {\n  for (let j = 0; j < queries.length; ++j) {\n    const removedQuery = queries[j];\n    if (!removedQuery._queryParams.loadsAllData()) {\n      // We should have a tag for this\n      const removedQueryKey = syncTreeMakeQueryKey_(removedQuery);\n      const removedQueryTag = syncTree.queryToTagMap.get(removedQueryKey);\n      syncTree.queryToTagMap.delete(removedQueryKey);\n      syncTree.tagToQueryMap.delete(removedQueryTag);\n    }\n  }\n}\n\n/**\n * Static accessor for query tags.\n */\nfunction syncTreeGetNextQueryTag_(): number {\n  return syncTreeNextQueryTag_++;\n}\n\n/**\n * For a given new listen, manage the de-duplication of outstanding subscriptions.\n *\n * @returns This method can return events to support synchronous data sources\n */\nfunction syncTreeSetupListener_(\n  syncTree: SyncTree,\n  query: QueryContext,\n  view: View\n): Event[] {\n  const path = query._path;\n  const tag = syncTreeTagForQuery(syncTree, query);\n  const listener = syncTreeCreateListenerForView_(syncTree, view);\n\n  const events = syncTree.listenProvider_.startListening(\n    syncTreeQueryForListening_(query),\n    tag,\n    listener.hashFn,\n    listener.onComplete\n  );\n\n  const subtree = syncTree.syncPointTree_.subtree(path);\n  // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n  // may need to shadow other listens as well.\n  if (tag) {\n    assert(\n      !syncPointHasCompleteView(subtree.value),\n      \"If we're adding a query, it shouldn't be shadowed\"\n    );\n  } else {\n    // Shadow everything at or below this location, this is a default listener.\n    const queriesToStop = subtree.fold<QueryContext[]>(\n      (relativePath, maybeChildSyncPoint, childMap) => {\n        if (\n          !pathIsEmpty(relativePath) &&\n          maybeChildSyncPoint &&\n          syncPointHasCompleteView(maybeChildSyncPoint)\n        ) {\n          return [syncPointGetCompleteView(maybeChildSyncPoint).query];\n        } else {\n          // No default listener here, flatten any deeper queries into an array\n          let queries: QueryContext[] = [];\n          if (maybeChildSyncPoint) {\n            queries = queries.concat(\n              syncPointGetQueryViews(maybeChildSyncPoint).map(\n                view => view.query\n              )\n            );\n          }\n          each(childMap, (_key: string, childQueries: QueryContext[]) => {\n            queries = queries.concat(childQueries);\n          });\n          return queries;\n        }\n      }\n    );\n    for (let i = 0; i < queriesToStop.length; ++i) {\n      const queryToStop = queriesToStop[i];\n      syncTree.listenProvider_.stopListening(\n        syncTreeQueryForListening_(queryToStop),\n        syncTreeTagForQuery(syncTree, queryToStop)\n      );\n    }\n  }\n  return events;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { LeafNode } from '../snap/LeafNode';\nimport { Node } from '../snap/Node';\nimport { nodeFromJSON } from '../snap/nodeFromJSON';\nimport { SyncTree, syncTreeCalcCompleteEventCache } from '../SyncTree';\n\nimport { Indexable } from './misc';\nimport { Path, pathChild } from './Path';\n\n/* It's critical for performance that we do not calculate actual values from a SyncTree\n * unless and until the value is needed. Because we expose both a SyncTree and Node\n * version of deferred value resolution, we ned a wrapper class that will let us share\n * code.\n *\n * @see https://github.com/firebase/firebase-js-sdk/issues/2487\n */\ninterface ValueProvider {\n  getImmediateChild(childName: string): ValueProvider;\n  node(): Node;\n}\n\nclass ExistingValueProvider implements ValueProvider {\n  constructor(readonly node_: Node) {}\n\n  getImmediateChild(childName: string): ValueProvider {\n    const child = this.node_.getImmediateChild(childName);\n    return new ExistingValueProvider(child);\n  }\n\n  node(): Node {\n    return this.node_;\n  }\n}\n\nclass DeferredValueProvider implements ValueProvider {\n  private syncTree_: SyncTree;\n  private path_: Path;\n\n  constructor(syncTree: SyncTree, path: Path) {\n    this.syncTree_ = syncTree;\n    this.path_ = path;\n  }\n\n  getImmediateChild(childName: string): ValueProvider {\n    const childPath = pathChild(this.path_, childName);\n    return new DeferredValueProvider(this.syncTree_, childPath);\n  }\n\n  node(): Node {\n    return syncTreeCalcCompleteEventCache(this.syncTree_, this.path_);\n  }\n}\n\n/**\n * Generate placeholders for deferred values.\n */\nexport const generateWithValues = function (\n  values: {\n    [k: string]: unknown;\n  } | null\n): { [k: string]: unknown } {\n  values = values || {};\n  values['timestamp'] = values['timestamp'] || new Date().getTime();\n  return values;\n};\n\n/**\n * Value to use when firing local events. When writing server values, fire\n * local events with an approximate value, otherwise return value as-is.\n */\nexport const resolveDeferredLeafValue = function (\n  value: { [k: string]: unknown } | string | number | boolean,\n  existingVal: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  if (!value || typeof value !== 'object') {\n    return value as string | number | boolean;\n  }\n  assert('.sv' in value, 'Unexpected leaf node or priority contents');\n\n  if (typeof value['.sv'] === 'string') {\n    return resolveScalarDeferredValue(value['.sv'], existingVal, serverValues);\n  } else if (typeof value['.sv'] === 'object') {\n    return resolveComplexDeferredValue(value['.sv'], existingVal, serverValues);\n  } else {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(value, null, 2));\n  }\n};\n\nconst resolveScalarDeferredValue = function (\n  op: string,\n  existing: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  switch (op) {\n    case 'timestamp':\n      return serverValues['timestamp'] as string | number | boolean;\n    default:\n      assert(false, 'Unexpected server value: ' + op);\n  }\n};\n\nconst resolveComplexDeferredValue = function (\n  op: object,\n  existing: ValueProvider,\n  unused: { [k: string]: unknown }\n): string | number | boolean {\n  if (!op.hasOwnProperty('increment')) {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(op, null, 2));\n  }\n  const delta = op['increment'];\n  if (typeof delta !== 'number') {\n    assert(false, 'Unexpected increment value: ' + delta);\n  }\n\n  const existingNode = existing.node();\n  assert(\n    existingNode !== null && typeof existingNode !== 'undefined',\n    'Expected ChildrenNode.EMPTY_NODE for nulls'\n  );\n\n  // Incrementing a non-number sets the value to the incremented amount\n  if (!existingNode.isLeafNode()) {\n    return delta;\n  }\n\n  const leaf = existingNode as LeafNode;\n  const existingVal = leaf.getValue();\n  if (typeof existingVal !== 'number') {\n    return delta;\n  }\n\n  // No need to do over/underflow arithmetic here because JS only handles floats under the covers\n  return existingVal + delta;\n};\n\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param path - path to which write is relative\n * @param node - new data written at path\n * @param syncTree - current data\n */\nexport const resolveDeferredValueTree = function (\n  path: Path,\n  node: Node,\n  syncTree: SyncTree,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new DeferredValueProvider(syncTree, path),\n    serverValues\n  );\n};\n\n/**\n * Recursively replace all deferred values and priorities in the node with the\n * specified generated replacement values.  If there are no server values in the node,\n * it'll be returned as-is.\n */\nexport const resolveDeferredValueSnapshot = function (\n  node: Node,\n  existing: Node,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new ExistingValueProvider(existing),\n    serverValues\n  );\n};\n\nfunction resolveDeferredValue(\n  node: Node,\n  existingVal: ValueProvider,\n  serverValues: Indexable\n): Node {\n  const rawPri = node.getPriority().val() as\n    | Indexable\n    | boolean\n    | null\n    | number\n    | string;\n  const priority = resolveDeferredLeafValue(\n    rawPri,\n    existingVal.getImmediateChild('.priority'),\n    serverValues\n  );\n  let newNode: Node;\n\n  if (node.isLeafNode()) {\n    const leafNode = node as LeafNode;\n    const value = resolveDeferredLeafValue(\n      leafNode.getValue(),\n      existingVal,\n      serverValues\n    );\n    if (\n      value !== leafNode.getValue() ||\n      priority !== leafNode.getPriority().val()\n    ) {\n      return new LeafNode(value, nodeFromJSON(priority));\n    } else {\n      return node;\n    }\n  } else {\n    const childrenNode = node as ChildrenNode;\n    newNode = childrenNode;\n    if (priority !== childrenNode.getPriority().val()) {\n      newNode = newNode.updatePriority(new LeafNode(priority));\n    }\n    childrenNode.forEachChild(PRIORITY_INDEX, (childName, childNode) => {\n      const newChildNode = resolveDeferredValue(\n        childNode,\n        existingVal.getImmediateChild(childName),\n        serverValues\n      );\n      if (newChildNode !== childNode) {\n        newNode = newNode.updateImmediateChild(childName, newChildNode);\n      }\n    });\n    return newNode;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains, safeGet } from '@firebase/util';\n\nimport { Path, pathGetFront, pathPopFront } from './Path';\nimport { each } from './util';\n\n/**\n * Node in a Tree.\n */\nexport interface TreeNode<T> {\n  // TODO: Consider making accessors that create children and value lazily or\n  // separate Internal / Leaf 'types'.\n  children: Record<string, TreeNode<T>>;\n  childCount: number;\n  value?: T;\n}\n\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nexport class Tree<T> {\n  /**\n   * @param name - Optional name of the node.\n   * @param parent - Optional parent node.\n   * @param node - Optional node to wrap.\n   */\n  constructor(\n    readonly name: string = '',\n    readonly parent: Tree<T> | null = null,\n    public node: TreeNode<T> = { children: {}, childCount: 0 }\n  ) {}\n}\n\n/**\n * Returns a sub-Tree for the given path.\n *\n * @param pathObj - Path to look up.\n * @returns Tree for path.\n */\nexport function treeSubTree<T>(tree: Tree<T>, pathObj: string | Path): Tree<T> {\n  // TODO: Require pathObj to be Path?\n  let path = pathObj instanceof Path ? pathObj : new Path(pathObj);\n  let child = tree,\n    next = pathGetFront(path);\n  while (next !== null) {\n    const childNode = safeGet(child.node.children, next) || {\n      children: {},\n      childCount: 0\n    };\n    child = new Tree<T>(next, child, childNode);\n    path = pathPopFront(path);\n    next = pathGetFront(path);\n  }\n\n  return child;\n}\n\n/**\n * Returns the data associated with this tree node.\n *\n * @returns The data or null if no data exists.\n */\nexport function treeGetValue<T>(tree: Tree<T>): T | undefined {\n  return tree.node.value;\n}\n\n/**\n * Sets data to this tree node.\n *\n * @param value - Value to set.\n */\nexport function treeSetValue<T>(tree: Tree<T>, value: T | undefined): void {\n  tree.node.value = value;\n  treeUpdateParents(tree);\n}\n\n/**\n * @returns Whether the tree has any children.\n */\nexport function treeHasChildren<T>(tree: Tree<T>): boolean {\n  return tree.node.childCount > 0;\n}\n\n/**\n * @returns Whether the tree is empty (no value or children).\n */\nexport function treeIsEmpty<T>(tree: Tree<T>): boolean {\n  return treeGetValue(tree) === undefined && !treeHasChildren(tree);\n}\n\n/**\n * Calls action for each child of this tree node.\n *\n * @param action - Action to be called for each child.\n */\nexport function treeForEachChild<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void\n): void {\n  each(tree.node.children, (child: string, childTree: TreeNode<T>) => {\n    action(new Tree<T>(child, tree, childTree));\n  });\n}\n\n/**\n * Does a depth-first traversal of this node's descendants, calling action for each one.\n *\n * @param action - Action to be called for each child.\n * @param includeSelf - Whether to call action on this node as well. Defaults to\n *   false.\n * @param childrenFirst - Whether to call action on children before calling it on\n *   parent.\n */\nexport function treeForEachDescendant<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void,\n  includeSelf?: boolean,\n  childrenFirst?: boolean\n): void {\n  if (includeSelf && !childrenFirst) {\n    action(tree);\n  }\n\n  treeForEachChild(tree, child => {\n    treeForEachDescendant(child, action, true, childrenFirst);\n  });\n\n  if (includeSelf && childrenFirst) {\n    action(tree);\n  }\n}\n\n/**\n * Calls action on each ancestor node.\n *\n * @param action - Action to be called on each parent; return\n *   true to abort.\n * @param includeSelf - Whether to call action on this node as well.\n * @returns true if the action callback returned true.\n */\nexport function treeForEachAncestor<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => unknown,\n  includeSelf?: boolean\n): boolean {\n  let node = includeSelf ? tree : tree.parent;\n  while (node !== null) {\n    if (action(node)) {\n      return true;\n    }\n    node = node.parent;\n  }\n  return false;\n}\n\n/**\n * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n * is found, action is called on it and traversal does not continue inside the node.\n * Action is *not* called on this node.\n *\n * @param action - Action to be called for each child.\n */\nexport function treeForEachImmediateDescendantWithValue<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void\n): void {\n  treeForEachChild(tree, child => {\n    if (treeGetValue(child) !== undefined) {\n      action(child);\n    } else {\n      treeForEachImmediateDescendantWithValue(child, action);\n    }\n  });\n}\n\n/**\n * @returns The path of this tree node, as a Path.\n */\nexport function treeGetPath<T>(tree: Tree<T>) {\n  return new Path(\n    tree.parent === null\n      ? tree.name\n      : treeGetPath(tree.parent) + '/' + tree.name\n  );\n}\n\n/**\n * Adds or removes this child from its parent based on whether it's empty or not.\n */\nfunction treeUpdateParents<T>(tree: Tree<T>) {\n  if (tree.parent !== null) {\n    treeUpdateChild(tree.parent, tree.name, tree);\n  }\n}\n\n/**\n * Adds or removes the passed child to this tree node, depending on whether it's empty.\n *\n * @param childName - The name of the child to update.\n * @param child - The child to update.\n */\nfunction treeUpdateChild<T>(tree: Tree<T>, childName: string, child: Tree<T>) {\n  const childEmpty = treeIsEmpty(child);\n  const childExists = contains(tree.node.children, childName);\n  if (childEmpty && childExists) {\n    delete tree.node.children[childName];\n    tree.node.childCount--;\n    treeUpdateParents(tree);\n  } else if (!childEmpty && !childExists) {\n    tree.node.children[childName] = child.node;\n    tree.node.childCount++;\n    treeUpdateParents(tree);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  contains,\n  errorPrefix as errorPrefixFxn,\n  safeGet,\n  stringLength\n} from '@firebase/util';\n\nimport { RepoInfo } from '../RepoInfo';\n\nimport {\n  Path,\n  pathChild,\n  pathCompare,\n  pathContains,\n  pathGetBack,\n  pathGetFront,\n  pathSlice,\n  ValidationPath,\n  validationPathPop,\n  validationPathPush,\n  validationPathToErrorString\n} from './Path';\nimport { each, isInvalidJSONNumber } from './util';\n\n/**\n * True for invalid Firebase keys\n */\nexport const INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n */\nexport const INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n\n/**\n * Maximum number of characters to allow in leaf value\n */\nexport const MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\n\nexport const isValidKey = function (key: unknown): boolean {\n  return (\n    typeof key === 'string' && key.length !== 0 && !INVALID_KEY_REGEX_.test(key)\n  );\n};\n\nexport const isValidPathString = function (pathString: string): boolean {\n  return (\n    typeof pathString === 'string' &&\n    pathString.length !== 0 &&\n    !INVALID_PATH_REGEX_.test(pathString)\n  );\n};\n\nexport const isValidRootPathString = function (pathString: string): boolean {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  return isValidPathString(pathString);\n};\n\nexport const isValidPriority = function (priority: unknown): boolean {\n  return (\n    priority === null ||\n    typeof priority === 'string' ||\n    (typeof priority === 'number' && !isInvalidJSONNumber(priority)) ||\n    (priority &&\n      typeof priority === 'object' &&\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      contains(priority as any, '.sv'))\n  );\n};\n\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n */\nexport const validateFirebaseDataArg = function (\n  fnName: string,\n  value: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && value === undefined) {\n    return;\n  }\n\n  validateFirebaseData(errorPrefixFxn(fnName, 'value'), value, path);\n};\n\n/**\n * Validate a data object client-side before sending to server.\n */\nexport const validateFirebaseData = function (\n  errorPrefix: string,\n  data: unknown,\n  path_: Path | ValidationPath\n) {\n  const path =\n    path_ instanceof Path ? new ValidationPath(path_, errorPrefix) : path_;\n\n  if (data === undefined) {\n    throw new Error(\n      errorPrefix + 'contains undefined ' + validationPathToErrorString(path)\n    );\n  }\n  if (typeof data === 'function') {\n    throw new Error(\n      errorPrefix +\n        'contains a function ' +\n        validationPathToErrorString(path) +\n        ' with contents = ' +\n        data.toString()\n    );\n  }\n  if (isInvalidJSONNumber(data)) {\n    throw new Error(\n      errorPrefix +\n        'contains ' +\n        data.toString() +\n        ' ' +\n        validationPathToErrorString(path)\n    );\n  }\n\n  // Check max leaf size, but try to avoid the utf8 conversion if we can.\n  if (\n    typeof data === 'string' &&\n    data.length > MAX_LEAF_SIZE_ / 3 &&\n    stringLength(data) > MAX_LEAF_SIZE_\n  ) {\n    throw new Error(\n      errorPrefix +\n        'contains a string greater than ' +\n        MAX_LEAF_SIZE_ +\n        ' utf8 bytes ' +\n        validationPathToErrorString(path) +\n        \" ('\" +\n        data.substring(0, 50) +\n        \"...')\"\n    );\n  }\n\n  // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\n  // to save extra walking of large objects.\n  if (data && typeof data === 'object') {\n    let hasDotValue = false;\n    let hasActualChild = false;\n    each(data, (key: string, value: unknown) => {\n      if (key === '.value') {\n        hasDotValue = true;\n      } else if (key !== '.priority' && key !== '.sv') {\n        hasActualChild = true;\n        if (!isValidKey(key)) {\n          throw new Error(\n            errorPrefix +\n              ' contains an invalid key (' +\n              key +\n              ') ' +\n              validationPathToErrorString(path) +\n              '.  Keys must be non-empty strings ' +\n              'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n          );\n        }\n      }\n\n      validationPathPush(path, key);\n      validateFirebaseData(errorPrefix, value, path);\n      validationPathPop(path);\n    });\n\n    if (hasDotValue && hasActualChild) {\n      throw new Error(\n        errorPrefix +\n          ' contains \".value\" child ' +\n          validationPathToErrorString(path) +\n          ' in addition to actual children.'\n      );\n    }\n  }\n};\n\n/**\n * Pre-validate paths passed in the firebase function.\n */\nexport const validateFirebaseMergePaths = function (\n  errorPrefix: string,\n  mergePaths: Path[]\n) {\n  let i, curPath: Path;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    const keys = pathSlice(curPath);\n    for (let j = 0; j < keys.length; j++) {\n      if (keys[j] === '.priority' && j === keys.length - 1) {\n        // .priority is OK\n      } else if (!isValidKey(keys[j])) {\n        throw new Error(\n          errorPrefix +\n            'contains an invalid key (' +\n            keys[j] +\n            ') in path ' +\n            curPath.toString() +\n            '. Keys must be non-empty strings ' +\n            'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n        );\n      }\n    }\n  }\n\n  // Check that update keys are not descendants of each other.\n  // We rely on the property that sorting guarantees that ancestors come\n  // right before descendants.\n  mergePaths.sort(pathCompare);\n  let prevPath: Path | null = null;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    if (prevPath !== null && pathContains(prevPath, curPath)) {\n      throw new Error(\n        errorPrefix +\n          'contains a path ' +\n          prevPath.toString() +\n          ' that is ancestor of another path ' +\n          curPath.toString()\n      );\n    }\n    prevPath = curPath;\n  }\n};\n\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n */\nexport const validateFirebaseMergeDataArg = function (\n  fnName: string,\n  data: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && data === undefined) {\n    return;\n  }\n\n  const errorPrefix = errorPrefixFxn(fnName, 'values');\n\n  if (!(data && typeof data === 'object') || Array.isArray(data)) {\n    throw new Error(\n      errorPrefix + ' must be an object containing the children to replace.'\n    );\n  }\n\n  const mergePaths: Path[] = [];\n  each(data, (key: string, value: unknown) => {\n    const curPath = new Path(key);\n    validateFirebaseData(errorPrefix, value, pathChild(path, curPath));\n    if (pathGetBack(curPath) === '.priority') {\n      if (!isValidPriority(value)) {\n        throw new Error(\n          errorPrefix +\n            \"contains an invalid value for '\" +\n            curPath.toString() +\n            \"', which must be a valid \" +\n            'Firebase priority (a string, finite number, server value, or null).'\n        );\n      }\n    }\n    mergePaths.push(curPath);\n  });\n  validateFirebaseMergePaths(errorPrefix, mergePaths);\n};\n\nexport const validatePriority = function (\n  fnName: string,\n  priority: unknown,\n  optional: boolean\n) {\n  if (optional && priority === undefined) {\n    return;\n  }\n  if (isInvalidJSONNumber(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'priority') +\n        'is ' +\n        priority.toString() +\n        ', but must be a valid Firebase priority (a string, finite number, ' +\n        'server value, or null).'\n    );\n  }\n  // Special case to allow importing data with a .sv.\n  if (!isValidPriority(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'priority') +\n        'must be a valid Firebase priority ' +\n        '(a string, finite number, server value, or null).'\n    );\n  }\n};\n\nexport const validateKey = function (\n  fnName: string,\n  argumentName: string,\n  key: string,\n  optional: boolean\n) {\n  if (optional && key === undefined) {\n    return;\n  }\n  if (!isValidKey(key)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) +\n        'was an invalid key = \"' +\n        key +\n        '\".  Firebase keys must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").'\n    );\n  }\n};\n\n/**\n * @internal\n */\nexport const validatePathString = function (\n  fnName: string,\n  argumentName: string,\n  pathString: string,\n  optional: boolean\n) {\n  if (optional && pathString === undefined) {\n    return;\n  }\n\n  if (!isValidPathString(pathString)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) +\n        'was an invalid path = \"' +\n        pathString +\n        '\". Paths must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"'\n    );\n  }\n};\n\nexport const validateRootPathString = function (\n  fnName: string,\n  argumentName: string,\n  pathString: string,\n  optional: boolean\n) {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  validatePathString(fnName, argumentName, pathString, optional);\n};\n\n/**\n * @internal\n */\nexport const validateWritablePath = function (fnName: string, path: Path) {\n  if (pathGetFront(path) === '.info') {\n    throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n  }\n};\n\nexport const validateUrl = function (\n  fnName: string,\n  parsedUrl: { repoInfo: RepoInfo; path: Path }\n) {\n  // TODO = Validate server better.\n  const pathString = parsedUrl.path.toString();\n  if (\n    !(typeof parsedUrl.repoInfo.host === 'string') ||\n    parsedUrl.repoInfo.host.length === 0 ||\n    (!isValidKey(parsedUrl.repoInfo.namespace) &&\n      parsedUrl.repoInfo.host.split(':')[0] !== 'localhost') ||\n    (pathString.length !== 0 && !isValidRootPathString(pathString))\n  ) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'url') +\n        'must be a valid firebase URL and ' +\n        'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".'\n    );\n  }\n};\n\nexport const validateString = function (\n  fnName: string,\n  argumentName: string,\n  string: unknown,\n  optional: boolean\n) {\n  if (optional && string === undefined) {\n    return;\n  }\n  if (!(typeof string === 'string')) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) + 'must be a valid string.'\n    );\n  }\n};\n\nexport const validateObject = function (\n  fnName: string,\n  argumentName: string,\n  obj: unknown,\n  optional: boolean\n) {\n  if (optional && obj === undefined) {\n    return;\n  }\n  if (!(obj && typeof obj === 'object') || obj === null) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) + 'must be a valid object.'\n    );\n  }\n};\n\nexport const validateObjectContainsKey = function (\n  fnName: string,\n  argumentName: string,\n  obj: unknown,\n  key: string,\n  optional: boolean,\n  optType?: string\n) {\n  const objectContainsKey =\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    obj && typeof obj === 'object' && contains(obj as any, key);\n\n  if (!objectContainsKey) {\n    if (optional) {\n      return;\n    } else {\n      throw new Error(\n        errorPrefixFxn(fnName, argumentName) +\n          'must contain the key \"' +\n          key +\n          '\"'\n      );\n    }\n  }\n\n  if (optType) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    const val = safeGet(obj as any, key);\n    if (\n      (optType === 'number' && !(typeof val === 'number')) ||\n      (optType === 'string' && !(typeof val === 'string')) ||\n      (optType === 'boolean' && !(typeof val === 'boolean')) ||\n      (optType === 'function' && !(typeof val === 'function')) ||\n      (optType === 'object' && !(typeof val === 'object') && val)\n    ) {\n      if (optional) {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentName) +\n            'contains invalid value for key \"' +\n            key +\n            '\" (must be of type \"' +\n            optType +\n            '\")'\n        );\n      } else {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentName) +\n            'must contain the key \"' +\n            key +\n            '\" with type \"' +\n            optType +\n            '\"'\n        );\n      }\n    }\n  }\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path, pathContains, pathEquals } from '../util/Path';\nimport { exceptionGuard, log, logger } from '../util/util';\n\nimport { Event } from './Event';\n\n/**\n * The event queue serves a few purposes:\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\n *    events being queued.\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\n *    left off, ensuring that the events are still raised synchronously and in order.\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\n *    events are raised synchronously.\n *\n * NOTE: This can all go away if/when we move to async events.\n *\n */\nexport class EventQueue {\n  eventLists_: EventList[] = [];\n\n  /**\n   * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n   */\n  recursionDepth_ = 0;\n}\n\n/**\n * @param eventDataList - The new events to queue.\n */\nexport function eventQueueQueueEvents(\n  eventQueue: EventQueue,\n  eventDataList: Event[]\n) {\n  // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n  let currList: EventList | null = null;\n  for (let i = 0; i < eventDataList.length; i++) {\n    const data = eventDataList[i];\n    const path = data.getPath();\n    if (currList !== null && !pathEquals(path, currList.path)) {\n      eventQueue.eventLists_.push(currList);\n      currList = null;\n    }\n\n    if (currList === null) {\n      currList = { events: [], path };\n    }\n\n    currList.events.push(data);\n  }\n  if (currList) {\n    eventQueue.eventLists_.push(currList);\n  }\n}\n\n/**\n * Queues the specified events and synchronously raises all events (including previously queued ones)\n * for the specified path.\n *\n * It is assumed that the new events are all for the specified path.\n *\n * @param path - The path to raise events for.\n * @param eventDataList - The new events to raise.\n */\nexport function eventQueueRaiseEventsAtPath(\n  eventQueue: EventQueue,\n  path: Path,\n  eventDataList: Event[]\n) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(eventQueue, eventPath =>\n    pathEquals(eventPath, path)\n  );\n}\n\n/**\n * Queues the specified events and synchronously raises all events (including previously queued ones) for\n * locations related to the specified change path (i.e. all ancestors and descendants).\n *\n * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n *\n * @param changedPath - The path to raise events for.\n * @param eventDataList - The events to raise\n */\nexport function eventQueueRaiseEventsForChangedPath(\n  eventQueue: EventQueue,\n  changedPath: Path,\n  eventDataList: Event[]\n) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(\n    eventQueue,\n    eventPath =>\n      pathContains(eventPath, changedPath) ||\n      pathContains(changedPath, eventPath)\n  );\n}\n\nfunction eventQueueRaiseQueuedEventsMatchingPredicate(\n  eventQueue: EventQueue,\n  predicate: (path: Path) => boolean\n) {\n  eventQueue.recursionDepth_++;\n\n  let sentAll = true;\n  for (let i = 0; i < eventQueue.eventLists_.length; i++) {\n    const eventList = eventQueue.eventLists_[i];\n    if (eventList) {\n      const eventPath = eventList.path;\n      if (predicate(eventPath)) {\n        eventListRaise(eventQueue.eventLists_[i]);\n        eventQueue.eventLists_[i] = null;\n      } else {\n        sentAll = false;\n      }\n    }\n  }\n\n  if (sentAll) {\n    eventQueue.eventLists_ = [];\n  }\n\n  eventQueue.recursionDepth_--;\n}\n\ninterface EventList {\n  events: Event[];\n  path: Path;\n}\n\n/**\n * Iterates through the list and raises each event\n */\nfunction eventListRaise(eventList: EventList) {\n  for (let i = 0; i < eventList.events.length; i++) {\n    const eventData = eventList.events[i];\n    if (eventData !== null) {\n      eventList.events[i] = null;\n      const eventFn = eventData.getEventRunner();\n      if (logger) {\n        log('event: ' + eventData.toString());\n      }\n      exceptionGuard(eventFn);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  assert,\n  contains,\n  isEmpty,\n  map,\n  safeGet,\n  stringify\n} from '@firebase/util';\n\nimport { ValueEventRegistration } from '../api/Reference_impl';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { PersistentConnection } from './PersistentConnection';\nimport { ReadonlyRestClient } from './ReadonlyRestClient';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { nodeFromJSON } from './snap/nodeFromJSON';\nimport { SnapshotHolder } from './SnapshotHolder';\nimport {\n  newSparseSnapshotTree,\n  SparseSnapshotTree,\n  sparseSnapshotTreeForEachTree,\n  sparseSnapshotTreeForget,\n  sparseSnapshotTreeRemember\n} from './SparseSnapshotTree';\nimport { StatsCollection } from './stats/StatsCollection';\nimport { StatsListener } from './stats/StatsListener';\nimport {\n  statsManagerGetCollection,\n  statsManagerGetOrCreateReporter\n} from './stats/StatsManager';\nimport { StatsReporter, statsReporterIncludeStat } from './stats/StatsReporter';\nimport {\n  SyncTree,\n  syncTreeAckUserWrite,\n  syncTreeAddEventRegistration,\n  syncTreeApplyServerMerge,\n  syncTreeApplyServerOverwrite,\n  syncTreeApplyTaggedQueryMerge,\n  syncTreeApplyTaggedQueryOverwrite,\n  syncTreeApplyUserMerge,\n  syncTreeApplyUserOverwrite,\n  syncTreeCalcCompleteEventCache,\n  syncTreeGetServerValue,\n  syncTreeRemoveEventRegistration,\n  syncTreeTagForQuery\n} from './SyncTree';\nimport { Indexable } from './util/misc';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathGetFront,\n  pathPopFront\n} from './util/Path';\nimport {\n  generateWithValues,\n  resolveDeferredValueSnapshot,\n  resolveDeferredValueTree\n} from './util/ServerValues';\nimport {\n  Tree,\n  treeForEachAncestor,\n  treeForEachChild,\n  treeForEachDescendant,\n  treeGetPath,\n  treeGetValue,\n  treeHasChildren,\n  treeSetValue,\n  treeSubTree\n} from './util/Tree';\nimport {\n  beingCrawled,\n  each,\n  exceptionGuard,\n  log,\n  LUIDGenerator,\n  warn\n} from './util/util';\nimport { isValidPriority, validateFirebaseData } from './util/validation';\nimport { Event } from './view/Event';\nimport {\n  EventQueue,\n  eventQueueQueueEvents,\n  eventQueueRaiseEventsAtPath,\n  eventQueueRaiseEventsForChangedPath\n} from './view/EventQueue';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\n\nconst INTERRUPT_REASON = 'repo_interrupt';\n\n/**\n * If a transaction does not succeed after 25 retries, we abort it. Among other\n * things this ensure that if there's ever a bug causing a mismatch between\n * client / server hashes for some data, we won't retry indefinitely.\n */\nconst MAX_TRANSACTION_RETRIES = 25;\n\nconst enum TransactionStatus {\n  // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\n  // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\n  // mismatched hash.\n  RUN,\n\n  // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\n  // or rejected yet).\n  SENT,\n\n  // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\n  // removed when we get a chance to prune completed ones.\n  COMPLETED,\n\n  // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\n  // If it comes back as unsuccessful, we'll abort it.\n  SENT_NEEDS_ABORT,\n\n  // Temporary state used to mark transactions that need to be aborted.\n  NEEDS_ABORT\n}\n\ninterface Transaction {\n  path: Path;\n  update: (a: unknown) => unknown;\n  onComplete: (\n    error: Error | null,\n    committed: boolean,\n    node: Node | null\n  ) => void;\n  status: TransactionStatus;\n  order: number;\n  applyLocally: boolean;\n  retryCount: number;\n  unwatcher: () => void;\n  abortReason: string | null;\n  currentWriteId: number;\n  currentInputSnapshot: Node | null;\n  currentOutputSnapshotRaw: Node | null;\n  currentOutputSnapshotResolved: Node | null;\n}\n\n/**\n * A connection to a single data repository.\n */\nexport class Repo {\n  /** Key for uniquely identifying this repo, used in RepoManager */\n  readonly key: string;\n\n  dataUpdateCount = 0;\n  infoSyncTree_: SyncTree;\n  serverSyncTree_: SyncTree;\n\n  stats_: StatsCollection;\n  statsListener_: StatsListener | null = null;\n  eventQueue_ = new EventQueue();\n  nextWriteId_ = 1;\n  server_: ServerActions;\n  statsReporter_: StatsReporter;\n  infoData_: SnapshotHolder;\n  interceptServerDataCallback_: ((a: string, b: unknown) => void) | null = null;\n\n  /** A list of data pieces and paths to be set when this client disconnects. */\n  onDisconnect_: SparseSnapshotTree = newSparseSnapshotTree();\n\n  /** Stores queues of outstanding transactions for Firebase locations. */\n  transactionQueueTree_ = new Tree<Transaction[]>();\n\n  // TODO: This should be @private but it's used by test_access.js and internal.js\n  persistentConnection_: PersistentConnection | null = null;\n\n  constructor(\n    public repoInfo_: RepoInfo,\n    public forceRestClient_: boolean,\n    public authTokenProvider_: AuthTokenProvider,\n    public appCheckProvider_: AppCheckTokenProvider\n  ) {\n    // This key is intentionally not updated if RepoInfo is later changed or replaced\n    this.key = this.repoInfo_.toURLString();\n  }\n\n  /**\n   * @returns The URL corresponding to the root of this Firebase.\n   */\n  toString(): string {\n    return (\n      (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host\n    );\n  }\n}\n\nexport function repoStart(\n  repo: Repo,\n  appId: string,\n  authOverride?: object\n): void {\n  repo.stats_ = statsManagerGetCollection(repo.repoInfo_);\n\n  if (repo.forceRestClient_ || beingCrawled()) {\n    repo.server_ = new ReadonlyRestClient(\n      repo.repoInfo_,\n      (\n        pathString: string,\n        data: unknown,\n        isMerge: boolean,\n        tag: number | null\n      ) => {\n        repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n      },\n      repo.authTokenProvider_,\n      repo.appCheckProvider_\n    );\n\n    // Minor hack: Fire onConnect immediately, since there's no actual connection.\n    setTimeout(() => repoOnConnectStatus(repo, /* connectStatus= */ true), 0);\n  } else {\n    // Validate authOverride\n    if (typeof authOverride !== 'undefined' && authOverride !== null) {\n      if (typeof authOverride !== 'object') {\n        throw new Error(\n          'Only objects are supported for option databaseAuthVariableOverride'\n        );\n      }\n      try {\n        stringify(authOverride);\n      } catch (e) {\n        throw new Error('Invalid authOverride provided: ' + e);\n      }\n    }\n\n    repo.persistentConnection_ = new PersistentConnection(\n      repo.repoInfo_,\n      appId,\n      (\n        pathString: string,\n        data: unknown,\n        isMerge: boolean,\n        tag: number | null\n      ) => {\n        repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n      },\n      (connectStatus: boolean) => {\n        repoOnConnectStatus(repo, connectStatus);\n      },\n      (updates: object) => {\n        repoOnServerInfoUpdate(repo, updates);\n      },\n      repo.authTokenProvider_,\n      repo.appCheckProvider_,\n      authOverride\n    );\n\n    repo.server_ = repo.persistentConnection_;\n  }\n\n  repo.authTokenProvider_.addTokenChangeListener(token => {\n    repo.server_.refreshAuthToken(token);\n  });\n\n  repo.appCheckProvider_.addTokenChangeListener(result => {\n    repo.server_.refreshAppCheckToken(result.token);\n  });\n\n  // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n  // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\n  repo.statsReporter_ = statsManagerGetOrCreateReporter(\n    repo.repoInfo_,\n    () => new StatsReporter(repo.stats_, repo.server_)\n  );\n\n  // Used for .info.\n  repo.infoData_ = new SnapshotHolder();\n  repo.infoSyncTree_ = new SyncTree({\n    startListening: (query, tag, currentHashFn, onComplete) => {\n      let infoEvents: Event[] = [];\n      const node = repo.infoData_.getNode(query._path);\n      // This is possibly a hack, but we have different semantics for .info endpoints. We don't raise null events\n      // on initial data...\n      if (!node.isEmpty()) {\n        infoEvents = syncTreeApplyServerOverwrite(\n          repo.infoSyncTree_,\n          query._path,\n          node\n        );\n        setTimeout(() => {\n          onComplete('ok');\n        }, 0);\n      }\n      return infoEvents;\n    },\n    stopListening: () => {}\n  });\n  repoUpdateInfo(repo, 'connected', false);\n\n  repo.serverSyncTree_ = new SyncTree({\n    startListening: (query, tag, currentHashFn, onComplete) => {\n      repo.server_.listen(query, currentHashFn, tag, (status, data) => {\n        const events = onComplete(status, data);\n        eventQueueRaiseEventsForChangedPath(\n          repo.eventQueue_,\n          query._path,\n          events\n        );\n      });\n      // No synchronous events for network-backed sync trees\n      return [];\n    },\n    stopListening: (query, tag) => {\n      repo.server_.unlisten(query, tag);\n    }\n  });\n}\n\n/**\n * @returns The time in milliseconds, taking the server offset into account if we have one.\n */\nexport function repoServerTime(repo: Repo): number {\n  const offsetNode = repo.infoData_.getNode(new Path('.info/serverTimeOffset'));\n  const offset = (offsetNode.val() as number) || 0;\n  return new Date().getTime() + offset;\n}\n\n/**\n * Generate ServerValues using some variables from the repo object.\n */\nexport function repoGenerateServerValues(repo: Repo): Indexable {\n  return generateWithValues({\n    timestamp: repoServerTime(repo)\n  });\n}\n\n/**\n * Called by realtime when we get new messages from the server.\n */\nfunction repoOnDataUpdate(\n  repo: Repo,\n  pathString: string,\n  data: unknown,\n  isMerge: boolean,\n  tag: number | null\n): void {\n  // For testing.\n  repo.dataUpdateCount++;\n  const path = new Path(pathString);\n  data = repo.interceptServerDataCallback_\n    ? repo.interceptServerDataCallback_(pathString, data)\n    : data;\n  let events = [];\n  if (tag) {\n    if (isMerge) {\n      const taggedChildren = map(\n        data as { [k: string]: unknown },\n        (raw: unknown) => nodeFromJSON(raw)\n      );\n      events = syncTreeApplyTaggedQueryMerge(\n        repo.serverSyncTree_,\n        path,\n        taggedChildren,\n        tag\n      );\n    } else {\n      const taggedSnap = nodeFromJSON(data);\n      events = syncTreeApplyTaggedQueryOverwrite(\n        repo.serverSyncTree_,\n        path,\n        taggedSnap,\n        tag\n      );\n    }\n  } else if (isMerge) {\n    const changedChildren = map(\n      data as { [k: string]: unknown },\n      (raw: unknown) => nodeFromJSON(raw)\n    );\n    events = syncTreeApplyServerMerge(\n      repo.serverSyncTree_,\n      path,\n      changedChildren\n    );\n  } else {\n    const snap = nodeFromJSON(data);\n    events = syncTreeApplyServerOverwrite(repo.serverSyncTree_, path, snap);\n  }\n  let affectedPath = path;\n  if (events.length > 0) {\n    // Since we have a listener outstanding for each transaction, receiving any events\n    // is a proxy for some change having occurred.\n    affectedPath = repoRerunTransactions(repo, path);\n  }\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, affectedPath, events);\n}\n\n// TODO: This should be @private but it's used by test_access.js and internal.js\nexport function repoInterceptServerData(\n  repo: Repo,\n  callback: ((a: string, b: unknown) => unknown) | null\n): void {\n  repo.interceptServerDataCallback_ = callback;\n}\n\nfunction repoOnConnectStatus(repo: Repo, connectStatus: boolean): void {\n  repoUpdateInfo(repo, 'connected', connectStatus);\n  if (connectStatus === false) {\n    repoRunOnDisconnectEvents(repo);\n  }\n}\n\nfunction repoOnServerInfoUpdate(repo: Repo, updates: object): void {\n  each(updates, (key: string, value: unknown) => {\n    repoUpdateInfo(repo, key, value);\n  });\n}\n\nfunction repoUpdateInfo(repo: Repo, pathString: string, value: unknown): void {\n  const path = new Path('/.info/' + pathString);\n  const newNode = nodeFromJSON(value);\n  repo.infoData_.updateSnapshot(path, newNode);\n  const events = syncTreeApplyServerOverwrite(\n    repo.infoSyncTree_,\n    path,\n    newNode\n  );\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n}\n\nfunction repoGetNextWriteId(repo: Repo): number {\n  return repo.nextWriteId_++;\n}\n\n/**\n * The purpose of `getValue` is to return the latest known value\n * satisfying `query`.\n *\n * This method will first check for in-memory cached values\n * belonging to active listeners. If they are found, such values\n * are considered to be the most up-to-date.\n *\n * If the client is not connected, this method will wait until the\n *  repo has established a connection and then request the value for `query`.\n * If the client is not able to retrieve the query result for another reason,\n * it reports an error.\n *\n * @param query - The query to surface a value for.\n */\nexport function repoGetValue(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: ValueEventRegistration\n): Promise<Node> {\n  // Only active queries are cached. There is no persisted cache.\n  const cached = syncTreeGetServerValue(repo.serverSyncTree_, query);\n  if (cached != null) {\n    return Promise.resolve(cached);\n  }\n  return repo.server_.get(query).then(\n    payload => {\n      const node = nodeFromJSON(payload).withIndex(\n        query._queryParams.getIndex()\n      );\n      /**\n       * Below we simulate the actions of an `onlyOnce` `onValue()` event where:\n       * Add an event registration,\n       * Update data at the path,\n       * Raise any events,\n       * Cleanup the SyncTree\n       */\n      syncTreeAddEventRegistration(\n        repo.serverSyncTree_,\n        query,\n        eventRegistration,\n        true\n      );\n      let events: Event[];\n      if (query._queryParams.loadsAllData()) {\n        events = syncTreeApplyServerOverwrite(\n          repo.serverSyncTree_,\n          query._path,\n          node\n        );\n      } else {\n        const tag = syncTreeTagForQuery(repo.serverSyncTree_, query);\n        events = syncTreeApplyTaggedQueryOverwrite(\n          repo.serverSyncTree_,\n          query._path,\n          node,\n          tag\n        );\n      }\n      /*\n       * We need to raise events in the scenario where `get()` is called at a parent path, and\n       * while the `get()` is pending, `onValue` is called at a child location. While get() is waiting\n       * for the data, `onValue` will register a new event. Then, get() will come back, and update the syncTree\n       * and its corresponding serverCache, including the child location where `onValue` is called. Then,\n       * `onValue` will receive the event from the server, but look at the syncTree and see that the data received\n       * from the server is already at the SyncPoint, and so the `onValue` callback will never get fired.\n       * Calling `eventQueueRaiseEventsForChangedPath()` is the correct way to propagate the events and\n       * ensure the corresponding child events will get fired.\n       */\n      eventQueueRaiseEventsForChangedPath(\n        repo.eventQueue_,\n        query._path,\n        events\n      );\n      syncTreeRemoveEventRegistration(\n        repo.serverSyncTree_,\n        query,\n        eventRegistration,\n        null,\n        true\n      );\n      return node;\n    },\n    err => {\n      repoLog(repo, 'get for query ' + stringify(query) + ' failed: ' + err);\n      return Promise.reject(new Error(err as string));\n    }\n  );\n}\n\nexport function repoSetWithPriority(\n  repo: Repo,\n  path: Path,\n  newVal: unknown,\n  newPriority: number | string | null,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repoLog(repo, 'set', {\n    path: path.toString(),\n    value: newVal,\n    priority: newPriority\n  });\n\n  // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\n  // (b) store unresolved paths on JSON parse\n  const serverValues = repoGenerateServerValues(repo);\n  const newNodeUnresolved = nodeFromJSON(newVal, newPriority);\n  const existing = syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path);\n  const newNode = resolveDeferredValueSnapshot(\n    newNodeUnresolved,\n    existing,\n    serverValues\n  );\n\n  const writeId = repoGetNextWriteId(repo);\n  const events = syncTreeApplyUserOverwrite(\n    repo.serverSyncTree_,\n    path,\n    newNode,\n    writeId,\n    true\n  );\n  eventQueueQueueEvents(repo.eventQueue_, events);\n  repo.server_.put(\n    path.toString(),\n    newNodeUnresolved.val(/*export=*/ true),\n    (status, errorReason) => {\n      const success = status === 'ok';\n      if (!success) {\n        warn('set at ' + path + ' failed: ' + status);\n      }\n\n      const clearEvents = syncTreeAckUserWrite(\n        repo.serverSyncTree_,\n        writeId,\n        !success\n      );\n      eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, clearEvents);\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n  const affectedPath = repoAbortTransactions(repo, path);\n  repoRerunTransactions(repo, affectedPath);\n  // We queued the events above, so just flush the queue here\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, affectedPath, []);\n}\n\nexport function repoUpdate(\n  repo: Repo,\n  path: Path,\n  childrenToMerge: { [k: string]: unknown },\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repoLog(repo, 'update', { path: path.toString(), value: childrenToMerge });\n\n  // Start with our existing data and merge each child into it.\n  let empty = true;\n  const serverValues = repoGenerateServerValues(repo);\n  const changedChildren: { [k: string]: Node } = {};\n  each(childrenToMerge, (changedKey: string, changedValue: unknown) => {\n    empty = false;\n    changedChildren[changedKey] = resolveDeferredValueTree(\n      pathChild(path, changedKey),\n      nodeFromJSON(changedValue),\n      repo.serverSyncTree_,\n      serverValues\n    );\n  });\n\n  if (!empty) {\n    const writeId = repoGetNextWriteId(repo);\n    const events = syncTreeApplyUserMerge(\n      repo.serverSyncTree_,\n      path,\n      changedChildren,\n      writeId\n    );\n    eventQueueQueueEvents(repo.eventQueue_, events);\n    repo.server_.merge(\n      path.toString(),\n      childrenToMerge,\n      (status, errorReason) => {\n        const success = status === 'ok';\n        if (!success) {\n          warn('update at ' + path + ' failed: ' + status);\n        }\n\n        const clearEvents = syncTreeAckUserWrite(\n          repo.serverSyncTree_,\n          writeId,\n          !success\n        );\n        const affectedPath =\n          clearEvents.length > 0 ? repoRerunTransactions(repo, path) : path;\n        eventQueueRaiseEventsForChangedPath(\n          repo.eventQueue_,\n          affectedPath,\n          clearEvents\n        );\n        repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n      }\n    );\n\n    each(childrenToMerge, (changedPath: string) => {\n      const affectedPath = repoAbortTransactions(\n        repo,\n        pathChild(path, changedPath)\n      );\n      repoRerunTransactions(repo, affectedPath);\n    });\n\n    // We queued the events above, so just flush the queue here\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, []);\n  } else {\n    log(\"update() called with empty data.  Don't do anything.\");\n    repoCallOnCompleteCallback(repo, onComplete, 'ok', undefined);\n  }\n}\n\n/**\n * Applies all of the changes stored up in the onDisconnect_ tree.\n */\nfunction repoRunOnDisconnectEvents(repo: Repo): void {\n  repoLog(repo, 'onDisconnectEvents');\n\n  const serverValues = repoGenerateServerValues(repo);\n  const resolvedOnDisconnectTree = newSparseSnapshotTree();\n  sparseSnapshotTreeForEachTree(\n    repo.onDisconnect_,\n    newEmptyPath(),\n    (path, node) => {\n      const resolved = resolveDeferredValueTree(\n        path,\n        node,\n        repo.serverSyncTree_,\n        serverValues\n      );\n      sparseSnapshotTreeRemember(resolvedOnDisconnectTree, path, resolved);\n    }\n  );\n  let events: Event[] = [];\n\n  sparseSnapshotTreeForEachTree(\n    resolvedOnDisconnectTree,\n    newEmptyPath(),\n    (path, snap) => {\n      events = events.concat(\n        syncTreeApplyServerOverwrite(repo.serverSyncTree_, path, snap)\n      );\n      const affectedPath = repoAbortTransactions(repo, path);\n      repoRerunTransactions(repo, affectedPath);\n    }\n  );\n\n  repo.onDisconnect_ = newSparseSnapshotTree();\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, newEmptyPath(), events);\n}\n\nexport function repoOnDisconnectCancel(\n  repo: Repo,\n  path: Path,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repo.server_.onDisconnectCancel(path.toString(), (status, errorReason) => {\n    if (status === 'ok') {\n      sparseSnapshotTreeForget(repo.onDisconnect_, path);\n    }\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n  });\n}\n\nexport function repoOnDisconnectSet(\n  repo: Repo,\n  path: Path,\n  value: unknown,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  const newNode = nodeFromJSON(value);\n  repo.server_.onDisconnectPut(\n    path.toString(),\n    newNode.val(/*export=*/ true),\n    (status, errorReason) => {\n      if (status === 'ok') {\n        sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoOnDisconnectSetWithPriority(\n  repo: Repo,\n  path: Path,\n  value: unknown,\n  priority: unknown,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  const newNode = nodeFromJSON(value, priority);\n  repo.server_.onDisconnectPut(\n    path.toString(),\n    newNode.val(/*export=*/ true),\n    (status, errorReason) => {\n      if (status === 'ok') {\n        sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoOnDisconnectUpdate(\n  repo: Repo,\n  path: Path,\n  childrenToMerge: { [k: string]: unknown },\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  if (isEmpty(childrenToMerge)) {\n    log(\"onDisconnect().update() called with empty data.  Don't do anything.\");\n    repoCallOnCompleteCallback(repo, onComplete, 'ok', undefined);\n    return;\n  }\n\n  repo.server_.onDisconnectMerge(\n    path.toString(),\n    childrenToMerge,\n    (status, errorReason) => {\n      if (status === 'ok') {\n        each(childrenToMerge, (childName: string, childNode: unknown) => {\n          const newChildNode = nodeFromJSON(childNode);\n          sparseSnapshotTreeRemember(\n            repo.onDisconnect_,\n            pathChild(path, childName),\n            newChildNode\n          );\n        });\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoAddEventCallbackForQuery(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: EventRegistration\n): void {\n  let events;\n  if (pathGetFront(query._path) === '.info') {\n    events = syncTreeAddEventRegistration(\n      repo.infoSyncTree_,\n      query,\n      eventRegistration\n    );\n  } else {\n    events = syncTreeAddEventRegistration(\n      repo.serverSyncTree_,\n      query,\n      eventRegistration\n    );\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\n\nexport function repoRemoveEventCallbackForQuery(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: EventRegistration\n): void {\n  // These are guaranteed not to raise events, since we're not passing in a cancelError. However, we can future-proof\n  // a little bit by handling the return values anyways.\n  let events;\n  if (pathGetFront(query._path) === '.info') {\n    events = syncTreeRemoveEventRegistration(\n      repo.infoSyncTree_,\n      query,\n      eventRegistration\n    );\n  } else {\n    events = syncTreeRemoveEventRegistration(\n      repo.serverSyncTree_,\n      query,\n      eventRegistration\n    );\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\n\nexport function repoInterrupt(repo: Repo): void {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.interrupt(INTERRUPT_REASON);\n  }\n}\n\nexport function repoResume(repo: Repo): void {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.resume(INTERRUPT_REASON);\n  }\n}\n\nexport function repoStats(repo: Repo, showDelta: boolean = false): void {\n  if (typeof console === 'undefined') {\n    return;\n  }\n\n  let stats: { [k: string]: unknown };\n  if (showDelta) {\n    if (!repo.statsListener_) {\n      repo.statsListener_ = new StatsListener(repo.stats_);\n    }\n    stats = repo.statsListener_.get();\n  } else {\n    stats = repo.stats_.get();\n  }\n\n  const longestName = Object.keys(stats).reduce(\n    (previousValue, currentValue) =>\n      Math.max(currentValue.length, previousValue),\n    0\n  );\n\n  each(stats, (stat: string, value: unknown) => {\n    let paddedStat = stat;\n    // pad stat names to be the same length (plus 2 extra spaces).\n    for (let i = stat.length; i < longestName + 2; i++) {\n      paddedStat += ' ';\n    }\n    console.log(paddedStat + value);\n  });\n}\n\nexport function repoStatsIncrementCounter(repo: Repo, metric: string): void {\n  repo.stats_.incrementCounter(metric);\n  statsReporterIncludeStat(repo.statsReporter_, metric);\n}\n\nfunction repoLog(repo: Repo, ...varArgs: unknown[]): void {\n  let prefix = '';\n  if (repo.persistentConnection_) {\n    prefix = repo.persistentConnection_.id + ':';\n  }\n  log(prefix, ...varArgs);\n}\n\nexport function repoCallOnCompleteCallback(\n  repo: Repo,\n  callback: ((status: Error | null, errorReason?: string) => void) | null,\n  status: string,\n  errorReason?: string | null\n): void {\n  if (callback) {\n    exceptionGuard(() => {\n      if (status === 'ok') {\n        callback(null);\n      } else {\n        const code = (status || 'error').toUpperCase();\n        let message = code;\n        if (errorReason) {\n          message += ': ' + errorReason;\n        }\n\n        const error = new Error(message);\n\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        (error as any).code = code;\n        callback(error);\n      }\n    });\n  }\n}\n\n/**\n * Creates a new transaction, adds it to the transactions we're tracking, and\n * sends it to the server if possible.\n *\n * @param path - Path at which to do transaction.\n * @param transactionUpdate - Update callback.\n * @param onComplete - Completion callback.\n * @param unwatcher - Function that will be called when the transaction no longer\n * need data updates for `path`.\n * @param applyLocally - Whether or not to make intermediate results visible\n */\nexport function repoStartTransaction(\n  repo: Repo,\n  path: Path,\n  transactionUpdate: (a: unknown) => unknown,\n  onComplete: ((error: Error, committed: boolean, node: Node) => void) | null,\n  unwatcher: () => void,\n  applyLocally: boolean\n): void {\n  repoLog(repo, 'transaction on ' + path);\n\n  // Initialize transaction.\n  const transaction: Transaction = {\n    path,\n    update: transactionUpdate,\n    onComplete,\n    // One of TransactionStatus enums.\n    status: null,\n    // Used when combining transactions at different locations to figure out\n    // which one goes first.\n    order: LUIDGenerator(),\n    // Whether to raise local events for this transaction.\n    applyLocally,\n    // Count of how many times we've retried the transaction.\n    retryCount: 0,\n    // Function to call to clean up our .on() listener.\n    unwatcher,\n    // Stores why a transaction was aborted.\n    abortReason: null,\n    currentWriteId: null,\n    currentInputSnapshot: null,\n    currentOutputSnapshotRaw: null,\n    currentOutputSnapshotResolved: null\n  };\n\n  // Run transaction initially.\n  const currentState = repoGetLatestState(repo, path, undefined);\n  transaction.currentInputSnapshot = currentState;\n  const newVal = transaction.update(currentState.val());\n  if (newVal === undefined) {\n    // Abort transaction.\n    transaction.unwatcher();\n    transaction.currentOutputSnapshotRaw = null;\n    transaction.currentOutputSnapshotResolved = null;\n    if (transaction.onComplete) {\n      transaction.onComplete(null, false, transaction.currentInputSnapshot);\n    }\n  } else {\n    validateFirebaseData(\n      'transaction failed: Data returned ',\n      newVal,\n      transaction.path\n    );\n\n    // Mark as run and add to our queue.\n    transaction.status = TransactionStatus.RUN;\n    const queueNode = treeSubTree(repo.transactionQueueTree_, path);\n    const nodeQueue = treeGetValue(queueNode) || [];\n    nodeQueue.push(transaction);\n\n    treeSetValue(queueNode, nodeQueue);\n\n    // Update visibleData and raise events\n    // Note: We intentionally raise events after updating all of our\n    // transaction state, since the user could start new transactions from the\n    // event callbacks.\n    let priorityForNode;\n    if (\n      typeof newVal === 'object' &&\n      newVal !== null &&\n      contains(newVal, '.priority')\n    ) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      priorityForNode = safeGet(newVal as any, '.priority');\n      assert(\n        isValidPriority(priorityForNode),\n        'Invalid priority returned by transaction. ' +\n          'Priority must be a valid string, finite number, server value, or null.'\n      );\n    } else {\n      const currentNode =\n        syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path) ||\n        ChildrenNode.EMPTY_NODE;\n      priorityForNode = currentNode.getPriority().val();\n    }\n\n    const serverValues = repoGenerateServerValues(repo);\n    const newNodeUnresolved = nodeFromJSON(newVal, priorityForNode);\n    const newNode = resolveDeferredValueSnapshot(\n      newNodeUnresolved,\n      currentState,\n      serverValues\n    );\n    transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n    transaction.currentOutputSnapshotResolved = newNode;\n    transaction.currentWriteId = repoGetNextWriteId(repo);\n\n    const events = syncTreeApplyUserOverwrite(\n      repo.serverSyncTree_,\n      path,\n      newNode,\n      transaction.currentWriteId,\n      transaction.applyLocally\n    );\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n\n    repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n  }\n}\n\n/**\n * @param excludeSets - A specific set to exclude\n */\nfunction repoGetLatestState(\n  repo: Repo,\n  path: Path,\n  excludeSets?: number[]\n): Node {\n  return (\n    syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path, excludeSets) ||\n    ChildrenNode.EMPTY_NODE\n  );\n}\n\n/**\n * Sends any already-run transactions that aren't waiting for outstanding\n * transactions to complete.\n *\n * Externally it's called with no arguments, but it calls itself recursively\n * with a particular transactionQueueTree node to recurse through the tree.\n *\n * @param node - transactionQueueTree node to start at.\n */\nfunction repoSendReadyTransactions(\n  repo: Repo,\n  node: Tree<Transaction[]> = repo.transactionQueueTree_\n): void {\n  // Before recursing, make sure any completed transactions are removed.\n  if (!node) {\n    repoPruneCompletedTransactionsBelowNode(repo, node);\n  }\n\n  if (treeGetValue(node)) {\n    const queue = repoBuildTransactionQueue(repo, node);\n    assert(queue.length > 0, 'Sending zero length transaction queue');\n\n    const allRun = queue.every(\n      (transaction: Transaction) => transaction.status === TransactionStatus.RUN\n    );\n\n    // If they're all run (and not sent), we can send them.  Else, we must wait.\n    if (allRun) {\n      repoSendTransactionQueue(repo, treeGetPath(node), queue);\n    }\n  } else if (treeHasChildren(node)) {\n    treeForEachChild(node, childNode => {\n      repoSendReadyTransactions(repo, childNode);\n    });\n  }\n}\n\n/**\n * Given a list of run transactions, send them to the server and then handle\n * the result (success or failure).\n *\n * @param path - The location of the queue.\n * @param queue - Queue of transactions under the specified location.\n */\nfunction repoSendTransactionQueue(\n  repo: Repo,\n  path: Path,\n  queue: Transaction[]\n): void {\n  // Mark transactions as sent and increment retry count!\n  const setsToIgnore = queue.map(txn => {\n    return txn.currentWriteId;\n  });\n  const latestState = repoGetLatestState(repo, path, setsToIgnore);\n  let snapToSend = latestState;\n  const latestHash = latestState.hash();\n  for (let i = 0; i < queue.length; i++) {\n    const txn = queue[i];\n    assert(\n      txn.status === TransactionStatus.RUN,\n      'tryToSendTransactionQueue_: items in queue should all be run.'\n    );\n    txn.status = TransactionStatus.SENT;\n    txn.retryCount++;\n    const relativePath = newRelativePath(path, txn.path);\n    // If we've gotten to this point, the output snapshot must be defined.\n    snapToSend = snapToSend.updateChild(\n      relativePath /** @type {!Node} */,\n      txn.currentOutputSnapshotRaw\n    );\n  }\n\n  const dataToSend = snapToSend.val(true);\n  const pathToSend = path;\n\n  // Send the put.\n  repo.server_.put(\n    pathToSend.toString(),\n    dataToSend,\n    (status: string) => {\n      repoLog(repo, 'transaction put response', {\n        path: pathToSend.toString(),\n        status\n      });\n\n      let events: Event[] = [];\n      if (status === 'ok') {\n        // Queue up the callbacks and fire them after cleaning up all of our\n        // transaction state, since the callback could trigger more\n        // transactions or sets.\n        const callbacks = [];\n        for (let i = 0; i < queue.length; i++) {\n          queue[i].status = TransactionStatus.COMPLETED;\n          events = events.concat(\n            syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId)\n          );\n          if (queue[i].onComplete) {\n            // We never unset the output snapshot, and given that this\n            // transaction is complete, it should be set\n            callbacks.push(() =>\n              queue[i].onComplete(\n                null,\n                true,\n                queue[i].currentOutputSnapshotResolved\n              )\n            );\n          }\n          queue[i].unwatcher();\n        }\n\n        // Now remove the completed transactions.\n        repoPruneCompletedTransactionsBelowNode(\n          repo,\n          treeSubTree(repo.transactionQueueTree_, path)\n        );\n        // There may be pending transactions that we can now send.\n        repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n\n        eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n\n        // Finally, trigger onComplete callbacks.\n        for (let i = 0; i < callbacks.length; i++) {\n          exceptionGuard(callbacks[i]);\n        }\n      } else {\n        // transactions are no longer sent.  Update their status appropriately.\n        if (status === 'datastale') {\n          for (let i = 0; i < queue.length; i++) {\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n              queue[i].status = TransactionStatus.NEEDS_ABORT;\n            } else {\n              queue[i].status = TransactionStatus.RUN;\n            }\n          }\n        } else {\n          warn(\n            'transaction at ' + pathToSend.toString() + ' failed: ' + status\n          );\n          for (let i = 0; i < queue.length; i++) {\n            queue[i].status = TransactionStatus.NEEDS_ABORT;\n            queue[i].abortReason = status;\n          }\n        }\n\n        repoRerunTransactions(repo, path);\n      }\n    },\n    latestHash\n  );\n}\n\n/**\n * Finds all transactions dependent on the data at changedPath and reruns them.\n *\n * Should be called any time cached data changes.\n *\n * Return the highest path that was affected by rerunning transactions. This\n * is the path at which events need to be raised for.\n *\n * @param changedPath - The path in mergedData that changed.\n * @returns The rootmost path that was affected by rerunning transactions.\n */\nfunction repoRerunTransactions(repo: Repo, changedPath: Path): Path {\n  const rootMostTransactionNode = repoGetAncestorTransactionNode(\n    repo,\n    changedPath\n  );\n  const path = treeGetPath(rootMostTransactionNode);\n\n  const queue = repoBuildTransactionQueue(repo, rootMostTransactionNode);\n  repoRerunTransactionQueue(repo, queue, path);\n\n  return path;\n}\n\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted\n * transactions and whatnot).\n *\n * @param queue - The queue of transactions to run.\n * @param path - The path the queue is for.\n */\nfunction repoRerunTransactionQueue(\n  repo: Repo,\n  queue: Transaction[],\n  path: Path\n): void {\n  if (queue.length === 0) {\n    return; // Nothing to do!\n  }\n\n  // Queue up the callbacks and fire them after cleaning up all of our\n  // transaction state, since the callback could trigger more transactions or\n  // sets.\n  const callbacks = [];\n  let events: Event[] = [];\n  // Ignore all of the sets we're going to re-run.\n  const txnsToRerun = queue.filter(q => {\n    return q.status === TransactionStatus.RUN;\n  });\n  const setsToIgnore = txnsToRerun.map(q => {\n    return q.currentWriteId;\n  });\n  for (let i = 0; i < queue.length; i++) {\n    const transaction = queue[i];\n    const relativePath = newRelativePath(path, transaction.path);\n    let abortTransaction = false,\n      abortReason;\n    assert(\n      relativePath !== null,\n      'rerunTransactionsUnderNode_: relativePath should not be null.'\n    );\n\n    if (transaction.status === TransactionStatus.NEEDS_ABORT) {\n      abortTransaction = true;\n      abortReason = transaction.abortReason;\n      events = events.concat(\n        syncTreeAckUserWrite(\n          repo.serverSyncTree_,\n          transaction.currentWriteId,\n          true\n        )\n      );\n    } else if (transaction.status === TransactionStatus.RUN) {\n      if (transaction.retryCount >= MAX_TRANSACTION_RETRIES) {\n        abortTransaction = true;\n        abortReason = 'maxretry';\n        events = events.concat(\n          syncTreeAckUserWrite(\n            repo.serverSyncTree_,\n            transaction.currentWriteId,\n            true\n          )\n        );\n      } else {\n        // This code reruns a transaction\n        const currentNode = repoGetLatestState(\n          repo,\n          transaction.path,\n          setsToIgnore\n        );\n        transaction.currentInputSnapshot = currentNode;\n        const newData = queue[i].update(currentNode.val());\n        if (newData !== undefined) {\n          validateFirebaseData(\n            'transaction failed: Data returned ',\n            newData,\n            transaction.path\n          );\n          let newDataNode = nodeFromJSON(newData);\n          const hasExplicitPriority =\n            typeof newData === 'object' &&\n            newData != null &&\n            contains(newData, '.priority');\n          if (!hasExplicitPriority) {\n            // Keep the old priority if there wasn't a priority explicitly specified.\n            newDataNode = newDataNode.updatePriority(currentNode.getPriority());\n          }\n\n          const oldWriteId = transaction.currentWriteId;\n          const serverValues = repoGenerateServerValues(repo);\n          const newNodeResolved = resolveDeferredValueSnapshot(\n            newDataNode,\n            currentNode,\n            serverValues\n          );\n\n          transaction.currentOutputSnapshotRaw = newDataNode;\n          transaction.currentOutputSnapshotResolved = newNodeResolved;\n          transaction.currentWriteId = repoGetNextWriteId(repo);\n          // Mutates setsToIgnore in place\n          setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\n          events = events.concat(\n            syncTreeApplyUserOverwrite(\n              repo.serverSyncTree_,\n              transaction.path,\n              newNodeResolved,\n              transaction.currentWriteId,\n              transaction.applyLocally\n            )\n          );\n          events = events.concat(\n            syncTreeAckUserWrite(repo.serverSyncTree_, oldWriteId, true)\n          );\n        } else {\n          abortTransaction = true;\n          abortReason = 'nodata';\n          events = events.concat(\n            syncTreeAckUserWrite(\n              repo.serverSyncTree_,\n              transaction.currentWriteId,\n              true\n            )\n          );\n        }\n      }\n    }\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n    events = [];\n    if (abortTransaction) {\n      // Abort.\n      queue[i].status = TransactionStatus.COMPLETED;\n\n      // Removing a listener can trigger pruning which can muck with\n      // mergedData/visibleData (as it prunes data). So defer the unwatcher\n      // until we're done.\n      (function (unwatcher) {\n        setTimeout(unwatcher, Math.floor(0));\n      })(queue[i].unwatcher);\n\n      if (queue[i].onComplete) {\n        if (abortReason === 'nodata') {\n          callbacks.push(() =>\n            queue[i].onComplete(null, false, queue[i].currentInputSnapshot)\n          );\n        } else {\n          callbacks.push(() =>\n            queue[i].onComplete(new Error(abortReason), false, null)\n          );\n        }\n      }\n    }\n  }\n\n  // Clean up completed transactions.\n  repoPruneCompletedTransactionsBelowNode(repo, repo.transactionQueueTree_);\n\n  // Now fire callbacks, now that we're in a good, known state.\n  for (let i = 0; i < callbacks.length; i++) {\n    exceptionGuard(callbacks[i]);\n  }\n\n  // Try to send the transaction result to the server.\n  repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n}\n\n/**\n * Returns the rootmost ancestor node of the specified path that has a pending\n * transaction on it, or just returns the node for the given path if there are\n * no pending transactions on any ancestor.\n *\n * @param path - The location to start at.\n * @returns The rootmost node with a transaction.\n */\nfunction repoGetAncestorTransactionNode(\n  repo: Repo,\n  path: Path\n): Tree<Transaction[]> {\n  let front;\n\n  // Start at the root and walk deeper into the tree towards path until we\n  // find a node with pending transactions.\n  let transactionNode = repo.transactionQueueTree_;\n  front = pathGetFront(path);\n  while (front !== null && treeGetValue(transactionNode) === undefined) {\n    transactionNode = treeSubTree(transactionNode, front);\n    path = pathPopFront(path);\n    front = pathGetFront(path);\n  }\n\n  return transactionNode;\n}\n\n/**\n * Builds the queue of all transactions at or below the specified\n * transactionNode.\n *\n * @param transactionNode\n * @returns The generated queue.\n */\nfunction repoBuildTransactionQueue(\n  repo: Repo,\n  transactionNode: Tree<Transaction[]>\n): Transaction[] {\n  // Walk any child transaction queues and aggregate them into a single queue.\n  const transactionQueue: Transaction[] = [];\n  repoAggregateTransactionQueuesForNode(\n    repo,\n    transactionNode,\n    transactionQueue\n  );\n\n  // Sort them by the order the transactions were created.\n  transactionQueue.sort((a, b) => a.order - b.order);\n\n  return transactionQueue;\n}\n\nfunction repoAggregateTransactionQueuesForNode(\n  repo: Repo,\n  node: Tree<Transaction[]>,\n  queue: Transaction[]\n): void {\n  const nodeQueue = treeGetValue(node);\n  if (nodeQueue) {\n    for (let i = 0; i < nodeQueue.length; i++) {\n      queue.push(nodeQueue[i]);\n    }\n  }\n\n  treeForEachChild(node, child => {\n    repoAggregateTransactionQueuesForNode(repo, child, queue);\n  });\n}\n\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n */\nfunction repoPruneCompletedTransactionsBelowNode(\n  repo: Repo,\n  node: Tree<Transaction[]>\n): void {\n  const queue = treeGetValue(node);\n  if (queue) {\n    let to = 0;\n    for (let from = 0; from < queue.length; from++) {\n      if (queue[from].status !== TransactionStatus.COMPLETED) {\n        queue[to] = queue[from];\n        to++;\n      }\n    }\n    queue.length = to;\n    treeSetValue(node, queue.length > 0 ? queue : undefined);\n  }\n\n  treeForEachChild(node, childNode => {\n    repoPruneCompletedTransactionsBelowNode(repo, childNode);\n  });\n}\n\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.\n * Called when doing a set() or update() since we consider them incompatible\n * with transactions.\n *\n * @param path - Path for which we want to abort related transactions.\n */\nfunction repoAbortTransactions(repo: Repo, path: Path): Path {\n  const affectedPath = treeGetPath(repoGetAncestorTransactionNode(repo, path));\n\n  const transactionNode = treeSubTree(repo.transactionQueueTree_, path);\n\n  treeForEachAncestor(transactionNode, (node: Tree<Transaction[]>) => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n\n  repoAbortTransactionsOnNode(repo, transactionNode);\n\n  treeForEachDescendant(transactionNode, (node: Tree<Transaction[]>) => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n\n  return affectedPath;\n}\n\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param node - Node to abort transactions for.\n */\nfunction repoAbortTransactionsOnNode(\n  repo: Repo,\n  node: Tree<Transaction[]>\n): void {\n  const queue = treeGetValue(node);\n  if (queue) {\n    // Queue up the callbacks and fire them after cleaning up all of our\n    // transaction state, since the callback could trigger more transactions\n    // or sets.\n    const callbacks = [];\n\n    // Go through queue.  Any already-sent transactions must be marked for\n    // abort, while the unsent ones can be immediately aborted and removed.\n    let events: Event[] = [];\n    let lastSent = -1;\n    for (let i = 0; i < queue.length; i++) {\n      if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n        // Already marked.  No action needed.\n      } else if (queue[i].status === TransactionStatus.SENT) {\n        assert(\n          lastSent === i - 1,\n          'All SENT items should be at beginning of queue.'\n        );\n        lastSent = i;\n        // Mark transaction for abort when it comes back.\n        queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n        queue[i].abortReason = 'set';\n      } else {\n        assert(\n          queue[i].status === TransactionStatus.RUN,\n          'Unexpected transaction status in abort'\n        );\n        // We can abort it immediately.\n        queue[i].unwatcher();\n        events = events.concat(\n          syncTreeAckUserWrite(\n            repo.serverSyncTree_,\n            queue[i].currentWriteId,\n            true\n          )\n        );\n        if (queue[i].onComplete) {\n          callbacks.push(\n            queue[i].onComplete.bind(null, new Error('set'), false, null)\n          );\n        }\n      }\n    }\n    if (lastSent === -1) {\n      // We're not waiting for any sent transactions.  We can clear the queue.\n      treeSetValue(node, undefined);\n    } else {\n      // Remove the transactions we aborted.\n      queue.length = lastSent + 1;\n    }\n\n    // Now fire the callbacks.\n    eventQueueRaiseEventsForChangedPath(\n      repo.eventQueue_,\n      treeGetPath(node),\n      events\n    );\n    for (let i = 0; i < callbacks.length; i++) {\n      exceptionGuard(callbacks[i]);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../../RepoInfo';\nimport { Path } from '../Path';\nimport { warnIfPageIsSecure, warn, fatal } from '../util';\n\nfunction decodePath(pathString: string): string {\n  let pathStringDecoded = '';\n  const pieces = pathString.split('/');\n  for (let i = 0; i < pieces.length; i++) {\n    if (pieces[i].length > 0) {\n      let piece = pieces[i];\n      try {\n        piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\n      } catch (e) {}\n      pathStringDecoded += '/' + piece;\n    }\n  }\n  return pathStringDecoded;\n}\n\n/**\n * @returns key value hash\n */\nfunction decodeQuery(queryString: string): { [key: string]: string } {\n  const results = {};\n  if (queryString.charAt(0) === '?') {\n    queryString = queryString.substring(1);\n  }\n  for (const segment of queryString.split('&')) {\n    if (segment.length === 0) {\n      continue;\n    }\n    const kv = segment.split('=');\n    if (kv.length === 2) {\n      results[decodeURIComponent(kv[0])] = decodeURIComponent(kv[1]);\n    } else {\n      warn(`Invalid query segment '${segment}' in query '${queryString}'`);\n    }\n  }\n  return results;\n}\n\nexport const parseRepoInfo = function (\n  dataURL: string,\n  nodeAdmin: boolean\n): { repoInfo: RepoInfo; path: Path } {\n  const parsedUrl = parseDatabaseURL(dataURL),\n    namespace = parsedUrl.namespace;\n\n  if (parsedUrl.domain === 'firebase.com') {\n    fatal(\n      parsedUrl.host +\n        ' is no longer supported. ' +\n        'Please use <YOUR FIREBASE>.firebaseio.com instead'\n    );\n  }\n\n  // Catch common error of uninitialized namespace value.\n  if (\n    (!namespace || namespace === 'undefined') &&\n    parsedUrl.domain !== 'localhost'\n  ) {\n    fatal(\n      'Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com'\n    );\n  }\n\n  if (!parsedUrl.secure) {\n    warnIfPageIsSecure();\n  }\n\n  const webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n\n  return {\n    repoInfo: new RepoInfo(\n      parsedUrl.host,\n      parsedUrl.secure,\n      namespace,\n      webSocketOnly,\n      nodeAdmin,\n      /*persistenceKey=*/ '',\n      /*includeNamespaceInQueryParams=*/ namespace !== parsedUrl.subdomain\n    ),\n    path: new Path(parsedUrl.pathString)\n  };\n};\n\nexport const parseDatabaseURL = function (dataURL: string): {\n  host: string;\n  port: number;\n  domain: string;\n  subdomain: string;\n  secure: boolean;\n  scheme: string;\n  pathString: string;\n  namespace: string;\n} {\n  // Default to empty strings in the event of a malformed string.\n  let host = '',\n    domain = '',\n    subdomain = '',\n    pathString = '',\n    namespace = '';\n\n  // Always default to SSL, unless otherwise specified.\n  let secure = true,\n    scheme = 'https',\n    port = 443;\n\n  // Don't do any validation here. The caller is responsible for validating the result of parsing.\n  if (typeof dataURL === 'string') {\n    // Parse scheme.\n    let colonInd = dataURL.indexOf('//');\n    if (colonInd >= 0) {\n      scheme = dataURL.substring(0, colonInd - 1);\n      dataURL = dataURL.substring(colonInd + 2);\n    }\n\n    // Parse host, path, and query string.\n    let slashInd = dataURL.indexOf('/');\n    if (slashInd === -1) {\n      slashInd = dataURL.length;\n    }\n    let questionMarkInd = dataURL.indexOf('?');\n    if (questionMarkInd === -1) {\n      questionMarkInd = dataURL.length;\n    }\n    host = dataURL.substring(0, Math.min(slashInd, questionMarkInd));\n    if (slashInd < questionMarkInd) {\n      // For pathString, questionMarkInd will always come after slashInd\n      pathString = decodePath(dataURL.substring(slashInd, questionMarkInd));\n    }\n    const queryParams = decodeQuery(\n      dataURL.substring(Math.min(dataURL.length, questionMarkInd))\n    );\n\n    // If we have a port, use scheme for determining if it's secure.\n    colonInd = host.indexOf(':');\n    if (colonInd >= 0) {\n      secure = scheme === 'https' || scheme === 'wss';\n      port = parseInt(host.substring(colonInd + 1), 10);\n    } else {\n      colonInd = host.length;\n    }\n\n    const hostWithoutPort = host.slice(0, colonInd);\n    if (hostWithoutPort.toLowerCase() === 'localhost') {\n      domain = 'localhost';\n    } else if (hostWithoutPort.split('.').length <= 2) {\n      domain = hostWithoutPort;\n    } else {\n      // Interpret the subdomain of a 3 or more component URL as the namespace name.\n      const dotInd = host.indexOf('.');\n      subdomain = host.substring(0, dotInd).toLowerCase();\n      domain = host.substring(dotInd + 1);\n      // Normalize namespaces to lowercase to share storage / connection.\n      namespace = subdomain;\n    }\n    // Always treat the value of the `ns` as the namespace name if it is present.\n    if ('ns' in queryParams) {\n      namespace = queryParams['ns'];\n    }\n  }\n\n  return {\n    host,\n    port,\n    domain,\n    subdomain,\n    secure,\n    scheme,\n    pathString,\n    namespace\n  };\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport {\n  tryParseInt,\n  MAX_NAME,\n  MIN_NAME,\n  INTEGER_32_MIN,\n  INTEGER_32_MAX\n} from '../util/util';\n\n// Modeled after base64 web-safe chars, but ordered by ASCII.\nconst PUSH_CHARS =\n  '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\n\nconst MIN_PUSH_CHAR = '-';\n\nconst MAX_PUSH_CHAR = 'z';\n\nconst MAX_KEY_LEN = 786;\n\n/**\n * Fancy ID generator that creates 20-character string identifiers with the\n * following properties:\n *\n * 1. They're based on timestamp so that they sort *after* any existing ids.\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\n *    collide with other clients' IDs.\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\n *    that will sort properly).\n * 4. They're monotonically increasing. Even if you generate more than one in\n *    the same timestamp, the latter ones will sort after the former ones. We do\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\n *    in the case of a timestamp collision).\n */\nexport const nextPushId = (function () {\n  // Timestamp of last push, used to prevent local collisions if you push twice\n  // in one ms.\n  let lastPushTime = 0;\n\n  // We generate 72-bits of randomness which get turned into 12 characters and\n  // appended to the timestamp to prevent collisions with other clients. We\n  // store the last characters we generated because in the event of a collision,\n  // we'll use those same characters except \"incremented\" by one.\n  const lastRandChars: number[] = [];\n\n  return function (now: number) {\n    const duplicateTime = now === lastPushTime;\n    lastPushTime = now;\n\n    let i;\n    const timeStampChars = new Array(8);\n    for (i = 7; i >= 0; i--) {\n      timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\n      // NOTE: Can't use << here because javascript will convert to int and lose\n      // the upper bits.\n      now = Math.floor(now / 64);\n    }\n    assert(now === 0, 'Cannot push at time == 0');\n\n    let id = timeStampChars.join('');\n\n    if (!duplicateTime) {\n      for (i = 0; i < 12; i++) {\n        lastRandChars[i] = Math.floor(Math.random() * 64);\n      }\n    } else {\n      // If the timestamp hasn't changed since last push, use the same random\n      // number, except incremented by 1.\n      for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\n        lastRandChars[i] = 0;\n      }\n      lastRandChars[i]++;\n    }\n    for (i = 0; i < 12; i++) {\n      id += PUSH_CHARS.charAt(lastRandChars[i]);\n    }\n    assert(id.length === 20, 'nextPushId: Length should be 20.');\n\n    return id;\n  };\n})();\n\nexport const successor = function (key: string) {\n  if (key === '' + INTEGER_32_MAX) {\n    // See https://firebase.google.com/docs/database/web/lists-of-data#data-order\n    return MIN_PUSH_CHAR;\n  }\n  const keyAsInt: number = tryParseInt(key);\n  if (keyAsInt != null) {\n    return '' + (keyAsInt + 1);\n  }\n  const next = new Array(key.length);\n\n  for (let i = 0; i < next.length; i++) {\n    next[i] = key.charAt(i);\n  }\n\n  if (next.length < MAX_KEY_LEN) {\n    next.push(MIN_PUSH_CHAR);\n    return next.join('');\n  }\n\n  let i = next.length - 1;\n\n  while (i >= 0 && next[i] === MAX_PUSH_CHAR) {\n    i--;\n  }\n\n  // `successor` was called on the largest possible key, so return the\n  // MAX_NAME, which sorts larger than all keys.\n  if (i === -1) {\n    return MAX_NAME;\n  }\n\n  const source = next[i];\n  const sourcePlusOne = PUSH_CHARS.charAt(PUSH_CHARS.indexOf(source) + 1);\n  next[i] = sourcePlusOne;\n\n  return next.slice(0, i + 1).join('');\n};\n\n// `key` is assumed to be non-empty.\nexport const predecessor = function (key: string) {\n  if (key === '' + INTEGER_32_MIN) {\n    return MIN_NAME;\n  }\n  const keyAsInt: number = tryParseInt(key);\n  if (keyAsInt != null) {\n    return '' + (keyAsInt - 1);\n  }\n  const next = new Array(key.length);\n  for (let i = 0; i < next.length; i++) {\n    next[i] = key.charAt(i);\n  }\n  // If `key` ends in `MIN_PUSH_CHAR`, the largest key lexicographically\n  // smaller than `key`, is `key[0:key.length - 1]`. The next key smaller\n  // than that, `predecessor(predecessor(key))`, is\n  //\n  // `key[0:key.length - 2] + (key[key.length - 1] - 1) + \\\n  //   { MAX_PUSH_CHAR repeated MAX_KEY_LEN - (key.length - 1) times }\n  //\n  // analogous to increment/decrement for base-10 integers.\n  //\n  // This works because lexicographic comparison works character-by-character,\n  // using length as a tie-breaker if one key is a prefix of the other.\n  if (next[next.length - 1] === MIN_PUSH_CHAR) {\n    if (next.length === 1) {\n      // See https://firebase.google.com/docs/database/web/lists-of-data#orderbykey\n      return '' + INTEGER_32_MAX;\n    }\n    delete next[next.length - 1];\n    return next.join('');\n  }\n  // Replace the last character with it's immediate predecessor, and\n  // fill the suffix of the key with MAX_PUSH_CHAR. This is the\n  // lexicographically largest possible key smaller than `key`.\n  next[next.length - 1] = PUSH_CHARS.charAt(\n    PUSH_CHARS.indexOf(next[next.length - 1]) - 1\n  );\n  return next.join('') + MAX_PUSH_CHAR.repeat(MAX_KEY_LEN - next.length);\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { stringify } from '@firebase/util';\n\nimport { DataSnapshot as ExpDataSnapshot } from '../../api/Reference_impl';\nimport { Path } from '../util/Path';\n\nimport { EventRegistration } from './EventRegistration';\n\n/**\n * Encapsulates the data needed to raise an event\n * @interface\n */\nexport interface Event {\n  getPath(): Path;\n\n  getEventType(): string;\n\n  getEventRunner(): () => void;\n\n  toString(): string;\n}\n\n/**\n * One of the following strings: \"value\", \"child_added\", \"child_changed\",\n * \"child_removed\", or \"child_moved.\"\n */\nexport type EventType =\n  | 'value'\n  | 'child_added'\n  | 'child_changed'\n  | 'child_moved'\n  | 'child_removed';\n\n/**\n * Encapsulates the data needed to raise an event\n */\nexport class DataEvent implements Event {\n  /**\n   * @param eventType - One of: value, child_added, child_changed, child_moved, child_removed\n   * @param eventRegistration - The function to call to with the event data. User provided\n   * @param snapshot - The data backing the event\n   * @param prevName - Optional, the name of the previous child for child_* events.\n   */\n  constructor(\n    public eventType: EventType,\n    public eventRegistration: EventRegistration,\n    public snapshot: ExpDataSnapshot,\n    public prevName?: string | null\n  ) {}\n  getPath(): Path {\n    const ref = this.snapshot.ref;\n    if (this.eventType === 'value') {\n      return ref._path;\n    } else {\n      return ref.parent._path;\n    }\n  }\n  getEventType(): string {\n    return this.eventType;\n  }\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString(): string {\n    return (\n      this.getPath().toString() +\n      ':' +\n      this.eventType +\n      ':' +\n      stringify(this.snapshot.exportVal())\n    );\n  }\n}\n\nexport class CancelEvent implements Event {\n  constructor(\n    public eventRegistration: EventRegistration,\n    public error: Error,\n    public path: Path\n  ) {}\n  getPath(): Path {\n    return this.path;\n  }\n  getEventType(): string {\n    return 'cancel';\n  }\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString(): string {\n    return this.path.toString() + ':cancel';\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\nimport { DataSnapshot } from '../../api/Reference_impl';\nimport { Repo } from '../Repo';\nimport { Path } from '../util/Path';\n\nimport { Change } from './Change';\nimport { CancelEvent, Event } from './Event';\nimport { QueryParams } from './QueryParams';\n\n/**\n * A user callback. Callbacks issues from the Legacy SDK maintain references\n * to the original user-issued callbacks, which allows equality\n * comparison by reference even though this callbacks are wrapped before\n * they can be passed to the firebase@exp SDK.\n *\n * @internal\n */\nexport interface UserCallback {\n  (dataSnapshot: DataSnapshot, previousChildName?: string | null): unknown;\n  userCallback?: unknown;\n  context?: object | null;\n}\n\n/**\n * A wrapper class that converts events from the database@exp SDK to the legacy\n * Database SDK. Events are not converted directly as event registration relies\n * on reference comparison of the original user callback (see `matches()`) and\n * relies on equality of the legacy SDK's `context` object.\n */\nexport class CallbackContext {\n  constructor(\n    private readonly snapshotCallback: UserCallback,\n    private readonly cancelCallback?: (error: Error) => unknown\n  ) {}\n\n  onValue(\n    expDataSnapshot: DataSnapshot,\n    previousChildName?: string | null\n  ): void {\n    this.snapshotCallback.call(null, expDataSnapshot, previousChildName);\n  }\n\n  onCancel(error: Error): void {\n    assert(\n      this.hasCancelCallback,\n      'Raising a cancel event on a listener with no cancel callback'\n    );\n    return this.cancelCallback.call(null, error);\n  }\n\n  get hasCancelCallback(): boolean {\n    return !!this.cancelCallback;\n  }\n\n  matches(other: CallbackContext): boolean {\n    return (\n      this.snapshotCallback === other.snapshotCallback ||\n      (this.snapshotCallback.userCallback !== undefined &&\n        this.snapshotCallback.userCallback ===\n          other.snapshotCallback.userCallback &&\n        this.snapshotCallback.context === other.snapshotCallback.context)\n    );\n  }\n}\n\nexport interface QueryContext {\n  readonly _queryIdentifier: string;\n  readonly _queryObject: object;\n  readonly _repo: Repo;\n  readonly _path: Path;\n  readonly _queryParams: QueryParams;\n}\n\n/**\n * An EventRegistration is basically an event type ('value', 'child_added', etc.) and a callback\n * to be notified of that type of event.\n *\n * That said, it can also contain a cancel callback to be notified if the event is canceled.  And\n * currently, this code is organized around the idea that you would register multiple child_ callbacks\n * together, as a single EventRegistration.  Though currently we don't do that.\n */\nexport interface EventRegistration {\n  /**\n   * True if this container has a callback to trigger for this event type\n   */\n  respondsTo(eventType: string): boolean;\n\n  createEvent(change: Change, query: QueryContext): Event;\n\n  /**\n   * Given event data, return a function to trigger the user's callback\n   */\n  getEventRunner(eventData: Event): () => void;\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null;\n\n  matches(other: EventRegistration): boolean;\n\n  /**\n   * False basically means this is a \"dummy\" callback container being used as a sentinel\n   * to remove all callback containers of a particular type.  (e.g. if the user does\n   * ref.off('value') without specifying a specific callback).\n   *\n   * (TODO: Rework this, since it's hacky)\n   *\n   */\n  hasAnyCallback(): boolean;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, getModularInstance, Deferred } from '@firebase/util';\n\nimport {\n  Repo,\n  repoAddEventCallbackForQuery,\n  repoGetValue,\n  repoRemoveEventCallbackForQuery,\n  repoServerTime,\n  repoSetWithPriority,\n  repoUpdate\n} from '../core/Repo';\nimport { ChildrenNode } from '../core/snap/ChildrenNode';\nimport { Index } from '../core/snap/indexes/Index';\nimport { KEY_INDEX } from '../core/snap/indexes/KeyIndex';\nimport { PathIndex } from '../core/snap/indexes/PathIndex';\nimport { PRIORITY_INDEX } from '../core/snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../core/snap/indexes/ValueIndex';\nimport { Node } from '../core/snap/Node';\nimport { syncPointSetReferenceConstructor } from '../core/SyncPoint';\nimport { syncTreeSetReferenceConstructor } from '../core/SyncTree';\nimport { parseRepoInfo } from '../core/util/libs/parser';\nimport { nextPushId } from '../core/util/NextPushId';\nimport {\n  Path,\n  pathEquals,\n  pathGetBack,\n  pathGetFront,\n  pathChild,\n  pathParent,\n  pathToUrlEncodedString,\n  pathIsEmpty\n} from '../core/util/Path';\nimport {\n  fatal,\n  MAX_NAME,\n  MIN_NAME,\n  ObjectToUniqueKey\n} from '../core/util/util';\nimport {\n  isValidPriority,\n  validateFirebaseDataArg,\n  validateFirebaseMergeDataArg,\n  validateKey,\n  validatePathString,\n  validatePriority,\n  validateRootPathString,\n  validateUrl,\n  validateWritablePath\n} from '../core/util/validation';\nimport { Change } from '../core/view/Change';\nimport { CancelEvent, DataEvent, EventType } from '../core/view/Event';\nimport {\n  CallbackContext,\n  EventRegistration,\n  QueryContext,\n  UserCallback\n} from '../core/view/EventRegistration';\nimport {\n  QueryParams,\n  queryParamsEndAt,\n  queryParamsEndBefore,\n  queryParamsGetQueryObject,\n  queryParamsLimitToFirst,\n  queryParamsLimitToLast,\n  queryParamsOrderBy,\n  queryParamsStartAfter,\n  queryParamsStartAt\n} from '../core/view/QueryParams';\n\nimport { Database } from './Database';\nimport { OnDisconnect } from './OnDisconnect';\nimport {\n  ListenOptions,\n  Query as Query,\n  DatabaseReference,\n  Unsubscribe,\n  ThenableReference\n} from './Reference';\n\n/**\n * @internal\n */\nexport class QueryImpl implements Query, QueryContext {\n  /**\n   * @hideconstructor\n   */\n  constructor(\n    readonly _repo: Repo,\n    readonly _path: Path,\n    readonly _queryParams: QueryParams,\n    readonly _orderByCalled: boolean\n  ) {}\n\n  get key(): string | null {\n    if (pathIsEmpty(this._path)) {\n      return null;\n    } else {\n      return pathGetBack(this._path);\n    }\n  }\n\n  get ref(): DatabaseReference {\n    return new ReferenceImpl(this._repo, this._path);\n  }\n\n  get _queryIdentifier(): string {\n    const obj = queryParamsGetQueryObject(this._queryParams);\n    const id = ObjectToUniqueKey(obj);\n    return id === '{}' ? 'default' : id;\n  }\n\n  /**\n   * An object representation of the query parameters used by this Query.\n   */\n  get _queryObject(): object {\n    return queryParamsGetQueryObject(this._queryParams);\n  }\n\n  isEqual(other: QueryImpl | null): boolean {\n    other = getModularInstance(other);\n    if (!(other instanceof QueryImpl)) {\n      return false;\n    }\n\n    const sameRepo = this._repo === other._repo;\n    const samePath = pathEquals(this._path, other._path);\n    const sameQueryIdentifier =\n      this._queryIdentifier === other._queryIdentifier;\n\n    return sameRepo && samePath && sameQueryIdentifier;\n  }\n\n  toJSON(): string {\n    return this.toString();\n  }\n\n  toString(): string {\n    return this._repo.toString() + pathToUrlEncodedString(this._path);\n  }\n}\n\n/**\n * Validates that no other order by call has been made\n */\nfunction validateNoPreviousOrderByCall(query: QueryImpl, fnName: string) {\n  if (query._orderByCalled === true) {\n    throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n  }\n}\n\n/**\n * Validates start/end values for queries.\n */\nfunction validateQueryEndpoints(params: QueryParams) {\n  let startNode = null;\n  let endNode = null;\n  if (params.hasStart()) {\n    startNode = params.getIndexStartValue();\n  }\n  if (params.hasEnd()) {\n    endNode = params.getIndexEndValue();\n  }\n\n  if (params.getIndex() === KEY_INDEX) {\n    const tooManyArgsError =\n      'Query: When ordering by key, you may only pass one argument to ' +\n      'startAt(), endAt(), or equalTo().';\n    const wrongArgTypeError =\n      'Query: When ordering by key, the argument passed to startAt(), startAfter(), ' +\n      'endAt(), endBefore(), or equalTo() must be a string.';\n    if (params.hasStart()) {\n      const startName = params.getIndexStartName();\n      if (startName !== MIN_NAME) {\n        throw new Error(tooManyArgsError);\n      } else if (typeof startNode !== 'string') {\n        throw new Error(wrongArgTypeError);\n      }\n    }\n    if (params.hasEnd()) {\n      const endName = params.getIndexEndName();\n      if (endName !== MAX_NAME) {\n        throw new Error(tooManyArgsError);\n      } else if (typeof endNode !== 'string') {\n        throw new Error(wrongArgTypeError);\n      }\n    }\n  } else if (params.getIndex() === PRIORITY_INDEX) {\n    if (\n      (startNode != null && !isValidPriority(startNode)) ||\n      (endNode != null && !isValidPriority(endNode))\n    ) {\n      throw new Error(\n        'Query: When ordering by priority, the first argument passed to startAt(), ' +\n          'startAfter() endAt(), endBefore(), or equalTo() must be a valid priority value ' +\n          '(null, a number, or a string).'\n      );\n    }\n  } else {\n    assert(\n      params.getIndex() instanceof PathIndex ||\n        params.getIndex() === VALUE_INDEX,\n      'unknown index type.'\n    );\n    if (\n      (startNode != null && typeof startNode === 'object') ||\n      (endNode != null && typeof endNode === 'object')\n    ) {\n      throw new Error(\n        'Query: First argument passed to startAt(), startAfter(), endAt(), endBefore(), or ' +\n          'equalTo() cannot be an object.'\n      );\n    }\n  }\n}\n\n/**\n * Validates that limit* has been called with the correct combination of parameters\n */\nfunction validateLimit(params: QueryParams) {\n  if (\n    params.hasStart() &&\n    params.hasEnd() &&\n    params.hasLimit() &&\n    !params.hasAnchoredLimit()\n  ) {\n    throw new Error(\n      \"Query: Can't combine startAt(), startAfter(), endAt(), endBefore(), and limit(). Use \" +\n        'limitToFirst() or limitToLast() instead.'\n    );\n  }\n}\n/**\n * @internal\n */\nexport class ReferenceImpl extends QueryImpl implements DatabaseReference {\n  /** @hideconstructor */\n  constructor(repo: Repo, path: Path) {\n    super(repo, path, new QueryParams(), false);\n  }\n\n  get parent(): ReferenceImpl | null {\n    const parentPath = pathParent(this._path);\n    return parentPath === null\n      ? null\n      : new ReferenceImpl(this._repo, parentPath);\n  }\n\n  get root(): ReferenceImpl {\n    let ref: ReferenceImpl = this;\n    while (ref.parent !== null) {\n      ref = ref.parent;\n    }\n    return ref;\n  }\n}\n\n/**\n * A `DataSnapshot` contains data from a Database location.\n *\n * Any time you read data from the Database, you receive the data as a\n * `DataSnapshot`. A `DataSnapshot` is passed to the event callbacks you attach\n * with `on()` or `once()`. You can extract the contents of the snapshot as a\n * JavaScript object by calling the `val()` method. Alternatively, you can\n * traverse into the snapshot by calling `child()` to return child snapshots\n * (which you could then call `val()` on).\n *\n * A `DataSnapshot` is an efficiently generated, immutable copy of the data at\n * a Database location. It cannot be modified and will never change (to modify\n * data, you always call the `set()` method on a `Reference` directly).\n */\nexport class DataSnapshot {\n  /**\n   * @param _node - A SnapshotNode to wrap.\n   * @param ref - The location this snapshot came from.\n   * @param _index - The iteration order for this snapshot\n   * @hideconstructor\n   */\n  constructor(\n    readonly _node: Node,\n    /**\n     * The location of this DataSnapshot.\n     */\n    readonly ref: DatabaseReference,\n    readonly _index: Index\n  ) {}\n\n  /**\n   * Gets the priority value of the data in this `DataSnapshot`.\n   *\n   * Applications need not use priority but can order collections by\n   * ordinary properties (see\n   * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data |Sorting and filtering data}\n   * ).\n   */\n  get priority(): string | number | null {\n    // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n    return this._node.getPriority().val() as string | number | null;\n  }\n\n  /**\n   * The key (last part of the path) of the location of this `DataSnapshot`.\n   *\n   * The last token in a Database location is considered its key. For example,\n   * \"ada\" is the key for the /users/ada/ node. Accessing the key on any\n   * `DataSnapshot` will return the key for the location that generated it.\n   * However, accessing the key on the root URL of a Database will return\n   * `null`.\n   */\n  get key(): string | null {\n    return this.ref.key;\n  }\n\n  /** Returns the number of child properties of this `DataSnapshot`. */\n  get size(): number {\n    return this._node.numChildren();\n  }\n\n  /**\n   * Gets another `DataSnapshot` for the location at the specified relative path.\n   *\n   * Passing a relative path to the `child()` method of a DataSnapshot returns\n   * another `DataSnapshot` for the location at the specified relative path. The\n   * relative path can either be a simple child name (for example, \"ada\") or a\n   * deeper, slash-separated path (for example, \"ada/name/first\"). If the child\n   * location has no data, an empty `DataSnapshot` (that is, a `DataSnapshot`\n   * whose value is `null`) is returned.\n   *\n   * @param path - A relative path to the location of child data.\n   */\n  child(path: string): DataSnapshot {\n    const childPath = new Path(path);\n    const childRef = child(this.ref, path);\n    return new DataSnapshot(\n      this._node.getChild(childPath),\n      childRef,\n      PRIORITY_INDEX\n    );\n  }\n  /**\n   * Returns true if this `DataSnapshot` contains any data. It is slightly more\n   * efficient than using `snapshot.val() !== null`.\n   */\n  exists(): boolean {\n    return !this._node.isEmpty();\n  }\n\n  /**\n   * Exports the entire contents of the DataSnapshot as a JavaScript object.\n   *\n   * The `exportVal()` method is similar to `val()`, except priority information\n   * is included (if available), making it suitable for backing up your data.\n   *\n   * @returns The DataSnapshot's contents as a JavaScript value (Object,\n   *   Array, string, number, boolean, or `null`).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  exportVal(): any {\n    return this._node.val(true);\n  }\n\n  /**\n   * Enumerates the top-level children in the `IteratedDataSnapshot`.\n   *\n   * Because of the way JavaScript objects work, the ordering of data in the\n   * JavaScript object returned by `val()` is not guaranteed to match the\n   * ordering on the server nor the ordering of `onChildAdded()` events. That is\n   * where `forEach()` comes in handy. It guarantees the children of a\n   * `DataSnapshot` will be iterated in their query order.\n   *\n   * If no explicit `orderBy*()` method is used, results are returned\n   * ordered by key (unless priorities are used, in which case, results are\n   * returned by priority).\n   *\n   * @param action - A function that will be called for each child DataSnapshot.\n   * The callback can return true to cancel further enumeration.\n   * @returns true if enumeration was canceled due to your callback returning\n   * true.\n   */\n  forEach(action: (child: IteratedDataSnapshot) => boolean | void): boolean {\n    if (this._node.isLeafNode()) {\n      return false;\n    }\n\n    const childrenNode = this._node as ChildrenNode;\n    // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\n    return !!childrenNode.forEachChild(this._index, (key, node) => {\n      return action(\n        new DataSnapshot(node, child(this.ref, key), PRIORITY_INDEX)\n      );\n    });\n  }\n\n  /**\n   * Returns true if the specified child path has (non-null) data.\n   *\n   * @param path - A relative path to the location of a potential child.\n   * @returns `true` if data exists at the specified child path; else\n   *  `false`.\n   */\n  hasChild(path: string): boolean {\n    const childPath = new Path(path);\n    return !this._node.getChild(childPath).isEmpty();\n  }\n\n  /**\n   * Returns whether or not the `DataSnapshot` has any non-`null` child\n   * properties.\n   *\n   * You can use `hasChildren()` to determine if a `DataSnapshot` has any\n   * children. If it does, you can enumerate them using `forEach()`. If it\n   * doesn't, then either this snapshot contains a primitive value (which can be\n   * retrieved with `val()`) or it is empty (in which case, `val()` will return\n   * `null`).\n   *\n   * @returns true if this snapshot has any children; else false.\n   */\n  hasChildren(): boolean {\n    if (this._node.isLeafNode()) {\n      return false;\n    } else {\n      return !this._node.isEmpty();\n    }\n  }\n\n  /**\n   * Returns a JSON-serializable representation of this object.\n   */\n  toJSON(): object | null {\n    return this.exportVal();\n  }\n\n  /**\n   * Extracts a JavaScript value from a `DataSnapshot`.\n   *\n   * Depending on the data in a `DataSnapshot`, the `val()` method may return a\n   * scalar type (string, number, or boolean), an array, or an object. It may\n   * also return null, indicating that the `DataSnapshot` is empty (contains no\n   * data).\n   *\n   * @returns The DataSnapshot's contents as a JavaScript value (Object,\n   *   Array, string, number, boolean, or `null`).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  val(): any {\n    return this._node.val();\n  }\n}\n\n/**\n * Represents a child snapshot of a `Reference` that is being iterated over. The key will never be undefined.\n */\nexport interface IteratedDataSnapshot extends DataSnapshot {\n  key: string; // key of the location of this snapshot.\n}\n\n/**\n *\n * Returns a `Reference` representing the location in the Database\n * corresponding to the provided path. If no path is provided, the `Reference`\n * will point to the root of the Database.\n *\n * @param db - The database instance to obtain a reference for.\n * @param path - Optional path representing the location the returned\n *   `Reference` will point. If not provided, the returned `Reference` will\n *   point to the root of the Database.\n * @returns If a path is provided, a `Reference`\n *   pointing to the provided path. Otherwise, a `Reference` pointing to the\n *   root of the Database.\n */\nexport function ref(db: Database, path?: string): DatabaseReference {\n  db = getModularInstance(db);\n  db._checkNotDeleted('ref');\n  return path !== undefined ? child(db._root, path) : db._root;\n}\n\n/**\n * Returns a `Reference` representing the location in the Database\n * corresponding to the provided Firebase URL.\n *\n * An exception is thrown if the URL is not a valid Firebase Database URL or it\n * has a different domain than the current `Database` instance.\n *\n * Note that all query parameters (`orderBy`, `limitToLast`, etc.) are ignored\n * and are not applied to the returned `Reference`.\n *\n * @param db - The database instance to obtain a reference for.\n * @param url - The Firebase URL at which the returned `Reference` will\n *   point.\n * @returns A `Reference` pointing to the provided\n *   Firebase URL.\n */\nexport function refFromURL(db: Database, url: string): DatabaseReference {\n  db = getModularInstance(db);\n  db._checkNotDeleted('refFromURL');\n  const parsedURL = parseRepoInfo(url, db._repo.repoInfo_.nodeAdmin);\n  validateUrl('refFromURL', parsedURL);\n\n  const repoInfo = parsedURL.repoInfo;\n  if (\n    !db._repo.repoInfo_.isCustomHost() &&\n    repoInfo.host !== db._repo.repoInfo_.host\n  ) {\n    fatal(\n      'refFromURL' +\n        ': Host name does not match the current database: ' +\n        '(found ' +\n        repoInfo.host +\n        ' but expected ' +\n        db._repo.repoInfo_.host +\n        ')'\n    );\n  }\n\n  return ref(db, parsedURL.path.toString());\n}\n/**\n * Gets a `Reference` for the location at the specified relative path.\n *\n * The relative path can either be a simple child name (for example, \"ada\") or\n * a deeper slash-separated path (for example, \"ada/name/first\").\n *\n * @param parent - The parent location.\n * @param path - A relative path from this location to the desired child\n *   location.\n * @returns The specified child location.\n */\nexport function child(\n  parent: DatabaseReference,\n  path: string\n): DatabaseReference {\n  parent = getModularInstance(parent);\n  if (pathGetFront(parent._path) === null) {\n    validateRootPathString('child', 'path', path, false);\n  } else {\n    validatePathString('child', 'path', path, false);\n  }\n  return new ReferenceImpl(parent._repo, pathChild(parent._path, path));\n}\n\n/**\n * Returns an `OnDisconnect` object - see\n * {@link https://firebase.google.com/docs/database/web/offline-capabilities | Enabling Offline Capabilities in JavaScript}\n * for more information on how to use it.\n *\n * @param ref - The reference to add OnDisconnect triggers for.\n */\nexport function onDisconnect(ref: DatabaseReference): OnDisconnect {\n  ref = getModularInstance(ref) as ReferenceImpl;\n  return new OnDisconnect(ref._repo, ref._path);\n}\n\nexport interface ThenableReferenceImpl\n  extends ReferenceImpl,\n    Pick<Promise<ReferenceImpl>, 'then' | 'catch'> {}\n\n/**\n * Generates a new child location using a unique key and returns its\n * `Reference`.\n *\n * This is the most common pattern for adding data to a collection of items.\n *\n * If you provide a value to `push()`, the value is written to the\n * generated location. If you don't pass a value, nothing is written to the\n * database and the child remains empty (but you can use the `Reference`\n * elsewhere).\n *\n * The unique keys generated by `push()` are ordered by the current time, so the\n * resulting list of items is chronologically sorted. The keys are also\n * designed to be unguessable (they contain 72 random bits of entropy).\n *\n * See {@link https://firebase.google.com/docs/database/web/lists-of-data#append_to_a_list_of_data | Append to a list of data}.\n * See {@link https://firebase.googleblog.com/2015/02/the-2120-ways-to-ensure-unique_68.html | The 2^120 Ways to Ensure Unique Identifiers}.\n *\n * @param parent - The parent location.\n * @param value - Optional value to be written at the generated location.\n * @returns Combined `Promise` and `Reference`; resolves when write is complete,\n * but can be used immediately as the `Reference` to the child location.\n */\nexport function push(\n  parent: DatabaseReference,\n  value?: unknown\n): ThenableReference {\n  parent = getModularInstance(parent);\n  validateWritablePath('push', parent._path);\n  validateFirebaseDataArg('push', value, parent._path, true);\n  const now = repoServerTime(parent._repo);\n  const name = nextPushId(now);\n\n  // push() returns a ThennableReference whose promise is fulfilled with a\n  // regular Reference. We use child() to create handles to two different\n  // references. The first is turned into a ThennableReference below by adding\n  // then() and catch() methods and is used as the return value of push(). The\n  // second remains a regular Reference and is used as the fulfilled value of\n  // the first ThennableReference.\n  const thenablePushRef: Partial<ThenableReferenceImpl> = child(\n    parent,\n    name\n  ) as ReferenceImpl;\n  const pushRef = child(parent, name) as ReferenceImpl;\n\n  let promise: Promise<ReferenceImpl>;\n  if (value != null) {\n    promise = set(pushRef, value).then(() => pushRef);\n  } else {\n    promise = Promise.resolve(pushRef);\n  }\n\n  thenablePushRef.then = promise.then.bind(promise);\n  thenablePushRef.catch = promise.then.bind(promise, undefined);\n  return thenablePushRef as ThenableReferenceImpl;\n}\n\n/**\n * Removes the data at this Database location.\n *\n * Any data at child locations will also be deleted.\n *\n * The effect of the remove will be visible immediately and the corresponding\n * event 'value' will be triggered. Synchronization of the remove to the\n * Firebase servers will also be started, and the returned Promise will resolve\n * when complete. If provided, the onComplete callback will be called\n * asynchronously after synchronization has finished.\n *\n * @param ref - The location to remove.\n * @returns Resolves when remove on server is complete.\n */\nexport function remove(ref: DatabaseReference): Promise<void> {\n  validateWritablePath('remove', ref._path);\n  return set(ref, null);\n}\n\n/**\n * Writes data to this Database location.\n *\n * This will overwrite any data at this location and all child locations.\n *\n * The effect of the write will be visible immediately, and the corresponding\n * events (\"value\", \"child_added\", etc.) will be triggered. Synchronization of\n * the data to the Firebase servers will also be started, and the returned\n * Promise will resolve when complete. If provided, the `onComplete` callback\n * will be called asynchronously after synchronization has finished.\n *\n * Passing `null` for the new value is equivalent to calling `remove()`; namely,\n * all data at this location and all child locations will be deleted.\n *\n * `set()` will remove any priority stored at this location, so if priority is\n * meant to be preserved, you need to use `setWithPriority()` instead.\n *\n * Note that modifying data with `set()` will cancel any pending transactions\n * at that location, so extreme care should be taken if mixing `set()` and\n * `transaction()` to modify the same data.\n *\n * A single `set()` will generate a single \"value\" event at the location where\n * the `set()` was performed.\n *\n * @param ref - The location to write to.\n * @param value - The value to be written (string, number, boolean, object,\n *   array, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function set(ref: DatabaseReference, value: unknown): Promise<void> {\n  ref = getModularInstance(ref);\n  validateWritablePath('set', ref._path);\n  validateFirebaseDataArg('set', value, ref._path, false);\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    ref._path,\n    value,\n    /*priority=*/ null,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Sets a priority for the data at this Database location.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data | Sorting and filtering data}\n * ).\n *\n * @param ref - The location to write to.\n * @param priority - The priority to be written (string, number, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function setPriority(\n  ref: DatabaseReference,\n  priority: string | number | null\n): Promise<void> {\n  ref = getModularInstance(ref);\n  validateWritablePath('setPriority', ref._path);\n  validatePriority('setPriority', priority, false);\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    pathChild(ref._path, '.priority'),\n    priority,\n    null,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Writes data the Database location. Like `set()` but also specifies the\n * priority for that data.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data | Sorting and filtering data}\n * ).\n *\n * @param ref - The location to write to.\n * @param value - The value to be written (string, number, boolean, object,\n *   array, or null).\n * @param priority - The priority to be written (string, number, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function setWithPriority(\n  ref: DatabaseReference,\n  value: unknown,\n  priority: string | number | null\n): Promise<void> {\n  validateWritablePath('setWithPriority', ref._path);\n  validateFirebaseDataArg('setWithPriority', value, ref._path, false);\n  validatePriority('setWithPriority', priority, false);\n  if (ref.key === '.length' || ref.key === '.keys') {\n    throw 'setWithPriority failed: ' + ref.key + ' is a read-only object.';\n  }\n\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    ref._path,\n    value,\n    priority,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Writes multiple values to the Database at once.\n *\n * The `values` argument contains multiple property-value pairs that will be\n * written to the Database together. Each child property can either be a simple\n * property (for example, \"name\") or a relative path (for example,\n * \"name/first\") from the current location to the data to update.\n *\n * As opposed to the `set()` method, `update()` can be use to selectively update\n * only the referenced properties at the current location (instead of replacing\n * all the child properties at the current location).\n *\n * The effect of the write will be visible immediately, and the corresponding\n * events ('value', 'child_added', etc.) will be triggered. Synchronization of\n * the data to the Firebase servers will also be started, and the returned\n * Promise will resolve when complete. If provided, the `onComplete` callback\n * will be called asynchronously after synchronization has finished.\n *\n * A single `update()` will generate a single \"value\" event at the location\n * where the `update()` was performed, regardless of how many children were\n * modified.\n *\n * Note that modifying data with `update()` will cancel any pending\n * transactions at that location, so extreme care should be taken if mixing\n * `update()` and `transaction()` to modify the same data.\n *\n * Passing `null` to `update()` will remove the data at this location.\n *\n * See\n * {@link https://firebase.googleblog.com/2015/09/introducing-multi-location-updates-and_86.html | Introducing multi-location updates and more}.\n *\n * @param ref - The location to write to.\n * @param values - Object containing multiple values.\n * @returns Resolves when update on server is complete.\n */\nexport function update(ref: DatabaseReference, values: object): Promise<void> {\n  validateFirebaseMergeDataArg('update', values, ref._path, false);\n  const deferred = new Deferred<void>();\n  repoUpdate(\n    ref._repo,\n    ref._path,\n    values as Record<string, unknown>,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Gets the most up-to-date result for this query.\n *\n * @param query - The query to run.\n * @returns A `Promise` which resolves to the resulting DataSnapshot if a value is\n * available, or rejects if the client is unable to return a value (e.g., if the\n * server is unreachable and there is nothing cached).\n */\nexport function get(query: Query): Promise<DataSnapshot> {\n  query = getModularInstance(query) as QueryImpl;\n  const callbackContext = new CallbackContext(() => {});\n  const container = new ValueEventRegistration(callbackContext);\n  return repoGetValue(query._repo, query, container).then(node => {\n    return new DataSnapshot(\n      node,\n      new ReferenceImpl(query._repo, query._path),\n      query._queryParams.getIndex()\n    );\n  });\n}\n/**\n * Represents registration for 'value' events.\n */\nexport class ValueEventRegistration implements EventRegistration {\n  constructor(private callbackContext: CallbackContext) {}\n\n  respondsTo(eventType: string): boolean {\n    return eventType === 'value';\n  }\n\n  createEvent(change: Change, query: QueryContext): DataEvent {\n    const index = query._queryParams.getIndex();\n    return new DataEvent(\n      'value',\n      this,\n      new DataSnapshot(\n        change.snapshotNode,\n        new ReferenceImpl(query._repo, query._path),\n        index\n      )\n    );\n  }\n\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    if (eventData.getEventType() === 'cancel') {\n      return () =>\n        this.callbackContext.onCancel((eventData as CancelEvent).error);\n    } else {\n      return () =>\n        this.callbackContext.onValue((eventData as DataEvent).snapshot, null);\n    }\n  }\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  matches(other: EventRegistration): boolean {\n    if (!(other instanceof ValueEventRegistration)) {\n      return false;\n    } else if (!other.callbackContext || !this.callbackContext) {\n      // If no callback specified, we consider it to match any callback.\n      return true;\n    } else {\n      return other.callbackContext.matches(this.callbackContext);\n    }\n  }\n\n  hasAnyCallback(): boolean {\n    return this.callbackContext !== null;\n  }\n}\n\n/**\n * Represents the registration of a child_x event.\n */\nexport class ChildEventRegistration implements EventRegistration {\n  constructor(\n    private eventType: string,\n    private callbackContext: CallbackContext | null\n  ) {}\n\n  respondsTo(eventType: string): boolean {\n    let eventToCheck =\n      eventType === 'children_added' ? 'child_added' : eventType;\n    eventToCheck =\n      eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n    return this.eventType === eventToCheck;\n  }\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  createEvent(change: Change, query: QueryContext): DataEvent {\n    assert(change.childName != null, 'Child events should have a childName.');\n    const childRef = child(\n      new ReferenceImpl(query._repo, query._path),\n      change.childName\n    );\n    const index = query._queryParams.getIndex();\n    return new DataEvent(\n      change.type as EventType,\n      this,\n      new DataSnapshot(change.snapshotNode, childRef, index),\n      change.prevName\n    );\n  }\n\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    if (eventData.getEventType() === 'cancel') {\n      return () =>\n        this.callbackContext.onCancel((eventData as CancelEvent).error);\n    } else {\n      return () =>\n        this.callbackContext.onValue(\n          (eventData as DataEvent).snapshot,\n          (eventData as DataEvent).prevName\n        );\n    }\n  }\n\n  matches(other: EventRegistration): boolean {\n    if (other instanceof ChildEventRegistration) {\n      return (\n        this.eventType === other.eventType &&\n        (!this.callbackContext ||\n          !other.callbackContext ||\n          this.callbackContext.matches(other.callbackContext))\n      );\n    }\n\n    return false;\n  }\n\n  hasAnyCallback(): boolean {\n    return !!this.callbackContext;\n  }\n}\n\nfunction addEventListener(\n  query: Query,\n  eventType: EventType,\n  callback: UserCallback,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n) {\n  let cancelCallback: ((error: Error) => unknown) | undefined;\n  if (typeof cancelCallbackOrListenOptions === 'object') {\n    cancelCallback = undefined;\n    options = cancelCallbackOrListenOptions;\n  }\n  if (typeof cancelCallbackOrListenOptions === 'function') {\n    cancelCallback = cancelCallbackOrListenOptions;\n  }\n\n  if (options && options.onlyOnce) {\n    const userCallback = callback;\n    const onceCallback: UserCallback = (dataSnapshot, previousChildName) => {\n      repoRemoveEventCallbackForQuery(query._repo, query, container);\n      userCallback(dataSnapshot, previousChildName);\n    };\n    onceCallback.userCallback = callback.userCallback;\n    onceCallback.context = callback.context;\n    callback = onceCallback;\n  }\n\n  const callbackContext = new CallbackContext(\n    callback,\n    cancelCallback || undefined\n  );\n  const container =\n    eventType === 'value'\n      ? new ValueEventRegistration(callbackContext)\n      : new ChildEventRegistration(eventType, callbackContext);\n  repoAddEventCallbackForQuery(query._repo, query, container);\n  return () => repoRemoveEventCallbackForQuery(query._repo, query, container);\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'value',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName?: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_added',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_changed',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_moved',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_removed',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\nexport { EventType };\n\n/**\n * Detaches a callback previously attached with the corresponding `on*()` (`onValue`, `onChildAdded`) listener.\n * Note: This is not the recommended way to remove a listener. Instead, please use the returned callback function from\n * the respective `on*` callbacks.\n *\n * Detach a callback previously attached with `on*()`. Calling `off()` on a parent listener\n * will not automatically remove listeners registered on child nodes, `off()`\n * must also be called on any child listeners to remove the callback.\n *\n * If a callback is not specified, all callbacks for the specified eventType\n * will be removed. Similarly, if no eventType is specified, all callbacks\n * for the `Reference` will be removed.\n *\n * Individual listeners can also be removed by invoking their unsubscribe\n * callbacks.\n *\n * @param query - The query that the listener was registered with.\n * @param eventType - One of the following strings: \"value\", \"child_added\",\n * \"child_changed\", \"child_removed\", or \"child_moved.\" If omitted, all callbacks\n * for the `Reference` will be removed.\n * @param callback - The callback function that was passed to `on()` or\n * `undefined` to remove all callbacks.\n */\nexport function off(\n  query: Query,\n  eventType?: EventType,\n  callback?: (\n    snapshot: DataSnapshot,\n    previousChildName?: string | null\n  ) => unknown\n): void {\n  let container: EventRegistration | null = null;\n  const expCallback = callback ? new CallbackContext(callback) : null;\n  if (eventType === 'value') {\n    container = new ValueEventRegistration(expCallback);\n  } else if (eventType) {\n    container = new ChildEventRegistration(eventType, expCallback);\n  }\n  repoRemoveEventCallbackForQuery(query._repo, query, container);\n}\n\n/** Describes the different query constraints available in this SDK. */\nexport type QueryConstraintType =\n  | 'endAt'\n  | 'endBefore'\n  | 'startAt'\n  | 'startAfter'\n  | 'limitToFirst'\n  | 'limitToLast'\n  | 'orderByChild'\n  | 'orderByKey'\n  | 'orderByPriority'\n  | 'orderByValue'\n  | 'equalTo';\n\n/**\n * A `QueryConstraint` is used to narrow the set of documents returned by a\n * Database query. `QueryConstraint`s are created by invoking {@link endAt},\n * {@link endBefore}, {@link startAt}, {@link startAfter}, {@link\n * limitToFirst}, {@link limitToLast}, {@link orderByChild},\n * {@link orderByChild}, {@link orderByKey} , {@link orderByPriority} ,\n * {@link orderByValue}  or {@link equalTo} and\n * can then be passed to {@link query} to create a new query instance that\n * also contains this `QueryConstraint`.\n */\nexport abstract class QueryConstraint {\n  /** The type of this query constraints */\n  abstract readonly type: QueryConstraintType;\n\n  /**\n   * Takes the provided `Query` and returns a copy of the `Query` with this\n   * `QueryConstraint` applied.\n   */\n  abstract _apply<T>(query: QueryImpl): QueryImpl;\n}\n\nclass QueryEndAtConstraint extends QueryConstraint {\n  readonly type = 'endAt';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('endAt', this._value, query._path, true);\n    const newParams = queryParamsEndAt(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'endAt: Starting point was already set (by another call to endAt, ' +\n          'endBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified ending point.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The ending point is inclusive, so children with exactly the specified value\n * will be included in the query. The optional key argument can be used to\n * further limit the range of the query. If it is specified, then children that\n * have exactly the specified value must also have a key name less than or equal\n * to the specified key.\n *\n * You can read more about `endAt()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to end at. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to end at, among the children with the previously\n * specified priority. This argument is only allowed if ordering by child,\n * value, or priority.\n */\nexport function endAt(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('endAt', 'key', key, true);\n  return new QueryEndAtConstraint(value, key);\n}\n\nclass QueryEndBeforeConstraint extends QueryConstraint {\n  readonly type = 'endBefore';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('endBefore', this._value, query._path, false);\n    const newParams = queryParamsEndBefore(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'endBefore: Starting point was already set (by another call to endAt, ' +\n          'endBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified ending point (exclusive).\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The ending point is exclusive. If only a value is provided, children\n * with a value less than the specified value will be included in the query.\n * If a key is specified, then children must have a value less than or equal\n * to the specified value and a key name less than the specified key.\n *\n * @param value - The value to end before. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to end before, among the children with the\n * previously specified priority. This argument is only allowed if ordering by\n * child, value, or priority.\n */\nexport function endBefore(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('endBefore', 'key', key, true);\n  return new QueryEndBeforeConstraint(value, key);\n}\n\nclass QueryStartAtConstraint extends QueryConstraint {\n  readonly type = 'startAt';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('startAt', this._value, query._path, true);\n    const newParams = queryParamsStartAt(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'startAt: Starting point was already set (by another call to startAt, ' +\n          'startBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified starting point.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The starting point is inclusive, so children with exactly the specified value\n * will be included in the query. The optional key argument can be used to\n * further limit the range of the query. If it is specified, then children that\n * have exactly the specified value must also have a key name greater than or\n * equal to the specified key.\n *\n * You can read more about `startAt()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to start at. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start at. This argument is only allowed if\n * ordering by child, value, or priority.\n */\nexport function startAt(\n  value: number | string | boolean | null = null,\n  key?: string\n): QueryConstraint {\n  validateKey('startAt', 'key', key, true);\n  return new QueryStartAtConstraint(value, key);\n}\n\nclass QueryStartAfterConstraint extends QueryConstraint {\n  readonly type = 'startAfter';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('startAfter', this._value, query._path, false);\n    const newParams = queryParamsStartAfter(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'startAfter: Starting point was already set (by another call to startAt, ' +\n          'startAfter, or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified starting point (exclusive).\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The starting point is exclusive. If only a value is provided, children\n * with a value greater than the specified value will be included in the query.\n * If a key is specified, then children must have a value greater than or equal\n * to the specified value and a a key name greater than the specified key.\n *\n * @param value - The value to start after. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start after. This argument is only allowed if\n * ordering by child, value, or priority.\n */\nexport function startAfter(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('startAfter', 'key', key, true);\n  return new QueryStartAfterConstraint(value, key);\n}\n\nclass QueryLimitToFirstConstraint extends QueryConstraint {\n  readonly type = 'limitToFirst';\n\n  constructor(private readonly _limit: number) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    if (query._queryParams.hasLimit()) {\n      throw new Error(\n        'limitToFirst: Limit was already set (by another call to limitToFirst ' +\n          'or limitToLast).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      queryParamsLimitToFirst(query._queryParams, this._limit),\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that if limited to the first specific number\n * of children.\n *\n * The `limitToFirst()` method is used to set a maximum number of children to be\n * synced for a given callback. If we set a limit of 100, we will initially only\n * receive up to 100 `child_added` events. If we have fewer than 100 messages\n * stored in our Database, a `child_added` event will fire for each message.\n * However, if we have over 100 messages, we will only receive a `child_added`\n * event for the first 100 ordered messages. As items change, we will receive\n * `child_removed` events for each item that drops out of the active list so\n * that the total number stays at 100.\n *\n * You can read more about `limitToFirst()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param limit - The maximum number of nodes to include in this query.\n */\nexport function limitToFirst(limit: number): QueryConstraint {\n  if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n    throw new Error('limitToFirst: First argument must be a positive integer.');\n  }\n  return new QueryLimitToFirstConstraint(limit);\n}\n\nclass QueryLimitToLastConstraint extends QueryConstraint {\n  readonly type = 'limitToLast';\n\n  constructor(private readonly _limit: number) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    if (query._queryParams.hasLimit()) {\n      throw new Error(\n        'limitToLast: Limit was already set (by another call to limitToFirst ' +\n          'or limitToLast).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      queryParamsLimitToLast(query._queryParams, this._limit),\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that is limited to return only the last\n * specified number of children.\n *\n * The `limitToLast()` method is used to set a maximum number of children to be\n * synced for a given callback. If we set a limit of 100, we will initially only\n * receive up to 100 `child_added` events. If we have fewer than 100 messages\n * stored in our Database, a `child_added` event will fire for each message.\n * However, if we have over 100 messages, we will only receive a `child_added`\n * event for the last 100 ordered messages. As items change, we will receive\n * `child_removed` events for each item that drops out of the active list so\n * that the total number stays at 100.\n *\n * You can read more about `limitToLast()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param limit - The maximum number of nodes to include in this query.\n */\nexport function limitToLast(limit: number): QueryConstraint {\n  if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n    throw new Error('limitToLast: First argument must be a positive integer.');\n  }\n\n  return new QueryLimitToLastConstraint(limit);\n}\n\nclass QueryOrderByChildConstraint extends QueryConstraint {\n  readonly type = 'orderByChild';\n\n  constructor(private readonly _path: string) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByChild');\n    const parsedPath = new Path(this._path);\n    if (pathIsEmpty(parsedPath)) {\n      throw new Error(\n        'orderByChild: cannot pass in empty path. Use orderByValue() instead.'\n      );\n    }\n    const index = new PathIndex(parsedPath);\n    const newParams = queryParamsOrderBy(query._queryParams, index);\n    validateQueryEndpoints(newParams);\n\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by the specified child key.\n *\n * Queries can only order by one key at a time. Calling `orderByChild()`\n * multiple times on the same query is an error.\n *\n * Firebase queries allow you to order your data by any child key on the fly.\n * However, if you know in advance what your indexes will be, you can define\n * them via the .indexOn rule in your Security Rules for better performance. See\n * the{@link https://firebase.google.com/docs/database/security/indexing-data}\n * rule for more information.\n *\n * You can read more about `orderByChild()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n *\n * @param path - The path to order by.\n */\nexport function orderByChild(path: string): QueryConstraint {\n  if (path === '$key') {\n    throw new Error(\n      'orderByChild: \"$key\" is invalid.  Use orderByKey() instead.'\n    );\n  } else if (path === '$priority') {\n    throw new Error(\n      'orderByChild: \"$priority\" is invalid.  Use orderByPriority() instead.'\n    );\n  } else if (path === '$value') {\n    throw new Error(\n      'orderByChild: \"$value\" is invalid.  Use orderByValue() instead.'\n    );\n  }\n  validatePathString('orderByChild', 'path', path, false);\n  return new QueryOrderByChildConstraint(path);\n}\n\nclass QueryOrderByKeyConstraint extends QueryConstraint {\n  readonly type = 'orderByKey';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByKey');\n    const newParams = queryParamsOrderBy(query._queryParams, KEY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by the key.\n *\n * Sorts the results of a query by their (ascending) key values.\n *\n * You can read more about `orderByKey()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n */\nexport function orderByKey(): QueryConstraint {\n  return new QueryOrderByKeyConstraint();\n}\n\nclass QueryOrderByPriorityConstraint extends QueryConstraint {\n  readonly type = 'orderByPriority';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByPriority');\n    const newParams = queryParamsOrderBy(query._queryParams, PRIORITY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by priority.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}\n * for alternatives to priority.\n */\nexport function orderByPriority(): QueryConstraint {\n  return new QueryOrderByPriorityConstraint();\n}\n\nclass QueryOrderByValueConstraint extends QueryConstraint {\n  readonly type = 'orderByValue';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByValue');\n    const newParams = queryParamsOrderBy(query._queryParams, VALUE_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by value.\n *\n * If the children of a query are all scalar values (string, number, or\n * boolean), you can order the results by their (ascending) values.\n *\n * You can read more about `orderByValue()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n */\nexport function orderByValue(): QueryConstraint {\n  return new QueryOrderByValueConstraint();\n}\n\nclass QueryEqualToValueConstraint extends QueryConstraint {\n  readonly type = 'equalTo';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('equalTo', this._value, query._path, false);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'equalTo: Starting point was already set (by another call to startAt/startAfter or ' +\n          'equalTo).'\n      );\n    }\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'equalTo: Ending point was already set (by another call to endAt/endBefore or ' +\n          'equalTo).'\n      );\n    }\n    return new QueryEndAtConstraint(this._value, this._key)._apply(\n      new QueryStartAtConstraint(this._value, this._key)._apply(query)\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` that includes children that match the specified\n * value.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The optional key argument can be used to further limit the range of the\n * query. If it is specified, then children that have exactly the specified\n * value must also have exactly the specified key as their key name. This can be\n * used to filter result sets with many matches for the same value.\n *\n * You can read more about `equalTo()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to match for. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start at, among the children with the\n * previously specified priority. This argument is only allowed if ordering by\n * child, value, or priority.\n */\nexport function equalTo(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('equalTo', 'key', key, true);\n  return new QueryEqualToValueConstraint(value, key);\n}\n\n/**\n * Creates a new immutable instance of `Query` that is extended to also include\n * additional query constraints.\n *\n * @param query - The Query instance to use as a base for the new constraints.\n * @param queryConstraints - The list of `QueryConstraint`s to apply.\n * @throws if any of the provided query constraints cannot be combined with the\n * existing or new constraints.\n */\nexport function query(\n  query: Query,\n  ...queryConstraints: QueryConstraint[]\n): Query {\n  let queryImpl = getModularInstance(query) as QueryImpl;\n  for (const constraint of queryConstraints) {\n    queryImpl = constraint._apply(queryImpl);\n  }\n  return queryImpl;\n}\n\n/**\n * Define reference constructor in various modules\n *\n * We are doing this here to avoid several circular\n * dependency issues\n */\nsyncPointSetReferenceConstructor(ReferenceImpl);\nsyncTreeSetReferenceConstructor(ReferenceImpl);\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// eslint-disable-next-line import/no-extraneous-dependencies\nimport {\n  _FirebaseService,\n  _getProvider,\n  FirebaseApp,\n  getApp\n} from '@firebase/app';\nimport { AppCheckInternalComponentName } from '@firebase/app-check-interop-types';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\nimport {\n  getModularInstance,\n  createMockUserToken,\n  EmulatorMockTokenOptions,\n  getDefaultEmulatorHostnameAndPort\n} from '@firebase/util';\n\nimport { AppCheckTokenProvider } from '../core/AppCheckTokenProvider';\nimport {\n  AuthTokenProvider,\n  EmulatorTokenProvider,\n  FirebaseAuthTokenProvider\n} from '../core/AuthTokenProvider';\nimport { Repo, repoInterrupt, repoResume, repoStart } from '../core/Repo';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { parseRepoInfo } from '../core/util/libs/parser';\nimport { newEmptyPath, pathIsEmpty } from '../core/util/Path';\nimport {\n  warn,\n  fatal,\n  log,\n  enableLogging as enableLoggingImpl\n} from '../core/util/util';\nimport { validateUrl } from '../core/util/validation';\nimport { BrowserPollConnection } from '../realtime/BrowserPollConnection';\nimport { TransportManager } from '../realtime/TransportManager';\nimport { WebSocketConnection } from '../realtime/WebSocketConnection';\n\nimport { ReferenceImpl } from './Reference_impl';\n\nexport { EmulatorMockTokenOptions } from '@firebase/util';\n/**\n * This variable is also defined in the firebase Node.js Admin SDK. Before\n * modifying this definition, consult the definition in:\n *\n * https://github.com/firebase/firebase-admin-node\n *\n * and make sure the two are consistent.\n */\nconst FIREBASE_DATABASE_EMULATOR_HOST_VAR = 'FIREBASE_DATABASE_EMULATOR_HOST';\n\n/**\n * Creates and caches `Repo` instances.\n */\nconst repos: {\n  [appName: string]: {\n    [dbUrl: string]: Repo;\n  };\n} = {};\n\n/**\n * If true, any new `Repo` will be created to use `ReadonlyRestClient` (for testing purposes).\n */\nlet useRestClient = false;\n\n/**\n * Update an existing `Repo` in place to point to a new host/port.\n */\nfunction repoManagerApplyEmulatorSettings(\n  repo: Repo,\n  host: string,\n  port: number,\n  tokenProvider?: AuthTokenProvider\n): void {\n  repo.repoInfo_ = new RepoInfo(\n    `${host}:${port}`,\n    /* secure= */ false,\n    repo.repoInfo_.namespace,\n    repo.repoInfo_.webSocketOnly,\n    repo.repoInfo_.nodeAdmin,\n    repo.repoInfo_.persistenceKey,\n    repo.repoInfo_.includeNamespaceInQueryParams,\n    /*isUsingEmulator=*/ true\n  );\n\n  if (tokenProvider) {\n    repo.authTokenProvider_ = tokenProvider;\n  }\n}\n\n/**\n * This function should only ever be called to CREATE a new database instance.\n * @internal\n */\nexport function repoManagerDatabaseFromApp(\n  app: FirebaseApp,\n  authProvider: Provider<FirebaseAuthInternalName>,\n  appCheckProvider?: Provider<AppCheckInternalComponentName>,\n  url?: string,\n  nodeAdmin?: boolean\n): Database {\n  let dbUrl: string | undefined = url || app.options.databaseURL;\n  if (dbUrl === undefined) {\n    if (!app.options.projectId) {\n      fatal(\n        \"Can't determine Firebase Database URL. Be sure to include \" +\n          ' a Project ID when calling firebase.initializeApp().'\n      );\n    }\n\n    log('Using default host for project ', app.options.projectId);\n    dbUrl = `${app.options.projectId}-default-rtdb.firebaseio.com`;\n  }\n\n  let parsedUrl = parseRepoInfo(dbUrl, nodeAdmin);\n  let repoInfo = parsedUrl.repoInfo;\n\n  let isEmulator: boolean;\n\n  let dbEmulatorHost: string | undefined = undefined;\n  if (typeof process !== 'undefined' && process.env) {\n    dbEmulatorHost = process.env[FIREBASE_DATABASE_EMULATOR_HOST_VAR];\n  }\n\n  if (dbEmulatorHost) {\n    isEmulator = true;\n    dbUrl = `http://${dbEmulatorHost}?ns=${repoInfo.namespace}`;\n    parsedUrl = parseRepoInfo(dbUrl, nodeAdmin);\n    repoInfo = parsedUrl.repoInfo;\n  } else {\n    isEmulator = !parsedUrl.repoInfo.secure;\n  }\n\n  const authTokenProvider =\n    nodeAdmin && isEmulator\n      ? new EmulatorTokenProvider(EmulatorTokenProvider.OWNER)\n      : new FirebaseAuthTokenProvider(app.name, app.options, authProvider);\n\n  validateUrl('Invalid Firebase Database URL', parsedUrl);\n  if (!pathIsEmpty(parsedUrl.path)) {\n    fatal(\n      'Database URL must point to the root of a Firebase Database ' +\n        '(not including a child path).'\n    );\n  }\n\n  const repo = repoManagerCreateRepo(\n    repoInfo,\n    app,\n    authTokenProvider,\n    new AppCheckTokenProvider(app.name, appCheckProvider)\n  );\n  return new Database(repo, app);\n}\n\n/**\n * Remove the repo and make sure it is disconnected.\n *\n */\nfunction repoManagerDeleteRepo(repo: Repo, appName: string): void {\n  const appRepos = repos[appName];\n  // This should never happen...\n  if (!appRepos || appRepos[repo.key] !== repo) {\n    fatal(`Database ${appName}(${repo.repoInfo_}) has already been deleted.`);\n  }\n  repoInterrupt(repo);\n  delete appRepos[repo.key];\n}\n\n/**\n * Ensures a repo doesn't already exist and then creates one using the\n * provided app.\n *\n * @param repoInfo - The metadata about the Repo\n * @returns The Repo object for the specified server / repoName.\n */\nfunction repoManagerCreateRepo(\n  repoInfo: RepoInfo,\n  app: FirebaseApp,\n  authTokenProvider: AuthTokenProvider,\n  appCheckProvider: AppCheckTokenProvider\n): Repo {\n  let appRepos = repos[app.name];\n\n  if (!appRepos) {\n    appRepos = {};\n    repos[app.name] = appRepos;\n  }\n\n  let repo = appRepos[repoInfo.toURLString()];\n  if (repo) {\n    fatal(\n      'Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.'\n    );\n  }\n  repo = new Repo(repoInfo, useRestClient, authTokenProvider, appCheckProvider);\n  appRepos[repoInfo.toURLString()] = repo;\n\n  return repo;\n}\n\n/**\n * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n */\nexport function repoManagerForceRestClient(forceRestClient: boolean): void {\n  useRestClient = forceRestClient;\n}\n\n/**\n * Class representing a Firebase Realtime Database.\n */\nexport class Database implements _FirebaseService {\n  /** Represents a `Database` instance. */\n  readonly 'type' = 'database';\n\n  /** Track if the instance has been used (root or repo accessed) */\n  _instanceStarted: boolean = false;\n\n  /** Backing state for root_ */\n  private _rootInternal?: ReferenceImpl;\n\n  /** @hideconstructor */\n  constructor(\n    public _repoInternal: Repo,\n    /** The {@link @firebase/app#FirebaseApp} associated with this Realtime Database instance. */\n    readonly app: FirebaseApp\n  ) {}\n\n  get _repo(): Repo {\n    if (!this._instanceStarted) {\n      repoStart(\n        this._repoInternal,\n        this.app.options.appId,\n        this.app.options['databaseAuthVariableOverride']\n      );\n      this._instanceStarted = true;\n    }\n    return this._repoInternal;\n  }\n\n  get _root(): ReferenceImpl {\n    if (!this._rootInternal) {\n      this._rootInternal = new ReferenceImpl(this._repo, newEmptyPath());\n    }\n    return this._rootInternal;\n  }\n\n  _delete(): Promise<void> {\n    if (this._rootInternal !== null) {\n      repoManagerDeleteRepo(this._repo, this.app.name);\n      this._repoInternal = null;\n      this._rootInternal = null;\n    }\n    return Promise.resolve();\n  }\n\n  _checkNotDeleted(apiName: string) {\n    if (this._rootInternal === null) {\n      fatal('Cannot call ' + apiName + ' on a deleted database.');\n    }\n  }\n}\n\nfunction checkTransportInit() {\n  if (TransportManager.IS_TRANSPORT_INITIALIZED) {\n    warn(\n      'Transport has already been initialized. Please call this function before calling ref or setting up a listener'\n    );\n  }\n}\n\n/**\n * Force the use of websockets instead of longPolling.\n */\nexport function forceWebSockets() {\n  checkTransportInit();\n  BrowserPollConnection.forceDisallow();\n}\n\n/**\n * Force the use of longPolling instead of websockets. This will be ignored if websocket protocol is used in databaseURL.\n */\nexport function forceLongPolling() {\n  checkTransportInit();\n  WebSocketConnection.forceDisallow();\n  BrowserPollConnection.forceAllow();\n}\n\n/**\n * Returns the instance of the Realtime Database SDK that is associated with the provided\n * {@link @firebase/app#FirebaseApp}. Initializes a new instance with default settings if\n * no instance exists or if the existing instance uses a custom database URL.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned Realtime\n * Database instance is associated with.\n * @param url - The URL of the Realtime Database instance to connect to. If not\n * provided, the SDK connects to the default instance of the Firebase App.\n * @returns The `Database` instance of the provided app.\n */\nexport function getDatabase(\n  app: FirebaseApp = getApp(),\n  url?: string\n): Database {\n  const db = _getProvider(app, 'database').getImmediate({\n    identifier: url\n  }) as Database;\n  if (!db._instanceStarted) {\n    const emulator = getDefaultEmulatorHostnameAndPort('database');\n    if (emulator) {\n      connectDatabaseEmulator(db, ...emulator);\n    }\n  }\n  return db;\n}\n\n/**\n * Modify the provided instance to communicate with the Realtime Database\n * emulator.\n *\n * <p>Note: This method must be called before performing any other operation.\n *\n * @param db - The instance to modify.\n * @param host - The emulator host (ex: localhost)\n * @param port - The emulator port (ex: 8080)\n * @param options.mockUserToken - the mock auth token to use for unit testing Security Rules\n */\nexport function connectDatabaseEmulator(\n  db: Database,\n  host: string,\n  port: number,\n  options: {\n    mockUserToken?: EmulatorMockTokenOptions | string;\n  } = {}\n): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('useEmulator');\n  if (db._instanceStarted) {\n    fatal(\n      'Cannot call useEmulator() after instance has already been initialized.'\n    );\n  }\n\n  const repo = db._repoInternal;\n  let tokenProvider: EmulatorTokenProvider | undefined = undefined;\n  if (repo.repoInfo_.nodeAdmin) {\n    if (options.mockUserToken) {\n      fatal(\n        'mockUserToken is not supported by the Admin SDK. For client access with mock users, please use the \"firebase\" package instead of \"firebase-admin\".'\n      );\n    }\n    tokenProvider = new EmulatorTokenProvider(EmulatorTokenProvider.OWNER);\n  } else if (options.mockUserToken) {\n    const token =\n      typeof options.mockUserToken === 'string'\n        ? options.mockUserToken\n        : createMockUserToken(options.mockUserToken, db.app.options.projectId);\n    tokenProvider = new EmulatorTokenProvider(token);\n  }\n\n  // Modify the repo to apply emulator settings\n  repoManagerApplyEmulatorSettings(repo, host, port, tokenProvider);\n}\n\n/**\n * Disconnects from the server (all Database operations will be completed\n * offline).\n *\n * The client automatically maintains a persistent connection to the Database\n * server, which will remain active indefinitely and reconnect when\n * disconnected. However, the `goOffline()` and `goOnline()` methods may be used\n * to control the client connection in cases where a persistent connection is\n * undesirable.\n *\n * While offline, the client will no longer receive data updates from the\n * Database. However, all Database operations performed locally will continue to\n * immediately fire events, allowing your application to continue behaving\n * normally. Additionally, each operation performed locally will automatically\n * be queued and retried upon reconnection to the Database server.\n *\n * To reconnect to the Database and begin receiving remote events, see\n * `goOnline()`.\n *\n * @param db - The instance to disconnect.\n */\nexport function goOffline(db: Database): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOffline');\n  repoInterrupt(db._repo);\n}\n\n/**\n * Reconnects to the server and synchronizes the offline Database state\n * with the server state.\n *\n * This method should be used after disabling the active connection with\n * `goOffline()`. Once reconnected, the client will transmit the proper data\n * and fire the appropriate events so that your client \"catches up\"\n * automatically.\n *\n * @param db - The instance to reconnect.\n */\nexport function goOnline(db: Database): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOnline');\n  repoResume(db._repo);\n}\n\n/**\n * Logs debugging information to the console.\n *\n * @param enabled - Enables logging if `true`, disables logging if `false`.\n * @param persistent - Remembers the logging state between page refreshes if\n * `true`.\n */\nexport function enableLogging(enabled: boolean, persistent?: boolean);\n\n/**\n * Logs debugging information to the console.\n *\n * @param logger - A custom logger function to control how things get logged.\n */\nexport function enableLogging(logger: (message: string) => unknown);\n\nexport function enableLogging(\n  logger: boolean | ((message: string) => unknown),\n  persistent?: boolean\n): void {\n  enableLoggingImpl(logger, persistent);\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// eslint-disable-next-line import/no-extraneous-dependencies\nimport {\n  _registerComponent,\n  registerVersion,\n  SDK_VERSION\n} from '@firebase/app';\nimport { Component, ComponentType } from '@firebase/component';\n\nimport { name, version } from '../package.json';\nimport { setSDKVersion } from '../src/core/version';\n\nimport { repoManagerDatabaseFromApp } from './api/Database';\n\nexport function registerDatabase(variant?: string): void {\n  setSDKVersion(SDK_VERSION);\n  _registerComponent(\n    new Component(\n      'database',\n      (container, { instanceIdentifier: url }) => {\n        const app = container.getProvider('app').getImmediate()!;\n        const authProvider = container.getProvider('auth-internal');\n        const appCheckProvider = container.getProvider('app-check-internal');\n        return repoManagerDatabaseFromApp(\n          app,\n          authProvider,\n          appCheckProvider,\n          url\n        );\n      },\n      ComponentType.PUBLIC\n    ).setMultipleInstances(true)\n  );\n  registerVersion(name, version, variant);\n  // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation\n  registerVersion(name, version, '__BUILD_TARGET__');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { PersistentConnection } from '../core/PersistentConnection';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { Connection } from '../realtime/Connection';\n\nimport { repoManagerForceRestClient } from './Database';\n\nexport const DataConnection = PersistentConnection;\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).simpleListen = function (\n  pathString: string,\n  onComplete: (a: unknown) => void\n) {\n  this.sendRequest('q', { p: pathString }, onComplete);\n};\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).echo = function (\n  data: unknown,\n  onEcho: (a: unknown) => void\n) {\n  this.sendRequest('echo', { d: data }, onEcho);\n};\n\n// RealTimeConnection properties that we use in tests.\nexport const RealTimeConnection = Connection;\n\n/**\n * @internal\n */\nexport const hijackHash = function (newHash: () => string) {\n  const oldPut = PersistentConnection.prototype.put;\n  PersistentConnection.prototype.put = function (\n    pathString,\n    data,\n    onComplete,\n    hash\n  ) {\n    if (hash !== undefined) {\n      hash = newHash();\n    }\n    oldPut.call(this, pathString, data, onComplete, hash);\n  };\n  return function () {\n    PersistentConnection.prototype.put = oldPut;\n  };\n};\n\nexport const ConnectionTarget = RepoInfo;\n\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n * @internal\n */\nexport const forceRestClient = function (forceRestClient: boolean) {\n  repoManagerForceRestClient(forceRestClient);\n};\n","/**\n * Firebase Realtime Database\n *\n * @packageDocumentation\n */\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Database } from './api/Database';\nimport { registerDatabase } from './register';\n\nexport * from './api';\n\nregisterDatabase();\n\ndeclare module '@firebase/component' {\n  interface NameServiceMapping {\n    'database': Database;\n  }\n}\n","/*! js-cookie v3.0.5 | MIT */\n/* eslint-disable no-var */\nfunction assign (target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i];\n    for (var key in source) {\n      target[key] = source[key];\n    }\n  }\n  return target\n}\n/* eslint-enable no-var */\n\n/* eslint-disable no-var */\nvar defaultConverter = {\n  read: function (value) {\n    if (value[0] === '\"') {\n      value = value.slice(1, -1);\n    }\n    return value.replace(/(%[\\dA-F]{2})+/gi, decodeURIComponent)\n  },\n  write: function (value) {\n    return encodeURIComponent(value).replace(\n      /%(2[346BF]|3[AC-F]|40|5[BDE]|60|7[BCD])/g,\n      decodeURIComponent\n    )\n  }\n};\n/* eslint-enable no-var */\n\n/* eslint-disable no-var */\n\nfunction init (converter, defaultAttributes) {\n  function set (name, value, attributes) {\n    if (typeof document === 'undefined') {\n      return\n    }\n\n    attributes = assign({}, defaultAttributes, attributes);\n\n    if (typeof attributes.expires === 'number') {\n      attributes.expires = new Date(Date.now() + attributes.expires * 864e5);\n    }\n    if (attributes.expires) {\n      attributes.expires = attributes.expires.toUTCString();\n    }\n\n    name = encodeURIComponent(name)\n      .replace(/%(2[346B]|5E|60|7C)/g, decodeURIComponent)\n      .replace(/[()]/g, escape);\n\n    var stringifiedAttributes = '';\n    for (var attributeName in attributes) {\n      if (!attributes[attributeName]) {\n        continue\n      }\n\n      stringifiedAttributes += '; ' + attributeName;\n\n      if (attributes[attributeName] === true) {\n        continue\n      }\n\n      // Considers RFC 6265 section 5.2:\n      // ...\n      // 3.  If the remaining unparsed-attributes contains a %x3B (\";\")\n      //     character:\n      // Consume the characters of the unparsed-attributes up to,\n      // not including, the first %x3B (\";\") character.\n      // ...\n      stringifiedAttributes += '=' + attributes[attributeName].split(';')[0];\n    }\n\n    return (document.cookie =\n      name + '=' + converter.write(value, name) + stringifiedAttributes)\n  }\n\n  function get (name) {\n    if (typeof document === 'undefined' || (arguments.length && !name)) {\n      return\n    }\n\n    // To prevent the for loop in the first place assign an empty array\n    // in case there are no cookies at all.\n    var cookies = document.cookie ? document.cookie.split('; ') : [];\n    var jar = {};\n    for (var i = 0; i < cookies.length; i++) {\n      var parts = cookies[i].split('=');\n      var value = parts.slice(1).join('=');\n\n      try {\n        var found = decodeURIComponent(parts[0]);\n        jar[found] = converter.read(value, found);\n\n        if (name === found) {\n          break\n        }\n      } catch (e) {}\n    }\n\n    return name ? jar[name] : jar\n  }\n\n  return Object.create(\n    {\n      set,\n      get,\n      remove: function (name, attributes) {\n        set(\n          name,\n          '',\n          assign({}, attributes, {\n            expires: -1\n          })\n        );\n      },\n      withAttributes: function (attributes) {\n        return init(this.converter, assign({}, this.attributes, attributes))\n      },\n      withConverter: function (converter) {\n        return init(assign({}, this.converter, converter), this.attributes)\n      }\n    },\n    {\n      attributes: { value: Object.freeze(defaultAttributes) },\n      converter: { value: Object.freeze(converter) }\n    }\n  )\n}\n\nvar api = init(defaultConverter, { path: '/' });\n/* eslint-enable no-var */\n\nexport { api as default };\n","/*!\n  * vue-router v4.2.5\n  * (c) 2023 Eduardo San Martin Morote\n  * @license MIT\n  */\nimport { getCurrentInstance, inject, onUnmounted, onDeactivated, onActivated, computed, unref, watchEffect, defineComponent, reactive, h, provide, ref, watch, shallowRef, shallowReactive, nextTick } from 'vue';\nimport { setupDevtoolsPlugin } from '@vue/devtools-api';\n\nconst isBrowser = typeof window !== 'undefined';\n\nfunction isESModule(obj) {\n    return obj.__esModule || obj[Symbol.toStringTag] === 'Module';\n}\nconst assign = Object.assign;\nfunction applyToParams(fn, params) {\n    const newParams = {};\n    for (const key in params) {\n        const value = params[key];\n        newParams[key] = isArray(value)\n            ? value.map(fn)\n            : fn(value);\n    }\n    return newParams;\n}\nconst noop = () => { };\n/**\n * Typesafe alternative to Array.isArray\n * https://github.com/microsoft/TypeScript/pull/48228\n */\nconst isArray = Array.isArray;\n\nfunction warn(msg) {\n    // avoid using ...args as it breaks in older Edge builds\n    const args = Array.from(arguments).slice(1);\n    console.warn.apply(console, ['[Vue Router warn]: ' + msg].concat(args));\n}\n\nconst TRAILING_SLASH_RE = /\\/$/;\nconst removeTrailingSlash = (path) => path.replace(TRAILING_SLASH_RE, '');\n/**\n * Transforms a URI into a normalized history location\n *\n * @param parseQuery\n * @param location - URI to normalize\n * @param currentLocation - current absolute location. Allows resolving relative\n * paths. Must start with `/`. Defaults to `/`\n * @returns a normalized history location\n */\nfunction parseURL(parseQuery, location, currentLocation = '/') {\n    let path, query = {}, searchString = '', hash = '';\n    // Could use URL and URLSearchParams but IE 11 doesn't support it\n    // TODO: move to new URL()\n    const hashPos = location.indexOf('#');\n    let searchPos = location.indexOf('?');\n    // the hash appears before the search, so it's not part of the search string\n    if (hashPos < searchPos && hashPos >= 0) {\n        searchPos = -1;\n    }\n    if (searchPos > -1) {\n        path = location.slice(0, searchPos);\n        searchString = location.slice(searchPos + 1, hashPos > -1 ? hashPos : location.length);\n        query = parseQuery(searchString);\n    }\n    if (hashPos > -1) {\n        path = path || location.slice(0, hashPos);\n        // keep the # character\n        hash = location.slice(hashPos, location.length);\n    }\n    // no search and no query\n    path = resolveRelativePath(path != null ? path : location, currentLocation);\n    // empty path means a relative query or hash `?foo=f`, `#thing`\n    return {\n        fullPath: path + (searchString && '?') + searchString + hash,\n        path,\n        query,\n        hash,\n    };\n}\n/**\n * Stringifies a URL object\n *\n * @param stringifyQuery\n * @param location\n */\nfunction stringifyURL(stringifyQuery, location) {\n    const query = location.query ? stringifyQuery(location.query) : '';\n    return location.path + (query && '?') + query + (location.hash || '');\n}\n/**\n * Strips off the base from the beginning of a location.pathname in a non-case-sensitive way.\n *\n * @param pathname - location.pathname\n * @param base - base to strip off\n */\nfunction stripBase(pathname, base) {\n    // no base or base is not found at the beginning\n    if (!base || !pathname.toLowerCase().startsWith(base.toLowerCase()))\n        return pathname;\n    return pathname.slice(base.length) || '/';\n}\n/**\n * Checks if two RouteLocation are equal. This means that both locations are\n * pointing towards the same {@link RouteRecord} and that all `params`, `query`\n * parameters and `hash` are the same\n *\n * @param stringifyQuery - A function that takes a query object of type LocationQueryRaw and returns a string representation of it.\n * @param a - first {@link RouteLocation}\n * @param b - second {@link RouteLocation}\n */\nfunction isSameRouteLocation(stringifyQuery, a, b) {\n    const aLastIndex = a.matched.length - 1;\n    const bLastIndex = b.matched.length - 1;\n    return (aLastIndex > -1 &&\n        aLastIndex === bLastIndex &&\n        isSameRouteRecord(a.matched[aLastIndex], b.matched[bLastIndex]) &&\n        isSameRouteLocationParams(a.params, b.params) &&\n        stringifyQuery(a.query) === stringifyQuery(b.query) &&\n        a.hash === b.hash);\n}\n/**\n * Check if two `RouteRecords` are equal. Takes into account aliases: they are\n * considered equal to the `RouteRecord` they are aliasing.\n *\n * @param a - first {@link RouteRecord}\n * @param b - second {@link RouteRecord}\n */\nfunction isSameRouteRecord(a, b) {\n    // since the original record has an undefined value for aliasOf\n    // but all aliases point to the original record, this will always compare\n    // the original record\n    return (a.aliasOf || a) === (b.aliasOf || b);\n}\nfunction isSameRouteLocationParams(a, b) {\n    if (Object.keys(a).length !== Object.keys(b).length)\n        return false;\n    for (const key in a) {\n        if (!isSameRouteLocationParamsValue(a[key], b[key]))\n            return false;\n    }\n    return true;\n}\nfunction isSameRouteLocationParamsValue(a, b) {\n    return isArray(a)\n        ? isEquivalentArray(a, b)\n        : isArray(b)\n            ? isEquivalentArray(b, a)\n            : a === b;\n}\n/**\n * Check if two arrays are the same or if an array with one single entry is the\n * same as another primitive value. Used to check query and parameters\n *\n * @param a - array of values\n * @param b - array of values or a single value\n */\nfunction isEquivalentArray(a, b) {\n    return isArray(b)\n        ? a.length === b.length && a.every((value, i) => value === b[i])\n        : a.length === 1 && a[0] === b;\n}\n/**\n * Resolves a relative path that starts with `.`.\n *\n * @param to - path location we are resolving\n * @param from - currentLocation.path, should start with `/`\n */\nfunction resolveRelativePath(to, from) {\n    if (to.startsWith('/'))\n        return to;\n    if ((process.env.NODE_ENV !== 'production') && !from.startsWith('/')) {\n        warn(`Cannot resolve a relative location without an absolute path. Trying to resolve \"${to}\" from \"${from}\". It should look like \"/${from}\".`);\n        return to;\n    }\n    if (!to)\n        return from;\n    const fromSegments = from.split('/');\n    const toSegments = to.split('/');\n    const lastToSegment = toSegments[toSegments.length - 1];\n    // make . and ./ the same (../ === .., ../../ === ../..)\n    // this is the same behavior as new URL()\n    if (lastToSegment === '..' || lastToSegment === '.') {\n        toSegments.push('');\n    }\n    let position = fromSegments.length - 1;\n    let toPosition;\n    let segment;\n    for (toPosition = 0; toPosition < toSegments.length; toPosition++) {\n        segment = toSegments[toPosition];\n        // we stay on the same position\n        if (segment === '.')\n            continue;\n        // go up in the from array\n        if (segment === '..') {\n            // we can't go below zero, but we still need to increment toPosition\n            if (position > 1)\n                position--;\n            // continue\n        }\n        // we reached a non-relative path, we stop here\n        else\n            break;\n    }\n    return (fromSegments.slice(0, position).join('/') +\n        '/' +\n        toSegments\n            // ensure we use at least the last element in the toSegments\n            .slice(toPosition - (toPosition === toSegments.length ? 1 : 0))\n            .join('/'));\n}\n\nvar NavigationType;\n(function (NavigationType) {\n    NavigationType[\"pop\"] = \"pop\";\n    NavigationType[\"push\"] = \"push\";\n})(NavigationType || (NavigationType = {}));\nvar NavigationDirection;\n(function (NavigationDirection) {\n    NavigationDirection[\"back\"] = \"back\";\n    NavigationDirection[\"forward\"] = \"forward\";\n    NavigationDirection[\"unknown\"] = \"\";\n})(NavigationDirection || (NavigationDirection = {}));\n/**\n * Starting location for Histories\n */\nconst START = '';\n// Generic utils\n/**\n * Normalizes a base by removing any trailing slash and reading the base tag if\n * present.\n *\n * @param base - base to normalize\n */\nfunction normalizeBase(base) {\n    if (!base) {\n        if (isBrowser) {\n            // respect <base> tag\n            const baseEl = document.querySelector('base');\n            base = (baseEl && baseEl.getAttribute('href')) || '/';\n            // strip full URL origin\n            base = base.replace(/^\\w+:\\/\\/[^\\/]+/, '');\n        }\n        else {\n            base = '/';\n        }\n    }\n    // ensure leading slash when it was removed by the regex above avoid leading\n    // slash with hash because the file could be read from the disk like file://\n    // and the leading slash would cause problems\n    if (base[0] !== '/' && base[0] !== '#')\n        base = '/' + base;\n    // remove the trailing slash so all other method can just do `base + fullPath`\n    // to build an href\n    return removeTrailingSlash(base);\n}\n// remove any character before the hash\nconst BEFORE_HASH_RE = /^[^#]+#/;\nfunction createHref(base, location) {\n    return base.replace(BEFORE_HASH_RE, '#') + location;\n}\n\nfunction getElementPosition(el, offset) {\n    const docRect = document.documentElement.getBoundingClientRect();\n    const elRect = el.getBoundingClientRect();\n    return {\n        behavior: offset.behavior,\n        left: elRect.left - docRect.left - (offset.left || 0),\n        top: elRect.top - docRect.top - (offset.top || 0),\n    };\n}\nconst computeScrollPosition = () => ({\n    left: window.pageXOffset,\n    top: window.pageYOffset,\n});\nfunction scrollToPosition(position) {\n    let scrollToOptions;\n    if ('el' in position) {\n        const positionEl = position.el;\n        const isIdSelector = typeof positionEl === 'string' && positionEl.startsWith('#');\n        /**\n         * `id`s can accept pretty much any characters, including CSS combinators\n         * like `>` or `~`. It's still possible to retrieve elements using\n         * `document.getElementById('~')` but it needs to be escaped when using\n         * `document.querySelector('#\\\\~')` for it to be valid. The only\n         * requirements for `id`s are them to be unique on the page and to not be\n         * empty (`id=\"\"`). Because of that, when passing an id selector, it should\n         * be properly escaped for it to work with `querySelector`. We could check\n         * for the id selector to be simple (no CSS combinators `+ >~`) but that\n         * would make things inconsistent since they are valid characters for an\n         * `id` but would need to be escaped when using `querySelector`, breaking\n         * their usage and ending up in no selector returned. Selectors need to be\n         * escaped:\n         *\n         * - `#1-thing` becomes `#\\31 -thing`\n         * - `#with~symbols` becomes `#with\\\\~symbols`\n         *\n         * - More information about  the topic can be found at\n         *   https://mathiasbynens.be/notes/html5-id-class.\n         * - Practical example: https://mathiasbynens.be/demo/html5-id\n         */\n        if ((process.env.NODE_ENV !== 'production') && typeof position.el === 'string') {\n            if (!isIdSelector || !document.getElementById(position.el.slice(1))) {\n                try {\n                    const foundEl = document.querySelector(position.el);\n                    if (isIdSelector && foundEl) {\n                        warn(`The selector \"${position.el}\" should be passed as \"el: document.querySelector('${position.el}')\" because it starts with \"#\".`);\n                        // return to avoid other warnings\n                        return;\n                    }\n                }\n                catch (err) {\n                    warn(`The selector \"${position.el}\" is invalid. If you are using an id selector, make sure to escape it. You can find more information about escaping characters in selectors at https://mathiasbynens.be/notes/css-escapes or use CSS.escape (https://developer.mozilla.org/en-US/docs/Web/API/CSS/escape).`);\n                    // return to avoid other warnings\n                    return;\n                }\n            }\n        }\n        const el = typeof positionEl === 'string'\n            ? isIdSelector\n                ? document.getElementById(positionEl.slice(1))\n                : document.querySelector(positionEl)\n            : positionEl;\n        if (!el) {\n            (process.env.NODE_ENV !== 'production') &&\n                warn(`Couldn't find element using selector \"${position.el}\" returned by scrollBehavior.`);\n            return;\n        }\n        scrollToOptions = getElementPosition(el, position);\n    }\n    else {\n        scrollToOptions = position;\n    }\n    if ('scrollBehavior' in document.documentElement.style)\n        window.scrollTo(scrollToOptions);\n    else {\n        window.scrollTo(scrollToOptions.left != null ? scrollToOptions.left : window.pageXOffset, scrollToOptions.top != null ? scrollToOptions.top : window.pageYOffset);\n    }\n}\nfunction getScrollKey(path, delta) {\n    const position = history.state ? history.state.position - delta : -1;\n    return position + path;\n}\nconst scrollPositions = new Map();\nfunction saveScrollPosition(key, scrollPosition) {\n    scrollPositions.set(key, scrollPosition);\n}\nfunction getSavedScrollPosition(key) {\n    const scroll = scrollPositions.get(key);\n    // consume it so it's not used again\n    scrollPositions.delete(key);\n    return scroll;\n}\n// TODO: RFC about how to save scroll position\n/**\n * ScrollBehavior instance used by the router to compute and restore the scroll\n * position when navigating.\n */\n// export interface ScrollHandler<ScrollPositionEntry extends HistoryStateValue, ScrollPosition extends ScrollPositionEntry> {\n//   // returns a scroll position that can be saved in history\n//   compute(): ScrollPositionEntry\n//   // can take an extended ScrollPositionEntry\n//   scroll(position: ScrollPosition): void\n// }\n// export const scrollHandler: ScrollHandler<ScrollPosition> = {\n//   compute: computeScroll,\n//   scroll: scrollToPosition,\n// }\n\nlet createBaseLocation = () => location.protocol + '//' + location.host;\n/**\n * Creates a normalized history location from a window.location object\n * @param base - The base path\n * @param location - The window.location object\n */\nfunction createCurrentLocation(base, location) {\n    const { pathname, search, hash } = location;\n    // allows hash bases like #, /#, #/, #!, #!/, /#!/, or even /folder#end\n    const hashPos = base.indexOf('#');\n    if (hashPos > -1) {\n        let slicePos = hash.includes(base.slice(hashPos))\n            ? base.slice(hashPos).length\n            : 1;\n        let pathFromHash = hash.slice(slicePos);\n        // prepend the starting slash to hash so the url starts with /#\n        if (pathFromHash[0] !== '/')\n            pathFromHash = '/' + pathFromHash;\n        return stripBase(pathFromHash, '');\n    }\n    const path = stripBase(pathname, base);\n    return path + search + hash;\n}\nfunction useHistoryListeners(base, historyState, currentLocation, replace) {\n    let listeners = [];\n    let teardowns = [];\n    // TODO: should it be a stack? a Dict. Check if the popstate listener\n    // can trigger twice\n    let pauseState = null;\n    const popStateHandler = ({ state, }) => {\n        const to = createCurrentLocation(base, location);\n        const from = currentLocation.value;\n        const fromState = historyState.value;\n        let delta = 0;\n        if (state) {\n            currentLocation.value = to;\n            historyState.value = state;\n            // ignore the popstate and reset the pauseState\n            if (pauseState && pauseState === from) {\n                pauseState = null;\n                return;\n            }\n            delta = fromState ? state.position - fromState.position : 0;\n        }\n        else {\n            replace(to);\n        }\n        // Here we could also revert the navigation by calling history.go(-delta)\n        // this listener will have to be adapted to not trigger again and to wait for the url\n        // to be updated before triggering the listeners. Some kind of validation function would also\n        // need to be passed to the listeners so the navigation can be accepted\n        // call all listeners\n        listeners.forEach(listener => {\n            listener(currentLocation.value, from, {\n                delta,\n                type: NavigationType.pop,\n                direction: delta\n                    ? delta > 0\n                        ? NavigationDirection.forward\n                        : NavigationDirection.back\n                    : NavigationDirection.unknown,\n            });\n        });\n    };\n    function pauseListeners() {\n        pauseState = currentLocation.value;\n    }\n    function listen(callback) {\n        // set up the listener and prepare teardown callbacks\n        listeners.push(callback);\n        const teardown = () => {\n            const index = listeners.indexOf(callback);\n            if (index > -1)\n                listeners.splice(index, 1);\n        };\n        teardowns.push(teardown);\n        return teardown;\n    }\n    function beforeUnloadListener() {\n        const { history } = window;\n        if (!history.state)\n            return;\n        history.replaceState(assign({}, history.state, { scroll: computeScrollPosition() }), '');\n    }\n    function destroy() {\n        for (const teardown of teardowns)\n            teardown();\n        teardowns = [];\n        window.removeEventListener('popstate', popStateHandler);\n        window.removeEventListener('beforeunload', beforeUnloadListener);\n    }\n    // set up the listeners and prepare teardown callbacks\n    window.addEventListener('popstate', popStateHandler);\n    // TODO: could we use 'pagehide' or 'visibilitychange' instead?\n    // https://developer.chrome.com/blog/page-lifecycle-api/\n    window.addEventListener('beforeunload', beforeUnloadListener, {\n        passive: true,\n    });\n    return {\n        pauseListeners,\n        listen,\n        destroy,\n    };\n}\n/**\n * Creates a state object\n */\nfunction buildState(back, current, forward, replaced = false, computeScroll = false) {\n    return {\n        back,\n        current,\n        forward,\n        replaced,\n        position: window.history.length,\n        scroll: computeScroll ? computeScrollPosition() : null,\n    };\n}\nfunction useHistoryStateNavigation(base) {\n    const { history, location } = window;\n    // private variables\n    const currentLocation = {\n        value: createCurrentLocation(base, location),\n    };\n    const historyState = { value: history.state };\n    // build current history entry as this is a fresh navigation\n    if (!historyState.value) {\n        changeLocation(currentLocation.value, {\n            back: null,\n            current: currentLocation.value,\n            forward: null,\n            // the length is off by one, we need to decrease it\n            position: history.length - 1,\n            replaced: true,\n            // don't add a scroll as the user may have an anchor, and we want\n            // scrollBehavior to be triggered without a saved position\n            scroll: null,\n        }, true);\n    }\n    function changeLocation(to, state, replace) {\n        /**\n         * if a base tag is provided, and we are on a normal domain, we have to\n         * respect the provided `base` attribute because pushState() will use it and\n         * potentially erase anything before the `#` like at\n         * https://github.com/vuejs/router/issues/685 where a base of\n         * `/folder/#` but a base of `/` would erase the `/folder/` section. If\n         * there is no host, the `<base>` tag makes no sense and if there isn't a\n         * base tag we can just use everything after the `#`.\n         */\n        const hashIndex = base.indexOf('#');\n        const url = hashIndex > -1\n            ? (location.host && document.querySelector('base')\n                ? base\n                : base.slice(hashIndex)) + to\n            : createBaseLocation() + base + to;\n        try {\n            // BROWSER QUIRK\n            // NOTE: Safari throws a SecurityError when calling this function 100 times in 30 seconds\n            history[replace ? 'replaceState' : 'pushState'](state, '', url);\n            historyState.value = state;\n        }\n        catch (err) {\n            if ((process.env.NODE_ENV !== 'production')) {\n                warn('Error with push/replace State', err);\n            }\n            else {\n                console.error(err);\n            }\n            // Force the navigation, this also resets the call count\n            location[replace ? 'replace' : 'assign'](url);\n        }\n    }\n    function replace(to, data) {\n        const state = assign({}, history.state, buildState(historyState.value.back, \n        // keep back and forward entries but override current position\n        to, historyState.value.forward, true), data, { position: historyState.value.position });\n        changeLocation(to, state, true);\n        currentLocation.value = to;\n    }\n    function push(to, data) {\n        // Add to current entry the information of where we are going\n        // as well as saving the current position\n        const currentState = assign({}, \n        // use current history state to gracefully handle a wrong call to\n        // history.replaceState\n        // https://github.com/vuejs/router/issues/366\n        historyState.value, history.state, {\n            forward: to,\n            scroll: computeScrollPosition(),\n        });\n        if ((process.env.NODE_ENV !== 'production') && !history.state) {\n            warn(`history.state seems to have been manually replaced without preserving the necessary values. Make sure to preserve existing history state if you are manually calling history.replaceState:\\n\\n` +\n                `history.replaceState(history.state, '', url)\\n\\n` +\n                `You can find more information at https://next.router.vuejs.org/guide/migration/#usage-of-history-state.`);\n        }\n        changeLocation(currentState.current, currentState, true);\n        const state = assign({}, buildState(currentLocation.value, to, null), { position: currentState.position + 1 }, data);\n        changeLocation(to, state, false);\n        currentLocation.value = to;\n    }\n    return {\n        location: currentLocation,\n        state: historyState,\n        push,\n        replace,\n    };\n}\n/**\n * Creates an HTML5 history. Most common history for single page applications.\n *\n * @param base -\n */\nfunction createWebHistory(base) {\n    base = normalizeBase(base);\n    const historyNavigation = useHistoryStateNavigation(base);\n    const historyListeners = useHistoryListeners(base, historyNavigation.state, historyNavigation.location, historyNavigation.replace);\n    function go(delta, triggerListeners = true) {\n        if (!triggerListeners)\n            historyListeners.pauseListeners();\n        history.go(delta);\n    }\n    const routerHistory = assign({\n        // it's overridden right after\n        location: '',\n        base,\n        go,\n        createHref: createHref.bind(null, base),\n    }, historyNavigation, historyListeners);\n    Object.defineProperty(routerHistory, 'location', {\n        enumerable: true,\n        get: () => historyNavigation.location.value,\n    });\n    Object.defineProperty(routerHistory, 'state', {\n        enumerable: true,\n        get: () => historyNavigation.state.value,\n    });\n    return routerHistory;\n}\n\n/**\n * Creates an in-memory based history. The main purpose of this history is to handle SSR. It starts in a special location that is nowhere.\n * It's up to the user to replace that location with the starter location by either calling `router.push` or `router.replace`.\n *\n * @param base - Base applied to all urls, defaults to '/'\n * @returns a history object that can be passed to the router constructor\n */\nfunction createMemoryHistory(base = '') {\n    let listeners = [];\n    let queue = [START];\n    let position = 0;\n    base = normalizeBase(base);\n    function setLocation(location) {\n        position++;\n        if (position !== queue.length) {\n            // we are in the middle, we remove everything from here in the queue\n            queue.splice(position);\n        }\n        queue.push(location);\n    }\n    function triggerListeners(to, from, { direction, delta }) {\n        const info = {\n            direction,\n            delta,\n            type: NavigationType.pop,\n        };\n        for (const callback of listeners) {\n            callback(to, from, info);\n        }\n    }\n    const routerHistory = {\n        // rewritten by Object.defineProperty\n        location: START,\n        // TODO: should be kept in queue\n        state: {},\n        base,\n        createHref: createHref.bind(null, base),\n        replace(to) {\n            // remove current entry and decrement position\n            queue.splice(position--, 1);\n            setLocation(to);\n        },\n        push(to, data) {\n            setLocation(to);\n        },\n        listen(callback) {\n            listeners.push(callback);\n            return () => {\n                const index = listeners.indexOf(callback);\n                if (index > -1)\n                    listeners.splice(index, 1);\n            };\n        },\n        destroy() {\n            listeners = [];\n            queue = [START];\n            position = 0;\n        },\n        go(delta, shouldTrigger = true) {\n            const from = this.location;\n            const direction = \n            // we are considering delta === 0 going forward, but in abstract mode\n            // using 0 for the delta doesn't make sense like it does in html5 where\n            // it reloads the page\n            delta < 0 ? NavigationDirection.back : NavigationDirection.forward;\n            position = Math.max(0, Math.min(position + delta, queue.length - 1));\n            if (shouldTrigger) {\n                triggerListeners(this.location, from, {\n                    direction,\n                    delta,\n                });\n            }\n        },\n    };\n    Object.defineProperty(routerHistory, 'location', {\n        enumerable: true,\n        get: () => queue[position],\n    });\n    return routerHistory;\n}\n\n/**\n * Creates a hash history. Useful for web applications with no host (e.g. `file://`) or when configuring a server to\n * handle any URL is not possible.\n *\n * @param base - optional base to provide. Defaults to `location.pathname + location.search` If there is a `<base>` tag\n * in the `head`, its value will be ignored in favor of this parameter **but note it affects all the history.pushState()\n * calls**, meaning that if you use a `<base>` tag, it's `href` value **has to match this parameter** (ignoring anything\n * after the `#`).\n *\n * @example\n * ```js\n * // at https://example.com/folder\n * createWebHashHistory() // gives a url of `https://example.com/folder#`\n * createWebHashHistory('/folder/') // gives a url of `https://example.com/folder/#`\n * // if the `#` is provided in the base, it won't be added by `createWebHashHistory`\n * createWebHashHistory('/folder/#/app/') // gives a url of `https://example.com/folder/#/app/`\n * // you should avoid doing this because it changes the original url and breaks copying urls\n * createWebHashHistory('/other-folder/') // gives a url of `https://example.com/other-folder/#`\n *\n * // at file:///usr/etc/folder/index.html\n * // for locations with no `host`, the base is ignored\n * createWebHashHistory('/iAmIgnored') // gives a url of `file:///usr/etc/folder/index.html#`\n * ```\n */\nfunction createWebHashHistory(base) {\n    // Make sure this implementation is fine in terms of encoding, specially for IE11\n    // for `file://`, directly use the pathname and ignore the base\n    // location.pathname contains an initial `/` even at the root: `https://example.com`\n    base = location.host ? base || location.pathname + location.search : '';\n    // allow the user to provide a `#` in the middle: `/base/#/app`\n    if (!base.includes('#'))\n        base += '#';\n    if ((process.env.NODE_ENV !== 'production') && !base.endsWith('#/') && !base.endsWith('#')) {\n        warn(`A hash base must end with a \"#\":\\n\"${base}\" should be \"${base.replace(/#.*$/, '#')}\".`);\n    }\n    return createWebHistory(base);\n}\n\nfunction isRouteLocation(route) {\n    return typeof route === 'string' || (route && typeof route === 'object');\n}\nfunction isRouteName(name) {\n    return typeof name === 'string' || typeof name === 'symbol';\n}\n\n/**\n * Initial route location where the router is. Can be used in navigation guards\n * to differentiate the initial navigation.\n *\n * @example\n * ```js\n * import { START_LOCATION } from 'vue-router'\n *\n * router.beforeEach((to, from) => {\n *   if (from === START_LOCATION) {\n *     // initial navigation\n *   }\n * })\n * ```\n */\nconst START_LOCATION_NORMALIZED = {\n    path: '/',\n    name: undefined,\n    params: {},\n    query: {},\n    hash: '',\n    fullPath: '/',\n    matched: [],\n    meta: {},\n    redirectedFrom: undefined,\n};\n\nconst NavigationFailureSymbol = Symbol((process.env.NODE_ENV !== 'production') ? 'navigation failure' : '');\n/**\n * Enumeration with all possible types for navigation failures. Can be passed to\n * {@link isNavigationFailure} to check for specific failures.\n */\nvar NavigationFailureType;\n(function (NavigationFailureType) {\n    /**\n     * An aborted navigation is a navigation that failed because a navigation\n     * guard returned `false` or called `next(false)`\n     */\n    NavigationFailureType[NavigationFailureType[\"aborted\"] = 4] = \"aborted\";\n    /**\n     * A cancelled navigation is a navigation that failed because a more recent\n     * navigation finished started (not necessarily finished).\n     */\n    NavigationFailureType[NavigationFailureType[\"cancelled\"] = 8] = \"cancelled\";\n    /**\n     * A duplicated navigation is a navigation that failed because it was\n     * initiated while already being at the exact same location.\n     */\n    NavigationFailureType[NavigationFailureType[\"duplicated\"] = 16] = \"duplicated\";\n})(NavigationFailureType || (NavigationFailureType = {}));\n// DEV only debug messages\nconst ErrorTypeMessages = {\n    [1 /* ErrorTypes.MATCHER_NOT_FOUND */]({ location, currentLocation }) {\n        return `No match for\\n ${JSON.stringify(location)}${currentLocation\n            ? '\\nwhile being at\\n' + JSON.stringify(currentLocation)\n            : ''}`;\n    },\n    [2 /* ErrorTypes.NAVIGATION_GUARD_REDIRECT */]({ from, to, }) {\n        return `Redirected from \"${from.fullPath}\" to \"${stringifyRoute(to)}\" via a navigation guard.`;\n    },\n    [4 /* ErrorTypes.NAVIGATION_ABORTED */]({ from, to }) {\n        return `Navigation aborted from \"${from.fullPath}\" to \"${to.fullPath}\" via a navigation guard.`;\n    },\n    [8 /* ErrorTypes.NAVIGATION_CANCELLED */]({ from, to }) {\n        return `Navigation cancelled from \"${from.fullPath}\" to \"${to.fullPath}\" with a new navigation.`;\n    },\n    [16 /* ErrorTypes.NAVIGATION_DUPLICATED */]({ from, to }) {\n        return `Avoided redundant navigation to current location: \"${from.fullPath}\".`;\n    },\n};\nfunction createRouterError(type, params) {\n    // keep full error messages in cjs versions\n    if ((process.env.NODE_ENV !== 'production') || !true) {\n        return assign(new Error(ErrorTypeMessages[type](params)), {\n            type,\n            [NavigationFailureSymbol]: true,\n        }, params);\n    }\n    else {\n        return assign(new Error(), {\n            type,\n            [NavigationFailureSymbol]: true,\n        }, params);\n    }\n}\nfunction isNavigationFailure(error, type) {\n    return (error instanceof Error &&\n        NavigationFailureSymbol in error &&\n        (type == null || !!(error.type & type)));\n}\nconst propertiesToLog = ['params', 'query', 'hash'];\nfunction stringifyRoute(to) {\n    if (typeof to === 'string')\n        return to;\n    if ('path' in to)\n        return to.path;\n    const location = {};\n    for (const key of propertiesToLog) {\n        if (key in to)\n            location[key] = to[key];\n    }\n    return JSON.stringify(location, null, 2);\n}\n\n// default pattern for a param: non-greedy everything but /\nconst BASE_PARAM_PATTERN = '[^/]+?';\nconst BASE_PATH_PARSER_OPTIONS = {\n    sensitive: false,\n    strict: false,\n    start: true,\n    end: true,\n};\n// Special Regex characters that must be escaped in static tokens\nconst REGEX_CHARS_RE = /[.+*?^${}()[\\]/\\\\]/g;\n/**\n * Creates a path parser from an array of Segments (a segment is an array of Tokens)\n *\n * @param segments - array of segments returned by tokenizePath\n * @param extraOptions - optional options for the regexp\n * @returns a PathParser\n */\nfunction tokensToParser(segments, extraOptions) {\n    const options = assign({}, BASE_PATH_PARSER_OPTIONS, extraOptions);\n    // the amount of scores is the same as the length of segments except for the root segment \"/\"\n    const score = [];\n    // the regexp as a string\n    let pattern = options.start ? '^' : '';\n    // extracted keys\n    const keys = [];\n    for (const segment of segments) {\n        // the root segment needs special treatment\n        const segmentScores = segment.length ? [] : [90 /* PathScore.Root */];\n        // allow trailing slash\n        if (options.strict && !segment.length)\n            pattern += '/';\n        for (let tokenIndex = 0; tokenIndex < segment.length; tokenIndex++) {\n            const token = segment[tokenIndex];\n            // resets the score if we are inside a sub-segment /:a-other-:b\n            let subSegmentScore = 40 /* PathScore.Segment */ +\n                (options.sensitive ? 0.25 /* PathScore.BonusCaseSensitive */ : 0);\n            if (token.type === 0 /* TokenType.Static */) {\n                // prepend the slash if we are starting a new segment\n                if (!tokenIndex)\n                    pattern += '/';\n                pattern += token.value.replace(REGEX_CHARS_RE, '\\\\$&');\n                subSegmentScore += 40 /* PathScore.Static */;\n            }\n            else if (token.type === 1 /* TokenType.Param */) {\n                const { value, repeatable, optional, regexp } = token;\n                keys.push({\n                    name: value,\n                    repeatable,\n                    optional,\n                });\n                const re = regexp ? regexp : BASE_PARAM_PATTERN;\n                // the user provided a custom regexp /:id(\\\\d+)\n                if (re !== BASE_PARAM_PATTERN) {\n                    subSegmentScore += 10 /* PathScore.BonusCustomRegExp */;\n                    // make sure the regexp is valid before using it\n                    try {\n                        new RegExp(`(${re})`);\n                    }\n                    catch (err) {\n                        throw new Error(`Invalid custom RegExp for param \"${value}\" (${re}): ` +\n                            err.message);\n                    }\n                }\n                // when we repeat we must take care of the repeating leading slash\n                let subPattern = repeatable ? `((?:${re})(?:/(?:${re}))*)` : `(${re})`;\n                // prepend the slash if we are starting a new segment\n                if (!tokenIndex)\n                    subPattern =\n                        // avoid an optional / if there are more segments e.g. /:p?-static\n                        // or /:p?-:p2\n                        optional && segment.length < 2\n                            ? `(?:/${subPattern})`\n                            : '/' + subPattern;\n                if (optional)\n                    subPattern += '?';\n                pattern += subPattern;\n                subSegmentScore += 20 /* PathScore.Dynamic */;\n                if (optional)\n                    subSegmentScore += -8 /* PathScore.BonusOptional */;\n                if (repeatable)\n                    subSegmentScore += -20 /* PathScore.BonusRepeatable */;\n                if (re === '.*')\n                    subSegmentScore += -50 /* PathScore.BonusWildcard */;\n            }\n            segmentScores.push(subSegmentScore);\n        }\n        // an empty array like /home/ -> [[{home}], []]\n        // if (!segment.length) pattern += '/'\n        score.push(segmentScores);\n    }\n    // only apply the strict bonus to the last score\n    if (options.strict && options.end) {\n        const i = score.length - 1;\n        score[i][score[i].length - 1] += 0.7000000000000001 /* PathScore.BonusStrict */;\n    }\n    // TODO: dev only warn double trailing slash\n    if (!options.strict)\n        pattern += '/?';\n    if (options.end)\n        pattern += '$';\n    // allow paths like /dynamic to only match dynamic or dynamic/... but not dynamic_something_else\n    else if (options.strict)\n        pattern += '(?:/|$)';\n    const re = new RegExp(pattern, options.sensitive ? '' : 'i');\n    function parse(path) {\n        const match = path.match(re);\n        const params = {};\n        if (!match)\n            return null;\n        for (let i = 1; i < match.length; i++) {\n            const value = match[i] || '';\n            const key = keys[i - 1];\n            params[key.name] = value && key.repeatable ? value.split('/') : value;\n        }\n        return params;\n    }\n    function stringify(params) {\n        let path = '';\n        // for optional parameters to allow to be empty\n        let avoidDuplicatedSlash = false;\n        for (const segment of segments) {\n            if (!avoidDuplicatedSlash || !path.endsWith('/'))\n                path += '/';\n            avoidDuplicatedSlash = false;\n            for (const token of segment) {\n                if (token.type === 0 /* TokenType.Static */) {\n                    path += token.value;\n                }\n                else if (token.type === 1 /* TokenType.Param */) {\n                    const { value, repeatable, optional } = token;\n                    const param = value in params ? params[value] : '';\n                    if (isArray(param) && !repeatable) {\n                        throw new Error(`Provided param \"${value}\" is an array but it is not repeatable (* or + modifiers)`);\n                    }\n                    const text = isArray(param)\n                        ? param.join('/')\n                        : param;\n                    if (!text) {\n                        if (optional) {\n                            // if we have more than one optional param like /:a?-static we don't need to care about the optional param\n                            if (segment.length < 2) {\n                                // remove the last slash as we could be at the end\n                                if (path.endsWith('/'))\n                                    path = path.slice(0, -1);\n                                // do not append a slash on the next iteration\n                                else\n                                    avoidDuplicatedSlash = true;\n                            }\n                        }\n                        else\n                            throw new Error(`Missing required param \"${value}\"`);\n                    }\n                    path += text;\n                }\n            }\n        }\n        // avoid empty path when we have multiple optional params\n        return path || '/';\n    }\n    return {\n        re,\n        score,\n        keys,\n        parse,\n        stringify,\n    };\n}\n/**\n * Compares an array of numbers as used in PathParser.score and returns a\n * number. This function can be used to `sort` an array\n *\n * @param a - first array of numbers\n * @param b - second array of numbers\n * @returns 0 if both are equal, < 0 if a should be sorted first, > 0 if b\n * should be sorted first\n */\nfunction compareScoreArray(a, b) {\n    let i = 0;\n    while (i < a.length && i < b.length) {\n        const diff = b[i] - a[i];\n        // only keep going if diff === 0\n        if (diff)\n            return diff;\n        i++;\n    }\n    // if the last subsegment was Static, the shorter segments should be sorted first\n    // otherwise sort the longest segment first\n    if (a.length < b.length) {\n        return a.length === 1 && a[0] === 40 /* PathScore.Static */ + 40 /* PathScore.Segment */\n            ? -1\n            : 1;\n    }\n    else if (a.length > b.length) {\n        return b.length === 1 && b[0] === 40 /* PathScore.Static */ + 40 /* PathScore.Segment */\n            ? 1\n            : -1;\n    }\n    return 0;\n}\n/**\n * Compare function that can be used with `sort` to sort an array of PathParser\n *\n * @param a - first PathParser\n * @param b - second PathParser\n * @returns 0 if both are equal, < 0 if a should be sorted first, > 0 if b\n */\nfunction comparePathParserScore(a, b) {\n    let i = 0;\n    const aScore = a.score;\n    const bScore = b.score;\n    while (i < aScore.length && i < bScore.length) {\n        const comp = compareScoreArray(aScore[i], bScore[i]);\n        // do not return if both are equal\n        if (comp)\n            return comp;\n        i++;\n    }\n    if (Math.abs(bScore.length - aScore.length) === 1) {\n        if (isLastScoreNegative(aScore))\n            return 1;\n        if (isLastScoreNegative(bScore))\n            return -1;\n    }\n    // if a and b share the same score entries but b has more, sort b first\n    return bScore.length - aScore.length;\n    // this is the ternary version\n    // return aScore.length < bScore.length\n    //   ? 1\n    //   : aScore.length > bScore.length\n    //   ? -1\n    //   : 0\n}\n/**\n * This allows detecting splats at the end of a path: /home/:id(.*)*\n *\n * @param score - score to check\n * @returns true if the last entry is negative\n */\nfunction isLastScoreNegative(score) {\n    const last = score[score.length - 1];\n    return score.length > 0 && last[last.length - 1] < 0;\n}\n\nconst ROOT_TOKEN = {\n    type: 0 /* TokenType.Static */,\n    value: '',\n};\nconst VALID_PARAM_RE = /[a-zA-Z0-9_]/;\n// After some profiling, the cache seems to be unnecessary because tokenizePath\n// (the slowest part of adding a route) is very fast\n// const tokenCache = new Map<string, Token[][]>()\nfunction tokenizePath(path) {\n    if (!path)\n        return [[]];\n    if (path === '/')\n        return [[ROOT_TOKEN]];\n    if (!path.startsWith('/')) {\n        throw new Error((process.env.NODE_ENV !== 'production')\n            ? `Route paths should start with a \"/\": \"${path}\" should be \"/${path}\".`\n            : `Invalid path \"${path}\"`);\n    }\n    // if (tokenCache.has(path)) return tokenCache.get(path)!\n    function crash(message) {\n        throw new Error(`ERR (${state})/\"${buffer}\": ${message}`);\n    }\n    let state = 0 /* TokenizerState.Static */;\n    let previousState = state;\n    const tokens = [];\n    // the segment will always be valid because we get into the initial state\n    // with the leading /\n    let segment;\n    function finalizeSegment() {\n        if (segment)\n            tokens.push(segment);\n        segment = [];\n    }\n    // index on the path\n    let i = 0;\n    // char at index\n    let char;\n    // buffer of the value read\n    let buffer = '';\n    // custom regexp for a param\n    let customRe = '';\n    function consumeBuffer() {\n        if (!buffer)\n            return;\n        if (state === 0 /* TokenizerState.Static */) {\n            segment.push({\n                type: 0 /* TokenType.Static */,\n                value: buffer,\n            });\n        }\n        else if (state === 1 /* TokenizerState.Param */ ||\n            state === 2 /* TokenizerState.ParamRegExp */ ||\n            state === 3 /* TokenizerState.ParamRegExpEnd */) {\n            if (segment.length > 1 && (char === '*' || char === '+'))\n                crash(`A repeatable param (${buffer}) must be alone in its segment. eg: '/:ids+.`);\n            segment.push({\n                type: 1 /* TokenType.Param */,\n                value: buffer,\n                regexp: customRe,\n                repeatable: char === '*' || char === '+',\n                optional: char === '*' || char === '?',\n            });\n        }\n        else {\n            crash('Invalid state to consume buffer');\n        }\n        buffer = '';\n    }\n    function addCharToBuffer() {\n        buffer += char;\n    }\n    while (i < path.length) {\n        char = path[i++];\n        if (char === '\\\\' && state !== 2 /* TokenizerState.ParamRegExp */) {\n            previousState = state;\n            state = 4 /* TokenizerState.EscapeNext */;\n            continue;\n        }\n        switch (state) {\n            case 0 /* TokenizerState.Static */:\n                if (char === '/') {\n                    if (buffer) {\n                        consumeBuffer();\n                    }\n                    finalizeSegment();\n                }\n                else if (char === ':') {\n                    consumeBuffer();\n                    state = 1 /* TokenizerState.Param */;\n                }\n                else {\n                    addCharToBuffer();\n                }\n                break;\n            case 4 /* TokenizerState.EscapeNext */:\n                addCharToBuffer();\n                state = previousState;\n                break;\n            case 1 /* TokenizerState.Param */:\n                if (char === '(') {\n                    state = 2 /* TokenizerState.ParamRegExp */;\n                }\n                else if (VALID_PARAM_RE.test(char)) {\n                    addCharToBuffer();\n                }\n                else {\n                    consumeBuffer();\n                    state = 0 /* TokenizerState.Static */;\n                    // go back one character if we were not modifying\n                    if (char !== '*' && char !== '?' && char !== '+')\n                        i--;\n                }\n                break;\n            case 2 /* TokenizerState.ParamRegExp */:\n                // TODO: is it worth handling nested regexp? like :p(?:prefix_([^/]+)_suffix)\n                // it already works by escaping the closing )\n                // https://paths.esm.dev/?p=AAMeJbiAwQEcDKbAoAAkP60PG2R6QAvgNaA6AFACM2ABuQBB#\n                // is this really something people need since you can also write\n                // /prefix_:p()_suffix\n                if (char === ')') {\n                    // handle the escaped )\n                    if (customRe[customRe.length - 1] == '\\\\')\n                        customRe = customRe.slice(0, -1) + char;\n                    else\n                        state = 3 /* TokenizerState.ParamRegExpEnd */;\n                }\n                else {\n                    customRe += char;\n                }\n                break;\n            case 3 /* TokenizerState.ParamRegExpEnd */:\n                // same as finalizing a param\n                consumeBuffer();\n                state = 0 /* TokenizerState.Static */;\n                // go back one character if we were not modifying\n                if (char !== '*' && char !== '?' && char !== '+')\n                    i--;\n                customRe = '';\n                break;\n            default:\n                crash('Unknown state');\n                break;\n        }\n    }\n    if (state === 2 /* TokenizerState.ParamRegExp */)\n        crash(`Unfinished custom RegExp for param \"${buffer}\"`);\n    consumeBuffer();\n    finalizeSegment();\n    // tokenCache.set(path, tokens)\n    return tokens;\n}\n\nfunction createRouteRecordMatcher(record, parent, options) {\n    const parser = tokensToParser(tokenizePath(record.path), options);\n    // warn against params with the same name\n    if ((process.env.NODE_ENV !== 'production')) {\n        const existingKeys = new Set();\n        for (const key of parser.keys) {\n            if (existingKeys.has(key.name))\n                warn(`Found duplicated params with name \"${key.name}\" for path \"${record.path}\". Only the last one will be available on \"$route.params\".`);\n            existingKeys.add(key.name);\n        }\n    }\n    const matcher = assign(parser, {\n        record,\n        parent,\n        // these needs to be populated by the parent\n        children: [],\n        alias: [],\n    });\n    if (parent) {\n        // both are aliases or both are not aliases\n        // we don't want to mix them because the order is used when\n        // passing originalRecord in Matcher.addRoute\n        if (!matcher.record.aliasOf === !parent.record.aliasOf)\n            parent.children.push(matcher);\n    }\n    return matcher;\n}\n\n/**\n * Creates a Router Matcher.\n *\n * @internal\n * @param routes - array of initial routes\n * @param globalOptions - global route options\n */\nfunction createRouterMatcher(routes, globalOptions) {\n    // normalized ordered array of matchers\n    const matchers = [];\n    const matcherMap = new Map();\n    globalOptions = mergeOptions({ strict: false, end: true, sensitive: false }, globalOptions);\n    function getRecordMatcher(name) {\n        return matcherMap.get(name);\n    }\n    function addRoute(record, parent, originalRecord) {\n        // used later on to remove by name\n        const isRootAdd = !originalRecord;\n        const mainNormalizedRecord = normalizeRouteRecord(record);\n        if ((process.env.NODE_ENV !== 'production')) {\n            checkChildMissingNameWithEmptyPath(mainNormalizedRecord, parent);\n        }\n        // we might be the child of an alias\n        mainNormalizedRecord.aliasOf = originalRecord && originalRecord.record;\n        const options = mergeOptions(globalOptions, record);\n        // generate an array of records to correctly handle aliases\n        const normalizedRecords = [\n            mainNormalizedRecord,\n        ];\n        if ('alias' in record) {\n            const aliases = typeof record.alias === 'string' ? [record.alias] : record.alias;\n            for (const alias of aliases) {\n                normalizedRecords.push(assign({}, mainNormalizedRecord, {\n                    // this allows us to hold a copy of the `components` option\n                    // so that async components cache is hold on the original record\n                    components: originalRecord\n                        ? originalRecord.record.components\n                        : mainNormalizedRecord.components,\n                    path: alias,\n                    // we might be the child of an alias\n                    aliasOf: originalRecord\n                        ? originalRecord.record\n                        : mainNormalizedRecord,\n                    // the aliases are always of the same kind as the original since they\n                    // are defined on the same record\n                }));\n            }\n        }\n        let matcher;\n        let originalMatcher;\n        for (const normalizedRecord of normalizedRecords) {\n            const { path } = normalizedRecord;\n            // Build up the path for nested routes if the child isn't an absolute\n            // route. Only add the / delimiter if the child path isn't empty and if the\n            // parent path doesn't have a trailing slash\n            if (parent && path[0] !== '/') {\n                const parentPath = parent.record.path;\n                const connectingSlash = parentPath[parentPath.length - 1] === '/' ? '' : '/';\n                normalizedRecord.path =\n                    parent.record.path + (path && connectingSlash + path);\n            }\n            if ((process.env.NODE_ENV !== 'production') && normalizedRecord.path === '*') {\n                throw new Error('Catch all routes (\"*\") must now be defined using a param with a custom regexp.\\n' +\n                    'See more at https://next.router.vuejs.org/guide/migration/#removed-star-or-catch-all-routes.');\n            }\n            // create the object beforehand, so it can be passed to children\n            matcher = createRouteRecordMatcher(normalizedRecord, parent, options);\n            if ((process.env.NODE_ENV !== 'production') && parent && path[0] === '/')\n                checkMissingParamsInAbsolutePath(matcher, parent);\n            // if we are an alias we must tell the original record that we exist,\n            // so we can be removed\n            if (originalRecord) {\n                originalRecord.alias.push(matcher);\n                if ((process.env.NODE_ENV !== 'production')) {\n                    checkSameParams(originalRecord, matcher);\n                }\n            }\n            else {\n                // otherwise, the first record is the original and others are aliases\n                originalMatcher = originalMatcher || matcher;\n                if (originalMatcher !== matcher)\n                    originalMatcher.alias.push(matcher);\n                // remove the route if named and only for the top record (avoid in nested calls)\n                // this works because the original record is the first one\n                if (isRootAdd && record.name && !isAliasRecord(matcher))\n                    removeRoute(record.name);\n            }\n            if (mainNormalizedRecord.children) {\n                const children = mainNormalizedRecord.children;\n                for (let i = 0; i < children.length; i++) {\n                    addRoute(children[i], matcher, originalRecord && originalRecord.children[i]);\n                }\n            }\n            // if there was no original record, then the first one was not an alias and all\n            // other aliases (if any) need to reference this record when adding children\n            originalRecord = originalRecord || matcher;\n            // TODO: add normalized records for more flexibility\n            // if (parent && isAliasRecord(originalRecord)) {\n            //   parent.children.push(originalRecord)\n            // }\n            // Avoid adding a record that doesn't display anything. This allows passing through records without a component to\n            // not be reached and pass through the catch all route\n            if ((matcher.record.components &&\n                Object.keys(matcher.record.components).length) ||\n                matcher.record.name ||\n                matcher.record.redirect) {\n                insertMatcher(matcher);\n            }\n        }\n        return originalMatcher\n            ? () => {\n                // since other matchers are aliases, they should be removed by the original matcher\n                removeRoute(originalMatcher);\n            }\n            : noop;\n    }\n    function removeRoute(matcherRef) {\n        if (isRouteName(matcherRef)) {\n            const matcher = matcherMap.get(matcherRef);\n            if (matcher) {\n                matcherMap.delete(matcherRef);\n                matchers.splice(matchers.indexOf(matcher), 1);\n                matcher.children.forEach(removeRoute);\n                matcher.alias.forEach(removeRoute);\n            }\n        }\n        else {\n            const index = matchers.indexOf(matcherRef);\n            if (index > -1) {\n                matchers.splice(index, 1);\n                if (matcherRef.record.name)\n                    matcherMap.delete(matcherRef.record.name);\n                matcherRef.children.forEach(removeRoute);\n                matcherRef.alias.forEach(removeRoute);\n            }\n        }\n    }\n    function getRoutes() {\n        return matchers;\n    }\n    function insertMatcher(matcher) {\n        let i = 0;\n        while (i < matchers.length &&\n            comparePathParserScore(matcher, matchers[i]) >= 0 &&\n            // Adding children with empty path should still appear before the parent\n            // https://github.com/vuejs/router/issues/1124\n            (matcher.record.path !== matchers[i].record.path ||\n                !isRecordChildOf(matcher, matchers[i])))\n            i++;\n        matchers.splice(i, 0, matcher);\n        // only add the original record to the name map\n        if (matcher.record.name && !isAliasRecord(matcher))\n            matcherMap.set(matcher.record.name, matcher);\n    }\n    function resolve(location, currentLocation) {\n        let matcher;\n        let params = {};\n        let path;\n        let name;\n        if ('name' in location && location.name) {\n            matcher = matcherMap.get(location.name);\n            if (!matcher)\n                throw createRouterError(1 /* ErrorTypes.MATCHER_NOT_FOUND */, {\n                    location,\n                });\n            // warn if the user is passing invalid params so they can debug it better when they get removed\n            if ((process.env.NODE_ENV !== 'production')) {\n                const invalidParams = Object.keys(location.params || {}).filter(paramName => !matcher.keys.find(k => k.name === paramName));\n                if (invalidParams.length) {\n                    warn(`Discarded invalid param(s) \"${invalidParams.join('\", \"')}\" when navigating. See https://github.com/vuejs/router/blob/main/packages/router/CHANGELOG.md#414-2022-08-22 for more details.`);\n                }\n            }\n            name = matcher.record.name;\n            params = assign(\n            // paramsFromLocation is a new object\n            paramsFromLocation(currentLocation.params, \n            // only keep params that exist in the resolved location\n            // TODO: only keep optional params coming from a parent record\n            matcher.keys.filter(k => !k.optional).map(k => k.name)), \n            // discard any existing params in the current location that do not exist here\n            // #1497 this ensures better active/exact matching\n            location.params &&\n                paramsFromLocation(location.params, matcher.keys.map(k => k.name)));\n            // throws if cannot be stringified\n            path = matcher.stringify(params);\n        }\n        else if ('path' in location) {\n            // no need to resolve the path with the matcher as it was provided\n            // this also allows the user to control the encoding\n            path = location.path;\n            if ((process.env.NODE_ENV !== 'production') && !path.startsWith('/')) {\n                warn(`The Matcher cannot resolve relative paths but received \"${path}\". Unless you directly called \\`matcher.resolve(\"${path}\")\\`, this is probably a bug in vue-router. Please open an issue at https://github.com/vuejs/router/issues/new/choose.`);\n            }\n            matcher = matchers.find(m => m.re.test(path));\n            // matcher should have a value after the loop\n            if (matcher) {\n                // we know the matcher works because we tested the regexp\n                params = matcher.parse(path);\n                name = matcher.record.name;\n            }\n            // location is a relative path\n        }\n        else {\n            // match by name or path of current route\n            matcher = currentLocation.name\n                ? matcherMap.get(currentLocation.name)\n                : matchers.find(m => m.re.test(currentLocation.path));\n            if (!matcher)\n                throw createRouterError(1 /* ErrorTypes.MATCHER_NOT_FOUND */, {\n                    location,\n                    currentLocation,\n                });\n            name = matcher.record.name;\n            // since we are navigating to the same location, we don't need to pick the\n            // params like when `name` is provided\n            params = assign({}, currentLocation.params, location.params);\n            path = matcher.stringify(params);\n        }\n        const matched = [];\n        let parentMatcher = matcher;\n        while (parentMatcher) {\n            // reversed order so parents are at the beginning\n            matched.unshift(parentMatcher.record);\n            parentMatcher = parentMatcher.parent;\n        }\n        return {\n            name,\n            path,\n            params,\n            matched,\n            meta: mergeMetaFields(matched),\n        };\n    }\n    // add initial routes\n    routes.forEach(route => addRoute(route));\n    return { addRoute, resolve, removeRoute, getRoutes, getRecordMatcher };\n}\nfunction paramsFromLocation(params, keys) {\n    const newParams = {};\n    for (const key of keys) {\n        if (key in params)\n            newParams[key] = params[key];\n    }\n    return newParams;\n}\n/**\n * Normalizes a RouteRecordRaw. Creates a copy\n *\n * @param record\n * @returns the normalized version\n */\nfunction normalizeRouteRecord(record) {\n    return {\n        path: record.path,\n        redirect: record.redirect,\n        name: record.name,\n        meta: record.meta || {},\n        aliasOf: undefined,\n        beforeEnter: record.beforeEnter,\n        props: normalizeRecordProps(record),\n        children: record.children || [],\n        instances: {},\n        leaveGuards: new Set(),\n        updateGuards: new Set(),\n        enterCallbacks: {},\n        components: 'components' in record\n            ? record.components || null\n            : record.component && { default: record.component },\n    };\n}\n/**\n * Normalize the optional `props` in a record to always be an object similar to\n * components. Also accept a boolean for components.\n * @param record\n */\nfunction normalizeRecordProps(record) {\n    const propsObject = {};\n    // props does not exist on redirect records, but we can set false directly\n    const props = record.props || false;\n    if ('component' in record) {\n        propsObject.default = props;\n    }\n    else {\n        // NOTE: we could also allow a function to be applied to every component.\n        // Would need user feedback for use cases\n        for (const name in record.components)\n            propsObject[name] = typeof props === 'object' ? props[name] : props;\n    }\n    return propsObject;\n}\n/**\n * Checks if a record or any of its parent is an alias\n * @param record\n */\nfunction isAliasRecord(record) {\n    while (record) {\n        if (record.record.aliasOf)\n            return true;\n        record = record.parent;\n    }\n    return false;\n}\n/**\n * Merge meta fields of an array of records\n *\n * @param matched - array of matched records\n */\nfunction mergeMetaFields(matched) {\n    return matched.reduce((meta, record) => assign(meta, record.meta), {});\n}\nfunction mergeOptions(defaults, partialOptions) {\n    const options = {};\n    for (const key in defaults) {\n        options[key] = key in partialOptions ? partialOptions[key] : defaults[key];\n    }\n    return options;\n}\nfunction isSameParam(a, b) {\n    return (a.name === b.name &&\n        a.optional === b.optional &&\n        a.repeatable === b.repeatable);\n}\n/**\n * Check if a path and its alias have the same required params\n *\n * @param a - original record\n * @param b - alias record\n */\nfunction checkSameParams(a, b) {\n    for (const key of a.keys) {\n        if (!key.optional && !b.keys.find(isSameParam.bind(null, key)))\n            return warn(`Alias \"${b.record.path}\" and the original record: \"${a.record.path}\" must have the exact same param named \"${key.name}\"`);\n    }\n    for (const key of b.keys) {\n        if (!key.optional && !a.keys.find(isSameParam.bind(null, key)))\n            return warn(`Alias \"${b.record.path}\" and the original record: \"${a.record.path}\" must have the exact same param named \"${key.name}\"`);\n    }\n}\n/**\n * A route with a name and a child with an empty path without a name should warn when adding the route\n *\n * @param mainNormalizedRecord - RouteRecordNormalized\n * @param parent - RouteRecordMatcher\n */\nfunction checkChildMissingNameWithEmptyPath(mainNormalizedRecord, parent) {\n    if (parent &&\n        parent.record.name &&\n        !mainNormalizedRecord.name &&\n        !mainNormalizedRecord.path) {\n        warn(`The route named \"${String(parent.record.name)}\" has a child without a name and an empty path. Using that name won't render the empty path child so you probably want to move the name to the child instead. If this is intentional, add a name to the child route to remove the warning.`);\n    }\n}\nfunction checkMissingParamsInAbsolutePath(record, parent) {\n    for (const key of parent.keys) {\n        if (!record.keys.find(isSameParam.bind(null, key)))\n            return warn(`Absolute path \"${record.record.path}\" must have the exact same param named \"${key.name}\" as its parent \"${parent.record.path}\".`);\n    }\n}\nfunction isRecordChildOf(record, parent) {\n    return parent.children.some(child => child === record || isRecordChildOf(record, child));\n}\n\n/**\n * Encoding Rules ␣ = Space Path: ␣ \" < > # ? { } Query: ␣ \" < > # & = Hash: ␣ \"\n * < > `\n *\n * On top of that, the RFC3986 (https://tools.ietf.org/html/rfc3986#section-2.2)\n * defines some extra characters to be encoded. Most browsers do not encode them\n * in encodeURI https://github.com/whatwg/url/issues/369, so it may be safer to\n * also encode `!'()*`. Leaving un-encoded only ASCII alphanumeric(`a-zA-Z0-9`)\n * plus `-._~`. This extra safety should be applied to query by patching the\n * string returned by encodeURIComponent encodeURI also encodes `[\\]^`. `\\`\n * should be encoded to avoid ambiguity. Browsers (IE, FF, C) transform a `\\`\n * into a `/` if directly typed in. The _backtick_ (`````) should also be\n * encoded everywhere because some browsers like FF encode it when directly\n * written while others don't. Safari and IE don't encode ``\"<>{}``` in hash.\n */\n// const EXTRA_RESERVED_RE = /[!'()*]/g\n// const encodeReservedReplacer = (c: string) => '%' + c.charCodeAt(0).toString(16)\nconst HASH_RE = /#/g; // %23\nconst AMPERSAND_RE = /&/g; // %26\nconst SLASH_RE = /\\//g; // %2F\nconst EQUAL_RE = /=/g; // %3D\nconst IM_RE = /\\?/g; // %3F\nconst PLUS_RE = /\\+/g; // %2B\n/**\n * NOTE: It's not clear to me if we should encode the + symbol in queries, it\n * seems to be less flexible than not doing so and I can't find out the legacy\n * systems requiring this for regular requests like text/html. In the standard,\n * the encoding of the plus character is only mentioned for\n * application/x-www-form-urlencoded\n * (https://url.spec.whatwg.org/#urlencoded-parsing) and most browsers seems lo\n * leave the plus character as is in queries. To be more flexible, we allow the\n * plus character on the query, but it can also be manually encoded by the user.\n *\n * Resources:\n * - https://url.spec.whatwg.org/#urlencoded-parsing\n * - https://stackoverflow.com/questions/1634271/url-encoding-the-space-character-or-20\n */\nconst ENC_BRACKET_OPEN_RE = /%5B/g; // [\nconst ENC_BRACKET_CLOSE_RE = /%5D/g; // ]\nconst ENC_CARET_RE = /%5E/g; // ^\nconst ENC_BACKTICK_RE = /%60/g; // `\nconst ENC_CURLY_OPEN_RE = /%7B/g; // {\nconst ENC_PIPE_RE = /%7C/g; // |\nconst ENC_CURLY_CLOSE_RE = /%7D/g; // }\nconst ENC_SPACE_RE = /%20/g; // }\n/**\n * Encode characters that need to be encoded on the path, search and hash\n * sections of the URL.\n *\n * @internal\n * @param text - string to encode\n * @returns encoded string\n */\nfunction commonEncode(text) {\n    return encodeURI('' + text)\n        .replace(ENC_PIPE_RE, '|')\n        .replace(ENC_BRACKET_OPEN_RE, '[')\n        .replace(ENC_BRACKET_CLOSE_RE, ']');\n}\n/**\n * Encode characters that need to be encoded on the hash section of the URL.\n *\n * @param text - string to encode\n * @returns encoded string\n */\nfunction encodeHash(text) {\n    return commonEncode(text)\n        .replace(ENC_CURLY_OPEN_RE, '{')\n        .replace(ENC_CURLY_CLOSE_RE, '}')\n        .replace(ENC_CARET_RE, '^');\n}\n/**\n * Encode characters that need to be encoded query values on the query\n * section of the URL.\n *\n * @param text - string to encode\n * @returns encoded string\n */\nfunction encodeQueryValue(text) {\n    return (commonEncode(text)\n        // Encode the space as +, encode the + to differentiate it from the space\n        .replace(PLUS_RE, '%2B')\n        .replace(ENC_SPACE_RE, '+')\n        .replace(HASH_RE, '%23')\n        .replace(AMPERSAND_RE, '%26')\n        .replace(ENC_BACKTICK_RE, '`')\n        .replace(ENC_CURLY_OPEN_RE, '{')\n        .replace(ENC_CURLY_CLOSE_RE, '}')\n        .replace(ENC_CARET_RE, '^'));\n}\n/**\n * Like `encodeQueryValue` but also encodes the `=` character.\n *\n * @param text - string to encode\n */\nfunction encodeQueryKey(text) {\n    return encodeQueryValue(text).replace(EQUAL_RE, '%3D');\n}\n/**\n * Encode characters that need to be encoded on the path section of the URL.\n *\n * @param text - string to encode\n * @returns encoded string\n */\nfunction encodePath(text) {\n    return commonEncode(text).replace(HASH_RE, '%23').replace(IM_RE, '%3F');\n}\n/**\n * Encode characters that need to be encoded on the path section of the URL as a\n * param. This function encodes everything {@link encodePath} does plus the\n * slash (`/`) character. If `text` is `null` or `undefined`, returns an empty\n * string instead.\n *\n * @param text - string to encode\n * @returns encoded string\n */\nfunction encodeParam(text) {\n    return text == null ? '' : encodePath(text).replace(SLASH_RE, '%2F');\n}\n/**\n * Decode text using `decodeURIComponent`. Returns the original text if it\n * fails.\n *\n * @param text - string to decode\n * @returns decoded string\n */\nfunction decode(text) {\n    try {\n        return decodeURIComponent('' + text);\n    }\n    catch (err) {\n        (process.env.NODE_ENV !== 'production') && warn(`Error decoding \"${text}\". Using original value`);\n    }\n    return '' + text;\n}\n\n/**\n * Transforms a queryString into a {@link LocationQuery} object. Accept both, a\n * version with the leading `?` and without Should work as URLSearchParams\n\n * @internal\n *\n * @param search - search string to parse\n * @returns a query object\n */\nfunction parseQuery(search) {\n    const query = {};\n    // avoid creating an object with an empty key and empty value\n    // because of split('&')\n    if (search === '' || search === '?')\n        return query;\n    const hasLeadingIM = search[0] === '?';\n    const searchParams = (hasLeadingIM ? search.slice(1) : search).split('&');\n    for (let i = 0; i < searchParams.length; ++i) {\n        // pre decode the + into space\n        const searchParam = searchParams[i].replace(PLUS_RE, ' ');\n        // allow the = character\n        const eqPos = searchParam.indexOf('=');\n        const key = decode(eqPos < 0 ? searchParam : searchParam.slice(0, eqPos));\n        const value = eqPos < 0 ? null : decode(searchParam.slice(eqPos + 1));\n        if (key in query) {\n            // an extra variable for ts types\n            let currentValue = query[key];\n            if (!isArray(currentValue)) {\n                currentValue = query[key] = [currentValue];\n            }\n            currentValue.push(value);\n        }\n        else {\n            query[key] = value;\n        }\n    }\n    return query;\n}\n/**\n * Stringifies a {@link LocationQueryRaw} object. Like `URLSearchParams`, it\n * doesn't prepend a `?`\n *\n * @internal\n *\n * @param query - query object to stringify\n * @returns string version of the query without the leading `?`\n */\nfunction stringifyQuery(query) {\n    let search = '';\n    for (let key in query) {\n        const value = query[key];\n        key = encodeQueryKey(key);\n        if (value == null) {\n            // only null adds the value\n            if (value !== undefined) {\n                search += (search.length ? '&' : '') + key;\n            }\n            continue;\n        }\n        // keep null values\n        const values = isArray(value)\n            ? value.map(v => v && encodeQueryValue(v))\n            : [value && encodeQueryValue(value)];\n        values.forEach(value => {\n            // skip undefined values in arrays as if they were not present\n            // smaller code than using filter\n            if (value !== undefined) {\n                // only append & with non-empty search\n                search += (search.length ? '&' : '') + key;\n                if (value != null)\n                    search += '=' + value;\n            }\n        });\n    }\n    return search;\n}\n/**\n * Transforms a {@link LocationQueryRaw} into a {@link LocationQuery} by casting\n * numbers into strings, removing keys with an undefined value and replacing\n * undefined with null in arrays\n *\n * @param query - query object to normalize\n * @returns a normalized query object\n */\nfunction normalizeQuery(query) {\n    const normalizedQuery = {};\n    for (const key in query) {\n        const value = query[key];\n        if (value !== undefined) {\n            normalizedQuery[key] = isArray(value)\n                ? value.map(v => (v == null ? null : '' + v))\n                : value == null\n                    ? value\n                    : '' + value;\n        }\n    }\n    return normalizedQuery;\n}\n\n/**\n * RouteRecord being rendered by the closest ancestor Router View. Used for\n * `onBeforeRouteUpdate` and `onBeforeRouteLeave`. rvlm stands for Router View\n * Location Matched\n *\n * @internal\n */\nconst matchedRouteKey = Symbol((process.env.NODE_ENV !== 'production') ? 'router view location matched' : '');\n/**\n * Allows overriding the router view depth to control which component in\n * `matched` is rendered. rvd stands for Router View Depth\n *\n * @internal\n */\nconst viewDepthKey = Symbol((process.env.NODE_ENV !== 'production') ? 'router view depth' : '');\n/**\n * Allows overriding the router instance returned by `useRouter` in tests. r\n * stands for router\n *\n * @internal\n */\nconst routerKey = Symbol((process.env.NODE_ENV !== 'production') ? 'router' : '');\n/**\n * Allows overriding the current route returned by `useRoute` in tests. rl\n * stands for route location\n *\n * @internal\n */\nconst routeLocationKey = Symbol((process.env.NODE_ENV !== 'production') ? 'route location' : '');\n/**\n * Allows overriding the current route used by router-view. Internally this is\n * used when the `route` prop is passed.\n *\n * @internal\n */\nconst routerViewLocationKey = Symbol((process.env.NODE_ENV !== 'production') ? 'router view location' : '');\n\n/**\n * Create a list of callbacks that can be reset. Used to create before and after navigation guards list\n */\nfunction useCallbacks() {\n    let handlers = [];\n    function add(handler) {\n        handlers.push(handler);\n        return () => {\n            const i = handlers.indexOf(handler);\n            if (i > -1)\n                handlers.splice(i, 1);\n        };\n    }\n    function reset() {\n        handlers = [];\n    }\n    return {\n        add,\n        list: () => handlers.slice(),\n        reset,\n    };\n}\n\nfunction registerGuard(record, name, guard) {\n    const removeFromList = () => {\n        record[name].delete(guard);\n    };\n    onUnmounted(removeFromList);\n    onDeactivated(removeFromList);\n    onActivated(() => {\n        record[name].add(guard);\n    });\n    record[name].add(guard);\n}\n/**\n * Add a navigation guard that triggers whenever the component for the current\n * location is about to be left. Similar to {@link beforeRouteLeave} but can be\n * used in any component. The guard is removed when the component is unmounted.\n *\n * @param leaveGuard - {@link NavigationGuard}\n */\nfunction onBeforeRouteLeave(leaveGuard) {\n    if ((process.env.NODE_ENV !== 'production') && !getCurrentInstance()) {\n        warn('getCurrentInstance() returned null. onBeforeRouteLeave() must be called at the top of a setup function');\n        return;\n    }\n    const activeRecord = inject(matchedRouteKey, \n    // to avoid warning\n    {}).value;\n    if (!activeRecord) {\n        (process.env.NODE_ENV !== 'production') &&\n            warn('No active route record was found when calling `onBeforeRouteLeave()`. Make sure you call this function inside a component child of <router-view>. Maybe you called it inside of App.vue?');\n        return;\n    }\n    registerGuard(activeRecord, 'leaveGuards', leaveGuard);\n}\n/**\n * Add a navigation guard that triggers whenever the current location is about\n * to be updated. Similar to {@link beforeRouteUpdate} but can be used in any\n * component. The guard is removed when the component is unmounted.\n *\n * @param updateGuard - {@link NavigationGuard}\n */\nfunction onBeforeRouteUpdate(updateGuard) {\n    if ((process.env.NODE_ENV !== 'production') && !getCurrentInstance()) {\n        warn('getCurrentInstance() returned null. onBeforeRouteUpdate() must be called at the top of a setup function');\n        return;\n    }\n    const activeRecord = inject(matchedRouteKey, \n    // to avoid warning\n    {}).value;\n    if (!activeRecord) {\n        (process.env.NODE_ENV !== 'production') &&\n            warn('No active route record was found when calling `onBeforeRouteUpdate()`. Make sure you call this function inside a component child of <router-view>. Maybe you called it inside of App.vue?');\n        return;\n    }\n    registerGuard(activeRecord, 'updateGuards', updateGuard);\n}\nfunction guardToPromiseFn(guard, to, from, record, name) {\n    // keep a reference to the enterCallbackArray to prevent pushing callbacks if a new navigation took place\n    const enterCallbackArray = record &&\n        // name is defined if record is because of the function overload\n        (record.enterCallbacks[name] = record.enterCallbacks[name] || []);\n    return () => new Promise((resolve, reject) => {\n        const next = (valid) => {\n            if (valid === false) {\n                reject(createRouterError(4 /* ErrorTypes.NAVIGATION_ABORTED */, {\n                    from,\n                    to,\n                }));\n            }\n            else if (valid instanceof Error) {\n                reject(valid);\n            }\n            else if (isRouteLocation(valid)) {\n                reject(createRouterError(2 /* ErrorTypes.NAVIGATION_GUARD_REDIRECT */, {\n                    from: to,\n                    to: valid,\n                }));\n            }\n            else {\n                if (enterCallbackArray &&\n                    // since enterCallbackArray is truthy, both record and name also are\n                    record.enterCallbacks[name] === enterCallbackArray &&\n                    typeof valid === 'function') {\n                    enterCallbackArray.push(valid);\n                }\n                resolve();\n            }\n        };\n        // wrapping with Promise.resolve allows it to work with both async and sync guards\n        const guardReturn = guard.call(record && record.instances[name], to, from, (process.env.NODE_ENV !== 'production') ? canOnlyBeCalledOnce(next, to, from) : next);\n        let guardCall = Promise.resolve(guardReturn);\n        if (guard.length < 3)\n            guardCall = guardCall.then(next);\n        if ((process.env.NODE_ENV !== 'production') && guard.length > 2) {\n            const message = `The \"next\" callback was never called inside of ${guard.name ? '\"' + guard.name + '\"' : ''}:\\n${guard.toString()}\\n. If you are returning a value instead of calling \"next\", make sure to remove the \"next\" parameter from your function.`;\n            if (typeof guardReturn === 'object' && 'then' in guardReturn) {\n                guardCall = guardCall.then(resolvedValue => {\n                    // @ts-expect-error: _called is added at canOnlyBeCalledOnce\n                    if (!next._called) {\n                        warn(message);\n                        return Promise.reject(new Error('Invalid navigation guard'));\n                    }\n                    return resolvedValue;\n                });\n            }\n            else if (guardReturn !== undefined) {\n                // @ts-expect-error: _called is added at canOnlyBeCalledOnce\n                if (!next._called) {\n                    warn(message);\n                    reject(new Error('Invalid navigation guard'));\n                    return;\n                }\n            }\n        }\n        guardCall.catch(err => reject(err));\n    });\n}\nfunction canOnlyBeCalledOnce(next, to, from) {\n    let called = 0;\n    return function () {\n        if (called++ === 1)\n            warn(`The \"next\" callback was called more than once in one navigation guard when going from \"${from.fullPath}\" to \"${to.fullPath}\". It should be called exactly one time in each navigation guard. This will fail in production.`);\n        // @ts-expect-error: we put it in the original one because it's easier to check\n        next._called = true;\n        if (called === 1)\n            next.apply(null, arguments);\n    };\n}\nfunction extractComponentsGuards(matched, guardType, to, from) {\n    const guards = [];\n    for (const record of matched) {\n        if ((process.env.NODE_ENV !== 'production') && !record.components && !record.children.length) {\n            warn(`Record with path \"${record.path}\" is either missing a \"component(s)\"` +\n                ` or \"children\" property.`);\n        }\n        for (const name in record.components) {\n            let rawComponent = record.components[name];\n            if ((process.env.NODE_ENV !== 'production')) {\n                if (!rawComponent ||\n                    (typeof rawComponent !== 'object' &&\n                        typeof rawComponent !== 'function')) {\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is not` +\n                        ` a valid component. Received \"${String(rawComponent)}\".`);\n                    // throw to ensure we stop here but warn to ensure the message isn't\n                    // missed by the user\n                    throw new Error('Invalid route component');\n                }\n                else if ('then' in rawComponent) {\n                    // warn if user wrote import('/component.vue') instead of () =>\n                    // import('./component.vue')\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is a ` +\n                        `Promise instead of a function that returns a Promise. Did you ` +\n                        `write \"import('./MyPage.vue')\" instead of ` +\n                        `\"() => import('./MyPage.vue')\" ? This will break in ` +\n                        `production if not fixed.`);\n                    const promise = rawComponent;\n                    rawComponent = () => promise;\n                }\n                else if (rawComponent.__asyncLoader &&\n                    // warn only once per component\n                    !rawComponent.__warnedDefineAsync) {\n                    rawComponent.__warnedDefineAsync = true;\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is defined ` +\n                        `using \"defineAsyncComponent()\". ` +\n                        `Write \"() => import('./MyPage.vue')\" instead of ` +\n                        `\"defineAsyncComponent(() => import('./MyPage.vue'))\".`);\n                }\n            }\n            // skip update and leave guards if the route component is not mounted\n            if (guardType !== 'beforeRouteEnter' && !record.instances[name])\n                continue;\n            if (isRouteComponent(rawComponent)) {\n                // __vccOpts is added by vue-class-component and contain the regular options\n                const options = rawComponent.__vccOpts || rawComponent;\n                const guard = options[guardType];\n                guard && guards.push(guardToPromiseFn(guard, to, from, record, name));\n            }\n            else {\n                // start requesting the chunk already\n                let componentPromise = rawComponent();\n                if ((process.env.NODE_ENV !== 'production') && !('catch' in componentPromise)) {\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is a function that does not return a Promise. If you were passing a functional component, make sure to add a \"displayName\" to the component. This will break in production if not fixed.`);\n                    componentPromise = Promise.resolve(componentPromise);\n                }\n                guards.push(() => componentPromise.then(resolved => {\n                    if (!resolved)\n                        return Promise.reject(new Error(`Couldn't resolve component \"${name}\" at \"${record.path}\"`));\n                    const resolvedComponent = isESModule(resolved)\n                        ? resolved.default\n                        : resolved;\n                    // replace the function with the resolved component\n                    // cannot be null or undefined because we went into the for loop\n                    record.components[name] = resolvedComponent;\n                    // __vccOpts is added by vue-class-component and contain the regular options\n                    const options = resolvedComponent.__vccOpts || resolvedComponent;\n                    const guard = options[guardType];\n                    return guard && guardToPromiseFn(guard, to, from, record, name)();\n                }));\n            }\n        }\n    }\n    return guards;\n}\n/**\n * Allows differentiating lazy components from functional components and vue-class-component\n * @internal\n *\n * @param component\n */\nfunction isRouteComponent(component) {\n    return (typeof component === 'object' ||\n        'displayName' in component ||\n        'props' in component ||\n        '__vccOpts' in component);\n}\n/**\n * Ensures a route is loaded, so it can be passed as o prop to `<RouterView>`.\n *\n * @param route - resolved route to load\n */\nfunction loadRouteLocation(route) {\n    return route.matched.every(record => record.redirect)\n        ? Promise.reject(new Error('Cannot load a route that redirects.'))\n        : Promise.all(route.matched.map(record => record.components &&\n            Promise.all(Object.keys(record.components).reduce((promises, name) => {\n                const rawComponent = record.components[name];\n                if (typeof rawComponent === 'function' &&\n                    !('displayName' in rawComponent)) {\n                    promises.push(rawComponent().then(resolved => {\n                        if (!resolved)\n                            return Promise.reject(new Error(`Couldn't resolve component \"${name}\" at \"${record.path}\". Ensure you passed a function that returns a promise.`));\n                        const resolvedComponent = isESModule(resolved)\n                            ? resolved.default\n                            : resolved;\n                        // replace the function with the resolved component\n                        // cannot be null or undefined because we went into the for loop\n                        record.components[name] = resolvedComponent;\n                        return;\n                    }));\n                }\n                return promises;\n            }, [])))).then(() => route);\n}\n\n// TODO: we could allow currentRoute as a prop to expose `isActive` and\n// `isExactActive` behavior should go through an RFC\nfunction useLink(props) {\n    const router = inject(routerKey);\n    const currentRoute = inject(routeLocationKey);\n    const route = computed(() => router.resolve(unref(props.to)));\n    const activeRecordIndex = computed(() => {\n        const { matched } = route.value;\n        const { length } = matched;\n        const routeMatched = matched[length - 1];\n        const currentMatched = currentRoute.matched;\n        if (!routeMatched || !currentMatched.length)\n            return -1;\n        const index = currentMatched.findIndex(isSameRouteRecord.bind(null, routeMatched));\n        if (index > -1)\n            return index;\n        // possible parent record\n        const parentRecordPath = getOriginalPath(matched[length - 2]);\n        return (\n        // we are dealing with nested routes\n        length > 1 &&\n            // if the parent and matched route have the same path, this link is\n            // referring to the empty child. Or we currently are on a different\n            // child of the same parent\n            getOriginalPath(routeMatched) === parentRecordPath &&\n            // avoid comparing the child with its parent\n            currentMatched[currentMatched.length - 1].path !== parentRecordPath\n            ? currentMatched.findIndex(isSameRouteRecord.bind(null, matched[length - 2]))\n            : index);\n    });\n    const isActive = computed(() => activeRecordIndex.value > -1 &&\n        includesParams(currentRoute.params, route.value.params));\n    const isExactActive = computed(() => activeRecordIndex.value > -1 &&\n        activeRecordIndex.value === currentRoute.matched.length - 1 &&\n        isSameRouteLocationParams(currentRoute.params, route.value.params));\n    function navigate(e = {}) {\n        if (guardEvent(e)) {\n            return router[unref(props.replace) ? 'replace' : 'push'](unref(props.to)\n            // avoid uncaught errors are they are logged anyway\n            ).catch(noop);\n        }\n        return Promise.resolve();\n    }\n    // devtools only\n    if (((process.env.NODE_ENV !== 'production') || __VUE_PROD_DEVTOOLS__) && isBrowser) {\n        const instance = getCurrentInstance();\n        if (instance) {\n            const linkContextDevtools = {\n                route: route.value,\n                isActive: isActive.value,\n                isExactActive: isExactActive.value,\n            };\n            // @ts-expect-error: this is internal\n            instance.__vrl_devtools = instance.__vrl_devtools || [];\n            // @ts-expect-error: this is internal\n            instance.__vrl_devtools.push(linkContextDevtools);\n            watchEffect(() => {\n                linkContextDevtools.route = route.value;\n                linkContextDevtools.isActive = isActive.value;\n                linkContextDevtools.isExactActive = isExactActive.value;\n            }, { flush: 'post' });\n        }\n    }\n    /**\n     * NOTE: update {@link _RouterLinkI}'s `$slots` type when updating this\n     */\n    return {\n        route,\n        href: computed(() => route.value.href),\n        isActive,\n        isExactActive,\n        navigate,\n    };\n}\nconst RouterLinkImpl = /*#__PURE__*/ defineComponent({\n    name: 'RouterLink',\n    compatConfig: { MODE: 3 },\n    props: {\n        to: {\n            type: [String, Object],\n            required: true,\n        },\n        replace: Boolean,\n        activeClass: String,\n        // inactiveClass: String,\n        exactActiveClass: String,\n        custom: Boolean,\n        ariaCurrentValue: {\n            type: String,\n            default: 'page',\n        },\n    },\n    useLink,\n    setup(props, { slots }) {\n        const link = reactive(useLink(props));\n        const { options } = inject(routerKey);\n        const elClass = computed(() => ({\n            [getLinkClass(props.activeClass, options.linkActiveClass, 'router-link-active')]: link.isActive,\n            // [getLinkClass(\n            //   props.inactiveClass,\n            //   options.linkInactiveClass,\n            //   'router-link-inactive'\n            // )]: !link.isExactActive,\n            [getLinkClass(props.exactActiveClass, options.linkExactActiveClass, 'router-link-exact-active')]: link.isExactActive,\n        }));\n        return () => {\n            const children = slots.default && slots.default(link);\n            return props.custom\n                ? children\n                : h('a', {\n                    'aria-current': link.isExactActive\n                        ? props.ariaCurrentValue\n                        : null,\n                    href: link.href,\n                    // this would override user added attrs but Vue will still add\n                    // the listener, so we end up triggering both\n                    onClick: link.navigate,\n                    class: elClass.value,\n                }, children);\n        };\n    },\n});\n// export the public type for h/tsx inference\n// also to avoid inline import() in generated d.ts files\n/**\n * Component to render a link that triggers a navigation on click.\n */\nconst RouterLink = RouterLinkImpl;\nfunction guardEvent(e) {\n    // don't redirect with control keys\n    if (e.metaKey || e.altKey || e.ctrlKey || e.shiftKey)\n        return;\n    // don't redirect when preventDefault called\n    if (e.defaultPrevented)\n        return;\n    // don't redirect on right click\n    if (e.button !== undefined && e.button !== 0)\n        return;\n    // don't redirect if `target=\"_blank\"`\n    // @ts-expect-error getAttribute does exist\n    if (e.currentTarget && e.currentTarget.getAttribute) {\n        // @ts-expect-error getAttribute exists\n        const target = e.currentTarget.getAttribute('target');\n        if (/\\b_blank\\b/i.test(target))\n            return;\n    }\n    // this may be a Weex event which doesn't have this method\n    if (e.preventDefault)\n        e.preventDefault();\n    return true;\n}\nfunction includesParams(outer, inner) {\n    for (const key in inner) {\n        const innerValue = inner[key];\n        const outerValue = outer[key];\n        if (typeof innerValue === 'string') {\n            if (innerValue !== outerValue)\n                return false;\n        }\n        else {\n            if (!isArray(outerValue) ||\n                outerValue.length !== innerValue.length ||\n                innerValue.some((value, i) => value !== outerValue[i]))\n                return false;\n        }\n    }\n    return true;\n}\n/**\n * Get the original path value of a record by following its aliasOf\n * @param record\n */\nfunction getOriginalPath(record) {\n    return record ? (record.aliasOf ? record.aliasOf.path : record.path) : '';\n}\n/**\n * Utility class to get the active class based on defaults.\n * @param propClass\n * @param globalClass\n * @param defaultClass\n */\nconst getLinkClass = (propClass, globalClass, defaultClass) => propClass != null\n    ? propClass\n    : globalClass != null\n        ? globalClass\n        : defaultClass;\n\nconst RouterViewImpl = /*#__PURE__*/ defineComponent({\n    name: 'RouterView',\n    // #674 we manually inherit them\n    inheritAttrs: false,\n    props: {\n        name: {\n            type: String,\n            default: 'default',\n        },\n        route: Object,\n    },\n    // Better compat for @vue/compat users\n    // https://github.com/vuejs/router/issues/1315\n    compatConfig: { MODE: 3 },\n    setup(props, { attrs, slots }) {\n        (process.env.NODE_ENV !== 'production') && warnDeprecatedUsage();\n        const injectedRoute = inject(routerViewLocationKey);\n        const routeToDisplay = computed(() => props.route || injectedRoute.value);\n        const injectedDepth = inject(viewDepthKey, 0);\n        // The depth changes based on empty components option, which allows passthrough routes e.g. routes with children\n        // that are used to reuse the `path` property\n        const depth = computed(() => {\n            let initialDepth = unref(injectedDepth);\n            const { matched } = routeToDisplay.value;\n            let matchedRoute;\n            while ((matchedRoute = matched[initialDepth]) &&\n                !matchedRoute.components) {\n                initialDepth++;\n            }\n            return initialDepth;\n        });\n        const matchedRouteRef = computed(() => routeToDisplay.value.matched[depth.value]);\n        provide(viewDepthKey, computed(() => depth.value + 1));\n        provide(matchedRouteKey, matchedRouteRef);\n        provide(routerViewLocationKey, routeToDisplay);\n        const viewRef = ref();\n        // watch at the same time the component instance, the route record we are\n        // rendering, and the name\n        watch(() => [viewRef.value, matchedRouteRef.value, props.name], ([instance, to, name], [oldInstance, from, oldName]) => {\n            // copy reused instances\n            if (to) {\n                // this will update the instance for new instances as well as reused\n                // instances when navigating to a new route\n                to.instances[name] = instance;\n                // the component instance is reused for a different route or name, so\n                // we copy any saved update or leave guards. With async setup, the\n                // mounting component will mount before the matchedRoute changes,\n                // making instance === oldInstance, so we check if guards have been\n                // added before. This works because we remove guards when\n                // unmounting/deactivating components\n                if (from && from !== to && instance && instance === oldInstance) {\n                    if (!to.leaveGuards.size) {\n                        to.leaveGuards = from.leaveGuards;\n                    }\n                    if (!to.updateGuards.size) {\n                        to.updateGuards = from.updateGuards;\n                    }\n                }\n            }\n            // trigger beforeRouteEnter next callbacks\n            if (instance &&\n                to &&\n                // if there is no instance but to and from are the same this might be\n                // the first visit\n                (!from || !isSameRouteRecord(to, from) || !oldInstance)) {\n                (to.enterCallbacks[name] || []).forEach(callback => callback(instance));\n            }\n        }, { flush: 'post' });\n        return () => {\n            const route = routeToDisplay.value;\n            // we need the value at the time we render because when we unmount, we\n            // navigated to a different location so the value is different\n            const currentName = props.name;\n            const matchedRoute = matchedRouteRef.value;\n            const ViewComponent = matchedRoute && matchedRoute.components[currentName];\n            if (!ViewComponent) {\n                return normalizeSlot(slots.default, { Component: ViewComponent, route });\n            }\n            // props from route configuration\n            const routePropsOption = matchedRoute.props[currentName];\n            const routeProps = routePropsOption\n                ? routePropsOption === true\n                    ? route.params\n                    : typeof routePropsOption === 'function'\n                        ? routePropsOption(route)\n                        : routePropsOption\n                : null;\n            const onVnodeUnmounted = vnode => {\n                // remove the instance reference to prevent leak\n                if (vnode.component.isUnmounted) {\n                    matchedRoute.instances[currentName] = null;\n                }\n            };\n            const component = h(ViewComponent, assign({}, routeProps, attrs, {\n                onVnodeUnmounted,\n                ref: viewRef,\n            }));\n            if (((process.env.NODE_ENV !== 'production') || __VUE_PROD_DEVTOOLS__) &&\n                isBrowser &&\n                component.ref) {\n                // TODO: can display if it's an alias, its props\n                const info = {\n                    depth: depth.value,\n                    name: matchedRoute.name,\n                    path: matchedRoute.path,\n                    meta: matchedRoute.meta,\n                };\n                const internalInstances = isArray(component.ref)\n                    ? component.ref.map(r => r.i)\n                    : [component.ref.i];\n                internalInstances.forEach(instance => {\n                    // @ts-expect-error\n                    instance.__vrv_devtools = info;\n                });\n            }\n            return (\n            // pass the vnode to the slot as a prop.\n            // h and <component :is=\"...\"> both accept vnodes\n            normalizeSlot(slots.default, { Component: component, route }) ||\n                component);\n        };\n    },\n});\nfunction normalizeSlot(slot, data) {\n    if (!slot)\n        return null;\n    const slotContent = slot(data);\n    return slotContent.length === 1 ? slotContent[0] : slotContent;\n}\n// export the public type for h/tsx inference\n// also to avoid inline import() in generated d.ts files\n/**\n * Component to display the current route the user is at.\n */\nconst RouterView = RouterViewImpl;\n// warn against deprecated usage with <transition> & <keep-alive>\n// due to functional component being no longer eager in Vue 3\nfunction warnDeprecatedUsage() {\n    const instance = getCurrentInstance();\n    const parentName = instance.parent && instance.parent.type.name;\n    const parentSubTreeType = instance.parent && instance.parent.subTree && instance.parent.subTree.type;\n    if (parentName &&\n        (parentName === 'KeepAlive' || parentName.includes('Transition')) &&\n        typeof parentSubTreeType === 'object' &&\n        parentSubTreeType.name === 'RouterView') {\n        const comp = parentName === 'KeepAlive' ? 'keep-alive' : 'transition';\n        warn(`<router-view> can no longer be used directly inside <transition> or <keep-alive>.\\n` +\n            `Use slot props instead:\\n\\n` +\n            `<router-view v-slot=\"{ Component }\">\\n` +\n            `  <${comp}>\\n` +\n            `    <component :is=\"Component\" />\\n` +\n            `  </${comp}>\\n` +\n            `</router-view>`);\n    }\n}\n\n/**\n * Copies a route location and removes any problematic properties that cannot be shown in devtools (e.g. Vue instances).\n *\n * @param routeLocation - routeLocation to format\n * @param tooltip - optional tooltip\n * @returns a copy of the routeLocation\n */\nfunction formatRouteLocation(routeLocation, tooltip) {\n    const copy = assign({}, routeLocation, {\n        // remove variables that can contain vue instances\n        matched: routeLocation.matched.map(matched => omit(matched, ['instances', 'children', 'aliasOf'])),\n    });\n    return {\n        _custom: {\n            type: null,\n            readOnly: true,\n            display: routeLocation.fullPath,\n            tooltip,\n            value: copy,\n        },\n    };\n}\nfunction formatDisplay(display) {\n    return {\n        _custom: {\n            display,\n        },\n    };\n}\n// to support multiple router instances\nlet routerId = 0;\nfunction addDevtools(app, router, matcher) {\n    // Take over router.beforeEach and afterEach\n    // make sure we are not registering the devtool twice\n    if (router.__hasDevtools)\n        return;\n    router.__hasDevtools = true;\n    // increment to support multiple router instances\n    const id = routerId++;\n    setupDevtoolsPlugin({\n        id: 'org.vuejs.router' + (id ? '.' + id : ''),\n        label: 'Vue Router',\n        packageName: 'vue-router',\n        homepage: 'https://router.vuejs.org',\n        logo: 'https://router.vuejs.org/logo.png',\n        componentStateTypes: ['Routing'],\n        app,\n    }, api => {\n        if (typeof api.now !== 'function') {\n            console.warn('[Vue Router]: You seem to be using an outdated version of Vue Devtools. Are you still using the Beta release instead of the stable one? You can find the links at https://devtools.vuejs.org/guide/installation.html.');\n        }\n        // display state added by the router\n        api.on.inspectComponent((payload, ctx) => {\n            if (payload.instanceData) {\n                payload.instanceData.state.push({\n                    type: 'Routing',\n                    key: '$route',\n                    editable: false,\n                    value: formatRouteLocation(router.currentRoute.value, 'Current Route'),\n                });\n            }\n        });\n        // mark router-link as active and display tags on router views\n        api.on.visitComponentTree(({ treeNode: node, componentInstance }) => {\n            if (componentInstance.__vrv_devtools) {\n                const info = componentInstance.__vrv_devtools;\n                node.tags.push({\n                    label: (info.name ? `${info.name.toString()}: ` : '') + info.path,\n                    textColor: 0,\n                    tooltip: 'This component is rendered by &lt;router-view&gt;',\n                    backgroundColor: PINK_500,\n                });\n            }\n            // if multiple useLink are used\n            if (isArray(componentInstance.__vrl_devtools)) {\n                componentInstance.__devtoolsApi = api;\n                componentInstance.__vrl_devtools.forEach(devtoolsData => {\n                    let backgroundColor = ORANGE_400;\n                    let tooltip = '';\n                    if (devtoolsData.isExactActive) {\n                        backgroundColor = LIME_500;\n                        tooltip = 'This is exactly active';\n                    }\n                    else if (devtoolsData.isActive) {\n                        backgroundColor = BLUE_600;\n                        tooltip = 'This link is active';\n                    }\n                    node.tags.push({\n                        label: devtoolsData.route.path,\n                        textColor: 0,\n                        tooltip,\n                        backgroundColor,\n                    });\n                });\n            }\n        });\n        watch(router.currentRoute, () => {\n            // refresh active state\n            refreshRoutesView();\n            api.notifyComponentUpdate();\n            api.sendInspectorTree(routerInspectorId);\n            api.sendInspectorState(routerInspectorId);\n        });\n        const navigationsLayerId = 'router:navigations:' + id;\n        api.addTimelineLayer({\n            id: navigationsLayerId,\n            label: `Router${id ? ' ' + id : ''} Navigations`,\n            color: 0x40a8c4,\n        });\n        // const errorsLayerId = 'router:errors'\n        // api.addTimelineLayer({\n        //   id: errorsLayerId,\n        //   label: 'Router Errors',\n        //   color: 0xea5455,\n        // })\n        router.onError((error, to) => {\n            api.addTimelineEvent({\n                layerId: navigationsLayerId,\n                event: {\n                    title: 'Error during Navigation',\n                    subtitle: to.fullPath,\n                    logType: 'error',\n                    time: api.now(),\n                    data: { error },\n                    groupId: to.meta.__navigationId,\n                },\n            });\n        });\n        // attached to `meta` and used to group events\n        let navigationId = 0;\n        router.beforeEach((to, from) => {\n            const data = {\n                guard: formatDisplay('beforeEach'),\n                from: formatRouteLocation(from, 'Current Location during this navigation'),\n                to: formatRouteLocation(to, 'Target location'),\n            };\n            // Used to group navigations together, hide from devtools\n            Object.defineProperty(to.meta, '__navigationId', {\n                value: navigationId++,\n            });\n            api.addTimelineEvent({\n                layerId: navigationsLayerId,\n                event: {\n                    time: api.now(),\n                    title: 'Start of navigation',\n                    subtitle: to.fullPath,\n                    data,\n                    groupId: to.meta.__navigationId,\n                },\n            });\n        });\n        router.afterEach((to, from, failure) => {\n            const data = {\n                guard: formatDisplay('afterEach'),\n            };\n            if (failure) {\n                data.failure = {\n                    _custom: {\n                        type: Error,\n                        readOnly: true,\n                        display: failure ? failure.message : '',\n                        tooltip: 'Navigation Failure',\n                        value: failure,\n                    },\n                };\n                data.status = formatDisplay('❌');\n            }\n            else {\n                data.status = formatDisplay('✅');\n            }\n            // we set here to have the right order\n            data.from = formatRouteLocation(from, 'Current Location during this navigation');\n            data.to = formatRouteLocation(to, 'Target location');\n            api.addTimelineEvent({\n                layerId: navigationsLayerId,\n                event: {\n                    title: 'End of navigation',\n                    subtitle: to.fullPath,\n                    time: api.now(),\n                    data,\n                    logType: failure ? 'warning' : 'default',\n                    groupId: to.meta.__navigationId,\n                },\n            });\n        });\n        /**\n         * Inspector of Existing routes\n         */\n        const routerInspectorId = 'router-inspector:' + id;\n        api.addInspector({\n            id: routerInspectorId,\n            label: 'Routes' + (id ? ' ' + id : ''),\n            icon: 'book',\n            treeFilterPlaceholder: 'Search routes',\n        });\n        function refreshRoutesView() {\n            // the routes view isn't active\n            if (!activeRoutesPayload)\n                return;\n            const payload = activeRoutesPayload;\n            // children routes will appear as nested\n            let routes = matcher.getRoutes().filter(route => !route.parent ||\n                // these routes have a parent with no component which will not appear in the view\n                // therefore we still need to include them\n                !route.parent.record.components);\n            // reset match state to false\n            routes.forEach(resetMatchStateOnRouteRecord);\n            // apply a match state if there is a payload\n            if (payload.filter) {\n                routes = routes.filter(route => \n                // save matches state based on the payload\n                isRouteMatching(route, payload.filter.toLowerCase()));\n            }\n            // mark active routes\n            routes.forEach(route => markRouteRecordActive(route, router.currentRoute.value));\n            payload.rootNodes = routes.map(formatRouteRecordForInspector);\n        }\n        let activeRoutesPayload;\n        api.on.getInspectorTree(payload => {\n            activeRoutesPayload = payload;\n            if (payload.app === app && payload.inspectorId === routerInspectorId) {\n                refreshRoutesView();\n            }\n        });\n        /**\n         * Display information about the currently selected route record\n         */\n        api.on.getInspectorState(payload => {\n            if (payload.app === app && payload.inspectorId === routerInspectorId) {\n                const routes = matcher.getRoutes();\n                const route = routes.find(route => route.record.__vd_id === payload.nodeId);\n                if (route) {\n                    payload.state = {\n                        options: formatRouteRecordMatcherForStateInspector(route),\n                    };\n                }\n            }\n        });\n        api.sendInspectorTree(routerInspectorId);\n        api.sendInspectorState(routerInspectorId);\n    });\n}\nfunction modifierForKey(key) {\n    if (key.optional) {\n        return key.repeatable ? '*' : '?';\n    }\n    else {\n        return key.repeatable ? '+' : '';\n    }\n}\nfunction formatRouteRecordMatcherForStateInspector(route) {\n    const { record } = route;\n    const fields = [\n        { editable: false, key: 'path', value: record.path },\n    ];\n    if (record.name != null) {\n        fields.push({\n            editable: false,\n            key: 'name',\n            value: record.name,\n        });\n    }\n    fields.push({ editable: false, key: 'regexp', value: route.re });\n    if (route.keys.length) {\n        fields.push({\n            editable: false,\n            key: 'keys',\n            value: {\n                _custom: {\n                    type: null,\n                    readOnly: true,\n                    display: route.keys\n                        .map(key => `${key.name}${modifierForKey(key)}`)\n                        .join(' '),\n                    tooltip: 'Param keys',\n                    value: route.keys,\n                },\n            },\n        });\n    }\n    if (record.redirect != null) {\n        fields.push({\n            editable: false,\n            key: 'redirect',\n            value: record.redirect,\n        });\n    }\n    if (route.alias.length) {\n        fields.push({\n            editable: false,\n            key: 'aliases',\n            value: route.alias.map(alias => alias.record.path),\n        });\n    }\n    if (Object.keys(route.record.meta).length) {\n        fields.push({\n            editable: false,\n            key: 'meta',\n            value: route.record.meta,\n        });\n    }\n    fields.push({\n        key: 'score',\n        editable: false,\n        value: {\n            _custom: {\n                type: null,\n                readOnly: true,\n                display: route.score.map(score => score.join(', ')).join(' | '),\n                tooltip: 'Score used to sort routes',\n                value: route.score,\n            },\n        },\n    });\n    return fields;\n}\n/**\n * Extracted from tailwind palette\n */\nconst PINK_500 = 0xec4899;\nconst BLUE_600 = 0x2563eb;\nconst LIME_500 = 0x84cc16;\nconst CYAN_400 = 0x22d3ee;\nconst ORANGE_400 = 0xfb923c;\n// const GRAY_100 = 0xf4f4f5\nconst DARK = 0x666666;\nfunction formatRouteRecordForInspector(route) {\n    const tags = [];\n    const { record } = route;\n    if (record.name != null) {\n        tags.push({\n            label: String(record.name),\n            textColor: 0,\n            backgroundColor: CYAN_400,\n        });\n    }\n    if (record.aliasOf) {\n        tags.push({\n            label: 'alias',\n            textColor: 0,\n            backgroundColor: ORANGE_400,\n        });\n    }\n    if (route.__vd_match) {\n        tags.push({\n            label: 'matches',\n            textColor: 0,\n            backgroundColor: PINK_500,\n        });\n    }\n    if (route.__vd_exactActive) {\n        tags.push({\n            label: 'exact',\n            textColor: 0,\n            backgroundColor: LIME_500,\n        });\n    }\n    if (route.__vd_active) {\n        tags.push({\n            label: 'active',\n            textColor: 0,\n            backgroundColor: BLUE_600,\n        });\n    }\n    if (record.redirect) {\n        tags.push({\n            label: typeof record.redirect === 'string'\n                ? `redirect: ${record.redirect}`\n                : 'redirects',\n            textColor: 0xffffff,\n            backgroundColor: DARK,\n        });\n    }\n    // add an id to be able to select it. Using the `path` is not possible because\n    // empty path children would collide with their parents\n    let id = record.__vd_id;\n    if (id == null) {\n        id = String(routeRecordId++);\n        record.__vd_id = id;\n    }\n    return {\n        id,\n        label: record.path,\n        tags,\n        children: route.children.map(formatRouteRecordForInspector),\n    };\n}\n//  incremental id for route records and inspector state\nlet routeRecordId = 0;\nconst EXTRACT_REGEXP_RE = /^\\/(.*)\\/([a-z]*)$/;\nfunction markRouteRecordActive(route, currentRoute) {\n    // no route will be active if matched is empty\n    // reset the matching state\n    const isExactActive = currentRoute.matched.length &&\n        isSameRouteRecord(currentRoute.matched[currentRoute.matched.length - 1], route.record);\n    route.__vd_exactActive = route.__vd_active = isExactActive;\n    if (!isExactActive) {\n        route.__vd_active = currentRoute.matched.some(match => isSameRouteRecord(match, route.record));\n    }\n    route.children.forEach(childRoute => markRouteRecordActive(childRoute, currentRoute));\n}\nfunction resetMatchStateOnRouteRecord(route) {\n    route.__vd_match = false;\n    route.children.forEach(resetMatchStateOnRouteRecord);\n}\nfunction isRouteMatching(route, filter) {\n    const found = String(route.re).match(EXTRACT_REGEXP_RE);\n    route.__vd_match = false;\n    if (!found || found.length < 3) {\n        return false;\n    }\n    // use a regexp without $ at the end to match nested routes better\n    const nonEndingRE = new RegExp(found[1].replace(/\\$$/, ''), found[2]);\n    if (nonEndingRE.test(filter)) {\n        // mark children as matches\n        route.children.forEach(child => isRouteMatching(child, filter));\n        // exception case: `/`\n        if (route.record.path !== '/' || filter === '/') {\n            route.__vd_match = route.re.test(filter);\n            return true;\n        }\n        // hide the / route\n        return false;\n    }\n    const path = route.record.path.toLowerCase();\n    const decodedPath = decode(path);\n    // also allow partial matching on the path\n    if (!filter.startsWith('/') &&\n        (decodedPath.includes(filter) || path.includes(filter)))\n        return true;\n    if (decodedPath.startsWith(filter) || path.startsWith(filter))\n        return true;\n    if (route.record.name && String(route.record.name).includes(filter))\n        return true;\n    return route.children.some(child => isRouteMatching(child, filter));\n}\nfunction omit(obj, keys) {\n    const ret = {};\n    for (const key in obj) {\n        if (!keys.includes(key)) {\n            // @ts-expect-error\n            ret[key] = obj[key];\n        }\n    }\n    return ret;\n}\n\n/**\n * Creates a Router instance that can be used by a Vue app.\n *\n * @param options - {@link RouterOptions}\n */\nfunction createRouter(options) {\n    const matcher = createRouterMatcher(options.routes, options);\n    const parseQuery$1 = options.parseQuery || parseQuery;\n    const stringifyQuery$1 = options.stringifyQuery || stringifyQuery;\n    const routerHistory = options.history;\n    if ((process.env.NODE_ENV !== 'production') && !routerHistory)\n        throw new Error('Provide the \"history\" option when calling \"createRouter()\":' +\n            ' https://next.router.vuejs.org/api/#history.');\n    const beforeGuards = useCallbacks();\n    const beforeResolveGuards = useCallbacks();\n    const afterGuards = useCallbacks();\n    const currentRoute = shallowRef(START_LOCATION_NORMALIZED);\n    let pendingLocation = START_LOCATION_NORMALIZED;\n    // leave the scrollRestoration if no scrollBehavior is provided\n    if (isBrowser && options.scrollBehavior && 'scrollRestoration' in history) {\n        history.scrollRestoration = 'manual';\n    }\n    const normalizeParams = applyToParams.bind(null, paramValue => '' + paramValue);\n    const encodeParams = applyToParams.bind(null, encodeParam);\n    const decodeParams = \n    // @ts-expect-error: intentionally avoid the type check\n    applyToParams.bind(null, decode);\n    function addRoute(parentOrRoute, route) {\n        let parent;\n        let record;\n        if (isRouteName(parentOrRoute)) {\n            parent = matcher.getRecordMatcher(parentOrRoute);\n            record = route;\n        }\n        else {\n            record = parentOrRoute;\n        }\n        return matcher.addRoute(record, parent);\n    }\n    function removeRoute(name) {\n        const recordMatcher = matcher.getRecordMatcher(name);\n        if (recordMatcher) {\n            matcher.removeRoute(recordMatcher);\n        }\n        else if ((process.env.NODE_ENV !== 'production')) {\n            warn(`Cannot remove non-existent route \"${String(name)}\"`);\n        }\n    }\n    function getRoutes() {\n        return matcher.getRoutes().map(routeMatcher => routeMatcher.record);\n    }\n    function hasRoute(name) {\n        return !!matcher.getRecordMatcher(name);\n    }\n    function resolve(rawLocation, currentLocation) {\n        // const objectLocation = routerLocationAsObject(rawLocation)\n        // we create a copy to modify it later\n        currentLocation = assign({}, currentLocation || currentRoute.value);\n        if (typeof rawLocation === 'string') {\n            const locationNormalized = parseURL(parseQuery$1, rawLocation, currentLocation.path);\n            const matchedRoute = matcher.resolve({ path: locationNormalized.path }, currentLocation);\n            const href = routerHistory.createHref(locationNormalized.fullPath);\n            if ((process.env.NODE_ENV !== 'production')) {\n                if (href.startsWith('//'))\n                    warn(`Location \"${rawLocation}\" resolved to \"${href}\". A resolved location cannot start with multiple slashes.`);\n                else if (!matchedRoute.matched.length) {\n                    warn(`No match found for location with path \"${rawLocation}\"`);\n                }\n            }\n            // locationNormalized is always a new object\n            return assign(locationNormalized, matchedRoute, {\n                params: decodeParams(matchedRoute.params),\n                hash: decode(locationNormalized.hash),\n                redirectedFrom: undefined,\n                href,\n            });\n        }\n        let matcherLocation;\n        // path could be relative in object as well\n        if ('path' in rawLocation) {\n            if ((process.env.NODE_ENV !== 'production') &&\n                'params' in rawLocation &&\n                !('name' in rawLocation) &&\n                // @ts-expect-error: the type is never\n                Object.keys(rawLocation.params).length) {\n                warn(`Path \"${rawLocation.path}\" was passed with params but they will be ignored. Use a named route alongside params instead.`);\n            }\n            matcherLocation = assign({}, rawLocation, {\n                path: parseURL(parseQuery$1, rawLocation.path, currentLocation.path).path,\n            });\n        }\n        else {\n            // remove any nullish param\n            const targetParams = assign({}, rawLocation.params);\n            for (const key in targetParams) {\n                if (targetParams[key] == null) {\n                    delete targetParams[key];\n                }\n            }\n            // pass encoded values to the matcher, so it can produce encoded path and fullPath\n            matcherLocation = assign({}, rawLocation, {\n                params: encodeParams(targetParams),\n            });\n            // current location params are decoded, we need to encode them in case the\n            // matcher merges the params\n            currentLocation.params = encodeParams(currentLocation.params);\n        }\n        const matchedRoute = matcher.resolve(matcherLocation, currentLocation);\n        const hash = rawLocation.hash || '';\n        if ((process.env.NODE_ENV !== 'production') && hash && !hash.startsWith('#')) {\n            warn(`A \\`hash\\` should always start with the character \"#\". Replace \"${hash}\" with \"#${hash}\".`);\n        }\n        // the matcher might have merged current location params, so\n        // we need to run the decoding again\n        matchedRoute.params = normalizeParams(decodeParams(matchedRoute.params));\n        const fullPath = stringifyURL(stringifyQuery$1, assign({}, rawLocation, {\n            hash: encodeHash(hash),\n            path: matchedRoute.path,\n        }));\n        const href = routerHistory.createHref(fullPath);\n        if ((process.env.NODE_ENV !== 'production')) {\n            if (href.startsWith('//')) {\n                warn(`Location \"${rawLocation}\" resolved to \"${href}\". A resolved location cannot start with multiple slashes.`);\n            }\n            else if (!matchedRoute.matched.length) {\n                warn(`No match found for location with path \"${'path' in rawLocation ? rawLocation.path : rawLocation}\"`);\n            }\n        }\n        return assign({\n            fullPath,\n            // keep the hash encoded so fullPath is effectively path + encodedQuery +\n            // hash\n            hash,\n            query: \n            // if the user is using a custom query lib like qs, we might have\n            // nested objects, so we keep the query as is, meaning it can contain\n            // numbers at `$route.query`, but at the point, the user will have to\n            // use their own type anyway.\n            // https://github.com/vuejs/router/issues/328#issuecomment-649481567\n            stringifyQuery$1 === stringifyQuery\n                ? normalizeQuery(rawLocation.query)\n                : (rawLocation.query || {}),\n        }, matchedRoute, {\n            redirectedFrom: undefined,\n            href,\n        });\n    }\n    function locationAsObject(to) {\n        return typeof to === 'string'\n            ? parseURL(parseQuery$1, to, currentRoute.value.path)\n            : assign({}, to);\n    }\n    function checkCanceledNavigation(to, from) {\n        if (pendingLocation !== to) {\n            return createRouterError(8 /* ErrorTypes.NAVIGATION_CANCELLED */, {\n                from,\n                to,\n            });\n        }\n    }\n    function push(to) {\n        return pushWithRedirect(to);\n    }\n    function replace(to) {\n        return push(assign(locationAsObject(to), { replace: true }));\n    }\n    function handleRedirectRecord(to) {\n        const lastMatched = to.matched[to.matched.length - 1];\n        if (lastMatched && lastMatched.redirect) {\n            const { redirect } = lastMatched;\n            let newTargetLocation = typeof redirect === 'function' ? redirect(to) : redirect;\n            if (typeof newTargetLocation === 'string') {\n                newTargetLocation =\n                    newTargetLocation.includes('?') || newTargetLocation.includes('#')\n                        ? (newTargetLocation = locationAsObject(newTargetLocation))\n                        : // force empty params\n                            { path: newTargetLocation };\n                // @ts-expect-error: force empty params when a string is passed to let\n                // the router parse them again\n                newTargetLocation.params = {};\n            }\n            if ((process.env.NODE_ENV !== 'production') &&\n                !('path' in newTargetLocation) &&\n                !('name' in newTargetLocation)) {\n                warn(`Invalid redirect found:\\n${JSON.stringify(newTargetLocation, null, 2)}\\n when navigating to \"${to.fullPath}\". A redirect must contain a name or path. This will break in production.`);\n                throw new Error('Invalid redirect');\n            }\n            return assign({\n                query: to.query,\n                hash: to.hash,\n                // avoid transferring params if the redirect has a path\n                params: 'path' in newTargetLocation ? {} : to.params,\n            }, newTargetLocation);\n        }\n    }\n    function pushWithRedirect(to, redirectedFrom) {\n        const targetLocation = (pendingLocation = resolve(to));\n        const from = currentRoute.value;\n        const data = to.state;\n        const force = to.force;\n        // to could be a string where `replace` is a function\n        const replace = to.replace === true;\n        const shouldRedirect = handleRedirectRecord(targetLocation);\n        if (shouldRedirect)\n            return pushWithRedirect(assign(locationAsObject(shouldRedirect), {\n                state: typeof shouldRedirect === 'object'\n                    ? assign({}, data, shouldRedirect.state)\n                    : data,\n                force,\n                replace,\n            }), \n            // keep original redirectedFrom if it exists\n            redirectedFrom || targetLocation);\n        // if it was a redirect we already called `pushWithRedirect` above\n        const toLocation = targetLocation;\n        toLocation.redirectedFrom = redirectedFrom;\n        let failure;\n        if (!force && isSameRouteLocation(stringifyQuery$1, from, targetLocation)) {\n            failure = createRouterError(16 /* ErrorTypes.NAVIGATION_DUPLICATED */, { to: toLocation, from });\n            // trigger scroll to allow scrolling to the same anchor\n            handleScroll(from, from, \n            // this is a push, the only way for it to be triggered from a\n            // history.listen is with a redirect, which makes it become a push\n            true, \n            // This cannot be the first navigation because the initial location\n            // cannot be manually navigated to\n            false);\n        }\n        return (failure ? Promise.resolve(failure) : navigate(toLocation, from))\n            .catch((error) => isNavigationFailure(error)\n            ? // navigation redirects still mark the router as ready\n                isNavigationFailure(error, 2 /* ErrorTypes.NAVIGATION_GUARD_REDIRECT */)\n                    ? error\n                    : markAsReady(error) // also returns the error\n            : // reject any unknown error\n                triggerError(error, toLocation, from))\n            .then((failure) => {\n            if (failure) {\n                if (isNavigationFailure(failure, 2 /* ErrorTypes.NAVIGATION_GUARD_REDIRECT */)) {\n                    if ((process.env.NODE_ENV !== 'production') &&\n                        // we are redirecting to the same location we were already at\n                        isSameRouteLocation(stringifyQuery$1, resolve(failure.to), toLocation) &&\n                        // and we have done it a couple of times\n                        redirectedFrom &&\n                        // @ts-expect-error: added only in dev\n                        (redirectedFrom._count = redirectedFrom._count\n                            ? // @ts-expect-error\n                                redirectedFrom._count + 1\n                            : 1) > 30) {\n                        warn(`Detected a possibly infinite redirection in a navigation guard when going from \"${from.fullPath}\" to \"${toLocation.fullPath}\". Aborting to avoid a Stack Overflow.\\n Are you always returning a new location within a navigation guard? That would lead to this error. Only return when redirecting or aborting, that should fix this. This might break in production if not fixed.`);\n                        return Promise.reject(new Error('Infinite redirect in navigation guard'));\n                    }\n                    return pushWithRedirect(\n                    // keep options\n                    assign({\n                        // preserve an existing replacement but allow the redirect to override it\n                        replace,\n                    }, locationAsObject(failure.to), {\n                        state: typeof failure.to === 'object'\n                            ? assign({}, data, failure.to.state)\n                            : data,\n                        force,\n                    }), \n                    // preserve the original redirectedFrom if any\n                    redirectedFrom || toLocation);\n                }\n            }\n            else {\n                // if we fail we don't finalize the navigation\n                failure = finalizeNavigation(toLocation, from, true, replace, data);\n            }\n            triggerAfterEach(toLocation, from, failure);\n            return failure;\n        });\n    }\n    /**\n     * Helper to reject and skip all navigation guards if a new navigation happened\n     * @param to\n     * @param from\n     */\n    function checkCanceledNavigationAndReject(to, from) {\n        const error = checkCanceledNavigation(to, from);\n        return error ? Promise.reject(error) : Promise.resolve();\n    }\n    function runWithContext(fn) {\n        const app = installedApps.values().next().value;\n        // support Vue < 3.3\n        return app && typeof app.runWithContext === 'function'\n            ? app.runWithContext(fn)\n            : fn();\n    }\n    // TODO: refactor the whole before guards by internally using router.beforeEach\n    function navigate(to, from) {\n        let guards;\n        const [leavingRecords, updatingRecords, enteringRecords] = extractChangingRecords(to, from);\n        // all components here have been resolved once because we are leaving\n        guards = extractComponentsGuards(leavingRecords.reverse(), 'beforeRouteLeave', to, from);\n        // leavingRecords is already reversed\n        for (const record of leavingRecords) {\n            record.leaveGuards.forEach(guard => {\n                guards.push(guardToPromiseFn(guard, to, from));\n            });\n        }\n        const canceledNavigationCheck = checkCanceledNavigationAndReject.bind(null, to, from);\n        guards.push(canceledNavigationCheck);\n        // run the queue of per route beforeRouteLeave guards\n        return (runGuardQueue(guards)\n            .then(() => {\n            // check global guards beforeEach\n            guards = [];\n            for (const guard of beforeGuards.list()) {\n                guards.push(guardToPromiseFn(guard, to, from));\n            }\n            guards.push(canceledNavigationCheck);\n            return runGuardQueue(guards);\n        })\n            .then(() => {\n            // check in components beforeRouteUpdate\n            guards = extractComponentsGuards(updatingRecords, 'beforeRouteUpdate', to, from);\n            for (const record of updatingRecords) {\n                record.updateGuards.forEach(guard => {\n                    guards.push(guardToPromiseFn(guard, to, from));\n                });\n            }\n            guards.push(canceledNavigationCheck);\n            // run the queue of per route beforeEnter guards\n            return runGuardQueue(guards);\n        })\n            .then(() => {\n            // check the route beforeEnter\n            guards = [];\n            for (const record of enteringRecords) {\n                // do not trigger beforeEnter on reused views\n                if (record.beforeEnter) {\n                    if (isArray(record.beforeEnter)) {\n                        for (const beforeEnter of record.beforeEnter)\n                            guards.push(guardToPromiseFn(beforeEnter, to, from));\n                    }\n                    else {\n                        guards.push(guardToPromiseFn(record.beforeEnter, to, from));\n                    }\n                }\n            }\n            guards.push(canceledNavigationCheck);\n            // run the queue of per route beforeEnter guards\n            return runGuardQueue(guards);\n        })\n            .then(() => {\n            // NOTE: at this point to.matched is normalized and does not contain any () => Promise<Component>\n            // clear existing enterCallbacks, these are added by extractComponentsGuards\n            to.matched.forEach(record => (record.enterCallbacks = {}));\n            // check in-component beforeRouteEnter\n            guards = extractComponentsGuards(enteringRecords, 'beforeRouteEnter', to, from);\n            guards.push(canceledNavigationCheck);\n            // run the queue of per route beforeEnter guards\n            return runGuardQueue(guards);\n        })\n            .then(() => {\n            // check global guards beforeResolve\n            guards = [];\n            for (const guard of beforeResolveGuards.list()) {\n                guards.push(guardToPromiseFn(guard, to, from));\n            }\n            guards.push(canceledNavigationCheck);\n            return runGuardQueue(guards);\n        })\n            // catch any navigation canceled\n            .catch(err => isNavigationFailure(err, 8 /* ErrorTypes.NAVIGATION_CANCELLED */)\n            ? err\n            : Promise.reject(err)));\n    }\n    function triggerAfterEach(to, from, failure) {\n        // navigation is confirmed, call afterGuards\n        // TODO: wrap with error handlers\n        afterGuards\n            .list()\n            .forEach(guard => runWithContext(() => guard(to, from, failure)));\n    }\n    /**\n     * - Cleans up any navigation guards\n     * - Changes the url if necessary\n     * - Calls the scrollBehavior\n     */\n    function finalizeNavigation(toLocation, from, isPush, replace, data) {\n        // a more recent navigation took place\n        const error = checkCanceledNavigation(toLocation, from);\n        if (error)\n            return error;\n        // only consider as push if it's not the first navigation\n        const isFirstNavigation = from === START_LOCATION_NORMALIZED;\n        const state = !isBrowser ? {} : history.state;\n        // change URL only if the user did a push/replace and if it's not the initial navigation because\n        // it's just reflecting the url\n        if (isPush) {\n            // on the initial navigation, we want to reuse the scroll position from\n            // history state if it exists\n            if (replace || isFirstNavigation)\n                routerHistory.replace(toLocation.fullPath, assign({\n                    scroll: isFirstNavigation && state && state.scroll,\n                }, data));\n            else\n                routerHistory.push(toLocation.fullPath, data);\n        }\n        // accept current navigation\n        currentRoute.value = toLocation;\n        handleScroll(toLocation, from, isPush, isFirstNavigation);\n        markAsReady();\n    }\n    let removeHistoryListener;\n    // attach listener to history to trigger navigations\n    function setupListeners() {\n        // avoid setting up listeners twice due to an invalid first navigation\n        if (removeHistoryListener)\n            return;\n        removeHistoryListener = routerHistory.listen((to, _from, info) => {\n            if (!router.listening)\n                return;\n            // cannot be a redirect route because it was in history\n            const toLocation = resolve(to);\n            // due to dynamic routing, and to hash history with manual navigation\n            // (manually changing the url or calling history.hash = '#/somewhere'),\n            // there could be a redirect record in history\n            const shouldRedirect = handleRedirectRecord(toLocation);\n            if (shouldRedirect) {\n                pushWithRedirect(assign(shouldRedirect, { replace: true }), toLocation).catch(noop);\n                return;\n            }\n            pendingLocation = toLocation;\n            const from = currentRoute.value;\n            // TODO: should be moved to web history?\n            if (isBrowser) {\n                saveScrollPosition(getScrollKey(from.fullPath, info.delta), computeScrollPosition());\n            }\n            navigate(toLocation, from)\n                .catch((error) => {\n                if (isNavigationFailure(error, 4 /* ErrorTypes.NAVIGATION_ABORTED */ | 8 /* ErrorTypes.NAVIGATION_CANCELLED */)) {\n                    return error;\n                }\n                if (isNavigationFailure(error, 2 /* ErrorTypes.NAVIGATION_GUARD_REDIRECT */)) {\n                    // Here we could call if (info.delta) routerHistory.go(-info.delta,\n                    // false) but this is bug prone as we have no way to wait the\n                    // navigation to be finished before calling pushWithRedirect. Using\n                    // a setTimeout of 16ms seems to work but there is no guarantee for\n                    // it to work on every browser. So instead we do not restore the\n                    // history entry and trigger a new navigation as requested by the\n                    // navigation guard.\n                    // the error is already handled by router.push we just want to avoid\n                    // logging the error\n                    pushWithRedirect(error.to, toLocation\n                    // avoid an uncaught rejection, let push call triggerError\n                    )\n                        .then(failure => {\n                        // manual change in hash history #916 ending up in the URL not\n                        // changing, but it was changed by the manual url change, so we\n                        // need to manually change it ourselves\n                        if (isNavigationFailure(failure, 4 /* ErrorTypes.NAVIGATION_ABORTED */ |\n                            16 /* ErrorTypes.NAVIGATION_DUPLICATED */) &&\n                            !info.delta &&\n                            info.type === NavigationType.pop) {\n                            routerHistory.go(-1, false);\n                        }\n                    })\n                        .catch(noop);\n                    // avoid the then branch\n                    return Promise.reject();\n                }\n                // do not restore history on unknown direction\n                if (info.delta) {\n                    routerHistory.go(-info.delta, false);\n                }\n                // unrecognized error, transfer to the global handler\n                return triggerError(error, toLocation, from);\n            })\n                .then((failure) => {\n                failure =\n                    failure ||\n                        finalizeNavigation(\n                        // after navigation, all matched components are resolved\n                        toLocation, from, false);\n                // revert the navigation\n                if (failure) {\n                    if (info.delta &&\n                        // a new navigation has been triggered, so we do not want to revert, that will change the current history\n                        // entry while a different route is displayed\n                        !isNavigationFailure(failure, 8 /* ErrorTypes.NAVIGATION_CANCELLED */)) {\n                        routerHistory.go(-info.delta, false);\n                    }\n                    else if (info.type === NavigationType.pop &&\n                        isNavigationFailure(failure, 4 /* ErrorTypes.NAVIGATION_ABORTED */ | 16 /* ErrorTypes.NAVIGATION_DUPLICATED */)) {\n                        // manual change in hash history #916\n                        // it's like a push but lacks the information of the direction\n                        routerHistory.go(-1, false);\n                    }\n                }\n                triggerAfterEach(toLocation, from, failure);\n            })\n                // avoid warnings in the console about uncaught rejections, they are logged by triggerErrors\n                .catch(noop);\n        });\n    }\n    // Initialization and Errors\n    let readyHandlers = useCallbacks();\n    let errorListeners = useCallbacks();\n    let ready;\n    /**\n     * Trigger errorListeners added via onError and throws the error as well\n     *\n     * @param error - error to throw\n     * @param to - location we were navigating to when the error happened\n     * @param from - location we were navigating from when the error happened\n     * @returns the error as a rejected promise\n     */\n    function triggerError(error, to, from) {\n        markAsReady(error);\n        const list = errorListeners.list();\n        if (list.length) {\n            list.forEach(handler => handler(error, to, from));\n        }\n        else {\n            if ((process.env.NODE_ENV !== 'production')) {\n                warn('uncaught error during route navigation:');\n            }\n            console.error(error);\n        }\n        // reject the error no matter there were error listeners or not\n        return Promise.reject(error);\n    }\n    function isReady() {\n        if (ready && currentRoute.value !== START_LOCATION_NORMALIZED)\n            return Promise.resolve();\n        return new Promise((resolve, reject) => {\n            readyHandlers.add([resolve, reject]);\n        });\n    }\n    function markAsReady(err) {\n        if (!ready) {\n            // still not ready if an error happened\n            ready = !err;\n            setupListeners();\n            readyHandlers\n                .list()\n                .forEach(([resolve, reject]) => (err ? reject(err) : resolve()));\n            readyHandlers.reset();\n        }\n        return err;\n    }\n    // Scroll behavior\n    function handleScroll(to, from, isPush, isFirstNavigation) {\n        const { scrollBehavior } = options;\n        if (!isBrowser || !scrollBehavior)\n            return Promise.resolve();\n        const scrollPosition = (!isPush && getSavedScrollPosition(getScrollKey(to.fullPath, 0))) ||\n            ((isFirstNavigation || !isPush) &&\n                history.state &&\n                history.state.scroll) ||\n            null;\n        return nextTick()\n            .then(() => scrollBehavior(to, from, scrollPosition))\n            .then(position => position && scrollToPosition(position))\n            .catch(err => triggerError(err, to, from));\n    }\n    const go = (delta) => routerHistory.go(delta);\n    let started;\n    const installedApps = new Set();\n    const router = {\n        currentRoute,\n        listening: true,\n        addRoute,\n        removeRoute,\n        hasRoute,\n        getRoutes,\n        resolve,\n        options,\n        push,\n        replace,\n        go,\n        back: () => go(-1),\n        forward: () => go(1),\n        beforeEach: beforeGuards.add,\n        beforeResolve: beforeResolveGuards.add,\n        afterEach: afterGuards.add,\n        onError: errorListeners.add,\n        isReady,\n        install(app) {\n            const router = this;\n            app.component('RouterLink', RouterLink);\n            app.component('RouterView', RouterView);\n            app.config.globalProperties.$router = router;\n            Object.defineProperty(app.config.globalProperties, '$route', {\n                enumerable: true,\n                get: () => unref(currentRoute),\n            });\n            // this initial navigation is only necessary on client, on server it doesn't\n            // make sense because it will create an extra unnecessary navigation and could\n            // lead to problems\n            if (isBrowser &&\n                // used for the initial navigation client side to avoid pushing\n                // multiple times when the router is used in multiple apps\n                !started &&\n                currentRoute.value === START_LOCATION_NORMALIZED) {\n                // see above\n                started = true;\n                push(routerHistory.location).catch(err => {\n                    if ((process.env.NODE_ENV !== 'production'))\n                        warn('Unexpected error when starting the router:', err);\n                });\n            }\n            const reactiveRoute = {};\n            for (const key in START_LOCATION_NORMALIZED) {\n                Object.defineProperty(reactiveRoute, key, {\n                    get: () => currentRoute.value[key],\n                    enumerable: true,\n                });\n            }\n            app.provide(routerKey, router);\n            app.provide(routeLocationKey, shallowReactive(reactiveRoute));\n            app.provide(routerViewLocationKey, currentRoute);\n            const unmountApp = app.unmount;\n            installedApps.add(app);\n            app.unmount = function () {\n                installedApps.delete(app);\n                // the router is not attached to an app anymore\n                if (installedApps.size < 1) {\n                    // invalidate the current navigation\n                    pendingLocation = START_LOCATION_NORMALIZED;\n                    removeHistoryListener && removeHistoryListener();\n                    removeHistoryListener = null;\n                    currentRoute.value = START_LOCATION_NORMALIZED;\n                    started = false;\n                    ready = false;\n                }\n                unmountApp();\n            };\n            // TODO: this probably needs to be updated so it can be used by vue-termui\n            if (((process.env.NODE_ENV !== 'production') || __VUE_PROD_DEVTOOLS__) && isBrowser) {\n                addDevtools(app, router, matcher);\n            }\n        },\n    };\n    // TODO: type this as NavigationGuardReturn or similar instead of any\n    function runGuardQueue(guards) {\n        return guards.reduce((promise, guard) => promise.then(() => runWithContext(guard)), Promise.resolve());\n    }\n    return router;\n}\nfunction extractChangingRecords(to, from) {\n    const leavingRecords = [];\n    const updatingRecords = [];\n    const enteringRecords = [];\n    const len = Math.max(from.matched.length, to.matched.length);\n    for (let i = 0; i < len; i++) {\n        const recordFrom = from.matched[i];\n        if (recordFrom) {\n            if (to.matched.find(record => isSameRouteRecord(record, recordFrom)))\n                updatingRecords.push(recordFrom);\n            else\n                leavingRecords.push(recordFrom);\n        }\n        const recordTo = to.matched[i];\n        if (recordTo) {\n            // the type doesn't matter because we are comparing per reference\n            if (!from.matched.find(record => isSameRouteRecord(record, recordTo))) {\n                enteringRecords.push(recordTo);\n            }\n        }\n    }\n    return [leavingRecords, updatingRecords, enteringRecords];\n}\n\n/**\n * Returns the router instance. Equivalent to using `$router` inside\n * templates.\n */\nfunction useRouter() {\n    return inject(routerKey);\n}\n/**\n * Returns the current route location. Equivalent to using `$route` inside\n * templates.\n */\nfunction useRoute() {\n    return inject(routeLocationKey);\n}\n\nexport { NavigationFailureType, RouterLink, RouterView, START_LOCATION_NORMALIZED as START_LOCATION, createMemoryHistory, createRouter, createRouterMatcher, createWebHashHistory, createWebHistory, isNavigationFailure, loadRouteLocation, matchedRouteKey, onBeforeRouteLeave, onBeforeRouteUpdate, parseQuery, routeLocationKey, routerKey, routerViewLocationKey, stringifyQuery, useLink, useRoute, useRouter, viewDepthKey };\n"],"names":["CONSTANTS","NODE_CLIENT","NODE_ADMIN","SDK_VERSION","assert","assertion","message","assertionError","Error","stringToByteArray$1","str","out","p","i","length","c","charCodeAt","byteArrayToString","bytes","pos","c1","String","fromCharCode","c2","c3","c4","u","join","base64","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","this","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","atob","encodeByteArray","input","webSafe","Array","isArray","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","push","encodeString","btoa","decodeString","decodeStringToByteArray","charToByteMap","charAt","haveByte4","byte4","DecodeBase64StringError","constructor","name","base64Encode","utf8Bytes","base64urlEncodeWithoutPadding","replace","base64Decode","e","console","error","deepCopy","value","deepExtend","undefined","target","source","Object","Date","dateValue","getTime","prop","hasOwnProperty","isValidKey","key","getGlobal","self","window","global","getDefaultsFromGlobal","__FIREBASE_DEFAULTS__","getDefaultsFromEnvVariable","process","defaultsJsonString","JSON","parse","getDefaultsFromCookie","document","match","cookie","decoded","getDefaults","info","getDefaultEmulatorHost","productName","_a","_b","emulatorHosts","getDefaultEmulatorHostnameAndPort","host","separatorIndex","lastIndexOf","port","parseInt","substring","getDefaultAppConfig","config","Deferred","reject","resolve","promise","Promise","wrapCallback","callback","catch","createMockUserToken","token","projectId","uid","header","alg","type","project","iat","sub","user_id","payload","assign","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","signature","stringify","getUA","navigator","isMobileCordova","test","isReactNative","isNodeSdk","isIndexedDBAvailable","indexedDB","validateIndexedDBOpenable","preExist","DB_CHECK_NAME","request","open","onsuccess","result","close","deleteDatabase","onupgradeneeded","onerror","ERROR_NAME","FirebaseError","code","customData","super","setPrototypeOf","prototype","captureStackTrace","ErrorFactory","create","service","serviceName","errors","data","fullCode","template","replaceTemplate","fullMessage","PATTERN","_","jsonEval","decode","claims","parts","split","isValidFormat","isAdmin","contains","obj","call","safeGet","isEmpty","map","fn","contextObj","res","deepEqual","a","b","aKeys","keys","bKeys","k","includes","aProp","bProp","isObject","thing","querystring","querystringParams","params","entries","forEach","arrayVal","encodeURIComponent","Sha1","chain_","buf_","W_","pad_","inbuf_","total_","blockSize","reset","compress_","buf","offset","W","t","f","d","update","lengthMinusBlock","n","inbuf","digest","totalBits","j","errorPrefix","fnName","argName","stringToByteArray","high","low","stringLength","getModularInstance","_delegate","activeEffectScope","activeEffect","EffectScope","detached","_active","effects","cleanups","parent","index","scopes","active","run","currentEffectScope","on","off","stop","fromParent","l","last","pop","recordEffectScope","effect","scope","getCurrentScope","ReactiveEffect","trigger","scheduler","deps","_dirtyLevel","_trackId","_runnings","_shouldSchedule","_depsLength","dirty","pauseTracking","dep","computed","triggerComputed","resetTracking","v","lastShouldTrack","shouldTrack","lastEffect","preCleanupEffect","postCleanupEffect","onStop","effect2","cleanupDepEffect","trackId","get","delete","size","cleanup","pauseScheduleStack","trackStack","pauseScheduling","resetScheduling","queueEffectSchedulers","shift","trackEffect","debuggerEventExtraInfo","set","oldDep","triggerEffects","dirtyLevel","lastDirtyLevel","scheduleEffects","allowRecurse","createDep","Map","targetMap","WeakMap","ITERATE_KEY","Symbol","MAP_KEY_ITERATE_KEY","track","depsMap","newValue","oldValue","oldTarget","values","newLength","Number","key2","isSymbol","isIntegerKey","isMap","isNonTrackableKeys","makeMap","builtInSymbols","Set","getOwnPropertyNames","filter","arrayInstrumentations","createArrayInstrumentations","instrumentations","args","arr","toRaw","apply","BaseReactiveHandler","_isReadonly","_shallow","receiver","isReadonly2","shallow","shallowReadonlyMap","readonlyMap","shallowReactiveMap","reactiveMap","getPrototypeOf","targetIsArray","hasOwn","Reflect","has","isRef","readonly","reactive","MutableReactiveHandler","isOldValueReadonly","isReadonly","isShallow","hadKey","hasChanged","deleteProperty","ownKeys","ReadonlyReactiveHandler","mutableHandlers","readonlyHandlers","shallowReactiveHandlers","toShallow","getProto","rawTarget","rawKey","has2","wrap","toReadonly","toReactive","add","proto","get2","deleteEntry","clear","hadItems","createForEach","thisArg","observed","createIterableMethod","method","targetIsMap","isPair","iterator","isKeyOnly","innerIterator","next","done","createReadonlyMethod","createInstrumentations","mutableInstrumentations2","shallowInstrumentations2","readonlyInstrumentations2","shallowReadonlyInstrumentations2","iteratorMethods","mutableInstrumentations","readonlyInstrumentations","shallowInstrumentations","shallowReadonlyInstrumentations","createInstrumentationGetter","mutableCollectionHandlers","shallowCollectionHandlers","readonlyCollectionHandlers","targetTypeMap","rawType","getTargetType","isExtensible","toRawType","createReactiveObject","shallowReactive","baseHandlers","collectionHandlers","proxyMap","existingProxy","targetType","proxy","Proxy","isReactive","isProxy","raw","markRaw","def","ComputedRefImpl","getter","_setter","isSSR","__v_isRef","_value","triggerRefValue","_cacheable","trackRefValue","_dirty","getterOrOptions","debugOptions","setter","onlyGetter","isFunction","NOOP","cRef","ref2","newVal","r","ref","createRef","shallowRef","rawValue","RefImpl","__v_isShallow","_rawValue","useDirectValue","unref","shallowUnwrapHandlers","proxyRefs","objectWithRefs","callWithErrorHandling","instance","err","handleError","callWithAsyncErrorHandling","isPromise","throwInDev","contextVNode","vnode","cur","exposedInstance","errorInfo","errorCapturedHooks","ec","appErrorHandler","appContext","errorHandler","logError","isFlushing","isFlushPending","queue","flushIndex","pendingPostFlushCbs","activePostFlushCbs","postFlushIndex","resolvedPromise","currentFlushPromise","nextTick","then","bind","findInsertionIndex","id","start","end","middle","middleJob","middleJobId","getId","pre","queueJob","job","splice","queueFlush","flushJobs","invalidateJob","indexOf","queuePostFlushCb","cb","flushPreFlushCbs","seen","flushPostFlushCbs","deduped","sort","Infinity","comparator","diff","emit","event","rawArgs","isUnmounted","props","EMPTY_OBJ","isModelListener","startsWith","modelArg","slice","modifiersKey","number","trim","isString","looseToNumber","handlerName","handler","toHandlerKey","camelize","hyphenate","onceHandler","emitted","normalizeEmitsOptions","comp","asMixin","cache","emitsCache","cached","emits","normalized","hasExtends","extendEmits","raw2","normalizedFromExtend","extend","mixins","extends","isEmitListener","options","isOn","toLowerCase","currentRenderingInstance","currentScopeId","setCurrentRenderingInstance","prev","__scopeId","pushScopeId","popScopeId","withCtx","ctx","isNonScopedSlot","_n","renderFnWithContext","_d","setBlockTracking","prevInstance","_c","renderComponentRoot","Component","withProxy","propsOptions","slots","attrs","render","renderCache","setupState","inheritAttrs","fallthroughAttrs","shapeFlag","proxyToUse","thisProxy","normalizeVNode","render2","getFunctionalFallthrough","blockStack","createVNode","Comment","root","some","filterModelListeners","cloneVNode","dirs","concat","transition","shouldUpdateComponent","prevVNode","nextVNode","optimized","prevProps","children","prevChildren","component","nextProps","nextChildren","patchFlag","emitsOptions","$stable","hasPropsChanged","dynamicProps","nextKeys","updateHOCHostEl","el","subTree","suspense","activeBranch","COMPONENTS","resolveComponent","maybeSelfReference","resolveAsset","NULL_DYNAMIC_COMPONENT","for","warnMissing","currentInstance","selfName","getComponentName","capitalize","registry","isSuspense","__isSuspense","queueEffectWithSuspense","pendingBranch","ssrContextKey","useSSRContext","inject","INITIAL_WATCHER_VALUE","watch","doWatch","immediate","deep","flush","once","onTrack","onTrigger","_cb","unwatch","reactiveGetter","source2","traverse","forceTrigger","isMultiSource","isShallow$1","s","onCleanup","baseGetter","ssrCleanup","isInSSRComponentSetup","__watcherHandles","fill","queuePostRenderEffect","remove","instanceWatch","publicThis","createPathGetter","setCurrentInstance","path","segments","depth","currentDepth","isSet","isPlainObject","withDirectives","directives","getExposeProxy","bindings","dir","arg","modifiers","mounted","updated","invokeDirectiveHook","oldBindings","binding","hook","leaveCbKey","enterCbKey","useTransitionState","state","isMounted","isLeaving","isUnmounting","leavingVNodes","onMounted","onBeforeUnmount","TransitionHookValidator","Function","BaseTransitionPropsValidators","mode","appear","Boolean","persisted","onBeforeEnter","onEnter","onAfterEnter","onEnterCancelled","onBeforeLeave","onLeave","onAfterLeave","onLeaveCancelled","onBeforeAppear","onAppear","onAfterAppear","onAppearCancelled","BaseTransitionImpl","setup","getCurrentInstance","prevTransitionKey","default","getTransitionRawChildren","child","hasFound","rawProps","emptyPlaceholder","innerChild","getKeepAliveChild","enterHooks","resolveTransitionHooks","setTransitionHooks","oldChild","oldInnerChild","transitionKeyChanged","getTransitionKey","isSameVNodeType","leavingHooks","afterLeave","delayLeave","earlyRemove","delayedLeave","leavingVNodesCache","getLeavingNodesForType","BaseTransition","callHook","callAsyncHook","every","hook2","hooks","beforeEnter","leavingVNode","enter","afterHook","cancelHook","called","cancelled","leave","clone","vnode2","isKeepAlive","ssContent","ssFallback","keepComment","parentKey","ret","keyedFragmentCount","Fragment","defineComponent","extraOptions","isAsyncWrapper","__asyncLoader","__isKeepAlive","RegExp","matches","pattern","isRegExp","onActivated","registerKeepAliveHook","onDeactivated","wrappedHook","__wdc","current","isDeactivated","injectHook","injectToKeepAliveRoot","keepAliveRoot","injected","onUnmounted","resetShapeFlag","getInnerChild","prepend","__weh","unshift","createHook","lifecycle","onBeforeMount","onBeforeUpdate","onUpdated","onServerPrefetch","onRenderTriggered","onRenderTracked","onErrorCaptured","renderList","renderItem","from","item","getPublicInstance","isStatefulComponent","publicPropertiesMap","$","$el","$data","$props","$attrs","$slots","$refs","refs","$parent","$root","$emit","$options","resolveMergedOptions","$forceUpdate","$nextTick","$watch","hasSetupBinding","__isScriptSetup","PublicInstanceProxyHandlers","accessCache","normalizedProps","shouldCacheAccess","publicGetter","cssModule","globalProperties","__cssModules","defineProperty","descriptor","normalizePropsOrEmits","reduce","applyOptions","beforeCreate","dataOptions","computedOptions","methods","watchOptions","provide","provideOptions","injectOptions","created","beforeMount","beforeUpdate","activated","deactivated","beforeDestroy","beforeUnmount","destroyed","unmounted","renderTracked","renderTriggered","errorCaptured","serverPrefetch","expose","components","filters","checkDuplicateProperties","resolveInjections","methodHandler","opt","enumerable","configurable","createWatcher","provides","registerLifecycleHook","register","_hook","exposed","val","normalizeInject","h","base","extendsOptions","globalMixins","optionsCache","optionMergeStrategies","resolved","m","mergeOptions","to","strats","strat","internalOptionMergeStrats","mergeDataFn","mergeEmitsOrPropsOptions","mergeObjectOptions","mergeAsArray","mergeWatchOptions","mergeInject","merged","createAppContext","app","isNativeTag","NO","performance","warnHandler","compilerOptions","propsCache","uid$1","createAppAPI","hydrate","rootComponent","rootProps","context","installedPlugins","WeakSet","_uid","_component","_props","_container","_context","_instance","version","use","plugin","install","mixin","directive","mount","rootContainer","isHydrate","namespace","__vue_app__","unmount","runWithContext","currentApp","parentProvides","defaultValue","treatDefaultAsFactory","arguments","initProps","isStateful","InternalObjectKey","propsDefaults","setFullProps","updateProps","rawPrevProps","rawCurrentProps","hasAttrsChanged","kebabKey","resolvePropValue","propsToUpdate","camelizedKey","needCastKeys","rawCastValues","isReservedProp","camelKey","castValues","isAbsent","hasDefault","skipFactory","normalizePropsOptions","extendProps","EMPTY_ARR","normalizedKey","validatePropName","booleanIndex","getTypeIndex","stringIndex","getType","ctor","toString","isSameType","expectedTypes","findIndex","isInternalKey","normalizeSlotValue","normalizeSlot","rawSlot","normalizeObjectSlots","rawSlots","_ctx","normalizeVNodeSlots","initSlots","updateSlots","needDeletionCheck","deletionComparisonTarget","setRef","rawRef","oldRawRef","parentSuspense","isUnmount","refValue","owner","oldRef","_isString","_isRef","isVFor","doSet","existing","initFeatureFlags","__VUE_PROD_HYDRATION_MISMATCH_DETAILS__","getGlobalThis","createRenderer","baseCreateRenderer","createHydrationFns","__VUE__","insert","hostInsert","hostRemove","patchProp","hostPatchProp","createElement","hostCreateElement","createText","hostCreateText","createComment","hostCreateComment","setText","hostSetText","setElementText","hostSetElementText","parentNode","hostParentNode","nextSibling","hostNextSibling","setScopeId","hostSetScopeId","insertStaticContent","hostInsertStaticContent","patch","n1","n2","container","anchor","parentComponent","slotScopeIds","dynamicChildren","getNextHostNode","Text","processText","processCommentNode","Static","mountStaticNode","processFragment","processElement","processComponent","internals","moveStaticNode","removeStaticNode","mountElement","patchElement","vnodeHook","is","mountChildren","resolveChildrenNamespace","scopeId","unmountChildren","onVnodeBeforeMount","invokeVNodeHook","needCallTransitionHooks","needTransition","onVnodeMounted","parentVNode","cloneIfMounted","oldProps","newProps","toggleRecurse","onVnodeBeforeUpdate","patchBlockChildren","patchChildren","patchProps","class","style","onVnodeUpdated","oldChildren","newChildren","fallbackContainer","oldVNode","newVNode","fragmentStartAnchor","fragmentEndAnchor","fragmentSlotScopeIds","traverseStaticChildren","activate","mountComponent","updateComponent","initialVNode","createComponentInstance","renderer","setupComponent","asyncDep","registerDep","setupRenderEffect","placeholder","asyncResolved","updateComponentPreRender","componentUpdateFn","bu","nonHydratedAsyncRoot","locateNonHydratedAsyncRoot","originNext","invokeArrayFns","nextTree","prevTree","bm","isAsyncWrapperVNode","hydrateNode","hydrateSubTree","scopedInitialVNode","prevShapeFlag","patchKeyedChildren","patchUnkeyedChildren","oldLength","commonLength","Math","min","nextChild","parentAnchor","l2","e1","e2","nextPos","s1","s2","keyToNewIndexMap","patched","toBePatched","moved","maxNewIndexSoFar","newIndexToOldIndexMap","prevChild","newIndex","increasingNewIndexSequence","getSequence","nextIndex","move","moveType","needTransition2","remove2","performLeave","doRemove","deactivate","shouldInvokeDirs","shouldInvokeVnodeHook","onVnodeBeforeUnmount","unmountComponent","onVnodeUnmounted","removeFragment","performRemove","bum","um","suspenseId","pendingId","_vnode","mt","mc","pc","pbc","o","createApp","currentNamespace","encoding","allowed","ch1","ch2","len","arrI","subComponent","isTeleport","__isTeleport","currentBlock","openBlock","disableTracking","closeBlock","isBlockTreeEnabled","setupBlock","createElementBlock","createBaseVNode","isVNode","__v_isVNode","normalizeKey","normalizeRef","ref_key","ref_for","isBlockNode","needFullChildrenNormalization","__v_skip","targetAnchor","staticCount","normalizeChildren","normalize","_createVNode","cloned","isClassComponent","__vccOpts","guardReactiveProps","klass","normalizeClass","normalizeStyle","extraProps","mergeRef","mergedProps","mergeProps","ce","createTextVNode","text","flag","createStaticVNode","content","numberOfNodes","memo","slot","slotFlag","toMerge","incoming","emptyAppContext","exposeProxy","setupContext","attrsProxy","slotsProxy","bc","da","rtg","rtc","sp","internalSetCurrentInstance","setInSSRSetupState","g","registerGlobalSetter","setters","unsetCurrentInstance","compile","installWithProxy","setupResult","setupStatefulComponent","createSetupContext","resolvedResult","handleSetupResult","finishComponentSetup","__ssrInlineRender","ssrRender","skipOptions","isCustomElement","delimiters","componentCompilerOptions","finalCompilerOptions","getAttrsProxy","includeInferred","displayName","__name","computed$1","propsOrChildren","svgNS","mathmlNS","doc","templateContainer","nodeOps","insertBefore","removeChild","tag","createElementNS","multiple","setAttribute","createTextNode","node","nodeValue","textContent","querySelector","selector","before","previousSibling","lastChild","cloneNode","innerHTML","wrapper","firstChild","appendChild","TRANSITION","ANIMATION","vtcKey","Transition","resolveTransitionProps","DOMTransitionPropsValidators","css","duration","enterFromClass","enterActiveClass","enterToClass","appearFromClass","appearActiveClass","appearToClass","leaveFromClass","leaveActiveClass","leaveToClass","TransitionPropsValidators","h2","hasExplicitCallback","baseProps","durations","normalizeDuration","enterDuration","leaveDuration","finishEnter","isAppear","removeTransitionClass","finishLeave","_isLeaving","makeEnterHook","nextFrame","addTransitionClass","whenTransitionEnds","forceReflow","NumberOf","toNumber","cls","classList","_vtc","requestAnimationFrame","endId","expectedType","explicitTimeout","_endId","resolveIfNotStale","setTimeout","timeout","propCount","getTransitionInfo","endEvent","ended","removeEventListener","onEnd","addEventListener","styles","getComputedStyle","getStyleProperties","transitionDelays","transitionDurations","transitionTimeout","getTimeout","animationDelays","animationDurations","animationTimeout","max","hasTransform","delays","toMs","body","offsetHeight","patchClass","isSVG","transitionClasses","removeAttribute","className","vShowOldKey","CSS_VAR_TEXT","patchStyle","currentDisplay","display","isCssString","setStyle","cssVarText","cssText","importantRE","setProperty","prefixed","autoPrefix","prefixes","prefixCache","rawName","xlinkNS","patchAttr","removeAttributeNS","setAttributeNS","isBoolean","isSpecialBooleanAttr","includeBooleanAttr","patchDOMProp","tagName","getAttribute","needRemove","veiKey","patchEvent","prevValue","nextValue","invokers","existingInvoker","parseName","invoker","createInvoker","optionsModifierRE","cachedNow","getNow","now","initialValue","_vts","attached","patchStopImmediatePropagation","originalStop","stopImmediatePropagation","_stopped","isNativeOn","shouldSetAsProp","_trueValue","_falseValue","HTMLElement","positionMap","newPositionMap","moveCbKey","TransitionGroupImpl","moveClass","hasCSSTransform","callPendingCbs","recordPosition","movedChildren","applyTranslation","transform","webkitTransform","transitionDuration","propertyName","cssTransitionProps","getBoundingClientRect","oldPos","newPos","dx","left","dy","top","nodeType","getModelAssigner","onCompositionStart","composing","onCompositionEnd","dispatchEvent","Event","assignKey","vModelText","lazy","castToNumber","domValue","elValue","activeElement","rendererOptions","ensureRenderer","containerOrSelector","normalizeContainer","resolveRootNamespace","Element","SVGElement","MathMLElement","expectsLowerCase","toTypeString","isDate","objectToString","cacheStringFunction","hit","camelizeRE","toUpperCase","hyphenateRE","fns","parseFloat","isNaN","NaN","_globalThis","globalThis","GLOBALS_ALLOWED","isGloballyAllowed","parseStringStyle","listDelimiterRE","propertyDelimiterRE","styleCommentRE","tmp","specialBooleanAttrs","looseCompareArrays","equal","looseEqual","aValidType","bValidType","aKeysCount","bKeysCount","aHasKey","bHasKey","looseIndexOf","toDisplayString","replacer","_key","val2","stringifySymbol","description","exports","sfc","isCallable","tryToString","$TypeError","TypeError","module","argument","isPossiblePrototype","$String","isPrototypeOf","it","Prototype","toIndexedObject","toAbsoluteIndex","lengthOfArrayLike","createMethod","IS_INCLUDES","$this","fromIndex","O","DESCRIPTORS","getOwnPropertyDescriptor","SILENT_ON_NON_WRITABLE_LENGTH_SET","writable","uncurryThis","stringSlice","TO_STRING_TAG_SUPPORT","classofRaw","wellKnownSymbol","TO_STRING_TAG","$Object","CORRECT_ARGUMENTS","tryGet","callee","getOwnPropertyDescriptorModule","definePropertyModule","exceptions","createPropertyDescriptor","object","bitmap","makeBuiltIn","defineGlobalProperty","simple","unsafe","nonConfigurable","nonWritable","fails","EXISTS","MAX_SAFE_INTEGER","IndexSizeError","DOMStringSizeError","HierarchyRequestError","WrongDocumentError","InvalidCharacterError","NoDataAllowedError","NoModificationAllowedError","NotFoundError","NotSupportedError","InUseAttributeError","InvalidStateError","SyntaxError","InvalidModificationError","NamespaceError","InvalidAccessError","ValidationError","TypeMismatchError","SecurityError","NetworkError","AbortError","URLMismatchError","QuotaExceededError","TimeoutError","InvalidNodeTypeError","DataCloneError","userAgent","Deno","versions","v8","$Error","TEST","stack","V8_OR_CHAKRA_STACK_ENTRY","IS_V8_OR_CHAKRA_STACK","dropEntries","prepareStackTrace","createNonEnumerableProperty","defineBuiltIn","copyConstructorProperties","isForced","FORCED","targetProperty","sourceProperty","TARGET","GLOBAL","STATIC","stat","dontCallGetSet","forced","sham","exec","NATIVE_BIND","FunctionPrototype","getDescriptor","PROPER","CONFIGURABLE","aCallable","uncurryThisWithBind","aFunction","isNullOrUndefined","V","P","func","check","toObject","classof","propertyIsEnumerable","dummy","Wrapper","NewTarget","NewTargetPrototype","store","functionToString","inspectSource","NATIVE_WEAK_MAP","shared","sharedKey","hiddenKeys","OBJECT_ALREADY_INITIALIZED","enforce","getterFor","TYPE","metadata","facade","STATE","documentAll","all","replacement","feature","detection","POLYFILL","NATIVE","string","getBuiltIn","USE_SYMBOL_AS_UID","$Symbol","toLength","CONFIGURABLE_FUNCTION_NAME","InternalStateModule","enforceInternalState","getInternalState","CONFIGURABLE_LENGTH","TEMPLATE","arity","ceil","floor","trunc","x","$default","IE8_DOM_DEFINE","V8_PROTOTYPE_DEFINE_BUG","anObject","toPropertyKey","$defineProperty","$getOwnPropertyDescriptor","ENUMERABLE","WRITABLE","Attributes","propertyIsEnumerableModule","internalObjectKeys","enumBugKeys","getOwnPropertySymbols","names","$propertyIsEnumerable","NASHORN_BUG","uncurryThisAccessor","aPossiblePrototype","CORRECT_SETTER","__proto__","pref","valueOf","getOwnPropertyNamesModule","getOwnPropertySymbolsModule","SHARED","IS_PURE","copyright","license","V8_VERSION","symbol","toIntegerOrInfinity","integer","IndexedObject","requireObjectCoercible","getMethod","ordinaryToPrimitive","TO_PRIMITIVE","exoticToPrim","toPrimitive","postfix","random","NATIVE_SYMBOL","WellKnownSymbolsStore","createWellKnownSymbol","withoutSetter","setArrayLength","doesNotExceedSafeInteger","INCORRECT_TO_LENGTH","properErrorOnNonWritableLength","argCount","anInstance","inheritIfRequired","normalizeStringArgument","DOMExceptionConstants","clearErrorStack","DOM_EXCEPTION","NativeDOMException","$DOMException","DOMExceptionPrototype","argumentsLength","that","ERROR_HAS_STACK","DOM_EXCEPTION_HAS_STACK","BUGGY_DESCRIPTOR","FORCED_CONSTRUCTOR","DOMException","PolyfilledDOMException","PolyfilledDOMExceptionPrototype","constant","constantName","instanceOfAny","constructors","idbProxyableTypes","cursorAdvanceMethods","getIdbProxyableTypes","IDBDatabase","IDBObjectStore","IDBIndex","IDBCursor","IDBTransaction","getCursorAdvanceMethods","advance","continue","continuePrimaryKey","cursorRequestMap","transactionDoneMap","transactionStoreNamesMap","transformCache","reverseTransformCache","promisifyRequest","unlisten","success","cacheDonePromiseForTransaction","tx","complete","idbProxyTraps","objectStoreNames","objectStore","replaceTraps","wrapFunction","transaction","unwrap","storeNames","transformCachableValue","IDBRequest","openDB","blocked","upgrade","blocking","terminated","openPromise","oldVersion","newVersion","db","readMethods","writeMethods","cachedMethods","targetFuncName","useIndex","isWrite","async","storeName","oldTraps","PlatformLoggerServiceImpl","getPlatformInfoString","providers","getProviders","provider","isVersionServiceProvider","getImmediate","library","logString","getComponent","logger","Logger","DEFAULT_ENTRY_NAME","PLATFORM_LOG_STRING","name$p","name$o","name$m","name$n","name$k","name$l","name$j","name$i","name$h","name$g","name$f","name$e","name$d","name$c","name$b","name$a","name$9","name$8","name$7","name$6","name$5","name$4","name$3","name$1","name$2","_apps","_serverApps","_components","_addComponent","addComponent","debug","_registerComponent","componentName","serverApp","_getProvider","heartbeatController","getProvider","optional","triggerHeartbeat","ERRORS","ERROR_FACTORY","FirebaseAppImpl","_isDeleted","_options","_config","_name","_automaticDataCollectionEnabled","automaticDataCollectionEnabled","checkDestroyed","isDeleted","appName","initializeApp","rawConfig","existingApp","ComponentContainer","newApp","getApp","registerVersion","libraryKeyOrName","variant","libraryMismatch","versionMismatch","warning","warn","DB_NAME","DB_VERSION","STORE_NAME","dbPromise","getDbPromise","createObjectStore","originalErrorMessage","readHeartbeatsFromIndexedDB","computeKey","idbGetError","writeHeartbeatsToIndexedDB","heartbeatObject","put","appId","MAX_HEADER_BYTES","STORED_HEARTBEAT_RETENTION_MAX_MILLIS","HeartbeatServiceImpl","_heartbeatsCache","_storage","HeartbeatStorageImpl","_heartbeatsCachePromise","read","platformLogger","agent","date","getUTCDateString","heartbeats","lastSentHeartbeatDate","singleDateHeartbeat","hbTimestamp","overwrite","getHeartbeatsHeader","heartbeatsToSend","unsentEntries","extractHeartbeatsForHeader","headerString","today","toISOString","heartbeatsCache","maxSize","heartbeatEntry","find","hb","dates","countBytes","_canUseIndexedDBPromise","runIndexedDBEnvironmentCheck","canUseIndexedDB","idbHeartbeatObject","heartbeatsObject","existingHeartbeatsObject","registerCoreComponents","version$1","instanceFactory","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","setMultipleInstances","setServiceProps","setInstanceCreatedCallback","Provider","instances","instancesDeferred","instancesOptions","onInitCallbacks","identifier","normalizedIdentifier","normalizeInstanceIdentifier","deferred","isInitialized","shouldAutoInitialize","getOrInitializeService","instanceIdentifier","setComponent","isComponentEager","instanceDeferred","clearInstance","services","INTERNAL","_delete","isComponentSet","getOptions","initialize","opts","normalizedDeferredIdentifier","onInit","existingCallbacks","existingInstance","invokeOnInitCallbacks","callbacks","normalizeIdentifierForFactory","addOrOverwriteComponent","LogLevel","levelStringToEnum","DEBUG","VERBOSE","INFO","WARN","ERROR","SILENT","defaultLogLevel","ConsoleMethod","defaultLogHandler","logType","logLevel","_logLevel","_logHandler","_userLogHandler","setLogLevel","logHandler","userLogHandler","log","setSDKVersion","DOMStorageWrapper","domStorage_","prefix_","removeItem","prefixedName_","setItem","storedVal","getItem","MemoryStorage","cache_","isInMemoryStorage","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","LUIDGenerator","sha1","sha1Bytes","buildLogMessage_","varArgs","firstLog_","enableLogging$1","logger_","persistent","logWrapper","prefix","fatal","warnIfPageIsSecure","location","protocol","isInvalidJSONNumber","POSITIVE_INFINITY","NEGATIVE_INFINITY","executeWhenDOMReady","readyState","wrappedFn","attachEvent","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","splitStringBySize","segsize","dataSegs","each","doubleToIEEE754String","ebits","fbits","bias","ln","abs","pow","LN2","round","bits","reverse","hexByteString","hexByte","substr","isChromeExtensionContentScript","href","isWindowsStoreApp","Windows","UI","errorForServerCode","query","reason","_path","INTEGER_REGEXP_","INTEGER_32_MIN","INTEGER_32_MAX","intVal","exceptionGuard","beingCrawled","search","setTimeoutNonBlocking","time","unrefTimer","AppCheckTokenProvider","appName_","appCheckProvider","appCheck","getToken","forceRefresh","addTokenChangeListener","listener","addTokenListener","notifyForInvalidToken","FirebaseAuthTokenProvider","firebaseOptions_","authProvider_","auth_","auth","addAuthTokenListener","removeTokenChangeListener","removeAuthTokenListener","errorMessage","EmulatorTokenProvider","accessToken","OWNER","PROTOCOL_VERSION","VERSION_PARAM","TRANSPORT_SESSION_PARAM","REFERER_PARAM","FORGE_REF","FORGE_DOMAIN_RE","LAST_SESSION_PARAM","APPLICATION_ID_PARAM","APP_CHECK_TOKEN_PARAM","WEBSOCKET","LONG_POLLING","RepoInfo","secure","webSocketOnly","nodeAdmin","persistenceKey","includeNamespaceInQueryParams","isUsingEmulator","_host","_domain","internalHost","isCacheableHost","isCustomHost","newHost","toURLString","repoInfoNeedsQueryParam","repoInfo","repoInfoConnectionURL","connURL","pairs","StatsCollection","counters_","incrementCounter","amount","collections","reporters","statsManagerGetCollection","hashString","statsManagerGetOrCreateReporter","creatorFunction","PacketReceiver","onMessage_","pendingResponses","currentResponseNum","closeAfterResponse","onClose","closeAfter","responseNum","handleResponse","requestNum","toProcess","FIREBASE_LONGPOLL_START_PARAM","FIREBASE_LONGPOLL_CLOSE_COMMAND","FIREBASE_LONGPOLL_COMMAND_CB_NAME","FIREBASE_LONGPOLL_DATA_CB_NAME","FIREBASE_LONGPOLL_ID_PARAM","FIREBASE_LONGPOLL_PW_PARAM","FIREBASE_LONGPOLL_SERIAL_PARAM","FIREBASE_LONGPOLL_CALLBACK_ID_PARAM","FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM","FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET","FIREBASE_LONGPOLL_DATA_PARAM","FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM","MAX_URL_DATA_SIZE","SEG_HEADER_SIZE","MAX_PAYLOAD_SIZE","KEEPALIVE_REQUEST_INTERVAL","LP_CONNECT_TIMEOUT","BrowserPollConnection","connId","applicationId","appCheckToken","authToken","transportSessionId","lastSessionId","bytesSent","bytesReceived","everConnected_","log_","stats_","urlFn","onMessage","onDisconnect","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","onClosed_","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","arg3","arg4","incrementIncomingBytes_","clearTimeout","password","sendNewPolls","pN","urlParams","uniqueCallbackIdentifier","hostname","connectURL","addTag","startLongPoll","addDisconnectPingFrame","forceAllow","forceAllow_","forceDisallow","forceDisallow_","isAvailable","markConnectionHealthy","shutdown_","myDisconnFrame","send","dataStr","base64data","enqueueSegment","pw","src","commandCB","onMessageCB","outstandingRequests","pendingSegs","currentSerial","myIFrame","createIFrame_","script","currentDomain","domain","iframeContents","write","iframe","contentWindow","contentDocument","alive","myID","myPW","newRequest_","theURL","curDataString","nextSeg","theSeg","seg","ts","addLongPollTag_","segnum","totalsegs","url","serial","doNewRequest","keepaliveTimeout","readyStateCB","loadCB","doNodeLongPoll","newScript","onload","onreadystatechange","rstate","WEBSOCKET_MAX_FRAME_SIZE","WEBSOCKET_KEEPALIVE_INTERVAL","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","keepaliveTimer","frames","totalFrames","connectionURL_","device","headers","platform","env","origin","mySock","onopen","onclose","onmessage","handleIncomingFrame","isOldAndroid","oldAndroidRegex","oldAndroidMatch","previouslyFailed","appendFrame_","fullMess","jsonMess","handleNewFrameCount_","frameCount","extractFrameCount_","mess","resetKeepAlive","remainingData","sendString_","clearInterval","setInterval","responsesRequiredToBeHealthy","healthyTimeout","TransportManager","initTransports_","ALL_TRANSPORTS","IS_TRANSPORT_INITIALIZED","globalTransportInitialized_","isWebSocketsAvailable","isSkipPollConnection","transports_","transports","transport","initialTransport","upgradeTransport","UPGRADE_TIMEOUT","DELAY_BEFORE_SENDING_EXTRA_REQUESTS","BYTES_SENT_HEALTHY_OVERRIDE","BYTES_RECEIVED_HEALTHY_OVERRIDE","MESSAGE_TYPE","MESSAGE_DATA","CONTROL_SHUTDOWN","CONTROL_RESET","CONTROL_ERROR","CONTROL_PONG","SWITCH_ACK","END_TRANSMISSION","PING","SERVER_HELLO","Connection","repoInfo_","applicationId_","appCheckToken_","authToken_","onReady_","onKill_","connectionCount","pendingDataMessages","state_","transportManager_","start_","conn","conn_","nextTransportId_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","healthyTimeoutMS","healthyTimeout_","everConnected","onConnectionLost_","onSecondaryConnectionLost_","onPrimaryMessageReceived_","onSecondaryMessageReceived_","sendRequest","dataMsg","msg","sendData_","tryCleanupConnection","onSecondaryControl_","controlData","cmd","upgradeIfSecondaryHealthy_","secondaryResponsesRequired_","parsedData","layer","proceedWithUpgrade_","onControl_","onDataMessage_","onPrimaryResponse_","handshakePayload","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","sessionId","onConnectionEstablished_","tryStartUpgrade_","startUpgrade_","closeConnections_","ServerActions","pathString","onComplete","hash","merge","refreshAuthToken","refreshAppCheckToken","onDisconnectPut","onDisconnectMerge","onDisconnectCancel","reportStats","stats","EventEmitter","allowedEvents_","listeners_","eventType","listeners","validateEventType_","eventData","getInitialEvent","et","OnlineMonitor","online_","getInstance","currentlyOnline","MAX_PATH_DEPTH","MAX_PATH_LENGTH_BYTES","Path","pathOrString","pieceNum","pieces_","copyTo","pieceNum_","newEmptyPath","pathGetFront","pathGetLength","pathPopFront","pathGetBack","pathToUrlEncodedString","pathSlice","begin","pathParent","pieces","pathChild","childPathObj","childPieces","pathIsEmpty","newRelativePath","outerPath","innerPath","outer","inner","pathCompare","right","leftKeys","rightKeys","cmp","pathEquals","other","pathContains","ValidationPath","errorPrefix_","parts_","byteLength_","validationPathCheckValid","validationPathPush","validationPath","validationPathPop","validationPathToErrorString","VisibilityMonitor","hidden","visibilityChange","visible_","visible","RECONNECT_MIN_DELAY","RECONNECT_MAX_DELAY_DEFAULT","RECONNECT_MAX_DELAY_FOR_ADMINS","RECONNECT_DELAY_MULTIPLIER","RECONNECT_DELAY_RESET_TIMEOUT","SERVER_KILL_INTERRUPT_REASON","INVALID_TOKEN_THRESHOLD","PersistentConnection","onDataUpdate_","onConnectStatus_","onServerInfoUpdate_","authTokenProvider_","appCheckTokenProvider_","authOverride_","nextPersistentConnectionId_","interruptReasons_","listens","outstandingPuts_","outstandingGets_","outstandingPutCount_","outstandingGetCount_","onDisconnectRequestQueue_","connected_","reconnectDelay_","maxReconnectDelay_","securityDebugCallback_","establishConnectionTimer_","requestCBHash_","requestNumber_","realtime_","forceTokenRefresh_","invalidAuthTokenCount_","invalidAppCheckTokenCount_","firstConnection_","lastConnectionAttemptTime_","lastConnectionEstablishedTime_","onVisible_","onOnline_","action","onResponse","curReqNum","initConnection_","q","_queryObject","outstandingGet","sendGet_","listen","currentHashFn","queryId","_queryIdentifier","_queryParams","isDefault","loadsAllData","listenSpec","hashFn","sendListen_","req","status","warnOnListenWarnings_","currentListenSpec","removeListen_","warnings","indexSpec","getIndex","indexPath","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","isFirebaseSecret","tryAppCheck","authMethod","requestData","cred","onAuthRevoked_","onAppCheckRevoked_","sendUnlisten_","queryObj","sendOnDisconnect_","response","putInternal","sendPut_","queued","errorReason","reqNum","onDataPush_","onListenRevoked_","onSecurityDebugPacket_","handleTimestamp_","sendConnectStats_","restoreState_","scheduleConnect_","establishConnection_","online","onRealtimeDisconnect_","cancelSentTransactions_","shouldReconnect_","timeSinceLastConnectSucceeded","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage","onReady","nextConnectionId_","canceled","connection","closeFn","sendRequestFn","interrupt","resume","delta","serverTimeOffset","normalizedPathString","statusCode","explanation","queries","clientName","NamedNode","Wrap","Index","getCompare","compare","indexedValueChanged","oldNode","newNode","oldWrapped","newWrapped","minPost","MIN","__EMPTY_NODE","KeyIndex","isDefinedOn","maxPost","makePost","indexValue","KEY_INDEX","SortedMapIterator","startKey","isReverse_","resultGenerator_","nodeStack_","getNext","hasNext","peek","LLRBNode","color","RED","SortedMap","EMPTY_NODE","copy","count","inorderTraversal","reverseTraversal","min_","minKey","maxKey","fixUp_","removeMin_","isRed_","moveRedLeft_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","checkMaxDepth_","blackDepth","check_","BLACK","LLRBEmptyNode","comparator_","root_","getPredecessorKey","rightParent","getIterator","resultGenerator","getIteratorFrom","getReverseIteratorFrom","getReverseIterator","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","MAX_NODE$2","setMaxNode$1","priorityHashText","priority","validatePriorityNode","priorityNode","isLeafNode","getPriority","__childrenNodeConstructor","nodeFromJSON$1","MAX_NODE$1","LeafNode","value_","priorityNode_","lazyHash_","updatePriority","newPriorityNode","getImmediateChild","childName","getChild","hasChild","getPredecessorChildName","childNode","updateImmediateChild","newChildNode","updateChild","front","numChildren","forEachChild","exportFormat","getValue","toHash","compareTo","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","withIndex","isIndexed","equals","setNodeFromJSON","setMaxNode","PriorityIndex","aPriority","bPriority","indexCmp","PRIORITY_INDEX","LOG_2","Base12Num","logBase2","num","bitMask","current_","mask","bits_","nextBitIsOne","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","namedNode","buildFrom12Array","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","_defaultIndexMap","fallbackObject","IndexMap","indexes_","indexSet_","Default","indexKey","sortedMap","hasIndex","indexDefinition","addIndex","existingChildren","sawIndexedValue","iter","indexName","newIndexSet","newIndexes","addToIndexes","indexedChildren","existingSnap","removeFromIndexes","ChildrenNode","children_","indexMap_","newIndexMap","newPriority","newImmediateChild","numKeys","allIntegerKeys","array","childHash","idx","resolveIndex_","predecessor","getFirstChildName","getFirstChild","getLastChildName","getLastChild","wrappedNode","startPost","endPost","MAX_NODE","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","defineProperties","MAX","USE_HINZE","nodeFromJSON","json","jsonLeaf","childData","childrenHavePriority","hinzeJsonObj","childSet","sortedChildSet","PathIndex","indexPath_","extractChild","snap","aChild","bChild","valueNode","ValueIndex","VALUE_INDEX","changeValue","snapshotNode","changeChildAdded","changeChildRemoved","changeChildChanged","oldSnap","changeChildMoved","IndexedFilter","index_","newChild","affectedPath","optChangeAccumulator","trackChildChange","updateFullNode","newSnap","filtersNodes","getIndexedFilter","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","startIsInclusive_","startAfterSet_","endIsInclusive_","endBeforeSet_","getStartPost","getEndPost","isWithinStart","isWithinEnd","filtered","hasStart","startName","getIndexStartName","getIndexStartValue","hasEnd","endName","getIndexEndName","getIndexEndValue","LimitedFilter","withinDirectionalStart","reverse_","withinEndPost","withinStartPost","withinDirectionalEnd","compareRes","rangedFilter_","limit_","getLimit","isViewFromLeft","fullLimitUpdateChild_","inRange","childKey","childSnap","changeAccumulator","oldEventCache","newChildNamedNode","windowBoundary","oldChildSnap","getChildAfterChild","compareNext","remainsInWindow","newEventCache","nextChildInRange","QueryParams","limitSet_","startSet_","startNameSet_","endSet_","endNameSet_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","hasLimit","hasAnchoredLimit","queryParamsGetNodeFilter","queryParams","queryParamsToRestQueryStringParameters","qs","orderBy","startParam","endParam","queryParamsGetQueryObject","viewFrom","ReadonlyRestClient","listens_","getListenId_","listenId","thisListen","queryStringParameters","restRequest_","xhr","XMLHttpRequest","responseText","SnapshotHolder","rootNode_","getNode","updateSnapshot","newSnapshotNode","newSparseSnapshotTree","sparseSnapshotTreeRemember","sparseSnapshotTree","sparseSnapshotTreeForEachTree","prefixPath","sparseSnapshotTreeForEachChild","tree","StatsListener","collection_","last_","newStats","FIRST_STATS_MIN_TIME","FIRST_STATS_MAX_TIME","REPORT_STATS_INTERVAL","StatsReporter","collection","server_","statsToReport_","statsListener_","reportStats_","reportedStats","haveStatsToReport","OperationType","newOperationSourceUser","fromUser","fromServer","tagged","newOperationSourceServer","newOperationSourceServerTaggedQuery","AckUserWrite","affectedTree","revert","ACK_USER_WRITE","operationForChild","subtree","ListenComplete","LISTEN_COMPLETE","Overwrite","OVERWRITE","Merge","MERGE","CacheNode","node_","fullyInitialized_","filtered_","isFullyInitialized","isFiltered","isCompleteForPath","isCompleteForChild","EventGenerator","query_","eventGeneratorGenerateEventsForChanges","eventGenerator","changes","eventCache","eventRegistrations","events","moves","change","eventGeneratorGenerateEventsForType","registrations","filteredChanges","eventGeneratorCompareChanges","materializedChange","eventGeneratorMaterializeSingleChange","registration","respondsTo","createEvent","prevName","aWrapped","bWrapped","newViewCache","serverCache","viewCacheUpdateEventSnap","viewCache","eventSnap","viewCacheUpdateServerSnap","serverSnap","viewCacheGetCompleteEventSnap","viewCacheGetCompleteServerSnap","emptyChildrenSingleton","EmptyChildren","ImmutableTree","fromObject","childPath","findRootMostMatchingPathAndValue","relativePath","predicate","childExistingPathAndValue","fullPath","findRootMostValueAndPath","toSet","setTree","newTree","fold","fold_","pathSoFar","accum","findOnPath","findOnPath_","pathToFollow","foreachOnPath","foreachOnPath_","currentRelativePath","foreach","foreach_","foreachChild","CompoundWrite","writeTree_","empty","compoundWriteAddWrite","compoundWrite","rootmost","rootMostPath","newWriteTree","compoundWriteAddWrites","updates","newWrite","compoundWriteRemoveWrite","compoundWriteHasCompleteWrite","compoundWriteGetCompleteNode","compoundWriteGetCompleteChildren","compoundWriteChildCompoundWrite","shadowingNode","compoundWriteIsEmpty","compoundWriteApply","applySubtreeWrite","writeTree","priorityWrite","writeTreeChildWrites","newWriteTreeRef","writeTreeAddOverwrite","writeId","lastWriteId","allWrites","visibleWrites","writeTreeAddMerge","changedChildren","writeTreeGetWrite","record","writeTreeRemoveWrite","writeToRemove","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","writeTreeRecordContainsPath_","writeTreeResetTree_","writeRecord","writeTreeLayerTree_","writeTreeDefaultFilter_","writes","treeRoot","writePath","deepNode","writeTreeCalcCompleteEventCache","treePath","completeServerCache","writeIdsToExclude","includeHiddenWrites","mergeAtPath","layeredCache","subMerge","writeTreeCalcCompleteEventChildren","completeServerChildren","completeChildren","topLevelSet","writeTreeCalcEventCacheAfterServerOverwrite","existingEventSnap","existingServerSnap","childMerge","writeTreeCalcCompleteChild","writeTreeShadowingWrite","writeTreeCalcIndexedSlice","completeServerData","toIterate","nodes","writeTreeRefCalcCompleteEventCache","writeTreeRef","writeTreeRefCalcCompleteEventChildren","writeTreeRefCalcEventCacheAfterServerOverwrite","writeTreeRefShadowingWrite","writeTreeRefCalcIndexedSlice","writeTreeRefCalcCompleteChild","existingServerCache","writeTreeRefChild","ChildChangeAccumulator","changeMap","oldChange","oldType","getChanges","NoCompleteChildSource_","getCompleteChild","NO_COMPLETE_CHILD_SOURCE","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","newViewProcessor","viewProcessorAssertIndexed","viewProcessor","viewProcessorApplyOperation","oldViewCache","operation","writesCache","completeCache","accumulator","filterServerNode","viewProcessorApplyUserOverwrite","viewProcessorApplyServerOverwrite","viewProcessorApplyUserMerge","viewProcessorApplyServerMerge","ackUserWrite","viewProcessorRevertUserWrite","viewProcessorAckUserWrite","viewProcessorListenComplete","viewProcessorMaybeAddValueEvent","isLeafOrEmpty","oldCompleteSnap","viewProcessorGenerateEventCacheAfterServerEvent","changePath","oldEventSnap","completeEventChildren","completeNode","oldEventNode","updatedPriority","childChangePath","newEventChild","eventChildUpdate","changedSnap","oldServerSnap","newServerCache","serverFilter","newServerNode","newEventSnap","viewProcessorCacheHasChild","curViewCache","viewProcessorApplyMerge","viewMergeTree","serverChild","childMergeTree","isUnknownDeepMerge","ackPath","mergePath","serverCachePath","oldServerNode","serverChildren","View","initialViewCache","eventRegistrations_","indexFilter","processor_","initialServerCache","initialEventCache","eventGenerator_","viewGetServerCache","view","viewGetCompleteNode","viewGetCompleteServerCache","viewIsEmpty","viewAddEventRegistration","eventRegistration","viewRemoveEventRegistration","cancelError","cancelEvents","maybeEvent","createCancelEvent","remaining","hasAnyCallback","viewApplyOperation","viewGenerateEventsForChanges_","viewGetInitialEvents","initialChanges","eventNode","referenceConstructor$1","referenceConstructor","SyncPoint","views","syncPointSetReferenceConstructor","syncPointGetReferenceConstructor","syncPointIsEmpty","syncPoint","syncPointApplyOperation","optCompleteServerCache","syncPointGetView","serverCacheComplete","eventCacheComplete","syncPointAddEventRegistration","syncPointRemoveEventRegistration","removed","hadCompleteView","syncPointHasCompleteView","viewQueryId","_repo","syncPointGetQueryViews","syncPointGetCompleteServerCache","syncPointViewForQuery","syncPointGetCompleteView","syncPointViewExistsForQuery","syncTreeSetReferenceConstructor","syncTreeGetReferenceConstructor","syncTreeNextQueryTag_","SyncTree","listenProvider_","syncPointTree_","pendingWriteTree_","tagToQueryMap","queryToTagMap","syncTreeApplyUserOverwrite","syncTree","newData","syncTreeApplyOperationToSyncPoints_","syncTreeApplyUserMerge","changeTree","syncTreeAckUserWrite","needToReevaluate","syncTreeApplyServerOverwrite","syncTreeApplyServerMerge","syncTreeApplyListenComplete","syncTreeApplyTaggedListenComplete","queryKey","syncTreeQueryKeyForTag_","syncTreeParseQueryKey_","queryPath","op","syncTreeApplyTaggedOperation_","syncTreeRemoveEventRegistration","skipListenerDedup","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","syncTreeCollectDistinctViewsForSubTree_","newQuery","syncTreeCreateListenerForView_","startListening","syncTreeQueryForListening_","syncTreeTagForQuery","defaultTag","stopListening","queryToRemove","tagToRemove","syncTreeMakeQueryKey_","syncTreeRemoveTags_","syncTreeApplyTaggedQueryOverwrite","syncTreeApplyTaggedQueryMerge","syncTreeAddEventRegistration","skipSetupListener","foundAncestorDefaultView","pathToSyncPoint","childSyncPoint","viewAlreadyExists","syncTreeGetNextQueryTag_","syncTreeSetupListener_","syncTreeCalcCompleteEventCache","includeHiddenSets","syncTreeGetServerValue","serverCacheNode","syncTreeApplyOperationHelper_","syncPointTree","syncTreeApplyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","splitIndex","maybeChildSyncPoint","childMap","completeView","childViews","removedQuery","removedQueryKey","removedQueryTag","queriesToStop","childQueries","queryToStop","ExistingValueProvider","DeferredValueProvider","syncTree_","path_","generateWithValues","resolveDeferredLeafValue","existingVal","serverValues","resolveScalarDeferredValue","resolveComplexDeferredValue","unused","existingNode","leaf","resolveDeferredValueTree","resolveDeferredValue","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","Tree","childCount","treeSubTree","pathObj","treeGetValue","treeSetValue","treeUpdateParents","treeHasChildren","treeIsEmpty","treeForEachChild","treeForEachDescendant","includeSelf","childrenFirst","treeForEachAncestor","treeGetPath","treeUpdateChild","childEmpty","childExists","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","MAX_LEAF_SIZE_","isValidPathString","isValidRootPathString","isValidPriority","validateFirebaseData","hasDotValue","hasActualChild","validateFirebaseMergePaths","mergePaths","curPath","prevPath","validateFirebaseMergeDataArg","errorPrefix$1","validatePathString","argumentName","validateRootPathString","validateUrl","parsedUrl","EventQueue","eventLists_","recursionDepth_","eventQueueQueueEvents","eventQueue","eventDataList","currList","getPath","eventQueueRaiseEventsForChangedPath","changedPath","eventQueueRaiseQueuedEventsMatchingPredicate","eventPath","sentAll","eventList","eventListRaise","eventFn","getEventRunner","INTERRUPT_REASON","MAX_TRANSACTION_RETRIES","Repo","forceRestClient_","appCheckProvider_","dataUpdateCount","eventQueue_","nextWriteId_","interceptServerDataCallback_","transactionQueueTree_","persistentConnection_","repoStart","repo","authOverride","isMerge","repoOnDataUpdate","repoOnConnectStatus","connectStatus","repoOnServerInfoUpdate","statsReporter_","infoData_","infoSyncTree_","infoEvents","repoUpdateInfo","serverSyncTree_","repoServerTime","offsetNode","repoGenerateServerValues","taggedChildren","taggedSnap","repoRerunTransactions","repoRunOnDisconnectEvents","repoGetNextWriteId","repoGetValue","repoLog","repoUpdate","childrenToMerge","changedKey","changedValue","repoCallOnCompleteCallback","clearEvents","repoAbortTransactions","resolvedOnDisconnectTree","repoInterrupt","repoGetLatestState","excludeSets","repoSendReadyTransactions","repoPruneCompletedTransactionsBelowNode","repoBuildTransactionQueue","allRun","repoSendTransactionQueue","setsToIgnore","txn","currentWriteId","latestState","snapToSend","latestHash","retryCount","currentOutputSnapshotRaw","dataToSend","pathToSend","currentOutputSnapshotResolved","unwatcher","abortReason","rootMostTransactionNode","repoGetAncestorTransactionNode","repoRerunTransactionQueue","txnsToRerun","abortTransaction","currentNode","currentInputSnapshot","newDataNode","hasExplicitPriority","oldWriteId","newNodeResolved","applyLocally","transactionNode","transactionQueue","repoAggregateTransactionQueuesForNode","order","nodeQueue","repoAbortTransactionsOnNode","lastSent","decodePath","pathStringDecoded","piece","decodeURIComponent","decodeQuery","queryString","results","segment","kv","parseRepoInfo","dataURL","parseDatabaseURL","scheme","subdomain","colonInd","slashInd","questionMarkInd","hostWithoutPort","dotInd","PUSH_CHARS","lastPushTime","lastRandChars","DataEvent","snapshot","getEventType","exportVal","CancelEvent","CallbackContext","snapshotCallback","cancelCallback","onValue","expDataSnapshot","previousChildName","onCancel","hasCancelCallback","userCallback","QueryImpl","_orderByCalled","ReferenceImpl","isEqual","sameRepo","samePath","sameQueryIdentifier","toJSON","parentPath","DataSnapshot","_node","_index","childRef","exists","hasChildren","_checkNotDeleted","_root","callbackContext","ValueEventRegistration","FIREBASE_DATABASE_EMULATOR_HOST_VAR","repos","useRestClient","repoManagerApplyEmulatorSettings","tokenProvider","repoManagerDatabaseFromApp","authProvider","dbUrl","databaseURL","isEmulator","dbEmulatorHost","authTokenProvider","repoManagerCreateRepo","Database","repoManagerDeleteRepo","appRepos","_repoInternal","_instanceStarted","_rootInternal","apiName","getDatabase","emulator","connectDatabaseEmulator","mockUserToken","registerDatabase","SDK_VERSION$1","simpleListen","echo","onEcho","defaultConverter","init","converter","defaultAttributes","attributes","expires","toUTCString","escape","stringifiedAttributes","attributeName","cookies","jar","found","withAttributes","withConverter","freeze","isBrowser","isESModule","__esModule","toStringTag","applyToParams","newParams","noop","TRAILING_SLASH_RE","removeTrailingSlash","parseURL","parseQuery","currentLocation","searchString","hashPos","searchPos","resolveRelativePath","stringifyURL","stringifyQuery","stripBase","pathname","isSameRouteLocation","aLastIndex","matched","bLastIndex","isSameRouteRecord","isSameRouteLocationParams","aliasOf","isSameRouteLocationParamsValue","isEquivalentArray","fromSegments","toSegments","lastToSegment","toPosition","position","NavigationType","NavigationDirection","normalizeBase","baseEl","BEFORE_HASH_RE","createHref","getElementPosition","docRect","documentElement","elRect","behavior","computeScrollPosition","pageXOffset","pageYOffset","scrollToPosition","scrollToOptions","positionEl","isIdSelector","getElementById","scrollTo","getScrollKey","history","scrollPositions","saveScrollPosition","scrollPosition","getSavedScrollPosition","scroll","createBaseLocation","createCurrentLocation","slicePos","pathFromHash","useHistoryListeners","historyState","teardowns","pauseState","popStateHandler","fromState","direction","forward","back","unknown","pauseListeners","teardown","beforeUnloadListener","replaceState","destroy","passive","buildState","replaced","computeScroll","useHistoryStateNavigation","changeLocation","hashIndex","currentState","createWebHistory","historyNavigation","historyListeners","go","triggerListeners","routerHistory","isRouteLocation","route","isRouteName","START_LOCATION_NORMALIZED","meta","redirectedFrom","NavigationFailureSymbol","NavigationFailureType","createRouterError","isNavigationFailure","BASE_PARAM_PATTERN","BASE_PATH_PARSER_OPTIONS","sensitive","strict","REGEX_CHARS_RE","tokensToParser","score","segmentScores","tokenIndex","subSegmentScore","repeatable","regexp","re","subPattern","avoidDuplicatedSlash","endsWith","param","compareScoreArray","comparePathParserScore","aScore","bScore","isLastScoreNegative","ROOT_TOKEN","VALID_PARAM_RE","tokenizePath","crash","buffer","previousState","tokens","finalizeSegment","char","customRe","consumeBuffer","addCharToBuffer","createRouteRecordMatcher","parser","matcher","alias","createRouterMatcher","routes","globalOptions","matchers","matcherMap","getRecordMatcher","addRoute","originalRecord","isRootAdd","mainNormalizedRecord","normalizeRouteRecord","normalizedRecords","aliases","originalMatcher","normalizedRecord","connectingSlash","isAliasRecord","removeRoute","redirect","insertMatcher","matcherRef","getRoutes","isRecordChildOf","paramsFromLocation","parentMatcher","mergeMetaFields","normalizeRecordProps","leaveGuards","updateGuards","enterCallbacks","propsObject","defaults","partialOptions","HASH_RE","AMPERSAND_RE","SLASH_RE","EQUAL_RE","IM_RE","PLUS_RE","ENC_BRACKET_OPEN_RE","ENC_BRACKET_CLOSE_RE","ENC_CARET_RE","ENC_BACKTICK_RE","ENC_CURLY_OPEN_RE","ENC_PIPE_RE","ENC_CURLY_CLOSE_RE","ENC_SPACE_RE","commonEncode","encodeURI","encodeHash","encodeQueryValue","encodeQueryKey","encodePath","encodeParam","hasLeadingIM","searchParams","searchParam","eqPos","currentValue","normalizeQuery","normalizedQuery","matchedRouteKey","viewDepthKey","routerKey","routeLocationKey","routerViewLocationKey","useCallbacks","handlers","list","guardToPromiseFn","guard","enterCallbackArray","valid","guardReturn","guardCall","extractComponentsGuards","guardType","guards","rawComponent","isRouteComponent","componentPromise","resolvedComponent","useLink","router","currentRoute","activeRecordIndex","routeMatched","currentMatched","parentRecordPath","getOriginalPath","isActive","includesParams","isExactActive","navigate","guardEvent","RouterLinkImpl","compatConfig","MODE","required","activeClass","exactActiveClass","custom","ariaCurrentValue","link","elClass","getLinkClass","linkActiveClass","linkExactActiveClass","onClick","RouterLink","metaKey","altKey","ctrlKey","shiftKey","defaultPrevented","button","currentTarget","preventDefault","innerValue","outerValue","propClass","globalClass","defaultClass","RouterViewImpl","injectedRoute","routeToDisplay","injectedDepth","initialDepth","matchedRoute","matchedRouteRef","viewRef","oldInstance","oldName","currentName","ViewComponent","routePropsOption","routeProps","slotContent","RouterView","createRouter","parseQuery$1","stringifyQuery$1","beforeGuards","beforeResolveGuards","afterGuards","pendingLocation","scrollBehavior","scrollRestoration","normalizeParams","paramValue","encodeParams","decodeParams","parentOrRoute","recordMatcher","routeMatcher","hasRoute","rawLocation","locationNormalized","matcherLocation","targetParams","locationAsObject","checkCanceledNavigation","pushWithRedirect","handleRedirectRecord","lastMatched","newTargetLocation","targetLocation","force","shouldRedirect","toLocation","failure","handleScroll","markAsReady","triggerError","finalizeNavigation","triggerAfterEach","checkCanceledNavigationAndReject","installedApps","leavingRecords","updatingRecords","enteringRecords","extractChangingRecords","canceledNavigationCheck","runGuardQueue","isPush","isFirstNavigation","removeHistoryListener","setupListeners","_from","listening","ready","readyHandlers","errorListeners","isReady","started","beforeEach","beforeResolve","afterEach","onError","$router","reactiveRoute","unmountApp","recordFrom","recordTo"],"sourceRoot":""}